{"header":{"message":"Add prime searching functions","description":null,"timestamp":"2021-02-05T18:20:36.922788411Z","authors":[{"email":"voroskoi@gmail.com","full_name":"VÖRÖSKŐI András","name":"voroskoi"}]},"hash":"7OFUWNAII7HKYHWLPJGIUUJVMQFB4R3JKE3XBKSCVUUAYAWDW6VAC","authors":[],"deps":{"hashes":[["7OFUWNAII7HKYHWLPJGIUUJVMQFB4R3JKE3XBKSCVUUAYAWDW6VAC","Add prime searching functions"],["AA",null],["MCHVA5DYOAOEBSHENAB4FYJBVE4A47B7GDDHOEM36BXTN63ZMQNAC","Palindrome initial import"]],"deps":["MCHVA5DYOAOEBSHENAB4FYJBVE4A47B7GDDHOEM36BXTN63ZMQNAC"],"known":[]},"hunks":[{"FileAdd":{"meta":{"basename":"primes","metadata":1005},"context":[{"change":2,"pos":11}],"contents":[]}},{"FileAdd":{"meta":{"basename":"primes_test.go","metadata":420},"context":[{"change":0,"pos":9}],"contents":[{"Add":"package primes_test"},{"Add":""},{"Add":"import ("},{"Add":"\t\"primes\""},{"Add":"\t\"testing\""},{"Add":""},{"Add":"\t\"github.com/matryer/is\""},{"Add":")"},{"Add":""},{"Add":"var primeCases = []struct {"},{"Add":"\tinput int"},{"Add":"\texpected []int"},{"Add":"}{"},{"Add":"\t{0, []int{}},"},{"Add":"\t{1, []int{}},"},{"Add":"\t{2, []int{2}},"},{"Add":"\t{10, []int{2, 3, 5, 7}},"},{"Add":"\t{100, []int{2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}},"},{"Add":"}"},{"Add":""},{"Add":"var sieveCases = []struct {"},{"Add":"\tinput int"},{"Add":"\texpected []bool"},{"Add":"}{"},{"Add":"\t// every non-prime is true, 0-th and 1-st is false, should be true"},{"Add":"\t{0, []bool{false}},"},{"Add":"\t{1, []bool{false, false}},"},{"Add":"\t{2, []bool{false, false, false}},"},{"Add":"\t{100, []bool{false, false, false, false, true, false, true, false, true, true, true, false, true, false, true, true, true, false, true, false, true, true, true, false, true, true, true, true, true, false, true, false, true, true, true, true, true, false, true, true, true, false, true, false, true, true, true, false, true, true, true, true, true, false, true, true, true, true, true, false, true, false, true, true, true, true, true, false, true, true, true, false, true, false, true, true, true, true, true, false, true, true, true, false, true, true, true, true, true, false, true, true, true, true, true, true, true, false, true, true, true}},"},{"Add":"}"},{"Add":""},{"Add":"func TestPrimes(t *testing.T) {"},{"Add":"\tis := is.New(t)"},{"Add":"\tfor _, tc := range primeCases {"},{"Add":"\t\tis.Equal(tc.expected, primes.Primes(tc.input))"},{"Add":"\t}"},{"Add":"}"},{"Add":""},{"Add":"func TestSieve(t *testing.T) {"},{"Add":"\tis := is.New(t)"},{"Add":"\tfor _, tc := range sieveCases {"},{"Add":"\t\tis.Equal(tc.expected, primes.JustSieve(tc.input))"},{"Add":"\t}"},{"Add":"}"},{"Add":""},{"Add":"func BenchmarkPrimes(b *testing.B) {"},{"Add":"\tfor i := 0; i < b.N; i++ {"},{"Add":"\t\tprimes.Primes(1e6)"},{"Add":"\t}"},{"Add":"}"},{"Add":""},{"Add":"func BenchmarkSieve(b *testing.B) {"},{"Add":"\tfor i := 0; i < b.N; i++ {"},{"Add":"\t\tprimes.JustSieve(1e6)"},{"Add":"\t}"},{"Add":"}"}]}},{"FileAdd":{"meta":{"basename":"primes.go","metadata":420},"context":[{"change":0,"pos":9}],"contents":[{"Add":"// Package primes is for calculating primes using sieve of Eratosthenes."},{"Add":"package primes"},{"Add":""},{"Add":"import ("},{"Add":"\t\"fmt\""},{"Add":")"},{"Add":""},{"Add":"const max = int(10e5)"},{"Add":""},{"Add":"// Sieve holds the factors for a given number."},{"Add":"type Sieve map[int][]int"},{"Add":""},{"Add":"var mysieve = make(Sieve, max)"},{"Add":""},{"Add":"func genSieve(n int) {"},{"Add":"\tfor i := 1; i <= n; i++ {"},{"Add":"\t\tfor j := i; j <= n; j += i {"},{"Add":"\t\t\tmysieve[j] = append(mysieve[j], i)"},{"Add":"\t\t}"},{"Add":"\t}"},{"Add":"}"},{"Add":""},{"Add":"// ListPrimes returns the primes below n."},{"Add":"func ListPrimes(n int) ([]int, error) {"},{"Add":"\tif n > max && n < 1 {"},{"Add":"\t\treturn nil, fmt.Errorf(\"%d is too high or low, max: %d, min: 1\", n, max)"},{"Add":"\t}"},{"Add":""},{"Add":"\tgenSieve(n)"},{"Add":""},{"Add":"\tvar primes []int"},{"Add":"\tfor i := 2; i < n; i++ {"},{"Add":"\t\tif len(mysieve[i]) == 2 {"},{"Add":"\t\t\tprimes = append(primes, i)"},{"Add":"\t\t}"},{"Add":"\t}"},{"Add":"\treturn primes, nil"},{"Add":"}"},{"Add":""},{"Add":"func Primes(limit int) []int {"},{"Add":"\tsieve := make([]bool, limit+1)"},{"Add":"\tout := []int{}"},{"Add":"\tfor p := 2; p <= limit; p++ {"},{"Add":"\t\tif !sieve[p] {"},{"Add":"\t\t\tout = append(out, p)"},{"Add":"\t\t\tfor i := p * p; i <= limit; i += p {"},{"Add":"\t\t\t\tsieve[i] = true"},{"Add":"\t\t\t}"},{"Add":"\t\t}"},{"Add":"\t}"},{"Add":"\treturn out"},{"Add":"}"},{"Add":""},{"Add":"func JustSieve(limit int) []bool {"},{"Add":"\tsieve := make([]bool, limit+1)"},{"Add":"\tfor p := 2; p <= limit; p++ {"},{"Add":"\t\tif !sieve[p] {"},{"Add":"\t\t\tfor i := p * p; i <= limit; i += p {"},{"Add":"\t\t\t\tsieve[i] = true"},{"Add":"\t\t\t}"},{"Add":"\t\t}"},{"Add":"\t}"},{"Add":"\treturn sieve"},{"Add":"}"}]}}],"owner":"voroskoi","repo":"learn-go","token":"mQu9EnFNxDK1/6TppNVeeopBzq+jG/77dXYSje1HjUo=","login":null}

…

Dependencies

Change contents