findlay

Hello, Is there any way to access a large number of keys in a dictionary efficiently. Perhaps via indexing with an array of lookup values. Some pseudo code may help; dictionary={a:1, b:2, c:3 ...etc} lookup=[a, a, b, c, c ... etc] print dictionary[lookup] thanks, Joe

Hi all, I am trying to link to an external library (the boost regex library) under gcc. I am ashamed to admit that what I know about linking external libraries comes soley from modified snipets from online forums. My problem is as follows; I use to keep all my source …

Hi all, Can anyone point me to an efficient binning algorithm. I have a problem similar to the following: I have recorded the heights of 10000 randomly selected people and I want to sort their heights into 20 bins between 1.5 and 1.8m (ie number of bins much less than …

Hi all, I have been trying to compile some c++ using GNU make. This involves linking with a third party library and it is this that seems to have caused the problem. The error message tells me that there are undefined references in my program to one of my own …

Hello All, I am experiencing a problem with the STL map class (or rather the map class is experiencing a problem with me). I am trying to store a number of 2-dimensional vectors of type int, whose corresponding keys are strings. The problem arises when I try to index a …

Hi all, I have encountered a peculiar problem when performing some simple arithmetic in a program I am developing. As the function of the program is pretty specific to my field I have included a smaller program which illustrates the same problem without the technicalities. Given a function (in the …