- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 173 for RangeTs (0.1 sec)
-
src/cmd/trace/gen.go
// It expects ev to be one such event. func (g *globalRangeGenerator) GlobalRange(ctx *traceContext, ev *trace.Event) { if g.ranges == nil { g.ranges = make(map[string]activeRange) } r := ev.Range() switch ev.Kind() { case trace.EventRangeBegin: g.ranges[r.Name] = activeRange{ev.Time(), ev.Stack()} case trace.EventRangeActive: // If we've seen a Sync event, then Active events are always redundant.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 18:48:18 UTC 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
/** * A set comprising zero or more {@linkplain Range#isEmpty nonempty}, {@linkplain * Range#isConnected(Range) disconnected} ranges of type {@code C}. * * <p>Implementations that choose to support the {@link #add(Range)} operation are required to * ignore empty ranges and coalesce connected ranges. For example: * * <pre>{@code * RangeSet<Integer> rangeSet = TreeRangeSet.create(); * rangeSet.add(Range.closed(1, 10)); // {[1, 10]}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 9.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/RangeSet.java
/** * A set comprising zero or more {@linkplain Range#isEmpty nonempty}, {@linkplain * Range#isConnected(Range) disconnected} ranges of type {@code C}. * * <p>Implementations that choose to support the {@link #add(Range)} operation are required to * ignore empty ranges and coalesce connected ranges. For example: * * <pre>{@code * RangeSet<Integer> rangeSet = TreeRangeSet.create(); * rangeSet.add(Range.closed(1, 10)); // {[1, 10]}
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 10.2K bytes - Viewed (0) -
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: Sat May 04 14:31:50 UTC 2024 - 14.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/TreeRangeMapTest.java
for (Range<Integer> range : RANGES) { Map<Integer, Integer> model = Maps.newHashMap(); putModel(model, range, 1); RangeMap<Integer, Integer> test = TreeRangeMap.create(); test.put(range, 1); verify(model, test); } } public void testAllRangePairs() { for (Range<Integer> range1 : RANGES) { for (Range<Integer> range2 : RANGES) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 20:09:59 UTC 2024 - 33.2K bytes - Viewed (0) -
src/unicode/letter.go
func is32(ranges []Range32, r uint32) bool { if len(ranges) <= linearMax { for i := range ranges { range_ := &ranges[i] if r < range_.Lo { return false } if r <= range_.Hi { return range_.Stride == 1 || (r-range_.Lo)%range_.Stride == 0 } } return false } // binary search over ranges lo := 0 hi := len(ranges) for lo < hi {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 06 20:02:46 UTC 2023 - 10K bytes - Viewed (0) -
src/cmd/internal/dwarf/dwarf.go
out = append(out, cur) } } return out } // UnifyRanges merges the ranges from 'c' into the list of ranges for 's'. func (s *Scope) UnifyRanges(c *Scope) { s.Ranges = MergeRanges(s.Ranges, c.Ranges) } // AppendRange adds r to s, if r is non-empty. // If possible, it extends the last Range in s.Ranges; if not, it creates a new one. func (s *Scope) AppendRange(r Range) { if r.End <= r.Start {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 06 15:23:18 UTC 2024 - 43K bytes - Viewed (0) -
src/debug/dwarf/entry_test.go
} ranges, err := d.Ranges(entry) if err != nil { t.Errorf("%s: subprogram %d: %v", test.filename, i, err) continue } if !reflect.DeepEqual(ranges, subprograms[i].ranges) { t.Errorf("%s: subprogram %d ranges are %x, expected %x", test.filename, i, ranges, subprograms[i].ranges) } i++ } if i < len(subprograms) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 18 20:34:36 UTC 2023 - 16.1K bytes - Viewed (0) -
src/debug/dwarf/entry.go
} return cu, 0, nil } func (d *Data) dwarf2Ranges(u *unit, base uint64, ranges int64, ret [][2]uint64) ([][2]uint64, error) { if ranges < 0 || ranges > int64(len(d.ranges)) { return nil, fmt.Errorf("invalid range offset %d (max %d)", ranges, len(d.ranges)) } buf := makeBuf(d, u, "ranges", Offset(ranges), d.ranges[ranges:]) for len(buf.data) > 0 { low := buf.addr() high := buf.addr()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 30.7K bytes - Viewed (0) -
src/net/http/fs.go
} if i >= size { i = size - 1 } r.length = i - r.start + 1 } } ranges = append(ranges, r) } if noOverlap && len(ranges) == 0 { // The specified ranges did not overlap with the content. return nil, errNoOverlap } return ranges, nil } // countingWriter counts how many bytes have been written to it. type countingWriter int64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 17:06:47 UTC 2024 - 31.1K bytes - Viewed (0)