Package | Description |
---|---|
org.apache.sysds.hops.codegen.opt | |
org.apache.sysds.hops.codegen.template |
Modifier and Type | Field and Description |
---|---|
InterestingPoint[] |
ReachabilityGraph.SubProblem.freeMat |
Modifier and Type | Method and Description |
---|---|
InterestingPoint[] |
PlanPartition.getMatPointsExt() |
InterestingPoint[] |
ReachabilityGraph.getSortedSearchSpace() |
Modifier and Type | Method and Description |
---|---|
static boolean |
InterestingPoint.isMatPoint(InterestingPoint[] list,
long from,
CPlanMemoTable.MemoTableEntry me,
boolean[] plan) |
static boolean |
InterestingPoint.isMatPoint(InterestingPoint[] list,
long from,
long to) |
void |
PlanPartition.setMatPointsExt(InterestingPoint[] points) |
Constructor and Description |
---|
PlanPartition(HashSet<Long> P,
HashSet<Long> R,
HashSet<Long> I,
HashSet<Long> Pnpc,
ArrayList<Long> M,
InterestingPoint[] Mext,
boolean hasOuter) |
SubProblem(int off,
int[] pos,
InterestingPoint[] mat) |
Modifier and Type | Method and Description |
---|---|
void |
CPlanMemoTable.pruneRedundant(long hopID,
boolean pruneDominated,
InterestingPoint[] matPoints) |
Copyright © 2020 The Apache Software Foundation. All rights reserved.