Rust implementation of http-server is able
- to upload batches of ticket
- to store the uploaded batches in special internal sorted order
- to search need ticket in the uploaded batches: search is based on binary search algorithm and DFS with many author's improved modifications
- hyper is used to HTTP implementation
- futures is used to provide a robust implementation of handling asynchronous computations
- tokio_core is used to to provide an event loop ("reactor core")
- serde is used to serialize and deserialize Rust data structures
- serde_json is used with serde
- serde_derive is used with serde
Internal algorithms is able
- to find a set of different paths between two nodes (if it exists) regardless of path length (or count of internal nodes)
- and to provide a robust implementation of even cycles in graph
- Server supports multithreading
- Now there are no parallel computings. In the future rayon will added to support parallel sort.