对象的单数组表示（用单数组实现链表-不一样的链表实现）

对象的单数组表示

（用单数组实现链表-不一样的链表实现）

#ifndef C11LEARN_SINGULARGROUPSREPRESENTOBJECTS_H
#define C11LEARN_SINGULARGROUPSREPRESENTOBJECTS_H
#include "cmath"
#include "../tools/tool.h"
template<typename T>
class SingularGroupsRepresentObjects
{private:int head;int tail;char * buffer;int capacity;int unit;int size;
public:SingularGroupsRepresentObjects(int capacity = 50);virtual ~SingularGroupsRepresentObjects();SingularGroupsRepresentObjects(const SingularGroupsRepresentObjects<T> & l);const SingularGroupsRepresentObjects<T> & operator=(const SingularGroupsRepresentObjects<T> &l);T operator[](int index) const;T & operator[](int index);void add(T key);int search(const T &key);bool remove(const T &key);bool full();bool empty();int length() const;
};
template<typename T>
SingularGroupsRepresentObjects<T>::SingularGroupsRepresentObjects(int capacity):capacity(capacity){if(this->capacity<50) this->capacity = 50;unit = (sizeof (int))*2 + sizeof(T);buffer = new char [unit*capacity];memset(buffer,0,unit*capacity);head = tail = -1;
}
template<typename T>
SingularGroupsRepresentObjects<T>::~SingularGroupsRepresentObjects(){if(buffer!= nullptr){delete[] buffer;buffer = nullptr;}
}
template<typename T>
SingularGroupsRepresentObjects<T>::SingularGroupsRepresentObjects(const SingularGroupsRepresentObjects<T> & l){capacity = l.capacity;unit = l.unit;buffer = new char [unit*capacity];head = l.head;tail = l.tail;size = l.size;memcpy(buffer,l.buffer,unit*capacity);
}
template<typename T>
const SingularGroupsRepresentObjects<T> & SingularGroupsRepresentObjects<T>::operator=(const SingularGroupsRepresentObjects<T> &l){if(this == &l)return *this;if(buffer!= nullptr){delete[] buffer;}capacity = l.capacity;unit = l.unit;buffer = new char [unit*capacity];head = l.head;tail = l.tail;size = l.size;memcpy(buffer,l.buffer,unit*capacity);return *this;
}
template<typename T>
T SingularGroupsRepresentObjects<T>::operator[](int index) const{if(index<0 || index >= size)throw "out of bound";int current = index;while (current-->0){current = *(int*)(buffer+current*unit+sizeof(int));}return *(T*)(buffer+current*unit+sizeof(int)*2);
}
template<typename T>T & SingularGroupsRepresentObjects<T>::operator[](int index){if(index<0 || index >= size)throw "out of bound";int current = head;while (index-->0){current = *(int*)(buffer+current*unit+sizeof(int));}return *(T*)(buffer+current*unit+sizeof(int)*2);
}
template<typename T>
void SingularGroupsRepresentObjects<T>::add(T key){if(full())return;if(head == -1){int *prev= new (buffer)int;*prev = -1;int *next = new(buffer+sizeof(int))int;*next = -1;T* t = new(buffer+sizeof(int)*2)T;*t=key;size = 1;head = tail = 0;}else{int index = 0;while (index<capacity){if(*(int*)(buffer+index*unit) ==0&& (*(int*)(buffer+index*unit+sizeof(int))) ==0)break;index++;}*(int*)(buffer+tail*unit+sizeof(int)) = index;int *prev = new (buffer+index*unit)int;*prev = tail;int *next = new (buffer+index*unit + sizeof(int))int;*next = -1;T * t = new (buffer+index*unit + sizeof(int)*2)T;*t = key;tail = index;size++;}
}
template<typename T>
int SingularGroupsRepresentObjects<T>::search(const T &key){if(empty()) return -1;int current =  head;while (current!=-1 && *(T*)(buffer + current * unit + sizeof (int)*2) != key){current = *(int*)(buffer+current*unit+sizeof (int));}return current;
}
template<typename T>
bool SingularGroupsRepresentObjects<T>::remove(const T &key){int index = search(key);if(index == -1) return false;int prev = *(int*)(buffer+index*unit);int next = *(int*)(buffer + index * unit + sizeof(int));if(prev == -1){head = next;}else{*(int*)(buffer + prev * unit + sizeof(int)) = next;}if(next == -1){tail = prev;}else{*(int*)(buffer + next * unit) = prev;}memset(buffer+index*unit,0,unit);size--;return true;
}
template<typename T>
bool SingularGroupsRepresentObjects<T>::full(){return size == capacity;
}
template<typename T>
bool SingularGroupsRepresentObjects<T>::empty(){return size == 0;
}
template<typename T>
int SingularGroupsRepresentObjects<T>::length() const{return size;
}
#endif //C11LEARN_SINGULARGROUPSREPRESENTOBJECTS_H

