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, 3:59:04 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
Where does LLVM do that? LLVM does hoist of invariant code out of loops in the Loop Invariant Code Motion and Loop Strength Reduction phases.[1] But that's not enough. This isn't an invariant situation. Consider a matrix multiply, the most common operation in number-crunching. 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. If the compiler knows about multidimensional arrays, it's easy to make those checks once at FOR loop entry. But if those checks are in asserts, it's tougher. Is LLVM allowed to fail an assert early? If the array is 0..999, and the index is 0..1000, a subscript out of range condition will occur on iteration 1001. For best performance, you want to detect the subscript out of range condition at the poi
Read the rest
nt it becomes inevitable, rather than checking on every iteration and failing on iteration 1001. (Although technically you could generate a special case.) But that requires special treatment of "assert". In Rust, "assert!" is just a macro. The compiler can't optimize it that aggressively and fail early. Especially since you can now catch assertion failures during unwinding. If all those optimizations really exist, why is there code like this (at https://github.com/SiegeLord/RustAlgebloat/blob/master/algeb...)? MatrixMul<LHS, RHS> { unsafe fn raw_get(&self, r: usize, c: usize) -> f64 { let mut ret = 0.0; for z in 0..self.lhs.ncol() { ret += self.lhs.raw_get(r, z) * self.rhs.raw_get(z, c); } ret } } If what you say is true, all that unsafe stuff is unnecessary. [1] http://llvm.org/docs/Passes.html
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.