-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSequentialSearch.js
77 lines (55 loc) · 1.12 KB
/
SequentialSearch.js
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
const Search = require("../Search")
class Node {
#key
#value
#next
constructor(key, value, next) {
this.#key = key
this.#value = value
this.#next = next
}
get next() {
return this.#next
}
get value() {
return this.#value
}
get key() {
return this.#key
}
set value(value) {
this.#value = value
}
}
class SequentialSearch extends Search {
#first
constructor() {
super()
this.#first = null
}
get (key) {
let value = null
for (let node = this.#first; node != null; node = node.next) {
const nodeKey = node.key
const areKeysEqual = this.compareValues(key, nodeKey) === 0
if (areKeysEqual) {
value = node.value
break
}
}
return value
}
put (key, value) {
for (let node = this.#first; node != null; node = node.next) {
const nodeKey = node.key
const areKeysEqual = this.compareValues(key, nodeKey) === 0
if (areKeysEqual) {
node.value = value
return
}
}
const next = this.#first
this.#first = new Node(key, value, next)
}
}
module.exports = SequentialSearch