- Sort Score
- Num 10 results
- Language All
Results 111 - 120 of 3,776 for Scan (0.09 seconds)
-
cmd/update.go
// Log errors and return "" as MinIO can be deployed // without Helm charts as well. if !osIsNotExist(err) { reqInfo := (&logger.ReqInfo{}).AppendTags("helmInfoFilePath", helmInfoFilePath) ctx := logger.SetReqInfo(GlobalContext, reqInfo) internalLogIf(ctx, err) } return "" } defer helmInfoFile.Close() scanner := bufio.NewScanner(helmInfoFile) for scanner.Scan() {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 18.9K bytes - Click Count (0) -
cmd/streaming-signature-v4.go
wantTrailers := make(map[string]struct{}, len(cr.trailers)) for k := range cr.trailers { wantTrailers[strings.ToLower(k)] = struct{}{} } input := bufio.NewScanner(bytes.NewReader(valueBuffer.Bytes())) for input.Scan() { line := strings.TrimSpace(input.Text()) if line == "" { continue } // Find first separator. idx := strings.IndexByte(line, trailerKVSeparator[0]) if idx <= 0 || idx >= len(line) {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 18.2K bytes - Click Count (0) -
cmd/common-main.go
case <-ctx.Done(): return true default: return false } } // bgContext returns a context that can be used for async operations. // Cancellation/timeouts are removed, so parent cancellations/timeout will // not propagate from parent. // Context values are preserved. // This can be used for goroutines that live beyond the parent context. func bgContext(parent context.Context) context.Context {
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 32.5K bytes - Click Count (3) -
src/main/java/org/codelibs/fess/mylasta/direction/FessConfig.java
* The value is, e.g. 20 <br> * comment: Maximum scan for query highlight boundaries. * @return The value of found property. (NotNull: if not found, exception but basically no way) */ String getQueryHighlightBoundaryMaxScan(); /** * Get the value for the key 'query.highlight.boundary.max.scan' as {@link Integer}. <br>
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sat Mar 28 06:59:19 GMT 2026 - 576.9K bytes - Click Count (2) -
api/go1.txt
pkg database/sql, method (*DB) QueryRow(string, ...interface{}) *Row pkg database/sql, method (*NullBool) Scan(interface{}) error pkg database/sql, method (*NullFloat64) Scan(interface{}) error pkg database/sql, method (*NullInt64) Scan(interface{}) error pkg database/sql, method (*NullString) Scan(interface{}) error pkg database/sql, method (*Row) Scan(...interface{}) error pkg database/sql, method (*Rows) Close() error
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Wed Aug 14 18:58:28 GMT 2013 - 1.7M bytes - Click Count (0) -
api/go1.13.txt
pkg crypto/x509, const PureEd25519 SignatureAlgorithm pkg database/sql, method (*Conn) Raw(func(interface{}) error) error pkg database/sql, method (*NullInt32) Scan(interface{}) error pkg database/sql, method (NullInt32) Value() (driver.Value, error) pkg database/sql, method (*NullTime) Scan(interface{}) error pkg database/sql, method (NullTime) Value() (driver.Value, error) pkg database/sql, type NullInt32 struct
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Aug 08 18:44:16 GMT 2019 - 452.6K bytes - Click Count (0) -
RELEASE.md
optimal in a non-interactive environment, where you don't have access to stdout, but can only view the logs. You can use `tf.keras.utils.disable_interactive_logging()` to write the logs to ABSL logging. You can also use `tf.keras.utils.enable_interactive_logging()` to change it back to stdout, or
Created: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Mon Mar 30 18:31:38 GMT 2026 - 746.5K bytes - Click Count (3) -
lib/fips140/v1.26.0.zip
uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do that by doubling _W * n times,...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
uint(m.BitLen()) logR := _W * n // We start by computing R = 2^(_W * n) mod m. We can get pretty close, to // 2^⌊log₂m⌋, by setting the highest bit we can without having to reduce. rr.limbs[n-1] = 1 << ((mLen - 1) % _W) // Then we double until we reach 2^(_W * n). for i := mLen - 1; i < logR; i++ { rr.Add(rr, m) } // Next we need to get from R to 2^(_W * n) R mod m (aka from one to R in // the Montgomery domain, meaning we can use Montgomery multiplication now). // We could do that by doubling _W * n times,...
Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/query/QueryFieldConfig.java
/** Array of fields that can be highlighted in search results */ protected String[] highlightedFields; /** Array of fields that can be searched against */ protected String[] searchFields; /** Set of fields that can be searched against for O(1) lookup */ protected Set<String> searchFieldSet; /** Array of fields that can be used for faceted search */ protected String[] facetFields;Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Fri Nov 28 16:29:12 GMT 2025 - 21.9K bytes - Click Count (0)