From 21adfd564555428d0af11e7f22b42e05698d74fd Mon Sep 17 00:00:00 2001
From: blake2-ppc <blake2-ppc>
Date: Sun, 21 Jul 2013 21:05:48 +0200
Subject: dlist: Use Ord for .insert_ordered()

We don't need TotalOrd for ordered insertion, just the normal sort order
Ord.
---
 src/libextra/dlist.rs | 5 ++---
 1 file changed, 2 insertions(+), 3 deletions(-)

(limited to 'src/libextra')

diff --git a/src/libextra/dlist.rs b/src/libextra/dlist.rs
index a2436c9a42d..068dea7b8cc 100644
--- a/src/libextra/dlist.rs
+++ b/src/libextra/dlist.rs
@@ -23,7 +23,6 @@
 // the reverse direction.
 
 use std::cast;
-use std::cmp;
 use std::ptr;
 use std::util;
 use std::iterator::{FromIterator, InvertIterator};
@@ -396,13 +395,13 @@ impl<T> DList<T> {
     }
 }
 
-impl<T: cmp::TotalOrd> DList<T> {
+impl<T: Ord> DList<T> {
     /// Insert `elt` sorted in ascending order
     ///
     /// O(N)
     #[inline]
     pub fn insert_ordered(&mut self, elt: T) {
-        self.insert_when(elt, |a, b| a.cmp(b) != cmp::Less);
+        self.insert_when(elt, |a, b| a >= b)
     }
 }
 
-- 
cgit 1.4.1-3-g733a5