U E D R , A S I H C RSS

AcceleratedC++/Chapter6

1. Chapter 6 Using Library Algorithms

  • 5์žฅ์—์„œ ๋ณธ๊ฒƒ์ฒ˜๋Ÿผ ์šฐ๋ฆฌ๊ฐ€ ๋‹ค๋ฃจ๋Š” ์ปจํ…Œ์ด๋„ˆ๋“ค์€ ๋‚ด๋ถ€ ์‚ฌ์ •์€ ๋‹ค๋ฅผ์ง€๋ผ๋„, ์šฐ๋ฆฌ๋Š” ๊ทธ๊ฒƒ์„ ๋ชจ๋ฅด๊ณ ๋„ ๋˜‘๊ฐ™์ด ์“ธ ์ˆ˜๊ฐ€ ์žˆ๋‹ค. ์ฆ‰ ์ผ๊ด€๋œ ์ธํ„ฐํŽ˜์ด์Šค๋ฅผ ์ œ๊ณตํ•œ๋‹ค๋Š” ๊ฒƒ์ด๋‹ค. ์ปจํ…Œ์ด๋„ˆ๋‚˜ ๋ฐ˜๋ณต์ž์™€ ๋งˆ์ฐฌ๊ฐ€์ง€๋กœ ํ‘œ์ค€ ๋ผ์ด๋ธŒ๋Ÿฌ๋ฆฌ๋„ ์ผ๊ด€๋œ ์ธํ„ฐํŽ˜์ด์Šค๋ฅผ ์ œ๊ณตํ•œ๋‹ค. ๋ฒกํ„ฐ๋ฅผ ๋ฐฐ์› ์œผ๋ฉด ๋ฆฌ์ŠคํŠธ๋„ ๊ธˆ๋ฐฉ ์“ธ์ˆ˜ ์žˆ๋Š” ๊ฒƒ์ฒ˜๋Ÿผ, ํ•˜๋‚˜์˜ ์•Œ๊ณ ๋ฆฌ์ฆ˜ ์“ฐ๋Š” ๋ฒ•์„ ๋ฐฐ์šฐ๋ฉด, ๋‹ค๋ฅธ ๊ฒƒ ์“ฐ๋Š” ๋ฒ•๋„ ๊ธˆ๋ฐฉ ์•Œ์ˆ˜๊ฐ€ ์žˆ๋‹ค.

1.1. 6.1 Analyzing strings

  • Chapter5์˜ ๋งˆ์ง€๋ง‰์— ๋ฃจํ”„๋ฅผ ์ค„์ธ ๋‹ค์Œ๊ณผ ๊ฐ™์€ ๊ตฌ๋ฌธ์ด ์žˆ์—ˆ๋‹ค. ret์˜ ๋์—๋‹ค๊ฐ€ bottom์˜ ์ฒ˜์Œ๋ถ€ํ„ฐ ๋๊นŒ์ง€ ๋„ฃ๋Š”๋‹ค๋Š” ๋œป์ด๋‹ค.
    ~cpp 
    ret.insert(ret.end(), bottom,begin(), bottom.end());
      

  • ๊ทผ๋ฐ ์ด๊ฒƒ๋ณด๋‹ค ๋” ์ผ๋ฐ˜์ ์ธ, (์ฆ‰ ์ปจํ…Œ์ด๋„ˆ์— ๋…๋ฆฝ์ ์ธ) ๋ฐฉ๋ฒ•์ด ์žˆ๋‹ค. ์ปจํ…Œ์ด๋„ˆ์˜ ๋ฉค๋ฒ„ํ•จ์ˆ˜๋ฅผ ์ด์šฉํ•˜๋Š” ๊ฒƒ์ด ์•„๋‹Œ, ํ‘œ์ค€ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ด์šฉํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ์œ„์˜ ๊ฒƒ๊ณผ ๋™์ผํ•œ ๊ธฐ๋Šฅ์„ ํ•œ๋‹ค.
    ~cpp 
    copy(bottom.begin(), bottom.end(), back_inserter(ret));
      

  • ์Œ. ๋˜ ์ƒˆ๋กœ์šด ๊ฒƒ์ด ๋ณด์ด์ง€ ์•Š๋Š”๊ฐ€? copy๋Š” generic algorithm์˜ ์˜ˆ์ด๊ณ , back_inserter๋Š” ๋ฐ˜๋ณต์ž ์–ด๋Œ‘ํ„ฐ์˜ ์˜ˆ์ด๋‹ค. ์ด๊ฒŒ ๋ฌด์—‡์ธ์ง€๋Š” ์ฐจ๊ทผ์ฐจ๊ทผ ์‚ดํŽด๋ณด๋„๋ก ํ•˜์ž.
  • Generic algorithm์ด๋ผ๋Š” ์ปจํ…Œ์ด๋„ˆ์˜ ๋ถ€๋ถ„์ด ์•„๋‹Œ ์•Œ๊ณ ๋ฆฌ์ฆ˜์ด๋‹ค. ํŒŒ๋ผ๋ฉ”ํ„ฐ๋กœ ๋ฐ˜๋ณต์ž๋ฅผ ๋ฐ›๋Š”๋‹ค. ๋น„์Šทํ•˜์ง€ ์•Š์€๊ฐ€? .์ด ์—†๋‹ค ๋ฟ์ด์ง€ ๊ทธ๋ƒฅ ์“ฐ์ž.
  • Postfix์™€ Prefix : i++๊ณผ ++i์˜ ์ฐจ์ด์ ์ด๋‹ค. ++i๋Š” i๋ฅผ ์‚ฌ์šฉํ•˜๊ธฐ ์ „์— ๊ฐ’์„ ์ฆ๊ฐ€์‹œํ‚ค๊ณ , i++์€ i๋ฅผ ์‚ฌ์šฉํ•œ ํ›„์— ๊ฐ’์„ ์ฆ๊ฐ€์‹œํ‚จ๋‹ค.
  • ๋‹ค์Œ์œผ๋กœ ๋ฐ˜๋ณต์ž ์–ด๋Œ‘ํ„ฐ(Iterator Adapters)๋ฅผ ์‚ดํŽด๋ณด์ž. ๋ฐ˜๋ณต์ž ์–ด๋Œ‘ํ„ฐ๋Š” ์ปจํ…Œ์ด๋„ˆ๋ฅผ ์ธ์ž๋กœ ๋ฐ›์•„, ์ •ํ•ด์ง„ ์ž‘์—…์„ ์ˆ˜ํ–‰ํ•˜๊ณ  ๋ฐ˜๋ณต์ž๋ฅผ ๋ฆฌํ„ดํ•ด์ฃผ๋Š” ํ•จ์ˆ˜์ด๋‹ค. copy์•Œ๊ณ ๋ฆฌ์ฆ˜์— ์“ฐ์ธ back_inserter๋Š” ret์˜ ๋’ค์—๋‹ค๊ฐ€ copy๋ฅผ ์ˆ˜ํ–‰ํ•œ๋‹ค๋Š” ๊ฒƒ์ด๋‹ค. ๊ทธ๋Ÿผ ๋‹ค์Œ๊ณผ ๊ฐ™์ด ์“ฐ๊ณ  ์‹ถ์€ ์‚ฌ๋žŒ๋„ ์žˆ์„ ๊ฒƒ์ด๋‹ค.
    ~cpp 
    copy(bottom.begin(), bottom.end(), ret.end());
      
  • ์•ž์—์„œ๋„ ๋งํ–ˆ์ง€๋งŒ, end()์—๋Š” ์•„๋ฌด๊ฒƒ๋„ ์—†๋‹ค.
  • ์™œ ์ด๋ ‡๊ฒŒ ์„ค๊ณ„ํ–ˆ๋Š”๊ฐ€? ํ”„๋กœ๊ทธ๋ž˜๋จธ๋กœ ํ•˜์—ฌ๊ธˆ ์“ฐ๊ณ  ์‹ถ์€ ์—ฐ์‚ฐ์„ ๊ณจ๋ผ์„œ ์“ธ์ˆ˜ ์žˆ๊ฒŒ ํ•˜๊ธฐ ๋•Œ๋ฌธ์ด๋‹ค.

