AreaStore

Description
A fast access data structure to store areas, and find areas near a given position or area. Every area has a  string attribute to store additional information. You can create an empty  by calling , or. If you chose the parameter-less constructor, a fast implementation will be automatically chosen for you.

Methods
is a string stored with the area. "params": {       enabled = boolean, -- whether to enable, default true block_radius = number, -- the radius (in nodes) of the areas the cache generates prefiltered lists for, minimum 16, default 64 limit = number, -- the cache's size, minimum 20, default 1000 }
 * : returns the area with the id . (optional) Boolean values   and   control what's copied.
 * : returns all areas that contain the position . (optional) Boolean values   and   control what's copied.
 * : returns all areas that contain all nodes inside the area specified by  and   (inclusive). If   is true, also areas are returned that have nodes in common with the specified area. (optional) Boolean values   and   control what's copied.
 * : inserts an area into the store. Returns the id if successful, nil otherwise. The (inclusive) positions  and   describe the area,
 * : reserves resources for at most  many contained areas. Only needed for efficiency, and only some implementations profit.
 * : removes the area with the given id from the store, returns success.
 * : sets params for the included prefiltering cache. Calling invalidates the cache, so that its elements have to be newly generated.