madmax96

17 ms·

91.
by madmax96 7y ago
Simple solution, use multistage builds. In your `debug` build, include a debugger. Use this to debug. In your `release` build, just include the app and its dependencies. Use this in prod.
92.
by madmax96 7y ago
Measure the complexity of a language as the number of axioms required to define it. In reality, the C standard is incredibly brief, defining the core language in ~150 pages. This makes C simpler than languages like C++ and Java and the defi
93.
by madmax96 7y ago
Make a list of papers that you find interesting and find out where they are published. Chances are, the venues that publish things you find interesting publish other work you'll like too. For instance: USENIX ATC, USENIX Security, OSDI
94.
by madmax96 7y ago
It is comparatively easier to reason about C than other languages that are as useful (meaning the number and quality of libraries, portability) as C.
95.
by madmax96 7y ago
OCaml: https://godbolt.org/z/8bWDXy C: https://godbolt.org/z/WAjsvk I've never actually looked at the output of an OCaml compiler, I have to say I'm surprised by how clean it is. But I w
96.
by madmax96 7y ago
>- casting away types unsafely is required for many common patterns in C, including any form of runtime polymorphism Which patterns? I'm thinking of stuff like the Berkeley Sockets API, which you can absolutely implement safely. re
97.
by madmax96 7y ago
Why is cloning rather than moving the wrong default?
98.
by madmax96 7y ago
How is strict aliasing magic? How could you possibly define the meaning of accessing an object through an incompatible type since the type of an object determines how the compiler interprets its value? The bits stored in the object do not e
99.
by madmax96 7y ago
Rust is not a drop-in replacement for C, it’s a drop-in replacement for C++.
100.
Efficient Scalable Thread-Safety-Violation Detection [pdf](microsoft.com)
1 points by madmax96 7y ago|0 comments
101.
by madmax96 7y ago
The C behavior in this case isn't undefined, unless you go out of your way to violate aliasing rules or something -- but that's a far reach from what parent was saying.
102.
by madmax96 7y ago
> Yeah, until the compiler figures out it's really not a size_t and that it's free to do whatever it likes to your operation. That's not true. Being gracious, parent was saying that if you treat another scalar type as a s
103.
by madmax96 7y ago
> the fact that K&R didn't specify the size of an int or long complicated matter I disagree. I'm glad they didn't -- we may have been stuck with 2 byte ints and 4 byte longs! To quote the standard: > A "plain&q
104.
by madmax96 7y ago
>so it is advised to use pointers to objects on the stack sparingly At least in the C/C++ world, this is not true. Where possible, we prefer stack allocated objects. Stack allocation is fast and usually gives you better cache perf
105.
by madmax96 7y ago
I wonder what autopilot this uses? One of the open source ones or a custom implementation?
106.
by madmax96 7y ago
Does it take O(n) time to manufacture computer memory? I don’t know, but it doesn’t affect the runtime of algorithms.
107.
by madmax96 7y ago
You can replace the hand with any device that holds the spaghetti. This really is an O(n) algorithm. Spaghetti sort seems to be an analogue variant of radix sort.
108.
by madmax96 7y ago
Would you happen to have a link to some sources describing some of these issues?
109.
by madmax96 7y ago
>If everyone followed Public Health England’s eating advice, people in the bottom decile of household income would spend 74 per cent of their income on food I find this very interesting. I'm a graduate student in Midwest of the US.
110.
by madmax96 7y ago
Perhaps you should consider removing the statement "Cicada will only be a "subset" of bash" from the project FAQ.
111.
by madmax96 7y ago
cicada> echo -e '#!/bin/sh\necho works' > /bin/1 cicada> chmod +x /bin/1 cicada> 1 1 bash> 1 works cicada> touch a b; echo "$(echo "$(echo "$(ls)&qu
112.
by madmax96 7y ago
I think that parent was trying to state that maintaining sequential consistency is a bottleneck for traditional databases.
113.
by madmax96 7y ago
Even with that strategy you need N messages. With 64 bits per clock component you can record a billion events per second (literally) for a very long time (as in billions of seconds) before needing to coordinate a clock reset. With 20,000 no
114.
by madmax96 7y ago
I'd love to see some experimentation with this. Nice work, thanks for sharing :)
115.
by madmax96 7y ago
Hi! My concern is: >Each time a node has an internal event, it hashes that event with k hash functions and increments its bloom filter. It then sends that bloom filter to all other nodes. I would suspect that the cost of broadcasting the
116.
by madmax96 7y ago
>I would define power as the ability to make other people do what you want I don't think anyone agrees or uses the word 'power' that way, instead, power ought to be defined as: >the ability to do something or act in a p
117.
by madmax96 7y ago
"arithmetic has existed for quite a while...what's the novelty Of Mr. Newton's integral? Mathematics research is irrelevant."
118.
by madmax96 7y ago
You should check out SBCL, it's competitive.
119.
by madmax96 8y ago
Consider how widely affected contemporary machine learning models are by adversarial examples [1]. I don't know the specific approach used by Tesla or their release process, but I would not be surprised at all if their software has sim
120.
by madmax96 8y ago
>they also demonstrate solutions that are now possible thanks to Rust This seems specious. If I started a grep implementation from scratch in C{,++}, it isn't clear to me that I couldn't achieve the same (or better) results

More ›