- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for Pearce (0.41 sec)
-
cmd/metacache-set.go
return 0, errFileNotFound } if tmp.First >= search { o.debugln("First >= search", v) return i, nil } if tmp.Last >= search { o.debugln("Last >= search", v) return i, nil } if tmp.EOS { o.debugln("no match, at EOS", v) return -3, io.EOF } o.debugln("First ", tmp.First, "<", search, " search", i) i++ } }
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Fri Apr 26 19:52:52 GMT 2024 - 30.4K bytes - Viewed (0) -
tests/query_test.go
t.Errorf("Offset should work without limit.") } } func TestSearchWithMap(t *testing.T) { users := []User{ *GetUser("map_search_user1", Config{}), *GetUser("map_search_user2", Config{}), *GetUser("map_search_user3", Config{}), *GetUser("map_search_user4", Config{Company: true}), } DB.Create(&users) var user User DB.First(&user, map[string]interface{}{"name": users[0].Name})
Go - Registered: Sun Apr 28 09:35:09 GMT 2024 - Last Modified: Thu Apr 25 12:22:53 GMT 2024 - 49.8K bytes - Viewed (0) -
cmd/data-usage-cache.go
ch := d.Cache[h.String()].Children res := make(dataUsageHashMap, len(ch)) for k := range ch { res[k] = struct{}{} } return res } // searchParent will search for the parent of h. // This is an O(N*N) operation if there is no parent or it cannot be guessed. func (d *dataUsageCache) searchParent(h dataUsageHash) *dataUsageHash { want := h.Key()
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Mon Apr 22 17:49:30 GMT 2024 - 41.4K bytes - Viewed (1) -
cmd/api-response.go
NextKeyMarker string `xml:"NextKeyMarker,omitempty"` // When the number of responses exceeds the value of MaxKeys, // NextVersionIdMarker specifies the first object version not // returned that satisfies the search criteria. Use this value // for the version-id-marker request parameter in a subsequent request. NextVersionIDMarker string `xml:"NextVersionIdMarker"` // Marks the last version of the Key returned in a truncated response.
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 33.3K bytes - Viewed (2) -
cni/pkg/plugin/plugin_test.go
"capabilities": { "testCapability": false }, "ipam": { "type": "testIPAM" }, "dns": { "nameservers": ["testNameServer"], "domain": "testDomain", "search": ["testSearch"], "options": ["testOption"] }, "prevResult": { "cniversion": "%s", "interfaces": [ { "name": "%s", "sandbox": "%s"
Go - Registered: Wed May 01 22:53:12 GMT 2024 - Last Modified: Sat Feb 10 00:31:55 GMT 2024 - 17.5K bytes - Viewed (0) -
internal/config/identity/ldap/ldap.go
err = conn.Bind(bindDN, password) if err != nil { errRet := fmt.Errorf("LDAP auth failed for DN %s: %w", bindDN, err) return "", nil, errRet } // Bind to the lookup user account again to perform group search. if err = l.LDAP.LookupBind(conn); err != nil { return "", nil, err } // User groups lookup. groups, err := l.LDAP.SearchForUserGroups(conn, username, bindDN) if err != nil { return "", nil, err
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 25 15:50:16 GMT 2024 - 9.9K bytes - Viewed (0) -
cmd/xl-storage-format-v2.go
} // Add space at the end. // Will have -1 modtime, so it will be inserted there. x.versions = append(x.versions, xlMetaV2ShallowVersion{header: xlMetaV2VersionHeader{ModTime: -1}}) // Linear search, we likely have to insert at front. for i, existing := range x.versions { if existing.header.ModTime <= modTime { // Insert at current idx. First move current back. copy(x.versions[i+1:], x.versions[i:])
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Tue Apr 23 05:07:37 GMT 2024 - 63.6K bytes - Viewed (1) -
cmd/sts-handlers_test.go
fmt.Sprintf("server_addr=%s", serverAddr), "server_insecure=on", "lookup_bind_dn=cn=admin,dc=min,dc=io", "lookup_bind_password=admin", "user_dn_search_base_dn=dc=min,dc=io", "user_dn_search_filter=(uid=%s)", "group_search_base_dn=ou=swengg,dc=min,dc=io", "group_search_filter=(&(objectclass=groupofnames)(member=%d))", } _, err := s.adm.SetConfigKV(ctx, strings.Join(configCmds, " ")) if err != nil {
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Thu Apr 25 15:50:16 GMT 2024 - 85.7K bytes - Viewed (0) -
docs/debugging/xl-meta/main.go
all files in testdir ending with '.txt', directories can be wildcards as well. 'testdir/*/*.txt' will match 'testdir/subdir/b.txt', double stars means full recursive. 'testdir/**/xl.meta' will search for all xl.meta recursively. FLAGS: {{range .VisibleFlags}}{{.}} {{end}} ` app.HideHelpCommand = true app.Flags = []cli.Flag{ cli.BoolFlag{
Go - Registered: Sun Apr 28 19:28:10 GMT 2024 - Last Modified: Wed Apr 24 17:56:22 GMT 2024 - 20.2K bytes - Viewed (1) -
src/archive/zip/zip_test.go
a[0] = b for i, l := 1, len(a); i < l; i *= 2 { copy(a[i:], a[:i]) } } func (r *rleBuffer) ReadAt(p []byte, off int64) (n int, err error) { if len(p) == 0 { return } skipParts := sort.Search(len(r.buf), func(i int) bool { part := &r.buf[i] return part.off+part.n > off }) parts := r.buf[skipParts:] if len(parts) > 0 { skipBytes := off - parts[0].off for _, part := range parts {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Mar 27 18:23:49 GMT 2024 - 19.5K bytes - Viewed (0)