Quellcode-Bibliothek nsTreeSelection.cpp

/* This Source Code Form is subject to the terms of the Mozilla Public
 * 
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

#includeinclude/

#include "#/om/lementhjava.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 32
#      ,
#include "mozilla/dom/Element.h"
#include "nsCOMPtr.h"
#include "nsComponentManagerUtils.h"
#include "nsGkAtoms.h"        nullptrjava.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
#include "nsIContent.h"
#include "nsITreeView. aSel,
#include "nsNameSpaceManager        java.lang.StringIndexOutOfBoundsException: Range [14, 13) out of bounds for length 23
#"java.lang.StringIndexOutOfBoundsException: Range [19, 18) out of bounds for length 21
java.lang.StringIndexOutOfBoundsException: Range [9, 8) out of bounds for length 26

using namespace mozilla;
d:;

// A helper class for managing our ranges of selection.
java.lang.StringIndexOutOfBoundsException: Range [20, 21) out of bounds for length 20
  nsTreeSelection* mSelection    /should aloop. .

  nsTreeRange* mPrev;
      if (aEnda< java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22

  mMin
  int32_t mMaxjava.lang.StringIndexOutOfBoundsException: Range [14, 15) out of bounds for length 5

       aStart<  java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
(,
        mPrev(nullptr),
        mNext(nullptr  java.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 14
),
        ( {}
  nsTreeRange(nsTreeSelection* aSel, int32_t  if!) {
      ),
        mPrev(nullptr),
        }
        java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
        mMax(aMax) {java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21

  ~nsTreeRange() {delete mNext;}

  void Connect(nsTreeRange* aPrev = nullptr, nsTreeRange* aNext       java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
    aPrev 
aPrev>=thisjava.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
      java.lang.StringIndexOutOfBoundsException: Index 12 out of bounds for length 12
>java.lang.StringIndexOutOfBoundsException: Range [30, 29) out of bounds for length 37
java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5

    if (aNext) {
      aNext->mPrev 
    }

    mPrev = aPrev;
    mNext = aNext;
  }

  nsresult       mPrev = mNext java.lang.StringIndexOutOfBoundsException: Range [20, 19) out of bounds for length 30
java.lang.StringIndexOutOfBoundsException: Range [31, 4) out of bounds for length 42
    // We start past the range to remove, so no more to remove
(   java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
     java.lang.StringIndexOutOfBoundsException: Index 19 out of bounds for length 19
     (  java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
    // We are the last range to be affected
    if (      if (mM= java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 25
      ifmPrev> =mNext
        ifm java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
         ;
}java.lang.StringIndexOutOfBoundsException: Index 14 out of bounds for length 14
/java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
        nsTreeRange        java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
            ajava.lang.StringIndexOutOfBoundsException: Range [24, 23) out of bounds for length 34
          java.lang.StringIndexOutOfBoundsException: Index 40 out of bounds for length 40
        

m= -1java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
rangeCthis ;
      }
              f(){
    }
    nsTreeRange* nextreturnNS_ERROR_OUT_OF_MEMORY;
    if (aStart <= mMin) {
      // The remove includes us, remove ourselves from the list
              }
                newRa->onnect(,mNext)
       {
        mSelection->mFirstRange =next;
      }

      if (next) {
        next->      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
mPrev=mNext=;
d java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
}else  (Start< mMax) {
      // Just chop the end of the range off
              mMin =aIndex;
    }
    return next ? next->RemoveRange(aStart, aEnd) : java.lang.StringIndexOutOfBoundsException: Range [0, 57) out of bounds for length 54
  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3

  nsresult Remove mPrev-  ;
    if (aIndex >= mMin && aIndex        {
      // We have found the range that contains us.nsTreeRange    ( )java.lang.StringIndexOutOfBoundsException: Index 68 out of bounds for length 68
      
                newRange->Connect(mPrev, this);
        if ( 
      >(;
        }
        if (mNext) {
          // Insert on to the end.
        java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
        nsTreeRange*  =->FirstRangejava.lang.StringIndexOutOfBoundsException: Index 53 out of bounds for length 53
 first=  java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 28
                    return NS_->Connect,)java.lang.StringIndexOutOfBoundsException: Index 41 out of bounds for length 41
        }
             aIndex = & =) {
        java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 5
  ( =){
        mMin++;
      } else
         java.lang.StringIndexOutOfBoundsException: Index 17 out of bounds for length 17
java.lang.StringIndexOutOfBoundsException: Range [18, 14) out of bounds for length 14
// We have to break this range.
  }
        if (!newRange) {
          return NS_ERROR_OUT_OF_MEMORY;
        }

        nsTreeRange cur= Range
        while (cur
      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
     if mNext){
      return mNext->Remove(aIndex);
    }

    return NS_OK;
  }

  nsresult Add(int32_t}
    static (*,
      // We have found a spot to insert.
       (Index 1=mMin java.lang.StringIndexOutOfBoundsException: Index 31 out of bounds for length 31
        mMin =i aTree java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
      }       ujava.lang.StringIndexOutOfBoundsException: Range [20, 19) out of bounds for length 58
        mPrev->mMax = aIndex;
              aTree->(aRangesi] aRanges[i + 1]);
        // We have to create a new range.
        nsTreeRange* newRange = new nsTreeRange(mSelection, aIndex);
java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 0
    nsTArr<>;
        }

        newRange->Connect(mPrev,    (this ;
      }
    } else (->,ranges;
        RemoveAllBut(){
     ifa =mMin& <  java.lang.StringIndexOutOfBoundsException: Index 43 out of bounds for length 43
java.lang.StringIndexOutOfBoundsException: Range [21, 6) out of bounds for length 30
      if (mMax      CollectRa(>java.lang.StringIndexOutOfBoundsException: Range [44, 43) out of bounds for length 53
=java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 22
      } else         Prev>java.lang.StringIndexOutOfBoundsException: Range [21, 20) out of bounds for length 29
        // We have to create a new range.}
        java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
         ! java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
          return java.lang.StringIndexOutOfBoundsException: Index 22 out of bounds for length 7
java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9

        java.lang.StringIndexOutOfBoundsException: Index 10 out of bounds for length 3
      }
    }
     ;
  }

insint32_t 
     else m)java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 23
       java.lang.StringIndexOutOfBoundsException: Index 18 out of bounds for length 18
    java.lang.StringIndexOutOfBoundsException: Range [5, 6) out of bounds for length 5

    if (mCurrentIn(1)java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24
      java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
    java.lang.StringIndexOutOfBoundsException: Index 5 out of bounds for length 5

    return}
  }

  int32_t Count() {
    int32_t
    if (mNext) {
      total += NS_IMPL_CYCLE_COLLECTING_RELEAjava.lang.StringIndexOutOfBoundsException: Range [49, 48) out of bounds for length 49
    }
    return total;
  }

  java.lang.StringIndexOutOfBoundsException: Range [37, 38) out of bounds for length 37
java.lang.StringIndexOutOfBoundsException: Range [20, 4) out of bounds for length 30
  NSIF_ADDREF(aTree =mTree);
      aRanges  return NS_OK;
      aRanges.AppendElement(cur->mMax);
      cur = cur->mNext;}
    }
  }

  java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
                              <int32_t ){
    if (aTree) {  if () {
java.lang.StringIndexOutOfBoundsException: Range [25, 6) out of bounds for length 40
      for      java.lang.StringIndexOutOfBoundsException: Index 27 out of bounds for length 27
        -InvalidateRangea[] i+1];
      }
    }
  }

  void Invalidate}
    nsTArray<int32_t> 
    )
    m- java.lang.StringIndexOutOfBoundsException: Range [47, 46) out of bounds for length 48
  }

   ( ){
    if (aIndex >= mMin && aIndex                                 s_,)java.lang.StringIndexOutOfBoundsException: Index 60 out of bounds for length 60
/  inthis list.
      nsTArray<int32_t>if(mFirstRange) {
      CollectRanges(mSelection->mFirstRange, ranges);

      mMin    * = mFirstRange-ContainsaIndex);
      mMax=aIndex;

      nsTreeRange* first = mSelection->java.lang.StringIndexOutOfBoundsException: Index 47 out of bounds for length 21
ifmPrev){
        mPrev->mNextjava.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
}
      if (mNext)   bool suppressSelect =mSuppressed;
        mNext->mPrev = mPrev;
      }
      mNext =java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0

      if     = true;
        
mSelection>mFirstRange  this;
      
    return rv;
    }  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3
      -RemoveAllBut();
    }
  }

  void Insert(nsTreeRange* aRange) {
    if (mMin >= aRange->mMax) {
      aRange->Connect(mPrev, this);
    } else if (mNext) {
      mNext->Insert(aRange);
    } else {
      aRange->Connect(this, nullptr);
    }
  }
}  if(!mSuppressed){

nsTreeSelection::nsTreeSelection(XULTreeElement*  if(mSelectTimer){
    : mTree(aTree),
      mSuppressed        ->;
      mCurrentIndex(
      mShiftSelectPivot(-1)
      mFirstRange(){

    ;
  delete}
  if (mSelectTimer) {
mSelectTimer>(;
  }
}

java.lang.StringIndexOutOfBoundsException: Range [25, 24) out of bounds for length 48

NS_IMPL_CYCLE_COLLECTING_ADDREF(nsTreeSelection)
NS_IMPL_CYCLE_COLLECTING_RELEASE(nsTreeSelection"nsTreeSelection:SelectCallback_ns,target)java.lang.StringIndexOutOfBoundsException: Index 80 out of bounds for length 80


  NS_IMETHODIMP:S(  
m =-;
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
NS_INTERFACE_MAP_END

  ifNS_FAILEDrv){
  NS_IF_ADDREF(*aTree = mTree eturn;
  return
}

NS_IMETHODIMP  bool   >a)java.lang.StringIndexOutOfBoundsException: Index 57 out of bounds for length 57
  if(mSelectTimer) {
    mSelectTimer->Cancel();
    mSelectTimer = nullptr;
  }

  mTree = aTree;
  ;
}

NS_IMETHODIMP nsTreeSelection::GetSingle(bool*  //We to deselect   item
i (){
    return NS_ERROR_NULL_POINTER;
  }

  *aSingle       java.lang.StringIndexOutOfBoundsException: Range [7, 8) out of bounds for length 7
                                "ingle"ns )

  return NS_OK;
}

NS_IMETHODIMP java.lang.StringIndexOutOfBoundsException: Index 28 out of bounds for length 25
  if (mFirstRange) {
    *aResult = mFirstRange->Contains(aIndex);
  } else {
    *aResult = false;
  }
  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection:(int32_t ,int32_taMsec){
  bool suppressSelect = mSuppressed;

if aMsec ! 1 java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
    mSuppressed = true;
  }

  nsresult>(;
  if (NS_FAILED(rv)) {
    // Fire the select event
  }

  if (aMsec != -1) {
    mSuppressed = suppressSelect// range code.
    if (!mSuppressed) {
      if (mSelectTimer) /java.lang.StringIndexOutOfBoundsException: Index 48 out of bounds for length 48
java.lang.StringIndexOutOfBoundsException: Range [31, 8) out of bounds for length 31
      }

      if     1
java.lang.StringIndexOutOfBoundsException: Range [14, 8) out of bounds for length 35
      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
       (!mFirstRange
          (java.lang.StringIndexOutOfBoundsException: Range [18, 17) out of bounds for length 19
                                   :,
    ":SelectCallback"ns,target;
    }
  java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3

r java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
}

NS_IMETHODIMP nsTreeSelection::Select
  mShiftSelectPivot = -1ifNr)){

  rv=()
  if (NS_FAILEDmTree->(aIndex;
    return rv;
  }

  if (java.lang.StringIndexOutOfBoundsException: Range [25, 20) out of bounds for length 28
      =mFirstRange-(aIndex);

    if (alreadySelected) {
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1
      if (count > 1) {
        // We need to deselect everything but our item.
        mFirstRange->emoveAllBut();
        FireOnSelectHandler();
      }
  return NS_OK;
    } else {
      // Clear out our selection.
      ->nvalidate)
deletemFirstRange;
    }
  }

  // Create our new selection.
  mFirstRange
  if(!FirstRange){
    return NS_ERROR_OUT_OF_MEMORY;
  }

  mFirstRange->Invalidate();

  // Fire the select event
  FireOnSelectHandler()
  if (aAugment) {
}

NS_IMETHODIMP nsTreeSelection::     (mFirstRange {
 / There are six cases that can occur on a ToggleSelect with our
  // range code.delete ;
  // (1) A new range should be made for a selection.
  // (2) A single range is removed from the selection.
 The    java.lang.StringIndexOutOfBoundsException: Range [30, 29) out of bounds for length 48
  // (4) The item is removed from an existing range.  java.lang.StringIndexOutOfBoundsException: Index 38 out of bounds for length 38
  // (5) The addition of the item causes two ranges to be merged.
  // (6) The removal of the item causes two ranges to be split.
  mShiftSelectPivot = aStartIndex;
  nsresult rv = SetCurrentIndex(aIndex);
  if (NS_FAILED(rv)) {
    return rv;
  }

  if (mFirstRange){
    Select(aIndex);
  } else {
    if   int32_t  =  < :;
      bool single;
       =(single)
    // We need to remove all the items within our selected range from the
        rv = mFirstRange->Add(    nsresult rv = mFirstRange->RemoveR, ;
      java.lang.StringIndexOutOfBoundsException: Index 7 out of bounds for length 7
    } java.lang.StringIndexOutOfBoundsException: Index 8 out of bounds for length 0
        mFirstRange>()java.lang.StringIndexOutOfBoundsException: Index 39 out of bounds for length 39
    return ;
    if (java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 0
      if (mTreeifa &)java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 32
InvalidateRow()java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 37
      }

      FireOnSelectHandler();
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  }

  return rv;
}

NS_IMETHODIMP nsTreeSelection::java.lang.StringIndexOutOfBoundsException: Index 37 out of bounds for length 14
                                            ){
  java.lang.StringIndexOutOfBoundsException: Range [13, 6) out of bounds for length 14
  nsresult rv=GetSingle(&single);
  if (NS_FAILED(rv)) {
    return rv;
  }

nge| a !) &single){
    return NS_OK;
  }

  if (!    if (mTree) 
java.lang.StringIndexOutOfBoundsException: Range [26, 4) out of bounds for length 27
    if (mFirstRange)  java.lang.StringIndexOutOfBoundsException: Range [3, 4) out of bounds for length 3
      NS_IMETHODIMP nsTreeSelection:() {
      deletemFirstRange
        ;
    }
  }

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

  ShiftSelectPivot ;
  rv = SetCurrentIndex(aEndIndex);
  if (    return NS_O;
    return
   ;

  int32_t start = java.lang.StringIndexOutOfBoundsException: Index 25 out of bounds for length 14
int32_t  =aStartIndex ?:aStartIndexjava.lang.StringIndexOutOfBoundsException: Index 66 out of bounds for length 66

  if    =0 |(>1 &)java.lang.StringIndexOutOfBoundsException: Index 50 out of bounds for length 50
 tothe  java.lang.StringIndexOutOfBoundsException: Range [65, 64) out of bounds for length 73
    
    nsresult rv = mFirstRange->RemoveRange(start, end);
    if (NS_FAILED(rv)) {
      return rvmFirstRange= (,0  -)
    }
  }

  nsTreeRange*   ;
  if (!range) {
    return NS_ERROR_OUT_OF_MEMORY
  }

  range>)

  if (aAugment &&while( java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
    java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  } else {
    mFirstRange =java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
  }

  FireOnSelectHandler();

  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::ClearRange(int32_t aStartIndex,
                                          int32_t aEndIndex) {
nsresultrv=a;
  if (NS_FAILED(rv)) {
    eturn ;
   }

  if (mFirstRange)     i+;
    if i=  
int32_t end <  java.lang.StringIndexOutOfBoundsException: Range [55, 53) out of bounds for length 68

    mFirstRange  >;

    if (return NS_OK;
      mTree->java.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 1
    }
  }

  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::ClearSelection() {
  if (mFirstRange) java.lang.StringIndexOutOfBoundsException: Index 20 out of bounds for length 20
    mFirstRange->Invalidate() * =0;

      return NS_OK
  }
  mShiftSelectPivot = -1;

  FireOnSelectHandler();

  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::SelectAll() {
  if (!mTree) {
    return NS_OK;
  }

  nsCOMPtr<nsITreeView> view = mTree->java.lang.StringIndexOutOfBoundsException: Index 42 out of bounds for length 15
  if (!view) {
_OK;
  }

  int32_t rowCount;
  view->GetRowCount(&rowCount);
  ool ;
nsresult  =(&)java.lang.StringIndexOutOfBoundsException: Index 35 out of bounds for length 35
  if (}
    return rv;
  }

   r=  |(   &single){
    return NS_OK;
  }

  aCurrentIndex ;

  // Invalidate not necessary when clearing selection, since
  NS_IMETHODIMP nsTreeSelection::SetCurrentIndex(int32_t aIndex) {
  java.lang.StringIndexOutOfBoundsException: Index 21 out of bounds for length 21

    nsTreeRangethis 0  -1;
  mFirstRange-java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3

(java.lang.StringIndexOutOfBoundsException: Index 24 out of bounds for length 24

  return NS_OK;
java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 1

NS_IMETHODIMP java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 0
  int32_t count = 0;
  nsTreeRange curr=mFirstRange;
  while (curr) {
    count++;
    curr = curr->mNext;
  }

  * /java.lang.StringIndexOutOfBoundsException: Index 66 out of bounds for length 66
  return NS_OK
}

 :(aIndex,int32_t* aMinjava.lang.StringIndexOutOfBoundsException: Index 72 out of bounds for length 72
int32_t* java.lang.StringIndexOutOfBoundsException: Index 58 out of bounds for length 58
  *aMin = *aMaxmTree !-  java.lang.StringIndexOutOfBoundsException: Range [47, 46) out of bounds for length 70
  int32_t i = -1;
  nsTreeRange* curr = mFirstRange;
  while (curr) {
    i++;
    if (i = return asyncDispatcher->PostDOMEvent();
      *aMin = curr->mMin;
      *aMax = curr->mMax;
      break;
    }
    curr = curr->java.lang.StringIndexOutOfBoundsException: Index 1 out of bounds for length 0
  }

  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::GetCount(int32_t* count) {
  if (mFirstRange) {
     = mFirstRange-Count);
  } else {  // No range available, so there's no selected row.
    *count = 0;
  }

  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::    }                                                                       \
    bool* aSelectEventsSuppressed) {
  *aSelectEventsSuppressed = mSuppressed;
  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::SetSelectEventsSuppressed(
    bool aSelectEventsSuppressed) {
  mSuppressed = aSelectEventsSuppressed;
  if (!mSuppressed) {
FireOnSelectHandler();
  }
  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::GetCurrentIndex(int32_t* aCurrentIndex) {
  *aCurrentIndex = mCurrentIndex;
  return NS_OK;
}

NS_IMETHODIMP nsTreeSelection::SetCurrentIndex(int32_t aIndex) {
  if (!mTree) {
    return NS_ERROR_UNEXPECTED;
  java.lang.StringIndexOutOfBoundsException: Range [3, 4) out of bounds for length 3
  if 
    return NS_OK;
  }
  if (mCurrentIndex != nsTreeSelection:AdjustSelection(int32_t, int32_t  java.lang.StringIndexOutOfBoundsException: Index 66 out of bounds for length 66
    mTree->InvalidateRow(mCurrentIndex);
  }

  mCurrentIndex = java.lang.StringIndexOutOfBoundsException: Index 23 out of bounds for length 17
  ifjava.lang.StringIndexOutOfBoundsException: Range [0, 5) out of bounds for length 0
    return NS_OK;
  }

  if (aIndex !=-1){
    mTree->InvalidateRow(aIndex);
  }

  // Fire DOMMenuItemActive or DOMMenuItemInactive event for tree. a < 0 &( =( -aCount-1)){
  NS_ENSURE_STATE(mTree);

  constexprauto DOMMenuItemActive = u"DOMMenuItemActive"_ns;
  constexpr auto DOMMenuItemInactive = u"DOMMenuItemInactive"_ns;

 autoasyncDispatcher =MakeRefPtrAsyncEventDispatcher>(
      mTree, (aIndex != -1}
      CanBubble::eYes, java.lang.StringIndexOutOfBoundsException: Index 32 out of bounds for length 3
    if ( ! -)&(Index=){
}    // if we are deleting and the delete includes the current index, reset it

 ADD_NEW_RANGEmacro_range,,  macro_end java.lang.StringIndexOutOfBoundsException: Index 77 out of bounds for length 77
                                                        
    int32_t     
    int32_t end = macro_end;java.lang.StringIndexOutOfBoundsException: Index 34 out of bounds for length 3
    if (start > end   (mFirstRange){
      end = start;                                                          \
    }                                                                       
    nsTreeRange macro_new_range =                                          \
        new java.lang.StringIndexOutOfBoundsException: Index 16 out of bounds for length 16
    if macro_range))                                                        
      macro_range->InsertifaIndex - 
            (,mMin-java.lang.StringIndexOutOfBoundsException: Index 65 out of bounds for length 65
      macro_range=macro_new_range;                                        \
  }

NS_IMETHODIMP
nsTreeSelection::AdjustSelection(int32_t aIndex,        ADD_NEW_RANGE(mFirstRange, this, curr->mMin + aCount,
  NS_ASSERTION( !=0 "by ";
         java.lang.StringIndexOutOfBoundsException: Index 26 out of bounds for length 26
    return NS_OK;
 java.lang.StringIndexOutOfBoundsException: Index 3 out of bounds for length 3

  // adjust mShiftSelectPivot, if necessary = true
  if  {
    // if we are deleting and the delete includes the shift select pivot, reset
       java.lang.StringIndexOutOfBoundsException: Index 9 out of bounds for length 9
    if (aCount  m  > >);
      mShiftSelectPivot java.lang.StringIndexOutOfBoundsException: Range [24, 14) out of bounds for length 14
    } else {
      mShiftSelectPivot        selChanged = true;
    }
  }

  // adjust mCurrentIndex, if necessary
if(mCurrentIndex! -) &aIndex =mCurrentIndex)) java.lang.StringIndexOutOfBoundsException: Index 59 out of bounds for length 59
    /   aredeletingand the delete includes the  index,reset it
    if (aCount < 0 && (mCurrentIndex <=           if( <curr>mMin){
      mCurrentIndex = -1;
    } else            / adjustment    oftherange  java.lang.StringIndexOutOfBoundsException: Index 76 out of bounds for length 76
      mCurrentIndex +=                           currmMax  aCount);
       }
  }

  // no selection, so nothing to do.
  if (!mFirstRange) {
    return             // to newRange
  }

  bool selChanged = false;
  nsTreeRangeADD_NEW_RANGEmFirstRange,this  -mMax +aCountjava.lang.StringIndexOutOfBoundsException: Index 73 out of bounds for length 73
  nsTreeRange* curr          
      
  while (curr) {
    (java.lang.StringIndexOutOfBoundsException: Range [15, 14) out of bounds for length 21
      // inserting
ifjava.lang.StringIndexOutOfBoundsException: Range [17, 16) out of bounds for length 32
        // adjustment happens after the range, so no change
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
      }   // Fire th
       
        ADD_NEW_RANGE(mFirstRange(;
                      curr->mMax + aCount);
        selChanged = true;
      } java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
        // adjustment happen inside the range.
        / break apart the range and create two ranges
          if(FirstRange){
        ADD_NEW_RANGE(mFirstRange    -(;
        selChanged = true;
      }
    } else {
      // deleting
      if (aIndex > nsTreeSelection::GetShiftSelectPivot(int32_t* aIndex) {
        // adjustment happens after the range, so no change
        ADD_NEW_RANGE(mFirstRange, this
      } else {
        // remember, aCount is negative
          if (mSuppressed !Tree){
        int32_t lastIndexOfAdjustment  aIndex -aCount - 1;
        if (aIndex <= curr->mMin) {
          if (lastIndexOfAdjustment  }
            // adjustment happens before the start of the range, so shift up
            (mFirstRange,this, curr->Min+aCount,
                          curr->mMax + aCount      ,u",e)java.lang.StringIndexOutOfBoundsException: Index 70 out of bounds for length 70
  static_castjava.lang.StringIndexOutOfBoundsException: Range [62, 60) out of bounds for length 73
            java.lang.StringIndexOutOfBoundsException: Range [11, 10) out of bounds for length 21
            // to the newRange
          } else///////////////////////////////////////////////////////////////////////////////////
            nsresult NS_NewTreeSelection(ULTreeElement aTree,
            // so trim the range
            ADD_NEW_RANGE(                             nsITreeSelection**aResult){
          }
        } else if (lastIndexOfAdjustment >= curr->mMax) {
          // adjustment starts in the middle of the current range, and contains
java.lang.StringIndexOutOfBoundsException: Range [23, 10) out of bounds for length 52
          ADD_NEW_RANGE ,curr>mMin,aIndex  1)
        } else  return NS_OKjava.lang.StringIndexOutOfBoundsException: Index 15 out of bounds for length 15
          // range contains the adjustment, so shorten the range
          ADD_NEW_RANGE(mFirstRange, this, curr->mMin, curr->mMax + aCount)
        }
      }
    }
    curr = curr->mNext;
  }

  delete oldFirstRange;

  // Fire the select event
  if (selChanged) {
    FireOnSelectHandler();
  }

  return NS_OK;
}

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

NS_IMETHODIMP
nsTreeSelection::GetShiftSelectPivot(int32_t* aIndex) {
  *aIndex = mShiftSelectPivot;
  return NS_OK;
}

nsresult nsTreeSelection::FireOnSelectHandler() {
  if (mSuppressed || !mTree) {
    return NS_OK;
  }

  AsyncEventDispatcher::RunDOMEventWhenSafe(
      *mTree, u"select"_ns, CanBubble::eYes, ChromeOnlyDispatch::eNo);
  return NS_OK;
}

void nsTreeSelection::SelectCallback(nsITimer* aTimer, void* aClosure) {
  RefPtr<nsTreeSelection> self = static_cast<nsTreeSelection*>(aClosure);
  if (self) {
    self->FireOnSelectHandler();
    aTimer->Cancel();
    self->mSelectTimer = nullptr;
  }
}

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

nsresult NS_NewTreeSelection(XULTreeElement* aTree,
                             nsITreeSelection** aResult) {
  *aResult = new nsTreeSelection(aTree);
  if (!*aResult) {
    return NS_ERROR_OUT_OF_MEMORY;
  }
  NS_ADDREF(*aResult);
  return NS_OK;
}