Mantis#1314. Thank you kindly, Kinoc for YieldProlog.

I have added everything *except* the patch to .../LSL/Compiler.cs. The Compiler.cs patch has a namespace issue. Lets make a second patch to close the gap.
author: Charles Krinke 2008-05-31 17:52:44 +0000
committer: Charles Krinke 2008-05-31 17:52:44 +0000
commit: 25b7d9944d5875e1887eed156f31dd5779761265 (patch)
tree: 2c4f6f066ef2b5f60d399ab4862ed7b9dbe0c78f /OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs
parent: * Implements UserServer logoff in a few situations (diff)
download: opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.zip
opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.tar.gz
opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.tar.bz2
opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.tar.xz
1 files changed, 156 insertions, 0 deletions
diff --git a/OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs b/OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs
new file mode 100644
index 0000000..b16e8a4
--- /dev/null
+++ b/OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs
@@ -0,0 +1,156 @@
+/*
+ * Copyright (C) 2007-2008, Jeff Thompson
+ * 
+ * All rights reserved.
+ * 
+ * Redistribution and use in source and binary forms, with or without 
+ * modification, are permitted provided that the following conditions are met:
+ * 
+ *     * Redistributions of source code must retain the above copyright 
+ *       notice, this list of conditions and the following disclaimer.
+ *     * Redistributions in binary form must reproduce the above copyright 
+ *       notice, this list of conditions and the following disclaimer in the 
+ *       documentation and/or other materials provided with the distribution.
+ *     * Neither the name of the copyright holder nor the names of its contributors 
+ *       may be used to endorse or promote products derived from this software 
+ *       without specific prior written permission.
+ * 
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
+ * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+ * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+ * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+ */
+using System;
+using System.Collections.Generic;
+namespace OpenSim.Region.ScriptEngine.DotNetEngine.Compiler.YieldProlog
+{
+    public class ListPair : Functor2
+    {
+        public ListPair(object head, object tail) : base(Atom.DOT, head, tail)
+        {
+        }
+        public static object make(List<object> list)
+        {
+            if (list.Count <= 0)
+                return Atom.NIL;
+            object result = Atom.NIL;
+            // Start from the end.
+            for (int i = list.Count - 1; i >= 0; --i)
+                result = new ListPair(list[i], result);
+            return result;
+        }
+        public static object make(object[] array)
+        {
+            if (array.Length <= 0)
+                return Atom.NIL;
+            object result = Atom.NIL;
+            // Start from the end.
+            for (int i = array.Length - 1; i >= 0; --i)
+                result = new ListPair(array[i], result);
+            return result;
+        }
+        /// <summary>
+        /// Return a ListPair version of array, where repeated elements 
+        /// (according to YP.termEqual) are removed.
+        /// </summary>
+        /// <param name="array"></param>
+        /// <returns></returns>
+        public static object makeWithoutRepeatedTerms(object[] array)
+        {
+            if (array.Length <= 0)
+                return Atom.NIL;
+            // Start from the end.
+            object previousTerm = array[array.Length - 1];
+            object result = new ListPair(previousTerm, Atom.NIL);
+            for (int i = array.Length - 2; i >= 0; --i)
+            {
+                object term = array[i];
+                if (YP.termEqual(term, previousTerm))
+                    continue;
+                result = new ListPair(term, result);
+                previousTerm = term;
+            }
+            return result;
+        }
+        /// <summary>
+        /// Return a ListPair version of array, where repeated elements 
+        /// (according to YP.termEqual) are removed.
+        /// </summary>
+        /// <param name="array"></param>
+        /// <returns></returns>
+        public static object makeWithoutRepeatedTerms(List<object> array)
+        {
+            if (array.Count <= 0)
+                return Atom.NIL;
+            // Start from the end.
+            object previousTerm = array[array.Count - 1];
+            object result = new ListPair(previousTerm, Atom.NIL);
+            for (int i = array.Count - 2; i >= 0; --i)
+            {
+                object term = array[i];
+                if (YP.termEqual(term, previousTerm))
+                    continue;
+                result = new ListPair(term, result);
+                previousTerm = term;
+            }
+            return result;
+        }
+        public static object make(object element1)
+        {
+            return new ListPair(element1, Atom.NIL);
+        }
+        public static object make(object element1, object element2)
+        {
+            return new ListPair(element1, new ListPair(element2, Atom.NIL));
+        }
+        public static object make(object element1, object element2, object element3)
+        {
+            return new ListPair(element1, 
+                new ListPair(element2, new ListPair(element3, Atom.NIL)));
+        }
+        /// <summary>
+        /// Return an array of the elements in list or null if it is not
+        /// a proper list.  If list is Atom.NIL, return an array of zero elements.
+        /// This does not call YP.getValue on each element.
+        /// </summary>
+        /// <param name="list"></param>
+        /// <returns></returns>
+        public static object[] toArray(object list)
+        {
+            list = YP.getValue(list);
+            if (list.Equals(Atom.NIL))
+                return new object[0];
+            List<object> result = new List<object>();
+            for (object element = list;
+                 element is Functor2 && ((Functor2)element)._name == Atom.DOT;
+                 element = YP.getValue(((Functor2)element)._arg2))
+                result.Add(((Functor2)element)._arg1);
+            if (result.Count <= 0)
+                return null;
+            return result.ToArray();
+        }
+    }
+}
author	Charles Krinke	2008-05-31 17:52:44 +0000
committer	Charles Krinke	2008-05-31 17:52:44 +0000
commit	25b7d9944d5875e1887eed156f31dd5779761265 (patch)
tree	2c4f6f066ef2b5f60d399ab4862ed7b9dbe0c78f /OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs
parent	* Implements UserServer logoff in a few situations (diff)
download	opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.zip opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.tar.gz opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.tar.bz2 opensim-SC-25b7d9944d5875e1887eed156f31dd5779761265.tar.xz

