{"id":68578,"date":"2021-08-05T04:10:11","date_gmt":"2021-08-05T08:10:11","guid":{"rendered":"http:\/\/bangla.salearningschool.com\/recent-posts\/c-syntax-in-brief-77\/"},"modified":"2021-08-05T04:10:11","modified_gmt":"2021-08-05T08:10:11","slug":"c-syntax-in-brief-77","status":"publish","type":"post","link":"http:\/\/bangla.sitestree.com\/?p=68578","title":{"rendered":"C++ Syntax: in brief #77"},"content":{"rendered":"<pre style=\"padding: 10px;font-size: 13px\">Just to review\ncout &lt; &lt; \"Enter two integers:\" &lt;&lt; endl;     \/\/ output to screen\ncin &gt;&gt; n &gt;&gt; m;    \/\/ Note: Using endl prints out a newline and flushes the output \n\nbuffer.cout &lt;&lt; \"number of digits in char: \" &lt;&lt; numeric_limits::digits &lt; &lt; 'n';\n\nif (n &gt; m) { \/\/ if n is bigger than m, swap them    \nint temp = n;   \/\/ declare temp and initialize it    \nn = m;         \/\/ assign value of m to n    \nm = temp;     \/\/ assign value of temp to m\n}\n\nlong iii = i;          \/\/ implicit conversion from int to long\niii = long(i);         \/\/ explicit conversion from int to long  \n\nfor (double d = 1.1; d &lt; = 9.9; d += 0.2) \n   sum += sin(d);\n\nusing namespace std; \n#include  \nint main() \n{  \n\nusing namespace std;\n\n}\n\nconst int mxdigits = 999500;\nint* p = &amp;n;\nint m = 200;\n*p = m;\ndouble* tryd = new double (x);\nunsigned int jj = ii;\ncout.width(2);\ncout &lt; &lt; i;\n\nstruct point2d {  \nchar nm;  \nfloat x;  \nfloat y;\n};\n\npoint2d pt2 = { 'A', 3.14, -38 };\nunion val {  int i;  \ndouble d;  \nchar c;\n};\n\ndouble* tmv = new double[n];\nint n = atoi(argv[1]);  \/\/ first integer is assigned to n\n\nint* local = new int;\n*local = 555;\n\nnamespace Vec {  \n\nconst int maxsize = 100000;     \/\/ a const number          \ndouble onenorm(double*, int);           \/\/ L 1 norm  \n}\n\n\ndouble Vec::onenorm(double* v, int size) { \n}\n\nstd::cout &lt;&lt;\"Approx root near 7.7 by newton method is: \" &lt;&lt; root &lt;&lt; 'n';\n\n---std::srand(time(0));    \/\/ seed the random number generator\nfor (int i = 0; i&lt; n; i++) dp[i]  = std::rand()%1000;std::sort(dp, dp+n);      \n\n---\ndouble d = - 12345.678987654321;\ncout.setf(ios_base::scientific, ios_base::floatfield);   \/\/ scientific formatcout.setf(ios_base::uppercase);cout.width(25);cout.precision(15);cout.setf(ios_base::left, ios_base::adjustfield);        \/\/ adjust to leftcout &lt;&lt; d &lt;&lt; \"n\";--------double sum(int num, ...);va_list argPtr;va_start(argPtr, num);  \/\/ initialize argPrt. num is the last known argumentdouble sum = 0;for( ; num; num--) {   sum += va_arg(argPtr, double);   \/\/ argument of type double is returned}va_end(argPtr);          \/\/ deallocate stack pointed to by argPtrreturn sum;--struct point2d {  double x;  double y;  friend double norm(point2d p) {                   \/\/ a friend    return sqrt(p.x*p.x + p.y*p.y);                 \/\/ distance to origin  }};----class triangle {  point2d* vertices;public:  triangle(point2d, point2d, point2d);         \/\/ constructor    ~triangle() {         }                                           \/\/ destructor  double area() const;                         \/\/ a function member };----class triple {                                  \/\/ a triple of numbers  float* data;public:  triple(float a, float b, float c);            \/\/ constructor   ~triple() { }                  \/\/ destructor, also defined here          friend triple add(const triple&amp;, const triple&amp;);      \/\/ add is a friend};inline triple::triple(const triple&amp; t) {  data = new float [3];  for (int i = 0; i &lt; 3; i++) data[i] = t.data[i];}-----operator overloadingclass Cmpx {      \/\/ class for complex numbersprivate:  double re;      \/\/ real part of a complex number  double im;      \/\/ imaginal part of a complex numberpublic:  Cmpx(double x = 0, double y = 0) { re =x; im =y; }  \/\/ constructor  Cmpx&amp; operator+=(Cmpx);                          \/\/ operator +=, eg z1 +=  z2  Cmpx&amp; operator-=(Cmpx);                          \/\/ operator -=, eg z1 -=  z2  Cmpx&amp; operator++();                              \/\/ prefix,  z1 = ++z  Cmpx operator++(int);                            \/\/ postfix, z1 =  z++  friend Cmpx operator*(Cmpx, Cmpx);               \/\/ binary *, z = z1 * z2  friend std::ostream&amp; operator&lt;&lt;(std::ostream&amp;, Cmpx);      \/\/ operator &lt;&lt;  friend std::istream&amp; operator&gt;&gt;(std::istream&amp;, Cmpx&amp;);     \/\/ operator &gt;&gt; };----------------template class Vcr {         int lenth;                       \/\/ number of entries in vector  T* vr;                           \/\/ entries of the vectorpublic:   Vcr(int, T*);                    \/\/ constructor  Vcr(const Vcr&amp;);                 \/\/ copy constructor  ~Vcr(){ delete[] vr; }           \/\/ destructor };\/\/ partial specializationtemplate class Vcr&lt; complex &gt; {         int lenth;                       \/\/ number of entries in vector  complex* vr;                  \/\/ entries of the vectorpublic:   Vcr(int, complex*);           \/\/ constructor  Vcr(const Vcr&amp;);                 \/\/ copy constructor  ~Vcr(){ delete[] vr; }           \/\/ destructor  };\/\/ complete specializationtemplate&lt;&gt;class Vcr&lt; complex &gt; {         int lenth;                       \/\/ number of entries in vector  complex* vr;             \/\/ entries of the vectorpublic:   Vcr(int, complex*);      \/\/ constructor  Vcr(const Vcr&amp;);                 \/\/ copy constructor  ~Vcr(){ delete[] vr; }           \/\/ destructor  };----------complex aa = complex(3, 5);--- list nodes;                   \/\/ a list of integers for nodes  nodes.push_front(10);              \/\/ add 10 at the beginning  nodes.push_back(5);                \/\/ add 5 at the end  nodes.pop_back();                  \/\/ remove last element  nodes.remove(10);                  \/\/ remove element 10for (list::iterator j = nodes.begin(); j != nodes.end(); j++)     cout &lt; &lt; *j &lt;&lt; \"  \";              \/\/ *j is the element at position jnodes.sort(); nodes.unique();nodes.reverse();nodes.insert(i, 2);                \/\/ insert before element that i refers to  nodes.insert(i, 5, 7);             \/\/ insert 5 copies of 7  nodes.erase(i);ft.merge(sd);               \/\/ ft has the merged list, sd will be emptylist::iterator ii = find(ft.begin(), ft.end(), 5.5);   sd.splice(sd.begin(), ft, ii);     ----VECTORstd::vector vi(10);for (int i = 0; i &lt; 10; i++) vi[i] = (i-5)*i; std::sort(vi.begin(),vi.end());std::unique(vi.begin(),vi.end());-----<\/pre>\n<p> From: http:\/\/sitestree.com\/?p=5239<br \/> Categories:77<br \/>Tags:<br \/> Post Data:2012-04-01 12:11:46<\/p>\n<p>\t\tShop Online: <a href='https:\/\/www.ShopForSoul.com\/' target='new' rel=\"noopener\">https:\/\/www.ShopForSoul.com\/<\/a><br \/>\n\t\t(Big Data, Cloud, Security, Machine Learning): Courses: <a href='http:\/\/Training.SitesTree.com' target='new' rel=\"noopener\"> http:\/\/Training.SitesTree.com<\/a><br \/>\n\t\tIn Bengali: <a href='http:\/\/Bangla.SaLearningSchool.com' target='new' rel=\"noopener\">http:\/\/Bangla.SaLearningSchool.com<\/a><br \/>\n\t\t<a href='http:\/\/SitesTree.com' target='new' rel=\"noopener\">http:\/\/SitesTree.com<\/a><br \/>\n\t\t8112223 Canada Inc.\/JustEtc: <a href='http:\/\/JustEtc.net' target='new' rel=\"noopener\">http:\/\/JustEtc.net (Software\/Web\/Mobile\/Big-Data\/Machine Learning) <\/a><br \/>\n\t\tShop Online: <a href='https:\/\/www.ShopForSoul.com'> https:\/\/www.ShopForSoul.com\/<\/a><br \/>\n\t\tMedium: <a href='https:\/\/medium.com\/@SayedAhmedCanada' target='new' rel=\"noopener\"> https:\/\/medium.com\/@SayedAhmedCanada <\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Just to review cout &lt; &lt; &#8220;Enter two integers:&#8221; &lt;&lt; endl; \/\/ output to screen cin &gt;&gt; n &gt;&gt; m; \/\/ Note: Using endl prints out a newline and flushes the output buffer.cout &lt;&lt; &#8220;number of digits in char: &#8221; &lt;&lt; numeric_limits::digits &lt; &lt; &#8216;n&#8217;; if (n &gt; m) { \/\/ if n is bigger &hellip; <\/p>\n<p><a class=\"more-link btn\" href=\"http:\/\/bangla.sitestree.com\/?p=68578\">Continue reading<\/a><\/p>\n","protected":false},"author":8,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_feature_clip_id":0,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_post_was_ever_published":false},"categories":[1917],"tags":[],"class_list":["post-68578","post","type-post","status-publish","format-standard","hentry","category-fromsitestree-com","item-wrap"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack-related-posts":[{"id":26487,"url":"http:\/\/bangla.sitestree.com\/?p=26487","url_meta":{"origin":68578,"position":0},"title":"C++ Syntax: in brief #Programming #C++","author":"Author-Check- Article-or-Video","date":"April 26, 2021","format":false,"excerpt":"This will make sense only if you want to refresh your memory on C++ syntax. cout << \"Enter two integers:\" << endl; \/\/ output to screen cin >> n >> m; \/\/ Note: Using endl prints out a newline and flushes the output buffer. cout << \"number of digits in\u2026","rel":"","context":"In &quot;FromSitesTree.com&quot;","block_context":{"text":"FromSitesTree.com","link":"http:\/\/bangla.sitestree.com\/?cat=1917"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":10059,"url":"http:\/\/bangla.sitestree.com\/?p=10059","url_meta":{"origin":68578,"position":1},"title":"Transform binary representation into integral number using bitset","author":"","date":"July 27, 2015","format":false,"excerpt":"\/*\u00a0The\u00a0following\u00a0code\u00a0example\u00a0is\u00a0taken\u00a0from\u00a0the\u00a0book \u00a0*\u00a0\"The\u00a0C++\u00a0Standard\u00a0Library\u00a0-\u00a0A\u00a0Tutorial\u00a0and\u00a0Reference\" \u00a0*\u00a0by\u00a0Nicolai\u00a0M.\u00a0Josuttis,\u00a0Addison-Wesley,\u00a01999 \u00a0* \u00a0*\u00a0(C)\u00a0Copyright\u00a0Nicolai\u00a0M.\u00a0Josuttis\u00a01999. \u00a0*\u00a0Permission\u00a0to\u00a0copy,\u00a0use,\u00a0modify,\u00a0sell\u00a0and\u00a0distribute\u00a0this\u00a0software \u00a0*\u00a0is\u00a0granted\u00a0provided\u00a0this\u00a0copyright\u00a0notice\u00a0appears\u00a0in\u00a0all\u00a0copies. \u00a0*\u00a0This\u00a0software\u00a0is\u00a0provided\u00a0\"as\u00a0is\"\u00a0without\u00a0express\u00a0or\u00a0implied \u00a0*\u00a0warranty,\u00a0and\u00a0with\u00a0no\u00a0claim\u00a0as\u00a0to\u00a0its\u00a0suitability\u00a0for\u00a0any\u00a0purpose. \u00a0*\/ #include\u00a0<bitset> #include\u00a0<iostream> #include\u00a0<string> #include\u00a0<limits> using\u00a0namespace\u00a0std; int\u00a0main() { \u00a0\u00a0\u00a0\u00a0\/*\u00a0print\u00a0some\u00a0numbers\u00a0in\u00a0binary\u00a0representation \u00a0\u00a0\u00a0\u00a0\u00a0*\/ \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"267\u00a0as\u00a0binary\u00a0short:\u00a0\u00a0\u00a0\u00a0\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<numeric_limits<unsigned\u00a0short>::digits>(267) \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0endl; \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"267\u00a0as\u00a0binary\u00a0long:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<numeric_limits<unsigned\u00a0long>::digits>(267) \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0endl; \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"10,000,000\u00a0with\u00a024\u00a0bits:\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<24>(1e7)\u00a0<<\u00a0endl; \u00a0\u00a0\u00a0\u00a0\/*\u00a0transform\u00a0binary\u00a0representation\u00a0into\u00a0integral\u00a0number \u00a0\u00a0\u00a0\u00a0\u00a0*\/ \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"\\\"1000101011\\\"\u00a0as\u00a0number:\u00a0\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<100>(string(\"1000101011\")).to_ulong()\u00a0<<\u00a0endl; } \u00a0\/*\u00a0 267\u00a0as\u00a0binary\u00a0short:\u00a0\u00a0\u00a0\u00a0\u00a00000000100001011 267\u00a0as\u00a0binary\u00a0long:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a000000000000000000000000100001011 10,000,000\u00a0with\u00a024\u00a0bits:\u00a0100110001001011010000000 1000101011\"\u00a0as\u00a0number:\u00a0\u00a0555 \u00a0*\/\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0 \/\/ create a bitset that is 8 bits long bitset<8> bs;\u2026","rel":"","context":"In &quot;C++&quot;","block_context":{"text":"C++","link":"http:\/\/bangla.sitestree.com\/?cat=1420"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":10552,"url":"http:\/\/bangla.sitestree.com\/?p=10552","url_meta":{"origin":68578,"position":2},"title":"C++ Template Example","author":"","date":"August 29, 2015","format":false,"excerpt":"\/* The following code example is taken from the book \u00a0* \"The C++ Standard Library - A Tutorial and Reference\" \u00a0* by Nicolai M. Josuttis, Addison-Wesley, 1999 \u00a0* \u00a0* (C) Copyright Nicolai M. Josuttis 1999. \u00a0* Permission to copy, use, modify, sell and distribute this software \u00a0* is granted provided\u2026","rel":"","context":"In &quot;C++&quot;","block_context":{"text":"C++","link":"http:\/\/bangla.sitestree.com\/?cat=1420"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":10089,"url":"http:\/\/bangla.sitestree.com\/?p=10089","url_meta":{"origin":68578,"position":3},"title":"valarray with double value inside","author":"","date":"July 29, 2015","format":false,"excerpt":"\/* The following code example is taken from the book \u00a0* \"The C++ Standard Library - A Tutorial and Reference\" \u00a0* by Nicolai M. Josuttis, Addison-Wesley, 1999 \u00a0* \u00a0* (C) Copyright Nicolai M. Josuttis 1999. \u00a0* Permission to copy, use, modify, sell and distribute this software \u00a0* is granted provided\u2026","rel":"","context":"In &quot;C++&quot;","block_context":{"text":"C++","link":"http:\/\/bangla.sitestree.com\/?cat=1420"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":10070,"url":"http:\/\/bangla.sitestree.com\/?p=10070","url_meta":{"origin":68578,"position":4},"title":"Print minimum, maximum, and sum of the valarray","author":"","date":"July 27, 2015","format":false,"excerpt":"\/* The following code example is taken from the book * \"The C++ Standard Library - A Tutorial and Reference\" * by Nicolai M. Josuttis, Addison-Wesley, 1999 * * (C) Copyright Nicolai M. Josuttis 1999. * Permission to copy, use, modify, sell and distribute this software * is granted provided\u2026","rel":"","context":"In &quot;C++&quot;","block_context":{"text":"C++","link":"http:\/\/bangla.sitestree.com\/?cat=1420"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]},{"id":62223,"url":"http:\/\/bangla.sitestree.com\/?p=62223","url_meta":{"origin":68578,"position":5},"title":"Transform binary representation into integral number using bitset #Programming Code Examples #C++ #Bitset","author":"Author-Check- Article-or-Video","date":"May 15, 2021","format":false,"excerpt":"\u00a0 \u00a0 \/*\u00a0The\u00a0following\u00a0code\u00a0example\u00a0is\u00a0taken\u00a0from\u00a0the\u00a0book \u00a0*\u00a0\"The\u00a0C++\u00a0Standard\u00a0Library\u00a0-\u00a0A\u00a0Tutorial\u00a0and\u00a0Reference\" \u00a0*\u00a0by\u00a0Nicolai\u00a0M.\u00a0Josuttis,\u00a0Addison-Wesley,\u00a01999 \u00a0* \u00a0*\u00a0(C)\u00a0Copyright\u00a0Nicolai\u00a0M.\u00a0Josuttis\u00a01999. \u00a0*\u00a0Permission\u00a0to\u00a0copy,\u00a0use,\u00a0modify,\u00a0sell\u00a0and\u00a0distribute\u00a0this\u00a0software \u00a0*\u00a0is\u00a0granted\u00a0provided\u00a0this\u00a0copyright\u00a0notice\u00a0appears\u00a0in\u00a0all\u00a0copies. \u00a0*\u00a0This\u00a0software\u00a0is\u00a0provided\u00a0\"as\u00a0is\"\u00a0without\u00a0express\u00a0or\u00a0implied \u00a0*\u00a0warranty,\u00a0and\u00a0with\u00a0no\u00a0claim\u00a0as\u00a0to\u00a0its\u00a0suitability\u00a0for\u00a0any\u00a0purpose. \u00a0*\/ #include\u00a0<bitset> #include\u00a0<iostream> #include\u00a0<string> #include\u00a0<limits> using\u00a0namespace\u00a0std; int\u00a0main() { \u00a0\u00a0\u00a0\u00a0\/*\u00a0print\u00a0some\u00a0numbers\u00a0in\u00a0binary\u00a0representation \u00a0\u00a0\u00a0\u00a0\u00a0*\/ \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"267\u00a0as\u00a0binary\u00a0short:\u00a0\u00a0\u00a0\u00a0\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<numeric_limits<unsigned\u00a0short>::digits>(267) \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0endl; \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"267\u00a0as\u00a0binary\u00a0long:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<numeric_limits<unsigned\u00a0long>::digits>(267) \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0endl; \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"10,000,000\u00a0with\u00a024\u00a0bits:\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<24>(1e7)\u00a0<<\u00a0endl; \u00a0\u00a0\u00a0\u00a0\/*\u00a0transform\u00a0binary\u00a0representation\u00a0into\u00a0integral\u00a0number \u00a0\u00a0\u00a0\u00a0\u00a0*\/ \u00a0\u00a0\u00a0\u00a0cout\u00a0<<\u00a0\"\"1000101011\"\u00a0as\u00a0number:\u00a0\u00a0\" \u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0<<\u00a0bitset<100>(string(\"1000101011\")).to_ulong()\u00a0<<\u00a0endl; } \u00a0\/*\u00a0 267\u00a0as\u00a0binary\u00a0short:\u00a0\u00a0\u00a0\u00a0\u00a00000000100001011 267\u00a0as\u00a0binary\u00a0long:\u00a0\u00a0\u00a0\u00a0\u00a0\u00a000000000000000000000000100001011 10,000,000\u00a0with\u00a024\u00a0bits:\u00a0100110001001011010000000 1000101011\"\u00a0as\u00a0number:\u00a0\u00a0555 \u00a0*\/\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\u00a0 \/\/ create a bitset that is 8 bits long\u2026","rel":"","context":"In &quot;FromSitesTree.com&quot;","block_context":{"text":"FromSitesTree.com","link":"http:\/\/bangla.sitestree.com\/?cat=1917"},"img":{"alt_text":"","src":"","width":0,"height":0},"classes":[]}],"_links":{"self":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/68578","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/users\/8"}],"replies":[{"embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=68578"}],"version-history":[{"count":0,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=\/wp\/v2\/posts\/68578\/revisions"}],"wp:attachment":[{"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=68578"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=68578"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/bangla.sitestree.com\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=68578"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}