How to write slow Rust code

• prechelt-phone-number-encoding

  18 29 2.7 Java

  Comparison between Java and Common Lisp solutions to a phone-encoding problem described by Prechelt

source: https://github.com/renatoathaydes/prechelt-phone-number-enco...

• prechelt-phone-number-enco

  3 - -

source: https://github.com/renatoathaydes/prechelt-phone-number-enco...

• InfluxDB

  www.influxdata.com featured

  Power Real-Time Data Analytics at Scale. Get real-time insights from all types of time series data with InfluxDB. Ingest, query, and analyze billions of data points in real-time with unbounded cardinality.

  

• prechelt-phone-number-encoding

  1 0 0.0 Java

  Comparison between Java and Common Lisp solutions to a phone-encoding problem described by Prechelt (by nybble41)

In this case the linked list is just tracking "breadcrumbs" which mirror the path back up the call chain, so you don't even need reference counting; a simple borrowed reference will do. I put together a version in Rust based on stack-allocated linked lists[0], and the results were promising: on 10 million inputs the Rust version completes in about 40 seconds on my machine, while the Java port (Main2.java in the code; "Java1" from the article IIUC) takes 82 seconds. This Rust version doesn't allocate anything from the heap, apart from loading the dictionary at startup; all the bookkeeping, including the cons cells, is kept on the stack.

[0] https://github.com/nybble41/prechelt-phone-number-encoding

Suggest a related project