(self, node)
| 283 | |
| 284 | |
| 285 | def _append_child(self, node): |
| 286 | # fast path with less checks; usable by DOM builders if careful |
| 287 | childNodes = self.childNodes |
| 288 | if childNodes: |
| 289 | last = childNodes[-1] |
| 290 | node.previousSibling = last |
| 291 | last.nextSibling = node |
| 292 | childNodes.append(node) |
| 293 | node.parentNode = self |
| 294 | |
| 295 | |
| 296 | def _write_data(writer, text, attr): |
no test coverage detected
searching dependent graphs…