本文整理汇总了C++中HuffmanTree::countFrequency方法的典型用法代码示例。如果您正苦于以下问题：C++ HuffmanTree::countFrequency方法的具体用法？C++ HuffmanTree::countFrequency怎么用？C++ HuffmanTree::countFrequency使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类HuffmanTree的用法示例。
在下文中一共展示了HuffmanTree::countFrequency方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: SECTION
#include <stdio.h>
#include <unordered_map>
#include "huffman.h"
using namespace ptlmuh006;
TEST_CASE("Files correctly compressed", "[compression]") {
HuffmanTree huff;
SECTION("Frequency table corectly generated") {
//GIVEN: A string of data
std::string data = "aaabbbccc dddddddddd\nccc";
//WHEN: We count the frequency of the characters in the string of data
std::unordered_map<char, int> freqTbl = huff.countFrequency(data);
//THEN: We should get a correct frequency table with characters mapped to tallys
REQUIRE( freqTbl.size() == 6 );
REQUIRE( freqTbl['a'] == 3 );
REQUIRE( freqTbl['b'] == 3 );
REQUIRE( freqTbl['c'] == 6 );
REQUIRE( freqTbl[' '] == 3 );
REQUIRE( freqTbl['d'] == 10 );
REQUIRE( freqTbl['\n'] == 1 );
}
SECTION("Tree correctly built") {
//GIVEN: A string of data and it's corresponding frequency table
std::string data = "aabbbcccc";
std::unordered_map<char, int> freqTbl = {{'a', 2}, {'b', 3}, {'c', 4}};