Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
erp5
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Xavier Thompson
erp5
Commits
0fbad18f
Commit
0fbad18f
authored
May 31, 2012
by
Vincent Pelletier
Committed by
Sebastien Robin
Aug 07, 2014
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Expose a storage-efficient way to access a large area.
parent
a10190ff
Changes
1
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
23 additions
and
9 deletions
+23
-9
product/ERP5Type/BTreeData.py
product/ERP5Type/BTreeData.py
+23
-9
No files found.
product/ERP5Type/BTreeData.py
View file @
0fbad18f
from
cStringIO
import
StringIO
from
BTrees.LOBTree
import
LOBTree
from
BTrees.LOBTree
import
LOBTree
from
persistent
import
Persistent
from
persistent
import
Persistent
...
@@ -101,6 +100,21 @@ class BTreeData(Persistent):
...
@@ -101,6 +100,21 @@ class BTreeData(Persistent):
Returns string of read data.
Returns string of read data.
"""
"""
return
''
.
join
(
self
.
iterate
(
offset
,
size
))
def
iterate
(
self
,
offset
=
0
,
size
=
None
):
"""
Return file data in storage-efficient chunks.
offset (int)
Offset of first byte to read.
size (int, None)
Number of bytes to read.
If None, the whole file is read.
Yields data chunks as they are read from storage (or locally generated,
when padding over sparse area).
"""
if
offset
<
0
:
if
offset
<
0
:
raise
negative_offset_error
raise
negative_offset_error
tree
=
self
.
_tree
tree
=
self
.
_tree
...
@@ -113,15 +127,14 @@ class BTreeData(Persistent):
...
@@ -113,15 +127,14 @@ class BTreeData(Persistent):
# - avoid loading last key if its past the end of read request
# - avoid loading last key if its past the end of read request
# Would simlify the loop, but might duplicate code... And CPU is not
# Would simlify the loop, but might duplicate code... And CPU is not
# expected to be the bottleneck here.
# expected to be the bottleneck here.
result
=
StringIO
()
if
size
is
None
:
write
=
result
.
write
size
=
len
(
self
)
-
offset
written
=
0
next_byte
=
offset
for
key
in
tree
.
iterkeys
(
key
):
for
key
in
tree
.
iterkeys
(
key
):
next_byte
=
offset
+
written
padding
=
min
(
size
,
key
-
next_byte
)
padding
=
min
(
size
,
key
-
next_byte
)
if
padding
>
0
:
if
padding
>
0
:
write
(
'
\
x00
'
*
padding
)
write
(
'
\
x00
'
*
padding
)
written
+=
padding
next_byte
+=
padding
size
-=
padding
size
-=
padding
chunk_offset
=
0
chunk_offset
=
0
else
:
else
:
...
@@ -134,10 +147,9 @@ class BTreeData(Persistent):
...
@@ -134,10 +147,9 @@ class BTreeData(Persistent):
# cache by discarding chunks earlier.
# cache by discarding chunks earlier.
chunk
.
_p_deactivate
()
chunk
.
_p_deactivate
()
to_write_len
=
len
(
to_write
)
to_write_len
=
len
(
to_write
)
write
(
to_write
)
size
-=
to_write_len
size
-=
to_write_len
written
+=
to_write_len
next_byte
+=
to_write_len
return
result
.
getvalue
()
yield
to_write
def
truncate
(
self
,
offset
):
def
truncate
(
self
,
offset
):
"""
"""
...
@@ -173,8 +185,10 @@ if __name__ == '__main__':
...
@@ -173,8 +185,10 @@ if __name__ == '__main__':
def
check
(
tree
,
length
,
read_offset
,
read_length
,
data
,
keys
=
None
):
def
check
(
tree
,
length
,
read_offset
,
read_length
,
data
,
keys
=
None
):
tree_length
=
len
(
tree
)
tree_length
=
len
(
tree
)
tree_data
=
tree
.
read
(
read_offset
,
read_length
)
tree_data
=
tree
.
read
(
read_offset
,
read_length
)
tree_iterator_data
=
''
.
join
(
tree
.
iterate
(
read_offset
,
read_length
))
assert
tree_length
==
length
,
tree_length
assert
tree_length
==
length
,
tree_length
assert
tree_data
==
data
,
repr
(
tree_data
)
assert
tree_data
==
data
,
repr
(
tree_data
)
assert
tree_iterator_data
==
data
,
repr
(
tree_iterator_data
)
if
keys
is
not
None
:
if
keys
is
not
None
:
tree_keys
=
list
(
tree
.
_tree
.
keys
())
tree_keys
=
list
(
tree
.
_tree
.
keys
())
assert
tree_keys
==
keys
,
tree_keys
assert
tree_keys
==
keys
,
tree_keys
...
...
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