equal
deleted
inserted
replaced
173 if n not in p: |
173 if n not in p: |
174 h.append(n) |
174 h.append(n) |
175 for pn in self.parents(n): |
175 for pn in self.parents(n): |
176 p[pn] = 1 |
176 p[pn] = 1 |
177 return h |
177 return h |
|
178 |
|
179 def children(self, node): |
|
180 c = [] |
|
181 p = self.rev(node) |
|
182 for r in range(p + 1, self.count()): |
|
183 n = self.node(r) |
|
184 for pn in self.parents(n): |
|
185 if pn == p: |
|
186 c.append(p) |
|
187 continue |
|
188 elif pn == nullid: |
|
189 continue |
|
190 return c |
178 |
191 |
179 def lookup(self, id): |
192 def lookup(self, id): |
180 try: |
193 try: |
181 rev = int(id) |
194 rev = int(id) |
182 return self.node(rev) |
195 return self.node(rev) |