Iterator(3U) InterViews Reference Manual Iterator(3U)NAME
Iterator - marks a position in a data structure
SYNOPSIS
#include <Unidraw/iterator.h>
DESCRIPTION
An iterator marks a position in a data structure, generally during a traversal of some sort. For example, an iterator keeps track of the
current position when iterating through a list of elements. Unidraw's Iterator class serves this purpose in conjunction with ULists or
objects that use them.
PUBLIC OPERATIONS
Iterator()
Iterator(Iterator&)
Construct a new iterator. The second constructor initializes the iterator's value to that of the given iterator.
virtual void SetValue(void*)
virtual void* GetValue()
Classes that use an iterator must store position information in it. These operations set and get the this information.
SEE ALSO UList(3U)Unidraw 11 June 1990 Iterator(3U)
Check Out this Related Man Page
MacroCmd(3U) InterViews Reference Manual MacroCmd(3U)NAME
MacroCmd - a command that composes other commands
SYNOPSIS
#include <Unidraw/Commands/macro.h>
DESCRIPTION
MacroCmd composes other commands in a linear fashion. Executing a MacroCmd is equivalent to executing its children in preorder.
PUBLIC OPERATIONS
MacroCmd(ControlInfo*)
MacroCmd(
Editor* = nil,
Command* first = nil, Command* second = nil,
Command* third = nil, Command* fourth = nil
)
Construct a MacroCmd instance, optionally supplying up to four of its child commands.
virtual void Execute()
virtual void Unexecute()
virtual boolean Reversible()
Execute simply executes each child, from first to last. Unexecute calls Unexecute on each child, from last to first. The MacroCmd
is reversible if any of its children are.
virtual void SetEditor(Editor*)
SetEditor calls SetEditor on each child with the given argument.
Command* GetCommand(Iterator)
void SetCommand(Command*, Iterator&)
GetCommand returns the child Command to which an iterator points. SetCommand initializes the iterator to point to a particular
child Command; it initializes the iterator to point to a nil instance if the given Command is not a child.
void Append(
Command*, Command* = nil, Command* = nil, Command* = nil
)
void Prepend(
Command*, Command* = nil, Command* = nil, Command* = nil
)
void InsertAfter(Iterator, Command*)
void InsertBefore(Iterator, Command*)
void Remove(Command*)
void Remove(Iterator&)
Operations that modify the MacroCmd's list of children. Append and Prepend add up to four Commands to the end and the beginning of
the list, respectively. InsertAfter and InsertBefore insert a Command after and before the Command pointed to by the iterator,
respectively. The Remove operations remove a child from the list without deleting it. You can remove a child by referring to it
explicitly or by specifying an iterator. If an iterator is supplied, the Remove operation should advance it to point to the follow-
ing child as a side effect.
PROTECTED OPERATIONS
Command* Cmd(UList*)
UList* Elem(Iterator)
Convenience functions for extracting a Command from a UList element a UList from an iterator, respectively.
SEE ALSO Command(3U), Iterator(3U), UList(3U)Unidraw 24 January 1991 MacroCmd(3U)
I have a question about iterators. Here is the code I have
template <typename element>
void merge_sort(vector<element> &v)
{
element::iterator lo;
}
Now thats all the code I have for the non-recursive merge sort at the moment, which obvioulsy isn't a lot, but I need... (0 Replies)
Is is possible to make STL-Iterator to work with user defined class ,like the one below?
#include <iostream>
#include <stdexcept>
using namespace std;
template <class T>
class Array
{
public:
T& operator (unsigned i) throw(out_of_range)
{ return data_; }
protected:
... (2 Replies)
Hi,
I'm having trouble compling the following code in Sun C++ (under sun studio 10). I found that it is issue with libCstd library. It can be resolved if i used stdport lib. However, i have no choice but to use libCstd. Does anyone know what can be done to resolve the issue? :confused:
... (0 Replies)
I am unable to resolve the below code compilation issue:
class A
{
public:
int x;
};
void sort_A(TArray<A> &_Atype)
{
std::stable_sort (_Atype.begin(), _Atype.end());
}
bool operator< (const A & _a1, const A & _a2)
{
return _a1.x < _a2.x;
}
When we compile using gcc 4.1.2... (4 Replies)
I get following compile time errors on HP ITANIUM machine
"/opt/include_std/limit", line 268: error # 2321: data member initializer is not allowed
_RWSTD_STATIC_CONST (bool, is_specialized = false);
"/opt/include_std/rw/iterator", line 119: error # 2247: class template "std::iterator_traits"... (0 Replies)
Okay so I am currently workng on an assignment where I have basically got to create a word ladder, eg. Click, Clock, Flock, Flick, so its a list of words with only 1 letter difference, and the same letters cant be reused. Now I can do 2 methods of doing this, the first (which I need help need help... (2 Replies)
I am trying to reverse complement DNA sequence (string) with a short c++ code using boost library. Code was compiled without any warning/error, but ran into Segmentation fault.
My guess is the function to return a vector, but not sure.
#include <iostream>
#include <fstream>
#include <string>... (14 Replies)