Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "klasa.h"
- #include <stdio.h>
- #include <malloc.h>
- DynArray::DynArray() {
- this->size=0;
- this->number=0;
- this->tab=((int*) malloc ((size)* sizeof(int)));
- }
- DynArray::DynArray(int size,int number) {
- this->size=size;
- this->number=number;
- this->tab=((int*) malloc ((size)* sizeof(int)));
- for(int i=0; i<this->size; i++) {
- this->tab[i]=number;
- }
- }
- DynArray::DynArray(const DynArray&dyn) {
- this->size=dyn.size;
- this->number=dyn.number;
- this->tab=((int*) malloc ((dyn.size)* sizeof(int)));
- for(int i=0; i<dyn.size; i++) {
- this->tab[i]=dyn.tab[i];
- }
- }
- DynArray::~DynArray(){
- printf("D");
- free (tab);
- }
- int DynArray::Size() {
- return this->size;
- }
- void DynArray::Display() {
- if(this->size==0) {
- printf("pusta tablica\n");
- } else {
- printf("[");
- for(int i=0; i<(this->size)-1; i++) {
- printf("%d, ", this->tab[i]);
- }
- printf("%d", this->tab[(this->size)-1]);
- printf("]\n");
- }
- }
- DynArray & DynArray::operator+=(const int a) {
- if (this->size==0) {
- this->size=1;
- tab=((int*) realloc (tab,1* sizeof(int)));
- tab[0]=a;
- }
- else {
- this->size++;
- this->tab=((int*) realloc (tab,(this->size)* sizeof(int)));
- this->tab[(this->size)-1]=a;
- }
- return *this;
- }
- DynArray & DynArray::operator!() {
- if (this->size==0) {
- }
- else {
- for(int i=0; i<this->size; i++) {
- this->tab[i]=(0-(this->tab[i]));
- }
- }
- return *this;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement