mirror of
git://git.sv.gnu.org/emacs.git
synced 2026-02-02 05:32:08 -08:00
ea8daec9bb
* src/alloc.c (mark_overlay): Add sanity check. * src/buffer.c (next_overlay_change, previous_overlay_change): Tweak code to keep the same vars for the bounds. * src/itree.c (interval_tree_clear, interval_tree_insert) (interval_tree_remove, interval_tree_insert_fix, interval_tree_remove_fix): Adjust to the `color` -> `red` change. (interval_tree_clear): Prefer `true/false` for booleans. (interval_generator_create): Use an actual `interval_tree_order` value rather than 0. (interval_generator_next): Simplify a tiny bit. Add comment. (interval_generator_narrow): Add sanity check. * src/itree.h (struct interval_node): Replace `color` field with boolean `red` field. (enum interval_tree_order): Remove unused `ITREE_DEFLT_ORDER` value. * src/pdumper.c (dump_interval_node): Adjust to the `color` -> `red` change.
91 lines
3.8 KiB
C
91 lines
3.8 KiB
C
/* This file implements an efficient interval data-structure.
|
|
|
|
Copyright (C) 2017-2022 Free Software Foundation, Inc.
|
|
|
|
This file is part of GNU Emacs.
|
|
|
|
GNU Emacs is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or (at
|
|
your option) any later version.
|
|
|
|
GNU Emacs is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with GNU Emacs. If not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#ifndef ITREE_H
|
|
#define ITREE_H
|
|
#include <config.h>
|
|
#include <stddef.h>
|
|
#include <inttypes.h>
|
|
|
|
/* The tree and node structs are mainly here, so they can be allocated.
|
|
|
|
NOTE: The only time where it is safe to modify node.begin and
|
|
node.end directly, is while the node is not part of any tree.
|
|
|
|
NOTE: It is safe to read node.begin and node.end directly, if the
|
|
node came from a generator, because it validates the nodes it
|
|
returns as a side-effect.
|
|
*/
|
|
|
|
struct interval_node;
|
|
struct interval_node
|
|
{
|
|
struct interval_node *parent;
|
|
struct interval_node *left;
|
|
struct interval_node *right;
|
|
ptrdiff_t begin; /* The beginning of this interval. */
|
|
ptrdiff_t end; /* The end of the interval. */
|
|
ptrdiff_t limit; /* The maximum end in this subtree. */
|
|
ptrdiff_t offset; /* The amount of shift to apply to this subtree. */
|
|
uintmax_t otick; /* offset modified tick */
|
|
Lisp_Object data; /* Exclusively used by the client. */
|
|
bool_bf red : 1;
|
|
bool_bf visited : 1; /* Internal to `interval_generator_next`. */
|
|
bool_bf rear_advance : 1; /* Same as for marker and overlays. */
|
|
bool_bf front_advance : 1; /* Same as for marker and overlays. */
|
|
};
|
|
|
|
struct interval_tree
|
|
{
|
|
struct interval_node *root;
|
|
struct interval_node null; /* The tree's version of NULL. */
|
|
uintmax_t otick; /* offset tick, compared with node's otick. */
|
|
intmax_t size; /* Number of nodes in the tree. */
|
|
struct interval_generator *iter;
|
|
bool_bf iter_running : 1;
|
|
const char* file;
|
|
int line;
|
|
};
|
|
|
|
enum interval_tree_order {
|
|
ITREE_ASCENDING,
|
|
ITREE_DESCENDING,
|
|
ITREE_PRE_ORDER,
|
|
};
|
|
|
|
void interval_node_init (struct interval_node *, ptrdiff_t, ptrdiff_t, bool, bool, Lisp_Object);
|
|
ptrdiff_t interval_node_begin (struct interval_tree *, struct interval_node *);
|
|
ptrdiff_t interval_node_end (struct interval_tree *, struct interval_node *);
|
|
void interval_node_set_region (struct interval_tree *, struct interval_node *, ptrdiff_t, ptrdiff_t);
|
|
struct interval_tree *interval_tree_create (void);
|
|
void interval_tree_destroy (struct interval_tree *);
|
|
intmax_t interval_tree_size (struct interval_tree *);
|
|
void interval_tree_clear (struct interval_tree *);
|
|
void interval_tree_insert (struct interval_tree *, struct interval_node *);
|
|
bool interval_tree_contains (struct interval_tree *, struct interval_node *);
|
|
struct interval_node *interval_tree_remove (struct interval_tree *, struct interval_node *);
|
|
void interval_tree_iter_start (struct interval_tree *, ptrdiff_t, ptrdiff_t, enum interval_tree_order,
|
|
const char* file, int line);
|
|
void interval_tree_iter_narrow (struct interval_tree *, ptrdiff_t, ptrdiff_t);
|
|
void interval_tree_iter_finish (struct interval_tree *);
|
|
struct interval_node *interval_tree_iter_next (struct interval_tree *);
|
|
void interval_tree_insert_gap (struct interval_tree *, ptrdiff_t, ptrdiff_t);
|
|
void interval_tree_delete_gap (struct interval_tree *, ptrdiff_t, ptrdiff_t);
|
|
void interval_tree_nodes (struct interval_tree *tree, struct interval_node **nodes, enum interval_tree_order order);
|
|
#endif
|