user0/rust
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Long lines

Browse source
This commit is contained in:
Brian Anderson 2012-12-16 19:56:09 -08:00
parent 8cbf817c2c
commit 161d289cc7
1 changed files with 7 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

13
src/libstd/priority_queue.rs
View file

@ -87,7 +87,8 @@ impl <T: Ord> PriorityQueue<T> {
#[cfg(stage3)]
pure fn to_vec(self) -> ~[T] { let PriorityQueue{data: v} = self; v }
/// Consume the PriorityQueue and return a vector in sorted (ascending) order
/// Consume the PriorityQueue and return a vector in sorted
/// (ascending) order
#[cfg(stage0)]
pure fn to_sorted_vec(self) -> ~[T] { fail }
#[cfg(stage1)]
@ -115,11 +116,11 @@ impl <T: Ord> PriorityQueue<T> {
q
}
// The implementations of siftup and siftdown use unsafe blocks in order to
// move an element out of the vector (leaving behind a junk element), shift
// along the others and move it back into the vector over the junk element.
// This reduces the constant factor compared to using swaps, which involves
// twice as many moves.
// The implementations of siftup and siftdown use unsafe blocks in
// order to move an element out of the vector (leaving behind a
// junk element), shift along the others and move it back into the
// vector over the junk element. This reduces the constant factor
// compared to using swaps, which involves twice as many moves.
priv fn siftup(&mut self, start: uint, pos: uint) unsafe {
let mut pos = pos;