PEBLList Namespace Reference

Functions
Variant	Shuffle (Variant v)
Variant	Repeat (Variant v)
Variant	RepeatList (Variant v)
Variant	RepeatExpression (Variant v)
Variant	Sequence (Variant v)
Variant	DesignFullCounterbalance (Variant v)
Variant	CrossFactorWithoutDuplicates (Variant v)
Variant	Rotate (Variant v)
Variant	Length (Variant v)
	This returns the number of items in the list.
Variant	Nth (Variant v)
Variant	First (Variant v)
Variant	Second (Variant v)
Variant	Third (Variant v)
Variant	Fourth (Variant v)
Variant	Fifth (Variant v)
Variant	Last (Variant v)
Variant	Merge (Variant v)
Variant	Append (Variant v)
Variant	List (Variant v)
	This creates a list functionally, rather than syntactically using the [] operators.
Variant	Sort (Variant v)
	This just sorts the list.
Variant	SortBy (Variant v)
	This sorts the list by another list.
Variant	IsMember (Variant v)
Variant	RemoveDuplicates (Variant v)
Variant	MakeMap (Variant v)
Variant	Transpose (Variant v)
Variant	SubList (Variant v)
	This makes a list out of a sublist of a list. Or something like that.
Variant	Remove (Variant v)
Variant	PushOnEnd (Variant v)
	Given Merge([a,b,c],d), will return [a,b,c,d].
Variant	SetElement (Variant v)
Variant	ListToString (Variant v)
Variant	ModList (Variant v)

Variables
PEBL_Function_Type	FunctionTable []

Function Documentation

Append()

Variant PEBLList::Append

(

Variant

v

)

This adds an element to a list Given Merge([a,b,c],d), will return [a,b,c,d]

Definition at line 669 of file PEBLList.cpp.

