It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 12 years ago.
I'm trying to pick out my next hackery project. It'll likely be one of the following:
A sparse radix trie Implementation with extremely fast set operations
A really good soft heap implementation
A bloomier filter implementation
A collection of small financial algorithms, such as deriving total returns given a set of dividends and minimal information about them.
But I can't choose. So I thought I'd put my fate in the hands of my peers. Which of those four would you find most useful? Most interesting to work on? Which do you think is the most needed?
I didn't know what a bloomier (maybe Bloom?) filter is until reading your question. Sounds cool and useful.
Related
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
I am thinking which technology is needed for making copy of this web service: http://dziswieczorem.pl/
Does someone know any almoust-ready solution (especially for map-things) implemented in django?
Or maybe could anyone give me tips in which technology it would be easier to implement something like that?
To be more concrete:
Is there some ready template containing world map like on page that I wrote about above? I also need a chat feature.
For the map functionality, you may get some benefit from django-gmapi, but I've never tried it so I don't know if it's exactly what you want or not.
As far as chat, there seem to be a few options here that you could consider: http://www.djangopackages.com/grids/g/chat/
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
I recently got interested in lockless programming and attempted to write implement a fixed-size mostly-lockless vector (github link). While it works, I'd love to get some feedback from more experienced people if my logic looks buggy or suspicious.
Are there any standard techniques that are particularly useful when testing out lockless data structures?
std::vector is lockless. In general, any good vector implementation will be lockless, because the granularity of a vector is too low for locks to be of any use.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
How should i get it, by SVN?
Can i use Eclipse and its Subversive Team Provider add on to manage my changes?
Then if i make some changes how can i commit, who decide that my changes are friendly and good enough?
To be honest i want to try to contribute to some library, because of motivation that contribution provides me on learning C++ details.
I search and read a little about Boost, but i think it is too complicated to be a starting point.
Thus can you provide a path to start and become an open source library contributor?
Well, the very first step is to actually read the FAQ. That's always a good start.
Especially the "How can I contribute to development?" question.
http://www.boost.org/users/faq.html
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 11 years ago.
I was going through Scott Meyer's podcast on CPU CACHES AND WHY YOU CARE It seems this will make code run faster, is there any open source where such coding is done for reference.
Or anybody has example of design of data structures/algorithms based on CPU caches aware
Sure, the entire Linux kernel is implemented to be cache-aware.
For more details there is highly recommended paper What Every Programmer Should Know About Memory.
Linear algebra is sensitive to cache problems. The BLAS subroutines allow one to abstract away from these concerns
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 11 years ago.
Here's what I am trying to accomplish.
I want program1 to create a shared memory segment where I store various arrays.
Then, I want program2 to read in the arrays and modify them.
This sounds pretty simple, but for some reason, I cannot find a single example online that shows how this is done. Every example I have found uses a single program (e.g the initialize, read and write are both done by program1).
If somebody can provide an example here, I'm sure this would be hugely beneficial for pretty much everybody that wants to use IPC in C++.
Boost.Interprocess has a guide for the impatient.