手机系统网站网站制作全过程

当前位置： 首页 > news >正文

手机系统网站,网站制作全过程,广州网站推广找谁,个人做的好的淘宝客网站C自学精简教程 目录(必读) C数据结构与算法实现#xff08;目录#xff09; 本文的实现基本上和 动态数组 vector 是一样的。 因为大部分接口都一样。 所以#xff0c;本文就直接给出全部的源码和运行结果。 //——下面的代码是用来测试你的代码有没有问题的辅助代码…C自学精简教程 目录(必读) C数据结构与算法实现目录 本文的实现基本上和 动态数组 vector 是一样的。 因为大部分接口都一样。 所以本文就直接给出全部的源码和运行结果。 //——下面的代码是用来测试你的代码有没有问题的辅助代码你无需关注—— #include algorithm #include cstdlib #include iostream #include vector #include utility using namespace std; struct Record { Record(void* ptr1, size_t count1, const char* location1, int line1, bool is) :ptr(ptr1), count(count1), line(line1), is_array(is) { int i 0; while ((location[i] location1[i]) i 100) { i; } }void* ptr; size_t count; char location[100] { 0 }; int line; bool is_array false; bool not_use_right_delete false; }; bool operator(const Record lhs, const Record rhs) { return lhs.ptr rhs.ptr; }std::vectorRecord myAllocStatistic; void* newFunctionImpl(std::size_t sz, char const* file, int line, bool is) { void* ptr std::malloc(sz); myAllocStatistic.push_back({ ptr,sz, file, line , is }); return ptr; }void* operator new(std::size_t sz, char const* file, int line) { return newFunctionImpl(sz, file, line, false); }void* operator new {return newFunctionImpl(sz, file, line, true); }void operator delete(void* ptr) noexcept { Record item{ ptr, 0, , 0, false }; auto itr std::find(myAllocStatistic.begin(), myAllocStatistic.end(), item); if (itr ! myAllocStatistic.end()) { auto ind std::distance(myAllocStatistic.begin(), itr); myAllocStatistic[ind].ptr nullptr; if (itr-is_array) { myAllocStatistic[ind].not_use_right_delete true; } else { myAllocStatistic[ind].count 0; }std::free(ptr); } }void operator delete noexcept { Record item{ ptr, 0, , 0, true }; auto itr std::find(myAllocStatistic.begin(), myAllocStatistic.end(), item); if (itr ! myAllocStatistic.end()) { auto ind std::distance(myAllocStatistic.begin(), itr); myAllocStatistic[ind].ptr nullptr; if (!itr-is_array) { myAllocStatistic[ind].not_use_right_delete true; } else { myAllocStatistic[ind].count 0; }std::free(ptr); } } #define new new(FILE, LINE) struct MyStruct { void ReportMemoryLeak() { std::cout Memory leak report: std::endl; bool leak false; for (auto i : myAllocStatistic) { if (i.count ! 0) { leak true; std::cout leak count i.count Byte , file i.location , line i.line; if (i.not_use_right_delete) { cout , not use right delete. ; } cout std::endl; } }if (!leak) { cout No memory leak. endl; } }~MyStruct() { ReportMemoryLeak(); } }; static MyStruct my; //——上面的代码是用来测试你的代码有没有问题的辅助代码你无需关注——//——check用来检查有没有bug begin—— #include iostream using namespace std; void check_do(bool b, int line LINE) { if (b) { cout line: line Pass endl; } else { cout line: line Ohh! not passed!!!!!!!!!!!!!!!!!!!!!!!!!!! endl; exit(0); } } #define check(msg) check_do(msg, LINE); //——check用来检查有没有bug end——class String {friend std::ostream operator(std::ostream os, const String str); public:String(void);String(const char* data, int length);String(const char* data);String(const String from);//1 复制构造String operator (const String from);//2 赋值操作符size_t size(void) const { return m_length; }bool empty(void) const { return m_length 0; }~String();//3 析构函数bool operator (const String other);bool operator ! (const String other) { return !(this other); }String operator(const String other);void push_back(char c);void clear(void);protected:void copy(const char data, size_t length); private:char* m_data;size_t m_length;int m_capacity 0; }; void String::push_back(char c) {if (m_capacity m_length)//直接追加到最后一个{m_data[m_length] c;}else//只有满了的那一瞬间才翻倍开辟新空间{m_capacity (m_capacity 0 ? 10 : m_capacity m_capacity);auto pNewArray new char[m_capacity];//拷贝老数据for (size_t i 0; i m_length; i){pNewArray[i] m_data[i];}//追加最新的末尾元素pNewArray[m_length] c;delete[] m_data;m_data pNewArray;} } std::ostream operator(std::ostream os, const String str) {for (size_t i 0; i str.m_length; i){os str.m_data[i];}return os; } String::String(void) :m_data(nullptr), m_length(0) { } String::~String() {clear(); } bool String::operator(const String other) {if (other.m_length ! this-m_length){return false;}for (size_t i 0; i m_length; i){auto c1 m_data[i];auto c2 other.m_data[i];if (c1 ! c2){return false;}}return true; } String String::operator(const String other) {if (other.empty()){return this;}String result;result.m_length m_length other.m_length;result.m_data new char[result.m_length];for (size_t i 0; i m_length; i){result.m_data[i] m_data[i];}for (size_t i 0; i other.m_length; i){result.m_data[m_length i] other.m_data[i];}return result; } String::String(const char data, int _length) :m_data(nullptr), m_length(0) {copy(data, _length); } String::String(const char* data) : m_data(nullptr), m_length(0) {int stringLength 0;auto p data;while (*p ! \0){stringLength;p;}copy(data, stringLength); } String::String(const String from) : m_data(nullptr), m_length(0) {if (from.m_data ! m_data){copy(from.m_data, from.m_length);} } String String::operator(const String from) {if (from ! this){copy(from.m_data, from.m_length);}return this; }void String::clear(void) {if (nullptr ! m_data){delete[] m_data;m_data nullptr;m_length 0;} } void String::copy(const char data, size_t length) {clear();m_data new char[length];for (size_t i 0; i length; i){m_data[i] data[i];}m_length length; }String GetLeftValue(void) {String s(String);return s; } void Test0(void) {auto leftValue1 GetLeftValue();String left2;left2 (left2 leftValue1);std::vectorString arrStr(2);left2 (arrStr[0]);String arr[2];left2 (arr[0]);auto p arr;left2 (p);arrStr.push_back(left2); } void Test_empty(void) {String s();check(s.empty());check(s.size() 0);check(s ); } void Test_clear(void) {String s2;{String s(123);check(s 123);s2 s;s.clear();s.clear();check(s.size() 0);check(s.empty());check(s );check(s2 ! s);}check(s2 123); } void Test_copy(void) {{String s1(Hello World!);//constructorString s2(s1);//copy constructorcout s2 endl;//operatorcheck(s1.size() s2.size());//sizeString s3;s3 s2;check(s3 s1);check(!s3.empty());check(!s1.empty());s1 s2 s2 s1;check(s1.size() s2.size());//sizecheck(s3 s1);check(!s3.empty());check(!s1.empty());check(s1 Hello World!);s1.clear();check(s1.empty());check(s1 ! s2);check(s2 s3);}{String s;check(s.empty());}// {String s1(Hello World!);//constructorString s2(Hello World!);//constructorString s3(s1 s2);check(s3.size() s1.size() s2.size());check(s3 s1 s2);check(s3 Hello World!Hello World!);}{const char p Hello World !;String s(p);check(s p);}//push_back{String s;check(s.size() 0);check(s.empty());s.push_back(a);check(s a);for (size_t i 0; i 100; i){s.push_back(a);}check(s.size() 101);} }String GetValue(void) {String a;String b;b a;return a; }int main() {Test0();Test_empty();Test_copy();Test_clear();return 0; }正确的运行结果 line:194 Pass line:195 Pass line:196 Pass Hello World! line:220 Pass line:223 Pass line:224 Pass line:225 Pass line:227 Pass line:228 Pass line:229 Pass line:230 Pass line:231 Pass line:233 Pass line:234 Pass line:235 Pass line:239 Pass line:246 Pass line:247 Pass line:248 Pass line:253 Pass line:258 Pass line:259 Pass line:261 Pass line:266 Pass line:203 Pass line:207 Pass line:208 Pass line:209 Pass line:210 Pass line:212 Pass Memory leak report: No memory leak.欢迎参考借鉴如有问题欢迎评论指出 祝你好运