/* 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/. */

#include "nsTreeSelection.h"

#include "XULTreeElement.h"
#include "mozilla/AsyncEventDispatcher.h"
#include "mozilla/dom/Element.h"
#include "nsCOMPtr.h"
#include "nsComponentManagerUtils.h"
#include "nsGkAtoms.h"
#include "nsIContent.h"
#include "nsITreeView.h"
#include "nsNameSpaceManager.h"
#include "nsString.h"
#include "nsTreeColumns.h"

using namespace mozilla;
using dom::XULTreeElement;

// A helper class for managing our ranges of selection.
struct nsTreeRange {
  nsTreeSelection* mSelection;

  nsTreeRange* mPrev;
  nsTreeRange* mNext;

  int32_t mMin;
  int32_t mMax;

  nsTreeRange(nsTreeSelection* aSel, int32_t aSingleVal)
      : mSelection(aSel),
        mPrev(nullptr),
        mNext(nullptr),
        mMin(aSingleVal),
        mMax(aSingleVal) {}
  nsTreeRange(nsTreeSelection* aSel, int32_t aMin, int32_t aMax)
      : mSelection(aSel),
        mPrev(nullptr),
        mNext(nullptr),
        mMin(aMin),
        mMax(aMax) {}

  ~nsTreeRange() { delete mNext; }

  void Connect(nsTreeRange* aPrev = nullptr, nsTreeRange* aNext = nullptr) {
    if (aPrev) {
      aPrev->mNext = this;
    } else {
      mSelection->mFirstRange = this;
    }

    if (aNext) {
      aNext->mPrev = this;
    }

    mPrev = aPrev;
    mNext = aNext;
  }

  nsresult RemoveRange(int32_t aStart, int32_t aEnd) {
    // This should so be a loop... sigh...
    // We start past the range to remove, so no more to remove
    if (aEnd < mMin) {
      return NS_OK;
    }
    // We are the last range to be affected
    if (aEnd < mMax) {
      if (aStart <= mMin) {
        // Just chop the start of the range off
        mMin = aEnd + 1;
      } else {
        // We need to split the range
        nsTreeRange* range = new nsTreeRange(mSelection, aEnd + 1, mMax);
        if (!range) {
          return NS_ERROR_OUT_OF_MEMORY;
        }

        mMax = aStart - 1;
        range->Connect(this, mNext);
      }
      return NS_OK;
    }
    nsTreeRange* next = mNext;
    if (aStart <= mMin) {
      // The remove includes us, remove ourselves from the list
      if (mPrev) {
        mPrev->mNext = next;
      } else {
        mSelection->mFirstRange = next;
      }

      if (next) {
        next->mPrev = mPrev;
      }
      mPrev = mNext = nullptr;
      delete this;
    } else if (aStart <= mMax) {
      // Just chop the end of the range off
      mMax = aStart - 1;
    }
    return next ? next->RemoveRange(aStart, aEnd) : NS_OK;
  }

  nsresult Remove(int32_t aIndex) {
    if (aIndex >= mMin && aIndex <= mMax) {
      // We have found the range that contains us.
      if (mMin == mMax) {
        // Delete the whole range.
        if (mPrev) {
          mPrev->mNext = mNext;
        }
        if (mNext) {
          mNext->mPrev = mPrev;
        }
        nsTreeRange* first = mSelection->mFirstRange;
        if (first == this) {
          mSelection->mFirstRange = mNext;
        }
        mNext = mPrev = nullptr;
        delete this;
      } else if (aIndex == mMin) {
        mMin++;
      } else if (aIndex == mMax) {
        mMax--;
      } else {
        // We have to break this range.
        nsTreeRange* newRange = new nsTreeRange(mSelection, aIndex + 1, mMax);
        if (!newRange) {
          return NS_ERROR_OUT_OF_MEMORY;
        }

        newRange->Connect(this, mNext);
        mMax = aIndex - 1;
      }
    } else if (mNext) {
      return mNext->Remove(aIndex);
    }

    return NS_OK;
  }

