1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706
|
#!/usr/bin/env python3
# Copyright 2017 The Chromium Authors
# Use of this source code is governed by a BSD-style license that can be
# found in the LICENSE file.
import sys
import unittest
import make_dafsa
class ToDafsaTest(unittest.TestCase):
def testEmptyInput(self):
"""Tests exception is thrown at empty input."""
words = ()
self.assertRaises(make_dafsa.InputError, make_dafsa.to_dafsa, words)
def testNonASCII(self):
"""Tests exception is thrown if illegal characters are used."""
words1 = ( chr(0x1F) + 'a1', )
self.assertRaises(make_dafsa.InputError, make_dafsa.to_dafsa, words1)
words2 = ( 'a' + chr(0x1F) + '1', )
self.assertRaises(make_dafsa.InputError, make_dafsa.to_dafsa, words2)
words3 = ( chr(0x80) + 'a1', )
self.assertRaises(make_dafsa.InputError, make_dafsa.to_dafsa, words3)
words4 = ( 'a' + chr(0x80) + '1', )
self.assertRaises(make_dafsa.InputError, make_dafsa.to_dafsa, words4)
def testChar(self):
"""Tests a DAFSA can be created from a single character domain name."""
words = [ 'a0' ]
node2 = ( chr(0), [ None ] )
node1 = ( 'a', [ node2 ] )
source = [ node1 ]
self.assertEqual(make_dafsa.to_dafsa(words), source)
def testChars(self):
"""Tests a DAFSA can be created from a multi character domain name."""
words = [ 'ab0' ]
node3 = ( chr(0), [ None ] )
node2 = ( 'b', [ node3 ] )
node1 = ( 'a', [ node2 ] )
source = [ node1 ]
self.assertEqual(make_dafsa.to_dafsa(words), source)
def testWords(self):
"""Tests a DAFSA can be created from a sequence of domain names."""
words = [ 'a0', 'b1' ]
node4 = ( chr(1), [ None ] )
node3 = ( 'b', [ node4 ] )
node2 = ( chr(0), [ None ] )
node1 = ( 'a', [ node2 ] )
source = [ node1, node3 ]
self.assertEqual(make_dafsa.to_dafsa(words), source)
class ToWordsTest(unittest.TestCase):
def testSink(self):
"""Tests the sink is exapnded to a list with an empty string."""
node1 = None
words = [ '' ]
self.assertEqual(make_dafsa.to_words(node1), words)
def testSingleNode(self):
"""Tests a single node is expanded to a list with the label string."""
# 'ab' -> [ 'ab' ]
node1 = ( 'ab', [ None ] )
words = [ 'ab' ]
self.assertEqual(make_dafsa.to_words(node1), words)
def testChain(self):
"""Tests a sequence of nodes are preoperly expanded."""
# 'ab' -> 'cd' => [ 'abcd' ]
node2 = ( 'cd', [ None ] )
node1 = ( 'ab', [ node2 ] )
words = [ 'abcd' ]
self.assertEqual(make_dafsa.to_words(node1), words)
def testInnerTerminator(self):
"""Tests a sequence with an inner terminator is expanded to two strings."""
# 'a' -> 'b'
# \ => [ 'ab', 'a' ]
# {sink}
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2, None ] )
words = [ 'ab', 'a' ]
self.assertEqual(make_dafsa.to_words(node1), words)
def testDiamond(self):
"""Tests a diamond can be expanded to a word list."""
# 'cd'
# / \
# 'ab' 'gh'
# \ /
# 'ef'
node4 = ( 'gh', [ None ] )
node3 = ( 'ef', [ node4 ] )
node2 = ( 'cd', [ node4 ] )
node1 = ( 'ab', [ node2, node3 ] )
words = [ 'abcdgh', 'abefgh' ]
self.assertEqual(make_dafsa.to_words(node1), words)
class JoinLabelsTest(unittest.TestCase):
def testLabel(self):
"""Tests a single label passes unchanged."""
# 'a' => 'a'
node1 = ( 'a', [ None ] )
source = [ node1 ]
self.assertEqual(make_dafsa.join_labels(source), source)
def testInnerTerminator(self):
"""Tests a sequence with an inner terminator passes unchanged."""
# 'a' -> 'b' 'a' -> 'b'
# \ => \
# {sink} {sink}
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2, None ] )
source = [ node1 ]
self.assertEqual(make_dafsa.join_labels(source), source)
def testLabels(self):
"""Tests a sequence of labels can be joined."""
# 'a' -> 'b' => 'ab'
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2 ] )
source1 = [ node1 ]
node3 = ( 'ab', [ None ] )
source2 = [ node3 ]
self.assertEqual(make_dafsa.join_labels(source1), source2)
def testCompositeLabels(self):
"""Tests a sequence of multi character labels can be joined."""
# 'ab' -> 'cd' => 'abcd'
node2 = ( 'cd', [ None ] )
node1 = ( 'ab', [ node2 ] )
source1 = [ node1 ]
node3 = ( 'abcd', [ None ] )
source2 = [ node3 ]
self.assertEqual(make_dafsa.join_labels(source1), source2)
def testAtomicTrie(self):
"""Tests a trie formed DAFSA with atomic labels passes unchanged."""
# 'b' 'b'
# / /
# 'a' => 'a'
# \ \
# 'c' 'c'
node3 = ( 'c', [ None ] )
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2, node3 ] )
source = [ node1 ]
self.assertEqual(make_dafsa.join_labels(source), source)
def testReverseAtomicTrie(self):
"""Tests a reverse trie formed DAFSA with atomic labels passes unchanged."""
# 'a' 'a'
# \ \
# 'c' => 'c'
# / /
# 'b' 'b'
node3 = ( 'c', [ None ] )
node2 = ( 'b', [ node3 ] )
node1 = ( 'a', [ node3 ] )
source = [ node1, node2 ]
self.assertEqual(make_dafsa.join_labels(source), source)
def testChainedTrie(self):
"""Tests a trie formed DAFSA with chained labels can be joined."""
# 'c' -> 'd' 'cd'
# / /
# 'a' -> 'b' => 'ab'
# \ \
# 'e' -> 'f' 'ef'
node6 = ( 'f', [ None ] )
node5 = ( 'e', [ node6 ] )
node4 = ( 'd', [ None ] )
node3 = ( 'c', [ node4 ] )
node2 = ( 'b', [ node3, node5 ] )
node1 = ( 'a', [ node2 ] )
source1 = [ node1 ]
node9 = ( 'ef', [ None ] )
node8 = ( 'cd', [ None ] )
node7 = ( 'ab', [ node8, node9 ] )
source2 = [ node7 ]
self.assertEqual(make_dafsa.join_labels(source1), source2)
def testReverseChainedTrie(self):
"""Tests a reverse trie formed DAFSA with chained labels can be joined."""
# 'a' -> 'b' 'ab'
# \ \
# 'e' -> 'f' => 'ef'
# / /
# 'c' -> 'd' 'cd'
node6 = ( 'f', [ None ] )
node5 = ( 'e', [ node6 ] )
node4 = ( 'd', [ node5 ] )
node3 = ( 'c', [ node4 ] )
node2 = ( 'b', [ node5 ] )
node1 = ( 'a', [ node2 ] )
source1 = [ node1, node3 ]
node9 = ( 'ef', [ None ] )
node8 = ( 'cd', [ node9 ] )
node7 = ( 'ab', [ node9 ] )
source2 = [ node7, node8 ]
self.assertEqual(make_dafsa.join_labels(source1), source2)
class JoinSuffixesTest(unittest.TestCase):
def testSingleLabel(self):
"""Tests a single label passes unchanged."""
# 'a' => 'a'
node1 = ( 'a', [ None ] )
source = [ node1 ]
self.assertEqual(make_dafsa.join_suffixes(source), source)
def testInnerTerminator(self):
"""Tests a sequence with an inner terminator passes unchanged."""
# 'a' -> 'b' 'a' -> 'b'
# \ => \
# {sink} {sink}
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2, None ] )
source = [ node1 ]
self.assertEqual(make_dafsa.join_suffixes(source), source)
def testDistinctTrie(self):
"""Tests a trie formed DAFSA with distinct labels passes unchanged."""
# 'b' 'b'
# / /
# 'a' => 'a'
# \ \
# 'c' 'c'
node3 = ( 'c', [ None ] )
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2, node3 ] )
source = [ node1 ]
self.assertEqual(make_dafsa.join_suffixes(source), source)
def testReverseDistinctTrie(self):
"""Tests a reverse trie formed DAFSA with distinct labels passes unchanged.
"""
# 'a' 'a'
# \ \
# 'c' => 'c'
# / /
# 'b' 'b'
node3 = ( 'c', [ None ] )
node2 = ( 'b', [ node3 ] )
node1 = ( 'a', [ node3 ] )
source = [ node1, node2 ]
self.assertEqual(make_dafsa.join_suffixes(source), source)
def testJoinTwoHeads(self):
"""Tests two heads can be joined even if there is something else between."""
# 'a' ------'a'
# /
# 'b' => 'b' /
# /
# 'a' ---
#
# The picture above should shows that the new version should have just one
# instance of the node with label 'a'.
node3 = ( 'a', [ None ] )
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ None ] )
source1 = [ node1, node2, node3 ]
source2 = make_dafsa.join_suffixes(source1)
# Both versions should expand to the same content.
self.assertEqual(source1, source2)
# But the new version should have just one instance of 'a'.
self.assertIs(source2[0], source2[2])
def testJoinTails(self):
"""Tests tails can be joined."""
# 'a' -> 'c' 'a'
# \
# => 'c'
# /
# 'b' -> 'c' 'b'
node4 = ( 'c', [ None ] )
node3 = ( 'b', [ node4 ] )
node2 = ( 'c', [ None ] )
node1 = ( 'a', [ node2 ] )
source1 = [ node1, node3 ]
source2 = make_dafsa.join_suffixes(source1)
# Both versions should expand to the same content.
self.assertEqual(source1, source2)
# But the new version should have just one tail.
self.assertIs(source2[0][1][0], source2[1][1][0])
def testMakeRecursiveTrie(self):
"""Tests recursive suffix join."""
# 'a' -> 'e' -> 'g' 'a'
# \
# 'e'
# / \
# 'b' -> 'e' -> 'g' 'b' \
# \
# => 'g'
# /
# 'c' -> 'f' -> 'g' 'c' /
# \ /
# 'f'
# /
# 'd' -> 'f' -> 'g' 'd'
node7 = ( 'g', [ None ] )
node6 = ( 'f', [ node7 ] )
node5 = ( 'e', [ node7 ] )
node4 = ( 'd', [ node6 ] )
node3 = ( 'c', [ node6 ] )
node2 = ( 'b', [ node5 ] )
node1 = ( 'a', [ node5 ] )
source1 = [ node1, node2, node3, node4 ]
source2 = make_dafsa.join_suffixes(source1)
# Both versions should expand to the same content.
self.assertEqual(source1, source2)
# But the new version should have just one 'e'.
self.assertIs(source2[0][1][0], source2[1][1][0])
# And one 'f'.
self.assertIs(source2[2][1][0], source2[3][1][0])
# And one 'g'.
self.assertIs(source2[0][1][0][1][0], source2[2][1][0][1][0])
def testMakeDiamond(self):
"""Test we can join suffixes of a trie."""
# 'b' -> 'd' 'b'
# / / \
# 'a' => 'a' 'd'
# \ \ /
# 'c' -> 'd' 'c'
node5 = ( 'd', [ None ] )
node4 = ( 'c', [ node5 ] )
node3 = ( 'd', [ None ] )
node2 = ( 'b', [ node3 ] )
node1 = ( 'a', [ node2, node4 ] )
source1 = [ node1 ]
source2 = make_dafsa.join_suffixes(source1)
# Both versions should expand to the same content.
self.assertEqual(source1, source2)
# But the new version should have just one 'd'.
self.assertIs(source2[0][1][0][1][0], source2[0][1][1][1][0])
def testJoinOneChild(self):
"""Tests that we can join some children but not all."""
# 'c' ----'c'
# / / /
# 'a' 'a' /
# \ \ /
# 'd' 'd'/
# => /
# 'c' /
# / /
# 'b' 'b'
# \ \
# 'e' 'e'
node6 = ( 'e', [ None ] )
node5 = ( 'c', [ None ] )
node4 = ( 'b', [ node5, node6 ] )
node3 = ( 'd', [ None ] )
node2 = ( 'c', [ None ] )
node1 = ( 'a', [ node2, node3 ] )
source1 = [ node1, node4 ]
source2 = make_dafsa.join_suffixes(source1)
# Both versions should expand to the same content.
self.assertEqual(source1, source2)
# But the new version should have just one 'c'.
self.assertIs(source2[0][1][0], source2[1][1][0])
class ReverseTest(unittest.TestCase):
def testAtomicLabel(self):
"""Tests an atomic label passes unchanged."""
# 'a' => 'a'
node1 = ( 'a', [ None ] )
source = [ node1 ]
self.assertEqual(make_dafsa.reverse(source), source)
def testLabel(self):
"""Tests that labels are reversed."""
# 'ab' => 'ba'
node1 = ( 'ab', [ None ] )
source1 = [ node1 ]
node2 = ( 'ba', [ None ] )
source2 = [ node2 ]
self.assertEqual(make_dafsa.reverse(source1), source2)
def testChain(self):
"""Tests that edges are reversed."""
# 'a' -> 'b' => 'b' -> 'a'
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2 ] )
source1 = [ node1 ]
node4 = ( 'a', [ None ] )
node3 = ( 'b', [ node4 ] )
source2 = [ node3 ]
self.assertEqual(make_dafsa.reverse(source1), source2)
def testInnerTerminator(self):
"""Tests a sequence with an inner terminator can be reversed."""
# 'a' -> 'b' 'b' -> 'a'
# \ => /
# {sink} ------
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2, None ] )
source1 = [ node1 ]
node4 = ( 'a', [ None ] )
node3 = ( 'b', [ node4 ] )
source2 = [ node3, node4 ]
self.assertEqual(make_dafsa.reverse(source1), source2)
def testAtomicTrie(self):
"""Tests a trie formed DAFSA can be reversed."""
# 'b' 'b'
# / \
# 'a' => 'a'
# \ /
# 'c' 'c'
node3 = ( 'c', [ None ] )
node2 = ( 'b', [ None ] )
node1 = ( 'a', [ node2, node3 ] )
source1 = [ node1 ]
node6 = ( 'a', [ None ] )
node5 = ( 'c', [ node6 ] )
node4 = ( 'b', [ node6 ] )
source2 = [ node4, node5 ]
self.assertEqual(make_dafsa.reverse(source1), source2)
def testReverseAtomicTrie(self):
"""Tests a reverse trie formed DAFSA can be reversed."""
# 'a' 'a'
# \ /
# 'c' => 'c'
# / \
# 'b' 'b'
node3 = ( 'c', [ None ] )
node2 = ( 'b', [ node3 ] )
node1 = ( 'a', [ node3 ] )
source1 = [ node1, node2 ]
node6 = ( 'b', [ None ] )
node5 = ( 'a', [ None ] )
node4 = ( 'c', [ node5, node6 ] )
source2 = [ node4 ]
self.assertEqual(make_dafsa.reverse(source1), source2)
def testDiamond(self):
"""Tests we can reverse both edges and nodes in a diamond."""
# 'cd' 'dc'
# / \ / \
# 'ab' 'gh' => 'hg' 'ba'
# \ / \ /
# 'ef' 'fe'
node4 = ( 'gh', [ None ] )
node3 = ( 'ef', [ node4 ] )
node2 = ( 'cd', [ node4 ] )
node1 = ( 'ab', [ node2, node3 ] )
source1 = [ node1 ]
node8 = ( 'ba', [ None ] )
node7 = ( 'fe', [ node8 ] )
node6 = ( 'dc', [ node8 ] )
node5 = ( 'hg', [ node6, node7 ] )
source2 = [ node5 ]
self.assertEqual(make_dafsa.reverse(source1), source2)
class TopSortTest(unittest.TestCase):
def testNode(self):
"""Tests a DAFSA with one node can be sorted."""
# 'a' => [ 'a' ]
node1 = ( 'a', [ None ] )
source = [ node1 ]
nodes = [ node1 ]
self.assertEqual(make_dafsa.top_sort(source), nodes)
def testDiamond(self):
"""Tests nodes in a diamond can be sorted."""
# 'b'
# / \
# 'a' 'd'
# \ /
# 'c'
node4 = ( 'd', [ None ] )
node3 = ( 'c', [ node4 ] )
node2 = ( 'b', [ node4 ] )
node1 = ( 'a', [ node2, node3 ] )
source = [ node1 ]
nodes = make_dafsa.top_sort(source)
self.assertLess(nodes.index(node1), nodes.index(node2))
self.assertLess(nodes.index(node2), nodes.index(node4))
self.assertLess(nodes.index(node3), nodes.index(node4))
class EncodePrefixTest(unittest.TestCase):
def testChar(self):
"""Tests to encode a single character prefix."""
label = 'a'
bytes = [ ord('a') ]
self.assertEqual(make_dafsa.encode_prefix(label), bytes)
def testChars(self):
"""Tests to encode a multi character prefix."""
label = 'ab'
bytes = [ ord('b'), ord('a') ]
self.assertEqual(make_dafsa.encode_prefix(label), bytes)
class EncodeLabelTest(unittest.TestCase):
def testChar(self):
"""Tests to encode a single character label."""
label = 'a'
bytes = [ ord('a') + 0x80 ]
self.assertEqual(make_dafsa.encode_label(label), bytes)
def testChars(self):
"""Tests to encode a multi character label."""
label = 'ab'
bytes = [ ord('b') + 0x80, ord('a') ]
self.assertEqual(make_dafsa.encode_label(label), bytes)
class EncodeLinksTest(unittest.TestCase):
def testEndLabel(self):
"""Tests to encode link to the sink."""
children = [ None ]
offsets = {}
bytes = 0
output = []
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
def testOneByteOffset(self):
"""Tests to encode a single one byte offset."""
node = ( '', [ None ] )
children = [ node ]
offsets = { id(node) : 2 }
bytes = 5
output = [ 132 ]
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
def testOneByteOffsets(self):
"""Tests to encode a sequence of one byte offsets."""
node1 = ( '', [ None ] )
node2 = ( '', [ None ] )
children = [ node1, node2 ]
offsets = { id(node1) : 2, id(node2) : 1 }
bytes = 5
output = [ 129, 5 ]
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
def testTwoBytesOffset(self):
"""Tests to encode a single two byte offset."""
node = ( '', [ None ] )
children = [ node ]
offsets = { id(node) : 2 }
bytes = 1005
output = [ 237, 195]
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
def testTwoBytesOffsets(self):
"""Tests to encode a sequence of two byte offsets."""
node1 = ( '', [ None ] )
node2 = ( '', [ None ] )
node3 = ( '', [ None ] )
children = [ node1, node2, node3 ]
offsets = { id(node1) : 1002, id(node2) : 2, id(node3) : 2002 }
bytes = 3005
output = [ 232, 195, 232, 67, 241, 67 ]
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
def testThreeBytesOffset(self):
"""Tests to encode a single three byte offset."""
node = ( '', [ None ] )
children = [ node ]
offsets = { id(node) : 2 }
bytes = 100005
output = [ 166, 134, 225 ]
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
def testThreeBytesOffsets(self):
"""Tests to encode a sequence of three byte offsets."""
node1 = ( '', [ None ] )
node2 = ( '', [ None ] )
node3 = ( '', [ None ] )
children = [ node1, node2, node3 ]
offsets = { id(node1) : 100002, id(node2) : 2, id(node3) : 200002 }
bytes = 300005
output = [ 160, 134, 225, 160, 134, 97, 172, 134, 97 ]
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
def testOneTwoThreeBytesOffsets(self):
"""Tests to encode offsets of different sizes."""
node1 = ( '', [ None ] )
node2 = ( '', [ None ] )
node3 = ( '', [ None ] )
children = [ node1, node2, node3 ]
offsets = { id(node1) : 10003, id(node2) : 10002, id(node3) : 100002 }
bytes = 300005
output = [ 129, 143, 95, 97, 74, 13, 99 ]
self.assertEqual(make_dafsa.encode_links(children, offsets, bytes),
output)
class ExamplesTest(unittest.TestCase):
def testExample1(self):
"""Tests Example 1 from make_dafsa.py."""
infile = '["https://www.example.com:8081", "http://www.example.org"]'
outfile = b'\x81www.example\xae\x02\x84org\x81com:8081\x80'
self.assertEqual(
make_dafsa.words_to_encoded_dafsa(make_dafsa.parse_json(infile)),
outfile)
def testExample2(self):
"""Tests Example 2 from make_dafsa.py."""
infile = '["https://www.example.org", "http://www.google.com"]'
outfile = b'\x81www\xae\x02\x8bgoogle.com\x81example.org\x80'
self.assertEqual(
make_dafsa.words_to_encoded_dafsa(make_dafsa.parse_json(infile)),
outfile)
def testBadJSON(self):
"""Tests make_dafsa.py with bad JSON input."""
self.assertRaises(make_dafsa.InputError, make_dafsa.parse_json, "badinput")
def testInvalidProtocol(self):
"""Tests make_dafsa.py with an invalid protocol."""
self.assertRaises(make_dafsa.InputError, make_dafsa.parse_json,
'["ftp://www.example.com"]')
if __name__ == '__main__':
unittest.main()
|