Home
last modified time | relevance | path

Searched refs:lowerBound (Results 1 – 25 of 63) sorted by relevance

123

/external/guava/guava/src/com/google/common/collect/
DRange.java120 return range.lowerBound;
145 .compare(left.lowerBound, right.lowerBound)
152 Cut<C> lowerBound, Cut<C> upperBound) { in create() argument
153 return new Range<C>(lowerBound, upperBound); in create()
220 Cut<C> lowerBound = (lowerType == BoundType.OPEN) in range() local
226 return create(lowerBound, upperBound); in range()
357 final Cut<C> lowerBound; field in Range
360 private Range(Cut<C> lowerBound, Cut<C> upperBound) { in Range() argument
361 if (lowerBound.compareTo(upperBound) > 0 || lowerBound == Cut.<C>aboveAll() in Range()
363 throw new IllegalArgumentException("Invalid range: " + toString(lowerBound, upperBound)); in Range()
[all …]
DTreeRangeMap.java73 RangeMapEntry(Cut<K> lowerBound, Cut<K> upperBound, V value) { in RangeMapEntry() argument
74 this(Range.create(lowerBound, upperBound), value); in RangeMapEntry()
97 return range.lowerBound; in getLowerBound()
129 entriesByLowerBound.put(range.lowerBound, new RangeMapEntry<K, V>(range, value)); in put()
153 firstEntry.getValue().getKey().lowerBound, in span()
157 private void putRangeMapEntry(Cut<K> lowerBound, Cut<K> upperBound, V value) { in putRangeMapEntry() argument
158 entriesByLowerBound.put(lowerBound, new RangeMapEntry<K, V>(lowerBound, upperBound, value)); in putRangeMapEntry()
172 entriesByLowerBound.lowerEntry(rangeToRemove.lowerBound); in remove()
176 if (rangeMapEntry.getUpperBound().compareTo(rangeToRemove.lowerBound) > 0) { in remove()
185 putRangeMapEntry(rangeMapEntry.getLowerBound(), rangeToRemove.lowerBound, in remove()
[all …]
DTreeRangeSet.java111 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in encloses()
118 Entry<Cut<C>, Range<C>> floorEntry = rangesByLowerBound.floorEntry(range.lowerBound); in rangeEnclosing()
131 return Range.create(firstEntry.getValue().lowerBound, lastEntry.getValue().upperBound); in span()
144 Cut<C> lbToAdd = rangeToAdd.lowerBound; in add()
161 lbToAdd = rangeBelowLB.lowerBound; in add()
192 Entry<Cut<C>, Range<C>> entryBelowLB = rangesByLowerBound.lowerEntry(rangeToRemove.lowerBound); in remove()
196 if (rangeBelowLB.upperBound.compareTo(rangeToRemove.lowerBound) >= 0) { in remove()
205 Range.create(rangeBelowLB.lowerBound, rangeToRemove.lowerBound)); in remove()
221 rangesByLowerBound.subMap(rangeToRemove.lowerBound, rangeToRemove.upperBound).clear(); in remove()
226 rangesByLowerBound.remove(range.lowerBound); in replaceRangeWithSameLowerBound()
[all …]
DTreeBasedTable.java181 @Nullable final C lowerBound; field in TreeBasedTable.TreeRow
188 TreeRow(R rowKey, @Nullable C lowerBound, @Nullable C upperBound) { in TreeRow() argument
190 this.lowerBound = lowerBound; in TreeRow()
192 checkArgument(lowerBound == null || upperBound == null in TreeRow()
193 || compare(lowerBound, upperBound) <= 0); in TreeRow()
212 return o != null && (lowerBound == null || compare(lowerBound, o) <= 0) in rangeContains()
224 return new TreeRow(rowKey, lowerBound, toKey); in headMap()
271 if (lowerBound != null) { in computeBackingRowMap()
272 map = map.tailMap(lowerBound); in computeBackingRowMap()
DForwardingSortedMultiset.java203 E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) { in subMultiset() argument
204 return delegate().subMultiset(lowerBound, lowerBoundType, upperBound, upperBoundType); in subMultiset()
216 E lowerBound, BoundType lowerBoundType, E upperBound, BoundType upperBoundType) { in standardSubMultiset() argument
217 return tailMultiset(lowerBound, lowerBoundType).headMultiset(upperBound, upperBoundType); in standardSubMultiset()
221 public SortedMultiset<E> tailMultiset(E lowerBound, BoundType boundType) { in tailMultiset() argument
222 return delegate().tailMultiset(lowerBound, boundType); in tailMultiset()
DUnmodifiableSortedMultiset.java101 E lowerBound, BoundType lowerBoundType, in subMultiset() argument
104 lowerBound, lowerBoundType, upperBound, upperBoundType)); in subMultiset()
108 public SortedMultiset<E> tailMultiset(E lowerBound, BoundType boundType) { in tailMultiset() argument
110 delegate().tailMultiset(lowerBound, boundType)); in tailMultiset()
DImmutableRangeSet.java118 otherRange.lowerBound, in encloses()
146 ranges.get(0).lowerBound, in span()
217 Cut<C> lowerBound; in get() local
219 lowerBound = (index == 0) ? Cut.<C>belowAll() : ranges.get(index - 1).upperBound; in get()
221 lowerBound = ranges.get(index).upperBound; in get()
228 upperBound = ranges.get(index + (positiveBoundedBelow ? 0 : 1)).lowerBound; in get()
231 return Range.create(lowerBound, upperBound); in get()
270 ranges, Range.<C>upperBoundFn(), range.lowerBound, KeyPresentBehavior.FIRST_AFTER, in intersectRanges()
DSortedMultiset.java136 SortedMultiset<E> subMultiset(E lowerBound, BoundType lowerBoundType, in subMultiset() argument
149 SortedMultiset<E> tailMultiset(E lowerBound, BoundType boundType); in tailMultiset() argument
/external/apache-http/src/org/apache/http/message/
DParserCursor.java52 private final int lowerBound; field in ParserCursor
56 public ParserCursor(int lowerBound, int upperBound) { in ParserCursor() argument
58 if (lowerBound < 0) { in ParserCursor()
61 if (lowerBound > upperBound) { in ParserCursor()
64 this.lowerBound = lowerBound; in ParserCursor()
66 this.pos = lowerBound; in ParserCursor()
70 return this.lowerBound; in getLowerBound()
82 if (pos < this.lowerBound) { in updatePos()
98 buffer.append(Integer.toString(this.lowerBound)); in toString()
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/
DUnivariateRealSolverUtils.java126 double initial, double lowerBound, double upperBound) in bracket() argument
128 return bracket( function, initial, lowerBound, upperBound, in bracket()
166 double initial, double lowerBound, double upperBound, in bracket() argument
177 if (initial < lowerBound || initial > upperBound || lowerBound >= upperBound) { in bracket()
180 lowerBound, initial, upperBound); in bracket()
189 a = FastMath.max(a - 1.0, lowerBound); in bracket()
196 ((a > lowerBound) || (b < upperBound))); in bracket()
202 lowerBound, upperBound, a, b, fa, fb); in bracket()
/external/llvm/test/Assembler/
Ddisubrange-empty-array.ll8 ; CHECK-NEXT: !1 = !DISubrange(count: -1, lowerBound: 4)
9 ; CHECK-NEXT: !2 = !DISubrange(count: -1, lowerBound: -5)
11 !1 = !DISubrange(count: -1, lowerBound: 0)
13 !2 = !DISubrange(count: -1, lowerBound: 4)
14 !3 = !DISubrange(count: -1, lowerBound: -5)
Ddebug-info.ll8 ; CHECK-NEXT: !1 = !DISubrange(count: 3, lowerBound: 4)
9 ; CHECK-NEXT: !2 = !DISubrange(count: 3, lowerBound: -5)
11 !1 = !DISubrange(count: 3, lowerBound: 0)
13 !2 = !DISubrange(count: 3, lowerBound: 4)
14 !3 = !DISubrange(count: 3, lowerBound: -5)
Dinvalid-disubrange-lowerBound-max.ll3 ; CHECK: [[@LINE+1]]:41: error: value for 'lowerBound' too large, limit is 9223372036854775807
4 !0 = !DISubrange(count: 30, lowerBound: 9223372036854775808)
Dinvalid-disubrange-lowerBound-min.ll3 ; CHECK: [[@LINE+1]]:41: error: value for 'lowerBound' too small, limit is -9223372036854775808
4 !0 = !DISubrange(count: 30, lowerBound: -9223372036854775809)
/external/swiftshader/third_party/llvm-7.0/llvm/test/Assembler/
Ddisubrange-empty-array.ll8 ; CHECK-NEXT: !1 = !DISubrange(count: -1, lowerBound: 4)
9 ; CHECK-NEXT: !2 = !DISubrange(count: -1, lowerBound: -5)
11 !1 = !DISubrange(count: -1, lowerBound: 0)
13 !2 = !DISubrange(count: -1, lowerBound: 4)
14 !3 = !DISubrange(count: -1, lowerBound: -5)
Dinvalid-disubrange-lowerBound-min.ll3 ; CHECK: [[@LINE+1]]:41: error: value for 'lowerBound' too small, limit is -9223372036854775808
4 !0 = !DISubrange(count: 30, lowerBound: -9223372036854775809)
Dinvalid-disubrange-lowerBound-max.ll3 ; CHECK: [[@LINE+1]]:41: error: value for 'lowerBound' too large, limit is 9223372036854775807
4 !0 = !DISubrange(count: 30, lowerBound: 9223372036854775808)
Ddebug-info.ll8 ; CHECK-NEXT: !1 = !DISubrange(count: 3, lowerBound: 4)
9 ; CHECK-NEXT: !2 = !DISubrange(count: 3, lowerBound: -5)
11 !1 = !DISubrange(count: 3, lowerBound: 0)
13 !2 = !DISubrange(count: 3, lowerBound: 4)
14 !3 = !DISubrange(count: 3, lowerBound: -5)
/external/javapoet/src/main/java/com/squareup/javapoet/
DWildcardTypeName.java50 for (TypeName lowerBound : this.lowerBounds) { in WildcardTypeName()
51 checkArgument(!lowerBound.isPrimitive() && lowerBound != VOID, in WildcardTypeName()
52 "invalid lower bound: %s", lowerBound); in WildcardTypeName()
91 public static WildcardTypeName supertypeOf(TypeName lowerBound) { in supertypeOf() argument
93 Collections.singletonList(lowerBound)); in supertypeOf()
96 public static WildcardTypeName supertypeOf(Type lowerBound) { in supertypeOf() argument
97 return supertypeOf(TypeName.get(lowerBound)); in supertypeOf()
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DUnmodifiableSortedMultiset.java99 E lowerBound, BoundType lowerBoundType, in subMultiset() argument
102 lowerBound, lowerBoundType, upperBound, upperBoundType)); in subMultiset()
106 public SortedMultiset<E> tailMultiset(E lowerBound, BoundType boundType) { in tailMultiset() argument
108 delegate().tailMultiset(lowerBound, boundType)); in tailMultiset()
DSortedMultiset.java53 SortedMultiset<E> subMultiset(E lowerBound, BoundType lowerBoundType, in subMultiset() argument
56 SortedMultiset<E> tailMultiset(E lowerBound, BoundType boundType); in tailMultiset() argument
/external/guice/core/src/com/google/inject/internal/
DMoreTypes.java492 private final Type lowerBound; field in MoreTypes.WildcardTypeImpl
502 this.lowerBound = canonicalize(lowerBounds[0]); in WildcardTypeImpl()
508 this.lowerBound = null; in WildcardTypeImpl()
520 return lowerBound != null ? new Type[] {lowerBound} : EMPTY_TYPE_ARRAY; in getLowerBounds()
526 && (lowerBound == null || MoreTypes.isFullySpecified(lowerBound)); in isFullySpecified()
537 return (lowerBound != null ? 31 + lowerBound.hashCode() : 1) ^ (31 + upperBound.hashCode()); in hashCode()
542 if (lowerBound != null) { in toString()
543 return "? super " + typeToString(lowerBound); in toString()
/external/apache-commons-math/src/main/java/org/apache/commons/math/distribution/
DAbstractContinuousDistribution.java114 double lowerBound = getDomainLowerBound(p); in inverseCumulativeProbability() local
120 lowerBound, upperBound); in inverseCumulativeProbability()
127 if (FastMath.abs(rootFindingFunction.value(lowerBound)) < getSolverAbsoluteAccuracy()) { in inverseCumulativeProbability()
128 return lowerBound; in inverseCumulativeProbability()
/external/skqp/tests/
DIncrTopoSortTest.cpp152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region in addEdges() local
154 if ((*dependedOn)[i]->indexInSort() < lowerBound) { in addEdges()
155 this->shift(lowerBound); in addEdges()
162 lowerBound = SkTMin(dependent->indexInSort(), lowerBound); in addEdges()
165 this->shift(lowerBound); in addEdges()
/external/skia/tests/
DIncrTopoSortTest.cpp152 int lowerBound = fNodes.count(); // 'lowerBound' tracks the left of the affected region in addEdges() local
154 if ((*dependedOn)[i]->indexInSort() < lowerBound) { in addEdges()
155 this->shift(lowerBound); in addEdges()
162 lowerBound = SkTMin(dependent->indexInSort(), lowerBound); in addEdges()
165 this->shift(lowerBound); in addEdges()

123