mikros/rust
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

dlist: A new implementation of an owned doubly-linked list

Browse Source 
This is an owned sendable linked list which allows insertion and
deletion at both ends, with fast traversal through iteration, and fast
append/prepend.

It is indended to replace the previous managed DList with exposed list
nodes. It does not match it feature by feature, but DList could grow
more methods if needed.
This commit is contained in:
blake2-ppc 2013-07-09 16:55:04 +02:00
parent 06accaf22b
commit 824bb44f92
2 changed files with 851 additions and 915 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1750
src/libextra/dlist.rs
View File

File diff suppressed because it is too large Load Diff

16
src/libextra/serialize.rs
View File

@ -24,7 +24,7 @@ use std::trie::{TrieMap, TrieSet};
use std::uint;
use std::vec;
use deque::Deque;
use dlist::DList;
use dlist::List;
use treemap::{TreeMap, TreeSet};
pub trait Encoder {
@ -652,11 +652,11 @@ impl<
impl<
S: Encoder,
T: Encodable<S> + Copy
> Encodable<S> for @mut DList<T> {
> Encodable<S> for List<T> {
fn encode(&self, s: &mut S) {
do s.emit_seq(self.size) |s| {
do s.emit_seq(self.len()) |s| {
let mut i = 0;
for self.each |e| {
for self.iter().advance |e| {
s.emit_seq_elt(i, |s| e.encode(s));
i += 1;
}
@ -664,12 +664,12 @@ impl<
}
}
impl<D:Decoder,T:Decodable<D>> Decodable<D> for @mut DList<T> {
fn decode(d: &mut D) -> @mut DList<T> {
let list = DList();
impl<D:Decoder,T:Decodable<D>> Decodable<D> for List<T> {
fn decode(d: &mut D) -> List<T> {
let mut list = List::new();
do d.read_seq |d, len| {
for uint::range(0, len) |i| {
list.push(d.read_seq_elt(i, |d| Decodable::decode(d)));
list.push_back(d.read_seq_elt(i, |d| Decodable::decode(d)));
}
}
list