Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
N
news
Project
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Sartika Aritonang
news
Commits
193370cb
Commit
193370cb
authored
May 29, 2020
by
Sartika Aritonang
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Upload New File
parent
11c713dd
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
130 additions
and
0 deletions
+130
-0
etree.py
...b/site-packages/pip/_vendor/html5lib/treewalkers/etree.py
+130
-0
No files found.
stbi/Lib/site-packages/pip/_vendor/html5lib/treewalkers/etree.py
0 → 100644
View file @
193370cb
from
__future__
import
absolute_import
,
division
,
unicode_literals
from
collections
import
OrderedDict
import
re
from
pip._vendor.six
import
string_types
from
.
import
base
from
.._utils
import
moduleFactoryFactory
tag_regexp
=
re
.
compile
(
"{([^}]*)}(.*)"
)
def
getETreeBuilder
(
ElementTreeImplementation
):
ElementTree
=
ElementTreeImplementation
ElementTreeCommentType
=
ElementTree
.
Comment
(
"asd"
)
.
tag
class
TreeWalker
(
base
.
NonRecursiveTreeWalker
):
# pylint:disable=unused-variable
"""Given the particular ElementTree representation, this implementation,
to avoid using recursion, returns "nodes" as tuples with the following
content:
1. The current element
2. The index of the element relative to its parent
3. A stack of ancestor elements
4. A flag "text", "tail" or None to indicate if the current node is a
text node; either the text or tail of the current element (1)
"""
def
getNodeDetails
(
self
,
node
):
if
isinstance
(
node
,
tuple
):
# It might be the root Element
elt
,
_
,
_
,
flag
=
node
if
flag
in
(
"text"
,
"tail"
):
return
base
.
TEXT
,
getattr
(
elt
,
flag
)
else
:
node
=
elt
if
not
(
hasattr
(
node
,
"tag"
)):
node
=
node
.
getroot
()
if
node
.
tag
in
(
"DOCUMENT_ROOT"
,
"DOCUMENT_FRAGMENT"
):
return
(
base
.
DOCUMENT
,)
elif
node
.
tag
==
"<!DOCTYPE>"
:
return
(
base
.
DOCTYPE
,
node
.
text
,
node
.
get
(
"publicId"
),
node
.
get
(
"systemId"
))
elif
node
.
tag
==
ElementTreeCommentType
:
return
base
.
COMMENT
,
node
.
text
else
:
assert
isinstance
(
node
.
tag
,
string_types
),
type
(
node
.
tag
)
# This is assumed to be an ordinary element
match
=
tag_regexp
.
match
(
node
.
tag
)
if
match
:
namespace
,
tag
=
match
.
groups
()
else
:
namespace
=
None
tag
=
node
.
tag
attrs
=
OrderedDict
()
for
name
,
value
in
list
(
node
.
attrib
.
items
()):
match
=
tag_regexp
.
match
(
name
)
if
match
:
attrs
[(
match
.
group
(
1
),
match
.
group
(
2
))]
=
value
else
:
attrs
[(
None
,
name
)]
=
value
return
(
base
.
ELEMENT
,
namespace
,
tag
,
attrs
,
len
(
node
)
or
node
.
text
)
def
getFirstChild
(
self
,
node
):
if
isinstance
(
node
,
tuple
):
element
,
key
,
parents
,
flag
=
node
else
:
element
,
key
,
parents
,
flag
=
node
,
None
,
[],
None
if
flag
in
(
"text"
,
"tail"
):
return
None
else
:
if
element
.
text
:
return
element
,
key
,
parents
,
"text"
elif
len
(
element
):
parents
.
append
(
element
)
return
element
[
0
],
0
,
parents
,
None
else
:
return
None
def
getNextSibling
(
self
,
node
):
if
isinstance
(
node
,
tuple
):
element
,
key
,
parents
,
flag
=
node
else
:
return
None
if
flag
==
"text"
:
if
len
(
element
):
parents
.
append
(
element
)
return
element
[
0
],
0
,
parents
,
None
else
:
return
None
else
:
if
element
.
tail
and
flag
!=
"tail"
:
return
element
,
key
,
parents
,
"tail"
elif
key
<
len
(
parents
[
-
1
])
-
1
:
return
parents
[
-
1
][
key
+
1
],
key
+
1
,
parents
,
None
else
:
return
None
def
getParentNode
(
self
,
node
):
if
isinstance
(
node
,
tuple
):
element
,
key
,
parents
,
flag
=
node
else
:
return
None
if
flag
==
"text"
:
if
not
parents
:
return
element
else
:
return
element
,
key
,
parents
,
None
else
:
parent
=
parents
.
pop
()
if
not
parents
:
return
parent
else
:
assert
list
(
parents
[
-
1
])
.
count
(
parent
)
==
1
return
parent
,
list
(
parents
[
-
1
])
.
index
(
parent
),
parents
,
None
return
locals
()
getETreeModule
=
moduleFactoryFactory
(
getETreeBuilder
)
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment