cppjieba_rb 0.3.3 → 0.4.0

data/ext/cppjieba/test/unittest/trie_test.cpp

@@ -1,177 +0,0 @@
-#include "cppjieba/DictTrie.hpp"
-#include "cppjieba/MPSegment.hpp"
-#include "gtest/gtest.h"
-
-using namespace cppjieba;
-
-static const char* const DICT_FILE = "../test/testdata/extra_dict/jieba.dict.small.utf8";
-
-TEST(TrieTest, Empty) {
-  vector<Unicode> keys;
-  vector<const DictUnit*> values;
-  Trie trie(keys, values);
-}
-
-TEST(TrieTest, Construct) {
-  vector<Unicode> keys;
-  vector<const DictUnit*> values;
-  keys.push_back(DecodeRunesInString("你"));
-  values.push_back((const DictUnit*)(NULL));
-  Trie trie(keys, values);
-}
-
-TEST(DictTrieTest, NewAndDelete) {
-  DictTrie * trie;
-  trie = new DictTrie(DICT_FILE);
-  delete trie;
-}
-
-TEST(DictTrieTest, Test1) {
-  string s1, s2;
-  DictTrie trie(DICT_FILE);
-  ASSERT_LT(trie.GetMinWeight() + 15.6479, 0.001);
-  string word("来到");
-  cppjieba::RuneStrArray uni;
-  ASSERT_TRUE(DecodeRunesInString(word, uni));
-  //DictUnit nodeInfo;
-  //nodeInfo.word = uni;
-  //nodeInfo.tag = "v";
-  //nodeInfo.weight = -8.87033;
-  //s1 << nodeInfo;
-  //s2 << (*trie.Find(uni.begin(), uni.end()));
-  const DictUnit* du = trie.Find(uni.begin(), uni.end());
-  ASSERT_TRUE(du != NULL);
-  ASSERT_EQ(2u, du->word.size());
-  ASSERT_EQ(26469u, du->word[0]);
-  ASSERT_EQ(21040u, du->word[1]);
-  ASSERT_EQ("v", du->tag);
-  ASSERT_NEAR(-8.870, du->weight, 0.001);
-
-  //EXPECT_EQ("[\"26469\", \"21040\"] v -8.870", s2);
-  word = "清华大学";
-  LocalVector<pair<size_t, const DictUnit*> > res;
-  const char * words[] = {"清", "清华", "清华大学"};
-  for (size_t i = 0; i < sizeof(words)/sizeof(words[0]); i++) {
-    ASSERT_TRUE(DecodeRunesInString(words[i], uni));
-    res.push_back(make_pair(uni.size() - 1, trie.Find(uni.begin(), uni.end())));
-    //resMap[uni.size() - 1] = trie.Find(uni.begin(), uni.end());
-  }
-  vector<pair<size_t, const DictUnit*> > vec;
-  vector<struct Dag> dags;
-  ASSERT_TRUE(DecodeRunesInString(word, uni));
-  trie.Find(uni.begin(), uni.end(), dags);
-  ASSERT_EQ(dags.size(), uni.size());
-  ASSERT_NE(dags.size(), 0u);
-  s1 << res;
-  s2 << dags[0].nexts;
-  ASSERT_EQ(s1, s2);
-  
-}
-
-TEST(DictTrieTest, UserDict) {
-  DictTrie trie(DICT_FILE, "../test/testdata/userdict.utf8");
-  string word = "云计算";
-  cppjieba::RuneStrArray unicode;
-  ASSERT_TRUE(DecodeRunesInString(word, unicode));
-  const DictUnit * unit = trie.Find(unicode.begin(), unicode.end());
-  ASSERT_TRUE(unit != NULL);
-  ASSERT_NEAR(unit->weight, -14.100, 0.001);
-
-  word = "蓝翔";
-  ASSERT_TRUE(DecodeRunesInString(word, unicode));
-  unit = trie.Find(unicode.begin(), unicode.end());
-  ASSERT_TRUE(unit != NULL);
-  ASSERT_EQ(unit->tag, "nz");
-  ASSERT_NEAR(unit->weight, -14.100, 0.001);
-
-  word = "区块链";
-  ASSERT_TRUE(DecodeRunesInString(word, unicode));
-  unit = trie.Find(unicode.begin(), unicode.end());
-  ASSERT_TRUE(unit != NULL);
-  ASSERT_EQ(unit->tag, "nz");
-  ASSERT_NEAR(unit->weight, -15.6478, 0.001);
-}
-
-TEST(DictTrieTest, UserDictWithMaxWeight) {
-  DictTrie trie(DICT_FILE, "../test/testdata/userdict.utf8", DictTrie::WordWeightMax);
-  string word = "云计算";
-  cppjieba::RuneStrArray unicode;
-  ASSERT_TRUE(DecodeRunesInString(word, unicode));
-  const DictUnit * unit = trie.Find(unicode.begin(), unicode.end());
-  ASSERT_TRUE(unit);
-  ASSERT_NEAR(unit->weight, -2.975, 0.001);
-}
-
-TEST(DictTrieTest, Dag) {
-  DictTrie trie(DICT_FILE, "../test/testdata/userdict.utf8");
-
-  {
-    string word = "清华大学";
-    cppjieba::RuneStrArray unicode;
-    ASSERT_TRUE(DecodeRunesInString(word, unicode));
-    vector<struct Dag> res;
-    trie.Find(unicode.begin(), unicode.end(), res);
-
-    size_t nexts_sizes[] = {3, 2, 2, 1};
-    ASSERT_EQ(res.size(), sizeof(nexts_sizes)/sizeof(nexts_sizes[0]));
-    for (size_t i = 0; i < res.size(); i++) {
-      ASSERT_EQ(res[i].nexts.size(), nexts_sizes[i]);
-    }
-  }
-
-  {
-    string word = "北京邮电大学";
-    cppjieba::RuneStrArray unicode;
-    ASSERT_TRUE(DecodeRunesInString(word, unicode));
-    vector<struct Dag> res;
-    trie.Find(unicode.begin(), unicode.end(), res);
-
-    size_t nexts_sizes[] = {3, 1, 2, 2, 2, 1};
-    ASSERT_EQ(res.size(), sizeof(nexts_sizes)/sizeof(nexts_sizes[0]));
-    for (size_t i = 0; i < res.size(); i++) {
-      ASSERT_EQ(res[i].nexts.size(), nexts_sizes[i]);
-    }
-  }
-
-  {
-    string word = "长江大桥";
-    cppjieba::RuneStrArray unicode;
-    ASSERT_TRUE(DecodeRunesInString(word, unicode));
-    vector<struct Dag> res;
-    trie.Find(unicode.begin(), unicode.end(), res);
-
-    size_t nexts_sizes[] = {3, 1, 2, 1};
-    ASSERT_EQ(res.size(), sizeof(nexts_sizes)/sizeof(nexts_sizes[0]));
-    for (size_t i = 0; i < res.size(); i++) {
-      ASSERT_EQ(res[i].nexts.size(), nexts_sizes[i]);
-    }
-  }
-
-  {
-    string word = "长江大桥";
-    cppjieba::RuneStrArray unicode;
-    ASSERT_TRUE(DecodeRunesInString(word, unicode));
-    vector<struct Dag> res;
-    trie.Find(unicode.begin(), unicode.end(), res, 3);
-
-    size_t nexts_sizes[] = {2, 1, 2, 1};
-    ASSERT_EQ(res.size(), sizeof(nexts_sizes)/sizeof(nexts_sizes[0]));
-    for (size_t i = 0; i < res.size(); i++) {
-      ASSERT_EQ(res[i].nexts.size(), nexts_sizes[i]);
-    }
-  }
-
-  {
-    string word = "长江大桥";
-    cppjieba::RuneStrArray unicode;
-    ASSERT_TRUE(DecodeRunesInString(word, unicode));
-    vector<struct Dag> res;
-    trie.Find(unicode.begin(), unicode.end(), res, 4);
-
-    size_t nexts_sizes[] = {3, 1, 2, 1};
-    ASSERT_EQ(res.size(), sizeof(nexts_sizes)/sizeof(nexts_sizes[0]));
-    for (size_t i = 0; i < res.size(); i++) {
-      ASSERT_EQ(res[i].nexts.size(), nexts_sizes[i]);
-    }
-  }
-}

