LPUSHX, RPUSHX, LINSERT only work on non-empty lists, so there are no clients waiting...

[redis.git] / pqsort.c

diff --git a/pqsort.c b/pqsort.c
index f532d6de495c0616d617b89519e06dc82efe74b7..257756376c4aca95941737ab6f4e4e89b92eca09 100644 (file)
--- a/pqsort.c
+++ b/pqsort.c
@@ -1,7 +1,7 @@
 /* The following is the NetBSD libc qsort implementation modified in order to
  * support partial sorting of ranges for Redis.
  *
- * Copyright(C) 2009 Salvatore Sanfilippo. All rights reserved.
+ * Copyright(C) 2009-2010 Salvatore Sanfilippo. All rights reserved.
  *
  * The original copyright notice follows. */
 
@@ -37,15 +37,6 @@
  * SUCH DAMAGE.
  */
 
-#include <sys/cdefs.h>
-#if defined(LIBC_SCCS) && !defined(lint)
-#if 0
-static char sccsid[] = "@(#)qsort.c    8.1 (Berkeley) 6/4/93";
-#else
-__RCSID("$NetBSD: qsort.c,v 1.19 2009/01/30 23:38:44 lukem Exp $");
-#endif
-#endif /* LIBC_SCCS and not lint */
-
 #include <sys/types.h>
 
 #include <assert.h>