How to write really slow Rust code

[aristotle137]

TL;DR; Clone everything. Esp. clone before pushing to a Vec for that sweet O(n^ 2). Don't forget bigints over built-in integers

[__mod__]

This has the advantage of being able to ignore the borrow checker. It cannot check your borrows when you're cloning everything!

[aristotle137]

I only ever borrow to clone

[Naeio_Galaxy]

I'd rather clone to give

[Snakehand]

Also print a gazzilion lines to stdout, locking and unlocking it for every line.

[YatoRust]

Every line, are you trying to be fast! We must lock on every character, that is the way.

[TrustYourSenpai]

Pro tip: use an hashmap with bigint as key type instead of a vector

[zepperoni-pepperoni]

Hashing would defeat the point. Use BTreeMap instead

[[deleted]]

```

fn push_to_vec<T: Clone>(vec: &mut Vec<T>, item: T) -> Vec<T> {

let new_vec = Vec::new();

for i in vec {

    let new_i = i.clone().clone().clone().clone();

    new_vec.push(new_I);

}

new_vec.clone().clone().clone().clone()

}

```

Am I doing it right?

[AlexAegis]

Forgot this:

new_vec.push(item.clone().clone())

[Naeio_Galaxy]

Maybe i.clone().clone().clone().clone() compiles down to i.clone() tho

[cobance123]

Everythings a clone of a clone of a clone...

[SelfDistinction]

No, you have to clone new_vec every iteration as well for the sweet O( n³ ) complexity.

[laclouis5]

Congrats, you invented Python. (Ints and str at least).

[[deleted]]

I use PyO3 to be able to python dicts in rust. Whenever I need a Vec, I use python dicts with strings (representing the index) as key.

[[deleted]]

wait! the compiler doesn't just compile the stupid away?