However, I am stymied for ideas. There are the classics: Dijkstra’s, Floyd-Warshall, Traveling Salesman, A*, bloom filter, breadth-first iterative search, binary search, K-way merge, bubble/selection/insertion sort, in-place quick sort, bucket/radix sort, closest pair (https://medium.com/always-be-coding/abc-always-be-coding-d5f8051afce2#.z04nk39y1) but none of them are inspiring.

My own ideas have been limited to writing a shell, but I have already done that in C, and a MIX-simulator, but I have already written a MIPS32-simulator in Java. All my other ideas are poor fits for Rust so I won't even mention them here.

Since other people beat me to implementing Protobuffers and Flatbuffers (as well as Doom) I am stymied.

Therefore I ask you, is there any kind of library functionality you miss, perhaps something that already exists in another language, or do you have any suggestions for Rust-suitable projects?