{"header":{"message":"Remove Primes function, move factor calculations to separate directory","description":null,"timestamp":"2021-10-19T19:19:16.090041239Z","authors":[{}]},"hash":"VTLT4FADK627SZPBLCDCKUOOUPQNA3ZLJGHKNWWGUENWHCPZIHSQC","authors":[{"login":"voroskoi","key":"Guf8VYJNUiWAqxwLxDSKxmvvtY65ht2zK2q4h6VhxrcZ"}],"deps":{"hashes":[["VTLT4FADK627SZPBLCDCKUOOUPQNA3ZLJGHKNWWGUENWHCPZIHSQC","Remove Primes function, move factor calculations to separate directory"],["AA",null],["BCVIGM7NFXDF2O44TAH53F3LZUYBCWIUUEZHXJYH6B6VX3UE6B5QC","primes: add ConcurrentSieve"],["LZXA7BOKQT3FYK3ZHCG4INFBXTPMKST7BAP6QW7G3LFY53PS6ZSAC","Make sieve much faster"],["MQF53D2UXRNVEYF5Y4CMGWYL4LLS4ELZQ66NSRX74WRYQBOUK6IAC","pijul WTF"],["7OFUWNAII7HKYHWLPJGIUUJVMQFB4R3JKE3XBKSCVUUAYAWDW6VAC","Add prime searching functions"]],"deps":["BCVIGM7NFXDF2O44TAH53F3LZUYBCWIUUEZHXJYH6B6VX3UE6B5QC"],"known":["7OFUWNAII7HKYHWLPJGIUUJVMQFB4R3JKE3XBKSCVUUAYAWDW6VAC","LZXA7BOKQT3FYK3ZHCG4INFBXTPMKST7BAP6QW7G3LFY53PS6ZSAC","MQF53D2UXRNVEYF5Y4CMGWYL4LLS4ELZQ66NSRX74WRYQBOUK6IAC"]},"hunks":[{"Edit":{"inode":{"change":3,"pos":27},"path":"snippets/primes/primes_test.go","line":33,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1221},"to":{"change":3,"start":1221,"end":1358},"introduced_by":3}],"inode":{"change":3,"pos":27}}},"contents":[{"Del":"func TestPrimes(t *testing.T) {\n\tis := is.New(t)\n\tfor _, tc := range primeCases {\n\t\tis.Equal(tc.expected, primes.Primes(tc.input))\n\t}\n}\n\n"}]}},{"Edit":{"inode":{"change":3,"pos":27},"path":"snippets/primes/primes_test.go","line":47,"atom":{"EdgeMap":{"edges":[{"previous":"","flag":"DELETED","from":{"change":2,"pos":185},"to":{"change":3,"start":1497,"end":1589},"introduced_by":2},{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1497},"to":{"change":3,"start":1497,"end":1589},"introduced_by":3}],"inode":{"change":3,"pos":27}}},"contents":[{"Del":"func BenchmarkPrimes(b *testing.B) {\n\tfor i := 0; i < b.N; i++ {\n\t\tprimes.Primes(1e6)\n\t}\n}\n\n"}]}},{"Replacement":{"inode":{"change":3,"pos":1695},"path":"snippets/primes/primes.go","line":1,"ins":{"up_context":[{"change":3,"pos":1695}],"down_context":[{"change":3,"pos":1769}],"flag":"BLOCK","start":0,"end":44,"inode":{"change":3,"pos":1695}},"del":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1695},"to":{"change":3,"start":1696,"end":1769},"introduced_by":3}],"inode":{"change":3,"pos":1695}},"ins_contents":[{"Add":"// Package primes deals with prime numbers."}],"del_contents":[{"Del":"// Package primes is for calculating primes using sieve of Eratosthenes.\n"}]}},{"Edit":{"inode":{"change":3,"pos":1695},"path":"snippets/primes/primes.go","line":5,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1794},"to":{"change":3,"start":1794,"end":1801},"introduced_by":3}],"inode":{"change":3,"pos":1695}}},"contents":[{"Del":"\t\"fmt\"\n"}]}},{"Edit":{"inode":{"change":3,"pos":1695},"path":"snippets/primes/primes.go","line":8,"atom":{"EdgeMap":{"edges":[{"previous":"BLOCK","flag":"BLOCK | DELETED","from":{"change":3,"pos":1804},"to":{"change":3,"start":1804,"end":2629},"introduced_by":3}],"inode":{"change":3,"pos":1695}}},"contents":[{"Del":"const max = int(10e5)\n\n// Sieve holds the factors for a given number.\ntype Sieve map[int][]int\n\nvar mysieve = make(Sieve, max)\n\nfunc genSieve(n int) {\n\tfor i := 1; i <= n; i++ {\n\t\tfor j := i; j <= n; j += i {\n\t\t\tmysieve[j] = append(mysieve[j], i)\n\t\t}\n\t}\n}\n\n// ListPrimes returns the primes below n.\nfunc ListPrimes(n int) ([]int, error) {\n\tif n > max && n < 1 {\n\t\treturn nil, fmt.Errorf(\"%d is too high or low, max: %d, min: 1\", n, max)\n\t}\n\n\tgenSieve(n)\n\n\tvar primes []int\n\tfor i := 2; i < n; i++ {\n\t\tif len(mysieve[i]) == 2 {\n\t\t\tprimes = append(primes, i)\n\t\t}\n\t}\n\treturn primes, nil\n}\n\nfunc Primes(limit int) []int {\n\tsieve := make([]bool, limit+1)\n\tout := []int{}\n\tfor p := 2; p <= limit; p++ {\n\t\tif !sieve[p] {\n\t\t\tout = append(out, p)\n\t\t\tfor i := p * p; i <= limit; i += p {\n\t\t\t\tsieve[i] = true\n\t\t\t}\n\t\t}\n\t}\n\treturn out\n}\n\n"}]}},{"FileAdd":{"meta":{"basename":"go.mod","metadata":0},"context":[{"change":3,"pos":9}],"contents":[{"Add":"module primes"},{"Add":""},{"Add":"go 1.17"},{"Add":""},{"Add":"require github.com/matryer/is v1.4.0"}]}},{"FileAdd":{"meta":{"basename":"factors","metadata":576},"context":[{"change":3,"pos":9}],"contents":[]}},{"FileAdd":{"meta":{"basename":"factors.go","metadata":0},"context":[{"change":0,"pos":158}],"contents":[{"Add":"// Package factors deals with factors."},{"Add":"package factors"},{"Add":""},{"Add":"import ("},{"Add":"\t\"fmt\""},{"Add":")"},{"Add":""},{"Add":"const MAX = 100_000"},{"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":"}"}]}}],"owner":"voroskoi","repo":"learn-go","token":"229xDGrOrhnCTdpZVSGW2+m8LEKfG8Xcvsoq7xphFyE=","login":null}

…

Dependencies

Change contents