In composite literals the key (index in case of array and slice literals) can be optionally provided. For array and slice literals the following rules apply: Each element has an associated integer index marking its position in the array. An element with a key uses the key as its index; the key must be a … Read more
So shouldn’t the following be the correct way to dynamically allocate a 2d array? It should, since this approach is the equivalent of declaring a “statically-allocated” array of multiple dimensions. The reason for this is that this way, you get a contiguous block of memory, which is convenient (you couldn’t use memset() on a pointer-to-pointer, … Read more
The problem is, as the error says, you cannot use protocols with Self or associated type requirements as actual types – as you’d lose the type information for what those requirements were. In this case, you’d lose the type information for the parameters of the == implementation – as Equatable says they must be the … Read more
This is a very common requirement so the standard library caters to it with a function, zip:* for (a,b) in zip(seq1, seq2) { // a and b will be matching pairs from the two sequences } Unfortunately, as of right now, zip only does pairs, even though in theory it could be overloaded to do … Read more
Manually one can do for (dst, src) in array1.iter_mut().zip(&array2) { *dst = *src } for a typical slice. However, there is a likely faster specialization in clone_from_slice: dst[..4].clone_from_slice(&src) A slightly older method is to use std::io::Write, which was implemented for &mut [u8]. use std::io::Write; let _ = dst.write(&src) This will write up to the end … Read more
The cookie goes to brettdj as resizing a 1D array and populating it is the best way to go (fastest) but I wanted to offer a more lesser-known compact solution in the case that you don’t plan to use this on long arrays. It’s not as fast than the 1D approach, but not slow like … Read more
Summary: your benchmark is flawed; just use a Vec (as described here), possibly with into_boxed_slice, as it is incredibly unlikely to be slower than a heap allocated array. Unfortunately, your benchmarks are flawed. First of all, you probably didn’t compile with optimizations (–release for cargo, -O for rustc). Because if you would have, the Rust … Read more
At some point recently, each function was given its own, distinct type for… reasons that I don’t recall. Upshot is that you need to give the compiler a hint (note the type on functions): fn foo() -> isize { 1 } fn bar() -> isize { 2 } fn main() { let functions: Vec<fn() -> … Read more
You could use System.Collections.ArrayList: Dim arr As Object Dim cell As Range Set arr = CreateObject(“System.Collections.ArrayList”) ‘ Initialise the ArrayList, for instance by taking values from a range: For Each cell In Range(“A1:F1”) arr.Add cell.Value Next arr.Sort ‘ Optionally reverse the order arr.Reverse This uses Quick Sort.
Try this: arr3 = Split(Join(arr1, “,”) & “,” & Join(arr2, “,”), “,”)