FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
nodegit/lib/tree.js at emscripten · nodejs-experiments/nodegit · GitHub
nodejs-experiments
nodegit
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
nodegit
/
lib
/
tree.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
143 lines (126 loc) · 3.36 KB
Breadcrumbs
nodegit
/
lib
/
tree.js
Copy path
File metadata and controls
143 lines (126 loc) · 3.36 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
var
git
=
require
(
'../'
)
,
Tree
=
git
.
Tree
,
events
=
require
(
'events'
)
,
path
=
require
(
'path'
)
;
var
oldEntryByIndex
=
Tree
.
prototype
.
entryByIndex
,
oldEntryByName
=
Tree
.
prototype
.
entryByName
,
oldGetEntry
=
Tree
.
prototype
.
getEntry
;
/**
* Diff two trees
*
@param
{
Tree
} tree to diff against
*
@param
{
Function
} callback
*
@return
{
DiffList
}
*/
Tree
.
prototype
.
diff
=
function
(
that
,
callback
)
{
this
.
diffTree
(
this
.
repo
,
that
,
null
,
callback
)
;
}
;
/**
* Get an entry at the ith position.
*
*
@param
{
Number
} i
*
@return
{
TreeEntry
}
*/
Tree
.
prototype
.
entryByIndex
=
function
(
i
)
{
var
entry
=
oldEntryByIndex
.
call
(
this
,
i
)
;
entry
.
parent
=
this
;
return
entry
;
}
;
/**
* Get an entry by name; if the tree is a directory, the name is the filename.
*
*
@param
{
String
} name
*
@return
{
TreeEntry
}
*/
Tree
.
prototype
.
entryByName
=
function
(
name
)
{
var
entry
=
oldEntryByName
.
call
(
this
,
name
)
;
entry
.
parent
=
this
;
return
entry
;
}
;
/**
* Get an entry at a path. Unlike by name, this takes a fully
* qualified path, like `/foo/bar/baz.javascript`
*
*
@param
{
String
} path
*
@return
{
TreeEntry
}
*/
Tree
.
prototype
.
getEntry
=
function
(
path
,
callback
)
{
// FIXME: this method ought to implement the recursion directly, rather than
// rely on oldGetEntry, in order to ensure that `parent` pointers are direct.
var
self
=
this
;
oldGetEntry
.
call
(
this
,
path
,
function
(
error
,
entry
)
{
if
(
error
)
return
callback
(
error
)
;
entry
.
parent
=
self
;
entry
.
path
=
function
(
)
{
return
path
}
;
callback
(
null
,
entry
)
;
}
)
;
}
;
/**
* Return an array of the entries in this tree (excluding its children).
*
@return
{
[TreeEntry]
} an array of TreeEntrys
*/
Tree
.
prototype
.
entries
=
function
(
)
{
var
size
=
this
.
size
(
)
,
result
=
[
]
;
for
(
var
i
=
0
;
i
<
size
;
i
++
)
{
result
.
push
(
this
.
entryByIndex
(
i
)
)
;
}
return
result
;
}
;
/**
* Recursively walk the tree in breadth-first order. Fires an event for each entry.
*
*
@fires
Tree#entry
*
@fires
Tree#end
*
*
@param
{
Boolean
} [blobsOnly = true] True to emit only blob & blob executable entries.
*
*
@return
{
EventEmitter
}
*/
Tree
.
prototype
.
walk
=
function
(
blobsOnly
)
{
if
(
typeof
blobsOnly
==
'undefined'
)
blobsOnly
=
true
;
var
self
=
this
,
event
=
new
events
.
EventEmitter
(
)
,
entries
=
[
]
,
errors
=
[
]
;
var
total
=
1
;
// This looks like a DFS, but it is a BFS because of implicit queueing in
// the recursive call to `entry.getTree(bfs)`
function
bfs
(
error
,
tree
)
{
total
--
;
if
(
error
)
return
errors
.
push
(
error
)
;
tree
.
entries
(
)
.
forEach
(
function
(
entry
)
{
if
(
!
blobsOnly
||
entry
.
isFile
(
)
)
{
event
.
emit
(
'entry'
,
entry
)
;
entries
.
push
(
entry
)
;
}
if
(
entry
.
isTree
(
)
)
{
total
++
;
entry
.
getTree
(
bfs
)
;
}
}
)
;
if
(
total
===
0
)
event
.
emit
(
'end'
,
errors
.
length
?
errors
:
null
,
entries
)
;
}
event
.
start
=
function
(
)
{
bfs
(
null
,
self
)
;
}
;
return
event
;
}
;
/**
* Return the path of this tree, like `/lib/foo/bar`
*
@return
{
String
}
*/
Tree
.
prototype
.
path
=
function
(
blobsOnly
)
{
return
this
.
entry
?
this
.
entry
.
path
(
)
:
''
;
}
;
/**
* Make builder. This is helpful for modifying trees.
*
@return
{
TreeBuilder
}
*/
var
oldBuilder
=
Tree
.
prototype
.
builder
;
Tree
.
prototype
.
builder
=
function
(
)
{
var
builder
=
oldBuilder
.
call
(
this
)
;
builder
.
root
=
builder
;
builder
.
repo
=
this
.
repo
;
return
builder
;
}
;
Back
|
FazBrowse Home
|
New Git URL