- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 788 for Tables (0.12 sec)
-
src/image/jpeg/writer.go
// - the marker length "\x00\x0c", // - the number of components "\x03", // - component 1 uses DC table 0 and AC table 0 "\x01\x00", // - component 2 uses DC table 1 and AC table 1 "\x02\x11", // - component 3 uses DC table 1 and AC table 1 "\x03\x11", // - the bytes "\x00\x3f\x00". Section B.2.3 of the spec says that for
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 17.1K bytes - Viewed (0) -
src/database/sql/fakedb_test.go
return fmt.Errorf("fakedb: create table of %q len(names) != len(types): %d vs %d", name, len(columnNames), len(columnTypes)) } db.tables[name] = &table{colname: columnNames, coltype: columnTypes} return nil } // must be called with db.mu lock held func (db *fakeDB) table(table string) (*table, bool) { if db.tables == nil { return nil, false } t, ok := db.tables[table] return t, ok }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 01 12:38:07 UTC 2024 - 30.3K bytes - Viewed (0) -
src/compress/flate/inflate.go
} // The data structure for decoding Huffman tables is based on that of // zlib. There is a lookup table of a fixed bit width (huffmanChunkBits), // For codes smaller than the table width, there are multiple entries // (each combination of trailing bits has the same value). For codes // larger than the table width, the table contains a link to an overflow // table. The width of each entry in the link table is the maximum code // size minus the chunk width.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 13 23:20:03 UTC 2023 - 20.4K bytes - Viewed (0) -
platforms/ide/ide-plugins/src/integTest/groovy/org/gradle/plugins/ide/idea/IdeaIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Mar 22 01:27:55 UTC 2024 - 19.3K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/profile/merge.go
if v != 0 { return false } } return true } type profileMerger struct { p *Profile // Memoization tables within a profile. locationsByID locationIDMap functionsByID map[uint64]*Function mappingsByID map[uint64]mapInfo // Memoization tables for profile entities. samples map[sampleKey]*Sample locations map[locationKey]*Location functions map[functionKey]*Function
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 17K bytes - Viewed (0) -
docs/en/docs/tutorial/sql-databases.md
An ORM has tools to convert ("*map*") between *objects* in code and database tables ("*relations*"). With an ORM, you normally create a class that represents a table in a SQL database, each attribute of the class represents a column, with a name and a type. For example a class `Pet` could represent a SQL table `pets`. And each *instance* object of that class represents a row in the database.
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Thu Apr 18 19:53:19 UTC 2024 - 29.6K bytes - Viewed (0) -
src/crypto/internal/nistec/p256.go
// A p256Table holds the first 15 multiples of a point at offset -1, so [1]P // is at table[0], [15]P is at table[14], and [0]P is implicitly the identity // point. type p256Table [15]*P256Point // Select selects the n-th multiple of the table base point into p. It works in // constant time by iterating over every entry of the table. n must be in [0, 15]. func (table *p256Table) Select(p *P256Point, n uint8) { if n >= 16 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 17.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/passes.h
// native TFLite variables or not. std::unique_ptr<OperationPass<ModuleOp>> CreateAnalyzeVariablesPass(); // Creates a pass which is responsible for legalizing TensorFlow static hash // tables to TensorFlow Lite hash tables. std::unique_ptr<OperationPass<ModuleOp>> CreateLegalizeHashTablesPass(); // Creates get arithmetic count pass, which will calculate the arithmetic count // for each ops.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Mar 07 21:29:34 UTC 2024 - 10.9K bytes - Viewed (0) -
src/crypto/internal/nistec/generate.go
return q } // A {{.p}}Table holds the first 15 multiples of a point at offset -1, so [1]P // is at table[0], [15]P is at table[14], and [0]P is implicitly the identity // point. type {{.p}}Table [15]*{{.P}}Point // Select selects the n-th multiple of the table base point into p. It works in // constant time by iterating over every entry of the table. n must be in [0, 15]. func (table *{{.p}}Table) Select(p *{{.P}}Point, n uint8) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 19.7K bytes - Viewed (0) -
callbacks/query.go
Column: clause.Column{Table: parentTableName, Name: ref.PrimaryKey.DBName}, Value: clause.Column{Table: tableAliasName, Name: ref.ForeignKey.DBName}, } } else { if ref.PrimaryValue == "" { exprs[idx] = clause.Eq{ Column: clause.Column{Table: parentTableName, Name: ref.ForeignKey.DBName}, Value: clause.Column{Table: tableAliasName, Name: ref.PrimaryKey.DBName},
Registered: Wed Jun 12 16:27:09 UTC 2024 - Last Modified: Wed Jun 12 09:51:44 UTC 2024 - 10.1K bytes - Viewed (0)