Files
tubestation/toolkit/components/url-classifier/tests/gtest/TestChunkSet.cpp

154 lines
4.1 KiB
C++

/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#include <stdio.h>
#include <stdlib.h>
#include "gtest/gtest.h"
#include "ChunkSet.h"
#include "mozilla/ArrayUtils.h"
TEST(UrlClassifierChunkSet, Empty)
{
mozilla::safebrowsing::ChunkSet chunkSet;
mozilla::safebrowsing::ChunkSet removeSet;
removeSet.Set(0);
ASSERT_FALSE(chunkSet.Has(0));
ASSERT_FALSE(chunkSet.Has(1));
ASSERT_TRUE(chunkSet.Remove(removeSet) == NS_OK);
ASSERT_TRUE(chunkSet.Length() == 0);
chunkSet.Set(0);
ASSERT_TRUE(chunkSet.Has(0));
ASSERT_TRUE(chunkSet.Length() == 1);
ASSERT_TRUE(chunkSet.Remove(removeSet) == NS_OK);
ASSERT_FALSE(chunkSet.Has(0));
ASSERT_TRUE(chunkSet.Length() == 0);
}
TEST(UrlClassifierChunkSet, Main)
{
static int testVals[] = {2, 1, 5, 6, 8, 7, 14, 10, 12, 13};
mozilla::safebrowsing::ChunkSet chunkSet;
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(testVals); i++) {
chunkSet.Set(testVals[i]);
}
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(testVals); i++) {
ASSERT_TRUE(chunkSet.Has(testVals[i]));
}
ASSERT_FALSE(chunkSet.Has(3));
ASSERT_FALSE(chunkSet.Has(4));
ASSERT_FALSE(chunkSet.Has(9));
ASSERT_FALSE(chunkSet.Has(11));
ASSERT_TRUE(chunkSet.Length() == MOZ_ARRAY_LENGTH(testVals));
}
TEST(UrlClassifierChunkSet, Merge)
{
static int testVals[] = {2, 1, 5, 6, 8, 7, 14, 10, 12, 13};
static int mergeVals[] = {9, 3, 4, 20, 14, 16};
mozilla::safebrowsing::ChunkSet chunkSet;
mozilla::safebrowsing::ChunkSet mergeSet;
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(testVals); i++) {
chunkSet.Set(testVals[i]);
}
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(mergeVals); i++) {
mergeSet.Set(mergeVals[i]);
}
chunkSet.Merge(mergeSet);
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(testVals); i++) {
ASSERT_TRUE(chunkSet.Has(testVals[i]));
}
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(mergeVals); i++) {
ASSERT_TRUE(chunkSet.Has(mergeVals[i]));
}
// -1 because 14 is duplicated in both sets
ASSERT_TRUE(chunkSet.Length() ==
MOZ_ARRAY_LENGTH(testVals) + MOZ_ARRAY_LENGTH(mergeVals) - 1);
ASSERT_FALSE(chunkSet.Has(11));
ASSERT_FALSE(chunkSet.Has(15));
ASSERT_FALSE(chunkSet.Has(17));
ASSERT_FALSE(chunkSet.Has(18));
ASSERT_FALSE(chunkSet.Has(19));
}
TEST(UrlClassifierChunkSet, RemoveClear)
{
static int testVals[] = {2, 1, 5, 6, 8, 7, 14, 10, 12, 13};
static int mergeVals[] = {3, 4, 9, 16, 20};
mozilla::safebrowsing::ChunkSet chunkSet;
mozilla::safebrowsing::ChunkSet mergeSet;
mozilla::safebrowsing::ChunkSet removeSet;
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(testVals); i++) {
chunkSet.Set(testVals[i]);
removeSet.Set(testVals[i]);
}
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(mergeVals); i++) {
mergeSet.Set(mergeVals[i]);
}
ASSERT_TRUE(chunkSet.Merge(mergeSet) == NS_OK);
ASSERT_TRUE(chunkSet.Remove(removeSet) == NS_OK);
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(mergeVals); i++) {
ASSERT_TRUE(chunkSet.Has(mergeVals[i]));
}
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(testVals); i++) {
ASSERT_FALSE(chunkSet.Has(testVals[i]));
}
chunkSet.Clear();
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(mergeVals); i++) {
ASSERT_FALSE(chunkSet.Has(mergeVals[i]));
}
}
TEST(UrlClassifierChunkSet, Serialize)
{
static int testVals[] = {2, 1, 5, 6, 8, 7, 14, 10, 12, 13};
static int mergeVals[] = {3, 4, 9, 16, 20};
mozilla::safebrowsing::ChunkSet chunkSet;
mozilla::safebrowsing::ChunkSet mergeSet;
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(testVals); i++) {
chunkSet.Set(testVals[i]);
}
for (size_t i = 0; i < MOZ_ARRAY_LENGTH(mergeVals); i++) {
mergeSet.Set(mergeVals[i]);
}
chunkSet.Merge(mergeSet);
nsAutoCString mergeResult;
chunkSet.Serialize(mergeResult);
printf("mergeResult: %s\n", mergeResult.get());
nsAutoCString expected(NS_LITERAL_CSTRING("1-10,12-14,16,20"));
ASSERT_TRUE(mergeResult.Equals(expected));
}