-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathindex.js
More file actions
139 lines (119 loc) · 2.73 KB
/
index.js
File metadata and controls
139 lines (119 loc) · 2.73 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
function toAsync(fun) {
return function () {
var args = [].slice.call(arguments)
var cb = args.pop()
var returned = false
args.push(function (err, data1, data2) {
if(returned) return
returned = true
cb(err, data1, data2)
})
var ret
try {
ret = fun.apply(this, args)
} catch (err) {
return cb(err)
}
if(ret) returned = true, cb(null, ret)
}
}
function identity (e, cb) {
return cb(null, e), e
}
module.exports = function (def) {
var children = def.children
var get = def.get || identity
var P = Poset.prototype
function Poset (item) {
if(item) {
this.value = item
return this
item.__proto__ = P
return item
}
if(!(this instanceof Poset)) return new Poset(item)
}
//TODO: write these all using a light weight stream thing
//https://githum.com/dominictarr/strm
P.children = function (iter) {
children.call(this, function (err, array) {
var n = array.length
if(!array.length)
return iter()
array.forEach(function (e) {
get(e, function (err, item) {
if(item) iter(new Poset(item))
if(--n) return
iter()
})
})
})
}
P.depthFirst = function (iter) {
var n = 0
function children (item) {
if(item != null) {
iter(item)
n ++
//item?
item.children(children)
}
else if(!--n)
iter(null, true) //END
}
children(this)
}
P.widthFirst = function (iter) {
var l = []
function children (item) {
item.children(function (item) {
if(item == null) {
if(l.length)
return children(l.shift())
else return iter() //end of traversal
}
l.push(item)
iter(item)
})
}
iter(this)
children(this)
}
P.topo =
P.topological = function (iter) {
//I think this needs to be rewritten for more async.
//may error if children not called back in order...
//traverse the leaves first
//expand all children, and
//iterate over nodes with no children first.
function children (item, done) {
var n = 1
item.children(function (_item) {
//IF THERE ARE NO CHILDREN
if(!_item) {
if(--n) return
return done()
}
n++
children(_item, function () {
iter(_item)
if(--n) return
done()
})
})
}
var self = this
children(this, function () {
iter(self)
iter()
})
}
P.get = function (id, cb) {
get(id, function (err, item) {
item = new Poset(item)
cb(err, item)
})
}
return Poset
}
//poset({parent: , children: , isRoot:, id:, data:})