Search Options

Results per page
Sort
Preferred Languages
Advance

Results 61 - 63 of 63 for roadmap (0.03 sec)

  1. android/guava/src/com/google/common/collect/TreeRangeMap.java

              if (subRange.isEmpty()) {
                return emptyIterator();
              }
              Iterator<RangeMapEntry<K, V>> backingItr =
                  entriesByLowerBound
                      .headMap(subRange.upperBound, false)
                      .descendingMap()
                      .values()
                      .iterator();
              return new AbstractIterator<Entry<Range<K>, V>>() {
    
                @Override
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 23 17:50:58 UTC 2025
    - 22.7K bytes
    - Viewed (0)
  2. android/guava-testlib/src/com/google/common/collect/testing/DerivedCollectionGenerators.java

         */
        SortedMap<K, V> createSubMap(SortedMap<K, V> map, K firstExclusive, K lastExclusive) {
          if (from == Bound.NO_BOUND && to == Bound.EXCLUSIVE) {
            return map.headMap(lastExclusive);
          } else if (from == Bound.INCLUSIVE && to == Bound.NO_BOUND) {
            return map.tailMap(firstInclusive);
          } else if (from == Bound.INCLUSIVE && to == Bound.EXCLUSIVE) {
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Jan 30 16:59:10 UTC 2025
    - 18.2K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/TreeRangeMap.java

              if (subRange.isEmpty()) {
                return emptyIterator();
              }
              Iterator<RangeMapEntry<K, V>> backingItr =
                  entriesByLowerBound
                      .headMap(subRange.upperBound, false)
                      .descendingMap()
                      .values()
                      .iterator();
              return new AbstractIterator<Entry<Range<K>, V>>() {
    
                @Override
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 23 17:50:58 UTC 2025
    - 26.5K bytes
    - Viewed (0)
Back to top