Geant4 Cross Reference

Cross-Referencing   Geant4
Geant4/externals/g4tools/include/tools/words

Version: [ ReleaseNotes ] [ 1.0 ] [ 1.1 ] [ 2.0 ] [ 3.0 ] [ 3.1 ] [ 3.2 ] [ 4.0 ] [ 4.0.p1 ] [ 4.0.p2 ] [ 4.1 ] [ 4.1.p1 ] [ 5.0 ] [ 5.0.p1 ] [ 5.1 ] [ 5.1.p1 ] [ 5.2 ] [ 5.2.p1 ] [ 5.2.p2 ] [ 6.0 ] [ 6.0.p1 ] [ 6.1 ] [ 6.2 ] [ 6.2.p1 ] [ 6.2.p2 ] [ 7.0 ] [ 7.0.p1 ] [ 7.1 ] [ 7.1.p1 ] [ 8.0 ] [ 8.0.p1 ] [ 8.1 ] [ 8.1.p1 ] [ 8.1.p2 ] [ 8.2 ] [ 8.2.p1 ] [ 8.3 ] [ 8.3.p1 ] [ 8.3.p2 ] [ 9.0 ] [ 9.0.p1 ] [ 9.0.p2 ] [ 9.1 ] [ 9.1.p1 ] [ 9.1.p2 ] [ 9.1.p3 ] [ 9.2 ] [ 9.2.p1 ] [ 9.2.p2 ] [ 9.2.p3 ] [ 9.2.p4 ] [ 9.3 ] [ 9.3.p1 ] [ 9.3.p2 ] [ 9.4 ] [ 9.4.p1 ] [ 9.4.p2 ] [ 9.4.p3 ] [ 9.4.p4 ] [ 9.5 ] [ 9.5.p1 ] [ 9.5.p2 ] [ 9.6 ] [ 9.6.p1 ] [ 9.6.p2 ] [ 9.6.p3 ] [ 9.6.p4 ] [ 10.0 ] [ 10.0.p1 ] [ 10.0.p2 ] [ 10.0.p3 ] [ 10.0.p4 ] [ 10.1 ] [ 10.1.p1 ] [ 10.1.p2 ] [ 10.1.p3 ] [ 10.2 ] [ 10.2.p1 ] [ 10.2.p2 ] [ 10.2.p3 ] [ 10.3 ] [ 10.3.p1 ] [ 10.3.p2 ] [ 10.3.p3 ] [ 10.4 ] [ 10.4.p1 ] [ 10.4.p2 ] [ 10.4.p3 ] [ 10.5 ] [ 10.5.p1 ] [ 10.6 ] [ 10.6.p1 ] [ 10.6.p2 ] [ 10.6.p3 ] [ 10.7 ] [ 10.7.p1 ] [ 10.7.p2 ] [ 10.7.p3 ] [ 10.7.p4 ] [ 11.0 ] [ 11.0.p1 ] [ 11.0.p2 ] [ 11.0.p3, ] [ 11.0.p4 ] [ 11.1 ] [ 11.1.1 ] [ 11.1.2 ] [ 11.1.3 ] [ 11.2 ] [ 11.2.1 ] [ 11.2.2 ] [ 11.3.0 ] 

  1 // Copyright (C) 2010, Guy Barrand. All rights reserved.
  2 // See the file tools.license for terms.
  3 
  4 #ifndef tools_words
  5 #define tools_words
  6 
  7 #include <string>
  8 #include <vector>
  9 
 10 namespace tools {
 11 
 12 inline void words(const std::string& a_string,const std::string& a_sep,bool a_take_empty,
 13                   std::vector<std::string>& a_words,bool a_clear = true){
 14   //  If a_sep is for exa "|" and for "xxx||xxx" :
 15   //  - a_take_empty false : {"xxx","xxx"} will be created
 16   //    (and NOT {"xxx","","xxx"}).
 17   //  - a_take_empty true : {"xxx","","xxx"} will be created.
 18   if(a_clear) a_words.clear();
 19   if(a_string.empty()) return;
 20   std::string::size_type lim = (a_take_empty?0:1);
 21   if(a_sep.empty()) {
 22     a_words.push_back(a_string);
 23   } else {
 24     std::string::size_type l = a_string.length();
 25     std::string::size_type llimiter = a_sep.length();
 26     std::string::size_type pos = 0;
 27     while(true) {
 28       std::string::size_type index = a_string.find(a_sep,pos);
 29       if(index==std::string::npos){ // Last word.
 30         if((l-pos)>=lim) a_words.push_back(a_string.substr(pos,l-pos));
 31         break;
 32       } else {
 33         //     abcxxxef
 34         //     0  3  67
 35         if((index-pos)>=lim) a_words.push_back(a_string.substr(pos,index-pos));
 36         pos = index + llimiter;
 37       }
 38     }
 39   }
 40 }
 41 
 42 #ifdef TOOLS_DEPRECATED
 43 inline std::vector<std::string> words(const std::string& a_string,const std::string& a_limiter,bool a_take_empty = false){
 44   std::vector<std::string> v;
 45   words(a_string,a_limiter,a_take_empty,v);
 46   return v;
 47 }
 48 #endif //TOOLS_DEPRECATED
 49 
 50 inline void words(const std::string& a_string,
 51                   const std::string& a_sep,bool a_take_empty,
 52                   //output :
 53                   unsigned int& a_wn,
 54                   std::string::size_type a_wps[],
 55                   std::string::size_type a_wls[]){
 56   //used to optimize tools::match().
 57   a_wn = 0;
 58   if(a_string.empty()) return;
 59   std::string::size_type lim = (a_take_empty?0:1);
 60   if(a_sep.empty()) {
 61     //a_words.push_back(a_string);
 62     a_wps[a_wn] = 0;
 63     a_wls[a_wn] = a_string.length();
 64     a_wn++;
 65   } else {
 66     std::string::size_type l = a_string.length();
 67     std::string::size_type llimiter = a_sep.length();
 68     std::string::size_type pos = 0;
 69     while(true) {
 70       std::string::size_type index = a_string.find(a_sep,pos);
 71       if(index==std::string::npos){ // Last word.
 72         if((l-pos)>=lim) {
 73           //a_words.push_back(a_string.substr(pos,l-pos));
 74           a_wps[a_wn] = pos;
 75           a_wls[a_wn] = l-pos;
 76           a_wn++;
 77         }
 78         break;
 79       } else {
 80         //     abcxxxef
 81         //     0  3  67
 82         if((index-pos)>=lim) {
 83           //a_words.push_back(a_string.substr(pos,index-pos));
 84           a_wps[a_wn] = pos;
 85           a_wls[a_wn] = index-pos;
 86           a_wn++;
 87         }
 88         pos = index + llimiter;
 89       }
 90     }
 91   }
 92 }
 93 
 94 }
 95 
 96 #endif