- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 111 for 0x100 (0.18 sec)
-
guava-tests/benchmark/com/google/common/hash/HashStringBenchmark.java
* * @see MaxCodePoint#decode */ @Param({"0x80", "0x90", "0x100", "0x800", "0x10000", "0x10ffff"}) MaxCodePoint maxCodePoint; @Param({"16384"}) int charCount; @Param({"MURMUR3_32", "MURMUR3_128", "SHA1"}) HashFunctionEnum hashFunctionEnum; private String[] strings; static final int SAMPLES = 0x100; static final int SAMPLE_MASK = 0xFF; /**
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
@Param({"10", "100", "1000", "10000", "100000"}) int datasetSize; @Param QuantilesAlgorithm algorithm; private double[][] datasets = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random(); for (int i = 0; i < 0x100; i++) { datasets[i] = new double[datasetSize]; for (int j = 0; j < datasetSize; j++) { datasets[i][j] = rng.nextDouble(); } } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 3.1K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/ComparatorDelegationOverheadBenchmark.java
* @author Louis Wasserman */ public class ComparatorDelegationOverheadBenchmark { private final Integer[][] inputArrays = new Integer[0x100][]; @Param({"10000"}) int n; @BeforeExperiment void setUp() throws Exception { Random rng = new Random(); for (int i = 0; i < 0x100; i++) { Integer[] array = new Integer[n]; for (int j = 0; j < n; j++) { array[j] = rng.nextInt(); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/StatsBenchmark.java
int n; @Param MeanAlgorithm meanAlgorithm; @Param VarianceAlgorithm varianceAlgorithm; private double[][] values = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random(); for (int i = 0; i < 0x100; i++) { values[i] = new double[n]; for (int j = 0; j < n; j++) { values[i][j] = rng.nextDouble(); } } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/HashStringBenchmark.java
* * @see MaxCodePoint#decode */ @Param({"0x80", "0x90", "0x100", "0x800", "0x10000", "0x10ffff"}) MaxCodePoint maxCodePoint; @Param({"16384"}) int charCount; @Param({"MURMUR3_32", "MURMUR3_128", "SHA1"}) HashFunctionEnum hashFunctionEnum; private String[] strings; static final int SAMPLES = 0x100; static final int SAMPLE_MASK = 0xFF; /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/StatsBenchmark.java
int n; @Param MeanAlgorithm meanAlgorithm; @Param VarianceAlgorithm varianceAlgorithm; private double[][] values = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random(); for (int i = 0; i < 0x100; i++) { values[i] = new double[n]; for (int j = 0; j < n; j++) { values[i][j] = rng.nextDouble(); } } }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/ComparatorDelegationOverheadBenchmark.java
* @author Louis Wasserman */ public class ComparatorDelegationOverheadBenchmark { private final Integer[][] inputArrays = new Integer[0x100][]; @Param({"10000"}) int n; @BeforeExperiment void setUp() throws Exception { Random rng = new Random(); for (int i = 0; i < 0x100; i++) { Integer[] array = new Integer[n]; for (int j = 0; j < n; j++) { array[j] = rng.nextInt(); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
@Param({"10", "100", "1000", "10000", "100000"}) int datasetSize; @Param QuantilesAlgorithm algorithm; private double[][] datasets = new double[0x100][]; @BeforeExperiment void setUp() { Random rng = new Random(); for (int i = 0; i < 0x100; i++) { datasets[i] = new double[datasetSize]; for (int j = 0; j < datasetSize; j++) { datasets[i][j] = rng.nextDouble(); } } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 3.1K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/msrpc/netdfs.idl
[ uuid(4fc742e0-4a10-11cf-8273-00aa004ae673), version(3.0) ] interface netdfs { import "../rpc.idl"; const uint32_t DFS_VOLUME_FLAVOR_STANDALONE = 0x100; const uint32_t DFS_VOLUME_FLAVOR_AD_BLOB = 0x200; const uint32_t DFS_STORAGE_STATE_OFFLINE = 0x0001; const uint32_t DFS_STORAGE_STATE_ONLINE = 0x0002; const uint32_t DFS_STORAGE_STATE_ACTIVE = 0x0004; typedef struct { [string] wchar_t *entry_path; } DfsInfo1;
Others - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 1.7K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/msrpc/netdfs.idl
[ uuid(4fc742e0-4a10-11cf-8273-00aa004ae673), version(3.0) ] interface netdfs { import "../rpc.idl"; const uint32_t DFS_VOLUME_FLAVOR_STANDALONE = 0x100; const uint32_t DFS_VOLUME_FLAVOR_AD_BLOB = 0x200; const uint32_t DFS_STORAGE_STATE_OFFLINE = 0x0001; const uint32_t DFS_STORAGE_STATE_ONLINE = 0x0002; const uint32_t DFS_STORAGE_STATE_ACTIVE = 0x0004; typedef struct { [string] wchar_t *entry_path; } DfsInfo1;
Others - Registered: Sun Apr 28 00:10:09 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 1.7K bytes - Viewed (0)