{
 
    PList * plist = v.GetComplexData()->GetList();
 
 
    Variant v1 = plist->First(); //plist->PopFront();
    //v[1] should be a list.  Just extract the iterators.
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [Append(<list>, <list>)]:  ");
 
    PList * tmpList = (PList*)(v1.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p1 = tmpList->Begin();
    vector<Variant>::iterator p1end = tmpList->End();
 
    Variant v2 = plist->Nth(2); //plist->PopFront();
    //v[2] can be anything.
 
 
    //Make a new list to return.
    PList * returnList = new PList();
 
    Variant tmpVariant;
 
    //Add the first list.
    while(p1 != p1end)
        {
            returnList->PushBack(*p1);
            p1++;
        }
 
    //Append v2.
    returnList->PushBack(v2);
    counted_ptr<PEBLObjectBase> tmpObj = counted_ptr<PEBLObjectBase>(returnList);
    PComplexData * tmpPCD= (new PComplexData(tmpObj));
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), NULL, PEAT_LIST, and PList::PushBack().

CrossFactorWithoutDuplicates()

Variant PEBLList::CrossFactorWithoutDuplicates

(

Variant

v

)

This function takes a single list, and returns a list of all pairs, excluding the pairs that have two of the same item. CrossFactorWithoutDuplicates([a,b,c]) = [[a,b],[a,c],[b,a],[b,c],[c,a],[c,b]] To achieve the same effect but include the duplicates, use DesignFullCounterBalance(x,x)

Make sublist with the pair in it.

Definition at line 352 of file PEBLList.cpp.

{
    PList * plist = v.GetComplexData()->GetList();
 
   //v[1] should be a list.  Just extract the iterators.
 
    Variant v1 = plist->First();// plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [CrossFactorWithoutDuplicates(<list>)]:  ");
    PList * arglist = (PList*)(v1.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p1 = arglist->Begin();
    vector<Variant>::iterator p2;
    vector<Variant>::iterator pstart = p1;
    vector<Variant>::iterator pend = arglist->End();
 
    //There are now 2 list iterators: p1 and p2,
    //and an iterator to the p2start for resetting.
    //Make a new list to return.
 
    PList * returnList = new PList();
    PList * tmpList;
    counted_ptr<PEBLObjectBase> tmpObj;
    Variant tmpVariant;
    PComplexData * tmpPCD;
    int i1=0;
    int i2=0;
    while(p1 != pend)
        {
            p2 = pstart;
            i2=0;
            while (p2 != pend)
                {
                    if(i1 != i2)
                        {
                            tmpList = new PList();
                            tmpList->PushBack(*p1);
                            tmpList->PushBack(*p2);
 
 
                            tmpObj = counted_ptr<PEBLObjectBase>(tmpList);
 
                            tmpPCD = (new PComplexData(tmpObj));
                            tmpVariant = Variant(tmpPCD);
                            delete tmpPCD;
                            tmpPCD=NULL;
                            //Put the sublist in the outer list
                            returnList->PushBack(tmpVariant);
                        }
                    p2++;
                    i2++;
                }
 
            p1++;
            i1++;
        }
 
    tmpObj = counted_ptr<PEBLObjectBase>(returnList);
    tmpPCD= new PComplexData(tmpObj);
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), NULL, PEAT_LIST, and PList::PushBack().

DesignFullCounterbalance()

Variant PEBLList::DesignFullCounterbalance

(

Variant

v

)

This takes two lists as parameters, and returns a nested list of lists that includes the full counterbalancing of a and b. Use cautiously; this gets mxn large

Make sublist with the pair in it.

Definition at line 282 of file PEBLList.cpp.

{
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First(); //plist->PopFront();
    //v[1] should be a list.  Just extract the iterators.
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [DesignFullCounterbalance(<list>, <list>)]:  ");
 
    PList * arglist1 = (PList*)(v1.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p1 = arglist1->Begin();
    vector<Variant>::iterator p1end = arglist1->End();
 
 
    Variant v2 = plist->Nth(2);// plist->PopFront();
    //v[1] should be a list.  Just extract the iterators.
    PError::AssertType(v2, PEAT_LIST, "Argument error in second parameter of function [DesignFullCounterbalance(<list>, <list>)]:  ");
 
    PList * arglist2 = (PList*)(v2.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p2start = arglist2->Begin();
    vector<Variant>::iterator p2;
    vector<Variant>::iterator p2end   = arglist2->End();
 
    //There are now 2 list iterators: p1 and p2, and two ends to compare them to,
    //and an iterator to the p2start for resetting.
    //Make a new list to return.
 
    PList * returnList = new PList();
    PList * tmpList = NULL;
    counted_ptr<PEBLObjectBase> tmpobj;
    Variant tmpVariant;
    PComplexData * tmpPCD;
    while(p1 != p1end)
        {
            p2 = p2start;
            while (p2 != p2end)
                {
                    tmpList = new PList();
                    tmpList->PushBack(*p1);
                    tmpList->PushBack(*p2);
 
                    tmpobj = counted_ptr<PEBLObjectBase>(tmpList);
 
                    tmpPCD = (new PComplexData(tmpobj));
                    tmpVariant = Variant(tmpPCD);
                    delete tmpPCD;
                    tmpPCD=NULL;
 
                    //Put the sublist in the outer list
                    returnList->PushBack(tmpVariant);
                    p2++;
                }
 
            p1++;
        }
 
    tmpobj = counted_ptr<PEBLObjectBase>(returnList);
    tmpPCD= (new PComplexData(tmpobj));
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), NULL, PEAT_LIST, and PList::PushBack().

Fifth()

Variant PEBLList::Fifth

(

Variant

v

)

Definition at line 561 of file PEBLList.cpp.

{
   //v[1] should be a list
 
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Fifth(<list>)]:  ");
 
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
    return myList->Nth(5);
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), and PEAT_LIST.

First()

Variant PEBLList::First

(

Variant

v

)

This function returns the first variant in the PList passed in as an argument.

Definition at line 508 of file PEBLList.cpp.

{
   //v[1] should be a list
 
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [First(<list>)]:  ");
 
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    return Variant(myList->First());
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), and PEAT_LIST.

Fourth()

Variant PEBLList::Fourth

(

Variant

v

)

Definition at line 548 of file PEBLList.cpp.

{
   //v[1] should be a list
 
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Fourth(<list>)]:  ");
 
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
    return myList->Nth(4);
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), and PEAT_LIST.

IsMember()

Variant PEBLList::IsMember

(

Variant

v

)

Definition at line 807 of file PEBLList.cpp.

{
    PList * plist = v.GetComplexData()->GetList();
 
    //v[1] should be an item to check for membership.
    Variant v1 = plist->First();// plist->PopFront();
 
 
    Variant v2 = plist->Nth(2);  //  plist->PopFront();
    PError::AssertType(v2, PEAT_LIST, "Argument error in second parameter of function [IsMember(<list>, <item>)]:  ");
 
    PList * tmpList  = (PList*)(v2.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p = tmpList->Begin();
    vector<Variant>::iterator pEnd = tmpList->End();
 
    while(p != pEnd)
        {
            if(*p == v1)
                return Variant(true);
            p++;
        }
    return Variant(false);
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), and PEAT_LIST.

Last()

Variant PEBLList::Last

(

Variant

v

)

Definition at line 593 of file PEBLList.cpp.

{
   //v[1] should be a list
     PList * plist = v.GetComplexData()->GetList();
 
     Variant v1 = plist->First();// plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Last(<list>)]:  ");
 
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    return Variant(myList->Last());
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Last(), and PEAT_LIST.

Length()

Variant PEBLList::Length

(

Variant

v

)

This returns the number of items in the list.

Definition at line 492 of file PEBLList.cpp.

{
 
    PList * plist = v.GetComplexData()->GetList();
 
    //v[1] should be a list
    Variant v1 = plist->First();// plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Length(<list>)]:  ");
 
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
    return Variant((long unsigned int)(myList->Length()));
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Length(), and PEAT_LIST.

List()

Variant PEBLList::List

(

Variant

v

)

This creates a list functionally, rather than syntactically using the [] operators.

Definition at line 121 of file PEBLList.cpp.

{
    return v;
}

ListToString()

Variant PEBLList::ListToString

(

Variant

v

)

Definition at line 1024 of file PEBLList.cpp.

{
 
   //v[1] should be a list.  Just extract the iterators.
    PList * plist = v.GetComplexData()->GetList();
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [ListToString(<list>, <sep>, <pre>, <post>)]:  ");
 
 
    PList * tmpList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    vector<Variant>::iterator pstart = tmpList->Begin();
    vector<Variant>::iterator p;
    vector<Variant>::iterator pend   = tmpList->End();
 
     Variant sep1 = "";
     Variant pre = "";
     Variant post = "";
 
 
    if(plist->Length()>=2) sep1 = plist->Nth(2);
    if(plist->Length()>=3) pre = plist->Nth(3);
    if(plist->Length()>=4) post = plist->Nth(4);
 
    //cout << "processing List to string: " << sep1 << "|" << pre <<"|" << post << "|" << endl;
     Variant out="";
     Variant sep = "";
     p = pstart;
     while(p!=pend)
     {
 
         out = out + sep + pre+ Variant(*p) + post;
 
          if(p == pstart)
              sep =sep1;
 
              p++;
     }
  return out;
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Length(), PList::Nth(), and PEAT_LIST.

MakeMap()

Variant PEBLList::MakeMap

(

Variant

v

)

Definition at line 842 of file PEBLList.cpp.

{
   //v[1] should be a list
    /*    counted_ptr<PList> plist = (v.GetComplexData())->GetList();
    Variant v1 = plist->First(); plist->PopFront();
    counted_ptr<PList> myList = v1.GetComplexData()->GetList();
    */
    PError::SignalFatalError("Function [MakeMap] not implemented");
    return Variant(true);
}

References PError::SignalFatalError().

Merge()

Variant PEBLList::Merge

(

Variant

v

)

This takes two lists and returns a single list

Definition at line 608 of file PEBLList.cpp.

{
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First();// plist->PopFront();
    //v[1] should be a list.  Just extract the iterators.
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [Merge(<list>, <list>)]:  ");
    PList * tmpList = (PList*)(v1.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p1start = tmpList->Begin();
    vector<Variant>::iterator p1 = p1start;
    vector<Variant>::iterator p1end = tmpList->End();
 
 
 
    Variant v2 = plist->Nth(2);// plist->PopFront();
    //v[1] should be a list.  Just extract the iterators.
    PError::AssertType(v2, PEAT_LIST, "Argument error in second parameter of function [Merge(<list>, <list>)]:  ");
 
    tmpList =  (PList*)(v2.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p2start = tmpList->Begin();
    vector<Variant>::iterator p2 = p2start;
    vector<Variant>::iterator p2end   = tmpList->End();
 
    //There are now 2 list iterators: p1 and p2, and two ends to compare them to,
    //and an iterator to the p2start for resetting.
    //Make a new list to return.
 
    PList * returnList = new PList();
 
    Variant tmpVariant;
 
    //Add the first list.
    while(p1 != p1end)
        {
            returnList->PushBack(*p1);
            p1++;
        }
 
    //Add the second list.
    while (p2 != p2end)
        {
            returnList->PushBack(*p2);
            p2++;
        }
 
    counted_ptr<PEBLObjectBase> tmpObj = counted_ptr<PEBLObjectBase>(returnList);
    PComplexData * tmpPCD= (new PComplexData(tmpObj));
 
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
 
 
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), NULL, PEAT_LIST, and PList::PushBack().

ModList()

Variant PEBLList::ModList

(

Variant

v

)

Definition at line 1067 of file PEBLList.cpp.

{
   //v[1] should be a list.  Just extract the iterators.
    PList * plist = v.GetComplexData()->GetList();
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [ModList(<list>, <pre>, <post>)]:  ");
 
 
    PList * tmpList = (PList*)(v1.GetComplexData()->GetObject().get());
    PList * newList = new PList(*tmpList);
 
    vector<Variant>::iterator pstart = newList->Begin();
    vector<Variant>::iterator p;
    vector<Variant>::iterator pend   = newList->End();
 
     Variant pre = "";
     Variant post = "";
 
 
    if(plist->Length()>=2) pre = plist->Nth(2);
    if(plist->Length()>=3) post = plist->Nth(3);
 
     p = pstart;
     while(p!=pend)
     {
          *p = (pre + *p + post);
           p++;
     }
    counted_ptr<PEBLObjectBase> newList2 = counted_ptr<PEBLObjectBase>(newList);
 
    PComplexData * PCD =(new PComplexData(newList2));
    Variant tmp = Variant(PCD);
    delete PCD;
    PCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Length(), PList::Nth(), NULL, and PEAT_LIST.

Nth()

Variant PEBLList::Nth

(

Variant

v

)

Definition at line 576 of file PEBLList.cpp.

{
    PList * plist = v.GetComplexData()->GetList();
 
 
    //v[1] should be a list
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [Nth(<list>, <integer>)]:  ");
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    //v[2] should be an integer
    PError::AssertType(plist->Nth(2), PEAT_INTEGER, "Argument error in second parameter of function [Nth(<list>, <integer>)]:  ");
    int n = plist->Nth(2);// plist->PopFront();
    return Variant(myList->Nth(n));
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), PEAT_INTEGER, and PEAT_LIST.

PushOnEnd()

Variant PEBLList::PushOnEnd

(

Variant

v

)

Given Merge([a,b,c],d), will return [a,b,c,d].

Definition at line 734 of file PEBLList.cpp.

{
 
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First(); //plist->PopFront();
    //v[1] should be a list.  Just extract the iterators.
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [PushOnEnd(<list>, <listitem>)]:  ");
 
    //Get the list object, and iterators to it:
    PList * tmpList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    //Get the other object:
    Variant v2 = plist->Nth(2);// plist->PopFront();
    //v[2] can be anything.
 
    tmpList->PushBack(v2);
    //v should still contain the list, so return it now.
    return v1;
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), PEAT_LIST, and PList::PushBack().

Remove()

Variant PEBLList::Remove

(

Variant

v

)

Definition at line 1016 of file PEBLList.cpp.

{
 
    PError::SignalFatalError("Function [Remove] not implemented");
    return Variant(1);
}

References PError::SignalFatalError().

RemoveDuplicates()

Variant PEBLList::RemoveDuplicates

(

Variant

v

)

Definition at line 831 of file PEBLList.cpp.

{
   //v[1] should be a list
    /*    counted_ptr<PList> plist = (v.GetComplexData())->GetList();
    Variant v1 = plist->First(); plist->PopFront();
    counted_ptr<PList> myList = v1.GetComplexData()->GetList();
    */
    PError::SignalFatalError("Function [RemoveDuplicates] not implemented");
    return Variant(true);
}

References PError::SignalFatalError().

Repeat()

Variant PEBLList::Repeat

(

Variant

v

)

Repeat(value, number) This function returns a list with

repeated <number> times The expression is evaluated before it is repeated.

Definition at line 90 of file PEBLList.cpp.

{
   //v is a list; v[1] is the object to repeat (can be anything)
    PList * plist = v.GetComplexData()->GetList();
    Variant v1 = plist->First(); //plist->PopFront();
 
 
    //v[2] is the number of repeats: should be a number (will be rounded to integer if needed).
    PError::AssertType(plist->Nth(2), PEAT_NUMBER, "Argument error in second parameter of function [Repeat(<object>,<number>)]:  ");
 
    Variant numVar = plist->Nth(2);
    pDouble numDouble = numVar;  // Use pDouble type to avoid ambiguity
    int number = (int)round(numDouble);// Round to nearest integer to handle JSON floats
 
 
    PList * returnList = new PList();
    for(int i=0;i<number;i++)
        {
            returnList->PushBack(v1);
        }
 
    counted_ptr<PEBLObjectBase> tmplist = counted_ptr<PEBLObjectBase>(returnList);
    PComplexData * tmpPCD= (new PComplexData(tmplist));
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::First(), Variant::GetComplexData(), PComplexData::GetList(), PList::Nth(), NULL, pDouble, PEAT_NUMBER, and PList::PushBack().

RepeatExpression()

Variant PEBLList::RepeatExpression

(

Variant

v

)

RepeatExpression(<name_of_function>, <list_of_parameters>, <number>) This function returns a list <number> long that is produced by the return value of <name_of_function>, evaluated with <list_of_parameters> as parameters. <name_of_function> can be either a standard library function or a user-defined function. This is most useful for generating randomized values, but can also be used to created complex designs by storing global variables.

Definition at line 265 of file PEBLList.cpp.

{
   //v[1] should be a list
    /*   counted_ptr<PList> plist = (v.GetComplexData())->GetList();
         Variant v1 = plist->First(); plist->PopFront();
         counted_ptr<PList> myList = v1.GetComplexData()->GetList();
    */
 
    PError::SignalFatalError("Function [RepeatExpression] not implemented");
    return Variant(true);
}

References PError::SignalFatalError().

RepeatList()

Variant PEBLList::RepeatList

(

Variant

v

)

RepeatList(list, n) This creates a new list consisting of the original list repeated n times.

Definition at line 130 of file PEBLList.cpp.

{
   //v[1] should be a list.  Just extract the iterators.
    PList * plist = v.GetComplexData()->GetList();
 
 
 
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [RepeatList(<list>, <int>)]:  ");
 
    PList * arglist = (PList*)(v1.GetComplexData()->GetObject().get());
    vector<Variant>::iterator p;
    vector<Variant>::iterator pstart = arglist->Begin();
    vector<Variant>::iterator pend   = arglist->End();
 
 
    //v[2] is the number of repeats: should be a number (will be rounded to integer if needed).
    PError::AssertType(plist->Nth(2), PEAT_NUMBER, "Argument error in second parameter of function [RepeatList(<list>, <number>)]:  ");
    Variant numVar = plist->Nth(2);
    pDouble numDouble = numVar;  // Use pDouble type to avoid ambiguity
    int number = (int)round(numDouble);// Round to nearest integer to handle JSON floats
 
 
    //There is now an iterator p, and and end to compare it to, and
    //an iterator to the pstart for resetting.
    //Make a new list to return.
 
    PList * returnList = new PList();
 
    for(int i=0; i<number; i++)
        {
            p=pstart;
            while (p != pend)
                {
                    returnList->PushBack(*p);
                    p++;
                }
        }
 
    counted_ptr<PEBLObjectBase> tmp2 = counted_ptr<PEBLObjectBase>(returnList);
    PComplexData * tmpPCD= (new PComplexData(tmp2));
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
 
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), NULL, pDouble, PEAT_LIST, PEAT_NUMBER, and PList::PushBack().

Rotate()

Variant PEBLList::Rotate

(

Variant

v

)

Definition at line 417 of file PEBLList.cpp.

{
    //v[1] should be a list.  Just extract the iterators.
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [Rotate(<list>, <n>)]:  ");
 
    Variant v2 = plist->Nth(2);// plist->PopFront();
    PError::AssertType(v2, PEAT_INTEGER, "Argument error in second parameter of function [Rotate(<list>, <n>)]:  ");
 
 
    PList * arglist = v1.GetComplexData()->GetList();
 
    vector<Variant>::iterator pi = arglist->Begin();
    vector<Variant>::iterator pStart = pi;
    vector<Variant>::iterator pListStart = pi;
    vector<Variant>::iterator pEnd = arglist->End();
 
 
    //startpoint is the 0-based index of which item to start the new list with.
    int rotation = (int)v2;
    
    long int length =  arglist->Length();
 
    //We need to find a startpoint as a positive number between 0 and length.
    //The normal % and mod functions will not produce this.
 
    int rem1 = rotation % length;
 
    if(rem1<0)
        {
            rem1 = rem1 + (length);
        }
    pListStart += (rem1);
 
 
    
    //Make a new list, starting with pListStart, and moving to
    //the end, and then attaching pStart to pListStart.
    
    PList * returnList = new PList();
    counted_ptr<PEBLObjectBase> tmpObj;
    Variant tmpVariant;
    
    //Adjust the iterator to the start of the list.
    pi=pListStart;
    while(pi != pEnd)
        {
            
            //Put the item on the list
            returnList->PushBack(*pi);
            pi++;
        }
    
    pi=pStart;
    while(pi != pListStart)
        {
            
            //Put the item on the list
            returnList->PushBack(*pi);
            pi++;
        }
    
    tmpObj = counted_ptr<PEBLObjectBase>(returnList);
    PComplexData * tmpPCD= (new PComplexData(tmpObj));
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
    
    
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), Variant::GetComplexData(), PComplexData::GetList(), PList::Length(), PList::Nth(), NULL, PEAT_INTEGER, PEAT_LIST, and PList::PushBack().

Second()

Variant PEBLList::Second

(

Variant

v

)

Definition at line 521 of file PEBLList.cpp.

{
   //v[1] should be a list
 
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First();// plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Second(<list>)]:  ");
 
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
    return myList->Nth(2);
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), and PEAT_LIST.

Sequence()

Variant PEBLList::Sequence

(

Variant

v

)

Sequence constructs a sequence of numbers between the low and high, with step-size increments between. Attempts to stay in integers when the low and step are integers.

Definition at line 185 of file PEBLList.cpp.

{
    //v is a list; v[1] is the bottom of the sequence
     PList * plist = v.GetComplexData()->GetList();
 
    PError::AssertType(plist->First(), PEAT_NUMBER, "Argument error in first parameter of function [Sequence(<first>, <last>, <step>)]");
    Variant start = plist->First();// plist->PopFront();
 
    //v[2] is the last number in the sequence
    PError::AssertType(plist->Nth(2), PEAT_NUMBER, "Argument error in second parameter of function [Sequence(<first>, <last>, <step>)]:  ");
    Variant end = plist->Nth(2);// plist->PopFront();
 
    //v[3] is the increment step of the sequence.
    PError::AssertType(plist->Nth(3), PEAT_NUMBER, "Argument error in second parameter of function [Sequence(<first>, <last>, <step>)]:  ");
    Variant step = plist->Nth(3);// plist->PopFront();
 
 
    //Make sure that the step is not equal to 0--we will never end if it is.
    if(step == Variant(0))
        {
            PError::SignalFatalError("Step size in Sequence(<start>, <end>, <step>) is 0.");
        }
 
    Variant tolerance = .00000001;
 
    PList * returnList = new PList();
    //returnList->Clear();
 
    Variant current;
 
    //We need to operate differently if step is positive vs. negative.
 
    if(step > Variant(0))
        {
            //If step is positive, end better be greater than start.
            if(end < start)
                {
                    PError::SignalFatalError("For positive <step>s, <end> must be greater than <start> in [Sequence(<start>, <end>, <step>)]");
                }
 
            //Step is positive, continue while less-than end
            for(current = start; current <= end + tolerance; current = current + step)
                {
                    returnList->PushBack(current);
                }
        }
    else
        {
            //If step is negative, end better be smaller than start.
            if(end > start)
                {
                    PError::SignalFatalError("For negative <step>s, <end> must be less than <start> in [Sequence(<start>, <end>, <step>)]");
                }
 
            //Step is negative, continue while greater-than end.
            for(current = start; current >= end - tolerance ; current = current + step)
                {
                    returnList->PushBack(current);
                }
        }
 
    counted_ptr<PEBLObjectBase> tmp2 = counted_ptr<PEBLObjectBase>(returnList);
    PComplexData * tmpPCD= (new PComplexData(tmp2));
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
 
}

References PError::AssertType(), PList::First(), Variant::GetComplexData(), PComplexData::GetList(), PList::Nth(), NULL, PEAT_NUMBER, PList::PushBack(), and PError::SignalFatalError().

SetElement()

Variant PEBLList::SetElement

(

Variant

v

)

Definition at line 710 of file PEBLList.cpp.

{
    PList * plist = v.GetComplexData()->GetList();
    Variant v1 = plist->First();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [SetElement(<list>,<index>,<listitem>)]:  ");
 
 
    Variant v2 = plist->Nth(2);
    PError::AssertType(v2, PEAT_INTEGER, "Argument error in second parameter of function [SetElement(<list>,<index>,<listitem>)]:  ");
 
 
    Variant v3 = plist->Nth(3);
    //No need to check v3 for type.
 
    PList * pl = v1.GetComplexData()->GetList();
    pl->SetElement((int)v2,v3);
 
    return Variant(true);
}

References PError::AssertType(), PList::First(), Variant::GetComplexData(), PComplexData::GetList(), PList::Nth(), PEAT_INTEGER, PEAT_LIST, and PList::SetElement().

Shuffle()

Variant PEBLList::Shuffle

(

Variant

v

)

Definition at line 53 of file PEBLList.cpp.

{
    //v is a list.  v[1] should be have a list in it.
     PList * plist = v.GetComplexData()->GetList();
 
     Variant v1 = plist->First(); //plist->PopFront();
 
    //v1 should be a list.
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Shuffled(<list>)]:  ");
 
 
    PList * dataList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    //Now, make a keylist of random numbers, the length of datalist.
    PList keyList;// = PList();
 
    for(unsigned int i = 0; i < dataList->Length(); i++)
        {
            keyList.PushBack(RandomUniform());
        }
 
 
    //Now, sort by the key list
    counted_ptr<PEBLObjectBase> newList = dataList->SortBy(keyList);
    PComplexData * PCD =(new PComplexData(newList));
 
    Variant tmp = Variant(PCD);
    delete PCD;
    PCD=NULL;
    return tmp;
 
  }

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Length(), NULL, PEAT_LIST, PList::PushBack(), and PList::SortBy().

Sort()

Variant PEBLList::Sort

(

Variant

v

)

This just sorts the list.

Definition at line 759 of file PEBLList.cpp.

{
   //v[1] should be a list
    PList * plist = v.GetComplexData()->GetList();
 
 
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Sort(<list>)]:  ");
 
    PList * dataList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    counted_ptr<PEBLObjectBase> newList = dataList->SortBy(*dataList);
    PComplexData * PCD = (new PComplexData(newList));
    Variant tmp = Variant(PCD);
    delete PCD;
    PCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), NULL, PEAT_LIST, and PList::SortBy().

SortBy()

Variant PEBLList::SortBy

(

Variant

v

)

This sorts the list by another list.

Definition at line 781 of file PEBLList.cpp.

{
    //v[1] should be a list
     PList * plist = v.GetComplexData()->GetList();
 
     Variant v1 = plist->First();// plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [SortBy(<list>, <list>)]:  ");
 
    PList * dataList = (PList*)(v1.GetComplexData()->GetObject().get());
 
    //v[2] should be the keys which the list should be sorted by.
    Variant v2 = plist->Nth(2);// plist->PopFront();
    PError::AssertType(v2, PEAT_LIST, "Argument error in second parameter of function [SortBy(<list>, <list>)]:  ");
    PList * keyList = (PList*)(v2.GetComplexData()->GetObject().get());
 
    counted_ptr<PEBLObjectBase> newList = dataList->SortBy(*keyList);
    PComplexData * PCD = ( new PComplexData(newList));
    Variant tmp = Variant(PCD);
    delete PCD;
    PCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), NULL, PEAT_LIST, and PList::SortBy().

SubList()

Variant PEBLList::SubList

(

Variant

v

)

This makes a list out of a sublist of a list. Or something like that.

Definition at line 940 of file PEBLList.cpp.

{
 
  //v[1] should be a list.  Just extract the iterators.
    PList * plist = v.GetComplexData()->GetList();
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in first parameter of function [SubList(<list>, <int>, <int>)]:  ");
 
    PList * tmpList = (PList*)(v1.GetComplexData()->GetObject().get());
    vector<Variant>::iterator pstart = tmpList->Begin();
    vector<Variant>::iterator p;
    vector<Variant>::iterator pend   = tmpList->End();
 
 
    PError::AssertType(plist->Nth(2), PEAT_INTEGER, "Argument error in second parameter of function [SubList(<list>, <int>, <int>)]:  ");
    int start = plist->Nth(2); //plist->PopFront();
 
    PError::AssertType(plist->Nth(3), PEAT_INTEGER, "Argument error in third  parameter of function [SubList(<list>, <int>, <int>)]:  ");
    int end   = plist->Nth(3); //plist->PopFront();
 
 
    //Check to see if everything is in bounds.
    if(start < 1
       || end > (int)(tmpList->Length())
       || start > end )
        {
            Variant message;
            message =   Variant("[SubList] tried to extract items ")+
                Variant((int)start)+ Variant(" to ") + Variant((int)end) +
                Variant(" of a ")  + Variant((int)(tmpList->Length())) + Variant( " item list.");
 
            PError::SignalFatalError(message);
        }
 
 
 
    //There is now an iterator p, and an end to compare it to, and
    //an iterator to the pstart for resetting.
    //Make a new list to return.
 
    PList * returnList = new PList();
    Variant tmpVariant;
    counted_ptr<PEBLObjectBase> tmpObj;
    //Start at the beginning of the list. Keep count; if the count is
    //between the two boundaries, add it to the list.
    p=pstart;
    int i = 0;
    while (p != pend)
        {
            i++;
            //If i is big enough, consider adding it to the list
            if(i>=start)
                {
                if( i <=end)  //But only if it isn't too big
                    {
                        returnList->PushBack(*p);
                    }
                else         //If it is too big, get out of the while loop.
                    {
                        break;
                    }
                }
            p++;
        }
    tmpObj = counted_ptr<PEBLObjectBase>(returnList);
    PComplexData * tmpPCD = (new PComplexData(tmpObj));
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
    return tmp;
 
}

References PError::AssertType(), PList::Begin(), PList::End(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Length(), PList::Nth(), NULL, PEAT_INTEGER, PEAT_LIST, PList::PushBack(), and PError::SignalFatalError().

Third()

Variant PEBLList::Third

(

Variant

v

)

Definition at line 534 of file PEBLList.cpp.

{
   //v[1] should be a list
 
    PList * plist = v.GetComplexData()->GetList();
 
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Second(<list>)]:  ");
 
    PList * myList = (PList*)(v1.GetComplexData()->GetObject().get());
    //vector<Variant>::iterator p = myList->Begin();
    return myList->Nth(3);
}

References PError::AssertType(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Nth(), and PEAT_LIST.

Transpose()

Variant PEBLList::Transpose

(

Variant

v

)

v[1] MUST be a list of lists, and each of the sub-lists must be of the same length.

Definition at line 859 of file PEBLList.cpp.

{
   //v[1] should be a list
    PList * plist = v.GetComplexData()->GetList();
    Variant v1 = plist->First(); //plist->PopFront();
    PError::AssertType(v1, PEAT_LIST, "Argument error in function [Transpose(<list-of-lists>)]:  ");
 
    PList * tmpList = (PList*)(v1.GetComplexData()->GetObject().get());
    vector<Variant>::iterator pstart = tmpList->Begin();
    vector<Variant>::iterator p;
//    vector<Variant>::iterator pend   = tmpList->End();
 
    unsigned long int outerLength = tmpList->Length();
    unsigned long int innerLength=0;
 
    //Create a vector of iterators to elements of each sublist.
    std::vector<vector<Variant>::iterator> listIterators(outerLength,pstart);
 
    p = pstart;
 
    for(unsigned int j = 0; j < outerLength; j++)
        {
            PError::AssertType(*p, PEAT_LIST, "Every item in Transpose(<list-of-lists>) must be a list. ");
 
            tmpList =  (PList*)((*p).GetComplexData()->GetObject().get());
            if(j == 0)
                {
                    innerLength = tmpList->Length();
                }
            else
                {
                    if(tmpList->Length() != innerLength)
                        {
                            PError::SignalFatalError("All sublists must be of the same length in Transpose(<list-of-lists>).");
                        }
                }
 
            //assign the iterator to the first element of the sublist.
            listIterators[j] = tmpList->Begin();
            p++;
        }
 
 
    //Now, everything is in the clear, so transpose.
 
    PComplexData * tmpPCD;
    PList * returnList = new PList;
    Variant tmpVariant;
    counted_ptr<PEBLObjectBase>  tmpObj;
 
 
    for(unsigned int i = 0; i < innerLength; i++)
        {
            tmpList = new PList();
 
            for(unsigned int j = 0; j < outerLength; j++)
                {
                    tmpList->PushBack(*listIterators[j]); //Grab the item from the list
                    listIterators[j]++;                   //iterate
                }
            //The first item of each list has been added to tmpList, so add
            //it to returnList.
            tmpObj = counted_ptr<PEBLObjectBase>(tmpList);
            tmpPCD = (new PComplexData(tmpObj));
            tmpVariant = Variant(tmpPCD);
            returnList->PushBack(tmpVariant);
            delete tmpPCD;
            tmpPCD=NULL;
        }
 
    tmpObj = counted_ptr<PEBLObjectBase>(returnList);
    tmpPCD= (new PComplexData(tmpObj));
 
    Variant tmp = Variant(tmpPCD);
    delete tmpPCD;
    tmpPCD=NULL;
 
    return tmp;
}

References PError::AssertType(), PList::Begin(), PList::First(), counted_ptr< X >::get(), Variant::GetComplexData(), PComplexData::GetList(), PComplexData::GetObject(), PList::Length(), NULL, PEAT_LIST, PList::PushBack(), and PError::SignalFatalError().

Variable Documentation

FunctionTable

PEBL_Function_Type PEBLList::FunctionTable[]

Definition at line 420 of file Functions.h.

        {
 
            {(char*)"SHUFFLE",                   Shuffle, 1, 1},
            {(char*)"REPEAT",                    Repeat,    2, 2},
            {(char*)"REPEATLIST",                RepeatList,2, 2},
            {(char*)"SEQUENCE",                  Sequence,  3, 3},
            {(char*)"DESIGNFULLCOUNTERBALANCE",   DesignFullCounterbalance, 2, 2},
            {(char*)"CROSSFACTORWITHOUTDUPLICATES", CrossFactorWithoutDuplicates, 1, 1},
            {(char*)"ROTATE",                    Rotate,  2, 2},
            {(char*)"LENGTH",                    Length, 1, 1},
            {(char*)"FIRST",                     First, 1, 1},
            {(char*)"SECOND",                    Second, 1, 1},
            {(char*)"THIRD",                     Third, 1, 1},
            {(char*)"FOURTH",                    Fourth, 1, 1},
            {(char*)"FIFTH",                     Fifth, 1, 1},
            {(char*)"MERGE",                     Merge, 2, 2},
            {(char*)"LIST",                      List,  1, 1000},
            {(char*)"APPEND",                    Append, 2, 2},
            {(char*)"PUSHONEND",                 PushOnEnd, 2, 2},
            {(char*)"SETELEMENT",                SetElement, 3, 3},
            {(char*)"SORT",                      Sort, 1, 1},
            {(char*)"SORTBY",                    SortBy, 2, 2},
            {(char*)"NTH",                       Nth, 2, 2},
            {(char*)"LAST",                      Last, 1, 1},
            {(char*)"ISMEMBER",                  IsMember, 2, 2},
            {(char*)"REMOVEDUPLICATES",          RemoveDuplicates, 1, 1},
            {(char*)"MAKEMAP",                   MakeMap, 2, 2},
            {(char*)"TRANSPOSE",                 Transpose,  1, 1},
            {(char*)"SUBLIST",                   SubList, 3, 3},
 
            {(char*)"REMOVE",                    Remove, 2, 2},
            {(char*)"LISTTOSTRING",              ListToString,1,4},
            {(char*)"MODLIST",                   ModList,1,3},
            {0,            0,  0, 0}
        };

Referenced by Loader::LoadLibraryFunctions().