Skip to content

Commit

Permalink
Merge 3d0bcab into cd0fcbb
Browse files Browse the repository at this point in the history
  • Loading branch information
vaskoz committed Sep 6, 2018
2 parents cd0fcbb + 3d0bcab commit ed2811e
Show file tree
Hide file tree
Showing 3 changed files with 130 additions and 0 deletions.
1 change: 1 addition & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -26,3 +26,4 @@ problems from
* [Day 13](https://github.com/vaskoz/dailycodingproblem-go/issues/29)
* [Day 14](https://github.com/vaskoz/dailycodingproblem-go/issues/31)
* [Day 15](https://github.com/vaskoz/dailycodingproblem-go/issues/33)
* [Day 16](https://github.com/vaskoz/dailycodingproblem-go/issues/35)
54 changes: 54 additions & 0 deletions day16/problem.go
Original file line number Diff line number Diff line change
@@ -0,0 +1,54 @@
package day16

import "container/ring"

// OrderLog represents the behavior of an order log regardless of impl.
type OrderLog interface {
Record(orderID interface{})
GetLast(index int) interface{}
}

type orderLogSlice struct {
log []interface{}
pos int
size int
}

// NewOrderLogSlice returns a new OrderLog based on a slice.
func NewOrderLogSlice(size int) OrderLog {
return &orderLogSlice{log: make([]interface{}, size), pos: -1, size: size}
}

func (ol *orderLogSlice) Record(orderID interface{}) {
ol.pos++
if ol.pos >= ol.size {
ol.pos = 0
}
ol.log[ol.pos] = orderID
}

func (ol *orderLogSlice) GetLast(index int) interface{} {
i := ol.pos - (index - 1)
if i < 0 {
i += ol.size
}
return ol.log[i]
}

type orderLogRing struct {
log *ring.Ring
}

// NewOrderLogRing returns a new OrderLog based on a circular ring.
func NewOrderLogRing(size int) OrderLog {
return &orderLogRing{ring.New(size)}
}

func (ol *orderLogRing) Record(orderID interface{}) {
ol.log = ol.log.Next()
ol.log.Value = orderID
}

func (ol *orderLogRing) GetLast(index int) interface{} {
return ol.log.Move(-(index - 1)).Value
}
75 changes: 75 additions & 0 deletions day16/problem_test.go
Original file line number Diff line number Diff line change
@@ -0,0 +1,75 @@
package day16

import "testing"

var testcases = []struct {
size int
orders []interface{}
getLast []int
expected []interface{}
}{
{5, []interface{}{5, 4, "abc", 10, "def", "ged"},
[]int{1, 2, 3, 4, 5},
[]interface{}{"ged", "def", 10, "abc", 4}},
{5, []interface{}{"abc"},
[]int{1, 2, 3, 4, 5},
[]interface{}{"abc", nil, nil, nil, nil}},
}

func TestOrderLogSlice(t *testing.T) {
t.Parallel()
for _, tc := range testcases {
r := NewOrderLogSlice(tc.size)
for _, v := range tc.orders {
r.Record(v)
}
for i, v := range tc.getLast {
if result := r.GetLast(v); result != tc.expected[i] {
t.Errorf("Expected %v but got %v", tc.expected[i], result)
}
}
}
}

func TestOrderLogRing(t *testing.T) {
t.Parallel()
for _, tc := range testcases {
r := NewOrderLogRing(tc.size)
for _, v := range tc.orders {
r.Record(v)
}
for i, v := range tc.getLast {
if result := r.GetLast(v); result != tc.expected[i] {
t.Errorf("Expected %v but got %v", tc.expected[i], result)
}
}
}
}

func BenchmarkOrderLogSlice(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, tc := range testcases {
r := NewOrderLogSlice(tc.size)
for _, v := range tc.orders {
r.Record(v)
}
for _, v := range tc.getLast {
r.GetLast(v)
}
}
}
}

func BenchmarkOrderLogRing(b *testing.B) {
for i := 0; i < b.N; i++ {
for _, tc := range testcases {
r := NewOrderLogRing(tc.size)
for _, v := range tc.orders {
r.Record(v)
}
for _, v := range tc.getLast {
r.GetLast(v)
}
}
}
}

0 comments on commit ed2811e

Please sign in to comment.