- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 365 for Hole (0.18 sec)
-
guava-testlib/src/com/google/common/collect/testing/testers/NavigableSetNavigationTester.java
* a "hole" in it so that set tests of {@code ContiguousSet} can suppress them with {@code * FeatureSpecificTestSuiteBuilder.suppressing()}. */ /* * TODO(cpovirk): or we could make HOLES_FORBIDDEN a feature. Or we could declare that * implementations are permitted to throw IAE if a hole is requested, and we could update
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.3K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/testers/NavigableSetNavigationTester.java
* a "hole" in it so that set tests of {@code ContiguousSet} can suppress them with {@code * FeatureSpecificTestSuiteBuilder.suppressing()}. */ /* * TODO(cpovirk): or we could make HOLES_FORBIDDEN a feature. Or we could declare that * implementations are permitted to throw IAE if a hole is requested, and we could update
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
return minChildIndex; } return crossOverUp(index, x); } /** * Fills the hole at {@code index} by moving in the least of its grandchildren to this position, * then recursively filling the new hole created. * * @return the position of the new hole (where the lowest grandchild moved from, that had no * grandchild to replace it) */ int fillHoleAt(int index) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
src/archive/tar/common.go
// {Offset: 18, Length: 3}, // Data fragment for 18..20 // } // var sph sparseHoles = []sparseEntry{ // {Offset: 0, Length: 2}, // Hole fragment for 0..1 // {Offset: 7, Length: 11}, // Hole fragment for 7..17 // {Offset: 21, Length: 4}, // Hole fragment for 21..24 // } // // Then the content of the resulting sparse file with a Header.Size of 25 is: //
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24.7K bytes - Viewed (2) -
src/archive/tar/writer.go
b0 := b endPos := sw.pos + int64(len(b)) for endPos > sw.pos && err == nil { var nf int // Bytes written in fragment dataStart, dataEnd := sw.sp[0].Offset, sw.sp[0].endOffset() if sw.pos < dataStart { // In a hole fragment bf := b[:min(int64(len(b)), dataStart-sw.pos)] nf, err = zeroWriter{}.Write(bf) } else { // In a data fragment bf := b[:min(int64(len(b)), dataEnd-sw.pos)] nf, err = sw.fw.Write(bf) }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 18:36:46 GMT 2023 - 19.6K bytes - Viewed (0) -
src/archive/tar/reader.go
} else { // In a hole fragment nf = holeEnd - sr.pos if sr.physicalRemaining() == 0 { writeLastByte = true nf-- } _, err = ws.Seek(nf, io.SeekCurrent) } sr.pos += nf if sr.pos >= holeEnd && len(sr.sp) > 1 { sr.sp = sr.sp[1:] // Ensure last fragment always remains } } // If the last fragment is a hole, then seek to 1-byte before EOF, and
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 08 01:59:14 GMT 2024 - 26.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
protected final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) { List<Integer> elements = newArrayList(elementsSet); /* * A ContiguousSet can't have holes. If a test demands a hole, it should be changed so that it * doesn't need one, or it should be suppressed for ContiguousSet. */ for (int i = 0; i < elements.size() - 1; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 15.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/google/SetGenerators.java
protected final ContiguousSet<Integer> checkedCreate(SortedSet<Integer> elementsSet) { List<Integer> elements = newArrayList(elementsSet); /* * A ContiguousSet can't have holes. If a test demands a hole, it should be changed so that it * doesn't need one, or it should be suppressed for ContiguousSet. */ for (int i = 0; i < elements.size() - 1; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 15.5K bytes - Viewed (0) -
src/archive/tar/writer_test.go
SparseHoles: []sparseEntry{{Offset: 1000, Length: 0}}, }, nil}, testWrite{strings.Repeat("0123456789", 100), 1000, nil}, testClose{}, }, }, { file: "testdata/gnu-nil-sparse-hole.tar", tests: []testFnc{ testHeader{Header{ Typeflag: TypeGNUSparse, Name: "sparse.db", Size: 1000, SparseHoles: []sparseEntry{{Offset: 0, Length: 1000}},
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Tue Feb 27 16:39:23 GMT 2024 - 38.7K bytes - Viewed (0) -
src/archive/tar/reader_test.go
Size: 1000, ModTime: time.Unix(0, 0), Format: FormatGNU, }}, }, { // Generated by Go, works on BSD tar v3.1.2 and GNU tar v.1.27.1. file: "testdata/gnu-nil-sparse-hole.tar", headers: []*Header{{ Name: "sparse.db", Typeflag: TypeGNUSparse, Size: 1000, ModTime: time.Unix(0, 0), Format: FormatGNU, }}, }, {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Nov 21 21:14:38 GMT 2022 - 47.1K bytes - Viewed (0)