Permalink
Browse files

removing old code

  • Loading branch information...
1 parent 9637949 commit 2220cf35acd5c9b4dda626a5cb46f289e7fdc2de @stevej committed Dec 7, 2012
Showing with 0 additions and 78 deletions.
  1. +0 −62 algorithms.rs
  2. +0 −2 crate.rc
  3. +0 −14 heap.rs
View
@@ -1,62 +0,0 @@
-use core::option;
-
-type NodeLink<T> = Option<Node<T>>;
-
-// A node in a singly-linked list.
-pub enum Node<T> {
- // I don't understand this syntax.
- Node_(@{
- mut data: T,
- mut next: NodeLink<T>
- })
-}
-
-pure fn Node<T>(initial_value: T) -> Node<T> {
- let node = Node_(@{
- mut data: initial_value,
- mut next: None
- });
-
- return node;
-}
-
-fn append_to_node<T>(node: Node<T>, next_value: T) -> Node<T> {
- let next = Node(next_value);
- node.next = Some(next);
-
- return node;
-}
-
-
-
-fn prepend_to_node<T>(node: Node<T>, previous_value: T) -> Node<T> {
- let first = Node(previous_value);
- first.next = Some(node);
-
- return first;
-}
-
-
-/*
-fn find_in_list<T>(start: Node<T>, element: T, comparator: fn(&T) -> bool ) -> Option<Node<T>> {
-
- if (comparator(&start.value)) {
- return Some(start);
- }
-
- match start.next {
- @None => return None,
- @Some(node) => return find_in_list(node, element, comparator)
- };
-}
-*/
-
-#[test]
-fn test_algorithms() {
- info!("hello");
-
-}
-
-fn main() {
-
-}
View
@@ -17,9 +17,7 @@
extern mod std;
-pub mod algorithms;
pub mod tree;
-pub mod heap;
pub mod lazy;
pub mod pairing_heap;
View
@@ -1,14 +0,0 @@
-/**
- * Heap implementation. Contains min and max heaps
- */
-
-use core::cmp::{Eq, Ord};
-use core::option;
-
-#[test]
-fn test_heap() {
-
-}
-
-
-fn main() {}

0 comments on commit 2220cf3

Please sign in to comment.