Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>The short answer is... it depends.</p> <p>If <code>Q</code> is a pointer to an array of objects that have destructors, then <code>delete[] Q</code> will need to call all of those destructors. This will call O(n) destructors, where n is the number of elements in the array. On the other hand, if <code>Q</code> points to an array of objects that don't have destructors (for example, <code>int</code>s or simple <code>struct</code>s), then no destructors need to be called, which takes only O(1) time.</p> <p>Now note that those destructors don't have to run in O(1) time each. If the objects are, say, <code>std::vector</code> objects, then each destructor in turn has to fire off more deallocations. Without knowing more about what those objects are, all we can say is that if there are destructors called, there will be 0 destructors called if the destructors are trivial and O(n) destructors called otherwise.</p> <p>But this ignores the implementation detail of how the heap allocator works. It's possible that deallocating a block of memory might take O(log K) time, where K is the total number of allocated blocks, or it might take O(1) time regardless of how many blocks of memory there are, or it might take O(log log K), etc. Without knowing how the allocator works, you honestly can't be sure.</p> <p>In short, if you focus purely on the work required to clean up the objects before handing the block back to the memory allocator, there are O(n) destructors called if the objects stored have destructors and 0 destructors called otherwise. These destructors might take a nontrivial amount of time to complete. Then, there's the cost of reintroducing the block of memory back into the memory allocator, which might take its own amount of time.</p> <p>Hope this helps!</p>
    singulars
    1. This table or related slice is empty.
    1. POIs Big-O of the C++ statement 'delete [] Q;' O(1) or O(n)?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. UStemplatetypedef
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. CO@Ethan Barron now write this down on a clean paper. put it under your shirt. as the question papers are being handed out, make a swift move and get the paper under your shirt under the question paper. good luck.
      singulars
      1. PO
      1. USİsmet Alkan
    2. COI'd like to add something important that a lot of people miss. The objects that the array contains don't *need* destructors to be defined. The important thing is that the destructor (either defined, or the default) is *trivial*. That is, if a class has a `vector` as a member, then the default destructor is nontrivial and would get run, even if there is no destructor explicitly defined
      singulars
      1. PO
      1. USDuncan
    3. CO@templatetypedef this is a great answer, thank you so much.
      singulars
      1. PO
      1. USEthan Barron
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload