|
DataMuseum.dkPresents historical artifacts from the history of: DKUUG/EUUG Conference tapes |
This is an automatic "excavation" of a thematic subset of
See our Wiki for more about DKUUG/EUUG Conference tapes Excavated with: AutoArchaeologist - Free & Open Source Software. |
top - metrics - downloadIndex: P T
Length: 1052 (0x41c) Types: TextFile Names: »Patmain.cc«
└─⟦a05ed705a⟧ Bits:30007078 DKUUG GNU 2/12/89 └─⟦cc8755de2⟧ »./libg++-1.36.1.tar.Z« └─⟦23757c458⟧ └─⟦this⟧ »libg++/etc/Patmain.cc«
// Tests the Patricia tree #include <stream.h> #include "Patricia.h" double start_timer (void); double return_elapsed_time (double); const int Max_Key_Len = 1000; main (int argc, char *argv[]) { if (argc != 3) { cerr << "usage: " << argv [0] << " file1 file2\n"; return 1; } else { if (! freopen (argv [1], "r", stdin)) { perror (argv [0]); return 1; } Patricia_Trie Trie; char Key [Max_Key_Len]; while (gets (Key)) Trie.Insert (Key, 0); fclose (stdin); if (! freopen (argv [2], "r", stdin)) { perror (argv [0]); return 1; } start_timer (); while (gets (Key)) { Trie_Node *T = Trie.Find (Key); cout << Key << ": " << (! strcmp (Key, T->Return_Key ()) ? "is found!\n" : "is not found!\n"); } double Elapsed_Time = return_elapsed_time (0.0); cout << "Time = " << Elapsed_Time << "\n"; fclose (stdin); return 0; } }