Changeset 126 for trunk/EventBenchCore/src/de

Timestamp:

07/14/11 14:18:04 (13 years ago)

Author:

sherbold

Message:

+ added commands to obtain absolut number of observed/covered/new/possible subsequences of a given length

Location:

trunk/EventBenchCore/src/de/ugoe/cs/eventbench/coverage

Files:

• CoverageCalculatorObserved.java (modified) (3 diffs)
• CoverageCalculatorProcess.java (modified) (1 diff)

trunk/EventBenchCore/src/de/ugoe/cs/eventbench/coverage/CoverageCalculatorObserved.java

@@ -122 +122 @@
                 createSubSeqs();
                 Map<List<? extends Event<?>>, Double> weightMap = SequenceTools
-                                .generateWeights(process, observedSequences);
+                                .generateWeights(process, subSeqsObserved);
 
                 Collection<List<? extends Event<?>>> subSeqsObservedCopy = new LinkedHashSet<List<? extends Event<?>>>(
@@ -128 +128 @@
                 subSeqsObservedCopy.retainAll(subSeqsGenerated);
                 double weight = 0.0d;
-                for (List<? extends Event<?>> subSeq : subSeqsObserved) {
+                for (List<? extends Event<?>> subSeq : subSeqsObservedCopy) {
                         weight += weightMap.get(subSeq);
                 }
@@ -204 +204 @@
                 return weight;
         }
+        
+        /**
+         * <p>
+         * Returns the number of covered subsequences of length k.
+         * </p>
+         *  
+         * @return number of covered subsequences
+         */
+        public int getNumObserved() {
+                createSubSeqs();
+                return subSeqsObserved.size();
+        }
+        
+        /**
+         * <p>
+         * Returns the number of covered subsequences of length k.
+         * </p>
+         * @return
+         */
+        public int getNumCovered() {
+                createSubSeqs();
+                return subSeqsGenerated.size();
+        }
+        
+        public int getNumNew() {
+                createSubSeqs();
+                Collection<List<? extends Event<?>>> subSeqsGeneratedCopy = new LinkedHashSet<List<? extends Event<?>>>(
+                                subSeqsGenerated);
+                subSeqsGeneratedCopy.removeAll(subSeqsObserved);
+                return subSeqsGeneratedCopy.size();
+        }
+        
 
         /**

trunk/EventBenchCore/src/de/ugoe/cs/eventbench/coverage/CoverageCalculatorProcess.java

@@ -162 +162 @@
                 return weight;
         }
+        
+        /**
+         * <p>
+         * Returns the number of covered subsequences of length k.
+         * </p>
+         * @return number of covered subsequences
+         */
+        public int getNumCovered() {
+                if (containedSubSeqs == null) {
+                        containedSubSeqs = SequenceTools.containedSubSequences(sequences,
+                                        length);
+                }
+                return containedSubSeqs.size();
+        }
+        
+        /**
+         * <p>
+         * Returns the number of possible subsequences of length k according to the stochastic process.
+         * </p>
+         * 
+         * @return number of possible subsequences
+         */
+        public int getNumPossible() {
+                if (allPossibleSubSeqs == null) {
+                        allPossibleSubSeqs = process.generateSequences(length);
+                }
+                return allPossibleSubSeqs.size();
+        }
 
 }