I guess that’s another way to avoid the overflow problem

C:

int increment(int i) {
    return (int) (1[(void*) i])

However, if you wanna go blazingly fast you gotta implement O(n) algorithms in rust. Additionally you want safety in case of integer overflows.

use std::error::Error;

#[derive(Debug, Error)]
struct IntegerOverflowError;

struct Incrementor {
    lookup_table: HashMap<i32, i33>
}

impl Incrementor {
    fn new() -> Self {
        let mut lut = HashMap::new();
        for i in 0..i32::MAX {
            lut.insert(i, i+1)
        }
        Incrementor { lookup_table: lut }
    }

    fn increment(&self, i: i32) -> Result<i32, IntegerOverflowError> {
        self.lookup_table.get(i)
            .map(|i| *i)
            .ok_or(IntegerOverflowError)
}

On mobile so I don’t even know if they compile though.

Not really. When you pirate a movie you get the whole thing. Just as if you paid for it.

A succulent leaf, however, needs years to become the size of an actual plant they would sell.

It’s even less damaging than pirating.

Some people would not select google though. And google can’t afford people knowing that there’s competitors to Google! So better fuck everyone over by just disabling the integration.