text: #ifndef SRC_INCLUDE_UTIL_H_
  #define SRC_INCLUDE_UTIL_H_
  /*
   Copyright (c) [2012-], Josef Robert Novak
   All rights reserved.
  
   Redistribution and use in source and binary forms, with or without
    modification, are permitted #provided that the following conditions
    are met:
  
    * Redistributions of source code must retain the above copyright
      notice, this list of conditions and the following disclaimer.
    * Redistributions in binary form must reproduce the above
      copyright notice, this list of #conditions and the following
      disclaimer in the documentation and/or other materials provided
      with the distribution.
  
   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
   FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
   COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
   INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
   (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
   SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
   STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
   ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
   OF THE POSSIBILITY OF SUCH DAMAGE.
  *
  */
  #include <fst/fstlib.h>
  #include <utf8.h>
  #include <unordered_map>
  #include <string>
  #include <vector>
  #ifdef __MACH__
  #include <mach/clock.h>
  #include <mach/mach.h>
  #endif
  using namespace fst;
  
  struct VectorIntHash {
    size_t operator () (const std::vector<int>& v) const {
      size_t result = 0;
      std::hash<int> hash_fn;
  
      for (size_t i = 0; i < v.size(); i++)
        result ^= hash_fn (v[i]) + 0x9e3779b9 + (result << 6)
          + (result >> 2);
      return result;
    }
  };
  
  typedef std::unordered_map<int, std::vector<int> > SymbolMap12M;
  typedef std::unordered_map<std::vector<int>, int, VectorIntHash> SymbolMapM21;
  typedef std::unordered_set<int> VetoSet;
  
  typedef struct LabelDatum {int max, tot, lhs, rhs; bool lhsE, rhsE;} LabelDatum;
  typedef std::unordered_map<LogArc::Label, LabelDatum> LabelData;
  
  std::string vec2str (std::vector<std::string> vec, std::string sep);
  
  std::string itoas (int i);
  
  std::vector<std::string> tokenize_utf8_string (std::string* utf8_string, std::string* delimiter);
  
  std::vector<std::string> tokenize_entry (std::string* testword, std::string* sep,
                                 SymbolTable* syms);
  
  std::vector<int> tokenize2ints (std::string* word, std::string* sep, const SymbolTable* syms);
  
  timespec get_time( );
  
  timespec diff (timespec start, timespec end);
  
  void PhonetisaurusSetFlags (const char* usage, int* argc, char*** argv,
                              bool remove_flags);
  
  void LoadWordList (const std::string& filename,
                     std::vector<std::string>* corpus);
  
  void Split (const std::string& s, char delim, std::vector<std::string>& elems);
  
  #endif  // SRC_INCLUDE_UTIL_H_
  