|  | Home | Libraries | People | FAQ | More | 
The tree is created using packing algorithm and a temporary packing allocator.
template<typename Iterator>rtree(Iteratorfirst,Iteratorlast,allocator_typeconst &allocator)
| Type | Name | Description | 
|---|---|---|
| 
                       | 
                       | The beginning of the range of Values. | 
| 
                       | 
                       | The end of the range of Values. | 
| 
                       | 
                       | The allocator object for persistent data in the tree. |