summaryrefslogtreecommitdiff
path: root/ds/integer.go
blob: 296e5bb13c2264a246965320ae237503ef5ada02 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
package ds

import (
	"fmt"
	"math/rand"
)

type Integer struct {
	Val int
}

func RandomIntegers(length, max int) ArrayList {
	a := make(ArrayList, length)
	for i := 0; i < length; i++ {
		a[i] = Integer{rand.Intn(max)}
	}
	return a
}

func SortedIntegers(length int) ArrayList {
	a := make(ArrayList, length)
	for i := 0; i < length; i++ {
		a[i] = Integer{i}
	}
	return a
}

func ReverseSortedIntegers(length int) ArrayList {
	a := make(ArrayList, length)
	j := length
	for i := 0; i < length; i++ {
		a[i] = Integer{j}
		j--
	}
	return a
}

func (i Integer) String() string {
	return fmt.Sprintf("%d", i.Val)
}

func (i Integer) Int() int {
	return i.Val
}

func (i Integer) Equal(j Elem) bool {
	return i.Val == j.Int()
}

func (i Integer) Lower(j Elem) bool {
	return i.Val < j.Int()
}

func (i Integer) LowerEqual(j Elem) bool {
	return i.Val <= j.Int()
}

func (i Integer) Higher(j Elem) bool {
	return i.Val > j.Int()
}

func (i Integer) HigherEqual(j Elem) bool {
	return i.Val >= j.Int()
}

func (i Integer) Compare(j Elem) int {
    jVal := j.Int()
    switch {
      case i.Val < jVal:
      return -1
      case i.Val > jVal:
      return 1
    }
	return 0
}

func (i Integer) CompareCB(j Elem, lowerCB, higherCB, equalsCB func()) {
    jVal := j.Int()
    switch {
      case i.Val < jVal:
        lowerCB()
      case i.Val > jVal:
        higherCB()
      default:
        equalsCB()
    }
}