Reminds me of the original version of greplin, which became cue, which shutdown [1] after failure to acquire funding/achieve profit:
> Cue started out as Greplin, a search startup that indexed all of a person’s online social content off Facebook, Gmail and Twitter. Last year they pivoted and launched a personal assistant app called Cue, that turned a person’s e-mails, contacts and files into a daily agenda with key items like restaurant reservations and flight confirmations.
Some IM punters exploited issues with the primitive HTML renderering capabilities in AOL, when receiving certain HTML AOL would either take too many cycles render it, detracting from its network code cycles causing a disconnect from he server (booted), or in some cases crash. Some IMing also exploited bandwidth disparity, whereby they would send more than you could consume forcing a disconnect.
Wow! I completely forgot about Ronin Warriors. I need to find and rewatch them—I hope they're available somewhere. I had those action figures as well. They were great.
Which Exo figures did/do you have? (I had Lt. Marsh, Wolf, Marsala, and Phaeton or Typhonus (can't recall which).
Couldn't agree more with all the comments on quality and maturity of X-Men, Spiderman, and Batman series of that era. Paired with reading the comics they really cemented the Marvel and DC universes for me.
Have add in Exo Squad! While it's not a comic book adaptation, it's a kids-targeted cartoon from that 90s era with very mature themes. Great first-gen action figures and genesis game as well.
I've rewatched the series recently (can purchase on iTunes and find on youtube) and it still holds up. Would love to see it as a live-action series and/or in cinematic form.
Redis uses a skip list (doubly linked) implementation for sorted sets, here are antirez's (BDFL) comments as to why from 7 years ago:
There are a few reasons:
1) They are not very memory intensive. It's up to you basically. Changing parameters about the probability of a node to have a given number of levels will make then less memory intensive than btrees.
2) A sorted set is often target of many ZRANGE or ZREVRANGE operations, that is, traversing the skip list as a linked list. With this operation the cache locality of skip lists is at least as good as with other kind of balanced trees.
3) They are simpler to implement, debug, and so forth. For instance thanks to the skip list simplicity I received a patch (already in Redis master) with augmented skip lists implementing ZRANK in O(log(N)). It required little changes to the code.