chaotic-good

15 ms·

91.
Show HN: Compressed N-gram index for golang(github.com)
4 points by chaotic-good 12y ago|0 comments
92.
by chaotic-good 12y ago
> What is unsafe about using atomic reference counting? Nothing at all. But sharing objects between threads is unsafe. > Like having a VM implemented in C defeats the purpose of the VM for that language being safe. You can prove that
93.
by chaotic-good 12y ago
> This is also false. If you get memory unsafety outside of an `unsafe` block, it is a by definition a bug in the compiler. All `unsafe` memory access in Rust performed in separate address space? I'm asking because if it isn't
94.
by chaotic-good 12y ago
It is common to use ARC and unsafe shared memory access in Rust. This defeats the purpose of this complexity. You can't isolate unsafe memory access. You rather write only memory safe code or end up with fully unsafe codebase where som
95.
by chaotic-good 12y ago
It's too complex, we're already have C++.
96.
Ask HN: Is there any demand on time-series data mining?
3 points by chaotic-good 12y ago|1 comments
97.
by chaotic-good 12y ago
Offtopic: I have a problem using fbthrift and cpp2 server together. I'm find that there is two IDL to C++ compilers that I need to use - one old thrift compiler written in C++ and the new one written in python. Code generated by both t
98.
by chaotic-good 12y ago
Faster sequential writes. No compaction step needed. Constant amount of disk space is used.
99.
by chaotic-good 12y ago
Yes, it will be equivalent to db table indexed by timestamp. All data will be scanned but 86400000 values can be scanned in 10 seconds or so. In future I'm planing to implement some indexing based on bloom filters to speedup this. Now
100.
by chaotic-good 12y ago
It's not deployed into production yet. What figures do you interested in?
101.
Show HN: Akumuli – time-series database(github.com)
12 points by chaotic-good 12y ago|7 comments
102.
by chaotic-good 12y ago
The most important rule of sail trim is to avoid turbulence on either side, __especially__ the leeward side. Laminar flow on the leeward side means the sail is deflecting air on that side as well, generating a "pull" in addition
103.
by chaotic-good 12y ago
Good generational GC doesn't need to deallocate objects one by one, instead of that it can deallocate objects in bulk (if there is no finalizers). It can allocate memory faster because it doesn't need to use memory allocator to cr
104.
by chaotic-good 12y ago
In Rust, unlike in garbage collected languages, you never1 explicitly close or release resources like files, sockets and locks GC languages is trying to emulate machine with infinite memory so you don't need to bother yourself with _
105.
by chaotic-good 12y ago
This is translation from Russian. Original article is here: http://habrahabr.ru/company/ifree/blog/195948/
106.
by chaotic-good 12y ago
> Hmm. Given that you accused the author of making biased comparisons, I would expect some more detailed information there. "Faster" doing what? Assembly is faster, Go isn't. Ok, let's use assembly then. This makes bi
107.
by chaotic-good 13y ago
https://github.com/Lazin/Akumuli - embedded time-series database. I'm trying to achieve very high write throughput - about 1M updates per second. The key idea here is to store data in large sorted files and search
108.
by chaotic-good 13y ago
Since import statements do not allow you to specify versions, you have to keep track of which commits of a particular project you trust. I am pretty sure that this problem will be solved, but it currently isn't. Go forces everybody t