HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
SiegeLord
RustAlgebloat
Rust2016–2016
SiegeLord / RustAlgebloat

RustAlgebloat

A Rust linear algebra library based on expression templates

2Distinct people
3Mentions
0Explicit recommenders
52GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A Rust linear algebra library based on expression templates

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 5:58:53 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by hour3 dated mentions

Observed mentions: 2016-12-21 22:48:17 UTC to 2016-12-22 11:37:38 UTC.

012016-12-21 22:00:00 UTC to 2016-12-21 23:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsDec 21, 22:002016-12-21 23:00:00 UTC to 2016-12-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 00:00:00 UTC to 2016-12-22 01:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2016-12-22 01:00:00 UTC to 2016-12-22 02:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 02:00:00 UTC to 2016-12-22 03:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 03:00:00 UTC to 2016-12-22 04:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 04:00:00 UTC to 2016-12-22 05:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsDec 22, 04:002016-12-22 05:00:00 UTC to 2016-12-22 06:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 06:00:00 UTC to 2016-12-22 07:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 07:00:00 UTC to 2016-12-22 08:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 08:00:00 UTC to 2016-12-22 09:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 09:00:00 UTC to 2016-12-22 10:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 10:00:00 UTC to 2016-12-22 11:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2016-12-22 11:00:00 UTC to 2016-12-22 12:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsDec 22, 11:00

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Dec 21, 22:002016-12-21 22:00:00 UTC2016-12-21 23:00:00 UTC101
Dec 21, 23:002016-12-21 23:00:00 UTC2016-12-22 00:00:00 UTC000
Dec 22, 00:002016-12-22 00:00:00 UTC2016-12-22 01:00:00 UTC101
Dec 22, 01:002016-12-22 01:00:00 UTC2016-12-22 02:00:00 UTC000
Dec 22, 02:002016-12-22 02:00:00 UTC2016-12-22 03:00:00 UTC000
Dec 22, 03:002016-12-22 03:00:00 UTC2016-12-22 04:00:00 UTC000
Dec 22, 04:002016-12-22 04:00:00 UTC2016-12-22 05:00:00 UTC000
Dec 22, 05:002016-12-22 05:00:00 UTC2016-12-22 06:00:00 UTC000
Dec 22, 06:002016-12-22 06:00:00 UTC2016-12-22 07:00:00 UTC000
Dec 22, 07:002016-12-22 07:00:00 UTC2016-12-22 08:00:00 UTC000
Dec 22, 08:002016-12-22 08:00:00 UTC2016-12-22 09:00:00 UTC000
Dec 22, 09:002016-12-22 09:00:00 UTC2016-12-22 10:00:00 UTC000
Dec 22, 10:002016-12-22 10:00:00 UTC2016-12-22 11:00:00 UTC000
Dec 22, 11:002016-12-22 11:00:00 UTC2016-12-22 12:00:00 UTC101

What Hacker News says

1 sources
LICM is very relevant: it allows hoisting various dimensions of the check up to the loop with the relevant induction variable, meaning LLVM only has to handle things of the pattern: for i in 0..X { if !(i < X) { panic!() } ... } It is capable of doing this with the various induction variable passes it has, showing that i < X is always true. There's also the IRCE (inductive range check elimination) [0] pass—which isn't listed in that document—that should help even more, if/when it is enabled. Hopefully you agree at this point that LLVM is perfectly capable of handling multidimensional arrays and matrices even if it doesn't have optimisation passes with names that obviously apply to them specifically. Most of the optimisations you keep talking about are basic consequences of other standard passes, a fact that has been pointed o
Read the rest
ut many times to you before. > Consider a matrix multiply, the most common operation in number-crunching Also an operation you won't be implementing manually if you actually care about performance (better implementation: call a BLAS library). And, any high performance implementation will be doing more than the naive triple-nested loop (blocking, SIMD, etc.). Focusing on this operation is somewhat missing the forest for the trees. > You're indexing through three 2D matrices along both axes. The indices are usually controlled by FOR statements, so the compiler knows the range the indices can take. Yes exactly, the compiler knows the range of the indices. > If the compiler knows about multidimensional arrays, it's easy to make those checks once at FOR loop entry. This is a non-sequitur: the compiler can still make/move the checks based on what the code looks like, without having to have a hardcoded concept of arrays. Ensuring optimisation passes are powerful enough to handle these sort of relatively straight-forward cases is more general than relying on a language-level concept of multidimensional arrays, as it allows them to apply to cases which can't quite be implemented with an array directly. > Although technically you could generate a special case This is exactly what compilers do, see the IRCE documentation. > The compiler can't optimize it that aggressively and fail early It certainly can: these sort of assertions shouldn't ever trigger, and with appropriate top level assertions (e.g. asserting that the dimensions of the incoming matrices work for multiplication) the compiler can easily see this. Also, the compiler can hoist assertions early if this cannot be observed externally, e.g. the loop kernel only mutates locals. > If all those optimizations really exist, why is there code like this (at https://github.com/SiegeLord/RustAlgebloat/blob/master/algeb...)? That code is almost 2 years old, and so the compiler will have improved since then. Of course, the compiler may not have improved enough (e.g. IRCE still may not be enabled). Additionally, there's a lot of uncertainity/lack of clarity (as demonstrated by your own comments) about exactly what the compiler can do, and so people may use `unsafe` unnecessarily. I've certainly been guilty of this myself, and been glad when people have pushed back in code-review, making me work a bit harder to get equal (or better) performance in safe code. [0]: http://llvm.org/docs/doxygen/html/InductiveRangeCheckElimina...
In Four years with Rust

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.