|
PBeFS
Parallel Best-First Search
|
the options of DDDAStar, besides those of all the searches More...
#include <PBeFS/astar/DDDAStar.h>
Public Attributes | |
| std::size_t | partitions = 64 |
| the files of a bucket, i.e., the parts by the hash of the state: the largest bucket over this number is what the search holds in memory | |
| std::filesystem::path | directory |
| where the files go, in a directory of their own removed at the end; the temporary directory of the system if empty | |
| std::size_t | buffer_bytes = std::size_t( 1 ) << 16 |
| the bytes of the buffer of each file being written, i.e., of each file of the buckets that the successors of a bucket go to | |
the options of DDDAStar, besides those of all the searches
| std::size_t buffer_bytes = std::size_t( 1 ) << 16 |
the bytes of the buffer of each file being written, i.e., of each file of the buckets that the successors of a bucket go to
| std::filesystem::path directory |
where the files go, in a directory of their own removed at the end; the temporary directory of the system if empty
| std::size_t partitions = 64 |
the files of a bucket, i.e., the parts by the hash of the state: the largest bucket over this number is what the search holds in memory