- Sort Score
- Result 10 results
- Languages All
Results 121 - 130 of 4,111 for Tables (0.11 sec)
-
android/guava/src/com/google/common/collect/HashMultimap.java
import java.io.ObjectOutputStream; import java.util.Collection; import java.util.Map; import java.util.Set; import org.checkerframework.checker.nullness.qual.Nullable; /** * Implementation of {@link Multimap} using hash tables. * * <p>The multimap does not store duplicate key-value pairs. Adding a new key-value pair equal to an * existing key-value pair has no effect. *
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 06 16:06:58 UTC 2023 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractTable.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Jul 15 15:41:16 UTC 2021 - 6.1K bytes - Viewed (0) -
src/cmd/link/internal/wasm/asm.go
} writeSecSize(ctxt, sizeOffset) } // writeElementSec writes the section that initializes the tables declared by the "table" section. // The table for CallIndirect gets initialized in a very simple way so that each table index (PC_F value) // maps linearly to the function index (numImports + PC_F). func writeElementSec(ctxt *ld.Link, numImports, numFns uint64) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:17:48 UTC 2024 - 21.9K bytes - Viewed (0) -
src/crypto/aes/aes_test.go
t.Errorf("sbox0[sbox1[%#x]] = %#x", i, j) } if j := sbox1[sbox0[i]]; j != byte(i) { t.Errorf("sbox1[sbox0[%#x]] = %#x", i, j) } } } // Test that encryption tables are correct. // (Can adapt this code to generate them too.) func TestTe(t *testing.T) { for i := 0; i < 256; i++ { s := uint32(sbox0[i]) s2 := mul(s, 2) s3 := mul(s, 3) w := s2<<24 | s<<16 | s<<8 | s3
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 14:58:19 UTC 2024 - 12.5K bytes - Viewed (0) -
dbflute_fess/dfprop/documentMap.dfprop
# o isSuppressSchemaHtmlOutsideSql: (NotRequired - Default false) # Does it remove outsideSql information from SchemaHtml? # Basically you don't need this. # OutsideSql information (related to tables) is very useful. # #; isSuppressSchemaHtmlOutsideSql = false # - - - - - - - - - -/ # /- - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Sat Oct 31 23:35:14 UTC 2015 - 9.4K bytes - Viewed (0) -
src/hash/crc32/gen_const_ppc64le.go
// This code was written in Go based on the original C implementation. // This is a tool needed to generate the appropriate constants needed for // the vpmsum algorithm. It is included to generate new constant tables if // new polynomial values are included in the future. package main import ( "bytes" "fmt" "os" ) var blocking = 32 * 1024 func reflect_bits(b uint64, nr uint) uint64 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 19 20:44:20 UTC 2024 - 4.5K bytes - Viewed (0) -
src/math/big/prime.go
} return true } // probablyPrimeLucas reports whether n passes the "almost extra strong" Lucas probable prime test, // using Baillie-OEIS parameter selection. This corresponds to "AESLPSP" on Jacobsen's tables (link below). // The combination of this test and a Miller-Rabin/Fermat test with base 2 gives a Baillie-PSW test. // // References: // // Baillie and Wagstaff, "Lucas Pseudoprimes", Mathematics of Computation 35(152),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 02 14:43:52 UTC 2022 - 10.4K bytes - Viewed (0) -
src/math/cbrt_s390x.s
DATA ·cbrtrodataL9<> + 48(SB)/8, $1.000244140625 DATA ·cbrtrodataL9<> + 56(SB)/8, $0.33333333333333333333E+00 DATA ·cbrtrodataL9<> + 64(SB)/8, $79228162514264337593543950336. GLOBL ·cbrtrodataL9<> + 0(SB), RODATA, $72 // Index tables DATA ·cbrttab32069<> + 0(SB)/8, $0x404030303020202 DATA ·cbrttab32069<> + 8(SB)/8, $0x101010101000000 DATA ·cbrttab32069<> + 16(SB)/8, $0x808070706060605 DATA ·cbrttab32069<> + 24(SB)/8, $0x505040404040303
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 16 15:34:41 UTC 2019 - 4.9K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/api/resource/suffix.go
} result = append(result[:1], number...) return result, true } return nil, false } func (sh *suffixHandler) interpret(suffix suffix) (base, exponent int32, fmt Format, ok bool) { // Try lookup tables first if b, e, ok := sh.decSuffixes.lookup(suffix); ok { return b, e, DecimalSI, true } if b, e, ok := sh.binSuffixes.lookup(suffix); ok { return b, e, BinarySI, true }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jul 27 03:17:50 UTC 2022 - 5.2K bytes - Viewed (0) -
src/hash/crc64/crc64.go
ISO = 0xD800000000000000 // The ECMA polynomial, defined in ECMA 182. ECMA = 0xC96C5795D7870F42 ) // Table is a 256-word table representing the polynomial for efficient processing. type Table [256]uint64 var ( slicing8TablesBuildOnce sync.Once slicing8TableISO *[8]Table slicing8TableECMA *[8]Table ) func buildSlicing8TablesOnce() { slicing8TablesBuildOnce.Do(buildSlicing8Tables) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 22:36:41 UTC 2024 - 5.2K bytes - Viewed (0)