- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 1,008 for nprend (0.04 sec)
-
internal/ioutil/append-file_nix.go
Harshavardhana <******@****.***> 1641143706 -0800
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Jan 02 17:15:06 UTC 2022 - 1.3K bytes - Viewed (0) -
cmd/endpoint-ellipses.go
// Figure out largest value of total_drives_in_erasure_set which results // in least number of total_drives/total_drives_erasure_set ratio. prevD := divisibleSize / setCounts[0] for _, cnt := range setCounts { if divisibleSize%cnt == 0 { d := divisibleSize / cnt if d <= prevD { prevD = d setSize = cnt } } } return setSize } // possibleSetCountsWithSymmetry returns symmetrical setCounts based on the
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 14.7K bytes - Viewed (0) -
src/bytes/buffer.go
} }() // TODO(http://golang.org/issue/51462): We should rely on the append-make // pattern so that the compiler can call runtime.growslice. For example: // return append(b, make([]byte, n)...) // This avoids unnecessary zero-ing of the first len(b) bytes of the // allocated slice, but this pattern causes b to escape onto the heap. // // Instead use the append-make pattern with a nil slice to ensure that
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Fri Nov 14 19:01:17 UTC 2025 - 16.5K bytes - Viewed (0) -
guava/src/com/google/common/io/CharStreams.java
checkNotNull(from); checkNotNull(to); char[] buf = new char[DEFAULT_BUF_SIZE]; int nRead; long total = 0; while ((nRead = from.read(buf)) != -1) { to.append(buf, 0, nRead); total += nRead; } return total; } /** * Copies all characters between the {@link Reader} and {@link Writer} objects. Does not close or
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 29 13:56:24 UTC 2025 - 11.9K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/io/ByteSourceAsCharSourceReadBenchmark.java
try (InputStreamReader reader = new InputStreamReader(byteSource.openStream(), cs)) { int nRead = 0; while (remaining > 0 && (nRead = reader.read(buffer, bufIndex, remaining)) != -1) { bufIndex += nRead; remaining -= nRead; } if (nRead == -1) { // we reached EOF return new String(buffer, 0, bufIndex); }
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 5.2K bytes - Viewed (0) -
compat/maven-model-builder/src/test/resources/poms/inheritance/no-append-urls-child.xml
Guillaume Nodet <******@****.***> 1729859506 +0200
Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 1.3K bytes - Viewed (0) -
fess-crawler/src/main/resources/org/codelibs/fess/crawler/mime/tika-mimetypes.xml
</mime-type> <mime-type type="application/prs.alvestrand.titrax-sheet"/> <mime-type type="application/prs.cww"> <glob pattern="*.cww"/> </mime-type> <mime-type type="application/prs.nprend"/> <mime-type type="application/prs.plucker"/> <mime-type type="application/qsig"/> <mime-type type="application/vnd.ms-spreadsheetml">
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Thu Oct 16 07:46:32 UTC 2025 - 320.2K bytes - Viewed (5) -
cmd/erasure.go
healing++ if inclHealing { healingDisks = append(healingDisks, disks[i]) healingInfos = append(healingInfos, infos[i]) } continue } if !info.Scanning { newDisks = append(newDisks, disks[i]) newInfos = append(newInfos, infos[i]) } else { scanningDisks = append(scanningDisks, disks[i]) scanningInfos = append(scanningInfos, infos[i]) } }Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Sep 28 20:59:21 UTC 2025 - 16.1K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/plugin/PluginParameterException.java
messageBuffer .append("<configuration>") .append(LS) .append(" ...") .append(LS); messageBuffer .append(" <") .append(alias) .append(">VALUE</") .append(alias)Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Wed Jul 23 17:27:08 UTC 2025 - 6.8K bytes - Viewed (0) -
fess-crawler-opensearch/src/test/java/org/codelibs/fess/crawler/util/CrawlerWebServer.java
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sat Mar 15 06:52:00 UTC 2025 - 5K bytes - Viewed (0)