mirror of
https://github.com/facebook/sapling.git
synced 2024-10-11 09:17:30 +03:00
fc8c0d61a1
Summary: This allows us to use fastmanifest as a directory to drop in the python module. Test Plan: compiles, passes existing tests. Reviewers: lcharignon Reviewed By: lcharignon Subscribers: mitrandir, mjpieters Differential Revision: https://phabricator.intern.facebook.com/D3351021 Signature: t1:3351021:1464284417:6cbcde514ab1fd7b5caa6c83cb5577f3502dbc58
44 lines
1011 B
C
44 lines
1011 B
C
// Copyright 2016-present Facebook. All Rights Reserved.
|
|
//
|
|
// tree_iterator.c: declarations for traversing all the nodes of a tree
|
|
// in-order.
|
|
//
|
|
// no-check-code
|
|
|
|
#ifndef __FASTMANIFEST_TREE_ITERATOR_H__
|
|
#define __FASTMANIFEST_TREE_ITERATOR_H__
|
|
|
|
#include <stdbool.h>
|
|
#include <stdlib.h>
|
|
|
|
#include "node.h"
|
|
|
|
typedef struct _path_record_t {
|
|
const node_t* node;
|
|
size_t child_idx;
|
|
|
|
// this is how much of the path was already present when we started walking
|
|
// this node. once we close this path, we should restore the iterator's
|
|
// path_idx to this. value.
|
|
size_t previous_path_idx;
|
|
} path_record_t;
|
|
|
|
struct _iterator_t {
|
|
tree_t* copy;
|
|
|
|
bool construct_paths;
|
|
|
|
// track where we are in the iteration process.
|
|
path_record_t *path_records;
|
|
|
|
// this is where the next path record should be written to.
|
|
size_t path_records_idx;
|
|
|
|
// track the path, if path construction is requested.
|
|
char *path;
|
|
size_t path_idx;
|
|
size_t path_sz;
|
|
};
|
|
|
|
#endif // #ifndef __FASTMANIFEST_TREE_ITERATOR_H__
|