foundational_lib2 1.0

data/tests/test_log.txt

@@ -0,0 +1,1047 @@
+Allocation works.
+"Line one"
+"Line two line two"
+"Line 3"
+""
+Original: "   Hello, world!   "
+Stripped: "Hello, world!"
+Split into 3 tokens:
+1: "apple"
+2: "orange"
+3: "banana"
+Joined: "apple,orange,banana"
+len 33 on iter 0
+foo
+len 303 on iter 1
+sssssssssssssssssssssssssssssa
+len 73 on iter 2
+dasdasd
+len 23 on iter 3
+fe
+len 53 on iter 4
+feeee
+len 63 on iter 5
+aaaaaa
+len 83 on iter 6
+feeeeeee
+len 103 on iter 7
+ffeeeeeeee
+len 133 on iter 8
+sssssssssssss
+len 13 on iter 9
+m
+len 3 on iter 10
+
+Size 10000
+test 3
+Count 1
+Count 2
+Array:  World
+Total Length: 6
+Original command: echo Hello, world!
+Escaped command: echo\ Hello,\ world!
+Unsafe Input: Hello, world!'; rm -rf / # ( && | > <
+Escaped Output: Hello,\ world!\'\;\ rm\ -rf\ /\ #\ \(\ \&\&\ \|\ \>\ \<
+
+Original string: reverse
+Reversed string: esrever
+
+Does the string start with "This"? Yes
+Does the string end with "text"? Yes
+FOR
+Original sentence: The quick brown fox jumps over the lazy dog.
+Sentence after replacement: The quick brown cat jumps over the lazy dog.
+
+Occurrences of "wood" in the text: 4
+count_occurrences_of_substr_len("Foobar", 6, "o", 1) == 2 ? 
+Pass substr len assert 1.
+Pass substr len assert 2.
+Pass substr len assert 3.
+Pass substr len assert 4.
+String: "The quick brown fox jumps over the lazy dog."
+Index of first occurrence of 'o': 12
+Index of last occurrence of 'o': 41
+Is "Hello" alphabetic? Yes
+Is "Hello123" alphabetic? Yes
+
+Is "12345" numeric? Yes
+Is "123abc" numeric? No
+
+Is "Hello123" alphanumeric? Yes
+Is "Hello_123" alphanumeric? No
+Longest common prefix: "ap"
+
+Longest common suffix: ""
+
+Integer: 3232
+String representation: "3232"
+
+Integer: -1234567
+String representation: "-1234567"
+String: "3.14"
+Converted to double: 3.140000
+
+String: "The quick brown fox jumps over the lazy dog."
+Index of first vowel: 2
+Index of last vowel: 41
+Joined string: "apple,orange,banana,grape"
+
+Original string: "Reverse me!"
+Reversed in place: "!em esreveR"
+Is "12345" a valid integer? Yes
+Is "12abc" a valid integer? No
+Common prefix of "apple" and "appetizer": "app"
+
+Common suffix of "grape" and "ripe": "pe"
+
+Original sentence: "the quick brown fox"
+Title case sentence: "The Quick Brown Fox"
+Maximum value in the array: 78
+
+Minimum value in the array: 12
+
+Sum of elements in the array: 75
+
+Original array: 1 2 3 4 5 
+Reversed array: 5 4 3 2 1 
+Is the array sorted in ascending order? Yes
+
+Is the array sorted in descending order? Yes
+Array: [3, 1, 4, 1, 5, 9, 2, 6, 5, 3]
+
+Generated Range: [1, 3, 5, 7, 9]
+
+Original Array: 5 2 9 1 5 6 
+Sorted Array: 1 2 5 5 6 9 Converted string to integer: 121212
+Content written to 'ex_ample.txt':
+Hello, File I/O!
+
+Content read from 'ex_ample.txt':
+'Hello, File I/O!'
+Does file 'existing_file.txt' exist? Yes
+Does file 'non_existing_file.txt' exist? No
+
+Content appended to 'existing_file.txt':
+
+This line is appended!
+Size of file 'ex_ample.txt': 16 bytes
+
+File 'file_to_remove.txt' created.
+Source file 'source_file.txt' created.
+Files matching pattern '*.c' in directory '.' (length is 2):
+decoupled_thorough_tests.c
+lib_and_tests.c
+Concatenated String 1: 'Hello, world!'
+Concatenated String 2: 'Hello, world! How are you?'
+Mapped Int Result: 1 2 3 4 5 Reduced Result: 15
+Filtered Result: [2, 4]
+2
+4
+6
+8
+10
+246810Reduced Result: 15
+Filtered Result: 2 4 12
+14
+16
+18
+20
+22
+24
+26
+28
+30
+
+
+
+List Comprehension Result (1-15 inclusive) x2 if greater than 5: [12, 14, 16, 18, 20, 22, 24, 26, 28, 30]
+
+Equal in size
+15
+
+[1, 3, 5]
+3
+Reject Result: 1 3 5 
+Select Result: 2 4 
+Replicated Integer Array: [1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3]
+Replicated Character Array: abcabcabcabcabcMaximum Value: 9
+Minimum Value: 1
+Sum of Elements: 44
+Average of Elements: 4.00
+Before Uniq like in ruby (as opposed to bash):
+apple banana apple orange banana kiwi 
+After Uniq like in ruby (as opposed to bash):
+apple banana orange kiwi 
+Before Uniq bash:
+apple banana apple orange banana kiwi 
+After Uniq bash
+apple banana apple orange banana kiwi 
+test 48
+The value for 'banana' is: 0000000000000000
+The value for 'banana' is: is curved.
+The value for 'apple' is: is red or green
+test 48. Printing dict keys in dict of size 6 {6 => 6}
+[man, frog, banana, apple, cat, dog]
+Printing dict values
+0. walks
+1. ribbits
+2. is curved.
+3. is red or green
+4. is cute
+5. barks a lot
+To a
+{man: 00000000004188BF, frog: 00000000004188B2, banana: 000000000041887F, apple: 000000000041888A, cat: 000000000041889A, dog: 00000000004188A2}
+{man: walks, frog: ribbits, banana: is curved., apple: is red or green, cat: is cute, dog: barks a lot}
+Adding 1000
+dict_destructor(my_dict)
+dict_destructor(my_dict) done.
+new frozen dict
+new frozen dict made
+The value for 'banana' is: dog
+The value for 'apple' is: cat
+Frozendict size is 2
+test 49
+The value for 'banana' is: 0
+Set | The value for 'banana' is: 1
+Printing set keys
+[man, frog, banana, apple, cat, dog]
+To a
+{man, frog, banana, apple, cat, dog}
+Frozenset | The value for 'banana' is: 1
+Frozenset | The value for 'apple' is: 1
+Frozenset | Frozenset size is 3
+Test 50 - randomness.
+cherry
+apple
+elderberry
+apple
+banana
+date
+date
+date
+banana
+banana
+Test 52
+3 size set should be. 3 <=> 3.
+Adding an additional 20,000 members to the set
+0
+8000
+16000
+20003 <=> 20003, 1.
+Del 1000 value pre.
+Del 1000 value post.
+20002
+set add new_value post 20003
+set add new_value post 20003
+set add new_value post 20003
+set add new_value post 20003
+After 50,000 insertions. Set size should be 20004 <=> 20004
+test 52 | set destructor
+Set destroyed
+ test52
+0 of 10,000 (size 13)
+1000 of 10,000 (size 13)
+2000 of 10,000 (size 13)
+3000 of 10,000 (size 13)
+4000 of 10,000 (size 13)
+5000 of 10,000 (size 13)
+6000 of 10,000 (size 13)
+7000 of 10,000 (size 13)
+8000 of 10,000 (size 13)
+9000 of 10,000 (size 13)
+Adding an additional 20,000 members to the dict
+0
+2500
+5000
+7500
+10000
+12500
+15000
+17500
+Added 20,000 elements
+Size of dictionary is 20001. It should be 20001
+Adding the same value 60,000 times, which is PRESENT in dictionary.
+Added 'foo' 60,000 times.
+Size of dictionary is 20001. It should be 20001
+Deleting keys 60,000 times and adding and deleting random keys.
+0
+15000
+30000
+45000
+dict_destructor(dict)
+dict destroyed test52
+Reading words file into array.
+/usr/share/dict/words is 104335 lines and we can efficiently play around with it in a more easy fashion than Python.
+Shuffling words
+Randomly chosen word is "teaspoonful's". Randomly chosen word is "Cochise's". Randomly chosen word is "renounced". Randomly chosen word is "own". Randomly chosen word is "household". Randomly chosen word is "renovator". Randomly chosen word is "cast's". Randomly chosen word is "philanthropist". Randomly chosen word is "hum". Randomly chosen word is "exemplar's". Randomly chosen word is "cheesecloth's". Randomly chosen word is "tippler". Randomly chosen word is "apostasy's". Randomly chosen word is "parties". Randomly chosen word is "Nova". Randomly chosen word is "quashed". Randomly chosen word is "tats". Randomly chosen word is "sterilization". Randomly chosen word is "painless". Randomly chosen word is "hankerings". Randomly chosen word is "reportedly". Randomly chosen word is "wanderlusts". Randomly chosen word is "forge". Randomly chosen word is "Slovak". Randomly chosen word is "cocoa". Randomly chosen word is "Attic's". Randomly chosen word is "nonproductive". Randomly chosen word is "burnouts". Randomly chosen word is "erupting". Randomly chosen word is "unwisest". Randomly chosen word is "crossfire". Randomly chosen word is "carrousels". Randomly chosen word is "babes". Randomly chosen word is "bursar". Randomly chosen word is "commentates". Randomly chosen word is "redounded". Randomly chosen word is "Confederate's". Randomly chosen word is "panacea's". Randomly chosen word is "Cantu's". Randomly chosen word is "Avery". Randomly chosen word is "nutshell". Randomly chosen word is "króna's". Randomly chosen word is "bristly". Randomly chosen word is "substratum's". Randomly chosen word is "Frankie's". Randomly chosen word is "soft". Randomly chosen word is "reconnects". Randomly chosen word is "specifications". Randomly chosen word is "dusk". Randomly chosen word is "mustang's". Randomly chosen word is "knocker". Randomly chosen word is "Faustian's". Randomly chosen word is "Lamont's". Randomly chosen word is "nibble's". Randomly chosen word is "Multics". Randomly chosen word is "gambler". Randomly chosen word is "Asunción's". Randomly chosen word is "Jan's". Randomly chosen word is "truncheon's". Randomly chosen word is "Elizabethan". Randomly chosen word is "photoing". Randomly chosen word is "adjoining". Randomly chosen word is "reviler's". Randomly chosen word is "confidence's". Randomly chosen word is "Pabst's". Randomly chosen word is "antigen". Randomly chosen word is "penis". Randomly chosen word is "Miami". Randomly chosen word is "Ebeneezer's". Randomly chosen word is "BA". Randomly chosen word is "sloshed". Randomly chosen word is "venomous". Randomly chosen word is "idiocies". Randomly chosen word is "blintzes". Randomly chosen word is "recompense's". Randomly chosen word is "anguished". Randomly chosen word is "Eddie's". Randomly chosen word is "aristocratically". Randomly chosen word is "showcasing". Randomly chosen word is "blockhead's". Randomly chosen word is "missionaries". Randomly chosen word is "gathered". Randomly chosen word is "dishonors". Randomly chosen word is "overhanging". Randomly chosen word is "treetop". Randomly chosen word is "chanter's". Randomly chosen word is "desperate". Randomly chosen word is "torturing". Randomly chosen word is "Antoinette's". Randomly chosen word is "Mathewson's". Randomly chosen word is "cutlass". Randomly chosen word is "amaranth's". Randomly chosen word is "Mongolia". Randomly chosen word is "cabbie's". Randomly chosen word is "vocalizing". Randomly chosen word is "sarong's". Randomly chosen word is "widening". Randomly chosen word is "nuthatches". Randomly chosen word is "Sevastopol". Randomly chosen word is "cowgirls". Randomly chosen word is "metabolizing". Randomly chosen word is "bloodiest". Randomly chosen word is "hotcake". Randomly chosen word is "conqueror". Randomly chosen word is "stagflation's". Randomly chosen word is "turnabout". Randomly chosen word is "cooker". Randomly chosen word is "fretting". Randomly chosen word is "gruffness's". Randomly chosen word is "days". Randomly chosen word is "witchery". Randomly chosen word is "capitulated". 
+Test 54.
+Test 1 passes.
+Test 2 passes.
+Test 3 passes.
+Test new 1
+Original: foo example foo
+Replaced: [foo, Dog] example [Replacement #2]
+Test new 2
+Hello world
+Cat Hello, world! Hello, universe!
+FOR
+FOR
+Cat aaaaaaaaaaaaa, world! aaaaaaaaaaaaa, universe!
+FOR
+FOR
+Cat aaaaaaaaaaaaa, world! aaaaaaaaaaaaa, universe!
+1000 iterations
+Cat Hello, world! Hello, universe!
+read_files_into_array(files, 5, &words_data, &lens, 1)
+[985084, 985084, 985084, 985084, 985084]
+
+
+Words file 0 is 985084
+Words file 1 is 985084
+Words file 2 is 985084
+Words file 3 is 985084
+Words file 4 is 985084
+All tests pass.
+Test 1
+First element
+First element is good.
+Alloc size is 8
+i = 50000, size [49999 => 491556]
+i = 100000, size [99999 => 1106016]
+i = 150000, size [149999 => 1659036]
+i = 200000, size [199999 => 1659036]
+i = 250000, size [249999 => 2488560]
+i = 300000, size [299999 => 2488560]
+i = 350000, size [349999 => 3732852]
+i = 400000, size [399999 => 3732852]
+i = 450000, size [449999 => 3732852]
+i = 500000, size [499999 => 5599284]
+i = 550000, size [549999 => 5599284]
+i = 600000, size [599999 => 5599284]
+i = 650000, size [649999 => 5599284]
+i = 700000, size [699999 => 8398932]
+i = 750000, size [749999 => 8398932]
+i = 800000, size [799999 => 8398932]
+i = 850000, size [849999 => 8398932]
+i = 900000, size [899999 => 8398932]
+i = 950000, size [949999 => 8398932]
+i = 1000000, size [999999 => 8398932]
+All tests passed!
+==2820653== Memcheck, a memory error detector
+==2820653== Copyright (C) 2002-2017, and GNU GPL'd, by Julian Seward et al.
+==2820653== Using Valgrind-3.18.1 and LibVEX; rerun with -h for copyright info
+==2820653== Command: ./lib_and_tests
+==2820653== 
+Allocation works.
+"Line one"
+"Line two line two"
+"Line 3"
+""
+Original: "   Hello, world!   "
+Stripped: "Hello, world!"
+Split into 3 tokens:
+1: "apple"
+2: "orange"
+3: "banana"
+Joined: "apple,orange,banana"
+len 33 on iter 0
+foo
+len 303 on iter 1
+sssssssssssssssssssssssssssssa
+len 73 on iter 2
+dasdasd
+len 23 on iter 3
+fe
+len 53 on iter 4
+feeee
+len 63 on iter 5
+aaaaaa
+len 83 on iter 6
+feeeeeee
+len 103 on iter 7
+ffeeeeeeee
+len 133 on iter 8
+sssssssssssss
+len 13 on iter 9
+m
+len 3 on iter 10
+
+Size 10000
+test 3
+Count 1
+Count 2
+Array:  World
+Total Length: 6
+Original command: echo Hello, world!
+Escaped command: echo\ Hello,\ world!
+Unsafe Input: Hello, world!'; rm -rf / # ( && | > <
+Escaped Output: Hello,\ world!\'\;\ rm\ -rf\ /\ #\ \(\ \&\&\ \|\ \>\ \<
+
+Original string: reverse
+Reversed string: esrever
+
+Does the string start with "This"? Yes
+Does the string end with "text"? Yes
+FOR
+Original sentence: The quick brown fox jumps over the lazy dog.
+Sentence after replacement: The quick brown cat jumps over the lazy dog.
+
+Occurrences of "wood" in the text: 4
+count_occurrences_of_substr_len("Foobar", 6, "o", 1) == 2 ? 
+Pass substr len assert 1.
+Pass substr len assert 2.
+Pass substr len assert 3.
+Pass substr len assert 4.
+String: "The quick brown fox jumps over the lazy dog."
+Index of first occurrence of 'o': 12
+Index of last occurrence of 'o': 41
+Is "Hello" alphabetic? Yes
+Is "Hello123" alphabetic? Yes
+
+Is "12345" numeric? Yes
+Is "123abc" numeric? No
+
+Is "Hello123" alphanumeric? Yes
+Is "Hello_123" alphanumeric? No
+Longest common prefix: "ap"
+
+Longest common suffix: ""
+
+Integer: 3232
+String representation: "3232"
+
+Integer: -1234567
+String representation: "-1234567"
+String: "3.14"
+Converted to double: 3.140000
+
+String: "The quick brown fox jumps over the lazy dog."
+Index of first vowel: 2
+Index of last vowel: 41
+Joined string: "apple,orange,banana,grape"
+
+Original string: "Reverse me!"
+Reversed in place: "!em esreveR"
+Is "12345" a valid integer? Yes
+Is "12abc" a valid integer? No
+Common prefix of "apple" and "appetizer": "app"
+
+Common suffix of "grape" and "ripe": "pe"
+
+Original sentence: "the quick brown fox"
+Title case sentence: "The Quick Brown Fox"
+Maximum value in the array: 78
+
+Minimum value in the array: 12
+
+Sum of elements in the array: 75
+
+Original array: 1 2 3 4 5 
+Reversed array: 5 4 3 2 1 
+Is the array sorted in ascending order? Yes
+
+Is the array sorted in descending order? Yes
+Array: [3, 1, 4, 1, 5, 9, 2, 6, 5, 3]
+
+Generated Range: [1, 3, 5, 7, 9]
+
+Original Array: 5 2 9 1 5 6 
+Sorted Array: 1 2 5 5 6 9 Converted string to integer: 121212
+Content written to 'ex_ample.txt':
+Hello, File I/O!
+
+Content read from 'ex_ample.txt':
+'Hello, File I/O!'
+Does file 'existing_file.txt' exist? Yes
+Does file 'non_existing_file.txt' exist? No
+
+Content appended to 'existing_file.txt':
+
+This line is appended!
+Size of file 'ex_ample.txt': 16 bytes
+
+File 'file_to_remove.txt' created.
+Source file 'source_file.txt' created.
+Files matching pattern '*.c' in directory '.' (length is 2):
+lib_and_tests.c
+decoupled_thorough_tests.c
+Concatenated String 1: 'Hello, world!'
+Concatenated String 2: 'Hello, world! How are you?'
+Mapped Int Result: 1 2 3 4 5 Reduced Result: 15
+Filtered Result: [2, 4]
+2
+4
+6
+8
+10
+246810Reduced Result: 15
+Filtered Result: 2 4 12
+14
+16
+18
+20
+22
+24
+26
+28
+30
+
+
+
+List Comprehension Result (1-15 inclusive) x2 if greater than 5: [12, 14, 16, 18, 20, 22, 24, 26, 28, 30]
+
+Equal in size
+15
+
+MULTITHREAD
+18
+20
+22
+24
+26
+28
+30
+12
+14
+16
+MULTITHREAD DONE
+List Comprehension Result (on 4 threads) (1-15 inclusive) x2 if greater than 5: 
+[1, 3, 5]
+3
+Reject Result: 1 3 5 
+Select Result: 2 4 
+Replicated Integer Array: [1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3]
+Replicated Character Array: abcabcabcabcabcMaximum Value: 9
+Minimum Value: 1
+Sum of Elements: 44
+Average of Elements: 4.00
+Before Uniq like in ruby (as opposed to bash):
+apple banana apple orange banana kiwi 
+After Uniq like in ruby (as opposed to bash):
+apple banana orange kiwi 
+Before Uniq bash:
+apple banana apple orange banana kiwi 
+After Uniq bash
+apple banana apple orange banana kiwi 
+test 48
+The value for 'banana' is: (nil)
+The value for 'banana' is: is curved.
+The value for 'apple' is: is red or green
+test 48. Printing dict keys in dict of size 6 {6 => 6}
+[man, frog, banana, apple, cat, dog]
+Printing dict values
+0. walks
+1. ribbits
+2. is curved.
+3. is red or green
+4. is cute
+5. barks a lot
+To a
+{man: 0x11cdaf, frog: 0x11cda2, banana: 0x11cd6f, apple: 0x11cd7a, cat: 0x11cd8a, dog: 0x11cd92}
+{man: walks, frog: ribbits, banana: is curved., apple: is red or green, cat: is cute, dog: barks a lot}
+Adding 1000
+dict_destructor(my_dict)
+dict_destructor(my_dict) done.
+new frozen dict
+new frozen dict made
+The value for 'banana' is: dog
+The value for 'apple' is: cat
+Frozendict size is 2
+test 49
+The value for 'banana' is: 0
+Set | The value for 'banana' is: 1
+Printing set keys
+[man, frog, banana, apple, cat, dog]
+To a
+{man, frog, banana, apple, cat, dog}
+Frozenset | The value for 'banana' is: 1
+Frozenset | The value for 'apple' is: 1
+Frozenset | Frozenset size is 3
+Test 50 - randomness.
+cherry
+banana
+banana
+date
+date
+date
+cherry
+apple
+apple
+date
+Test 52
+3 size set should be. 3 <=> 3.
+Adding an additional 20,000 members to the set
+0
+8000
+16000
+20003 <=> 20003, 1.
+Del 1000 value pre.
+Del 1000 value post.
+20002
+set add new_value post 20003
+set add new_value post 20003
+set add new_value post 20003
+set add new_value post 20003
+After 50,000 insertions. Set size should be 20004 <=> 20004
+test 52 | set destructor
+Set destroyed
+ test52
+0 of 10,000 (size 13)
+1000 of 10,000 (size 13)
+2000 of 10,000 (size 13)
+3000 of 10,000 (size 13)
+4000 of 10,000 (size 13)
+5000 of 10,000 (size 13)
+6000 of 10,000 (size 13)
+7000 of 10,000 (size 13)
+8000 of 10,000 (size 13)
+9000 of 10,000 (size 13)
+Adding an additional 20,000 members to the dict
+0
+2500
+5000
+7500
+10000
+12500
+15000
+17500
+Added 20,000 elements
+Size of dictionary is 20001. It should be 20001
+Adding the same value 60,000 times, which is PRESENT in dictionary.
+Added 'foo' 60,000 times.
+Size of dictionary is 20001. It should be 20001
+Deleting keys 60,000 times and adding and deleting random keys.
+0
+15000
+30000
+45000
+dict_destructor(dict)
+dict destroyed test52
+/tmp
+
+Getting input works (popen) works - output is '/tmp' on UNIX.
+Reading words file into array.
+/usr/share/dict/words is 104335 lines and we can efficiently play around with it in a more easy fashion than Python.
+Shuffling words
+Randomly chosen word is "come". Randomly chosen word is "PDQ". Randomly chosen word is "periphrases". Randomly chosen word is "fatalistic". Randomly chosen word is "emulating". Randomly chosen word is "mania's". Randomly chosen word is "inquirer". Randomly chosen word is "dreamlike". Randomly chosen word is "housemothers". Randomly chosen word is "bouncer's". Randomly chosen word is "Chernomyrdin's". Randomly chosen word is "Barnaby". Randomly chosen word is "Mesopotamia". Randomly chosen word is "hangouts". Randomly chosen word is "beg". Randomly chosen word is "dampness". Randomly chosen word is "unfairer". Randomly chosen word is "platitudinous". Randomly chosen word is "copula". Randomly chosen word is "BITNET". Randomly chosen word is "pungently". Randomly chosen word is "cadaver's". Randomly chosen word is "currency". Randomly chosen word is "romanticism". Randomly chosen word is "burro". Randomly chosen word is "elucidation". Randomly chosen word is "meanwhile's". Randomly chosen word is "revilement". Randomly chosen word is "charwoman's". Randomly chosen word is "prettying". Randomly chosen word is "enquiring". Randomly chosen word is "villain's". Randomly chosen word is "tangy". Randomly chosen word is "desecrates". Randomly chosen word is "staterooms". Randomly chosen word is "abalones". Randomly chosen word is "grouper". Randomly chosen word is "hovels". Randomly chosen word is "vim". Randomly chosen word is "saddened". Randomly chosen word is "elevates". Randomly chosen word is "motormouth". Randomly chosen word is "toleration's". Randomly chosen word is "blamer". Randomly chosen word is "froths". Randomly chosen word is "townsmen". Randomly chosen word is "sixes". Randomly chosen word is "windscreens". Randomly chosen word is "recessional". Randomly chosen word is "cantankerous". Randomly chosen word is "offer's". Randomly chosen word is "paisleys". Randomly chosen word is "prejudgment". Randomly chosen word is "potsherd's". Randomly chosen word is "Anderson". Randomly chosen word is "wigeon's". Randomly chosen word is "assurance". Randomly chosen word is "sunscreens". Randomly chosen word is "rack's". Randomly chosen word is "calamity's". Randomly chosen word is "lyre". Randomly chosen word is "Sakha's". Randomly chosen word is "incoherence's". Randomly chosen word is "Ono's". Randomly chosen word is "slatterns". 
+Test 54.
+Test 1 passes.
+Test 2 passes.
+Test 3 passes.
+Test new 1
+Original: foo example foo
+Replaced: [foo, Dog] example [Replacement #2]
+Test new 2
+Hello world
+Cat Hello, world! Hello, universe!
+FOR
+FOR
+Cat aaaaaaaaaaaaa, world! aaaaaaaaaaaaa, universe!
+FOR
+FOR
+Cat aaaaaaaaaaaaa, world! aaaaaaaaaaaaa, universe!
+1000 iterations
+Cat Hello, world! Hello, universe!
+read_files_into_array(files, 5, &words_data, &lens, 1)
+[985084, 985084, 985084, 985084, 985084]
+
+
+Words file 0 is 985084
+Words file 1 is 985084
+Words file 2 is 985084
+Words file 3 is 985084
+Words file 4 is 985084
+All tests pass.
+==2820653== 
+==2820653== HEAP SUMMARY:
+==2820653==     in use at exit: 0 bytes in 0 blocks
+==2820653==   total heap usage: 787,211 allocs, 787,211 frees, 22,320,193 bytes allocated
+==2820653== 
+==2820653== All heap blocks were freed -- no leaks are possible
+==2820653== 
+==2820653== For lists of detected and suppressed errors, rerun with: -s
+==2820653== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)
+==2820712== Memcheck, a memory error detector
+==2820712== Copyright (C) 2002-2017, and GNU GPL'd, by Julian Seward et al.
+==2820712== Using Valgrind-3.18.1 and LibVEX; rerun with -h for copyright info
+==2820712== Command: ./decoupled_thorough_tests
+==2820712== 
+Test 1
+First element
+First element is good.
+Alloc size is 8
+i = 50000, size [49999 => 491556]
+i = 100000, size [99999 => 1106016]
+i = 150000, size [149999 => 1659036]
+i = 200000, size [199999 => 1659036]
+i = 250000, size [249999 => 2488560]
+i = 300000, size [299999 => 2488560]
+i = 350000, size [349999 => 3732852]
+i = 400000, size [399999 => 3732852]
+i = 450000, size [449999 => 3732852]
+i = 500000, size [499999 => 5599284]
+i = 550000, size [549999 => 5599284]
+i = 600000, size [599999 => 5599284]
+i = 650000, size [649999 => 5599284]
+i = 700000, size [699999 => 8398932]
+i = 750000, size [749999 => 8398932]
+i = 800000, size [799999 => 8398932]
+i = 850000, size [849999 => 8398932]
+i = 900000, size [899999 => 8398932]
+i = 950000, size [949999 => 8398932]
+i = 1000000, size [999999 => 8398932]
+All tests passed!
+==2820712== 
+==2820712== HEAP SUMMARY:
+==2820712==     in use at exit: 0 bytes in 0 blocks
+==2820712==   total heap usage: 33 allocs, 33 frees, 25,200,324 bytes allocated
+==2820712== 
+==2820712== All heap blocks were freed -- no leaks are possible
+==2820712== 
+==2820712== For lists of detected and suppressed errors, rerun with: -s
+==2820712== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)
+Allocation works.
+"Line one"
+"Line two line two"
+"Line 3"
+""
+Original: "   Hello, world!   "
+Stripped: "Hello, world!"
+Split into 3 tokens:
+1: "apple"
+2: "orange"
+3: "banana"
+Joined: "apple,orange,banana"
+len 33 on iter 0
+foo
+len 303 on iter 1
+sssssssssssssssssssssssssssssa
+len 73 on iter 2
+dasdasd
+len 23 on iter 3
+fe
+len 53 on iter 4
+feeee
+len 63 on iter 5
+aaaaaa
+len 83 on iter 6
+feeeeeee
+len 103 on iter 7
+ffeeeeeeee
+len 133 on iter 8
+sssssssssssss
+len 13 on iter 9
+m
+len 3 on iter 10
+
+Size 10000
+test 3
+Count 1
+Count 2
+Array:  World
+Total Length: 6
+Original command: echo Hello, world!
+Escaped command: echo\ Hello,\ world!
+Unsafe Input: Hello, world!'; rm -rf / # ( && | > <
+Escaped Output: Hello,\ world!\'\;\ rm\ -rf\ /\ #\ \(\ \&\&\ \|\ \>\ \<
+
+Original string: reverse
+Reversed string: esrever
+
+Does the string start with "This"? Yes
+Does the string end with "text"? Yes
+FOR
+Original sentence: The quick brown fox jumps over the lazy dog.
+Sentence after replacement: The quick brown cat jumps over the lazy dog.
+
+Occurrences of "wood" in the text: 4
+count_occurrences_of_substr_len("Foobar", 6, "o", 1) == 2 ? 
+Pass substr len assert 1.
+Pass substr len assert 2.
+Pass substr len assert 3.
+Pass substr len assert 4.
+String: "The quick brown fox jumps over the lazy dog."
+Index of first occurrence of 'o': 12
+Index of last occurrence of 'o': 41
+Is "Hello" alphabetic? Yes
+Is "Hello123" alphabetic? Yes
+
+Is "12345" numeric? Yes
+Is "123abc" numeric? No
+
+Is "Hello123" alphanumeric? Yes
+Is "Hello_123" alphanumeric? No
+Longest common prefix: "ap"
+
+Longest common suffix: ""
+
+Integer: 3232
+String representation: "3232"
+
+Integer: -1234567
+String representation: "-1234567"
+String: "3.14"
+Converted to double: 3.140000
+
+String: "The quick brown fox jumps over the lazy dog."
+Index of first vowel: 2
+Index of last vowel: 41
+Joined string: "apple,orange,banana,grape"
+
+Original string: "Reverse me!"
+Reversed in place: "!em esreveR"
+Is "12345" a valid integer? Yes
+Is "12abc" a valid integer? No
+Common prefix of "apple" and "appetizer": "app"
+
+Common suffix of "grape" and "ripe": "pe"
+
+Original sentence: "the quick brown fox"
+Title case sentence: "The Quick Brown Fox"
+Maximum value in the array: 78
+
+Minimum value in the array: 12
+
+Sum of elements in the array: 75
+
+Original array: 1 2 3 4 5 
+Reversed array: 5 4 3 2 1 
+Is the array sorted in ascending order? Yes
+
+Is the array sorted in descending order? Yes
+Array: [3, 1, 4, 1, 5, 9, 2, 6, 5, 3]
+
+Generated Range: [1, 3, 5, 7, 9]
+
+Original Array: 5 2 9 1 5 6 
+Sorted Array: 1 2 5 5 6 9 Converted string to integer: 121212
+Content written to 'ex_ample.txt':
+Hello, File I/O!
+
+Content read from 'ex_ample.txt':
+'Hello, File I/O!'
+Does file 'existing_file.txt' exist? Yes
+Does file 'non_existing_file.txt' exist? No
+
+Content appended to 'existing_file.txt':
+
+This line is appended!
+Size of file 'ex_ample.txt': 16 bytes
+
+File 'file_to_remove.txt' created.
+Source file 'source_file.txt' created.
+Files matching pattern '*.c' in directory '.' (length is 2):
+lib_and_tests.c
+decoupled_thorough_tests.c
+Concatenated String 1: 'Hello, world!'
+Concatenated String 2: 'Hello, world! How are you?'
+Mapped Int Result: 1 2 3 4 5 Reduced Result: 15
+Filtered Result: [2, 4]
+2
+4
+6
+8
+10
+246810Reduced Result: 15
+Filtered Result: 2 4 12
+14
+16
+18
+20
+22
+24
+26
+28
+30
+
+
+
+List Comprehension Result (1-15 inclusive) x2 if greater than 5: [12, 14, 16, 18, 20, 22, 24, 26, 28, 30]
+
+Equal in size
+15
+
+MULTITHREAD
+18
+20
+22
+24
+12
+14
+16
+26
+28
+30
+MULTITHREAD DONE
+List Comprehension Result (on 4 threads) (1-15 inclusive) x2 if greater than 5: 
+[1, 3, 5]
+3
+Reject Result: 1 3 5 
+Select Result: 2 4 
+Replicated Integer Array: [1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3]
+Replicated Character Array: abcabcabcabcabcMaximum Value: 9
+Minimum Value: 1
+Sum of Elements: 44
+Average of Elements: 4.00
+Before Uniq like in ruby (as opposed to bash):
+apple banana apple orange banana kiwi 
+After Uniq like in ruby (as opposed to bash):
+apple banana orange kiwi 
+Before Uniq bash:
+apple banana apple orange banana kiwi 
+After Uniq bash
+apple banana apple orange banana kiwi 
+test 48
+The value for 'banana' is: (nil)
+The value for 'banana' is: is curved.
+The value for 'apple' is: is red or green
+test 48. Printing dict keys in dict of size 6 {6 => 6}
+[man, frog, banana, apple, cat, dog]
+Printing dict values
+0. walks
+1. ribbits
+2. is curved.
+3. is red or green
+4. is cute
+5. barks a lot
+To a
+{man: 0x56642d13, frog: 0x56642d06, banana: 0x56642cd3, apple: 0x56642cde, cat: 0x56642cee, dog: 0x56642cf6}
+{man: walks, frog: ribbits, banana: is curved., apple: is red or green, cat: is cute, dog: barks a lot}
+Adding 1000
+dict_destructor(my_dict)
+dict_destructor(my_dict) done.
+new frozen dict
+new frozen dict made
+The value for 'banana' is: dog
+The value for 'apple' is: cat
+Frozendict size is 2
+test 49
+The value for 'banana' is: 0
+Set | The value for 'banana' is: 1
+Printing set keys
+[man, frog, banana, apple, cat, dog]
+To a
+{man, frog, banana, apple, cat, dog}
+Frozenset | The value for 'banana' is: 1
+Frozenset | The value for 'apple' is: 1
+Frozenset | Frozenset size is 3
+Test 50 - randomness.
+cherry
+banana
+banana
+date
+date
+date
+cherry
+apple
+apple
+date
+Test 52
+3 size set should be. 3 <=> 3.
+Adding an additional 20,000 members to the set
+0
+8000
+16000
+20003 <=> 20003, 1.
+Del 1000 value pre.
+Del 1000 value post.
+20002
+set add new_value post 20003
+set add new_value post 20003
+set add new_value post 20003
+set add new_value post 20003
+After 50,000 insertions. Set size should be 20004 <=> 20004
+test 52 | set destructor
+Set destroyed
+ test52
+0 of 10,000 (size 13)
+1000 of 10,000 (size 13)
+2000 of 10,000 (size 13)
+3000 of 10,000 (size 13)
+4000 of 10,000 (size 13)
+5000 of 10,000 (size 13)
+6000 of 10,000 (size 13)
+7000 of 10,000 (size 13)
+8000 of 10,000 (size 13)
+9000 of 10,000 (size 13)
+Adding an additional 20,000 members to the dict
+0
+2500
+5000
+7500
+10000
+12500
+15000
+17500
+Added 20,000 elements
+Size of dictionary is 20001. It should be 20001
+Adding the same value 60,000 times, which is PRESENT in dictionary.
+Added 'foo' 60,000 times.
+Size of dictionary is 20001. It should be 20001
+Deleting keys 60,000 times and adding and deleting random keys.
+0
+15000
+30000
+45000
+dict_destructor(dict)
+dict destroyed test52
+/tmp
+
+Getting input works (popen) works - output is '/tmp' on UNIX.
+Reading words file into array.
+/usr/share/dict/words is 104335 lines and we can efficiently play around with it in a more easy fashion than Python.
+Shuffling words
+Randomly chosen word is "come". Randomly chosen word is "PDQ". Randomly chosen word is "periphrases". Randomly chosen word is "fatalistic". Randomly chosen word is "emulating". Randomly chosen word is "mania's". Randomly chosen word is "inquirer". Randomly chosen word is "dreamlike". Randomly chosen word is "housemothers". Randomly chosen word is "bouncer's". Randomly chosen word is "Chernomyrdin's". Randomly chosen word is "Barnaby". Randomly chosen word is "Mesopotamia". Randomly chosen word is "hangouts". Randomly chosen word is "beg". Randomly chosen word is "dampness". Randomly chosen word is "unfairer". Randomly chosen word is "platitudinous". Randomly chosen word is "copula". Randomly chosen word is "BITNET". Randomly chosen word is "pungently". Randomly chosen word is "cadaver's". Randomly chosen word is "currency". Randomly chosen word is "romanticism". Randomly chosen word is "burro". Randomly chosen word is "elucidation". Randomly chosen word is "meanwhile's". Randomly chosen word is "revilement". Randomly chosen word is "charwoman's". Randomly chosen word is "prettying". Randomly chosen word is "enquiring". Randomly chosen word is "villain's". Randomly chosen word is "tangy". Randomly chosen word is "desecrates". Randomly chosen word is "staterooms". Randomly chosen word is "abalones". Randomly chosen word is "grouper". Randomly chosen word is "hovels". Randomly chosen word is "vim". Randomly chosen word is "saddened". Randomly chosen word is "elevates". Randomly chosen word is "motormouth". Randomly chosen word is "toleration's". Randomly chosen word is "blamer". Randomly chosen word is "froths". Randomly chosen word is "townsmen". Randomly chosen word is "sixes". Randomly chosen word is "windscreens". Randomly chosen word is "recessional". Randomly chosen word is "cantankerous". Randomly chosen word is "offer's". Randomly chosen word is "paisleys". Randomly chosen word is "prejudgment". Randomly chosen word is "potsherd's". Randomly chosen word is "Anderson". Randomly chosen word is "wigeon's". Randomly chosen word is "assurance". Randomly chosen word is "sunscreens". Randomly chosen word is "rack's". Randomly chosen word is "calamity's". Randomly chosen word is "lyre". Randomly chosen word is "Sakha's". Randomly chosen word is "incoherence's". Randomly chosen word is "Ono's". Randomly chosen word is "slatterns". 
+Test 54.
+Test 1 passes.
+Test 2 passes.
+Test 3 passes.
+Test new 1
+Original: foo example foo
+Replaced: [foo, Dog] example [Replacement #2]
+Test new 2
+Hello world
+Cat Hello, world! Hello, universe!
+FOR
+FOR
+Cat aaaaaaaaaaaaa, world! aaaaaaaaaaaaa, universe!
+FOR
+FOR
+Cat aaaaaaaaaaaaa, world! aaaaaaaaaaaaa, universe!
+1000 iterations
+Cat Hello, world! Hello, universe!
+read_files_into_array(files, 5, &words_data, &lens, 1)
+[985084, 985084, 985084, 985084, 985084]
+
+
+Words file 0 is 985084
+Words file 1 is 985084
+Words file 2 is 985084
+Words file 3 is 985084
+Words file 4 is 985084
+All tests pass.
+Test 1
+First element
+First element is good.
+Alloc size is 8
+i = 50000, size [49999 => 491556]
+i = 100000, size [99999 => 1106016]
+i = 150000, size [149999 => 1659036]
+i = 200000, size [199999 => 1659036]
+i = 250000, size [249999 => 2488560]
+i = 300000, size [299999 => 2488560]
+i = 350000, size [349999 => 3732852]
+i = 400000, size [399999 => 3732852]
+i = 450000, size [449999 => 3732852]
+i = 500000, size [499999 => 5599284]
+i = 550000, size [549999 => 5599284]
+i = 600000, size [599999 => 5599284]
+i = 650000, size [649999 => 5599284]
+i = 700000, size [699999 => 8398932]
+i = 750000, size [749999 => 8398932]
+i = 800000, size [799999 => 8398932]
+i = 850000, size [849999 => 8398932]
+i = 900000, size [899999 => 8398932]
+i = 950000, size [949999 => 8398932]
+i = 1000000, size [999999 => 8398932]
+All tests passed!