From db707db0f1dacaf11afa1f3bc59ff46494581055 Mon Sep 17 00:00:00 2001
From: cuz <cuz@b7a2c559-68d2-44c3-8de9-860c34a00d81>
Date: Tue, 17 Jul 2001 12:42:16 +0000
Subject: [PATCH] Added CollMoveMultiple

git-svn-id: svn://svn.cc65.org/cc65/trunk@798 b7a2c559-68d2-44c3-8de9-860c34a00d81
---
 src/common/coll.c | 67 +++++++++++++++++++++++++++++++++++++++++++++--
 src/common/coll.h |  8 ++++++
 2 files changed, 73 insertions(+), 2 deletions(-)

diff --git a/src/common/coll.c b/src/common/coll.c
index e5a0e7eb8..fa7fe6e9a 100644
--- a/src/common/coll.c
+++ b/src/common/coll.c
@@ -205,9 +205,72 @@ void CollMove (Collection* C, unsigned OldIndex, unsigned NewIndex)
 
 
 
+void CollMoveMultiple (Collection* C, unsigned Start, unsigned Count, unsigned Target)
+/* Move a range of items from one position to another. Start is the index
+ * of the first item to move, Count is the number of items and Target is
+ * the index of the target item. The item with the index Start will later
+ * have the index Target. All items with indices Target and above are moved
+ * to higher indices.
+ */
+{
+    void** TmpItems;
+    unsigned Bytes;
+
+    /* Check the range */
+    PRECONDITION (Start < C->Count && Start + Count <= C->Count && Target <= C->Count);
+
+    /* Check for trivial parameters */
+    if (Count == 0 || Start == Target) {
+    	return;
+    }
+
+    /* Calculate the raw memory space used by the items to move */
+    Bytes = Count * sizeof (void*);
+
+    /* Allocate temporary storage for the items */
+    TmpItems = xmalloc (Bytes);
+
+    /* Copy the items we have to move to the temporary storage */
+    memcpy (TmpItems, C->Items + Start, Bytes);
+
+    /* Check if the range has to be moved upwards or downwards. Move the
+     * existing items to their final location, so that the space needed
+     * for the items now in temporary storage is unoccupied.
+     */
+    if (Target < Start) {
+
+     	/* Move downwards */
+	unsigned BytesToMove = (Start - Target) * sizeof (void*);
+       	memmove (C->Items+Target+Count, C->Items+Target, BytesToMove);
+
+    } else if (Target < Start + Count) {
+
+	/* Target is inside range */
+	FAIL ("Not supported");
+
+    } else {
+
+     	/* Move upwards */
+	unsigned ItemsToMove = (Target - Start - Count);
+       	unsigned BytesToMove = ItemsToMove * sizeof (void*);
+     	memmove (C->Items+Start, C->Items+Target-ItemsToMove, BytesToMove);
+
+	/* Adjust the target index */
+	Target -= Count;
+    }
+
+    /* Move the old items to their final location */
+    memcpy (C->Items + Target, TmpItems, Bytes);
+
+    /* Delete the temporary item space */
+    xfree (TmpItems);
+}
+
+
+
 static void QuickSort (Collection* C, int Lo, int Hi,
-	               int (*Compare) (void*, const void*, const void*),
-		       void* Data)
+   	               int (*Compare) (void*, const void*, const void*),
+   		       void* Data)
 /* Internal recursive sort function. */
 {
     /* Get a pointer to the items */
diff --git a/src/common/coll.h b/src/common/coll.h
index d925b39c9..7f29a1a5e 100644
--- a/src/common/coll.h
+++ b/src/common/coll.h
@@ -255,6 +255,14 @@ void CollMove (Collection* C, unsigned OldIndex, unsigned NewIndex);
  * and up are moved one position upwards.
  */
 
+void CollMoveMultiple (Collection* C, unsigned Start, unsigned Count, unsigned Target);
+/* Move a range of items from one position to another. Start is the index
+ * of the first item to move, Count is the number of items and Target is
+ * the index of the target item. The item with the index Start will later
+ * have the index Target. All items with indices Target and above are moved
+ * to higher indices.
+ */
+
 void CollSort (Collection* C,
 	       int (*Compare) (void*, const void*, const void*),
 	       void* Data);
-- 
2.39.5