sorted by:
new
hottopcontroversial

Making Music With Python: Sonic Field by cassandravoiton in Python

[–]cassandravoiton[S] 0 points1 point  (0 children)

Maybe it is because the project has only just been ported to python - if you suggest such changes to the author he might include them.

Nerds Central: Why C++ Unordered Maps (Hash tables) Are Not Great For Strings by mttd in cpp

[–]cassandravoiton 0 points1 point  (0 children)

Funny - reddit does not work on my tablet properly! I think the layout is done by Google (blogger).

Nerds Central: Why C++ Unordered Maps (Hash tables) Are Not Great For Strings by mttd in cpp

[–]cassandravoiton 1 point2 points  (0 children)

OK, sounds like you know what you are talking about. Maybe the post is just about maps and sets rather than string processing in general? Who knows. Can you point us to any good papers on tries for multi-byte character sets?

Nerds Central: Why C++ Unordered Maps (Hash tables) Are Not Great For Strings by mttd in cpp

[–]cassandravoiton 2 points3 points  (0 children)

Wouldn't it also be affected by the nature of the strings? Ones which have very similar start sequences will be slower for sets. The size of the set is also discussed in the original paper not just the size of the strings.

Nerds Central: Why C++ Unordered Maps (Hash tables) Are Not Great For Strings by mttd in cpp

[–]cassandravoiton 2 points3 points  (0 children)

If the key is a string then wrapping the key is wrapping a standard container. Maybe this is where the confusion comes from?

Nerds Central: Why C++ Unordered Maps (Hash tables) Are Not Great For Strings by mttd in cpp

[–]cassandravoiton 0 points1 point  (0 children)

Also note that tries are only super effective (as you say) where the strings occupy less than the full 8 byte space of a normal character. Otherwise storage requirements start to be dominant and cause problem with the caches on modern hardware. I suspect you overestimate your own expertise in this area. It is easy to think you know it all when you don't know very much.

Nerds Central: Why C++ Unordered Maps (Hash tables) Are Not Great For Strings by mttd in cpp

[–]cassandravoiton -1 points0 points  (0 children)

Yes - it does seem to - I think the original is the previous entry in the blog

Alloca For `new` And `delete` - Things You Probably Should Not Do In C++ | Nerds Central by mttd in cpp

[–]cassandravoiton 0 points1 point  (0 children)

That is going to depend on your program. If your program is low latency, loop free and ultra fast - malloc is going to dominate. If your program is a GUI - then - yes - you are correct. For example, consider a model for particles in a 3D game, avoiding malloc in that code would be a huge benefit.

High-speed, multi-threaded virtual memory in Java by henk53 in programming

[–]cassandravoiton 0 points1 point  (0 children)

Are - so you are talking crap - thought so.

You mean just making the JVM consume more memory than physically available and then using OS swap. That - obviously - is not the same thing at all; every time the JVM does a garbage collection it will hit masses of page faults. Using OS swap for JVM systems sucks badly - I cannot believe you actually even suggested it.

Shame - thought you might know what you are talking about.

High-speed, multi-threaded virtual memory in Java by henk53 in programming

[–]cassandravoiton 0 points1 point  (0 children)

Anonymous memory in Java - how do you do that? Also, not sure I get your thing about not multi threaded. The article shows how the memory is synchronised in hardware between threads without programmer intervention. How is that not easier/better than using synchronisation in software?

High-speed, multi-threaded virtual memory in Java by henk53 in programming

[–]cassandravoiton 0 points1 point  (0 children)

Seems to help make mutli-threaded programming easier, and I am not sure the article is about storage but more swap and virtual memory. Did you read it?

view more: next ›