测试代码

     int arr[] = {1, 4, 6, -9, 2, -5, 10, -3, -7,12};int length = sizeof(arr)/sizeof (int);SingularGroupsRepresentObjects<int> singularGroupsRepresentObjects;for (int i = 0; i < length; ++i) {singularGroupsRepresentObjects.add(arr[i]);}for (int i = 0; i < length; ++i) {cout<<singularGroupsRepresentObjects.search(arr[i])<<" ";}cout<<endl;singularGroupsRepresentObjects[9] = 110;for (int i = 0; i < singularGroupsRepresentObjects.length(); ++i) {cout<<singularGroupsRepresentObjects[i]<<" ";}cout<<endl;for (int i = 0; i < length/2; ++i) {cout<<singularGroupsRepresentObjects.remove(arr[i])<<" ";}cout<<endl;for (int i = 0; i < singularGroupsRepresentObjects.length(); ++i) {cout<<singularGroupsRepresentObjects[i]<<" ";}cout<<endl;SingularGroupsRepresentObjects<int> singularGroupsRepresentObjects_b = singularGroupsRepresentObjects;SingularGroupsRepresentObjects<int> singularGroupsRepresentObjects_c;singularGroupsRepresentObjects_c = singularGroupsRepresentObjects_b;for (int i = 0; i < singularGroupsRepresentObjects_b.length(); ++i) {cout<< singularGroupsRepresentObjects_b[i]<<" ";}cout<<endl;for (int i = 0; i < singularGroupsRepresentObjects_c.length(); ++i) {cout<< singularGroupsRepresentObjects_c[i]<<" ";}for (int i = 0; i < singularGroupsRepresentObjects_c.length(); ++i) {singularGroupsRepresentObjects_c[i] = singularGroupsRepresentObjects_c[i] + arr[i];}cout<<endl;for (int i = 0; i < singularGroupsRepresentObjects_c.length(); ++i) {cout<< singularGroupsRepresentObjects_c[i]<<" ";}cout<<endl;

对象的单数组表示（用单数组实现链表-不一样的链表实现）相关推荐

无法为数据库中的对象分配空间，因为'PRIMARY'文件组已满问题处理方式
今天公司同事反馈,在手机APP端进行业务操作时,提示无法为数据库中的对象分配空间,因为'PRIMARY'文件组已满,如下所示. 出现这个问题的原因是数据库中设置了Log日志限制了文件增长.设置如下所示 ...
无法为数据库中的对象分配空间，因为'PRIMARY'文件组已满
用SQL Server2012,做数据保存时出错,错误信息:无法为数据库'***'中的对象'***'分配空间,因为'PRIMARY'文件组已满.请删除不需要的文件.删除文件组中的对象.将其他文件添加到 ...
【解决方法】因为 'PRIMARY' 文件组已满。请删除不需要的文件、删除文件组中的对象、将其他文件添加到文件组或为文件组中的现有文件启用自动增长，以便增加可用磁盘空间
文章目录平台问题描述解决问题 1.查看数据库数据文件存放路径 2.查看存放路径的盘是否已满 3.更改数据库设置平台 sqlserver 2012 问题描述正常运行的生产系统,今天下午突然发现 ...
JIPB：白洋组综述根系微生物组群落构建及其对植物适应性的贡献
根系微生物组:群落构建及其对植物适应性的贡献 The root microbiome: Community assembly and its contributions to plant fitnes ...
Windows server 2003域下全局组、本地域组及通用组之间的关系详解
WINDOWS SERVER 2003 组的简介: 定义: 组(Group)是用户帐号的集合. 作用: 通过向一组用户分配权限从而不必向每个用户分配权限,简化管理.就是为用户和嵌套在里面的组等单元提供 ...
全局组、域本地组、通用组到底有什么区别？它们之间的关系如何？
全局组:可以全局使用.即:可在本域和有信任关系的其它域中使用,体现的是全局性.MS建议的规则:基于组织结构.行政结构规划. 域本地组:只能在本域的域控制器DC上使用.MS建议的规则:基于资源(夹.打印 ...
java 线程组作用_Java线程组（ThreadGroup）使用
JDK 对线程组类注释: A thread group represents a set of threads. In addition, a thread group can also includ ...
云服务器 ECS ＞安全＞安全组＞添加安全组规则
添加安全组规则更新时间:2020-07-01 16:03:49 编辑我的收藏本页目录前提条件背景信息操作步骤执行结果后续步骤相关文档您可以通过添加安全组规则,允许或禁止安全组内的EC ...
本计算机家庭组的用户名,家庭组
家庭组是家庭网络上可以共享文件和打印机的一组计算机.使用家庭组可以使共享变得比较简单.您可以与家庭组中的其他人共享图片.音乐.视频.文档和打印机.其他人不能更改您共享的文件,除非您为他们提供了执行此操 ...

对象的单数组表示（用单数组实现链表-不一样的链表实现）

对象的单数组表示

对象的单数组表示（用单数组实现链表-不一样的链表实现）相关推荐

最新文章

热门文章