Data structures

Topics
	astar/Node.h
	A node of the search graph.
	astar/NodeTable.h
	Class template NodeTable, the closed list of the searches: a map from the generated states to their canonical Node, taken from the set of data structures chosen [see Structures.h].
	astar/structures/ads/NodeTable.h
	The closed list, on the PointerTable of ADS, on huge pages.
	astar/structures/ads/ConcurrentClosed.h
	The closed list shared by the workers, a lock-free set of the nodes.
	astar/ConcurrentClosed.h
	Class template ConcurrentClosed, the closed list that the workers of SPAStar and MQAStar share, taken from the set of data structures chosen [see Structures.h].
	astar/structures/ads/OpenList.h
	Priority queues of the OPEN list of the set of data structures of ADS [see Structures.h], HeapOpenList and BucketOpenList, on the DaryHeap and the BucketQueue of ADS; OpenList.h includes it in place of its own, with the same order of the entries but for the ties of f and g.
	astar/OpenList.h
	Priority queues of the OPEN list, taken from the set of data structures chosen [see Structures.h]: the class templates HeapOpenList, a heap for any cost type, and BucketOpenList, a two-level bucket queue for integer costs, and their entries.
	astar/Structures.h
	Choice of the set of data structures of A*: the arena of the nodes (NodePool), the closed list (NodeTable), the OPEN lists (HeapOpenList and BucketOpenList) and the adjacency of the explicit graphs and of the grids.

Detailed Description