|
| 1 | +package riemann_test |
| 2 | + |
| 3 | +import ( |
| 4 | + "sort" |
| 5 | + |
| 6 | + "github.com/alexsanjoseph/riemann-divisor-sum-go/riemann" |
| 7 | + . "github.com/onsi/ginkgo" |
| 8 | + . "github.com/onsi/gomega" |
| 9 | +) |
| 10 | + |
| 11 | +var _ = Describe("In Memory Database Tests", func() { |
| 12 | + |
| 13 | + It("is initially empty", func() { |
| 14 | + var db = riemann.DivisorDb(riemann.InMemoryDivisorDb{Data: make(map[int]riemann.RiemannDivisorSum)}) |
| 15 | + loadedData := db.Load() |
| 16 | + Expect(len(loadedData)).To(Equal(0)) |
| 17 | + }) |
| 18 | + |
| 19 | + It("Upserts correctly", func() { |
| 20 | + var db = riemann.DivisorDb(riemann.InMemoryDivisorDb{Data: make(map[int]riemann.RiemannDivisorSum)}) |
| 21 | + records := []riemann.RiemannDivisorSum{ |
| 22 | + {N: 1, DivisorSum: 1, WitnessValue: 1}, |
| 23 | + {N: 2, DivisorSum: 2, WitnessValue: 2}, |
| 24 | + } |
| 25 | + By("upserting fine from empty", func() { |
| 26 | + db.Upsert(records) |
| 27 | + loadedData := db.Load() |
| 28 | + sort.Slice(loadedData, func(p, q int) bool { |
| 29 | + return loadedData[p].N < loadedData[q].N |
| 30 | + }) |
| 31 | + Expect(loadedData).To(Equal(records)) |
| 32 | + }) |
| 33 | + |
| 34 | + By("upserting fine from non-empty", func() { |
| 35 | + newRecords := []riemann.RiemannDivisorSum{ |
| 36 | + {N: 3, DivisorSum: 3, WitnessValue: 3}, |
| 37 | + {N: 4, DivisorSum: 4, WitnessValue: 4}, |
| 38 | + } |
| 39 | + db.Upsert(newRecords) |
| 40 | + loadedData := db.Load() |
| 41 | + sort.Slice(loadedData, func(p, q int) bool { |
| 42 | + return loadedData[p].N < loadedData[q].N |
| 43 | + }) |
| 44 | + Expect(loadedData).To(Equal(append(records, newRecords...))) |
| 45 | + }) |
| 46 | + |
| 47 | + By("overriding existing docs when upserted", func() { |
| 48 | + newRecords := []riemann.RiemannDivisorSum{ |
| 49 | + {N: 3, DivisorSum: 3, WitnessValue: 10}, |
| 50 | + {N: 5, DivisorSum: 5, WitnessValue: 5}, |
| 51 | + } |
| 52 | + expectedNewRecords := []riemann.RiemannDivisorSum{ |
| 53 | + {N: 3, DivisorSum: 3, WitnessValue: 10}, |
| 54 | + {N: 4, DivisorSum: 4, WitnessValue: 4}, |
| 55 | + {N: 5, DivisorSum: 5, WitnessValue: 5}, |
| 56 | + } |
| 57 | + db.Upsert(newRecords) |
| 58 | + loadedData := db.Load() |
| 59 | + sort.Slice(loadedData, func(p, q int) bool { |
| 60 | + return loadedData[p].N < loadedData[q].N |
| 61 | + }) |
| 62 | + Expect(loadedData).To(Equal(append(records, expectedNewRecords...))) |
| 63 | + }) |
| 64 | + |
| 65 | + }) |
| 66 | + |
| 67 | + It("Summarizes", func() { |
| 68 | + var db = riemann.DivisorDb(riemann.InMemoryDivisorDb{Data: make(map[int]riemann.RiemannDivisorSum)}) |
| 69 | + By("correctly summarizing empty data", func() { |
| 70 | + summaryData := db.Summarize() |
| 71 | + expectedSummaryData := riemann.SummaryStats{ |
| 72 | + LargestWitnessValue: riemann.RiemannDivisorSum{}, |
| 73 | + LargestComputedN: riemann.RiemannDivisorSum{}, |
| 74 | + } |
| 75 | + Expect(summaryData).To(Equal(expectedSummaryData)) |
| 76 | + }) |
| 77 | + |
| 78 | + By("correctly summarizing non-empty data", func() { |
| 79 | + records := []riemann.RiemannDivisorSum{ |
| 80 | + {N: 1, DivisorSum: 1, WitnessValue: 10}, |
| 81 | + {N: 2, DivisorSum: 2, WitnessValue: 20}, |
| 82 | + {N: 3, DivisorSum: 2, WitnessValue: 3}, |
| 83 | + } |
| 84 | + db.Upsert(records) |
| 85 | + summaryData := db.Summarize() |
| 86 | + expectedSummaryData := riemann.SummaryStats{ |
| 87 | + LargestWitnessValue: riemann.RiemannDivisorSum{N: 2, DivisorSum: 2, WitnessValue: 20}, |
| 88 | + LargestComputedN: riemann.RiemannDivisorSum{N: 3, DivisorSum: 2, WitnessValue: 3}, |
| 89 | + } |
| 90 | + Expect(summaryData).To(Equal(expectedSummaryData)) |
| 91 | + }) |
| 92 | + }) |
| 93 | + |
| 94 | +}) |
0 commit comments