search for: multimap

...::getPassRegistry()); > + } > + > + typedef std::pair<Value *, Value *> ValuePair; > + typedef std::pair<ValuePair, size_t> ValuePairWithDepth; > + typedef std::pair<ValuePair, ValuePair> VPPair; // A ValuePair pair > + typedef std::pair<std::multimap<Value *, Value *>::iterator, > + std::multimap<Value *, Value *>::iterator> VPIteratorPair; > + typedef std::pair<std::multimap<ValuePair, ValuePair>::iterator, > + std::multimap<ValuePair, ValuePair>::iterator> > +...

...; + } > > + > > + typedef std::pair<Value *, Value *> ValuePair; > > + typedef std::pair<ValuePair, size_t> ValuePairWithDepth; > > + typedef std::pair<ValuePair, ValuePair> VPPair; // A ValuePair pair > > + typedef std::pair<std::multimap<Value *, Value *>::iterator, > > + std::multimap<Value *, Value *>::iterator> VPIteratorPair; > > + typedef std::pair<std::multimap<ValuePair, ValuePair>::iterator, > > + std::multimap<ValuePair, ValuePair>::iterator>...

On Mon, 2011-11-21 at 21:22 -0600, Hal Finkel wrote: > On Mon, 2011-11-21 at 11:55 -0600, Hal Finkel wrote: > > Tobias, > > > > I've attached an updated patch. It contains a few bug fixes and many > > (refactoring and coding-convention) changes inspired by your comments. > > > > I'm currently trying to fix the bug responsible for causing a compile

...ion (In case it is known to be useful in general). > +++ b/lib/Transforms/Vectorize/BBVectorize.cpp > @@ -0,0 +1,1338 @@ > + typedef std::pair<Value *, Value *> value_pair; > + typedef std::pair<value_pair, value_pair> vp_pair; > + typedef std::pair<std::multimap<Value *, Value *>::iterator, > + std::multimap<Value *, Value *>::iterator> vp_iterator_pair; > + typedef std::pair<std::multimap<value_pair, value_pair>::iterator, > + std::multimap<value_pair, value_pair>::iterator> > +...

...te pair. So if every instruction has U uses, then this has complexity O(N^2 U^2). In practice, U is small, and so this is just another O(N^2). Unfortunately, that is only true if determining if a given use pair is also a candidate pair is sub-linear. It is not in this case (it is linear because the multimap only indexes the first key, not both), but that could be changed by using a different (or additional) data structure to hold the candidate pairs. I should probably add a candidate-pair DenseSet to clean this up, then it will be O(N^2) [note that if an instruction has many uses, then it cannot be in...

On Mon, 2011-11-21 at 11:55 -0600, Hal Finkel wrote: > Tobias, > > I've attached an updated patch. It contains a few bug fixes and many > (refactoring and coding-convention) changes inspired by your comments. > > I'm currently trying to fix the bug responsible for causing a compile > failure when compiling >

...n general). > > > > +++ b/lib/Transforms/Vectorize/BBVectorize.cpp > > @@ -0,0 +1,1338 @@ > > > + typedef std::pair<Value *, Value *> value_pair; > > + typedef std::pair<value_pair, value_pair> vp_pair; > > + typedef std::pair<std::multimap<Value *, Value *>::iterator, > > + std::multimap<Value *, Value *>::iterator> vp_iterator_pair; > > + typedef std::pair<std::multimap<value_pair, value_pair>::iterator, > > + std::multimap<value_pair, value_pair>::iterato...

Tobias, et al., Attached is the my autovectorization pass. I've fixed a bug that appears when using -bb-vectorize-aligned-only, fixed some 80-col violations, etc., and at least on x86_64, all test cases pass except for a few; and all of these failures look like instruction-selection bugs. For example: MultiSource/Applications/ClamAV - fails to compile shared_sha256.c with an error: error in

Tobias, I've attached the latest version of my autovectorization patch. I was able to add support for using the ScalarEvolution analysis for load/store pairing (thanks for your help!). This led to a modest performance increase and a modest compile-time increase. This version also has a cutoff as you suggested (although the default value is set high (4000 instructions between pairs) because

Any reason why there''s no closeBubble function in Mapstraction? It''s supported by at least Yahoo (closeSmartWindow) and Google (closeInfoWindow). A related issue, but not as clear-cut: a bubble closed event. I know Google supports this, but I haven''t investigated further. --Adam

