- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 67 for Clement (0.69 sec)
-
internal/s3select/sql/parser.go
// Expression represents a logical disjunction of clauses type Expression struct { And []*AndCondition `parser:"@@ ( \"OR\" @@ )*"` } // ListExpr represents a literal list with elements as expressions. type ListExpr struct { Elements []*Expression `parser:"\"(\" @@ ( \",\" @@ )* \")\" | \"[\" @@ ( \",\" @@ )* \"]\""` } // AndCondition represents logical conjunction of clauses type AndCondition struct {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Jan 18 07:03:17 GMT 2024 - 12.9K bytes - Viewed (0) -
cmd/erasure.go
// Get an aggregated storage info across all disks. func getStorageInfo(disks []StorageAPI, endpoints []Endpoint, metrics bool) StorageInfo { disksInfo := getDisksInfo(disks, endpoints, metrics) // Sort so that the first element is the smallest. sort.Slice(disksInfo, func(i, j int) bool { return disksInfo[i].TotalSpace < disksInfo[j].TotalSpace }) storageInfo := StorageInfo{ Disks: disksInfo, }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 26 06:32:14 GMT 2024 - 16K bytes - Viewed (1) -
internal/bucket/lifecycle/filter_test.go
package lifecycle import ( "encoding/xml" "fmt" "testing" "github.com/dustin/go-humanize" ) // TestUnsupportedFilters checks if parsing Filter xml with // unsupported elements returns appropriate errors func TestUnsupportedFilters(t *testing.T) { testCases := []struct { inputXML string expectedErr error }{ { // Filter with And tags inputXML: ` <Filter> <And>
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Feb 27 00:01:20 GMT 2024 - 7.2K bytes - Viewed (0) -
internal/s3select/sql/aggregation.go
err := ex.aggregateRow(r, tableAlias) if err != nil { return err } } return nil } func (e *ListExpr) aggregateRow(r Record, tableAlias string) error { for _, ex := range e.Elements { err := ex.aggregateRow(r, tableAlias) if err != nil { return err } } return nil } func (e *AndCondition) aggregateRow(r Record, tableAlias string) error {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat Dec 23 07:19:11 GMT 2023 - 7.9K bytes - Viewed (0) -
operator/cmd/mesh/install.go
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Thu May 02 14:30:43 GMT 2024 - 15.5K bytes - Viewed (1) -
cmd/data-usage-cache.go
} //msgp:ignore dataUsageEntryInfo type dataUsageEntryInfo struct { Name string Parent string Entry dataUsageEntry } type dataUsageCacheInfo struct { // Name of the bucket. Also root element. Name string NextCycle uint32 LastUpdate time.Time // indicates if the disk is being healed and scanner // should skip healing the disk SkipHealing bool
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 22 17:49:30 GMT 2024 - 41.4K bytes - Viewed (1) -
internal/s3select/sql/analysis.go
if e.Operand != nil { result = e.Operand.analyze(s) } else { result = e.Not.analyze(s) } return } func (e *ListExpr) analyze(s *Select) (result qProp) { for _, ac := range e.Elements { result.combine(ac.analyze(s)) } return } func (e *ConditionOperand) analyze(s *Select) (result qProp) { if e.ConditionRHS == nil { result = e.Operand.analyze(s) } else {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat Dec 23 07:19:11 GMT 2023 - 8.5K bytes - Viewed (0) -
tests/update_test.go
var result ElementWithIgnoredField if err := DB.First(&result, elem.Id).Error; err != nil { t.Errorf("error getting an element from database: %s", err.Error()) } if result.IgnoredField != 0 { t.Errorf("element's ignored field should not be updated") } } func TestUpdateFromSubQuery(t *testing.T) { user := *GetUser("update_from_sub_query", Config{Company: true})
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Mon Dec 04 03:50:58 GMT 2023 - 30.3K bytes - Viewed (0) -
internal/logger/logger.go
// will be called for a pretty rendering of fatal errors. func RegisterError(f func(string, error, bool) string) { errorFmtFunc = f } // uniq swaps away duplicate elements in data, returning the size of the // unique set. data is expected to be pre-sorted, and the resulting set in // the range [0:size] will remain in sorted order. Uniq, following a
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sat May 04 00:17:57 GMT 2024 - 12.4K bytes - Viewed (0) -
src/bytes/buffer.go
// // Instead use the append-make pattern with a nil slice to ensure that // we allocate buffers rounded up to the closest size class. c := len(b) + n // ensure enough space for n elements if c < 2*cap(b) { // The growth rate has historically always been 2x. In the future, // we could rely purely on append to determine the growth rate. c = 2 * cap(b) }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Oct 13 17:10:31 GMT 2023 - 15.7K bytes - Viewed (0)