Treceți la conținutul principal

tpoint cpp

#include <iostream.h>

class Point
{
friend ostream& operator << (ostream& output, Point p);
protected:
unsigned x, y;

public:
Point()
{
x = 0;
y = 0;
}
Point(unsigned X, unsigned Y)
{
x = X;
y = Y;
}
~Point() {}
unsigned GetX()
{
return x;
}
unsigned GetY()
{
return y;
}
void SetX(unsigned X)
{
x = X;
}
void SetY(unsigned Y)
{
y = Y;
}
};

ostream& operator << (ostream& output, Point p)
{
output << "(" << p.x << ", " << p.y << ")";
return output;
}

template <class T> class Item {
public:
Item *Next;
T *Data;
Item(T __Data, Item <T> *__Next)
{
Data = new T(__Data);
Next = __Next;
}
};

template <class T> class List {
public:
T pop_front()
{
T result = *(Data->Data);
Item <T> *temp = Data;
Data = Data->Next;
delete temp;
return result;
}
T front()
{
return *(Data->Data);
}
void push_front(T __Data)
{
Data = new Item <T>(__Data, Data);
}
int empty()
{
return Data == 0;
}
List()
{
Data = 0;
}
class Iterator {
friend class List <T>;
protected:
Item <T> *Current;
Iterator(Item <T> *x)
{
Current = x;
}
public:
Iterator() {}
int operator == (Iterator& x)
{
return Current == x.Current;
}
int operator != (Iterator& x)
{
return Current != x.Current;
}
T operator *()
{
return *(Current->Data);
}
Iterator& operator ++(int)
{
Current = Current->Next;
return *this;
}
};
Iterator begin()
{
return Iterator(Data);
}
Iterator end()
{
Item <T> *temp;
for(temp = Data; temp; temp = temp->Next);
return Iterator(temp);
}
private:
Item <T> *Data;
};

main()
{
List <Point> anPointList;
List <Point>::Iterator index, end;
anPointList.push_front(Point(1, 1));
anPointList.push_front(Point(3, 14));
index = anPointList.begin();
end = anPointList.end();
if(anPointList.empty())
cout << "Lista vida" << endl;
else
for(; index != end; index++)
cout << *index << " ";
cout << endl;
}

Comentarii

Postări populare de pe acest blog

program principal cpp

#include "clasa.h" #include <stdio.h> #include <conio.h> #include <stdlib.h> #include <string.h> #define DELAY 9000000 void delay() { for(long i=0;i<DELAY;i++); } //constructor cu initializare de la tastatura BigInt::BigInt() {char x; signed char t[400]; int i; printf("\nNumarul cu semn "); do s=getche(); while((s!='+')&&(s!='-')); n=0; do {x=getche(); t[n]=x-'0'; n++; } while((x>='0')&&(x<='9')); n--; for(i=0;i<n;i++) nr[i]=t[n-i-1]; } //constructor cu initializare prin parametri BigInt::BigInt(char semn,signed char numar[],int dim) {int i; s=semn; n=dim; for(i=0;i<n;i++) nr[i]=numar[n-i-1]; } //transform un int negativ in pozitiv int BigInt::Pozitiv(int x) {int a,vb; a=0; vb=0; while(vb==0) if((x+a)==0) vb=1; else a=a+1; x=a; return x; } //constructor dintr-un nr int obisnuit BigInt::BigInt(int x) {int i; if(x>=0) s='+'…

NUMERE PRIME ALGORITM C++

// NUMERE PRIME ALGORITM C++//  reediting from scratch //on this page is just the study for a next algoritm for generating the parime nr series like Fibonnaci or ....if possibile

74111121313417374414124343447 if u know the red part you can generate the orange part
1 0 1 111112222 1 1 23

o aplicatie php localitati romania

//APLICATIA SE REFERA LA BAZA DE DATE SIRUTA

//dragtable.js


/* dragtable v1.0 June 26, 2008 Dan Vanderkam, http://danvk.org/dragtable/ http://code.google.com/p/dragtable/ \Bsortabledraggable\B Instructions: - Download this file - Add <script src="dragtable.js"></script> to your HTML. - Add class="draggable" to any table you might like to reorder. - Drag the headers around to reorder them. This is code was based on: - Stuart Langridge's SortTable (kryogenix.org/code/browser/sorttable) - Mike Hall's draggable class (http://www.brainjar.com/dhtml/drag/) - A discussion of permuting table columns on comp.lang.javascript Licensed under the MIT license. */ // Here's the notice from Mike Hall's draggable script: //***************************************************************************** // Do not remove this notice. // // Copyright 2001 by Mike Hall. // See http…