c++ - Should use an insertion sort or construct a heap to improve performance? -

-

itemprop = "text">

We have large (100,000+ elements) vent of structures (operator and lt; overload for providing ordering): < / P> 

  std :: vector & lt; MyType & gt; VectorMyTypes; Std :: sort (vectorMyType.begin (), vectorMyType.end ());

My problem is that while preserving the sort order, we are seeing performance issues while adding new elements of these vectors. At the moment we are doing something like this: 

 for  (very large set) {vectorMyTypes.push_back (newType); Std :: sort (vectorMyType.begin (), vectorMyType.end ()); ... valid stuff (vector mitip); // This method assumes that vector can be ordered}

it is not absolutely as I know that this example can be used in different ways However, it gives you an idea why performance can be a problem because I am sorting after every push_back . I think I have two options to improve performance:

  1. To improve sort performance (one hand is prepared?) entry

    std:

  2. Should I sort an inclusion? Is there anything in Boost that can help me here?

  3. Should I consider using a heap? How do i do this Edit:

    Thank you for all your responsibilities. I understand that the example I gave was far from optimal and it is not yet fully represented in my code. It was just that I was experiencing the lack of performance - that's why this question is not seeing many up-votes.)

    Many thanks for you, this is often The easiest answer is that which is the best, and perhaps it is an analysis of my problem which was blinding me for the most obvious solution. I like the preset method to insert directly into a pre-ordered vector.

    As I have commented, I am obliged to use vectors right now, so std :: set, std :: maps, etc. are not an option.

    No need to promote the entered entry: 

      vectorMyTypes .inert (std :: upper_bound (vectorMyTypes.begin (), vector mitesapp.end (), new type), new type;

    upper_bound provide a valid entry point As long as the vector has been sorted to begin, so long as you only insert the elements into your right place, I did basically do the lower_boun D was said, but if there are many equal elements in the vector, then upper_bound selects that entry point for which less work is required.

    This Copy the (n) elements, but you say that the inclusion sort is "indiscriminately fast", and it is fast if it is not fast enough, then you have to find a way to add items to batches and finally validate, Or leave the compatible storage and And switch to a container that maintains the order, such as set or multiset .

    A pile does not maintain the order in the underlying container, but the priority is good for the queue or the same, because it allows the maximum element to be removed faster, you say that you want to keep the vector in sequence , But if you do not actually recycle the entire collection anytime, you do not need to order it completely, and when a pile is useful.


Comments

Post a Comment

Popular posts from this blog

c# - ListView onScroll event -

-
I am programming a simple C # application, and I need a Scallow event on the list view. So I inherited the original ListView class created in ListviewEx witch. I found out how to locate the scroll message from WinAPI and I modified the WndProc method. Now I have this WndProc: protected override zero WndProc (Ref message message) {base.WndProc (Ref I); If (m.msg == WM_VSCROLL) {onScroll (This, New EventArgs ()); }} But the problem is, I do not know how to know about scrolling information. This data should be in wParam, but there is a LOWORD macro ++ like in C in C # and I switch to find the criteria like SB_ below, SB_ENDSCROLL, SB_PAGEUP etc. there any way Need to change the LOWORD macro from C #? Or any other way to find the necessary parameters about scrolling? You can define the WParam constants as the following: Private const int WM_HSCROLL = 0x114; Private Constant WM_VSCROLL = 0x115; Private contact int SBHOZZ = 0; Private Consultant SB_VERT = 1; Private Con...
Read more

PHP - get image from byte array -

-
I am trying to create a back-end for my mobile application. I am sending the content of an image in the body of the HTTP request (output stream) as a byte array, I want to read this stream of bytes in PHP scripts and take back an image. Can anyone tell me how can I do this? Thank you. You can obtain the request body $ body = Reading from file_get_contents ('php: // input'); What you do with that data Depending on you, you can write the data in a file as you mentioned that this is image data, you can drop the data into the object can do. Another option is to use and load the image.
Read more

Linux Terminal Problem with Non-Canonical Terminal I/O app -

-
I have a small app written in C to run on Linux. Part of the app accepts user-input from keyboard , And it uses non-canonical terminal mode so that it can respond to each keystroke. The section of the code that accepts input is a simple task that is called repeatedly in the loop: char get_input () {char C = 0; Int res = reading (input_tamille, & amp; c, 1); If (RSS == 0) 0 returns; If (res == -1) {/ * snip error handling * /} return c; } It reads a letter from the terminal if there is no input within a given time limit, (c_cc [VTIME] value in the vocabulary structure), read () 0 And get_input () is called again It all works very well, I have recently discovered that if you run this app in a terminal window, and then the app Close the terminal window without ending, the app will not exit Received, but CPU intensive launches into an infinite loop, where the read () returns 0 without waiting continued. So how can I get out of the apple if it runs from the terminal win...
Read more