traxys/tree-sitter
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Extract public compiler API into its own header file

Browse source
This commit is contained in:
Max Brunsfeld 2014-02-16 22:13:08 -08:00
parent 0b4e1c8d0d
commit 9e2dc14182
53 changed files with 466 additions and 409 deletions
Download patch file Download diff file Expand all files Collapse all files

64
character_set_spec.cpp
View file

@ -1,5 +1,5 @@
#include "spec_helper.h"
#include "rules.h"
#include "character_set.h"
using namespace rules;
@ -13,8 +13,8 @@ describe("character sets", []() {
CharacterSet set1({ '\0' });
auto set2 = set1.complement();
AssertThat(set2, Equals(CharacterSet({
{ 1, max_char },
}, true)));
{ 1, max_char }
})));
AssertThat(set2.complement(), Equals(set1));
});
@ -31,56 +31,56 @@ describe("character sets", []() {
describe("computing unions", [&]() {
it("works for disjoint sets", [&]() {
CharacterSet set({ {'a', 'z'} }, true);
set.add_set(CharacterSet({ {'A', 'Z'} }, true));
AssertThat(set, Equals(CharacterSet({ {'a', 'z'}, {'A', 'Z'}, })));
CharacterSet set({ {'a', 'z'} });
set.add_set(CharacterSet({ {'A', 'Z'} }));
AssertThat(set, Equals(CharacterSet({ {'a', 'z'}, {'A', 'Z'} })));
});
it("works for sets with adjacent ranges", [&]() {
CharacterSet set({ {'a', 'r'} }, true);
set.add_set(CharacterSet({ {'s', 'z'} }, true));
AssertThat(set, Equals(CharacterSet({ {'a', 'z'} }, true)));
CharacterSet set({ CharacterRange('a', 'r') });
set.add_set(CharacterSet({ CharacterRange('s', 'z') }));
AssertThat(set, Equals(CharacterSet({ {'a', 'z'} })));
set = CharacterSet({ 'c' });
auto c = set.complement();
set.add_set(c);
AssertThat(set, Equals(CharacterSet({ {0, max_char} }, true)));
AssertThat(set, Equals(CharacterSet({ {0, max_char} })));
});
it("works when the result becomes a continuous range", []() {
CharacterSet set({ {'a', 'd'}, {'f', 'z'} }, true);
set.add_set(CharacterSet({ {'c', 'g'} }, true));
AssertThat(set, Equals(CharacterSet({ {'a', 'z'} }, true)));
CharacterSet set({ {'a', 'd'}, {'f', 'z'} });
set.add_set(CharacterSet({ {'c', 'g'} }));
AssertThat(set, Equals(CharacterSet({ {'a', 'z'} })));
});
it("does nothing for the set of all characters", [&]() {
CharacterSet set({ 'a' });
set.add_set(set.complement());
AssertThat(set, Equals(CharacterSet({ {'\0', max_char} }, true)));
AssertThat(set, Equals(CharacterSet({ {'\0', max_char} })));
});
});
describe("computing differences", []() {
it("works for disjoint sets", []() {
CharacterSet set1({ {'a','z'} }, true);
set1.remove_set(CharacterSet({ {'A','Z'} }, true));
AssertThat(set1, Equals(CharacterSet({ {'a', 'z'} }, true)));
CharacterSet set1({ {'a','z'} });
set1.remove_set(CharacterSet({ {'A','Z'} }));
AssertThat(set1, Equals(CharacterSet({ {'a', 'z'} })));
});
it("works when one set spans the other", []() {
CharacterSet set1({ {'a','z'} }, true);
set1.remove_set(CharacterSet({ {'d','s'} }, true));
CharacterSet set1({ {'a','z'} });
set1.remove_set(CharacterSet({ {'d','s'} }));
AssertThat(set1, Equals(CharacterSet({ {'a', 'c'}, {'t', 'z'} })));
});
it("works for sets that overlap", []() {
CharacterSet set1({ {'a','s'} }, true);
set1.remove_set(CharacterSet({ {'m','z'} }, true));
AssertThat(set1, Equals(CharacterSet({ {'a', 'l'} }, true)));
CharacterSet set1({ {'a','s'} });
set1.remove_set(CharacterSet({ {'m','z'} }));
AssertThat(set1, Equals(CharacterSet({ {'a', 'l'} })));
CharacterSet set2({ {'m','z'} }, true);
set2.remove_set(CharacterSet({ {'a','s'} }, true));
AssertThat(set2, Equals(CharacterSet({ {'t', 'z'} }, true)));
CharacterSet set2({ {'m','z'} });
set2.remove_set(CharacterSet({ {'a','s'} }));
AssertThat(set2, Equals(CharacterSet({ {'t', 'z'} })));
});
it("works for sets with multiple ranges", []() {
@ -92,20 +92,20 @@ describe("character sets", []() {
describe("computing intersections", []() {
it("returns an empty set for disjoint sets", []() {
CharacterSet set1({ {'a','d'} }, true);
CharacterSet set2({ {'e','x'} }, true);
CharacterSet set1({ {'a','d'} });
CharacterSet set2({ {'e','x'} });
AssertThat(set1.intersect(set2), Equals(CharacterSet()));
});
it("works for sets with a single overlapping range", []() {
CharacterSet set1({ {'a','e'} }, true);
CharacterSet set2({ {'c','x'} }, true);
AssertThat(set1.intersect(set2), Equals(CharacterSet({ {'c', 'e'} }, true)));
CharacterSet set1({ {'a','e'} });
CharacterSet set2({ {'c','x'} });
AssertThat(set1.intersect(set2), Equals(CharacterSet({ {'c', 'e'} })));
});
it("works for sets with two overlapping ranges", []() {
CharacterSet set1({ {'a','e'}, {'w','z'} }, true);
CharacterSet set2({ {'c','y'} }, true);
CharacterSet set1({ {'a','e'}, {'w','z'} });
CharacterSet set2({ {'c','y'} });
AssertThat(set1.intersect(set2), Equals(CharacterSet({ {'c', 'e'}, {'w', 'y'} })));
});
});