Re: Setting a default location for files
Thomas Spahni <[email protected]> Wed, 12 Jan 2011 13:28:30 +0100 (CET)
| Newsgroups | gmane.mail.spam.crm114 |
|---|---|
| Message-ID | <[email protected]> |
On Tue, 11 Jan 2011, [email protected] wrote: > What happens when you try to run the megatest script? Does Megatest > pass? Hi Bill, This is the result of running megatest: Regards, Thomas ======================================================================= This is CRM114, version 20081111-BlameBarack, rev 10126 (TRE 0.7.5 (LGPL, APPROX, WCHAR, MULTIBYTE)) (OS: linux-gnu) Copyright 2001-2009 William S. Yerazunis This software is licensed under the GPL with ABSOLUTELY NO WARRANTY Classifiers included in this build: all of 'em Extra features: Developer Assertions are: - included - UNTRAPPABLE - '-Cdbg' will cause a memory access violation in a last ditch effort to trigger your debugger Script language: Reserved words (instructions) + attributes / format: accept alius alter (...) /.../ call (optional) [optional] /.../ cssmerge <basic bychar string microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural auto autodetect alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace ...> (...) (optional) [optional] /optional/ cssdiff <basic bychar string microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural auto autodetect alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace ...> (...) (optional) [optional] /optional/ cssbackup <basic bychar string microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural auto autodetect alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace ...> (...) (optional) [optional] /optional/ cssrestore <basic bychar string microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural auto autodetect alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace ...> (...) (optional) [optional] /optional/ cssinfo <basic bychar string microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural auto autodetect alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace ...> (...) (optional) [optional] /optional/ cssanalyze <basic bychar string microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural auto autodetect alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace ...> (...) (optional) [optional] /optional/ csscreate <nocase basic literal nomultiline byline bychar string bychunk microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace ...> (...) (optional) [optional] /optional/ cssmigrate <basic bychar string microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink default sks svm fscm neural auto autodetect alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace> (...) [...] /optional/ eval (optional) /.../ exit /optional/ fail fault /optional/ hash (...) /.../ input <nomultiline byline lineedit> (optional) [optional] intersect (...) [...] isolate <default> (...) /optional/ lazy <default> (...) /optional/ learn <fromstart nocase basic literal nomultiline byline bychar string bychunk append refute microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink sks svm fscm neural alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace> (...) [optional] /optional/ /optional/ classify <nocase basic literal nomultiline byline bychar string bychunk microgroom markovian markov osb correlate winnow chi2 unique entropy entropic osbf hyperspace unigram crosslink sks svm fscm neural alt.markovian alt.markov alt.osb alt.winnow alt.osbf alt.hyperspace> (...) (optional) [optional] /optional/ /optional/ liaf match <fromstart fromnext fromend newend fromcurrent nocase absent basic backwards literal nomultiline byline> (optional) [optional] /.../ mutate <nocase absent basic nomultiline byline bychar string bychunk unique default ...> (optional) [optional] /.../ output <append> [optional] /optional/ clump <bychunk refute unique unigram> (...) (optional) [...] /optional/ /optional/ pmulc <bychunk refute unique unigram> (...) (optional) [...] /optional/ return /optional/ routine sort <nocase basic backwards nomultiline byline bychar string bychunk unique default> (optional) [optional] /optional/ syscall <keep async> (optional) (optional) (optional) [optional] /optional/ translate <literal unique> (optional) [optional] /optional/ /optional/ trap (optional) /.../ union (...) [...] window <nocase literal bychar string bychunk byeof eofaccepts eofretry> (optional) (optional) /optional/ /optional/ ***** checking CRM language features CRM114 testing brackets, escapes and #'s If you don't see any compiler error messages, that means the test passed. CRM114 testing backslash /-;-{-abcd-}-;-/ =/==\= This text started out on three lines but it should appear on just one. testing part-line comments CRM114 testing FAULT/TRAP... --- you should not see an error yet --- you should see this --><--and this, with nothing in between. --- the next thing you see SHOULD be an error "unable to read-open"--- Caught the error - fault text was crm114: *ERROR* For some reason, I was unable to read-open the file named 'zoob.zipulrlfjf' (full path: '/var/lib/crm114/zoob.zipulrlfjf') (expanded from 'zoob.zipulrlfjf'): error = 2(No such file or directory) Sorry, but this program is very sick and probably should be killed off. This happened at line 19 of file /var/lib/crm114/fataltraptest.crm: input [zoob.zipulrlfjf] (:hi:) (runtime system location: crm_expr_file_io.c(211) in routine: crm_expr_input) --- and again, the next thing you see SHOULD be an error "unable to write-open"--- Caught the error - fault text was crm114: *ERROR* For some reason, I was unable to write-open the file named '/No/Such/Directory/frotz.mumble'; (full path: '/No/Such/Directory/frotz.mumble') errno=2(No such file or directory) Sorry, but this program is very sick and probably should be killed off. This happened at line 30 of file /var/lib/crm114/fataltraptest.crm: output [/No/Such/Directory/frotz.mumble] /:hi:/ # This is correct code; should give the I/O error as expected (runtime system location: crm_expr_file_io.c(637) in routine: crm_expr_output) crm114: *UNTRAPPABLE ERROR* Couldn't insert the file named '/var/lib/crm114/there_is_no_such_file_as_this.txt' that you asked for. This is probably a bad thing. Sorry, but this program is very sick and probably should be killed off. This happened at line 0 of file /var/lib/crm114/inserttest_a.crm: <<< no compiled statements yet >>> (runtime system location: crm_preprocessor.c(436) in routine: crm_preprocessor) CRM114 testing match functionality Testing exact match on foo... found exact match on 'foo' Testing exact match on foo... Testing absent match on foo... match says "no foo found". Testing absent match on foo... Testing nocase match on foo... found a nocase match on 'fOo' Testing nocase match on foo... Testing nocase absent match on foo... match says "no foo found". Testing nocase absent match on foo... Testing multiline match on foo... found an allowed multiline match on ' multiline: this is a multiline test of foo multiline-- should see both lines ZZZ' Testing multiline match on foo... Testing nomultiline match on foo... found a nomultiline match on 'nomultiline: this is a nomultiline test of foo' Testing nomultiline match on foo... Testing fromendchar match for foo then bar...... found the foo...then bar Testing fromendchar match for foo then bar...... found the foo... Testing fromnext match for f+oo+.. first 'foo'.. found one on 'ffoooo' Testing fromnext match for f+oo+.. first 'foo'.. Testing newend match for f+oo+.. first 'foo'.. found one on 'ffooo' Testing newend match for f+oo+.. first 'foo'.. Testing indirect goto ":twist:" and ":shout:".... got :twist:... got to TWIST. Testing indirect goto ":twist:" and ":shout:".... got :shout2:... got to SHOUT. Testing self-supplied-match ... found '123' ... found 'smith 123 anderson ZZZ' Testing self-supplied-match ... found '123' ... Testing indep start/end ... found 'foo bar 1 2 foo' ... found '1' ... found 'bar 1 2 foo bar'... found '2' Testing indep start/end ... found 'foo bar foo' ... Testing indep start/end ... found 'foo 1 foo' ... found '1' ... found 'bar 2 bar'... found '2' Testing indep start/end ... found 'foo 2 bar 1 bar foo' ... found '1' ... found 'bar 1 bar'... Testing box region control got 10-17 as this: correct (should be 'correct', no angles) Testing box region control, part 2 got 10-17 as this: rrec (should be 'rrec') Testing box region control, isolated variable got 10-17 as this: rrec (should be 'rrec') Fromend match: esult (should be 'esult') Testing box region indexed control got this: 'correct' (should be 'correct', no angles) Testing box region regex control got this: '>correct<' (should be '>correct<', with angles) Testing box region failing regex control got this: '' (should be '', the empty string) Testing box region regex/index control got this: 'correct' (should be 'correct', no angles) Testing box region index/regex control got this: '>correct<' (should be '>correct<', with angles) Testing box region index/index control got this: 'correct' (should be 'correct', no angles) Testing box region regex with spaces control got this: '> correct <' (should be '> correct <', with angles) Testing box region regex with spaces control got this: 'correct' (should be 'correct', no angles) testing <absent> versus binding (the '67' bug) The next stmt --- SHOULD--- get an error message! Caught the error, fault text was: crm114: *WARNING* This program specifies an 'absent' match, and also tries to bind variables that, by the above, aren't matched! We'll ignore these variable bindings for now. I'll try to keep working. This happened at line 293 of file /var/lib/crm114/matchtest.crm: match <absent> (:incognita:) /nothinjkljiejfksn;s94jf94msks/ (runtime system location: crm_expr_match.c(505) in routine: crm_expr_match) ------------------END OF TESTING---------------------- searching for a foo...found a foo, searching for bar.ooo... no bar.ooo in front of the foo. searching for a foo...found a foo, searching for bar.ooo... no bar.ooo in front of the foo. CRM114 testing ALTERation and copying ----- Whole file ----- 01abcdefghijkl89---------------------- 1: abcde, 2: cdefg, 3: fghij z: cdefg ---altering the z copy ----- 1: abcde, 2: cdefg, 3: fghij z: CDEEEFG ----- Whole file ----- 01abcdefghijkl89 ---altering the original ----- 1: abCDEEE, 2: CDEEEFG, 3: FGhij z: CDEEEFG ----- Whole file ----- 01abCDEEEFGhijkl89 ---altering the original again----- 1: abCD, 2: CDFG, 3: FGhij z: CDEEEFG ----- Whole file ----- 01abCDFGhijkl89---------------------- ----- Rematched Whole file ----- 01abCDFGhijkl89 ---------------------- ------putting things back----- ----- Whole file ----- 01abcdefghijkl89 ---------------------- ---------------------- :q: = cdefg ISOLATEing :q: - this should copy :q: = cdefg ALTERing :q: to ZZZZZ :q: = ZZZZZ ----- Whole file ----- 01abcdefghijkl89 ---------------------- Checking initialization of isolation AAAAA --- CRM114 testing string rewrites ------------------------ abc frobnitz_singleline this should trigger def frobnitz_multiline zebra giraffe and so should this. testpattern mno ------------------------ abc single-line rewrite ran OK. def multi-line rewrite ran OK. mno CRM114 testing that start / length works in matches DEBUG: whitelist==<<CRM114 crm114 harvard.edu tufts.edu dartmouth.edu mit.edu rpi.edu >> DEBUG: matched==<<CRM114>> DEBUG: matched==<<crm114>> DEBUG: matched==<<harvard.edu>> DEBUG: matched==<<tufts.edu>> DEBUG: matched==<<dartmouth.edu>> DEBUG: matched==<<mit.edu>> DEBUG: matched==<<rpi.edu>> DEBUG: [TheEnd] CRM114 testing outcall and status codes ----- keeping a process around ---- preparing... OK_IF_PID_CHANGES: one... MINION PROC PID: 23957 from-pipe: 5 to-pipe: 4 OK_IF_PID_SAME_AS_ABOVE: again... MINION PROC PID: 23957 from-pipe: 5 to-pipe: 4 and done ...DEAD MINION, EXIT CODE: 0 exit value test got DEAD MINION, EXIT CODE: 123 CRM114: Testing union and intersection We start with this: ' a b c d e f g h i j k l m n o p q r s t u v w x y z ' intersection of abc and cde is t1: 'c' union of l thru s is t2: 'l m n o p q r s' intersection of abc and t2 is t3: '' union of zulu and t1 is t4: 'c d e f g h i j k l m n o p q r s t u v w x y z' CRM114: test syscall 'echo beep' CRM114: testing default command line args blah 1 = :blah: blah 2 = new value CRM114: testing default command line args blah 1 = command override blah 2 = command override CRM114: testing windowing on windows and variables test one- input by chars, delimited by 'A' Got: This is the test one result A test two- input by EOFs, delimited by 'A' Got: this is the test two result A test three- window an isolated var by chars, delimited by 'A' Got: this is the test three result A test four- isolated var, input by EOFs, delimited by 'A' Got: this is the test four result A and lastly- did the data window stay constant? this is the test two result A CRM114: testing windowing on windows from a variable Input stuff is : This is the test one result A this is the test two result A this is the test three result A this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter. testing delimited by 'A' Data Window: data window test text Windowed value = This is the test one result A Remaining stuff = this is the test two result A this is the test three result A this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter. Data Window: data window test text Windowed value = this is the test two result A Remaining stuff = this is the test three result A this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter. Data Window: data window test text Windowed value = this is the test three result A Remaining stuff = this is the test four result A this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter. Data Window: data window test text Windowed value = this is the test four result A Remaining stuff = this is the test 5 result A this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter. Data Window: data window test text Windowed value = this is the test 5 result A Remaining stuff = this is the test six result A this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter. Data Window: data window test text Windowed value = this is the test six result A Remaining stuff = this is extra stuff and should trigger exit from the loop since it doesn't have the proper delimiter. Bounced out of the WINDOW loop -- no further stuff End of window-from-variable testing Start of approximate match testing. Input string to match against: "molasses anaconda foo bar baz agentsmith mranderson " (foo) {1} ---> foo (fou){~} ---> foo (foo) {1} ---> foo (fou){~0} <no match> (foo) {1} ---> foo (fou){~1} ---> foo (foo) {1} ---> foo (fou){~2} ---> foo (fou){~3} ---> foo (fuu){~} ---> foo (fuu){~0} <no match> (fuu){~1} <no match> (fuu){~2} ---> foo (fuu){~3} ---> foo (fou){#} ---> foo (fou){#0} <no match> (fou){#1} ---> foo (fou){#2} ---> foo (fou){#3} ---> foo (fou){# ~1} ---> foo (fou){#0 ~1} <no match> (fou){#1 ~1} ---> foo (fou){#2 ~1} ---> foo (fou){#3 ~1} ---> foo (fuu){#} ---> foo (fuu){#0} <no match> (fuu){#1} <no match> (fuu){#2} ---> foo (fuu){#3} ---> foo (fuu){# ~1} <no match> (fuu){#0 ~1} <no match> (fuu){#1 ~1} <no match> (fuu){#2 ~1} <no match> (fuu){#3 ~1} <no match> (fuu){# ~2} ---> foo (fuu){#0 ~2} <no match> (fuu){#1 ~2} <no match> (fuu){#2 ~2} ---> foo (fuu){#3 ~2} ---> foo (fuu){# ~3} ---> foo (fuu){#0 ~3} <no match> (fuu){#1 ~3} <no match> (fuu){#2 ~3} ---> foo (fuu){#3 ~3} ---> foo (fuu){# ~} ---> foo (fuu){#0 ~} <no match> (fuu){#1 ~} <no match> (fuu){#2 ~} ---> foo (fuu){#3 ~} ---> foo (fou){#} ---> foo (fou){#0} <no match> (fou){+1 -1} ---> fo (fou){+2 -2} ---> fo (fou){+3 -3} ---> fo (fou){# ~1} ---> foo (fou){#0 ~1} <no match> (fou){+1 -1 ~1} ---> fo (fou){+2 -2 ~1} ---> fo (fou){+3 -3 ~1} ---> fo (fou){# ~2} ---> foo (fou){#0 ~2} <no match> (fou){+1 -1 ~2} ---> fo (fou){+2 -2 ~2} ---> fo (fou){+3 -3 ~2} ---> fo (fou){# ~3} ---> foo (fou){#0 ~3} <no match> (fou){+1 -1 ~3} ---> fo (fou){+2 -2 ~3} ---> fo (fou){+3 -3 ~3} ---> fo (fou){# ~} ---> foo (fou){#0 ~} <no match> (fou){+1 -1 ~} ---> fo (fou){+2 -2 ~} ---> fo (fou){+3 -3 ~} ---> fo (fuu){#} ---> foo (fuu){#0} <no match> (fuu){+1 -1} <no match> (fuu){+2 -2} ---> f (fuu){+3 -3} ---> f (fuu){# ~1} <no match> (fuu){#0 ~1} <no match> (fuu){+1 -1 ~1} <no match> (fuu){+2 -2 ~1} <no match> (fuu){+3 -3 ~1} <no match> (fuu){# ~2} ---> foo (fuu){#0 ~2} <no match> (fuu){+1 -1 ~2} <no match> (fuu){+2 -2 ~2} ---> f (fuu){+3 -3 ~2} ---> f (fuu){# ~3} ---> foo (fuu){#0 ~3} <no match> (fuu){+1 -1 ~3} <no match> (fuu){+2 -2 ~3} ---> f (fuu){+3 -3 ~3} ---> f (fuu){# ~} ---> foo (fuu){#0 ~} <no match> (fuu){+1 -1 ~} <no match> (fuu){+2 -2 ~} ---> f (fuu){+3 -3 ~} ---> f (anaconda){~} ---> anaconda (anaonda){ 1i + 1d < 1 } <no match> (anaonda){ 1i + 1d < 2 } ---> anaconda (ananda){ 1i + 1d < 1 } <no match> (ananda){ 1i + 1d < 2 } <no match> (ananda){ 1i + 1d < 3 } ---> anaconda (ana123conda){ 1i + 1d < 2 } <no match> (ana123conda){ 1i + 1d < 3 } <no match> (ana123conda){ 1i + 1d < 4 } ---> anaconda (ana123cona){ 1i + 1d < 4 } <no match> (ana123cona){ 1i + 1d < 5 } ---> anaconda (ana123coa){ 1i + 1d < 4 } <no match> (ana123coa){ 1i + 1d < 5 } ---> anaco (ana123coa){ 1i + 1d < 6 } ---> anaco (ana123ca){ 1i + 1d < 4 } <no match> (ana123a){ 1i + 1d < 4 } <no match> (ana123a){ 1i + 1d < 3 } <no match> (anukeonda){~} ---> anaconda (anaconda){ 1i + 1d < 1} ---> anaconda (anaconda){ 1i + 1d < 1, #1} ---> anaconda (anaconda){ 1i + 1d < 1 #1 ~10 } ---> anaconda (anaconda){ #1, ~1, 1i + 1d < 1 } ---> anaconda (anaconda){ #1 ~1 1i + 1d < 1 } ---> anaconda (anacnda){ #1 ~1 1i + 1d < 1 } <no match> (agentsmith){~} ---> agentsmith (annndersen){~} ---> anderson (anentemstn){~} ---> agentsmith (anacda){~} ---> anaconda (anacda){ #1 ~1 1i + 1d < 1 } <no match> (znacnda){ #1 ~1 1i + 1d < 1 } <no match> (znacnda){ #1 ~2 1i + 1d < 1 } <no match> (znacnda){ #1 ~3 1i + 1d < 1 } <no match> (znacnda){ #1 ~3 1i + 1d < 2 } ---> anaconda (anac){~1}(onda){~1} ---> anaconda (aac){~1}(onda){~1} ---> naconda (ac){~1}(onda){~1} ---> aconda (anac){~1}(oda){~1} ---> anaconda (aac){~1}(oa){~1} ---> nacon (ac){~1}(oa){~1} ---> acon (anac){~1}(onda){~1} ---> anaconda (anZac){~1}(onZda){~1} ---> anaconda (anZZac){~1}(onZda){~1} <no match> (anZac){~1}(onZZda){~1} <no match> ([a-n]){3,100} ---> anac ([a-n]){3,100}? ---> ana end of approximate match testing. Algebraic math test string value of x is 12345, string value of pi is 3.14159 length of x is 5 , length of pi is 7 string rep of X is shorter than pi matheval of x + pi is 12348.14159 Algebraic matheval of (2*3)+(4*5) is 26 and adding 3.14159 to that is 29.14159 Testing RPN mode math string value of x is 12345, string value of pi is 3.14159 length of x is 5 , length of pi is 7 string rep of X is shorter than pi matheval of x + pi is 12348.14159 RPN matheval of (2*3)+(4*5) is 26 and adding 3.14159 to that is 29.14159 This test checks to see that EVAL properly detects blowups You should see an error message as the next thing, with a large string of Z's. We should get an error here, due to the (intentional!) loop crm114: *WARNING* The variable you're attempting to EVAL seems to eval infinitely, and hence I cannot compute it. I did try a lot, though. I got this far before I gave up: :*:a:ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ! ZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ(...truncated) I'll try to keep working. This happened at line 15 of file /var/lib/crm114/eval_infiniteloop.crm: eval (:b:) /:*:a:/ (runtime system location: crm_expr_alter.c(147) in routine: crm_expr_eval) Original: The quick brown fox jumped over the lazy dog's back delete file then append: alpha bravo charlie prior file, no append: The quick brown fox jumped over the lazy dog's back prior file, and append: The quick brown fox jumped over the lazy dog's back alpha bravo charlie Grab chars 10 thru 25: brown fox jumpe Grab chars 17 and length 12: ox jumped ov Now, change the fox to cat: uick brown cat jumped over the Final check- did it really get written? The quick brown cat jumped over the lazy dog's back alpha bravo charlie isolate :a: as 'hdgdgb aaa hdgdb', match b as /aaa/ a=hdgdgb aaa hdgdb - b=aaa alter :a: as 'x' a=x - b= re-isolate :a: as 'hdgdgb bbb hdgdb' a=hdgdgb bbb hdgdb - b= now match :b: to :a:'s 'bbb' section a=hdgdgb bbb hdgdb - b=bbb now alter :a: to 'x' again a=x - b= re-re-isolate :a: as 'hdgdgb ccc hdgdb' a=hdgdgb ccc hdgdb - b= now match :b: to :a:'s 'ccc' section a=hdgdgb ccc hdgdb - b=ccc now alter :a: to 'x' again a=x - b= Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Type: image/gif; name="clonic.GIF" Content-Transfer-Encoding: base64 Content-ID: <part1.07010905.07040200@[email protected]> Content-Disposition: inline; filename="clonic.GIF" :boundary:=------------000708090009050006030006 :c:=1 Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit :c:=2 Content-Type: image/gif; name="clonic.GIF" Content-Transfer-Encoding: base64 Content-ID: <iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii> Content-Disposition: inline; filename="clonic.GIF" :boundary:=--0123456789 :c:=1 Content-Type: text Content-Transfer-Encoding: 7bit :c:=2 Content-Type: image name="clonic.GIF" Content-Transfer-Encoding: base64 iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii :boundary:=--0123 :c:=1 C-T: txt C-T-E: 7 :c:=2 C-T: img name="clonic.GIF" C-T-E: b64 iiii Match-Isolate reclamation test 1. If this program doesn't error out, the test is passed. (we allocate about 80 megs, well past the window size, but in small (400K) chunks that alternately are allocated and become reclaimable) OK_IF_SIZE_CHANGES: Size of isolation at start: 2099165 Bytes used per pass: 2097150 Passes done: 100 Total flux through isolation: 419430000 OK_IF_SIZE_CHANGES: Final isolation size: 2099182 OK_IF_LESS_THAN_100: Total growth: 17 Match-Isolate reclamation test. If this program doesn't error out, the test is passed. (we allocate about 80 megs, well past the window size, but in small (400K) chunks that alternately are allocated and become reclaimable) OK_IF_SIZE_CHANGES: Size of isolation at start: 2101653 Bytes used per pass: 2097150 Passes done: 10 Total flux through isolation: 41943000 OK_IF_SIZE_CHANGES: Final isolation size: 2101668 OK_IF_LESS_THAN_10: Total growth: 15 Bytes used per pass: 2097150 Passes done: 20 Total flux through isolation: 83886000 OK_IF_SIZE_CHANGES: Final isolation size: 2101674 OK_IF_LESS_THAN_20: Total growth: 21 Bytes used per pass: 2097150 Passes done: 30 Total flux through isolation: 125829000 OK_IF_SIZE_CHANGES: Final isolation size: 2101675 OK_IF_LESS_THAN_30: Total growth: 22 Bytes used per pass: 2097150 Passes done: 40 Total flux through isolation: 167772000 OK_IF_SIZE_CHANGES: Final isolation size: 2101675 OK_IF_LESS_THAN_40: Total growth: 22 Starting Testing local and forking call and returns. (level 0) The foo (level 1) Middle (level 0) The bar was > a b c d e < (level 1) Got back >z y x w v< End (level 0) Doing factorial with a mutating argument arglist return factorial call entry, args = 5 1 (level 1) arglist return factorial call entry, args = 4 5 (level 2) arglist return factorial call entry, args = 3 20 (level 3) arglist return factorial call entry, args = 2 60 (level 4) arglist return factorial call entry, args = 1 120 (level 5) Recursion bottomed out, returning :out: = 120 Call return, :out: = 120 ( level 4) Call return, :out: = 120 ( level 3) Call return, :out: = 120 ( level 2) Call return, :out: = 120 ( level 1) 5 factorial is :out: (level 0) Doing factorial with inplace args. downward recurse call entry, args = 5 1 (level 1) downward recurse call entry, args = 4 5 (level 2) downward recurse call entry, args = 3 20 (level 3) downward recurse call entry, args = 2 60 (level 4) downward recurse call entry, args = 1 120 (level 5) Recursion bottomed out, returning :out: = 120 Call return, :out: = 120 (level 4) Call return, :out: = 120 (level 3) Call return, :out: = 120 (level 2) Call return, :out: = 120 (level 1) 5 factorial_inplace is :out: (level 0) Doing factorial with return args Call factorial_returnarg entry, arg = 5 (level 1) N is 5 NM1 is 4 Call factorial_returnarg entry, arg = 4 5 (level 2) N is 4 NM1 is 3 Call factorial_returnarg entry, arg = 3 4 5 (level 3) N is 3 NM1 is 2 Call factorial_returnarg entry, arg = 2 3 4 5 (level 4) N is 2 NM1 is 1 Call factorial_returnarg entry, arg = 1 2 3 4 5 (level 5) Calling bottomed out with N-1 <= 0.00 (level 5) Call returned, return value was 1 2 3 4 5 (level 4) p1: 1, p2: 2, rest: 3 4 5 multiply p1 and p2, put that on the front, and return :out: = 2 3 4 5 (level 4) Call returned, return value was 2 3 4 5 (level 3) p1: 2, p2: 3, rest: 4 5 multiply p1 and p2, put that on the front, and return :out: = 6 4 5 (level 3) Call returned, return value was 6 4 5 (level 2) p1: 6, p2: 4, rest: 5 multiply p1 and p2, put that on the front, and return :out: = 24 5 (level 2) Call returned, return value was 24 5 (level 1) p1: 24, p2: 5, rest: multiply p1 and p2, put that on the front, and return :out: = 120 (level 1) 5 factorial_returnarg is 120 (level 0) and now do some fully isolated forking calls Returned output = In the fork... data window is This is the original data window. It shouldn't change (level 0) Inputted; now the data window is: this string is your input Changing the data window in this fork. Now the data window is: This is a _changed_ data window, local to this SYSCALLed fork. (level 0) Returned status: DEAD MINION, EXIT CODE: 123 And the data window is now: This is the original data window. It shouldn't change TRANSLATE basic functionality test original: foo bar zappa 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX a-e rot13: sbb one mnccn 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX n-r again: foo bar zappa 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX a-e invrange: ull yzi azkkz 9876543210.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-v unique: fo bar zapa 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX a-e invrange: ull yzi azkkz 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-v literal: foo bzr azppz 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-e lit+uniq: foo bzr azppz 0123456789.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX z-e deletion: 02468.,?`~!@#$%^&*()_-+= XYZZY QUICK BROWN FOX - del-inv: foobarzappa13579ae del-inv2: xyywxwxwxwzzww0y2z4w6x8yywxwwxyzwxyyywxzxzzwXYZZYwQUICKwBROWNwFOXwwxw srcvar: FOO BAR ZAPPA 0123456789.,?`~!@#$%^&*()_-+= xyzzy quick brown fox A-E src-dest: ULL YZI AZKKZ 0123456789.,?`~!@#$%^&*()_-+= cbaab jfrxp yildm ulc Z-V version: 20081111-BlameBarack, rev 10126 (TRE 0.7.5 (LGPL, APPROX, WCHAR, MULTIBYTE)) noSpaces before: Are The Russian Involved ? noSpaces after : AreTheRussianInvolved? withSpaces before: Nuclear Combat Toe To Toe With The Rooskies ! withSpaces after : NuclearCombatToeToToeWithTheRooskies! { window output /:*:_pgm_text:/ } one two three ***** checking return and exit codes Status: DEAD MINION, EXIT CODE: 123 ***** check that failed syscalls will code right Status: DEAD MINION, EXIT CODE: 127 result -->you hit the jackpot<--->and that's good<--->:frobotz:<--- **** Default (SBPH Markovian) classifier type Q CLASSIFY fails; (markovian) success probability: 0.0000 pR: -10.7044 Best match to file #1 (q_test.css) prob: 1.0000 pR: 10.7044 Total features in input file: 176 #0 (i_test.css): features: 140946, hits: 693, prob: 1.98e-11, pR: -10.70 #1 (q_test.css): features: 135794, hits: 5038, prob: 1.00e+00, pR: 10.70 type I CLASSIFY succeeds; (markovian) success probability: 1.0000 pR: 10.2699 Best match to file #0 (i_test.css) prob: 1.0000 pR: 10.2699 Total features in input file: 160 #0 (i_test.css): features: 140946, hits: 4571, prob: 1.00e+00, pR: 10.27 #1 (q_test.css): features: 135794, hits: 559, prob: 5.37e-11, pR: -10.27 **** OSB Markovian classifier type Q CLASSIFY fails; (osb) success probability: 0.0011 pR: -2.9396 Best match to file #1 (q_test.css) prob: 0.9989 pR: 2.9396 Total features in input file: 44 #0 (i_test.css): features: 35237, hits: 211, prob: 1.15e-03, pR: -2.94 #1 (q_test.css): features: 33949, hits: 612, prob: 9.99e-01, pR: 2.94 type I CLASSIFY succeeds; (osb) success probability: 0.9990 pR: 3.0009 Best match to file #0 (i_test.css) prob: 0.9990 pR: 3.0009 Total features in input file: 40 #0 (i_test.css): features: 35237, hits: 601, prob: 9.99e-01, pR: 3.00 #1 (q_test.css): features: 33949, hits: 110, prob: 9.97e-04, pR: -3.00 **** OSB Markov Unique classifier type Q CLASSIFY fails; (osb) success probability: 0.0011 pR: -2.9469 Best match to file #1 (q_test.css) prob: 0.9989 pR: 2.9469 Total features in input file: 44 #0 (i_test.css): features: 29641, hits: 67, prob: 1.13e-03, pR: -2.95 #1 (q_test.css): features: 27911, hits: 450, prob: 9.99e-01, pR: 2.95 type I CLASSIFY succeeds; (osb) success probability: 0.9985 pR: 2.8378 Best match to file #0 (i_test.css) prob: 0.9985 pR: 2.8378 Total features in input file: 40 #0 (i_test.css): features: 29641, hits: 401, prob: 9.99e-01, pR: 2.84 #1 (q_test.css): features: 27911, hits: 86, prob: 1.45e-03, pR: -2.84 **** OSB Markov Chisquared Unique classifier type Q CLASSIFY fails; (osb) success probability: 0.0000 pR: -5.7886 Best match to file #1 (q_test.css) prob: 1.0000 pR: 5.7886 Total features in input file: 44 #0 (i_test.css): features: 29641, hits: 7, chi2: 2.24e+01, pR: -5.79 #1 (q_test.css): features: 27911, hits: 34, chi2: 2.86e-02, pR: 5.79 type I CLASSIFY succeeds; (osb) success probability: 1.0000 pR: 5.7255 Best match to file #0 (i_test.css) prob: 1.0000 pR: 5.7255 Total features in input file: 40 #0 (i_test.css): features: 29641, hits: 30, chi2: 3.23e-02, pR: 5.73 #1 (q_test.css): features: 27911, hits: 4, chi2: 2.35e+01, pR: -5.73 **** OSBF Local Confidence (Fidelis) classifier type Q CLASSIFY fails; (osbf) success probability: 0.0752 pR: -1.0897 Best match to file #1 (q_test.css) prob: 0.9248 pR: 1.0897 Total features in input file: 44 #0 (i_test.css): hits: 7, ufeats: 7, prob: 7.52e-02, pR: -1.09 #1 (q_test.css): hits: 34, ufeats: 34, prob: 9.25e-01, pR: 1.09 type I CLASSIFY succeeds; (osbf) success probability: 0.9067 pR: 0.9875 Best match to file #0 (i_test.css) prob: 0.9067 pR: 0.9875 Total features in input file: 40 #0 (i_test.css): hits: 30, ufeats: 30, prob: 9.07e-01, pR: 0.99 #1 (q_test.css): hits: 4, ufeats: 4, prob: 9.33e-02, pR: -0.99 **** OSB Winnow classifier type Q CLASSIFY fails; (winnow) success probability: 0.4401 pR: -1.0456 Best match to file #1 (q_test.css) weight: 50.4736 pR: 1.3486 Total features in input file: 44 #0 (i_test.css): features: 57264.78, unseen: 7, weight: 39.67, pR: 0.30 #1 (q_test.css): features: 56572.78, unseen: 7, weight: 50.47, pR: 1.35 type I CLASSIFY succeeds; (winnow) success probability: 0.5636 pR: 1.1113 Best match to file #0 (i_test.css) weight: 46.0636 pR: 1.8624 Total features in input file: 40 #0 (i_test.css): features: 57264.78, unseen: 10, weight: 46.06, pR: 1.86 #1 (q_test.css): features: 56572.78, unseen: 10, weight: 35.66, pR: 0.75 **** Now verify that winnow learns affect only the named file (i_test.css) type I CLASSIFY succeeds; (winnow) success probability: 0.5636 pR: 1.1113 Best match to file #0 (i_test.css) weight: 46.0636 pR: 1.8624 Total features in input file: 40 #0 (i_test.css): features: 58822.04, unseen: 10, weight: 46.06, pR: 1.86 #1 (q_test.css): features: 56572.78, unseen: 10, weight: 35.66, pR: 0.75 and now refute-learn into q_test.css type I CLASSIFY succeeds; (winnow) success probability: 0.5658 pR: 1.1498 Best match to file #0 (i_test.css) weight: 46.0636 pR: 1.8624 Total features in input file: 40 #0 (i_test.css): features: 58822.04, unseen: 10, weight: 46.06, pR: 1.86 #1 (q_test.css): features: 70335.06, unseen: 10, weight: 35.35, pR: 0.71 **** Unigram Bayesian classifier type Q CLASSIFY fails; (markovian) success probability: 0.4146 pR: -0.1498 Best match to file #1 (q_test.css) prob: 0.5854 pR: 0.1498 Total features in input file: 11 #0 (i_test.css): features: 8811, hits: 529, prob: 4.15e-01, pR: -0.15 #1 (q_test.css): features: 8489, hits: 486, prob: 5.85e-01, pR: 0.15 type I CLASSIFY succeeds; (markovian) success probability: 0.7123 pR: 0.3937 Best match to file #0 (i_test.css) prob: 0.7123 pR: 0.3937 Total features in input file: 10 #0 (i_test.css): features: 8811, hits: 635, prob: 7.12e-01, pR: 0.39 #1 (q_test.css): features: 8489, hits: 539, prob: 2.88e-01, pR: -0.39 **** unigram Winnow classifier type Q CLASSIFY fails; (winnow) success probability: 0.4734 pR: -0.4634 Best match to file #1 (q_test.css) weight: 11.8572 pR: 0.3259 Total features in input file: 11 #0 (i_test.css): features: 4515.52, unseen: 0, weight: 10.66, pR: -0.14 #1 (q_test.css): features: 4522.72, unseen: 0, weight: 11.86, pR: 0.33 type I CLASSIFY succeeds; (winnow) success probability: 0.5293 pR: 0.5097 Best match to file #0 (i_test.css) weight: 10.8363 pR: 0.3488 Total features in input file: 10 #0 (i_test.css): features: 4515.52, unseen: 0, weight: 10.84, pR: 0.35 #1 (q_test.css): features: 4522.72, unseen: 0, weight: 9.64, pR: -0.16 **** OSB Hyperspace classifier type Q CLASSIFY fails; (hyperspace) success probability: 0.0302 pR: -15.0693 Best match to file #1 (q_test.css) prob: 0.9698 pR: 15.0693 Total features in input file: 44 #0 (i_test.css): features: 29669, hits: 6, radiance: 1.21e-03, prob: 3.02e-02, pR: -15.07 #1 (q_test.css): features: 27984, hits: 33, radiance: 3.89e-02, prob: 9.70e-01, pR: 15.07 type I CLASSIFY succeeds; (hyperspace) success probability: 0.9803 pR: 16.9604 Best match to file #0 (i_test.css) prob: 0.9803 pR: 16.9604 Total features in input file: 40 #0 (i_test.css): features: 29669, hits: 29, radiance: 2.84e-02, prob: 9.80e-01, pR: 16.96 #1 (q_test.css): features: 27984, hits: 4, radiance: 5.71e-04, prob: 1.97e-02, pR: -16.96 **** OSB three-letter Hyperspace classifier type Q CLASSIFY fails; (hyperspace) success probability: 0.1874 pR: -6.3718 Best match to file #1 (q_test.css) prob: 0.8126 pR: 6.3718 Total features in input file: 92 #0 (i_test.css): features: 60973, hits: 9, radiance: 1.33e-03, prob: 1.87e-01, pR: -6.37 #1 (q_test.css): features: 62681, hits: 19, radiance: 5.75e-03, prob: 8.13e-01, pR: 6.37 type I CLASSIFY succeeds; (hyperspace) success probability: 0.9728 pR: 15.5268 Best match to file #0 (i_test.css) prob: 0.9728 pR: 15.5268 Total features in input file: 68 #0 (i_test.css): features: 60973, hits: 53, radiance: 4.61e-02, prob: 9.73e-01, pR: 15.53 #1 (q_test.css): features: 62681, hits: 9, radiance: 1.29e-03, prob: 2.72e-02, pR: -15.53 **** Unigram Hyperspace classifier type Q CLASSIFY fails; (hyperspace) success probability: 0.3299 pR: -3.0781 Best match to file #1 (q_test.css) prob: 0.6701 pR: 3.0781 Total features in input file: 11 #0 (i_test.css): features: 2614, hits: 7, radiance: 1.88e-02, prob: 3.30e-01, pR: -3.08 #1 (q_test.css): features: 2632, hits: 10, radiance: 3.81e-02, prob: 6.70e-01, pR: 3.08 type I CLASSIFY succeeds; (hyperspace) success probability: 0.6943 pR: 3.5617 Best match to file #0 (i_test.css) prob: 0.6943 pR: 3.5617 Total features in input file: 10 #0 (i_test.css): features: 2614, hits: 9, radiance: 3.11e-02, prob: 6.94e-01, pR: 3.56 #1 (q_test.css): features: 2632, hits: 6, radiance: 1.37e-02, prob: 3.06e-01, pR: -3.56 **** String Hyperspace classifier type Q CLASSIFY fails; (hyperspace) success probability: 0.0000 pR: -216.2760 Best match to file #1 (q_test.css) prob: 1.0000 pR: 216.2760 Total features in input file: 11 #0 (i_test.css): features: 8810, hits: 0, radiance: 0.00e+00, prob: 2.36e-22, pR: -216.28 #1 (q_test.css): features: 8488, hits: 6, radiance: 4.24e-03, prob: 1.00e+00, pR: 216.28 type I CLASSIFY succeeds; (hyperspace) success probability: 1.0000 pR: 216.1147 Best match to file #0 (i_test.css) prob: 1.0000 pR: 216.1147 Total features in input file: 10 #0 (i_test.css): features: 8810, hits: 6, radiance: 4.09e-03, prob: 1.00e+00, pR: 216.11 #1 (q_test.css): features: 8488, hits: 0, radiance: 0.00e+00, prob: 2.45e-22, pR: -216.11 **** String Unigram Hyperspace classifier type Q CLASSIFY fails; (hyperspace) success probability: 0.3205 pR: -3.2629 Best match to file #1 (q_test.css) prob: 0.6795 pR: 3.2629 Total features in input file: 11 #0 (i_test.css): features: 8810, hits: 7, radiance: 5.56e-03, prob: 3.21e-01, pR: -3.26 #1 (q_test.css): features: 8488, hits: 10, radiance: 1.18e-02, prob: 6.79e-01, pR: 3.26 type I CLASSIFY succeeds; (hyperspace) success probability: 0.6845 pR: 3.3630 Best match to file #0 (i_test.css) prob: 0.6845 pR: 3.3630 Total features in input file: 10 #0 (i_test.css): features: 8810, hits: 9, radiance: 9.20e-03, prob: 6.84e-01, pR: 3.36 #1 (q_test.css): features: 8488, hits: 6, radiance: 4.24e-03, prob: 3.16e-01, pR: -3.36 **** Vector 3-word-bag Hyperspace classifier type Q CLASSIFY fails; (hyperspace) success probability: 0.0000 pR: -218.7768/0.0000 Best match to file #1 (q_test.css) prob: 1.0000 pR: 218.7768 Total features in input file: 11 #0 (i_test.css): features: 8810, hits: 0, radiance: 0.00e+00, prob: 1.33e-22, pR: -218.78 #1 (q_test.css): features: 8488, hits: 8, radiance: 7.55e-03, prob: 1.00e+00, pR: 218.78 type I CLASSIFY succeeds; (hyperspace) success probability: 1.0000 pR: 217.4547/0.0000 Best match to file #0 (i_test.css) prob: 1.0000 pR: 217.4547 Total features in input file: 10 #0 (i_test.css): features: 8810, hits: 7, radiance: 5.57e-03, prob: 1.00e+00, pR: 217.45 #1 (q_test.css): features: 8488, hits: 0, radiance: 0.00e+00, prob: 1.80e-22, pR: -217.45 **** Bit-Entropy classifier type Q CLASSIFY fails; (bit-entropy) success probability: 0.0000 pR: -5.8950 Best match to file #1 (q_test.css) prob: 1.0000 pR: 5.8950 Total features in input file: 552 #0 (i_test.css): features: 425488 (5%), entropy: 365.245113, jumps: 21, prob: 1.27e-06, pR: -5.90 #1 (q_test.css): features: 563328 (5%), entropy: 222.828100, jumps: 7, prob: 1.00e+00, pR: 5.90 type I CLASSIFY succeeds; (bit-entropy) success probability: 1.0000 pR: 4.8632 Best match to file #0 (i_test.css) prob: 1.0000 pR: 4.8632 Total features in input file: 408 #0 (i_test.css): features: 425488 (5%), entropy: 138.295563, jumps: 4, prob: 1.00e+00, pR: 4.86 #1 (q_test.css): features: 563328 (5%), entropy: 255.785642, jumps: 16, prob: 1.37e-05, pR: -4.86 **** Bit-Entropy Toroid classifier type Q CLASSIFY fails; (bit-entropy) success probability: 0.0000 pR: -9.5657 Best match to file #1 (q_test.css) prob: 1.0000 pR: 9.5657 Total features in input file: 552 #0 (i_test.css): features: 425488 (100%), entropy: 519.417393, jumps: 33, prob: 2.72e-10, pR: -9.57 #1 (q_test.css): features: 563328 (100%), entropy: 288.321999, jumps: 8, prob: 1.00e+00, pR: 9.57 type I CLASSIFY succeeds; (bit-entropy) success probability: 1.0000 pR: 8.3545 Best match to file #0 (i_test.css) prob: 1.0000 pR: 8.3545 Total features in input file: 408 #0 (i_test.css): features: 425488 (100%), entropy: 231.058286, jumps: 7, prob: 1.00e+00, pR: 8.35 #1 (q_test.css): features: 563328 (100%), entropy: 432.894104, jumps: 28, prob: 4.42e-09, pR: -8.35 **** Fast Substring Compression Match Classifier type Q CLASSIFY fails; (fscm) success probability: 0.2916 pR: -77.0954 Best match to file #1 (q_test.css) prob: 0.7084 pR: 77.0954 Total features in input file: 69 #0 (i_test.css): features: 53190, chcs: 125.02, prob: 2.92e-01, pR: -77.10 #1 (q_test.css): features: 70420, chcs: 303.70, prob: 7.08e-01, pR: 77.10 type I CLASSIFY succeeds; (fscm) success probability: 0.6422 pR: 50.8091 Best match to file #0 (i_test.css) prob: 0.6422 pR: 50.8091 Total features in input file: 51 #0 (i_test.css): features: 53190, chcs: 184.38, prob: 6.42e-01, pR: 50.81 #1 (q_test.css): features: 70420, chcs: 102.72, prob: 3.58e-01, pR: -50.81 **** Neural Network Classifier crm114: *WARNING* neural: failed to converge within the training limit. Beware your results. You might want to consider a larger network as well. I'll try to keep working. This happened at line 2 of file /var/lib/crm114/(from command line): learn < neural refute fromstart > (i_test.css) (runtime system location: crm_neural_net.c(2210) in routine: crm_neural_net_learn) type I CLASSIFY succeeds; (neural net) success probability: 0.545068 pR: -1.4196 Best match to file #0 (i_test.css) prob: 0.5451 pR: 36.6034 Total features in input file: 268 #0 (i_test.css): icnr: 0.83 ocnr: 0.56 prob: 5.45e-01, pR: 36.60 #1 (q_test.css): icnr: 0.55 ocnr: 0.50 prob: 4.55e-01, pR: 5.68 type I CLASSIFY succeeds; (neural net) success probability: 0.928740 pR: 23.4889 Best match to file #0 (i_test.css) prob: 0.9287 pR: 12.8716 Total features in input file: 372 #0 (i_test.css): icnr: 0.54 ocnr: 0.41 prob: 9.29e-01, pR: 12.87 #1 (q_test.css): icnr: 0.06 ocnr: 0.97 prob: 7.13e-02, pR: -93.96 **** Alternate Neural Network Classifier test script Alternating Example Neural Network Classifier TRAINING **** Alternating Example Neural Network Classifier RUNNING TEST type Q CLASSIFY fails; (neural net) success probability: 0.033776 pR: -21.7267 Best match to file #1 (q_test.css) prob: 0.9662 pR: 86.9068 Total features in input file: 172 #0 (i_test.css): icnr: 0.03 ocnr: 0.96 prob: 3.38e-02, pR: -92.56 #1 (q_test.css): icnr: 0.93 ocnr: 0.06 prob: 9.66e-01, pR: 86.91 type I CLASSIFY succeeds; (neural net) success probability: 0.859575 pR: 16.9365 Best match to file #0 (i_test.css) prob: 0.8596 pR: 91.4497 Total features in input file: 168 #0 (i_test.css): icnr: 0.96 ocnr: 0.04 prob: 8.60e-01, pR: 91.45 #1 (q_test.css): icnr: 0.15 ocnr: 0.84 prob: 1.40e-01, pR: -67.75 **** Support Vector Machine (SVM) unigram classifier type I CLASSIFY succeeds; (svm) success probability: 0.8657 pR: 8.0912 Best match to file #0 (i_test.css) prob: 0.8657 pR: 8.0912 Total features in input file: 11 #0 (i_test.css): documents: 300, features: 7464, prob: 8.66e-01, pR: 8.09 #1 (q_test.css): documents: 176, features: 6291, prob: 1.34e-01, pR: -8.09 type I CLASSIFY succeeds; (svm) success probability: 0.9941 pR: 22.2614 Best match to file #0 (i_test.css) prob: 0.9941 pR: 22.2614 Total features in input file: 10 #0 (i_test.css): documents: 300, features: 7464, prob: 9.94e-01, pR: 22.26 #1 (q_test.css): documents: 176, features: 6291, prob: 5.91e-03, pR: -22.26 **** Support Vector Machine (SVM) classifier type I CLASSIFY succeeds; (svm) success probability: 0.8431 pR: 7.3022 Best match to file #0 (i_test.css) prob: 0.8431 pR: 7.3022 Total features in input file: 44 #0 (i_test.css): documents: 300, features: 34780, prob: 8.43e-01, pR: 7.30 #1 (q_test.css): documents: 176, features: 32821, prob: 1.57e-01, pR: -7.30 type I CLASSIFY succeeds; (svm) success probability: 0.9604 pR: 13.8516 Best match to file #0 (i_test.css) prob: 0.9604 pR: 13.8516 Total features in input file: 40 #0 (i_test.css): documents: 300, features: 34780, prob: 9.60e-01, pR: 13.85 #1 (q_test.css): documents: 176, features: 32821, prob: 3.96e-02, pR: -13.85 **** String Kernel SVM (SKS) classifier type I CLASSIFY succeeds; (sks) success probability: 0.6178 pR: 2.0847 Best match to file #0 (i_test.css) prob: 0.6178 pR: 2.0847 Total features in input file: 69 #0 (i_test.css): documents: 300, features: 52237, prob: 6.18e-01, pR: 2.08 #1 (q_test.css): documents: 176, features: 69553, prob: 3.82e-01, pR: -2.08 type I CLASSIFY succeeds; (sks) success probability: 0.9733 pR: 15.6215 Best match to file #0 (i_test.css) prob: 0.9733 pR: 15.6215 Total features in input file: 51 #0 (i_test.css): documents: 300, features: 52237, prob: 9.73e-01, pR: 15.62 #1 (q_test.css): documents: 176, features: 69553, prob: 2.67e-02, pR: -15.62 **** String Kernel SVM (SKS) Unique classifier type I CLASSIFY succeeds; (sks) success probability: 0.6487 pR: 2.6635 Best match to file #0 (i_test.css) prob: 0.6487 pR: 2.6635 Total features in input file: 68 #0 (i_test.css): documents: 300, features: 42397, prob: 6.49e-01, pR: 2.66 #1 (q_test.css): documents: 176, features: 37979, prob: 3.51e-01, pR: -2.66 type I CLASSIFY succeeds; (sks) success probability: 0.9738 pR: 15.6980 Best match to file #0 (i_test.css) prob: 0.9738 pR: 15.6980 Total features in input file: 49 #0 (i_test.css): documents: 300, features: 42397, prob: 9.74e-01, pR: 15.70 #1 (q_test.css): documents: 176, features: 37979, prob: 2.62e-02, pR: -15.70 **** Bytewise Correlation classifier type Q CLASSIFY fails; (correlate) success probability: 0.0096 pR: -2.0155 Best match to file #1 (QUICKREF_mt_ng_reference_1.input) prob: 0.9904 pR: 2.0155 Total features in input file: 70416 #0 (INTRO_mt_ng_reference_2.input): features: 53186, L1: 219063 L2: 325594 L3: 585264, L4: 1747198 prob: 9.56e-03, pR: -2.02 #1 (QUICKREF_mt_ng_reference_1.input): features: 70416, L1: 394864 L2: 611088 L3: 6596464, L4: 326363316 prob: 9.90e-01, pR: 2.02 type I CLASSIFY succeeds; (correlate) success probability: 1.0000 pR: 4.3458 Best match to file #0 (INTRO_mt_ng_reference_2.input) prob: 1.0000 pR: 4.3458 Total features in input file: 53186 #0 (INTRO_mt_ng_reference_2.input): features: 53186, L1: 593131 L2: 3238253 L3: 344785845, L4: 52869796589 prob: 1.00e+00, pR: 4.35 #1 (QUICKREF_mt_ng_reference_1.input): features: 70416, L1: 1085246 L2: 1389813 L3: 2033683, L4: 4362813 prob: 4.51e-05, pR: -4.35 **** Clump / Pmulc Test crm114: *UNTRAPPABLE ERROR* Cannot allocate distance matrix M[] (C) Stick a fork in us; we're _done_. Sorry, but this program is very sick and probably should be killed off. This happened at line 3 of file /var/lib/crm114/(from command line): clump <bychunk> [:one_paragraph:] (i_test.css) /[[:graph:]]+/ (runtime system location: crm_expr_clump.c(785) in routine: thresholding_average_cluster) crm114: *UNTRAPPABLE ERROR* Better start screaming, guv', since the software's just gone critical: assertion '!(scale <= 1.19209289550781250000e-7F && scale >= -1.19209289550781250000e-7F)' failed! Sorry, but this program is very sick and probably should be killed off. This happened at line 3 of file /var/lib/crm114/(from command line): clump [:one_paragraph:] <bychunk> (i_test.css) /[[:graph:]]+/ (runtime system location: crm_expr_clump.c(844) in routine: thresholding_average_cluster) Unsure result PMULC fails; success probability: 0.0000 pR: 0.0000 Best match to clump #1 (clump_#1) prob: 0.0000 pR: 0.0000 Closest document: #-1 (document_#-1) affinity: -1.0000 Total features in input file: 259 Unsure result PMULC fails; success probability: 0.0000 pR: 0.0000 Best match to clump #1 (clump_#1) prob: 0.0000 pR: 0.0000 Closest document: #-1 (document_#-1) affinity: -1.0000 Total features in input file: 223 Likely result: 0 (document_#0) clump: 0 (unassigned) affinity: 0.0822 1 (document_#1) clump: 0 (unassigned) affinity: 0.0822 ------------------------------------------------------------------------------ Protect Your Site and Customers from Malware Attacks Learn about various malware tactics and how to avoid them. Understand malware threats, the impact they can have on your business, and how you can protect your company and customers by using code signing. http://p.sf.net/sfu/oracle-sfdevnl _______________________________________________ Crm114-general mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/crm114-general