DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Header

Mercurial (1aeaa33a64f9)

VCS Links

Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
// vim:cindent:ts=8:et:sw=4:
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

/* a set of ranges on a number-line */

#include "nsIntervalSet.h"
#include <new>
#include <algorithm>
#include "nsIPresShell.h"  // for allocation

using namespace mozilla;

nsIntervalSet::nsIntervalSet(nsIPresShell *aPresShell)
    : mList(nullptr), mPresShell(aPresShell) {}

nsIntervalSet::~nsIntervalSet() {
  Interval *current = mList;
  while (current) {
    Interval *trash = current;
    current = current->mNext;
    FreeInterval(trash);
  }
}

void *nsIntervalSet::AllocateInterval() {
  return mPresShell->AllocateByObjectID(eArenaObjectID_nsIntervalSet_Interval,
                                        sizeof(Interval));
}

void nsIntervalSet::FreeInterval(nsIntervalSet::Interval *aInterval) {
  NS_ASSERTION(aInterval, "null interval");

  aInterval->Interval::~Interval();
  mPresShell->FreeByObjectID(eArenaObjectID_nsIntervalSet_Interval, aInterval);
}

void nsIntervalSet::IncludeInterval(coord_type aBegin, coord_type aEnd) {
  auto newInterval = static_cast<Interval *>(AllocateInterval());
  new (newInterval) Interval(aBegin, aEnd);

  Interval **current = &mList;
  while (*current && (*current)->mEnd < aBegin) current = &(*current)->mNext;

  newInterval->mNext = *current;
  *current = newInterval;

  Interval *subsumed = newInterval->mNext;
  while (subsumed && subsumed->mBegin <= aEnd) {
    newInterval->mBegin = std::min(newInterval->mBegin, subsumed->mBegin);
    newInterval->mEnd = std::max(newInterval->mEnd, subsumed->mEnd);
    newInterval->mNext = subsumed->mNext;
    FreeInterval(subsumed);
    subsumed = newInterval->mNext;
  }
}

bool nsIntervalSet::Intersects(coord_type aBegin, coord_type aEnd) const {
  Interval *current = mList;
  while (current && current->mBegin <= aEnd) {
    if (current->mEnd >= aBegin) return true;
    current = current->mNext;
  }
  return false;
}

bool nsIntervalSet::Contains(coord_type aBegin, coord_type aEnd) const {
  Interval *current = mList;
  while (current && current->mBegin <= aBegin) {
    if (current->mEnd >= aEnd) return true;
    current = current->mNext;
  }
  return false;
}