<commit_before>#ifndef BTREE_H_
#define BTREE_H_

#include <stdbool.h>
#include <stdlib.h>
#include <stdint.h>
#include <limits.h>

#define BTREE_ORDER 20

/* How many revisions of each file to store */
#define REV_TRUNCATE 20

enum mode_t {
	NODE_REGULAR,
	NODE_SYMLINK,
	NODE_EXECUTABLE,
};

/*Type representing a node in the B+ tree.
 *This type is general enough to serve for both
 *the leaf and the internal node.
 *The heart of the node is the array
 *of keys and the array of corresponding
 *pointers.  The relation between keys
 *and pointers differs between leaves and
 *internal nodes.  In a leaf, the index
 *of each key equals the index of its corresponding
 *pointer, with a maximum of order - 1 key-pointer
 *pairs.  The last pointer points to the
 *leaf to the right (or NULL in the case
 *of the rightmost leaf).
 *In an internal node, the first pointer
 *refers to lower nodes with keys less than
 *the smallest key in the keys array.  Then,
 *with indices i starting at 0, the pointer
 *at i + 1 points to the subtree with keys
 *greater than or equal to the key in this<commit_msg>btree: change BTREE_ORDER to 3<commit_after>#ifndef BTREE_H_
#define BTREE_H_

#include <stdbool.h>
#include <stdlib.h>
#include <stdint.h>
#include <limits.h>

#define BTREE_ORDER 3

/* How many revisions of each file to store */
#define REV_TRUNCATE 20

enum mode_t {
	NODE_REGULAR,
	NODE_SYMLINK,
	NODE_EXECUTABLE,
};

/*Type representing a node in the B+ tree.
 *This type is general enough to serve for both
 *the leaf and the internal node.
 *The heart of the node is the array
 *of keys and the array of corresponding
 *pointers.  The relation between keys
 *and pointers differs between leaves and
 *internal nodes.  In a leaf, the index
 *of each key equals the index of its corresponding
 *pointer, with a maximum of order - 1 key-pointer
 *pairs.  The last pointer points to the
 *leaf to the right (or NULL in the case
 *of the rightmost leaf).
 *In an internal node, the first pointer
 *refers to lower nodes with keys less than
 *the smallest key in the keys array.  Then,
 *with indices i starting at 0, the pointer
 *at i + 1 points to the subtree with keys
 *greater than or equal to the key in this
{'fraction_non_alphanumeric': 0.06453068592057762, 'fraction_numerical': 0.00631768953068592, 'mean_word_length': 3.8940397350993377, 'pattern_counts': {'":': 0, '<': 11, '<?xml version=': 0, '>': 11, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '6127529', 'n_tokens_mistral': 698, 'n_tokens_neox': 669, 'n_words': 349}