...ile,attempts[0],resamples[0],conf[0]); if(ret == 0) Rprintf("cluster map has been written to %s\n", file[0]); R_FlushConsole(); R_ProcessEvents(); return; // Return Nothing. } } extern "C" { void findConfCoreWrapper(SEXP gdiag, SEXP bootClusters, SEXP membership, SEXP conf) { multimap<double,treeNode,greater<double> > treeMap; multimap<double,treeNode,greater<double> >::iterator it_tM; int l =LENGTH(membership); //Rprintf("beleptunk"); int p = 0; map<int,int> degrees; for(int i=0;i < l;i++){ SEXP members = VECTOR_ELT(mem...

...ile,attempts[0],resamples[0],conf[0]); if(ret == 0) Rprintf("cluster map has been written to %s\n", file[0]); R_FlushConsole(); R_ProcessEvents(); return; // Return Nothing. } } extern "C" { void findConfCoreWrapper(SEXP gdiag, SEXP bootClusters, SEXP membership, SEXP conf) { multimap<double,treeNode,greater<double> > treeMap; multimap<double,treeNode,greater<double> >::iterator it_tM; int l =LENGTH(membership); //Rprintf("beleptunk"); int p = 0; map<int,int> degrees; for(int i=0;i < l;i++){ SEXP members = VECTOR_ELT(mem...

...ile,attempts[0],resamples[0],conf[0]); if(ret == 0) Rprintf("cluster map has been written to %s\n", file[0]); R_FlushConsole(); R_ProcessEvents(); return; // Return Nothing. } } extern "C" { void findConfCoreWrapper(SEXP gdiag, SEXP bootClusters, SEXP membership, SEXP conf) { multimap<double,treeNode,greater<double> > treeMap; multimap<double,treeNode,greater<double> >::iterator it_tM; int l =LENGTH(membership); //Rprintf("beleptunk"); int p = 0; map<int,int> degrees; for(int i=0;i < l;i++){ SEXP members = VECTOR_ELT(mem...

...ith the point colours and associated text. Also, how would I make the associated text ("Urban" and "Rural") smaller than the title? Many thanks for any suggestions! Steve _________________________________________________________________ Discover Bird's Eye View now with Multimap from Live Search

Hi All, I''m looking for a good example of client-side marker clustering with Mapstraction. It would be especially valuable if it was easily reusable code, similar to MarkerClusterer for Google Maps: http://gmaps-utility-library.googlecode.com/svn/trunk/markerclusterer/1.0/docs/reference.html If no such thing exists for Mapstraction (and I haven''t seen one), what are the

Hi All, I am in the process of writing an R extension in c++ and am using several STL containers (e.g., vector<double>, map<int, double>, multimap<int, double>). I make sure to clear all these containers at the end of the .Call. Everything compiles and runs just fine, but I'm a bit worried since I haven't found any other packages that use STL. So, my question: is it OK to use the STL containers in my code? Will the use of t...

...e()); break; case ''microsoft'': map.PanToLatLong(point.toMicrosoft()); break; case ''yahoo'': case ''openlayers'': case ''openspace'' : case ''multimap'': case ''mapquest'': case ''freeearth'': case ''map24'': case ''viamichelin'': this.setCenter(point); break; default: if(this.debug) {...

Are there any plans to integrate Virtual Earth''s Bird''s Eye view to mapstraction? I tried an "integration hack" but then found out that there are too many issues involved (check whether birds eye is available for the current map area, disabling zoom controls,...). Has anyone else tried it? Franz

...Map24 stop working. The shell of the map is displayed with the map type logo, but no map. and occasionally an error for (var i = 0; i < me.onload[api].length; i++) { me.onload[api][i](); } me.onload[api] has no properties in the Map24 section. 2. Including Map24 screws up the display of MultiMap in the same way as above. Are these know issues? The mapstraction example of multiple maps on the same page doesn''t have MapQuest as well as Map24 + MultiMap. You can reproduce this issue by trying to include these map types in the example. Thanks, Sanjiv -------------- next part -------...

...ing code in VirtRegMap.cpp is asserting in the C++ library because back() is called on an empty container: /// addLastUse - Add the last use information of all stack slots whose /// values are available in the specific register. void addLastUse(unsigned PhysReg, MachineInstr *Use) { std::multimap<unsigned, int>::iterator I = PhysRegsAvailable.lower_bound(PhysReg); while (I != PhysRegsAvailable.end() && I->first == PhysReg) { int Slot = I->second; I++; std::map<int, SSInfo>::iterator II = SpillSlotsAvailable.find(Slot); assert(II !...