| /external/python/cpython3/Lib/ |
| D | tracemalloc.py | 320 def __init__(self, inclusive): argument
321 self.inclusive = inclusive
328 def __init__(self, inclusive, filename_pattern, argument
330 super().__init__(inclusive)
331 self.inclusive = inclusive
351 return self._match_frame_impl(filename, lineno) ^ (not self.inclusive)
357 return self.inclusive
359 return (not self.inclusive)
368 if self.inclusive:
376 def __init__(self, inclusive, domain): argument
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ContiguousSet.java | 94 @Override public ContiguousSet<C> headSet(C toElement, boolean inclusive) { in headSet() argument
95 return headSetImpl(checkNotNull(toElement), inclusive); in headSet()
125 @Override public ContiguousSet<C> tailSet(C fromElement, boolean inclusive) { in tailSet() argument
126 return tailSetImpl(checkNotNull(fromElement), inclusive); in tailSet()
132 /*@Override*/ abstract ContiguousSet<C> headSetImpl(C toElement, boolean inclusive); in headSetImpl() argument
137 /*@Override*/ abstract ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive); in tailSetImpl() argument
|
| D | RegularImmutableSortedSet.java | 219 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) { in headSetImpl() argument
220 return getSubSet(0, headIndex(toElement, inclusive)); in headSetImpl()
223 int headIndex(E toElement, boolean inclusive) { in headIndex() argument
226 inclusive ? FIRST_AFTER : FIRST_PRESENT, NEXT_HIGHER); in headIndex()
237 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument
238 return getSubSet(tailIndex(fromElement, inclusive), size()); in tailSetImpl()
241 int tailIndex(E fromElement, boolean inclusive) { in tailIndex() argument
246 inclusive ? FIRST_PRESENT : FIRST_AFTER, NEXT_HIGHER); in tailIndex()
|
| D | DescendingImmutableSortedSet.java | 47 ImmutableSortedSet<E> headSetImpl(E toElement, boolean inclusive) { in headSetImpl() argument
48 return forward.tailSet(toElement, inclusive).descendingSet(); in headSetImpl()
58 ImmutableSortedSet<E> tailSetImpl(E fromElement, boolean inclusive) { in tailSetImpl() argument
59 return forward.headSet(fromElement, inclusive).descendingSet(); in tailSetImpl()
|
| D | RegularImmutableSortedMap.java | 113 public ImmutableSortedMap<K, V> headMap(K toKey, boolean inclusive) { in headMap() argument
114 return getSubMap(0, keySet.headIndex(checkNotNull(toKey), inclusive)); in headMap()
118 public ImmutableSortedMap<K, V> tailMap(K fromKey, boolean inclusive) { in tailMap() argument
119 return getSubMap(keySet.tailIndex(checkNotNull(fromKey), inclusive), size()); in tailMap()
|
| D | ForwardingNavigableSet.java | 210 public NavigableSet<E> headSet(E toElement, boolean inclusive) { in headSet() argument
211 return delegate().headSet(toElement, inclusive); in headSet()
225 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
226 return delegate().tailSet(fromElement, inclusive); in tailSet()
|
| D | SortedMultisets.java | 143 public NavigableSet<E> headSet(E toElement, boolean inclusive) { in headSet() argument
145 multiset().headMultiset(toElement, BoundType.forBoolean(inclusive))); in headSet()
149 public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
151 multiset().tailMultiset(fromElement, BoundType.forBoolean(inclusive))); in tailSet()
|
| D | TreeRangeSet.java | 279 public NavigableMap<Cut<C>, Range<C>> headMap(Cut<C> toKey, boolean inclusive) { in headMap() argument
280 return subMap(Range.upTo(toKey, BoundType.forBoolean(inclusive))); in headMap()
284 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) { in tailMap() argument
285 return subMap(Range.downTo(fromKey, BoundType.forBoolean(inclusive))); in tailMap()
440 public NavigableMap<Cut<C>, Range<C>> headMap(Cut<C> toKey, boolean inclusive) {
441 return subMap(Range.upTo(toKey, BoundType.forBoolean(inclusive)));
445 public NavigableMap<Cut<C>, Range<C>> tailMap(Cut<C> fromKey, boolean inclusive) {
446 return subMap(Range.downTo(fromKey, BoundType.forBoolean(inclusive)));
520 boolean inclusive = complementLowerBoundWindow.hasUpperBound()
523 Iterators.peekingIterator(positiveRangesByUpperBound.headMap(startingPoint, inclusive)
[all …]
|
| D | BoundType.java | 50 static BoundType forBoolean(boolean inclusive) { in forBoolean() argument
51 return inclusive ? CLOSED : OPEN; in forBoolean()
|
| /external/icu/icu4c/source/i18n/unicode/ |
| D | tzrule.h | 142 UBool inclusive, UDate& result) const = 0;
159 UBool inclusive, UDate& result) const = 0;
324 UBool inclusive, UDate& result) const;
341 UBool inclusive, UDate& result) const;
559 UBool inclusive, UDate& result) const;
576 UBool inclusive, UDate& result) const;
765 UBool inclusive, UDate& result) const;
782 UBool inclusive, UDate& result) const;
|
| D | rbtz.h | 260 virtual UBool getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const;
270 …virtual UBool getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const;
314 …UBool findNext(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) c…
315 …UBool findPrev(UDate base, UBool inclusive, UDate& time, TimeZoneRule*& from, TimeZoneRule*& to) c…
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| D | RuleBasedTimeZone.java | 324 public TimeZoneTransition getNextTransition(long base, boolean inclusive) { in getNextTransition() argument
333 if (tt > base || (inclusive && tt == base)) { in getNextTransition()
339 if (inclusive && tt == base) { in getNextTransition()
345 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getNextTransition()
347 finalRules[0].getRawOffset(), finalRules[0].getDSTSavings(), inclusive); in getNextTransition()
366 if (tt < base || (!inclusive && tt == base)) { in getNextTransition()
394 public TimeZoneTransition getPreviousTransition(long base, boolean inclusive) { in getPreviousTransition() argument
402 if (inclusive && tt == base) { in getPreviousTransition()
410 if (inclusive && tt == base) { in getPreviousTransition()
416 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getPreviousTransition()
[all …]
|
| D | TimeArrayTimeZoneRule.java | 95 public Date getNextStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument
99 if (time < base || (!inclusive && time == base)) { in getNextStart()
113 public Date getPreviousStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument
117 if (time < base || (inclusive && time == base)) { in getPreviousStart()
|
| D | AnnualTimeZoneRule.java | 180 public Date getNextStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument
187 if (d != null && (d.getTime() < base || (!inclusive && (d.getTime() == base)))) { in getNextStart()
197 …public Date getPreviousStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument
204 if (d != null && (d.getTime() > base || (!inclusive && (d.getTime() == base)))) { in getPreviousStart()
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| D | RuleBasedTimeZone.java | 346 public TimeZoneTransition getNextTransition(long base, boolean inclusive) { in getNextTransition() argument
355 if (tt > base || (inclusive && tt == base)) { in getNextTransition()
361 if (inclusive && tt == base) { in getNextTransition()
367 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getNextTransition()
369 finalRules[0].getRawOffset(), finalRules[0].getDSTSavings(), inclusive); in getNextTransition()
388 if (tt < base || (!inclusive && tt == base)) { in getNextTransition()
418 public TimeZoneTransition getPreviousTransition(long base, boolean inclusive) { in getPreviousTransition() argument
426 if (inclusive && tt == base) { in getPreviousTransition()
434 if (inclusive && tt == base) { in getPreviousTransition()
440 finalRules[1].getRawOffset(), finalRules[1].getDSTSavings(), inclusive); in getPreviousTransition()
[all …]
|
| D | TimeArrayTimeZoneRule.java | 101 public Date getNextStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument
105 if (time < base || (!inclusive && time == base)) { in getNextStart()
120 public Date getPreviousStart(long base, int prevOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument
124 if (time < base || (inclusive && time == base)) { in getPreviousStart()
|
| D | AnnualTimeZoneRule.java | 193 public Date getNextStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getNextStart() argument
200 if (d != null && (d.getTime() < base || (!inclusive && (d.getTime() == base)))) { in getNextStart()
211 …public Date getPreviousStart(long base, int prevRawOffset, int prevDSTSavings, boolean inclusive) { in getPreviousStart() argument
218 if (d != null && (d.getTime() > base || (!inclusive && (d.getTime() == base)))) { in getPreviousStart()
|
| /external/tensorflow/tensorflow/contrib/graph_editor/ |
| D | select.py | 331 inclusive=True, argument
374 if inclusive:
384 inclusive=True, argument
450 if not inclusive:
456 inclusive=True, argument
519 if not inclusive:
570 inclusive=forward_inclusive,
576 inclusive=backward_inclusive,
628 inclusive=forward_inclusive,
634 inclusive=backward_inclusive,
|
| /external/tensorflow/tensorflow/contrib/graph_editor/tests/ |
| D | select_test.py | 121 inclusive=False,
219 inclusive=True,
229 inclusive=False,
238 inclusive=False,
245 seed_ops, inclusive=False, within_ops=within_ops)
250 ops = ge.select.get_forward_walk_ops([self.a], inclusive=True)
269 inclusive=True,
278 inclusive=False,
287 inclusive=True,
294 seed_ops, inclusive=True, within_ops=within_ops)
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AMDGPU/ |
| D | memory-legalizer-invalid-syncscope.ll | 11 …known>:0:0: in function invalid_load void (i32*, i32*): Unsupported non-inclusive atomic synchroni…
20 …known>:0:0: in function invalid_store void (i32, i32*): Unsupported non-inclusive atomic synchroni…
28 …0:0: in function invalid_cmpxchg void (i32*, i32, i32): Unsupported non-inclusive atomic synchroni…
37 ; CHECK: error: <unknown>:0:0: in function invalid_rmw void (i32*, i32): Unsupported non-inclusive …
|
| /external/icu/icu4c/source/i18n/ |
| D | rbtz.cpp | 546 RuleBasedTimeZone::getNextTransition(UDate base, UBool inclusive, TimeZoneTransition& result) const… in getNextTransition() argument
554 UBool found = findNext(base, inclusive, transitionTime, fromRule, toRule); in getNextTransition()
565 RuleBasedTimeZone::getPreviousTransition(UDate base, UBool inclusive, TimeZoneTransition& result) c… in getPreviousTransition() argument
573 UBool found = findPrev(base, inclusive, transitionTime, fromRule, toRule); in getPreviousTransition()
738 RuleBasedTimeZone::findNext(UDate base, UBool inclusive, UDate& transitionTime, in findNext() argument
748 if (tt > base || (inclusive && tt == base)) { in findNext()
755 if (inclusive && tt == base) { in findNext()
764 … UBool avail0 = r0->getNextStart(base, r1->getRawOffset(), r1->getDSTSavings(), inclusive, start0); in findNext()
765 … UBool avail1 = r1->getNextStart(base, r0->getRawOffset(), r0->getDSTSavings(), inclusive, start1); in findNext()
789 if (tt < base || (!inclusive && tt == base)) { in findNext()
[all …]
|
| D | zrule.cpp | 131 int32_t prevDSTSavings, UBool inclusive, UDate& result) { in izrule_getNextStart() argument
132 …*)rule)->InitialTimeZoneRule::getNextStart(base, prevRawOffset, prevDSTSavings, inclusive, result); in izrule_getNextStart()
137 int32_t prevDSTSavings, UBool inclusive, UDate& result) { in izrule_getPreviousStart() argument
138 …le)->InitialTimeZoneRule::getPreviousStart(base, prevRawOffset, prevDSTSavings, inclusive, result); in izrule_getPreviousStart()
|
| D | tzrule.cpp | 356 UBool inclusive, in getNextStart() argument
365 if (tmp < base || (!inclusive && (tmp == base))) { in getNextStart()
380 UBool inclusive, in getPreviousStart() argument
389 if (tmp > base || (!inclusive && (tmp == base))) { in getPreviousStart()
546 UBool inclusive, in getNextStart() argument
551 if (time < base || (!inclusive && time == base)) { in getNextStart()
566 UBool inclusive, in getPreviousStart() argument
571 if (time < base || (inclusive && time == base)) { in getPreviousStart()
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| D | RegularContiguousSet.java | 48 @Override ContiguousSet<C> headSetImpl(C toElement, boolean inclusive) { in headSetImpl() argument
49 return intersectionInCurrentDomain(Range.upTo(toElement, BoundType.forBoolean(inclusive))); in headSetImpl()
63 @Override ContiguousSet<C> tailSetImpl(C fromElement, boolean inclusive) { in tailSetImpl() argument
64 return intersectionInCurrentDomain(Range.downTo(fromElement, BoundType.forBoolean(inclusive))); in tailSetImpl()
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| D | SafeTreeSet.java | 122 @Override public NavigableSet<E> headSet(E toElement, boolean inclusive) { in headSet() argument
124 delegate.headSet(checkValid(toElement), inclusive)); in headSet()
186 @Override public NavigableSet<E> tailSet(E fromElement, boolean inclusive) { in tailSet() argument
187 return new SafeTreeSet<E>(delegate.tailSet(checkValid(fromElement), inclusive)); in tailSet()
|