diff --git a/OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs b/OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs new file mode 100644 index 0000000..b16e8a4 --- /dev/null +++ b/OpenSim/Region/ScriptEngine/DotNetEngine/Compiler/YieldProlog/ListPair.cs
@@ -0,0 +1,156 @@
	1	/*
	2	* Copyright (C) 2007-2008, Jeff Thompson
	3	*
	4	* All rights reserved.
	5	*
	6	* Redistribution and use in source and binary forms, with or without
	7	* modification, are permitted provided that the following conditions are met:
	8	*
	9	* * Redistributions of source code must retain the above copyright
	10	* notice, this list of conditions and the following disclaimer.
	11	* * Redistributions in binary form must reproduce the above copyright
	12	* notice, this list of conditions and the following disclaimer in the
	13	* documentation and/or other materials provided with the distribution.
	14	* * Neither the name of the copyright holder nor the names of its contributors
	15	* may be used to endorse or promote products derived from this software
	16	* without specific prior written permission.
	17	*
	18	* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
	19	* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
	20	* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
	21	* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
	22	* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
	23	* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
	24	* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
	25	* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
	26	* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
	27	* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
	28	* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	29	*/
	30
	31	using System;
	32	using System.Collections.Generic;
	33
	34	namespace OpenSim.Region.ScriptEngine.DotNetEngine.Compiler.YieldProlog
	35	{
	36	public class ListPair : Functor2
	37	{
	38	public ListPair(object head, object tail) : base(Atom.DOT, head, tail)
	39	{
	40	}
	41
	42	public static object make(List<object> list)
	43	{
	44	if (list.Count <= 0)
	45	return Atom.NIL;
	46
	47	object result = Atom.NIL;
	48	// Start from the end.
	49	for (int i = list.Count - 1; i >= 0; --i)
	50	result = new ListPair(list[i], result);
	51	return result;
	52	}
	53
	54	public static object make(object[] array)
	55	{
	56	if (array.Length <= 0)
	57	return Atom.NIL;
	58
	59	object result = Atom.NIL;
	60	// Start from the end.
	61	for (int i = array.Length - 1; i >= 0; --i)
	62	result = new ListPair(array[i], result);
	63	return result;
	64	}
	65
	66	/// <summary>
	67	/// Return a ListPair version of array, where repeated elements
	68	/// (according to YP.termEqual) are removed.
	69	/// </summary>
	70	/// <param name="array"></param>
	71	/// <returns></returns>
	72	public static object makeWithoutRepeatedTerms(object[] array)
	73	{
	74	if (array.Length <= 0)
	75	return Atom.NIL;
	76
	77	// Start from the end.
	78	object previousTerm = array[array.Length - 1];
	79	object result = new ListPair(previousTerm, Atom.NIL);
	80	for (int i = array.Length - 2; i >= 0; --i)
	81	{
	82	object term = array[i];
	83	if (YP.termEqual(term, previousTerm))
	84	continue;
	85	result = new ListPair(term, result);
	86	previousTerm = term;
	87	}
	88	return result;
	89	}
	90
	91	/// <summary>
	92	/// Return a ListPair version of array, where repeated elements
	93	/// (according to YP.termEqual) are removed.
	94	/// </summary>
	95	/// <param name="array"></param>
	96	/// <returns></returns>
	97	public static object makeWithoutRepeatedTerms(List<object> array)
	98	{
	99	if (array.Count <= 0)
	100	return Atom.NIL;
	101
	102	// Start from the end.
	103	object previousTerm = array[array.Count - 1];
	104	object result = new ListPair(previousTerm, Atom.NIL);
	105	for (int i = array.Count - 2; i >= 0; --i)
	106	{
	107	object term = array[i];
	108	if (YP.termEqual(term, previousTerm))
	109	continue;
	110	result = new ListPair(term, result);
	111	previousTerm = term;
	112	}
	113	return result;
	114	}
	115
	116	public static object make(object element1)
	117	{
	118	return new ListPair(element1, Atom.NIL);
	119	}
	120
	121	public static object make(object element1, object element2)
	122	{
	123	return new ListPair(element1, new ListPair(element2, Atom.NIL));
	124	}
	125
	126	public static object make(object element1, object element2, object element3)
	127	{
	128	return new ListPair(element1,
	129	new ListPair(element2, new ListPair(element3, Atom.NIL)));
	130	}
	131
	132	/// <summary>
	133	/// Return an array of the elements in list or null if it is not
	134	/// a proper list. If list is Atom.NIL, return an array of zero elements.
	135	/// This does not call YP.getValue on each element.
	136	/// </summary>
	137	/// <param name="list"></param>
	138	/// <returns></returns>
	139	public static object[] toArray(object list)
	140	{
	141	list = YP.getValue(list);
	142	if (list.Equals(Atom.NIL))
	143	return new object[0];
	144
	145	List<object> result = new List<object>();
	146	for (object element = list;
	147	element is Functor2 && ((Functor2)element)._name == Atom.DOT;
	148	element = YP.getValue(((Functor2)element)._arg2))
	149	result.Add(((Functor2)element)._arg1);
	150
	151	if (result.Count <= 0)
	152	return null;
	153	return result.ToArray();
	154	}
	155	}
	156	}