BigDataOperations/list_node.h at master · OvenVan/BigDataOperations · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
//2017.11.17
//严恩伟
//2017.12.05
#ifndef _LIST_NODE_
#define _LIST_NODE_
#include <iostream>
#include <string>
#include <time.h>
using namespace std;

extern double TIME_BREAK;
typedef struct num_pack_s num_pack_t;

class list_node
{
  private:
	char data;
	list_node *prev; //prev，上一个指针
	list_node *aftr; //aftr ，下一个指针，堆对象，需要删除
	pair<char, char> operator_bit(char c1, char c2, char bit_operator);
	/*
	list_node* estimated(list_node* number, list_node* opd_number);
	*/
	pair<char, list_node *> estimatedv2(list_node *number, num_pack_t *numberpack);
	list_node *sublist(list_node *begins, list_node *ends); //create a new list with sublist
	friend int rtn_length(list_node *p);
	bool is_zero();
	//void set_data(const char &data);
	//void set_prev(const list_node* p);
	//void set_aftr(const list_node* p);
	list_node(){};
	//~list_node(){};

  public:
	//-------construct and destruct class-------//
	friend list_node *create_list();				  //default ctor, return by header.
	friend list_node *create_list(const string str);  //ctor.
	friend list_node *create_list(list_node *header); //copy ctor, return by header.
	list_node *destructor();						  //dtor, delete all pointer

	//-------get private data/pointer------//
	int get_data() const;
	list_node *get_prev() const;
	list_node *get_aftr() const;

	//-------Insert/Delete Item---------------//
	void InsertItem(const char item, list_node *p); //insert an item after pointer
	list_node *DeleteItem(list_node *p);			//delete the item,return a pointer after the item
	void push_back(const char item);				//insert an item at the back of the list
	void pop_back();								//delete the final item

	//-------Operator-------------------------//
	list_node *operator=(list_node data);
	list_node *operator=(string str);
	list_node *operator+(list_node &data);
	pair<bool, list_node *> operator-(list_node &data); //when the number is negtive , bool = false;
	list_node *operator*(list_node &data);
	list_node *operator/(list_node &data);
	list_node *operator%(list_node &modulus);
	list_node *operator^(int power);
	bool operator==(list_node &data);
	pair<list_node *, list_node *> d_m(list_node *opt);

	//-------Compare--------------------------//
	friend int compare(list_node *data1, list_node *data2);

	//-------Print------------------------------//
	friend string printl(list_node *list);
	friend string printl(pair<bool, list_node *>);

	//-------Guardian--------------------//
	void replaceGuardian(list_node *&newGuardian);
	void addGuardian(list_node *&newGuardian);
};
list_node *create_list();
list_node *create_list(const string str);
list_node *create_list(list_node *header);
int compare(list_node *data1, list_node *data2);
string printl(list_node *list);
string printl(pair<bool, list_node *>); //print negitive number
int rtn_length(list_node *p);

void init_pack(num_pack_t *numpack, list_node *num);
void rm_pack(num_pack_t *numpack);
#endif