- Sort Score
- Result 10 results
- Languages All
Results 1461 - 1470 of 8,116 for FOR (0.02 sec)
-
guava/src/com/google/common/io/CharSource.java
*/ public ByteSource asByteSource(Charset charset) { return new AsByteSource(charset); } /** * Opens a new {@link Reader} for reading from this source. This method returns a new, independent * reader each time it is called. * * <p>The caller is responsible for ensuring that the returned reader is closed. * * @throws IOException if an I/O error occurs while opening the reader */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 16 17:42:14 UTC 2025 - 25.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
} CyclicBarrier barrier = new CyclicBarrier( 6 // for the setter threads + 50 // for the listeners + 50 // for the blocking get threads, + 1); // for the main thread ExecutorService executor = newFixedThreadPool(barrier.getParties());
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 11 18:52:30 UTC 2025 - 46.8K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* * @param array the array to search for the sequence {@code target} * @param target the array to search for as a sub-sequence of {@code array} */ public static int indexOf(long[] array, long[] target) { checkNotNull(array, "array"); checkNotNull(target, "target"); if (target.length == 0) { return 0; } outer: for (int i = 0; i < array.length - target.length + 1; i++) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 29.1K bytes - Viewed (0) -
src/cmd/cgo/ast.go
case *ast.File: f.walk(n.Decls, ctxDecl, visit) case *ast.Package: for _, file := range n.Files { f.walk(file, ctxFile, visit) } case []ast.Decl: for _, d := range n { f.walk(d, context, visit) } case []ast.Expr: for i := range n { f.walk(&n[i], context, visit) } case []ast.Stmt: for _, s := range n { f.walk(s, context, visit) } case []ast.Spec:
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Oct 14 15:47:06 UTC 2024 - 14.3K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/general/admin_general.jsp
<la:checkbox styleId="webApiJson" styleClass="form-check-input" property="webApiJson"/> <label for="webApiJson" class="form-check-label"> <la:message key="labels.enabled"/> </label> </div>
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Sat Jun 14 00:36:40 UTC 2025 - 39.6K bytes - Viewed (0) -
src/main/webapp/WEB-INF/view/admin/webconfig/admin_webconfig_edit.jsp
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Feb 13 07:47:04 UTC 2020 - 15.9K bytes - Viewed (0) -
src/main/java/org/codelibs/core/collection/SLinkedList.java
Registered: Fri Sep 05 20:58:11 UTC 2025 - Last Modified: Thu Jun 19 09:12:22 UTC 2025 - 10.5K bytes - Viewed (0) -
callbacks/query.go
clauseSelect.Columns = make([]clause.Column, len(db.Statement.Schema.DBNames)) for idx, dbName := range db.Statement.Schema.DBNames { clauseSelect.Columns[idx] = clause.Column{Table: db.Statement.Table, Name: dbName} } } specifiedRelationsName := map[string]string{clause.CurrentTable: clause.CurrentTable} for _, join := range db.Statement.Joins { if db.Statement.Schema != nil {
Registered: Sun Sep 07 09:35:13 UTC 2025 - Last Modified: Sun May 25 07:40:40 UTC 2025 - 10.4K bytes - Viewed (3) -
src/main/java/org/codelibs/fess/app/web/base/SearchForm.java
*/ public String[] ex_q; /** * The starting position for search results pagination. */ @ValidateTypeFailure public Integer start; /** * The offset for search results. */ @ValidateTypeFailure public Integer offset; /** * The page number for pagination. */ @ValidateTypeFailure public Integer pn; /**
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Aug 07 03:06:29 UTC 2025 - 5.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
for (int i = 0; i < size; i++) { root = Optional.of(new BinaryNode(rng.nextInt(), root, Optional.<BinaryNode>absent())); } return root; } }, ALL_RIGHT { @Override Optional<BinaryNode> createTree(int size, Random rng) { Optional<BinaryNode> root = Optional.absent(); for (int i = 0; i < size; i++) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.9K bytes - Viewed (0)