data/ext/cppjieba/test/unittest/unicode_test.cpp

@@ -1,43 +0,0 @@
-#include "cppjieba/Unicode.hpp"
-#include "limonp/StdExtension.hpp"
-#include "gtest/gtest.h"
-
-using namespace cppjieba;
-using namespace std;
-
-TEST(UnicodeTest, Test1) {
-  string s = "你好世界";
-  RuneStrArray runes;
-  ASSERT_TRUE(DecodeRunesInString(s, runes));
-  string actual;
-  string expected = "[\"{\"rune\": \"20320\", \"offset\": 0, \"len\": 3}\", \"{\"rune\": \"22909\", \"offset\": 3, \"len\": 3}\", \"{\"rune\": \"19990\", \"offset\": 6, \"len\": 3}\", \"{\"rune\": \"30028\", \"offset\": 9, \"len\": 3}\"]";
-  actual << runes;
-  ASSERT_EQ(expected, actual);
-}
-
-TEST(UnicodeTest, Illegal) {
-  string s = "123\x80";
-  RuneStrArray runes;
-  ASSERT_FALSE(DecodeRunesInString(s, runes));
-  string actual;
-  string expected = "[]";
-  actual << runes;
-  ASSERT_EQ(expected, actual);
-}
-
-TEST(UnicodeTest, Rand) {
-  const size_t ITERATION = 1024;
-  const size_t MAX_LEN = 256;
-  string s;
-  srand(time(NULL));
-
-  for (size_t i = 0; i < ITERATION; i++) {
-    size_t len = rand() % MAX_LEN;
-    s.resize(len);
-    for (size_t j = 0; j < len; j++) {
-      s[rand() % len] = rand();
-    }
-    RuneStrArray runes;
-    DecodeRunesInString(s, runes);
-  }
-}