10 releases

0.3.5 Sep 10, 2022
0.3.4 Jul 17, 2022
0.3.3 Jan 26, 2021
0.3.2 Aug 2, 2020
0.2.0 Nov 8, 2018

#78 in Memory management

Download history 3053/week @ 2023-12-11 3341/week @ 2023-12-18 2621/week @ 2023-12-25 2335/week @ 2024-01-01 3290/week @ 2024-01-08 3010/week @ 2024-01-15 2688/week @ 2024-01-22 2113/week @ 2024-01-29 3169/week @ 2024-02-05 3203/week @ 2024-02-12 3732/week @ 2024-02-19 3625/week @ 2024-02-26 3785/week @ 2024-03-04 2867/week @ 2024-03-11 3422/week @ 2024-03-18 3851/week @ 2024-03-25

14,470 downloads per month
Used in 340 crates (via gfx-backend-vulkan)

MIT license

32KB
425 lines

Inplace it!

Version badge License badge Build Status

Place small arrays on the stack with a low cost!

The only price you should pay for this is the price of choosing a type based on the size of the requested array! This is just one match and call!

What?

This crate is created for one purpose: allocating small arrays on the stack. The simplest way to use it is:

use inplace_it::{inplace_or_alloc_array, UninitializedSliceMemoryGuard};

inplace_or_alloc_array(
    150, // size of needed array to allocate
    |mut uninit_guard: UninitializedSliceMemoryGuard<u16>| { // and this is consumer of uninitialized memory
        assert_eq!(160, uninit_guard.len());
        
        {
         // You can borrow guard to reuse memory
         let borrowed_uninit_guard = uninit_guard.borrow();
         // Let's initialize memory
         // Note that borrowed_uninit_guard will be consumed (destroyed to produce initialized memory guard)
         let init_guard = borrowed_uninit_guard.init(|index| index as u16 + 1);
         // Memory now contains elements [1, 2, ..., 160]
         // Lets check it. Sum of [1, 2, ..., 160] = 12880
         let sum: u16 = init_guard.iter().sum();
         assert_eq!(sum, 12880);
        }
        
        {
         // If you don't want to reuse memory, you can init new guard directly
         let init_guard = uninit_guard.init(|index| index as u16 * 2);
         // Memory now contains elements [0, 2, 4, ..., 318]
         // Lets check it. Sum of [0, 2, 4, ..., 318] = 25440
         let sum: u16 = init_guard.iter().sum();
         assert_eq!(sum, 25440);
        }
    }
)

Why?

Because allocation on the stack (i.e. placing variables) is MUCH FASTER then usual allocating in the heap.

Moar!

You can read the API reference for more details or create an new issue to submit a bug, feature request or just ask a question.

Release notes

Version Notes
0.3.5 Remove useless FixedArray trait.
0.3.4 Fix incorrect use of unstable intrinsic.
0.3.3 Some sugar for easy placing from Iterator's.
0.3.2 Placing of uninit memory moved out from try_inplace_array to disallow compiler to optimize it.
0.3.1 Initialize with an exact-size iterator.
0.3.0
  • API safety. No more unsafe external functions.
  • Drop correctness. No more dropping of uninitialized memory.
0.2.2 Fixed drop-correctness for safe functions. Now unsafe function do not drop your data but safe function do it correctly.

No runtime deps