bimap

问题 At the beginning I needed a map, so I used std::map. Then, some requirements were added and I needed to also get "keys" for "value" (foos for bar), so I used boost::bimaps::bimap< boost::bimaps::unordered_set_of<boost::bimaps::tagged<std::string, foo>>, boost::bimaps::multiset_of<boost::bimaps::tagged<std::string, bar>>> And after that, some more requirements were added, so now I need to store a number for every foo and from the right side view I need to be able to call <bimap>.righ.find(bar)

问题 I wanted to use a multimap version of a boost::bimap and I am following this, Boost::Bimap equivalent of bidirectional multimap This shows how to add and retrieve values in the structure. I am trying to look up based on a value on the right that maps to multiple values on the left, and if found, I would like to add to the list on the left. For example, assume, this is the bimap, value_type(1, 1) value_type(10, 50) value_type(1, 2) value_type(9, 15) and when you do a bimap.left.equal_range(1);

问题 I wanted to use a multimap version of a boost::bimap and I am following this, Boost::Bimap equivalent of bidirectional multimap This shows how to add and retrieve values in the structure. I am trying to look up based on a value on the right that maps to multiple values on the left, and if found, I would like to add to the list on the left. For example, assume, this is the bimap, value_type(1, 1) value_type(10, 50) value_type(1, 2) value_type(9, 15) and when you do a bimap.left.equal_range(1);

问题 First part of the question is that I am trying to use boost::bimap, but from the documentation it is unclear to me how to define a bidirectional multimap. The second part of the question is that I need it to be a map in one direction and a multimap in the other direction, can this be done using boost::bimap ? Has anyone experience of this or can point me to the correct page ? 回答1: All is in documentation... http://www.boost.org/doc/libs/1_51_0/libs/bimap/doc/html/boost_bimap/the_tutorial

问题 I implemented custom ShowCase for activity I am trying to draw on canvas mask: http://i.stack.imgur.com/u23kQ.png Following this code: mCanvas.drawColor(Color.TRANSPARENT, PorterDuff.Mode.CLEAR); // draw solid background mCanvas.drawColor(mMaskColour); // Prepare eraser Paint if needed if (mEraser == null) { mEraser = new Paint(); mEraser.setColor(0xFFFFFFFF); mEraser.setXfermode(new PorterDuffXfermode(PorterDuff.Mode.CLEAR)); mEraser.setFlags(Paint.ANTI_ALIAS_FLAG); } // draw (erase) shape /

问题 Short question: Can I typedef a variadic argument pack? I need template <typename ...T> struct Forward { typedef T... args; }; . Long version: I was thinking about reimplementing the excellent boost bimap in C++0x. Recall that a bimap of two types S and T is a std::set of relations between S x and T y . The objects themselves are stored in two independent internal containers, and the relations track the associated iterators I suppose; both types can serve as keys via "left" and "right" lookup

问题 Since I need to get the key values of double value I' m using BiMap . BiMap<String,Double>mapObj = HashBiMap.create(); mapObj.put("a1",3.58654); mapObj.put("a2",4.1567); mapObj.put("a3",4.2546); For a particular value like 4.0156 I must get the key value a2.. that is if, Double value=4.0156; mapObj.inverse().get(value)=a2 I tried many ways but its getting always null, since there is no exact match. please anyone help me... if I have chosen a wrong way please correct it because I'm new in Java

问题 I have a problem with compiling boost.bimap library. My test program is a blank main function and only one include directive(like #include <boost/bimap.hpp> ). After some investigations I found out that preprocessor had made some interesting constructions from header file like: struct A { struct B{}; struct B; }; I don't know if this is correct or not, but gcc accepts it while clang and icc don't. Who is right and what can I do to compile programs with bimap library? Unfortunately, I can't

问题 I have the following code: wxString getColorName(const wxColour& color) { typedef ColorComboBox::ColorMap::right_const_iterator ConstColorIterator; ColorComboBox::ColorMap colorMap = ColorComboBox::getDefaultChoices(); ConstColorIterator it = colorMap.right.find(color); return it != colorMap.right.end() ? it->second : ColorComboBox::CUSTOM_COLOR; } where ColorMap is defined typedef boost::bimaps::bimap \ <wxString, boost::bimaps::vector_of<wxColour> > \ ColorMap; and I keep getting a long

问题 I am using quite a few containers of the form boost::bimap<boost::bimaps::multiset_of<std::string>, boost::bimaps::set_of<AnEnum> > I am defining them in a header file that is included in quite a few cpp files (This is after I limited the exposure of the header file as much as possible). The .a files being created in the debug build runs to above 1 GB (resulting in compilation stopping midway due to 'no space on device' error and naturally the compile time has increased exponentially. The