- Sort Score
- Num 10 results
- Language All
Results 1 - 3 of 3 for mutable (0.07 seconds)
-
RELEASE.md
generic mutable hash table implementation. * Compared to `tf.lookup.experimental.DenseHashTable` this offers lower overall memory usage, and a cleaner API. It does not require specifying a `delete_key` and `empty_key` that cannot be inserted into the table. * Added support for specifying number of subdivisions in all reduce hostCreated: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Tue Oct 28 22:27:41 GMT 2025 - 740.4K bytes - Click Count (3) -
okhttp-idna-mapping-table/src/main/resources/okhttp3/internal/idna/IdnaMappingTable.txt
329B ; mapped ; 5973 # 1.1 CIRCLED IDEOGRAPH FEMALE 329C ; mapped ; 9069 # 1.1 CIRCLED IDEOGRAPH SUITABLE 329D ; mapped ; 512A # 1.1 CIRCLED IDEOGRAPH EXCELLENT 329E ; mapped ; 5370 # 1.1 CIRCLED IDEOGRAPH PRINT
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Sat Feb 10 11:25:47 GMT 2024 - 854.1K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
p2.y, cond) q.z.Select(p1.z, p2.z, cond) 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) { if n >= 16 { panic("nistec:...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0)