Examples of mergeWith()

Examples of aima.core.learning.inductive.DecisionList.mergeWith()

94
95
96
97
98
99
100
101
102
103
104
    // at this point there is a test that classifies some subset of examples
    // with the same target value
    DataSet matched = test.matchedExamples(ds);
    DecisionList list = new DecisionList(positive, negative);
    list.add(test, matched.getExample(0).targetValue());
    return list.mergeWith(decisionListLearning(test.unmatchedExamples(ds)));
  }

  private DLTest getValidTest(List<DLTest> possibleTests, DataSet ds) {
    for (DLTest test : possibleTests) {
      DataSet matched = test.matchedExamples(ds);
View Full Code Here

Examples of aima.core.learning.inductive.DecisionList.mergeWith()

77
78
79
80
81
82
83
84
85
86
87
    // at this point there is a test that classifies some subset of examples
    // with the same target value
    DataSet matched = test.matchedExamples(ds);
    DecisionList list = new DecisionList(positive, negative);
    list.add(test, matched.getExample(0).targetValue());
    return list.mergeWith(decisionListLearning(test.unmatchedExamples(ds)));
  }

  private DLTest getValidTest(List<DLTest> possibleTests, DataSet ds) {
    for (DLTest test : possibleTests) {
      DataSet matched = test.matchedExamples(ds);
View Full Code Here

Examples of com.sun.tools.javac.comp.Infer.GraphSolver.InferenceGraph.Node.mergeWith()

1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
                //merge cyclic nodes
                ArrayList<Node> acyclicNodes = new ArrayList<Node>();
                for (List<? extends Node> conSubGraph : GraphUtils.tarjan(nodes)) {
                    if (conSubGraph.length() > 1) {
                        Node root = conSubGraph.head;
                        root.mergeWith(conSubGraph.tail);
                        for (Node n : conSubGraph) {
                            notifyUpdate(n, root);
                        }
                    }
                    acyclicNodes.add(conSubGraph.head);
View Full Code Here

Examples of edu.brown.cs.rampcommon.callgraph.CallGraph.mergeWith()

197
198
199
200
201
202
203
204
205
206
207
            } catch (Exception e)
            {
                throw new RampException(String.format("Exception initializing graphs for thread group %s",
                        strGroupName, e));
            }
            graphForThreadGroup.mergeWith(threadGraphEntry.getValue());
        }

        //Finalize for thread groups
        for (Map.Entry<String, CallGraph> entry : m_callGraphThreadGroups.entrySet())
        {
View Full Code Here

Examples of io.airlift.stats.cardinality.HyperLogLog.mergeWith()

38
39
40
41
42
43
44
45
46
47
48
            state.setHyperLogLog(input);
            state.addMemoryUsage(input.estimatedInMemorySize());
        }
        else {
            state.addMemoryUsage(-previous.estimatedInMemorySize());
            previous.mergeWith(input);
            state.addMemoryUsage(previous.estimatedInMemorySize());
        }
    }

    @Override
View Full Code Here

Examples of io.airlift.stats.cardinality.HyperLogLog.mergeWith()

67
68
69
70
71
72
73
74
75
76
77
            state.setHyperLogLog(input);
            state.addMemoryUsage(input.estimatedInMemorySize());
        }
        else {
            state.addMemoryUsage(-previous.estimatedInMemorySize());
            previous.mergeWith(input);
            state.addMemoryUsage(previous.estimatedInMemorySize());
        }
    }

    @Override
View Full Code Here

Examples of io.airlift.stats.cardinality.HyperLogLog.mergeWith()

224
225
226
227
228
229
230
231
232
233
234
                        estimators.set(groupId, input);
                        sizeOfValues += input.estimatedInMemorySize();
                    }
                    else {
                        sizeOfValues -= previous.estimatedInMemorySize();
                        previous.mergeWith(input);
                        sizeOfValues += previous.estimatedInMemorySize();
                    }
                }
            }
            checkState(!intermediates.advanceNextPosition());
View Full Code Here

Examples of io.airlift.stats.cardinality.HyperLogLog.mergeWith()

161
162
163
164
165
166
167
168
169
170
171
                estimators.set(groupId, instance);
                sizeOfValues += instance.estimatedInMemorySize();
            }
            else {
                sizeOfValues -= previous.estimatedInMemorySize();
                previous.mergeWith(instance);
                sizeOfValues += previous.estimatedInMemorySize();
            }
        }
    }
}
View Full Code Here

Examples of io.airlift.stats.cardinality.HyperLogLog.mergeWith()

40
41
42
43
44
45
46
47
48
49
50
            state.setHyperLogLog(input);
            state.addMemoryUsage(input.estimatedInMemorySize());
        }
        else {
            state.addMemoryUsage(-previous.estimatedInMemorySize());
            previous.mergeWith(input);
            state.addMemoryUsage(previous.estimatedInMemorySize());
        }
    }

    @OutputFunction(HyperLogLogType.class)
View Full Code Here

Examples of io.airlift.stats.cardinality.HyperLogLog.mergeWith()

81
82
83
84
85
86
87
88
89
90
91
            state.setHyperLogLog(input);
            state.addMemoryUsage(input.estimatedInMemorySize());
        }
        else {
            state.addMemoryUsage(-previous.estimatedInMemorySize());
            previous.mergeWith(input);
            state.addMemoryUsage(previous.estimatedInMemorySize());
        }
    }

    @OutputFunction(HyperLogLogType.class)
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.