- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 139 for RangeTs (0.54 sec)
-
tensorflow/compiler/mlir/lite/stablehlo/transforms/legalize_hlo_conversions/dot_general.cc
template <typename Range, typename... RangeTs> size_t Size(Range&& range, RangeTs&&... ranges) { return range.size() + Size(std::forward<RangeTs>(ranges)...); } // Concats all elements in `ranges` and returns a small vector as a result. template <typename ValueT, typename... RangeTs> llvm::SmallVector<ValueT, 4> Concat(RangeTs&&... ranges) { llvm::SmallVector<int64_t, 4> results;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 19.2K bytes - Viewed (0) -
maven-artifact/src/main/java/org/apache/maven/artifact/versioning/VersionRange.java
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Feb 28 07:40:37 UTC 2024 - 18.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Range.java
* not encompass ranges of the form {@code (v..v)}, because such ranges are <i>invalid</i> and * can't be constructed at all.) * * <p>Note that certain discrete ranges such as the integer range {@code (3..4)} are <b>not</b> * considered empty, even though they contain no actual values. In these cases, it may be helpful * to preprocess ranges with {@link #canonical(DiscreteDomain)}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
* not encompass ranges of the form {@code (v..v)}, because such ranges are <i>invalid</i> and * can't be constructed at all.) * * <p>Note that certain discrete ranges such as the integer range {@code (3..4)} are <b>not</b> * considered empty, even though they contain no actual values. In these cases, it may be helpful * to preprocess ranges with {@link #canonical(DiscreteDomain)}. */
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
src/runtime/mranges.go
coalescesDown := i > 0 && a.ranges[i-1].limit.equal(r.base) coalescesUp := i < len(a.ranges) && r.limit.equal(a.ranges[i].base) if coalescesUp && coalescesDown { // We have neighbors and they both border us. // Merge a.ranges[i-1], r, and a.ranges[i] together into a.ranges[i-1]. a.ranges[i-1].limit = a.ranges[i].limit // Delete a.ranges[i]. copy(a.ranges[i:], a.ranges[i+1:]) a.ranges = a.ranges[:len(a.ranges)-1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
ImmutableRangeSet(ImmutableList<Range<C>> ranges) { this.ranges = ranges; } private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { this.ranges = ranges; this.complement = complement; } private final transient ImmutableList<Range<C>> ranges; @Override public boolean intersects(Range<C> otherRange) { int ceilingIndex = SortedLists.binarySearch(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 27.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableRangeSet.java
ImmutableRangeSet(ImmutableList<Range<C>> ranges) { this.ranges = ranges; } private ImmutableRangeSet(ImmutableList<Range<C>> ranges, ImmutableRangeSet<C> complement) { this.ranges = ranges; this.complement = complement; } private final transient ImmutableList<Range<C>> ranges; @Override public boolean intersects(Range<C> otherRange) { int ceilingIndex = SortedLists.binarySearch(
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 26.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeMap.java
} else { Range<K> range = ranges.get(index); return range.contains(key) ? Maps.immutableEntry(range, values.get(index)) : null; } } @Override public Range<K> span() { if (ranges.isEmpty()) { throw new NoSuchElementException(); } Range<K> firstRange = ranges.get(0); Range<K> lastRange = ranges.get(ranges.size() - 1);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 14.4K bytes - Viewed (0) -
src/cmd/compile/internal/dwarfgen/dwinl.go
} } // unifyCallRanges ensures that the ranges for a given inline // transitively include all of the ranges for its child inlines. func unifyCallRanges(inlcalls dwarf.InlCalls, idx int) { ic := &inlcalls.Calls[idx] for _, childIdx := range ic.Children { // First make sure child ranges are unified. unifyCallRanges(inlcalls, childIdx) // Then merge child ranges into ranges for this inline. cic := inlcalls.Calls[childIdx]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:45:07 UTC 2024 - 12.8K bytes - Viewed (0) -
src/internal/trace/testtrace/validation.go
ranges, ok := v.ranges[r] return ok && slices.Contains(ranges, name) } func (v *Validator) addRange(r trace.ResourceID, name string) { ranges, _ := v.ranges[r] ranges = append(ranges, name) v.ranges[r] = ranges } func (v *Validator) hasAnyRange(r trace.ResourceID) bool { ranges, ok := v.ranges[r] return ok && len(ranges) != 0 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 10.9K bytes - Viewed (0)