forked from nextup/nextup
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrssQueue.js
More file actions
170 lines (134 loc) · 3.82 KB
/
rssQueue.js
File metadata and controls
170 lines (134 loc) · 3.82 KB
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
// creates a queue used to keep track of what is queued to be scraped by readability
/*
functionality:
1. queue : add to tail of queue
2. dequeu: remove from head of queue
3. head and tail pointer
4. size
5. contains
*/
// rssToScrapeQueue = Queue();
// linked list style
var makeScrapeQueue = function () {
var queue = {};
size = 0;
head = null;
tail = null;
queue.size = function () {
return size;
}
queue.queue = function (rssDoc) {
var node = makeScrapeNode(rssDoc);
if (head === null) {
head = node;
} else {
tail.next = node;
}
tail = node;
size++;
// console.log('next queue: ', head.value);
return node.value;
};
queue.dequeue = function () {
if (head === null) {
console.log('nothing to dequeue');
return null;
} else {
var node = head;
// if we're at the last node, then after we dequeue this node, the head and tail should both point to nothing again
if (head === tail) {
head = null;
tail = null;
} else {
head = head.next
}
size--;
return node.value;
}
};
queue.contains = function (target) {
node = head;
while (node !== null) {
if (node.value.title === target.title && node.value.link === target.link) {
return true;
} else {
node = node.next;
}
}
return false;
};
// returns an array of titles and links of everything inside the queue
queue.all = function () {
node = head;
var list = []
while (node) {
list.push(node.value);
node = node.next;
}
return list;
}
return queue;
};
var makeScrapeNode = function (rssObj) {
var node = {}
node.value = {};
node.value.title = rssObj.title;
node.value.link = rssObj.link;
node.next = null;
return node;
};
/***
* ______ _
* | ____| | |
* | |__ __ __ _ __ ___ _ __ | |_ ___
* | __| \ \/ /| '_ \ / _ \ | '__|| __|/ __|
* | |____ > < | |_) || (_) || | | |_ \__ \
* |______|/_/\_\| .__/ \___/ |_| \__||___/
* | |
* |_|
*/
module.exports.makeScrapeQueue = makeScrapeQueue;
/***
* _______ _
* |__ __| | |
* | | ___ ___ | |_ ___
* | | / _ \/ __|| __|/ __|
* | || __/\__ \| |_ \__ \
* |_| \___||___/ \__||___/
*
*
*/
// // testing to see if queue works;
var executeTest = function () {
t1 = {title: "hello", link: 'greg'};
t2 = {title: 'world', link: 'lull'};
t3 = {title: 'trees', link: 'halley'};
var scrapeQueue = makeScrapeQueue();
var r00 = scrapeQueue.dequeue() === null;
var r01 = scrapeQueue.contains({title: 'hello' , link: 'greg'}) === false;
scrapeQueue.queue(t1);
scrapeQueue.queue(t2);
var r02 = scrapeQueue.dequeue().title === t1.title;
var r03 = scrapeQueue.dequeue().link === t2.link;
var r04 = scrapeQueue.dequeue() === null;
scrapeQueue.queue(t1);
scrapeQueue.queue(t2);
scrapeQueue.queue(t3);
var r05 = scrapeQueue.contains(t1) === true;
var r06 = scrapeQueue.contains(t2) === true;
var r07 = scrapeQueue.contains(t3) === true;
var list = scrapeQueue.all();
//
scrapeQueue = makeScrapeQueue();
scrapeQueue.queue(t1);
scrapeQueue.queue(t2);
scrapeQueue.dequeue();
scrapeQueue.queue(t3);
var r08 = scrapeQueue.dequeue().title === t2.title;
var r09 = scrapeQueue.all()[0].title === t3.title;
var r10 = scrapeQueue.contains(t3) === true;
var r11 = scrapeQueue.contains(t2) === false;
console.log(r00, r01, r02, r03, r04, r05, r06, r07, r08, r09, r10, r11);
console.log('list: \n', list);
};
// executeTest();