- Sort Score
- Num 10 results
- Language All
Results 401 - 410 of 494 for Selects (0.05 seconds)
-
fess-crawler/src/main/java/org/codelibs/fess/crawler/extractor/impl/TikaExtractor.java
logger.debug("metadata: {}", metadata); } return metadata; } // workaround: Tika does not have extention points. /** * This class is a parser that detects the document type. */ protected class TikaDetectParser extends CompositeParser { private static final long serialVersionUID = 1L; /**
Created: Sat Dec 20 11:21:39 GMT 2025 - Last Modified: Sun Nov 23 12:19:14 GMT 2025 - 30.8K bytes - Click Count (0) -
src/main/java/jcifs/util/SmbCircuitBreaker.java
* @param exception the failure exception */ void onFailure(SmbCircuitBreaker circuitBreaker, Exception exception); /** * Called when circuit breaker rejects a request * * @param circuitBreaker the circuit breaker */ void onCallRejected(SmbCircuitBreaker circuitBreaker); } /**Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 30 05:58:03 GMT 2025 - 33.4K bytes - Click Count (0) -
docs/en/docs/tutorial/sql-databases.md
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Tue Dec 02 05:06:56 GMT 2025 - 15.8K bytes - Click Count (0) -
docs/de/docs/tutorial/sql-databases.md
### Helden lesen { #read-heroes } Wir können `Hero`s aus der Datenbank mit einem `select()` **lesen**. Wir können ein `limit` und `offset` hinzufügen, um die Ergebnisse zu paginieren. {* ../../docs_src/sql_databases/tutorial001_an_py310.py ln[48:55] hl[51:52,54] *} ### Einen Helden lesen { #read-one-hero }Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Tue Dec 02 17:32:56 GMT 2025 - 18.1K bytes - Click Count (0) -
docs/en/docs/advanced/behind-a-proxy.md
<img src="/img/tutorial/behind-a-proxy/image03.png"> /// tip The docs UI will interact with the server that you select. /// /// note | Technical Details The `servers` property in the OpenAPI specification is optional.
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 20:41:43 GMT 2025 - 16.4K bytes - Click Count (0) -
cmd/peer-rest-server.go
// We have however a dynamic downstream buffer (ch). buf := bytes.NewBuffer(grid.GetByteBuffer()) enc := json.NewEncoder(buf) tmpEvt := struct{ Records []event.Event }{[]event.Event{{}}} for { select { case <-ctx.Done(): grid.PutByteBuffer(buf.Bytes()) return nil case ev := <-ch: buf.Reset() tmpEvt.Records[0] = ev if err := enc.Encode(tmpEvt); err != nil {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 53.6K bytes - Click Count (0) -
doc/go_spec.html
statement</a>.</li> </ul> </li> <li> A <a href="#Select_statements">"select" statement</a> in which: <ul> <li>there are no "break" statements referring to the "select" statement, and</li> <li>the statement lists in each case, including the default if present, end in a terminating statement.</li> </ul> </li> <li>
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Dec 02 23:07:19 GMT 2025 - 286.5K bytes - Click Count (1) -
src/main/java/jcifs/smb/DfsImpl.java
if (log.isDebugEnabled()) { log.debug("Adding key " + key + " to " + dr); } /* * Subtract the server and share from the pathConsumed so that * it reflects the part of the relative path consumed and not * the entire path. */ DfsReferralDataInternal next = dri; do {Created: Sat Dec 20 13:44:44 GMT 2025 - Last Modified: Sat Aug 16 01:32:48 GMT 2025 - 29.7K bytes - Click Count (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/legacy/resolver/DefaultLegacyArtifactCollector.java
previous.getArtifact().setVersionRange(newRange); node.getArtifact().setVersionRange(currentRange.restrict(previousRange)); // Select an appropriate available version from the (now restricted) range // Note this version was selected before to get the appropriate POM
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Fri Jun 06 14:28:57 GMT 2025 - 36.5K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashMap.java
// the `keys` and `values` arrays do not need to change. But because the "short hash" now has a // different number of bits, we must rewrite each element of `entries` so that its contribution // to the full hashcode reflects the change, and so that its `next` link corresponds to the new // linked list of entries with the new short hash. for (int oldTableIndex = 0; oldTableIndex <= oldMask; oldTableIndex++) {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 39.6K bytes - Click Count (0)