Databases
StackOverflow2013
Postsdbo
POlist or container O(1)-ish insertion/deletion performance, with array semantics
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POlist or container O(1)-ish insertion/deletion performance, with array semantics
    primarykey
    data
    text
    <p>I'm looking for a collection that offers list semantics, but also allows array semantics. Say I have a list with the following items: </p> <pre><code>apple orange carrot pear </code></pre> <p>then my container array would: </p> <pre><code>container[0] == apple container[1] == orangle container[2] == carrot </code></pre> <p>Then say I delete the orange element: </p> <pre><code>container[0] == apple container[1] == carrot </code></pre> <p>I want to collapse gaps in the array without having to do an explicit resizing, Ie if I delete container[0], then the container collapses, so that container[1] is now mapped as container[0], and container[2] as container[1], etc. I still need to access the list with array semantics, and null values aren't allow (in my particular use case). </p> <p>EDIT: </p> <p>To answer some questions - I know O(1) is impossible, but I don't want a container with array semantics approaching O(log N). Sort of defeats the purpose, I could just iterate the list. </p> <p>I originally had some verbiage here on sort order, I'm not sure what I was thinking at the time (Friday beer-o-clock most likely). One of the use-cases is Qt list that contains images - deleting an image from the list should collapse the list, not necessary take the last item from the list and throw it in it's place. In this case, yet, I do want to preserve list semantics.</p> <p>The key differences I see as separating list and array: Array - constant-time access List - arbitrary insertion </p> <p>I'm also not overly concerned if rebalancing invalidates iterators.</p>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USChris K
    1. USChris K
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    3. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POlist or container O(1)-ish insertion/deletion performance, with array semantics
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POlist or container O(1)-ish insertion/deletion performance, with array semantics
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POlist or container O(1)-ish insertion/deletion performance, with array semantics
      1. This table or related slice is empty.
      1. VTUpMod
    1. COWhat behavior of [`ArrayList`](http://java.sun.com/javase/6/docs/api/java/util/ArrayList.html) don't you like? I suspect it's the behavior of inserts anywhere other than the tail of the list, but I'd like to clarify.
      singulars
      1. POlist or container O(1)-ish insertion/deletion performance, with array semantics
      1. USHank Gay
    2. CO`std::vector` is the direct equivalent for `ArrayList` but I think neither solves your particular use-case.
      singulars
      1. POlist or container O(1)-ish insertion/deletion performance, with array semantics
      1. USKonrad Rudolph
    3. COA container with all operations at worst O(log N) is *much* faster than O(N) list operations for large N, so no purpose is being defeated there. Also `pear` appears and then disappears in your example. -1.
      singulars
      1. POlist or container O(1)-ish insertion/deletion performance, with array semantics
      1. USj_random_hacker
 

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