getEntrySpan() public method

Get the number of entries this tree spans within the DirCache. If this tree is not valid (see isValid()) this method's return value is always strictly negative (less than 0) but is otherwise an undefined result.
public getEntrySpan ( ) : int
return int
示例#1
0
 public DirCacheIterator(DirCacheIterator parentIterator, DirCacheTree cacheTree)
     : base(parentIterator, parentIterator.Path, parentIterator.PathLen + 1)
 {
     Cache     = parentIterator.Cache;
     Tree      = cacheTree;
     TreeStart = parentIterator._pointer;
     TreeEnd   = TreeStart + Tree.getEntrySpan();
     SubtreeId = parentIterator.SubtreeId;
     _pointer  = parentIterator._pointer;
     ParseEntry();
 }
示例#2
0
        public override void next(int delta)
        {
            while (--delta >= 0)
            {
                if (_currentSubtree != null)
                {
                    _pointer += _currentSubtree.getEntrySpan();
                }
                else
                {
                    _pointer++;
                }

                if (eof())
                {
                    break;
                }

                ParseEntry();
            }
        }
 public DirCacheIterator(DirCacheIterator parentIterator, DirCacheTree cacheTree)
     : base(parentIterator, parentIterator.Path, parentIterator.PathLen + 1)
 {
     if (parentIterator == null)
     {
         throw new System.ArgumentNullException("parentIterator");
     }
     Cache     = parentIterator.Cache;
     Tree      = cacheTree;
     TreeStart = parentIterator._pointer;
     TreeEnd   = TreeStart + Tree.getEntrySpan();
     SubtreeId = parentIterator.SubtreeId;
     _pointer  = parentIterator._pointer;
     ParseEntry();
 }
 public DirCacheIterator(DirCacheIterator parentIterator, DirCacheTree cacheTree)
     : base(parentIterator, parentIterator.Path, parentIterator.PathLen + 1)
 {
     if ( parentIterator == null)
     {
         throw new System.ArgumentNullException("parentIterator");
     }
     Cache = parentIterator.Cache;
     Tree = cacheTree;
     TreeStart = parentIterator._pointer;
     TreeEnd = TreeStart + Tree.getEntrySpan();
     SubtreeId = parentIterator.SubtreeId;
     _pointer = parentIterator._pointer;
     ParseEntry();
 }
示例#5
0
 public DirCacheIterator(DirCacheIterator parentIterator, DirCacheTree cacheTree)
     : base(parentIterator, parentIterator.Path, parentIterator.PathLen + 1)
 {
     Cache = parentIterator.Cache;
     Tree = cacheTree;
     TreeStart = parentIterator._pointer;
     TreeEnd = TreeStart + Tree.getEntrySpan();
     SubtreeId = parentIterator.SubtreeId;
     _pointer = parentIterator._pointer;
     ParseEntry();
 }