|
From: <ne...@us...> - 2010-03-14 01:10:56
|
Revision: 18
http://golok.svn.sourceforge.net/golok/?rev=18&view=rev
Author: nedgty
Date: 2010-03-14 01:10:45 +0000 (Sun, 14 Mar 2010)
Log Message:
-----------
Added some debug messages that helps getting the number of explored states
Modified Paths:
--------------
trunk/examples/dme.amf
trunk/search.scm
Modified: trunk/examples/dme.amf
===================================================================
--- trunk/examples/dme.amf 2010-03-12 07:35:08 UTC (rev 17)
+++ trunk/examples/dme.amf 2010-03-14 01:10:45 UTC (rev 18)
@@ -29,4 +29,4 @@
( node 0 SND )
}
-kernel = dme.topo
+kernel = dme-2.topo
Modified: trunk/search.scm
===================================================================
--- trunk/search.scm 2010-03-12 07:35:08 UTC (rev 17)
+++ trunk/search.scm 2010-03-14 01:10:45 UTC (rev 18)
@@ -225,7 +225,7 @@
(values #t result)))
(result
(begin
- (display-ln "We are going to search now")
+ (display-ln "This is simulating done" (vector-length result) "\n")
(values #t (search->model result))))
; otherwise just return failure
(#t
@@ -258,7 +258,7 @@
[possible-starts (filter start-state-filter new-states)])
(begin
(hash-set! store state #t)
- (if (null? possible-starts) #f
+ (if (null? possible-starts) (begin (display-ln "The hash has " (hash-count store) " state \n") #f)
(ormap (lambda (x) (search-dfs-rec x store)) possible-starts)))))))))))
@@ -329,10 +329,10 @@
(let ([fr (hash-map fringe (lambda (x y) x))])
(cond
; if fringe empty, return fail
- ((= 0 (length fr)) #f)
+ ((= 0 (length fr)) (begin (display-ln "AM I ever here?\n")#f))
; return fringe
- ((= 0 depth) fringe)
+ ((= 0 depth) (begin (display-ln "The state space is " (hash-count state-space)"\n")fringe))
; otherwise expand next
(#t
@@ -352,6 +352,7 @@
; add all states to state-space
(map (lambda (x)
(hash-set! state-space x #t)) possible-starts)
+ (display-ln "The count of state space is "(hash-count state-space) "\n")
(get-fringe-rec state-space new-fr (sub1 depth)))))))))
;;;;;;;;;;;;;;;;; end search ;;;;;;;;;;;;;;;;;;
@@ -413,6 +414,7 @@
; otherwise, lets assume this state simulates
(let ([new-em (make-vector (vector-length eq-map))])
(begin
+ (display-ln "The number of children to explore are" (length check-list) "\n")
; first make a copy of the equivalence map
(vector-copy! new-em 0 eq-map)
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|