StarWarsArrays.jl VS adaptrapezoid_benchmark

I raise you https://github.com/giordano/StarWarsArrays.jl

Why not Star Wars Indices (4,5,6,1,2,3,7,8,9...)? https://github.com/giordano/StarWarsArrays.jl

> The documentation disagrees about string indices not starting with 1 As priorly said, I'm speaking about strings, not `String` in particular. So, to write code which work for all AbstractString (which have basic string functions), you must not assume that the first indexing is 1, you can have degenerate cases such as : https://github.com/giordano/StarWarsArrays.jl (this is for vectors, but creating a similar type, for AbstractString isn't impossible) or just strings with an offset indexing.

There are other choices like https://github.com/simonster/TwoBasedIndexing.jl and https://github.com/giordano/StarWarsArrays.jl if you do not like 1-based indexing.

This is a total non issue as indexing is an operation that is subject to multiple dispatch. For a humorous example see https://github.com/giordano/StarWarsArrays.jl

The cool thing with Julia is that array indices aren't inherent properties, and may be changed locally by using appropriate wrappers. This means that the same underlying array may start at 0 in one part of the code, at 1 in another, and perhaps use the star-wars indexing in yet another section if that's necessary.

Adding https://github.com/giordano/StarWarsArrays.jl to the list for some extra spice

You should also check out https://github.com/giordano/StarWarsArrays.jl and https://github.com/giordano/RandomBasedArrays.jl

Julia is C speed if you write optimised code https://github.com/astrojhgu/adaptrapezoid_benchmark/blob/master/Result.md notice that Julia is faster than C++ and rust here and is the only thing close to C. MATLAB doesn't come close to this as it is interpreted it would be orders of magnitude slower.