geni-performance-benchmark
StarWarsArrays.jl
geni-performance-benchmark | StarWarsArrays.jl | |
---|---|---|
3 | 10 | |
27 | 122 | |
- | - | |
4.1 | 0.0 | |
over 3 years ago | almost 2 years ago | |
Clojure | Julia | |
Apache License 2.0 | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
geni-performance-benchmark
-
PyTorch: Where we are headed and why it looks a lot like Julia (but not exactly)
Clojure has a high performance data frame library that leverages new JVM vector API and high quality apache arrow protocol.
Talk related - https://youtu.be/5mUGu4RlwKE
https://github.com/zero-one-group/geni-performance-benchmark
- LLVM!
-
Clojure High Performance Data Processing System
How often have you seen a Clojure system that soundly beats C, Julia, Python, Spark, and R systems in a data processing benchmark?
StarWarsArrays.jl
- Star Wars Arrays
- It starts at 0 right?
-
PyCharm is the worst IDE I have used. /s
I raise you https://github.com/giordano/StarWarsArrays.jl
-
How do some of my coworkers still use ML
Why not Star Wars Indices (4,5,6,1,2,3,7,8,9...)? https://github.com/giordano/StarWarsArrays.jl
-
Dealing with strings in Julia, patterns and anti-patterns
> 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.
-
The counter-intuitive rise of Python in scientific computing
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.
-
PyTorch: Where we are headed and why it looks a lot like Julia (but not exactly)
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
-
Arrays start from bony[1]
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.
-
Why does Julia adopt 1-based index?
Adding https://github.com/giordano/StarWarsArrays.jl to the list for some extra spice
-
some may hate it, some may love it
You should also check out https://github.com/giordano/StarWarsArrays.jl and https://github.com/giordano/RandomBasedArrays.jl
What are some alternatives?
jax - Composable transformations of Python+NumPy programs: differentiate, vectorize, JIT to GPU/TPU, and more
OffsetArrays.jl - Fortran-like arrays with arbitrary, zero or negative starting indices.
HTTP.jl - HTTP for Julia
TailRec.jl - A tail recursion optimization macro for julia.
tablecloth - Dataset manipulation library built on the top of tech.ml.dataset
TwoBasedIndexing.jl - Two-based indexing
tech.ml.dataset - A Clojure high performance data processing system
Cython - The most widely used Python to C compiler
functorch - functorch is JAX-like composable function transforms for PyTorch.
wenyan - 文言文編程語言 A programming language for the ancient Chinese.
BinaryBuilder.jl - Binary Dependency Builder for Julia