\/\/ Set.h \u041e\u0431\u044a\u044f\u0432\u043b\u0435\u043d\u0438\u0435 \u043a\u043b\u0430\u0441\u0441\u0430 TSet
\n#ifndef SET_H
\n#define SET_H \t\/\/\u041f\u0440\u0435\u0434\u043e\u0442\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u043d\u0435\u0441\u043a\u043e\u043b\u044c\u043a\u043e include
\nclass TElem;
\ntypedef TElem* PTElem;
\ntypedef PTElem* PPTElem;<\/p>\n
class TSet;
\ntypedef TSet* PTSet;<\/p>\n
class TSet {
\nprivate:
\nint max;
\nint index; \/\/\u0438\u043d\u0434\u0435\u043a\u0441 \u043c\u0430\u0441\u0441\u0438\u0432\u0430 \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432\u0430
\nPPTElem set; \/\/\u0423\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u043c\u0430\u0441\u0441\u0438\u0432 \u0443\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u0435\u0439 \u043d\u0430 PTElem
\nprotected:
\nvirtual int CompareElem(PTElem p1, PTElem p2) = 0;
\npublic:
\nTSet(int n)
\n{ max=n; index=0; set=new PTElem[n]; }
\nvirtual ~TSet()\t{ delete[] set; }
\nvoid AddElem(PTElem p);
\nint HasElem(PTElem p);
\n};
\n#endif \/\/SET_H<\/p>\n
\/\/ Set.cpp \u0420\u0435\u0430\u043b\u0438\u0437\u0430\u0446\u0438\u044f \u043a\u043b\u0430\u0441\u0441\u0430 TSet #include <stdlib.h> #include «set.h» \/\/ \u0414\u043e\u0431\u0430\u0432\u043b\u044f\u0435\u0442 \u044d\u043b\u0435\u043c\u0435\u043d\u0442 \u0432 \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432\u043e void TSet::AddElem(PTElem p)
\n{
\nif (set == NULL) {
\ncout << endl << «ERROR: Out of memory»;
\nexit(1);
\n}
\nif (index>= max) {
\ncout << endl << «ERROR: Set limit exceeded»;
\nexit(1);
\n}
\nset[index] = p;
\n++index;
\n}
\n\/\/\u0412\u043e\u0437\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u0438\u0441\u0442\u0438\u043d\u0443, \u0435\u0441\u043b\u0438 \u044d\u043b\u0435\u043c\u0435\u043d\u0442, \u0430\u0434\u0440\u0435\u0441\u0443\u0435\u043c\u044b\u0439 \u0440, \u043d\u0430\u0445\u043e\u0434\u0438\u0442\u0441\u044f \u0432 \u043c\u043d\u043e\u0436\u0441\u0442\u0432\u0435
\nint TSet::HasElem(PTElem p)
\n{
\nif (set == NULL)
\nreturn 0; \/\/\u0412 \u043f\u0443\u0441\u0442\u043e\u043c \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432\u0435 \u043d\u0435\u0442 \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u043e\u0432
\nfor( int i=0; i<index; i++)<\/p>\n
if(CompareElem(p,set[i])==0)
\nreturn 1;
\nreturn 0;
\n}<\/p>\n
\/\/ TSet.cpp \u0422\u0435\u0441\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u0438\u0435 \u043a\u043b\u0430\u0441\u0441\u0430 TSet
\n#include <iostream.h>
\n#include <string.h>
\n#include «set.h»
\nclass TElem {
\nprivate:
\nchar *sp; \/\/\u0423\u043a\u0430\u0437\u0430\u0442\u0435\u043b\u044c \u043d\u0430 \u044d\u043b\u0435\u043c\u0435\u043d\u0442-\u0441\u0442\u0440\u043e\u043a\u0443
\npublic:
\nTElem(const char *s) {sp = strdup(s);}
\nvirtual ~TElem() {delete sp;}
\nvirtual const char *GetString(void) {return sp;}
\n};
\nclass TMySet: public TSet {
\nprotected:
\nvirtual int CompareElem(PTElem p1, PTElem p2);
\npublic:
\nTMySet(int n): TSet(n) {}
\n};
\nvoid Test(const char *s, PTSet setp);
\nvoid main()
\n{
\nTMySet array(10); \/\/\u041c\u043d\u043e\u0436\u0435\u0441\u0442\u0432\u043e \u0438\u0437 10 \u043e\u0431\u044a\u0435\u043a\u0442\u043e\u0432 TElem
\narray.AddElem(new TElem(«Sep»));
\narray.AddElem(new TElem(«Apr»));
\narray.AddElem(new TElem(«Jun»));
\narray.AddElem(new TElem(«Nov»));
\nTest(«Jun»,&array);
\nTest(«Feb»,&array);
\nTest(«Sep»,&array);
\nTest(«Nov»,&array);
\nTest(«Apr»,&array);
\nTest(«Jul»,&array);
\n}
\n\/\/\u0421\u043e\u043e\u0431\u0449\u0430\u0435\u0442, \u043f\u0440\u0438\u043d\u0430\u0434\u043b\u0435\u0436\u0438\u0442 \u043b\u0438 \u0441\u0442\u0440\u043e\u043a\u0430 s \u043c\u043d\u043e\u0436\u0435\u0441\u0442\u0432\u0443 setp
\nvoid Test(const char *s, PTSet setp)
\n{
\nTElem testElem(s);
\nif (setp->HasElem(&testElem))
\ncout << s << » is in the set » << endl;
\nelse
\ncout << s << » is not in the set » << endl;
\n}
\n\/\/ \u0412\u043e\u0437\u0432\u0440\u0430\u0449\u0430\u0435\u0442 0, \u0435\u0441\u043b\u0438 \u0434\u0432\u0430 \u044d\u043b\u0435\u043c\u0435\u043d\u0442\u0430 \u0438\u0434\u0435\u043d\u0442\u0438\u0447\u043d\u044b, \u0438\u043d\u0430\u0447\u0435 \u043d\u0435 \u043d\u0443\u043b\u044c
\nint TMySet::CompareElem(PTElem p1, PTElem p2)
\n{
\nreturn (strcmp(p1->GetString(), p2->GetString()));<\/p>\n","protected":false},"excerpt":{"rendered":"
\/\/ Set.h \u041e\u0431\u044a\u044f\u0432\u043b\u0435\u043d\u0438\u0435 \u043a\u043b\u0430\u0441\u0441\u0430 TSet #ifndef SET_H #define SET_H \/\/\u041f\u0440\u0435\u0434\u043e\u0442\u0432\u0440\u0430\u0449\u0430\u0435\u0442 \u043d\u0435\u0441\u043a\u043e\u043b\u044c\u043a\u043e include class TElem;<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[36],"tags":[],"_links":{"self":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/2177"}],"collection":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=2177"}],"version-history":[{"count":1,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/2177\/revisions"}],"predecessor-version":[{"id":2178,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/2177\/revisions\/2178"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=2177"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=2177"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=2177"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}