Databases
StackOverflow2013
Postsdbo
POLookup structure for handling future events (time based)
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POLookup structure for handling future events (time based)
    primarykey
    data
    text
    <p>I am looking for an efficient data structure, that'll allow me to cue events ... that is, i will be having an app, where at any time in execution, it is possible, that an event will be raised for a future point in execution ... something like:</p> <ul> <li>t=20: in 420 seconds, A occurs</li> <li>t=25: in 13 seconds, B occurs</li> <li>t=27: in 735 seconds, C occurs</li> <li>...</li> </ul> <p>so i'd like to have a data structure, where i can put in any event in any time in the future and where i can get and (by doing so) remove all due events ... also, a plus would be, if i were able to remove an event from the datastructure (because it was canceled) ... not too important though, since i can simply flag it as cancelled ...</p> <p>my first thought was, maybe to do some sort of tree, but i guess the removing-due-events part requires a lot of rebalancing ...</p> <p>i am considering simply having an int hash, mapping timestamps to either null or stacks of events that are to occur at that point in time ... i think in scenarios, with a lot of events (possibly multiple every second - which is what i intend to work with), this actually isn't such a bad idea after all ...</p> <p>so i am eager to hear your input ... :)</p> <hr> <p><strong>edit:</strong></p> <ul> <li>to be more specific: i think n here is at about 100K-1M, and i guess i might be having about 1-100 events/second ...</li> <li>the t is of no special importance ... it is only to illustrate that a future event can be "enqueued" at any time ...</li> </ul> <hr> <p>thanks</p> <p>back2dos</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USback2dos
    1. USback2dos
    plurals
    1. This table or related slice is empty.
    1. 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. POLookup structure for handling future events (time based)
      1. USennuikiller
      1. VTFavorite
    2. VO
      singulars
      1. POLookup structure for handling future events (time based)
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POLookup structure for handling future events (time based)
      1. This table or related slice is empty.
      1. VTUpMod
    1. CODefine _'remove all due events'_ - if there are 1-100 events/second are they to be returned order-independent? or in sequential order in which they were enqueued? (if the former, could simply use a hash of lists, no need to sort multiple events at that timeslot)
      singulars
      1. POLookup structure for handling future events (time based)
      1. USsmci
 

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