ww520

26 ms·

421.
by ww520 3y ago
This is great news. This opens up other languages using Unreal Engine. This also opens up other target platforms for Unreal Engine.
422.
by ww520 3y ago
I usually make a toggle button reflects its current state and shows the next state in some other way, like in the hover over tooltip or small subscript text. That means a toggle updates two things, the button itself and the tooltip.
423.
by ww520 3y ago
I guess they want nature to take its course and to avoid impact by human.
424.
Man who shoveled new channel into Lake Michigan convicted(msn.com)
79 points by ww520 3y ago|82 comments
425.
by ww520 3y ago
One benefit I would add is that cross platform support is great for browser extensions. Browsers already run on different OS's and devices. Browser API and extension API are fairly uniform among the major browsers. It's close t
426.
by ww520 3y ago
Subnet mask style prefix construction is pretty novel.
427.
by ww520 3y ago
I believe it's quite different. If I'm not mistaken, flat_hash_map is a typical hash table, with a hash function to map the key to a bucket. Its novel part is using the 7 lower bits of the hashed value as a bit mask against the
428.
by ww520 3y ago
That just means you never have the need for implementing a querying or search functionality. Range query and search are used everywhere and need ordered maps. I'm not saying we should rush to adopt it right the way, but at least don&#
429.
by ww520 3y ago
This looks very good. The idea of using a subnet-mask style to compute the prefix of a node is pretty novel. I haven't seen anything like it. The choice of span factor of 16 is a good compromise between node size and tree depth. Th
430.
by ww520 3y ago
It's similar but not quite. IntMap in Haskell uses bit as the prefix unit with a span factor of 2. This uses nibble as the prefix unit with a span factor of 16. Also IntMap uses a bitmask for the range of prefix units in a node whil
431.
by ww520 3y ago
Oh come on. Don't be too harsh. This is an ordered map. Most of the mentioned ones are unordered maps. They might be fast but they are unordered. The only comparables are absl::btree_map and Judy Array. Without benchmarking, my g
432.
by ww520 3y ago
I would say both cases are errors in their current form. When more code is typed in, it can be parsed to validate again.
433.
by ww520 3y ago
Aliens won’t bother unless a warp drive leaves a hyper jump signature.
434.
by ww520 3y ago
One way I found helpful in giving precise parsing errors without causing excessive false errors is to have the parser auto-completing the missing tokens with placeholder error nodes. E.g. if (cond1 And ) { ... } The And operator i
435.
by ww520 3y ago
Better title - mixed case text takes up more space when compressed.
436.
by ww520 3y ago
That has the same level of validity as the jump to conclusion doormat as a product idea. Somebody should run with it.
437.
by ww520 3y ago
You know what's funny. In one of the startups, we did bring in a TV crew to shoot commercials on us working. The commercials were aired before the product was half way ready. In one of the product demos in a trade show, the CEO was
438.
by ww520 3y ago
My guess is the secrecy of the project was the main contributing factor to its failure. There were no vetting on the products, feature, design, development process, technologies, language choice, etc. Too many people read Skunk Works and
439.
by ww520 3y ago
Story time. When I was a young developer in a database company, my cubicle was next to a section where a team sat. The team consisted 30 to 40 people working on a secret project. Whenever I asked them what they were working on, they said i
440.
by ww520 3y ago
It would work if it was submitted as A binary math site - looo.lol.
441.
by ww520 3y ago
Is there any progress or news on the main memory based databases?
442.
by ww520 3y ago
The two writers will have two different new root nodes which need to be merged, and that could trigger further merging of lower level new nodes recursively. It becomes a merging of two subtrees. The subtrees can be quite different if node
443.
by ww520 3y ago
I think the main difference between Buffer Tree (Arge, Brodal and Fagerberg) and the more modern B-epsilon/Fractal/Hitchhiker Trees is what's stored in the branch buffer. Buffer Tree stores the data in the buffer. The newer
444.
by ww520 3y ago
Here're what I found on the idea of adding buffers to branch nodes. L. Arge described the Buffer Tree idea in 1995 with (a,b)-Tree for other data structures. Brodal and Fagerberg formalized it for B+Tree in 2003. There's also t
445.
by ww520 3y ago
Just tried it out. It's blazingly fast. The interactive TUI search is pretty sweet.
446.
by ww520 3y ago
If by compacting the tree you meant compacting the space left over by the users deleting the records, it's about the same amount of work between the two approaches. The WAL+btree case needs to merge the near empty pages and copy the r
447.
by ww520 3y ago
Good to know. Thanks for the explanation. Basically ZFS maintains a ZIL based in-memory tree for the recent updates and a on-disk btree for the complete updates, minus the recent updates in ZIL. That's consistent with most database tr
448.
by ww520 3y ago
LMDB is the poster child of COW btree implementation. That paper is a good find. Thanks.
449.
by ww520 3y ago
The pointer to the root tree node is stored in the last committed metadata page. A read transaction starts with the reading of the metadata page. Reaching the partial written pages is impossible as the writer has not committed the latest
450.
by ww520 3y ago
That's how the traditional transaction log + btree approach work. The append-only btree removes the need for a separate transaction log.

More ›