I have to note ocaml-bitmatch/bitstring. Example code: https://bitstring.software/documentation/#matching-bitstring... This was extremely convenient for me in the past.
TL;DR: use probabilistic logging (x% chance of logging, with x chosen by dev for each log statement) instead of importance levels (ERROR, WARN, INFO, etc) to keep common events from flooding log files. Is that it? edit:…
This is correct; OCaml integers are tagged with their LSB being 1 to indicate they're not a pointer. This means that the integer n is stored as 2n+1, and adding 1 requires modifying the stored value by 2.
> When using a signed integer variable to represent an index, there is an entire range of negative numbers that are not useful at all. Let's make use of them, then. If you have "local variable" with more bits than log(#…
I kind of wish this article had gotten into some details of how various compilers implement std::function; while it was nice to see some details of clang++'s 32-byte size of all std::function to remove the need for…
To depend on compiler flags, I do this: ## compiler_flags file keeps a copy of the compile flags $(builddir)/compiler_flags: force mkdir -p $(builddir) echo '$(CPPFLAGS) $(CFLAGS)' | cmp -s - $@ || echo '$(CPPFLAGS)…
The most succinct informal description I have for NP-complete problems is lack of optimal substructure; that is, given a solution to part of the problem, it's possible for that to not help at all for solving the whole…
> Given any two cities, a and b out of N, we do not know which one is visited first in the shortest path, and we certainly don't know what a's successor will be in the solution. Even verifying a solution to the problem…
I found the redundancy of having the same number stored on both also unnecessary, and a scheme that just reorganized where the bracelets are seems better. The "friendship" component of having identical bracelets is…
NetSpeed Systems (http://www.netspeedsystems.com) | Full-time | ONSITE | San Jose, CA We build software that designs and simulates Network on Chip interconnects along with the hardware to implement that interconnect in…
It seems clear that they used the word "integer" to clarify that only whole number multiples were allowed, and not 1.5, 2.7, etc. As to whether 1 is allowed, that's not determined one way or the other by the use of the…
This is quite exaggerated; looking at the actual document [1], it's clear that they're claiming that in the context of the specification, "integer multiple of transmission time interval" doesn't include negative…
The suggestion at the end to use zip compression to protect your files seems funny; when we're talking about extremely rare errors, CRC32 seems insufficient to really protect.
My first thought along these lines is to also dump a whitened version of the provided entropy that might be more useful than the raw bits.
I see a problem with code syntax highlighting on slide 13; anyone else?
VGA ports are too tall to fit in ultra-slim laptops. RJ45 is a bit smaller, but must also be sacrificed for slimness.
A very nice video, except the particular passage referred to has the clause "designed for..., has only limited purpose or use other than, or is marketed for..." violating various laws. I don't think any of his examples…
Unison anyone? http://www.cis.upenn.edu/~bcpierce/unison/
1) Strict yet expressive typing. Find errors at compile time rather than runtime, while still allowing a very flexible set of values to be described. (tuples, sets, lists, hashtables, maps, arrays, records, objects,…
> - Use std::vector instead of C Array What about std::array?
Granted. But in either case, there's no proof - only a probability that you haven't reached an incorrect conclusion. I associate the concept of proof with logical certainty, and no statistical method will give you that.
I have a problem with the idea behind this - there's no proof that the coin is biased; even flipping it a hundred times and getting the same result is possible with an unbiased coin. All that statistics gives you is the…
3678 packets / 2.5 hours = One packet every 2.44 seconds * 1500 byte MTU = 3.5KB/s Yup, a 4800 baud modem.
The entire point of this system is to produce a voting system that does not discourage people voting per their conscience. All deterministic systems so far have flaws that encourage people to vote "strategically" to…
Article Text: In part 1 of this series, I described how to find the closest match in a dictionary of words using a Trie. Such searches are useful because users often mistype queries. But tries can take a lot of memory…
I have to note ocaml-bitmatch/bitstring. Example code: https://bitstring.software/documentation/#matching-bitstring... This was extremely convenient for me in the past.
TL;DR: use probabilistic logging (x% chance of logging, with x chosen by dev for each log statement) instead of importance levels (ERROR, WARN, INFO, etc) to keep common events from flooding log files. Is that it? edit:…
This is correct; OCaml integers are tagged with their LSB being 1 to indicate they're not a pointer. This means that the integer n is stored as 2n+1, and adding 1 requires modifying the stored value by 2.
> When using a signed integer variable to represent an index, there is an entire range of negative numbers that are not useful at all. Let's make use of them, then. If you have "local variable" with more bits than log(#…
I kind of wish this article had gotten into some details of how various compilers implement std::function; while it was nice to see some details of clang++'s 32-byte size of all std::function to remove the need for…
To depend on compiler flags, I do this: ## compiler_flags file keeps a copy of the compile flags $(builddir)/compiler_flags: force mkdir -p $(builddir) echo '$(CPPFLAGS) $(CFLAGS)' | cmp -s - $@ || echo '$(CPPFLAGS)…
The most succinct informal description I have for NP-complete problems is lack of optimal substructure; that is, given a solution to part of the problem, it's possible for that to not help at all for solving the whole…
> Given any two cities, a and b out of N, we do not know which one is visited first in the shortest path, and we certainly don't know what a's successor will be in the solution. Even verifying a solution to the problem…
I found the redundancy of having the same number stored on both also unnecessary, and a scheme that just reorganized where the bracelets are seems better. The "friendship" component of having identical bracelets is…
NetSpeed Systems (http://www.netspeedsystems.com) | Full-time | ONSITE | San Jose, CA We build software that designs and simulates Network on Chip interconnects along with the hardware to implement that interconnect in…
It seems clear that they used the word "integer" to clarify that only whole number multiples were allowed, and not 1.5, 2.7, etc. As to whether 1 is allowed, that's not determined one way or the other by the use of the…
This is quite exaggerated; looking at the actual document [1], it's clear that they're claiming that in the context of the specification, "integer multiple of transmission time interval" doesn't include negative…
The suggestion at the end to use zip compression to protect your files seems funny; when we're talking about extremely rare errors, CRC32 seems insufficient to really protect.
My first thought along these lines is to also dump a whitened version of the provided entropy that might be more useful than the raw bits.
I see a problem with code syntax highlighting on slide 13; anyone else?
VGA ports are too tall to fit in ultra-slim laptops. RJ45 is a bit smaller, but must also be sacrificed for slimness.
A very nice video, except the particular passage referred to has the clause "designed for..., has only limited purpose or use other than, or is marketed for..." violating various laws. I don't think any of his examples…
Unison anyone? http://www.cis.upenn.edu/~bcpierce/unison/
1) Strict yet expressive typing. Find errors at compile time rather than runtime, while still allowing a very flexible set of values to be described. (tuples, sets, lists, hashtables, maps, arrays, records, objects,…
> - Use std::vector instead of C Array What about std::array?
Granted. But in either case, there's no proof - only a probability that you haven't reached an incorrect conclusion. I associate the concept of proof with logical certainty, and no statistical method will give you that.
I have a problem with the idea behind this - there's no proof that the coin is biased; even flipping it a hundred times and getting the same result is possible with an unbiased coin. All that statistics gives you is the…
3678 packets / 2.5 hours = One packet every 2.44 seconds * 1500 byte MTU = 3.5KB/s Yup, a 4800 baud modem.
The entire point of this system is to produce a voting system that does not discourage people voting per their conscience. All deterministic systems so far have flaws that encourage people to vote "strategically" to…
Article Text: In part 1 of this series, I described how to find the closest match in a dictionary of words using a Trie. Such searches are useful because users often mistype queries. But tries can take a lot of memory…