m                  16 ConcordanceFunc.cpp     boost::smatch m;
m                  19 ConcordanceFunc.cpp     if (boost::regex_search(agent, m, r)) {
m                  20 ConcordanceFunc.cpp         ver = std::atoi(m.str(1).c_str());
m                  32 Functions.cpp      boost::smatch m;
m                  38 Functions.cpp              if (boost::regex_match(buf, m, r1))
m                  41 Functions.cpp              if (boost::regex_match(buf, m, r2)) {
m                  42 Functions.cpp                  string_type value(m.str(1), m.str(2));
m                 220 Functions.cpp      boost::smatch   m, m1;
m                 223 Functions.cpp      if (boost::u32regex_match(s, m, r1))
m                 234 Functions.cpp      if (boost::u32regex_search(s, m, r))
m                 260 Functions.cpp      boost::smatch   m;          // マッチ結果
m                 263 Functions.cpp      if (boost::regex_search(s, m, r4)) {
m                 264 Functions.cpp          if (boost::u32regex_match(s.c_str(), m, r3)) {
m                 267 Functions.cpp              wm[1] = m[2].str(); // 近接隣接演算種別 L(行) or W(語)
m                 268 Functions.cpp              wm[2] = m[3].str(); // 近接隣接演算距離
m                 269 Functions.cpp              wm[3] = m[4].str(); // 近接隣接演算対照ワード
m                 255 WordTree.cpp       boost::smatch m; // マッチ結果
m                 257 WordTree.cpp       if (boost::u32regex_match(wp, m, reg)) {
m                 286 WordTree.cpp       boost::smatch   m; // マッチ結果
m                 289 WordTree.cpp       if (boost::u32regex_search(adj1.c_str(), m, r))
m                 297 WordTree.cpp       if (boost::u32regex_search(adj2.c_str(), m, r))