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
ef9dfa9f
Commit
ef9dfa9f
authored
May 29, 2020
by
Sartika Aritonang
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Upload New File
parent
ec12b859
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
67 additions
and
0 deletions
+67
-0
py.py
stbi/Lib/site-packages/pip/_vendor/html5lib/_trie/py.py
+67
-0
No files found.
stbi/Lib/site-packages/pip/_vendor/html5lib/_trie/py.py
0 → 100644
View file @
ef9dfa9f
from
__future__
import
absolute_import
,
division
,
unicode_literals
from
pip._vendor.six
import
text_type
from
bisect
import
bisect_left
from
._base
import
Trie
as
ABCTrie
class
Trie
(
ABCTrie
):
def
__init__
(
self
,
data
):
if
not
all
(
isinstance
(
x
,
text_type
)
for
x
in
data
.
keys
()):
raise
TypeError
(
"All keys must be strings"
)
self
.
_data
=
data
self
.
_keys
=
sorted
(
data
.
keys
())
self
.
_cachestr
=
""
self
.
_cachepoints
=
(
0
,
len
(
data
))
def
__contains__
(
self
,
key
):
return
key
in
self
.
_data
def
__len__
(
self
):
return
len
(
self
.
_data
)
def
__iter__
(
self
):
return
iter
(
self
.
_data
)
def
__getitem__
(
self
,
key
):
return
self
.
_data
[
key
]
def
keys
(
self
,
prefix
=
None
):
if
prefix
is
None
or
prefix
==
""
or
not
self
.
_keys
:
return
set
(
self
.
_keys
)
if
prefix
.
startswith
(
self
.
_cachestr
):
lo
,
hi
=
self
.
_cachepoints
start
=
i
=
bisect_left
(
self
.
_keys
,
prefix
,
lo
,
hi
)
else
:
start
=
i
=
bisect_left
(
self
.
_keys
,
prefix
)
keys
=
set
()
if
start
==
len
(
self
.
_keys
):
return
keys
while
self
.
_keys
[
i
]
.
startswith
(
prefix
):
keys
.
add
(
self
.
_keys
[
i
])
i
+=
1
self
.
_cachestr
=
prefix
self
.
_cachepoints
=
(
start
,
i
)
return
keys
def
has_keys_with_prefix
(
self
,
prefix
):
if
prefix
in
self
.
_data
:
return
True
if
prefix
.
startswith
(
self
.
_cachestr
):
lo
,
hi
=
self
.
_cachepoints
i
=
bisect_left
(
self
.
_keys
,
prefix
,
lo
,
hi
)
else
:
i
=
bisect_left
(
self
.
_keys
,
prefix
)
if
i
==
len
(
self
.
_keys
):
return
False
return
self
.
_keys
[
i
]
.
startswith
(
prefix
)
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