Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
E
excit
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
argo
excit
Commits
b5bea40e
Commit
b5bea40e
authored
Jan 03, 2019
by
Nicolas Denoyelle
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
add offset argument to initialization to allow iterating on subtrees
parent
a97d5c7c
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
8 additions
and
8 deletions
+8
-8
src/excit.h
src/excit.h
+1
-1
src/tleaf.c
src/tleaf.c
+7
-7
No files found.
src/excit.h
View file @
b5bea40e
...
...
@@ -408,6 +408,6 @@ enum tleaf_it_policy_e {
* "arity": For each level, the number of children attached to a node. Leaves have no children, hence last level arity must be 0.
* "iter_policy": A policy for iteration on leaves.
*/
int
excit_tleaf_init
(
excit_t
it
,
const
ssize_t
depth
,
const
ssize_t
*
arity
,
const
enum
tleaf_it_policy_e
iter_policy
);
int
excit_tleaf_init
(
excit_t
it
,
const
ssize_t
depth
,
const
ssize_t
*
arity
,
const
enum
tleaf_it_policy_e
iter_policy
,
const
ssize_t
offset
);
#endif
src/tleaf.c
View file @
b5bea40e
...
...
@@ -54,9 +54,10 @@ void tleaf_it_free(excit_t it)
}
int
excit_tleaf_init
(
excit_t
it
,
const
ssize_t
depth
,
const
ssize_t
*
arities
,
const
enum
tleaf_it_policy_e
policy
)
const
ssize_t
depth
,
const
ssize_t
*
arities
,
const
enum
tleaf_it_policy_e
policy
,
const
ssize_t
offset
)
{
tleaf_it
data_it
;
EXCIT_DATA
(
it
,
data_it
);
...
...
@@ -69,6 +70,7 @@ int excit_tleaf_init(excit_t it,
ssize_t
i
;
data_it
->
leaves
=
1
;
data_it
->
depth
=
depth
;
data_it
->
offset
=
offset
;
for
(
i
=
0
;
i
<
depth
-
1
;
i
++
){
data_it
->
arity
[
i
]
=
arities
[
i
];
data_it
->
leaves
*=
arities
[
i
];
...
...
@@ -108,10 +110,9 @@ int tleaf_it_copy(excit_t dst_it, const excit_t src_it)
if
(
dst
==
NULL
||
src
==
NULL
)
return
EXCIT_EINVAL
;
//actual copy
err
=
excit_tleaf_init
(
dst_it
,
src
->
depth
,
src
->
arity
,
src
->
policy
);
err
=
excit_tleaf_init
(
dst_it
,
src
->
depth
,
src
->
arity
,
src
->
policy
,
src
->
offset
);
if
(
err
!=
EXCIT_SUCCESS
)
return
err
;
dst
->
cur
=
src
->
cur
;
dst
->
offset
=
src
->
offset
;
return
EXCIT_SUCCESS
;
}
...
...
@@ -244,13 +245,12 @@ int tleaf_it_split(const excit_t it, ssize_t n, excit_t *results){
int
err
;
for
(
i
=
0
;
i
<
n
;
i
++
){
results
[
i
]
=
excit_alloc_user
(
&
excit_tleaf_func_table
,
sizeof
(
*
data_it
));
excit_tleaf_init
(
results
[
i
],
depth
,
arities
,
policy
);
err
=
excit_get_data
(
results
[
i
],
(
void
**
)(
&
data_it
));
if
(
err
!=
EXCIT_SUCCESS
||
data_it
==
NULL
)
{
while
(
i
--
){
excit_free
(
results
[
i
]);
}
return
err
;
}
data_it
->
offset
=
data_it
->
leaves
*
i
;
excit_tleaf_init
(
results
[
i
],
depth
,
arities
,
policy
,
data_it
->
leaves
*
i
+
data_it
->
offset
)
;
}
free
(
arities
);
...
...
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