R-tree, range tree ...
Range Queries: R-tree | Pedagogic Modules (nau.edu)
An R-tree (Rectange-tree) stores objects in rectangles. The main idea of the R-tree is to construct the index using a hierarchy of bounding rectangles as a function of the input data.
An R-Tree is a special index that is designed for doing range queries. R-Trees are most commonly used in geospatial systems where each entry is a rectangle with minimum and maximum X and Y coordinates. Given a query rectangle, an R-Tree is able to quickly find all entries that are contained within the query rectangle or which overlap the query rectangle. This idea is easily extended to three dimensions for use in CAD systems.
A range tree is an ordered tree data structure to hold a list of points. It allows all points within a given range to be reported efficiently, and is typically used in two or higher dimensions. Range trees were introduced by Jon Louis Bentley in 1979. Similar data structures were discovered independently by Lueker, Lee and Wong, and Willard.
Range query tree | Detailed Pedia
A Range Query Tree, or RQT, is a term for referring to a data structure that is used for performing range queries and updates on an underlying array, which is treated as the leaves of the tree.
A segment tree, also known as a statistic tree, is a tree data structure used for storing information about intervals, or segments.
没事学那么多语言干啥？比如C#又能AOT (Ahead-of-time compilation)了；Rust又能啥啥啥了；Java又发明比nio更接近native的了；C++更晦涩，涉及模板的出错信息更长了……
D语言 20多年前就有了。Home - D Programming Language