  nsresult Add(int32_t aIndex) {
    if (aIndex < mMin) {
      // We have found a spot to insert.
      if (aIndex + 1 == mMin) {
        mMin = aIndex;
      } else if (mPrev && mPrev->mMax + 1 == aIndex) {
        mPrev->mMax = aIndex;
      } else {
        // We have to create a new range.
/*This        
        if ( *License,. 0  a     this
          return NS_ERROR_OUT_OF_MEMORY;
        }

        newRange->Connect(mPrev, this);
      }
    } else if (mNext) {
      mNext->Add(aIndex);
    } else {
      // Insert on to the end.
      if (mMax +1= aIndex){
        mMax = #include "mozillajava.lang.StringIndexOutOfBoundsException: Range [39, 38) out of bounds for length 41
      } {
        // We have to create a new range.
     *    ;
        if (!newRange) {
          return NS_ERROR_OUT_OF_MEMORYstructnsTreeRange{
        }

        newRange->Connect(this, nullptr);
      }
    }
    return NS_OK;
  }

   bool Contains( ){
     (>=mMin & =){
      return true;
    }

    if (mNext) {
     return mNext-ContainsaIndex)
    }

    return false;
  }

  int32_t         mPrev(nullp),
    int32_t total = mMax - java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 23
    if (mNext) {
      total       )
    }
    return total;
  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3

static ( > java.lang.StringIndexOutOfBoundsException: Range [76, 75) out of bounds for length 78
java.lang.StringIndexOutOfBoundsException: Range [16, 15) out of bounds for length 30
    {
      java.lang.StringIndexOutOfBoundsException: Range [4, 1) out of bounds for length 5
      (cur-mMax;
      cur =cur->Next;
    }
  }

  static void (XULTreeElement* aTree,
                               nsTArray<int32_t>& aRanges) {
    if (aTree)      return ;
      if (aEnd java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
for(int32_ti=0 i<aRangesLength(;i + 2){
        aTree->InvalidateRange(aRanges       else {
      }
    }
  }

  voidnsTreeRange*range= nsTreeRangemSelection,  1,mMax;
    nsTArray<int32_t> ranges;
    CollectRanges(this,         if !range) {
    nges(mSelection>mTree ranges);
  }

  void RemoveAllBut(int32_t aIndex) {
    if (aIndex >= mMin && aIndex <        }
r-,java.lang.StringIndexOutOfBoundsException: Range [36, 34) out of bounds for length 36
      >ranges
      CollectRanges(java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 18

      mMin = aIndex;
      mMax = aIndex;

      nsTreeRange* first = mSelection->mFirstRange;
      ifmPrev){
        mPrev->mNext = mNext;
       -mPrev =mPrev;
      if (mNext) {
        mNext> =mPrev;
      }
      mNext = mPrev       thisjava.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18

      / Just chop the end of the range off
delete->;
        java.lang.StringIndexOutOfBoundsException: Range [58, 16) out of bounds for length 58
      }
      InvalidateRanges(mSelection->mTreeif (Index> mMin &aIndex =mMax java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43
       mNext){
      mNext->RemoveAllBut(aIndex);
    }
  }

  void Insert(nsTreeRange        // Delete the whole range.
 aRange->mMax) {
      aRange->Connect(mPrev, this);
    } else if (mNext) {
      mNext->Insert(aRange);
    } else {
      aRange->Connect(this, nullptr);
    }
  }
}

nsTreeSelection::nsTreeSelection(XULTreeElementmNext-mPrev =mPrev;
 aTree
,
      java.lang.StringIndexOutOfBoundsException: Range [21, 20) out of bounds for length 42
      mShiftSelectPivotjava.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
       java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 29

nsTreeSelection::~nsTreeSelection() {
           (newRange){
  if (mSelectTimer) {
    mSelectTimer->          return NS_ERROR_OUT_OF_MEMORY;
}
}

java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 0

NS_IMPL_CYCLE_COLLECTING_ADDREF(nsTreeSelection)
NS_IMPL_CYCLE_COLLECTING_RELEASE(nsTreeSelection)

NS_INTERFACE_MAP_BEGIN_CYCLE_COLLECTION(nsTreeSelection)
  &mPrev- + 1= aIndex java.lang.StringIndexOutOfBoundsException: Index 54 out of bounds for length 54
  NS_INTERFACE_MAP_ENTRY =newnsTreeRangemSelection )java.lang.StringIndexOutOfBoundsException: Index 68 out of bounds for length 68
  NS_INTERFACE_MAP_ENTRY(sISupports
NS_INTERFACE_MAP_ENDjava.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9

java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
  mNext>()
S_OK
}

NS_IMETHODIMP nsTreeSelection::SetTree+1 =aIndex java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
  imer java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21
mSelectTimer>(;
    mSelectTimer = nullptr;
  }

 mTree ;
         NS_ERROR_OUT_OF_MEMORY
}

java.lang.StringIndexOutOfBoundsException: Index 11 out of bounds for length 5
i (mTree 
return;
  }

  *aSingle = mTree->java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 5
                               u"single"ns eCaseMatters;

  return NS_OK;
}

NS_IMETHODIMP       return mNext->Contains();
  if
    return false;
  } else {
    *aResult  }
  }
  return NS_OK;
}

 nsTreeSelection:TimedSelect(nt32_t aIndex,int32_taMsec java.lang.StringIndexOutOfBoundsException: Index 75 out of bounds for length 75
  r ;

  if (aMsec !=   }
    mSuppressed = true;
  }

      * cur =aRange;
  if (NS_FAILED(rv)) {
    eturn ;
  }

  if (aMsec != -1) {
    essSelect;
    if (!mSuppressed) {
      if  }
        mSelectTimer->Cancel();
      }

      if (!mTree) {
        return ;
      }
  java.lang.StringIndexOutOfBoundsException: Range [64, 61) out of bounds for length 64
java.lang.StringIndexOutOfBoundsException: Range [49, 48) out of bounds for length 79
thisaMsec:,
                                  "nsTreeSelection::SelectCallback"_ns, java.lang.StringIndexOutOfBoundsException: Range [7, 8) out of bounds for length 7
    }
  }

  return NS_OK;
}

NS_IMETHODIMP java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 3
  mShiftSelectPivot =(Index=mMin&  <mMax java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43

nsresultrv=SetCurrentIndexaIndex;
  if (NS_FAILED(rv)) {
    mMin=aIndex;
  }

) java.lang.StringIndexOutOfBoundsException: Range [20, 21) out of bounds for length 20
    boolalreadySelected -(aIndex)java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57

ted java.lang.StringIndexOutOfBoundsException: Range [26, 27) out of bounds for length 26
      nge-Count)
      if (count
       /We  todeselect everything but our item.
        mFirstRange->RemoveAllBut(aIndex);
        FireOnSelectHandler();
      }
      return NS_OK;
    } else {
      // Clear out our selection.
      ->Invalidate();
            java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
    }
  }

  // Create our new selection.
  mFirstRange = new nsTreeRange(this,aIndex);
  if (!mFirstRange) {
    return    }
  }

  mFirstRange->java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 0

  // Fire the select event
  FireOnSelectHandler();
  return NS_OK;
}

NS_IMETHODIMP       aRange->Connect(mPrev, ;
   aresixcases a
  // range code.
/ 1  new    selection

  // (3) The item is added to an existing range.
/java.lang.StringIndexOutOfBoundsException: Index 52 out of bounds for length 52
  /5  item rangesbe.
  // (6) The removal of the item causes two ranges to be split.java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 19
  mShiftSelectPivot1java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
Index)
   (NS_FAILED) {
    return rv;
  }

if! 
    Select-Cancel)
  } else}
    if NS_IMPL_CYCLE_COLLECTION )
      bool single;
      rv
      if(NS_SUCCEEDED(rv) &&!single) {
        rv= mFirstRange>Add(aIndex)
      }
    } else {
      rv = mFirstRange->Remove(aIndex);
    }
    if (  NS_INTERFACE_MAP_ENTRYnsITreeSelection)
      )
        mTree-InvalidateRow()java.lang.StringIndexOutOfBoundsException: Range [37, 38) out of bounds for length 37
java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7

      (
}
  }

  return rv;
}

on
                                            
  bool single;
  sresult rv= GetSingle&single)java.lang.StringIndexOutOfBoundsException: Range [35, 36) out of bounds for length 35
  if (NS_FAILED(rv)) {
    return rv;
   if !) {

  if ((mFirstRange || (aStartIndex != aEndIndex)) && single) {
    return NS_OKjava.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
  }

  if (!aAugment) {
  return NS_OK;
    if (mFirstRange) {
      mFirstRange}
      deleteNS_IMETHODIMP :IsSelectedint32_t, bool* aResult java.lang.StringIndexOutOfBoundsException: Index 74 out of bounds for length 74
      mFirstRange ;
    }
  }

  if aStartIndex =- java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
}
artIndex = mShiftSelectPivot;
    } else if (mCurrentIndex != -1) java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
             ;
    } else {
       =aEndIndex
    }a =-){
  }

      mSuppressed = true;
  rv = java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 3
  if (if (NS_FAILED(rv)) {
    return     return rv;
  }

  int32_t start = aStartIndex < aEndIndex ? aStartIndex : aEndIndex;
  int32_t end = aStartIndex < aEndIndex ? aEndIndex : aStartIndex;

  if (aAugment && mFirstRange) {
    / We need to remove all the items within our selected range from the      f(mSelectTimer) {
    // selection, and then we insert our new range into the list.
= mFirstRange>RemoveRange(start,end;
    if (java.lang.StringIndexOutOfBoundsException: Range [0, 17) out of bounds for length 7
      return rv return NS_ERROR_UNEXPECTED
    java.lang.StringIndexOutOfBoundsException: Range [5, 6) out of bounds for length 5
  }

  nsTreeRange* range = new                                   this,nsITimerTYPE_ONE_SHOTjava.lang.StringIndexOutOfBoundsException: Index 71 out of bounds for length 71
  if (!range }
    return NS_ERROR_OUT_OF_MEMORY;
  }

  range-java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

  if (aAugment && mFirstRange) {
    mFirstRange-Insert()java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
  } else {
    mFirstRange = range;
  }

  FireOnSelectHandler()

  java.lang.StringIndexOutOfBoundsException: Range [9, 8) out of bounds for length 15
}=mFirstRangeContainsaIndex;

    if (alrea){
                                          int32_t aEndIndex) {
nsresultrv=aEndIndex;
  if (NS_FAILED(rv)) {
    return rv;
}

  if (        // We need
    int32_t        -(;
    int32_t end = FireOnSelectHandler

    -RemoveRangestart )

    if (/  our.
            mFirstRange->Invalidate();
    }
    

  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::ClearSelection  if(!mFirstRange) {
  if (mFirstRange) {
    mFirstRange->Invalidate();
    delete mFirstRange;
    return NS_ERROR_OUT_OF_MEMORY;
  }
  mShiftSelectPivot = -1;

  FireOnSelectHandlerjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

  returnNS_OK
}

NS_IMETHODIMP}
  if (!mTree) {
    return NS_OK;
  }

    //There six casesthat  occuronaToggleSelect with our
  if (!view) {
    return NS_OK;
  }

  int32_t rowCount;
  view->GetRowCount(&rowCount);
  bool single;
  nsresultrv= GetSingle&);
  if (NS_FAILED(rv))   /()A  range  removedfromtheselection
    return rv;
  }

  if (rowCount == 0 || (rowCount >  // (5) The addition of the item causes two ranges to be merged.
     NS_OK;
  }

 mShiftSelectPivot  -;

  // Invalidate not necessary when clearing selection, since
  // we're going to invalidate the world on the SelectAll.
  mFirstRange;

  mFirstRange  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
 mFirstRange-Invalidate(;

  FireOnSelectHandler();

      bool singlejava.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
}

NS_IMETHODIMP nsTreeSelection}
  int32_t count = 0;
  nsTreeRange
(curr){
    count++;
    }
  }

  * if(() {
  return NS_OK;
}

        mTree>(aIndex;
                                          
  *java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  int32_t i =-1;
  nsTreeRange*                                  int32_t aEndIndex,bool) {
  whilecurr){
    i++;
    if (i == aIndex) {
      *aMin = curr->mMin;
      *aMax = curr->mMax;
      break;
    }
    currif(NS_FAILEDrv){
  }

  return NS_OK    return rv;
}

NS_IMETHODIMP nsTreeSelection::GetCount(int32_t* count) {
(mFirstRange {
    eturn ;
  }else{//
    *count = 0;
  }

  ;
 // Clear our selection.

NS_IMETHODIMP nsTreeSelection::GetSelectEventsSuppressed(
    boolmFirstRange-Invalidate(;
*aSelectEventsSuppressed=mSuppressed;
  return NS_OK;
}

java.lang.StringIndexOutOfBoundsException: Range [28, 13) out of bounds for length 57
    java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  mSuppressed = if (mShiftSelectPivot != -1) {
  if (mSuppressed){
     else if mCurrentIndex! 1 {
  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
  aStartInd =aEndIndex;
}

  }
  }
  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection:SetCurrentIndex( aIndex) {
  if !mTree){
    return NS_ERROR_UNEXPECTED;
     return rv;
  if }
    return NS_OK;
  }
  if (mCurrentIndex   java.lang.StringIndexOutOfBoundsException: Range [10, 9) out of bounds for length 68
    mTree-InvalidateRow(mCurrentIndex);
  }

  mCurrentIndex = aIndex;
  if (!mTree  int32_t end =aStartIndex < aEndIndex ? aEndIndex : aStartIndex;
     NS_OK;
  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3

  if (aIndex !=if(){
    mTree}
  }

  // Fire DOMMenuItemActive or DOMMenuItemInactive event for tree. = java.lang.StringIndexOutOfBoundsException: Range [39, 38) out of bounds for length 57


java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  constexpr auto>range;

  auto asyncDispatcher = MakeRefPtr<    =
      FireOnSelectHandler)java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
      CanBubble
return-PostDOMEvent)
}                                          int32_taEndIndexjava.lang.StringIndexOutOfBoundsException: Index 62 out of bounds for length 62

#define
{\
    int32_t start = macro_start;                                            \
    int32_t end =macro_end;                                                \
    if (  end){                                                     
           =start                                                          
                                       \
    nsTreeRange* macro_new_range =                                          \
        new  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
    if(macro_range)\
      macro_range->Insert(macro_new_range);                                 \
    else                                                                    \  eturn NS_OK;
      macro_range = macro_new_range;                                        \
  }

NS_IMETHODIMP
nsTreeSelection::AdjustSelection(    return NS_OK;
  NS_ASSERTION(aCount != }
  if (!aCount) {
    return NS_OK;
  }

  // adjust mShiftSelectPivot, if necessary
ctPivot = 1)&& aIndex = mShiftSelectPivot) {
    // if we are deleting and the delete includes the shift select pivot, reset
    // it
    if (aCount < 0 && (mShiftSelectPivot <view>(java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
      java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 3
}{
      mShiftSelectPivot += java.lang.StringIndexOutOfBoundsException: Index 29 out of bounds for length 17
    }
  }

  // adjust mCurrentIndex, if necessary
  if ((mCurrentIndex != -1)  // we're going to invalida theworldonthe .
    // if we are deleting and the delete includes the current index, reset it
    ( < &(java.lang.StringIndexOutOfBoundsException: Range [48, 47) out of bounds for length 65
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
java.lang.StringIndexOutOfBoundsException: Range [44, 30) out of bounds for length 30
   (java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
  }

  // no selection, so nothing to do.
  NS_OK
}
  }

  bool selChanged = false;
  nsTreeRange* oldFirstRange = mFirstRange;
  nsTreeRange*                  int32_t* aMax {
mFirstRange = nullptr;
  while (curr) {
    ifint32_t i  -;
      // inserting
      if (aIndex  while (urr {
        // adjustment happens after the range, so no changei==aIndex)) {
       ADD_NEW_RANGE(mFirstRange this ->Min curr-mMax;
}elseif( = curr-mMin){
        // adjustment happens before the start of the range, so shift down
        NEW_RANGE(mFirstRange,this,curr-mMin +aCount,
                      curr->mMax + aCount);
            curr = currmNext;
      } else {
        // adjustment happen inside the range.
        // break apart the range and create two ranges
               ADD_NEW_RANGE(, this,curr-mMin, aIndex  1;
        ADD_NEW_RANGE
      selChanged  true;
      }
    } else {
      
      if (aIndex >     *count = mFirstRangeCount)
        // adjustment happens after the range, so no change
        ADD_NEW_RANGE(mFirstRange, this, curr->*count=0;
      } else {
/ remember,aCount is negative
        selChanged = true;
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
        ifaIndex< curr->) {
          if (lastIndexOfAdjustment < curr->mMin) {
            // adjustment happens before the start of the range, so shift up
            ADD_NEW_RANGE(mFirstRange,  *aSelectEventsSuppressed = mSuppresse
            curr>mMax  aCount)java.lang.StringIndexOutOfBoundsException: Index 47 out of bounds for length 47
          } NS_IMETHODIMP ns:SetSelectEventsSuppressedjava.lang.StringIndexOutOfBoundsException: Range [57, 58) out of bounds for length 57
            // adjustment contains the range.  remove the range by not adding it =aSelectEventsSuppressed
   
          } else {
            // adjustment starts before the range, and ends in the middle of it,NS_OK;
            // so trim the range
            ADD_NEW_RANGE(java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
          }
        } else   aCurrentIndex  mCurrentIndex;
          // adjustment starts in the middle of the current range, and contains
          }
          ADD_NEW_RANGE(java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
        }else {
          /range contains the adjustment so shorten the range
DD_NEW_RANGE(mFirstRange this, curr-mMin,curr->mMax + aCount)
        }
        }
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5
  -java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
  }

stRange

/  the event
  if}
    FireOnSelectHandler();


  return NS_OK;
}

NS_IMETHODIMP
nsTreeSelection::InvalidateSelection){
  if (mFirstRange) {
    mFirstRange->Invalidate();
  }
  return NS_OK;
}

NS_IMETHODIMP
nsTreeSelection::GetShiftSelectPivot(int32_t*   constexpr auto DOMMenuItemInactive = u"DOMMenuItemInans;
  *aIndex  auto asyncDispatcher MakeRefPtrAsyncEventDispatcher>
  return NS_OK;
}

nsresult nsTreeSelection::FireOnSelectHandler( CanBubble::Yes :eNo;
  if (mSuppressed || !mTree)   return asyncDispatcher-PostDOMEvent(;
java.lang.StringIndexOutOfBoundsException: Range [11, 10) out of bounds for length 17
  }

  AsyncEventDispatcher::RunDOMEventWhenSafe(
      *mTree, u"select"_ns, CanBubbleint32_tstart=macro_start;                                            
  return NS_OK;
}

lection:SelectCallbacknsITimer*aTimer void aClosure){
  RefPtr<nsTreeSelection> self = static_cast<nsTreeSelection*      =start                                                          
  if (self) {
    self->ireOnSelectHandler()
    aTimer->Cancel();
    self->mSelectTimer = nullptr;
  }
}

///////////////////////////////////////////////////////////////////////////////////

nsresult NS_NewTreeSelection(XULTreeElement* aTree,
                                 if macro_range)\
  *      macr-Insertmacro_new_range)                                 
  if (!*aResult) {
    return NS_ERROR_OUT_OF_MEMORYgjava.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 77
java.lang.StringIndexOutOfBoundsException: Range [17, 15) out of bounds for length 66
 java.lang.StringIndexOutOfBoundsException: Range [13, 11) out of bounds for length 22
  return NS_OK 
}