1.1.1. 6.1.1 Another way to split

  • 5์žฅ์—์„œ ๊ณต๋ถ€ํ•œ ๊ฒƒ ์ค‘์— ์ฃผ์–ด์ง„ string์„ ๊ณต๋ฐฑ์„ ๊ธฐ์ค€์œผ๋กœ ์ž˜๋ผ์„œ, vector์—๋‹ค ๋„ฃ์€ ๋‹ค์Œ ๋ฆฌํ„ดํ•ด์ฃผ๋Š” ํ•จ์ˆ˜๊ฐ€ ์žˆ์—ˆ๋‹ค.(split) ์ด๊ฒƒ์„ ์ข€ ๋” ๊ฐ„๋‹จํžˆ ๋งŒ๋“ค์–ด๋ณด์ž. ์•ž์˜ ๊ฒƒ์€ ๊ต‰์žฅํžˆ ์•Œ์•„๋ณด๊ธฐ ํž˜๋“ค๊ฒŒ ๋˜์–ด์žˆ๋‹ค.
    ~cpp 
    vector<string> split(const string& str)
    {
     typedef string::const_iterator iter;
     vector<string> ret;
     iter i = str.begin();
     while(i != str.end()) {
      i = find_if(i, str.end(), not_space); // ๊ณต๋ฐฑ์ด ์•„๋‹Œ ๋ถ€๋ถ„์„ ์ฐพ๊ณ 
      iter j = find_if(i, str.end(), space); // ๊ณต๋ฐฑ์ธ ๋ถ€๋ถ„์„ ์ฐพ์•„์„œ
      if(i != str.end())
       ret.push_back(string(i,j)); // ๊ทธ๋งŒํผ์˜ ๋ฌธ์ž์—ด์—˜ ๋ฒกํ„ฐ์— ๋„ฃ์Œ
      i = j;
     }
     return ret;
    }
      
  • ํ›จ์”ฌ ์•Œ์•„๋ณด๊ธฐ ์‰ฌ์›Œ์กŒ๋‹ค. 5์žฅ์˜ split์€ find_if๋งˆ๋‹ค ์—ด์‹ฌํžˆ ๋ฃจํ”„๋ฅผ ๋Œ๋ ธ์—ˆ๋‹ค. ์ด์ œ ์ฐจ๊ทผ์ฐจ๊ทผ ์‚ดํŽด๋ณด์ž.
  • find_if์˜ ์ธ์ž๋ฅผ ๋ณด๋ฉด, ์•ž์˜ ๋‘๊ฐœ์˜ ์ธ์ž๋Š” ๋ฒ”์œ„๋ฅผ ์˜๋ฏธํ•œ๋‹ค. ์ฒซ์ธ์ž~๋‘๋ฒˆ์งธ์ธ์ž ๋ง์ด๋‹ค. ๋งˆ์ง€๋ง‰ ์ธ์ž๋Š” boolํ˜•์„ ๋ฆฌํ„ดํ•˜๋Š” ํ•จ์ˆ˜๋ฅผ ๋„ฃ์–ด์ค€๋‹ค. ์ฆ‰ predicater์ด๋‹ค. ๊ทธ๋Ÿฌ๋ฉด find_if๋Š” ์ฃผ์–ด์ง„ ๋ฒ”์œ„ ๋‚ด์—์„œ predicator๋ฅผ ๋งŒ์กฑํ•˜๋Š” ๋ถ€๋ถ„์˜ ๋ฐ˜๋ณต์ž๋ฅผ ๋ฆฌํ„ดํ•ด ์ค€๋‹ค.
  • isspace๋Š” ํ‘œ์ค€ ๋ผ์ด๋ธŒ๋Ÿฌ๋ฆฌ์—์„œ ์ง€์›ํ•˜๋Š” ํ•จ์ˆ˜์ž„์—๋‹ค ๋ถˆ๊ตฌํ•˜๊ณ , ์™œ ๋”ฐ๋กœ ๋งŒ๋“ค์—ˆ์„๊นŒ? ๋ฐ”๋กœ isspace๋Š” ์—ฌ๋Ÿฌ ์–ธ์–ด ๋ฒ„์ ผ์œผ๋กœ ์˜ค๋ฒ„๋กœ๋”ฉ ๋˜์–ด ์žˆ๊ธฐ ๋•Œ๋ฌธ์ด๋‹ค. ํ…œํ”Œ๋ฆฟ ํ•จ์ˆ˜์˜ ์ธ์ž๋กœ ์˜ค๋ฒ„๋กœ๋”ฉ๋œ ํ•จ์ˆ˜๋ฅผ ๋„˜๊ฒจ์ฃผ๋Š” ๊ฒƒ์€ ์‰ฝ์ง€ ์•Š๋‹ค. ์–ด๋–ค ๋ฒ„์ ผ์ธ์ง€ ์•Œ์ˆ˜๊ฐ€ ์—†๊ธฐ ๋•Œ๋ฌธ์ด๋‹ค. ์ด๊ฒƒ์ด ์šฐ๋ฆฌ๊ฐ€ isspace์—ญํ• ์„ ํ•˜๋Š” ํ•จ์ˆ˜๋ฅผ ์ƒˆ๋กœ ๋งŒ๋“  ์ด์œ ๋‹ค.
  • 5์žฅ์—์„œ๋Š” string(i,j) ๋Œ€์‹ ์—, substr์ด๋ผ๋Š” ํ•จ์ˆ˜๋ฅผ ์ด์šฉํ–ˆ์—ˆ๋Š”๋ฐ, ์ด๋ฒˆ์— ์“ฐ์ง€ ์•Š์€ ์ด์œ ๋Š” substr์€ ๋ฐ˜๋ณต์ž๋ฅผ ์ธ์ž๋กœ ๋ฐ›์ง€ ์•Š๊ธฐ 떄๋ฌธ์ด๋‹ค.
  • ๋˜ํ•œ ์ œ๋„ค๋ฆญ ์•Œ๊ณ ๋ฆฌ์ฆ˜์€ end()๋ฅผ ๊น”๋”ํ•˜๊ฒŒ ์ฒ˜๋ฆฌํ•ด์ค€๋‹ค. ์šฐ๋ฆฌ๊ฐ€ ์‹ ๊ฒฝ์•ˆ์จ๋„ ๋œ๋‹ค๋Š” ๊ฒƒ์ด๋‹ค.

  • 1.1.2. 6.1.2 Palindromes

  • Palindrome์ด๋ž€ ์•ž์—์„œ๋ถ€ํ„ฐ ์ฝ์–ด๋„ ๋’ค์—์„œ๋ถ€ํ„ฐ ์ฝ์–ด๋„ ๋˜‘๊ฐ™์€ ๋‹จ์–ด๋ฅผ ์˜๋ฏธํ•œ๋‹ค.
    ~cpp 
    bool isPalindrome(const string& s)
    {
     return equal(s.begin(), s.end(), s.rbegin());
    }
      
  • ์ฐธ ๊น”๋”ํ•˜๋‹ค. rbegin()์€ ์—ญ์‹œ ๋ฐ˜๋ณต์ž๋ฅผ ๋ฆฌํ„ดํ•ด์ฃผ๋Š” ํ•จ์ˆ˜์ด๋‹ค. ๊ฑฐ๊พธ๋กœ ๊ฐ„๋‹ค. equalํ•จ์ˆ˜๋Š” ๋‘๊ฐœ์˜ ๊ตฌ๊ฐ„์„ ๋น„๊ตํ•ด์„œ ๊ฐ™์„ ๊ฒฝ์šฐ bool ์˜ true ๊ฐ’์„ ๋ฆฌํ„ดํ•œ๋‹ค. ํŒŒ๋ผ๋งคํ„ฐ๋กœ ์ฒซ๋ฒˆ์งธ ๊ตฌ๊ฐ„์˜ ์‹œ์ž‘๊ณผ ๋, ๋‘๋ฒˆ์งธ ๊ตฌ๊ฐ„์˜ ์‹œ์ž‘ iterator ๋ฅผ ๋ฐ›๋Š”๋‹ค. ๋‘๋ฒˆ์งธ ๊ตฌ๊ฐ„์˜ ๋์„ ๋‚˜ํƒ€๋‚ด๋Š” iterator ๋ฅผ ์š”๊ตฌํ•˜์ง€ ์•Š๋Š” ์ด์œ ๋Š”, ๋‘๊ฐœ์˜ ๊ตฌ๊ฐ„์˜ ๊ธธ์ด๊ฐ€ ๊ฐ™๋‹ค๊ณ  ๊ฐ€์ •ํ•˜๊ธฐ ๋•Œ๋ฌธ์ด๋‹ค. ์ด๋Š” equal ํ•จ์ˆ˜์˜ ๋™์ž‘์„ ์ƒ๊ฐํ•ด ๋ณผ๋•Œ ํ•ฉ๋‹นํ•œ ์ฒ˜๋ฆฌ์ด๋‹ค.
  • 1.1.3. 6.1.3 Finding URL


    ~cpp 
    #ifndef GUARD_urls_h
    #define GUARD_urls_h
    #include <vector>
    #include <string>
    std::vector<std::string> find_urls(const std::string& s);
    #endif
      

    ~cpp 
    #include <algorithm>
    #include <cctype>
    #include <string>
    #include <vector>
    #include "urls.h"
    
    using std::find;
    using std::find_if;
    using std::isalnum;
    using std::isalpha;
    using std::isdigit;
    using std::search;
    using std::string;
    using std::vector;
    
    bool not_url_char(char);
    string::const_iterator url_end(string::const_iterator, string::const_iterator);
    string::const_iterator url_beg(string::const_iterator, string::const_iterator);
    
    vector<string> find_urls(const string& s)
    {
     vector<string> ret;
     typedef string::const_iterator iter;
     iter b = s.begin(), e = s.end();
    
     // look through the entire input
     while (b != e) {
      // look for one or more letters followed by `://'
      b = url_beg(b, e);
      // if we found it
      if (b != e) {
       // get the rest of the \s-1URL\s0
       iter after = url_end(b, e);
       // remember the \s-1URL\s0
       ret.push_back(string(b, after));
       // advance `b' and check for more \s-1URL\s0s on this line
       b = after;
      }
     }
     return ret;
    }
    
    string::const_iterator url_end(string::const_iterator b, string::const_iterator e)
    {
     return find_if(b, e, not_url_char);
    }
    
    // find_if ํ•จ์ˆ˜์˜ ํ…Œ์ŠคํŒ…์— ์ด์šฉ๋˜๋Š” ํ•จ์ˆ˜์ด๋‹ค. char์€ string ์˜ iterator์˜ ๊ฐ’์ด๋‹ค.
    bool not_url_char(char c)
    {
     // characters, in addition to alphanumerics, that can appear in a \s-1URL\s0
     static const string url_ch = "~;/?:@=&$-_.+!*'(),";
     // see whether `c' can appear in a \s-1URL\s0 and return the negative
     return !(isalnum(c) ||
              find(url_ch.begin(), url_ch.end(), c) != url_ch.end());
    }
    
    //์ด ์˜ˆ์ œ์˜ ํ•ต์‹ฌ ํ•จ์ˆ˜์ด๋‹ค.
    string::const_iterator url_beg(string::const_iterator b, string::const_iterator e)
    {
     /*
      b ๋Š” protocol type์˜ ์‹œ์ž‘์œ„์น˜๋ฅผ ๊ฐ€๋ฅดํ‚ค๊ฒŒ๋œ๋‹ค.
      i ๋Š” :// ์˜ ์‹œ์ž‘ ์œ„์น˜๋ฅผ ๊ฐ€๋ฆฌํ‚ค๋Š” ์—ญํ• ์„ ํ•œ๋‹ค.
      e ๋Š” url์˜ ๋งˆ์ง€๋ง‰ ํ…์ŠคํŠธ๋ฅผ ๊ฐ€๋ฆฌํ‚ค๋Š” ์—ญํ• ์„ ํ•œ๋‹ค.
      */
     static const string sep = "://";
     typedef string::const_iterator iter;
    
     // `i' marks where the separator was found
     iter i = b;
    
     // string ์—์„œ sep ์˜ ๋ฌธ์ž์—ด์˜ ์‹œ์ž‘๋ถ€๋ถ„์„ ์ฐพ์•„์„œ i์— iterator๋ฅผ ๋Œ€์ž…ํ•œ ํ›„ e์™€ ๋น„๊ตํ•˜์—ฌ
     // ๊ฐ™์ง€ ์•Š์œผ๋ฉด ์‹คํ–‰ํ•œ๋‹ค. (์ฆ‰, sep๋ฅผ ์ฐพ์•˜์„ ๊ฒฝ์šฐ)
     while ((i = search(i, e, sep.begin(), sep.end())) != e) {
      // make sure the separator isn't at the beginning or end of the line
      if (i != b && i + sep.size() != e) {
       // `beg' marks the beginning of the protocol-name
       iter beg = i;
       while (beg != b && isalpha(beg[-1]))
        --beg; //protocol-typed์˜ ์œ„์น˜์— ์กด์žฌํ•˜๋Š” ๋ฌธ์ž์—ด์ด ์กฐ๊ฑด์— ๋งž์„ ๊ฒฝ์šฐ ์•ž์œผ๋กœ ํ•œ์นธ์”ฉ ์›€์ง์ด๋ฉด์„œ ๊ฒ€์‚ฌํ•œ๋‹ค.
       // is there at least one appropriate character before and after the separator?
       if (beg != i && !not_url_char(i[sep.size()]))
        return beg;
      }
      // the separator we found wasn't part of a \s-1URL\s0; advance `i' past this separator
      i += sep.size();
     }
     return e;
    }
      
  • ์ด ์˜ˆ์ œ๋Š” string STL์„ ์ด์šฉํ•ด์„œ ๋ฌธ์ž์—ด์„ ๊ฒ€์ƒ‰ํ•˜๊ณ , ์šฐ๋ฆฌ์—๊ฒŒ ๋งž๋Š” ์ •๋ณด๋ฅผ ๊ฐ€๊ณตํ•˜๋Š” ๊ฒƒ์ด ๋ชฉ์ ์ด๋‹ค.
  • protocol-type://domainname ์˜ ํ˜•ํƒœ๋ฅผ ๊ฒ€์‚ฌํ•œ๋‹ค.
  • search(b, e, b2, e3) [b, e)์˜ ๋ฌธ์ž์—ด ์‹œํ€€์Šค์—์„œ [b2, e3) ๋ฌธ์ž์—ด ์‹œํ€€์Šค๋ฅผ ์ฐพ๋Š”๋‹ค.
  • find(b, e, t) ๋ฌธ์ž์—ด ์‹œํ€€์Šค [b, e)์—์„œ ๊ฐ’ t๋ฅผ ์ฐพ๋Š”๋‹ค.
  • find_if(b, e, p) ๋ฌธ์ž์—ด ์‹œํ€€์Šค [b, e)์—์„œ ํ•จ์ˆ˜ p๋ฅผ ํ†ตํ•ด ํ…Œ์ŠคํŠธํ•œ๋‹ค.
  • static ์Šคํ† ๋ฆฌ์ง€ ์ง€์ •์ž๋Š” ํ•จ์ˆ˜์˜ ์ตœ์ดˆ ์ƒ์„ฑ์‹œ ์ €์žฅ๊ณต๊ฐ„์— ๋‹จ ํ•œ๋ฒˆ๋งŒ ํ• ๋‹น๋˜๋ฉฐ, ๋‹ค์‹œ ํ˜ธ์ถœ์„ ํ•˜์—ฌ๋„ ์ƒˆ๋กœ ํ• ๋‹น๋˜์ง€ ์•Š๋Š”๋‹ค.

  • 1.2. 6.2 Comparing grading schemes

    Chapter 4.2์—์„œ ์ œ์‹œ๋œ ์ค‘์•™๊ฐ’์„ ์ด์šฉํ•œ ๋ฐฉ์‹์œผ๋กœ ์„ฑ์ ์„ ๊ณ„์‚ฐํ•  ๊ฒฝ์šฐ ์•…์˜์ ์œผ๋กœ
    ๊ณผ์ œ๋ฌผ์„ ์ œ์ถœํ•˜์ง€ ์•Š๋Š” ํ•™์ƒ์˜ ๋ฐœ์ƒ์ด ์—ผ๋ ค๋œ๋‹ค.
    ๊ณผ์—ฐ ์–ด๋А ์ •๋„๋กœ ๊ฒฐ๊ณผ์— ์˜ํ–ฅ์„ ์ฃผ๋Š”์ง€ ์‹ค์ œ๋กœ ํ”„๋กœ๊ทธ๋žจ์„ ์ž‘์„ฑํ•˜์—ฌ ํ™•์ธํ•ด๋ณธ๋‹ค.
  • ์ค‘์•™๊ฐ’ ๋Œ€์‹  ํ‰๊ท ์„ ์‚ฌ์šฉํ•˜๋ฉฐ, ์ œ์ถœํ•˜์ง€ ์•Š์€ ๊ณผ์ œ์—๋Š” 0์ ์„ ์ฃผ๋Š” ๋ฐฉ์‹(6.2.3)
  • ์‹ค์ œ๋กœ ์ œ์ถœํ•œ ๊ณผ์ œ์— ๋Œ€ํ•ด์„œ๋งŒ ์ค‘์•™๊ฐ’์„ ์ ์šฉํ•˜๋Š” ๋ฐฉ๋ฒ•(6.2.4)
  • ์ค‘์•™๊ฐ’์„ ์ด์šฉํ•˜์—ฌ ํ‰๊ท ์„ ์ด์šฉ(6.2.2)

  • ์ด๋ฅผ ์œ„ํ•œ ์„ธ๋ถ€์ž‘์—…
    1. ๋ชจ๋“  ํ•™์ƒ์˜ ๋ ˆ์ฝ”๋“œ๋ฅผ ์ฝ์–ด๋“ค์—ฌ, ๋ชจ๋“  ๊ณผ์ œ๋ฅผ ์ œ์ถœํ•œ ํ•™์ƒ๋“ค๊ณผ ๊ทธ๋ ‡์ง€ ์•Š์€ ํ•™์ƒ๋“ค์„ ๊ตฌ๋ถ„ํ•ฉ๋‹ˆ๋‹ค.(6.2.1)
    2. ๋‘ ๊ณ„์‚ฐ๋ฒ•์„(์œ„์˜1,2๋ฅผ ์˜๋ฏธ, 3๋„ ํฌํ•จํ•ด์•ผํ• ๋“ฏ..@,.@) ๊ฐ ๊ทธ๋ฃน์˜ ๋ชจ๋“  ํ•™์ƒ๋“ค์—๊ฒŒ ๊ฐ๊ฐ ์ ์šฉํ•˜๊ณ , ๊ฐ ๊ทธ๋ฃน์˜ ์ค‘์•™ ๊ฐ’์„ ์ถœ๋ ฅํ•ฉ๋‹ˆ๋‹ค.(6.2.2)

    1.2.1. 6.2.1 Working with student records


    1.2.1.1. ๋ชจ๋“  ๊ณผ์ œ๋ฅผ ์ œ์ถœํ–ˆ๋Š”์ง€๋ฅผ ํŒ๋ณ„ํ•˜๋Š” ํ•จ์ˆ˜


    ~cpp 
      bool did_all_hw(const Student_info& s)
      {
      	return ((find(s.homework.begin(), s.homework.end(), 0)) ==
      		s.homework.end());
      }
     
    findํ•จ์ˆ˜๋Š” ์ฒ˜์Œ๋‘๊ฐœ์˜ ์ „๋‹ฌ์ธ์ž ๋ฒ”์œ„์—์„œ ์„ธ๋ฒˆ์งธ ์ „๋‹ฌ์ธ์ž์˜ ๊ฐ’์„ ์ฐพ์ง€ ๋ชปํ•˜๋ฉด 2๋ฒˆ์งธ ์ „๋‹ฌ์ธ์ž๋ฅผ ๋ฆฌํ„ดํ•œ๋‹ค. (์ฐพ์œผ๋ฉด ์ฒซ๋ฒˆ์งธ์ „๋‹ฌ์ธ์ž
    ๋ฅผ ๋ฆฌํ„ดํ•œ๋‹ค๋˜๋ฐ...@,.@์ž˜๋ชป๋œ๊ฑฐ ์•„๋‹Œ๊ฐ€??) ๊ณ ๋กœ ์ฐพ์ง€๋ชปํ•˜๋ฉด s.homework.begin() == s.homework.begin()์ด ๋˜๋ฏ€๋กœ true๋ฅผ ๋ฆฌํ„ดํ•จ

    1.2.1.2. ํ•™์ƒ ๋ ˆ์ฝ”๋“œ๋ฅผ ์ฝ๊ณ  ๋ถ„๋ฅ˜ํ•˜๋Š” ์ฝ”๋“œ


    ~cpp 
      vector<Student_info> did, didnt;
      // read the student records and partition them
      Student_info student;
      while (read(cin, student)) {
       if (did_all_hw(student))
        did.push_back(student);
       else 
        didnt.push_back(student);
      }
     	 // verify that the analyses will show us something
      if (did.empty()) {
      cout << "No student did all the homework!" << endl;
       return 1;
      }
     
      if (didnt.empty()) {
      cout << "Every student did all the homework!" << endl;
       return 1;
      } 
     
    empty๋ฉค๋ฒ„ํ•จ์ˆ˜: ์ปจํ…Œ์ด๋„ˆ๊ฐ€ ๋น„์–ด ์žˆ์œผ๋ฉด true, ์•„๋‹ˆ๋ฉด false๋ฆฌํ„ด

    1.2.2. 6.2.2 Analyzing the grades

    1.2.2.1. ์ดˆ๊ธฐ median_analysis ํ•จ์ˆ˜


    ~cpp 
    // ์ด ํ•จ์ˆ˜๋Š” ์ œ๋Œ€๋กœ ๋™์ž‘ํ•˜์ง€ ์•Š์Šต๋‹ˆ๋‹ค.
    double median_anlysis(const vector<Strudent_info>& students)
    {
    	vector<double> grades;
    	transform(students.begin(), students.end(),
    		back_inserter(grades), grade);
    	return median(grades);
    }
     
    transformํ•จ์ˆ˜: ์ฒ˜์Œ2๊ฐœ์˜ ์ „๋‹ฌ์ธ์ž ๋ฒ”์˜์˜ ๊ฐ’๋“ค์„ 4๋ฒˆ์งธํ•จ์ˆ˜์— ๋Œ€์ž… ๋ฆฌํ„ด๊ฐ’์„ 3๋ฒˆ์งธ ์ฃผ์†Œ๋ถ€ํ„ฐ ๋„ฃ์Œ(?)
    ๋ฌธ์ œ์ 
  • gradeํ•จ์ˆ˜๋Š” ์˜ค๋ฒ„๋ผ์ด๋”ฉ๋œ ํ•จ์ˆ˜์ด๋ฏ€๋กœ ์ปดํŒŒ์ผ๋Ÿฌ๊ฐ€ ์ „๋‹ฌ์ธ์ž๋ฅผ ํŒŒ์•…ํ•˜์ง€ ๋ชปํ•จ
  • ๊ณผ์ œ๋ฅผ ํ•˜๋‚˜๋„ ๋‚ด์ง€ ์•Š์€ ํ•™์ƒ์ผ๊ฒฝ์šฐ ์˜ค๋ฅ˜ ๋ฐœ์ƒ
  • 1.2.2.2. ํ•ด๊ฒฐ์ฑ…

    ์ƒˆ๋กœ์šด ํ•จ์ˆ˜ grade_aux ์ž‘์„ฑ
    ~cpp 
    double grade_aux(const Student_info& s)
    {
    	try{
    		return grade(s);
    	} catch(domain_error) {
    		return grade(s.midterm, s.final, 0);
    	}
    }
     

    median_anlysisํ•จ์ˆ˜ ์ˆ˜์ •
    ~cpp 
    double median_anlysis(const vector<Strudent_info>& students)
    {
    	vector<double> grades;
    	transform(students.begin(), students.end(),
    		back_inserter(grades), grade_aux);  //grade๋ฅผ grade_aux๋กœ ์ˆ˜์ •
    	return median(grades);
    }
     

    1.2.2.3. write_analysisํ•จ์ˆ˜ ์ž‘์„ฑ


    ~cpp 
    void write_analysis(ostream& out, const string& name,
    				double analysis(const vector<Student_info>&),
    				const vector<Student_infor>& did,
    				const vector<Student_infor>& didnt)
    {
    	cout << name << ": median(did) = " << analysis(did) <<
    				", median(didnt) = " << analysis(didnt) << endl;
    }
     

    1.2.2.4. mainํ•จ์ˆ˜


    ~cpp 
    int main()
    {
     // students who did and didn't do all their homework
     vector<Student_info> did, didnt;
     // read the student records and partition them
     Student_info student;
     while (read(cin, student)) {
      if (did_all_hw(student))
       did.push_back(student);
      else 
       didnt.push_back(student);
     }
    	 // verify that the analyses will show us something
     if (did.empty()) {
     cout << "No student did all the homework!" << endl;
      return 1;
     }
     
     if (didnt.empty()) {
     cout << "Every student did all the homework!" << endl;
      return 1;
     }
    
     // do the analyses
     write_analysis(cout, "median", median_analysis, did, didnt);
     write_analysis(cout, "average", average_analysis, did, didnt);
     write_analysis(cout, "median of homework turned in",
                    optimistic_median_analysis, did, didnt);
     return 0;
    }
     

    1.2.3. 6.2.3 Grading based on average homework grade

    ํ‰๊ท  ๊ณผ์ œ ์„ฑ์ ์— ๊ธฐ๋ฐ˜ํ•œ ์„ฑ์  ๊ณ„์‚ฐ

    1.2.3.1. averageํ•จ์ˆ˜


    ~cpp 
    double average(const vector<double>& v)
    {
    	return accumulate(v.begin(), v.end(), 0.0) / v.size();
    }
     
    accumulateํ•จ์ˆ˜: ์ฒ˜์Œ2๊ฐœ์˜ ์ „๋‹ฌ์ธ์ž๋ฅผ 3๋ฒˆ์งธ ์ „๋‹ฌ์ธ์ž์— ๋ˆ„์ ์‹œํ‚ด(์ฃผ์˜ 0.0๋Œ€์‹  0์„ ์‚ฌ์šฉํ•˜๋ฉด ์ •์ˆ˜๋กœ ์ธ์‹ ์†Œ์ˆ˜์  ๋ถ€๋ถ„์„ ๋ฒ„๋ ค๋ฒ„๋ฆผ)
  • ์ดํ•จ์ˆ˜๋ฅผ ์‚ฌ์šฉํ•˜๊ธฐ ์œ„ํ•ด์„œ๋Š” <numeric>์„ include ํ•ด์ค˜์•ผ ํ•œ๋‹ค.
  • 1.2.3.2. average_gradeํ•จ์ˆ˜


    ~cpp 
    double average_grade(const Student_info& s)
    {
    	return grade(s.midterm, s.final, average(s.homework));
    }
     

    1.2.3.3. average_analysisํ•จ์ˆ˜


    ~cpp 
    double average_analysis(const vector<Student_info>& students)
    {
    	vector<double> grades;
    	transform(students.begin(), students.end(),
    		back_inserter(gardes), aveage_grade);
    	return median(grades);
    }
     

    1.2.4. 6.2.4 Median of the completed homework

    ์™„๋ฃŒ๋œ ๊ณผ์ œ์˜ ์ค‘์•™ ๊ฐ’

    1.2.4.1. optimistic_medianํ•จ์ˆ˜


    ~cpp 
    // s์˜ 0์ด ์•„๋‹Œ ์š”์†Œ๋“ค์˜ ์ค‘์•™ ๊ฐ’, ๋งŒ์•ฝ 0์ด ์•„๋‹Œ ์š”์†Œ๊ฐ€ ํ•˜๋‚˜๋„ ์—†๋‹ค๋ฉด ๊ฒฐ๊ณผ๋Š” 0์ด ๋ฉ๋‹ˆ๋‹ค.
    double optimistic_median(const Student_info& s)
    {
    	vector<double> nonzero;
    	remove_copy(s.homework.begin(), s.homework.end(),
    				back_inserter(nonzero), 0);
    	if(nozero.empty())
    		return grade(s.midterm, s.final, 0);
    	else
    		return grade(s.midterm, s.final, median(nonzero));
    }
     

    1.2.4.2. optimistic_median_analysisํ•จ์ˆ˜

    ์ˆ™์ œ๋ผ๋„ค์š”..ใ…Žใ…Ž
    AcceleratedC++/Chapter6/Code

    1.3. 6.3 Classifying students, revisited

    5์žฅ์—์„œ ์‚ฌ์šฉํ•œ list๋ฅผ ์‚ฌ์šฉํ•˜์ง€ ์•Š๊ณ , vector๋ฅผ ๊ทธ๋Œ€๋กœ ์‚ฌ์šฉํ•˜์—ฌ ๊ทธ์™€ ๋น„์Šทํ•œ ์„ฑ๋Šฅ์˜ ์•Œ๊ณ ๋ฆฌ์ฆ˜

    1.3.1. 6.3.1 A two -pass solution

    ==== extract_fails ํ•จ์ˆ˜====
    ~cpp 
    vector<Student_info> extract_fails(vector<Student_info>& students){
    	vector<Student_info> fail;
    	remove_copy_if(student.begin(), stduents.end(),
    				back_inserter(fail), pgrade);
    	students.erase(remove_if(studens.begin(), students.end(),
    						fgrade), stduents.end());
    	return fail;
    }
     
    remove_copy_ifํ•จ์ˆ˜: ์ฒ˜์Œ 2๊ฐœ์˜ ์ „๋‹ฌ์ธ์ž ๋ฒ”์˜์˜๊ฐ’๋“ค์„ 4๋ฒˆ์งธ ์ „๋‹ฌ์ธ์ž ํ•จ์ˆ˜๋ฅผ ๋งŒ์กฑํ•˜์ง€ ์•Š๋Š” ํ•จ์ˆ˜๋งŒ 3๋ฒˆ์งธ ์ „๋‹ฌ์ธ์ž์— ๋ณต์‚ฌ
    remove_ifํ•จ์ˆ˜: ์ฒ˜์Œ 2๊ฐœ์˜ ์ „๋‹ฌ์ธ์ž ๋ฒ”์œ„์˜ ๊ฐ’๋“ค์ค‘ 3๋ฒˆ์งธ ์ „๋‹ฌ์ธ์ž๋ฅผ ๋งŒ์กฑํ•˜๋Š” ํ•จ์ˆ˜๋ฅผ ์ปจํ…Œ์ด๋„ˆ์˜ ๋’ค๋กœ ์ด๋™. 3๋ฒˆ์งธ ์ „๋‹ฌ์ธ์ž๋ฅผ ๋งŒ์กฑํ•˜๋Š” ๊ฐ’์ค‘ ์ ค์ฒซ์งธ๊ฐ’์„ ๊ฐ€๋ฅด์นจ
    erase๋ฉค๋ฒ„ํ•จ์ˆ˜:์ฒ˜์Œ 2๊ฐœ์˜ ์ „๋‹ฌ์ธ์ž ๋ฒ”์œ„์˜ ๊ฐ’์„ ์ง€์šด๋‹ค.

    1.3.1.1. pgrade ํ•จ์ˆ˜


    ~cpp 
    bool pgrade(const Student_info& s)
    {
    	return !fgrade(s);
    }
     
    fgradeํ•จ์ˆ˜๋ฅผ ๋ฐ˜์ „์‹œํ‚จ ํ•จ์ˆ˜

    1.3.2. 6.3.2 A single-pass solution


    ~cpp 
    vector<Student_info> extract_fails(vector<Student_info>& students)
    {
    	vector<Student_info>::iterator iter = 
    		stable_partition(students.begin(), students.end9), pgrade);
    	vector<Student_info> fail(iter, stduents.end());
    	students.erase(iter, students.end());
    
    	return fail;
    }
     
    stable_partition, partition ์ฐจ์ด์ ?? ์ˆœ์„œ๋ฅผ ์•ˆ๋ฐ”๊พธ๋‹ค๋‹ˆ?? @,.@
    ํ•˜์ดํŠผ 2ํ•จ์ˆ˜๋Š” ๋งŒ์กฑํ•˜์ง€ ์•Š๋Š” ๊ฐ’์˜ ์ฒซ์งธ ์œ„์น˜๋ฅผ ๋ฆฌํ„ด
    two-pass๋ณด๋‹ค 2๋ฐฐ๋น ๋ฆ„

    1.4. 6.4 Algorithms, containers, and iterators

    ์ปจํ…Œ์ด๋„ˆ์™€ ์•Œ๊ณ ๋ฆฌ์ฆ˜์˜ ๊ด€๊ณ„

    ์•Œ๊ณ ๋ฆฌ์ฆ˜์€ ์ปจํ…Œ์ด๋„ˆ ์š”์†Œ๋“ค์„ ๋‹ค๋ฃน๋‹ˆ๋‹ค. ์ฆ‰, ์ปจํ…Œ์ด๋„ˆ๋ฅผ ๋‹ค๋ฃจ๋Š” ๊ฒƒ์ด ์•„๋‹™๋‹ˆ๋‹ค.
    sort, remove_if, partition ์€ ๋ชจ๋‘ ์š”์†Œ๋ฅผ ์ƒˆ๋กœ์šด ์œ„์น˜๋กœ ์ด๋™์‹œํ‚ค์ง€๋งŒ, ์ปจํ…Œ์ด๋„ˆ ์ž์ฒด์˜ ์†์„ฑ์ธ ํฌ๊ธฐ๋ฅผ ๋ณ€๊ฒฝํ•˜์ง€๋Š” ์•Š๋Š”๋‹ค.
    ์‚ญ์ œ๋ฅผ ํ•˜๊ธฐ ์œ„ํ•ด์„œ๋Š” ๋‹ค์Œ๊ณผ ๊ฐ™์€ ๋ฐฉ์‹์œผ๋กœ ์ปจํ…Œ์ด๋„ˆ์˜ ๋ฉ”์†Œ๋“œ๋ฅผ ์ด์šฉํ•ด์•ผํ•œ๋‹ค.
    ~cpp v.erase(remove_if(students.begin(), students.end(), fgrade), students.end());

    ์ปจํ…Œ์ด๋„ˆ์™€ ๋ฐ˜๋ณต์ž์˜ ๊ด€๊ณ„
    partiton, remove_if, erase, insert์™€ ๊ฐ™์€ ์—ฐ์‚ฐ์€ erase๋œ ๋ฐ˜๋ณต์ž๋ฅผ ๋ฌดํšจํ™”์‹œํ‚จ๋‹ค.
    ๋”ฐ๋ผ์„œ ์ €์žฅ๋œ ๋ฐ˜๋ณต์ž์— ๊ด€ํ•ด์„œ ํ”„๋กœ๊ทธ๋ž˜๋ฐ์„ ํ•˜๋ฉด์„œ ์กฐ์‹ฌํ•ด์•ผํ•  ํ•„์š”๊ฐ€ ์žˆ๋‹ค.
    ๋”ฐ๋ผ์„œ ์ƒ๊ธฐ์™€ ๊ฐ™์€ ํ•จ์ˆ˜๋ฅผ ์ด์šฉํ•œ ๋’ค์—๋Š” ์ด์ „์— ํ• ๋‹น๋œ ๋ฐ˜๋ณต์ž๊ฐ€ ์œ ํšจํ•˜๋‹ค๊ณ  ๋ณด๊ณ  ํ”„๋กœ๊ทธ๋žจ์˜ ๋กœ์ง์„ ๋งŒ๋“ค์–ด์„œ๋Š” ์•ˆ๋œ๋‹ค.

    Valid XHTML 1.0! Valid CSS! powered by MoniWiki
    last modified 2021-02-07 05:22:25
    Processing time 0.0216 sec