MCPcopy Create free account

hub / github.com/PlummersSoftwareLLC/Primes / functions

Functions1,590 in github.com/PlummersSoftwareLLC/Primes

↓ 1 callersFunctionrun_sieve
PrimeC/solution_2/sieve_8of30_par.c:48
↓ 1 callersFunctionrun_sieve
PrimeC/solution_2/sieve_48of210_epar.c:49
↓ 1 callersFunctionrun_sieve
PrimeC/solution_2/sieve_8of30_epar.c:48
↓ 1 callersFunctionrun_sieve
PrimeC/solution_2/sieve_5760of30030_only_write_read_bits.c:274
↓ 1 callersFunctionrun_sieve
PrimeC/solution_2/sieve_5760of30030_par.c:278
↓ 1 callersFunctionrun_sieve
PrimeC/solution_2/sieve_5760of30030_epar.c:278
↓ 1 callersFunctionrun_sieve
Purpose: The procedure below runs the sieve in a segmented algorithm. See details described in README.md */
PrimeC/solution_3/primes_words.c:244
↓ 1 callersFunctionrun_sieve
PrimeC/solution_3/primes_striped-block.c:138
↓ 1 callersFunctionrun_sieve
(cmd: List[str], sieve_size: int)
PrimeWhitespace/solution_1/run_primes.py:9
↓ 1 callersFunctionrun_sieve
This function does the actual calculation of the prime numbers - it clears any previous results - in the first stage all prim
PrimeSQL/solution_1/sqlite_runner.py:65
↓ 1 callersMethodrun_sieve
(self)
PrimeMixed/solution_3/src/pysieve/sieve.py:23
↓ 1 callersMethodrun_sieve
(&mut self)
PrimeRust/solution_4/PrimeRust.rs:55
↓ 1 callersMethodrun_sieve
(&mut self)
PrimeRust/solution_2/src/prime_object.rs:17
↓ 1 callersMethodrun_sieve
(&mut self)
PrimeRust/solution_3/src/main.rs:11
↓ 1 callersMethodrun_sieve
()
PrimeRuby/solution_2/prime.rb:33
↓ 1 callersMethodrun_sieve
PrimeRuby/solution_1/prime.rb:13
↓ 1 callersFunctionrun_unicat_sieve
(instructions: List[tuple], sieve_size: int)
PrimeUnicat/solution_1/run_primes.py:12
↓ 1 callersFunctionrunscript
PrimeMinecraftDatapack/solution_1/playio.c:131
↓ 1 callersFunctionsameTuningResult
PrimeC/solution_5/src/benchmark/sieve_tune.h:6
↓ 1 callersMethodsearchBitFalse
(index)
PrimeJavaScript/solution_1/PrimeJavaScript.js:114
↓ 1 callersMethodsearchBitFalse
(index)
PrimeJavaScript/solution_1/PrimeJavaScript_memcopy.js:111
↓ 1 callersFunctionsetBenchmarkSettingAsString
PrimeC/solution_5/src/benchmark/sieve_benchmark.h:32
↓ 1 callersMethodsetBitTrue
(index)
PrimeJavaScript/solution_1/PrimeSieve.mjs:21
↓ 1 callersMethodsetBitTrue
(index)
PrimeJavaScript/solution_1/PrimeJavaScript.js:55
↓ 1 callersMethodsetBitsTrue
(range_start, step, range_stop)
PrimeJavaScript/solution_1/PrimeJavaScript.js:62
↓ 1 callersMethodsetBitsTrue
(range_start, step, range_stop)
PrimeJavaScript/solution_1/PrimeJavaScript_memcopy.js:66
↓ 1 callersFunctionsetBitsTrue_base
PrimeC/solution_5/src/bitstorage/bitstorage_setBitsTrue_base.h:46
↓ 1 callersFunctionsetBitsTrue_smallstep_norepeat
Small steps (< WORD_SIZE) could be within the same word (e.g. less than 64 bits apart). if we know that the mask will not repeat, we can save some tim
PrimeC/solution_5/src/bitstorage/bitstorage_setBitsTrue_base.h:28
↓ 1 callersFunctionsetBitsTrue_smallstep_repeat_base
PrimeC/solution_5/src/bitstorage/bitstorage_setBitsTrue_base.h:7
↓ 1 callersFunctionsetBitsTrue_v128
PrimeC/solution_5/src/bitstorage/bitstorage_setBitsTrue.h:7
↓ 1 callersFunctionsetBitsTrue_v256
Function to dispatch the correct setBitsTrue function based on the step size and occurrences
PrimeC/solution_5/src/bitstorage/bitstorage_setBitsTrue.h:24
↓ 1 callersFunctionsetBitsTrue_v512
Function to dispatch the correct setBitsTrue function based on the step size and occurrences
PrimeC/solution_5/src/bitstorage/bitstorage_setBitsTrue.h:42
↓ 1 callersFunctionsetDefaultOptions
PrimeC/solution_5/src/benchmark/sieve_options.h:42
↓ 1 callersMethodsetFlagsFalse
PrimeCPP/solution_2/PrimeCPP_mask.cpp:78
↓ 1 callersMethodsetFlagsFalse
PrimeCPP/solution_1/PrimeCPP.cpp:53
↓ 1 callersFunctionsetSettingsFromTuning
PrimeC/solution_5/src/benchmark/sieve_tune.h:16
↓ 1 callersMethodsetTrue
(i: number)
PrimeTypeScript/solution_2/src/IBitArray.ts:5
↓ 1 callersFunctionset_word_block_size
Purpose: Determine the optimal size for the BLOCK_SIZE parameter on this hardware based on sample runs and set that parameter */
PrimeC/solution_3/primes_words.c:444
↓ 1 callersFunctionset_word_block_size
Purpose: Determine the optimal size for the BLOCK_SIZE parameter on this hardware based on sample runs and set that parameter */
PrimeC/solution_3/primes_striped-block.c:285
↓ 1 callersFunctionshowResult
PrimeC/solution_5/src/benchmark/sieve_validate.h:74
↓ 1 callersMethodshutdownPool
()
PrimeJava/solution_2/src/PrimeSieveJavaBitSetMT.java:126
↓ 1 callersFunctionstorageBenchmark
(newStorage StorageFunc)
PrimeGo/solution_2/storage_test.go:296
↓ 1 callersFunctionstr_to_double
Custom string to double converter
PrimeC/solution_5/src/benchmark/sieve_parseCommandline.h:69
↓ 1 callersFunctionstripeSieve
PrimeC/solution_5/src/sieve/sieve_stripe.h:55
↓ 1 callersFunctionsubstitute_placeholder
Replace instances of the identifier `N` found in the supplied generic expression, with the _literal_ `substitute_value` supplied. This allows to repla
PrimeRust/solution_1/helper-macros/src/lib.rs:128
↓ 1 callersFunctiontime_mark
PrimeC/solution_5/src/benchmark/sieve_timers.h:55
↓ 1 callersFunctiontimedTest
PrimeC/solution_4/sieve.c:236
↓ 1 callersFunctiontimedTest
PrimeC/solution_1/sieve.c:221
↓ 1 callersFunctiontimer_init
PrimeC/solution_5/src/benchmark/sieve_timers.h:80
↓ 1 callersMethodtoString
PrimeKotlin/solution_1/src/commonMain/kotlin/PrimeSieve.kt:9
↓ 1 callersFunctiontuneSieveSettings
PrimeC/solution_5/src/benchmark/sieve_tune.h:184
↓ 1 callersFunctionusqrt
PrimeC/solution_1/sieve.c:47
↓ 1 callersFunctionvalidate
PrimeCPP/solution_4/validator.hpp:10
↓ 1 callersMethodvalidate
(self)
PrimeRust/solution_7/src/wheel_sieve.rs:131
↓ 1 callersMethodvalidateAndStoreResults
(final int sieveSize, final int countOfPrimes)
PrimeJava/solution_2/src/PrimeSieveJavaBitSetMT.java:100
↓ 1 callersMethodvalidatePrimeCount
()
PrimeJavaScript/solution_2/PrimeJavaScript_sniper.js:100
↓ 1 callersMethodvalidatePrimeCount
(verbose)
PrimeJavaScript/solution_1/PrimeJavaScript.js:176
↓ 1 callersMethodvalidatePrimeCount
(verbose)
PrimeJavaScript/solution_1/PrimeJavaScript_memcopy.js:242
↓ 1 callersFunctionvalidateResult
($sieveSize)
PrimePHP/solution_1/PrimePHP.php:131
↓ 1 callersMethodvalidateResults
()
PrimeJava/solution_4/src/PrimeSieveBase.java:33
↓ 1 callersMethodvalidateResults
()
PrimeJava/solution_1/PrimeSieveJava.java:42
↓ 1 callersMethodvalidateResults
()
PrimeJava/solution_3/PrimeSieveJava.java:35
↓ 1 callersMethodvalidateResults
(this)
PrimePython/solution_1/PrimePY.py:37
↓ 1 callersMethodvalidateResults
()
PrimeAssemblyScript/solution_2/src/unrolled/sieve.ts:22
↓ 1 callersMethodvalidateResults
()
PrimeAssemblyScript/solution_2/src/orig/sieve.ts:22
↓ 1 callersMethodvalidateResults
()
PrimeAssemblyScript/solution_1/src/sieve.ts:21
↓ 1 callersMethodvalidateResults
()
PrimeTypeScript/solution_2/src/index.ts:77
↓ 1 callersMethodvalidateResults
()
PrimeTypeScript/solution_1/src/index.ts:77
↓ 1 callersMethodvalidateResults
PrimeCPP/solution_2/PrimeCPP_array.cpp:155
↓ 1 callersMethodvalidateResults
PrimeCPP/solution_2/PrimeCPP_mask.cpp:201
↓ 1 callersMethodvalidateResults
PrimeCPP/solution_5/PrimeCPP_array.cpp:745
↓ 1 callersFunctionvalidate_result
PrimeC/solution_3/primes_words.c:331
↓ 1 callersFunctionvalidate_result
PrimeC/solution_3/primes_striped-block.c:176
↓ 1 callersFunctionvalidate_results
(sieve_size: int, count: int)
PrimeUnicat/solution_1/run_primes.py:42
↓ 1 callersFunctionvalidate_results
(sieve_size: int, count: int)
PrimeWhitespace/solution_1/run_primes.py:44
↓ 1 callersFunctionvalidate_results
Look up our count of primes in the historical data (if we have it) to see if it matches
PrimeSQL/solution_1/sqlite_runner.py:202
↓ 1 callersMethodvalidate_results
Look up our count of primes in the historical data (if we have it) to see if it matches
PrimePython/solution_2/PrimePY.py:31
↓ 1 callersMethodvalidate_results
Look up our count of primes in the historical data (if we have it) to see if it matches
PrimePython/solution_3/PrimePY.py:37
↓ 1 callersMethodvalidate_results
Look up our count of primes in the historical data (if we have it) to see if it matches
PrimePython/solution_3/PrimePY_numba.py:56
↓ 1 callersMethodvalidate_results
(&mut self)
PrimeRust/solution_6/src/multithreaded.rs:175
↓ 1 callersMethodvalidate_results
(&mut self)
PrimeRust/solution_6/src/singlethreaded.rs:123
MethodArrayPool2Of6
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkV1Sieves.cs:57
MethodArrayPool2of6
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkPar.cs:20
MethodArrayPool2of6Parallel
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkPar.cs:26
MethodArrayPool6Par
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkV1Sieves.cs:63
MethodArrayPool8of30
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkV1Sieves.cs:69
MethodArrayPool8of30M
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkV1Sieves.cs:75
MethodArrayPoolClass
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkOfN.cs:17
MethodArrayPoolClass
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkV1Sieves.cs:51
MethodArrayPoolClass
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkRef.cs:29
MethodArrayPoolClassOf6
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkOfN.cs:23
MethodArrayPoolRef
()
PrimeCSharp/solution_1/Benchmarks/BenchmarkRef.cs:23
MethodArrayStorage
PrimeCPP/solution_4/storages.hpp:125
MethodAt
(index uint64)
PrimeGo/solution_2/storage.go:11
MethodAt
(index uint64)
PrimeGo/solution_2/storage_test.go:55
MethodAt
(index uint64)
PrimeGo/solution_2/storage_test.go:85
FunctionBenchmarkBlockStorageConstruction
(b *testing.B)
PrimeGo/solution_2/storage_test.go:262
FunctionBenchmarkBlockStorageSetRangeFourBlocks
(b *testing.B)
PrimeGo/solution_2/storage_test.go:278
FunctionBenchmarkBlockStorageSetRangeOneBlock
(b *testing.B)
PrimeGo/solution_2/storage_test.go:270
FunctionBenchmarkBlockStorageSetRangeSixteenBlocks
(b *testing.B)
PrimeGo/solution_2/storage_test.go:286
← previousnext →501–600 of 1,590, ranked by callers