Databases
StackOverflow2013
Postsdbo
POA data structure supporting O(1) random access and worst-case O(1) append?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POA data structure supporting O(1) random access and worst-case O(1) append?
    primarykey
    data
    text
    <p>I realize a resizable indexed collection that uses an array to store its elements (like <code>List&lt;T&gt;</code> in .NET or <code>ArrayList</code> in Java) has <a href="http://en.wikipedia.org/wiki/Amortized_analysis" rel="noreferrer">amortized O(1) insertion time</a> at the end of the collection. But then there's always that <em>one</em> pesky insertion at critical junctures where the collection has <em>just</em> reached its capacity and the next insertion requires a full copy of all elements in the internal array to a new one (presumably twice as large).</p> <p>A common mistake (in my opinion) is to go with a linked list to "fix" this problem; but I believe the overhead of allocating a node for every element can be quite wasteful, and in fact would dwarf the benefit of a guaranteed O(1) insertion in that rare case that the array insertion is costly—when, in fact, every <em>other</em> array insertion is significantly cheaper (and faster).</p> <p>What I was thinking might make sense is a hybrid approach consisting of a linked list of arrays, where every time the current "head" array reaches its capacity, a new array twice as large is added to the linked list. Then no copy would be necessary since the linked list would still have the original array. Essentially this seems analogous (to me) to the <code>List&lt;T&gt;</code> or <code>ArrayList</code> approach, except that wherever you previously would've incurred the cost of copying all the elements of the internal array, here you only incur the cost of allocating a <em>new</em> array plus a single node insertion.</p> <p>Of course, this would complicate other features if they were desired (e.g., inserting/removing into/from the middle of the collection); but as I've expressed in the title, I'm really just looking for an <em>add-only</em> (and iterate) collection.</p> <p>Are there any data structures out there ideally suited to this purpose? Or, can you think of one yourself?</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. UStemplatetypedef
    1. USDan Tao
    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. POA data structure supporting O(1) random access and worst-case O(1) append?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POA data structure supporting O(1) random access and worst-case O(1) append?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POA data structure supporting O(1) random access and worst-case O(1) append?
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

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