Package fork.lib.math.algebra.elementary.set.continuous

Examples of fork.lib.math.algebra.elementary.set.continuous.Region

93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
* join regions that are close together
* @param rs
*/
protected void join(ArrayList<Region> rs){
    for( int i=0; i<rs.size()-1; i++ ){
        Region r= (Region)rs.get(i);
        Region rn= (Region)rs.get(i+1);
        if(rn.higherThan(r)){
            double dis= rn.low-r.high;
            if(dis<=par.joinGap){
                try{
                    Region ovl= new Region(r.low, rn.high);
                    rs.set(i, ovl);
                    rs.remove(rn);
                    i--;
                }catch(RegionException re){
                    re.printStackTrace();
View Full Code Here
29
30
31
32
33
34
35
36
37
public boolean satisfyMin(Landscape2D data){
    ArrayList<Region> ps= data.getRegions();
    if(ps==null || ps.isEmpty()){
        return false;
    }
    Region r= data.getXRange();
    double w= r.high-r.low+1;
    return w>=minWidth;
}
View Full Code Here
39
40
41
42
43
44
45
46
47
public boolean satisfyMax(Landscape2D data){
    ArrayList<Region> ps= data.getRegions();
    if(ps==null || ps.isEmpty()){
        return false;
    }
    Region r= data.getXRange();
    double w= r.high-r.low+1;
    return w<=maxWidth;
}
View Full Code Here
137
138
139
140
141
142
143
144
145
146
147
public void printAll(){
    printAll(this, "");
}
   
protected void printAll(EMPeakDetector p, String tag){
    Region reg= p.data.getXRange();
    ArrayList<EMPeakDetector> spds= p.subs;
    double sthr= p.thr;
    int l= (int) reg.low;
    int h= (int) reg.high;
    System.out.println(tag+" "+l+" - "+h+"  thr: "+sthr);
View Full Code Here
160
161
162
163
164
165
166
167
168
169
170
public void printLeaf(String tag){
    printLeaf(tag, this);
}

protected void printLeaf(String t, EMPeakDetector p){
    Region reg= p.data.getXRange();
    ArrayList<EMPeakDetector> spds= p.subs;
    int l= (int) reg.low;
    int h= (int) reg.high;
    if(spds!=null && spds.size()>0){
        for( int i=0; i<spds.size() ; i++ ){
View Full Code Here
29
30
31
32
33
34
35
36
37
38
39
    }

    public Landscape2D(ArrayList<Double> vs, ArrayList<Double> poss) throws RegionException, Landscape2DException{
        regs= new ArrayList<>();
        for( int i=0; i<vs.size()-1 ; i++ ){
            Region r= new Region(poss.get(i), poss.get(i+1));
            r.attr= vs.get(i);
            add(r);
        }
        init();
    }
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
    }
   
    public Landscape2D(ArrayList<Point2D> ps) throws RegionException, Landscape2DException{
        regs= new ArrayList<>();
        for( int i=0; i<ps.size()-1 ; i++ ){
            Region r= new Region(ps.get(i).x, ps.get(i+1).x);
            r.attr= new Double(ps.get(i).y);
            add(r);
        }
        init();
    }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
    }
}

public void checkAllNumeric() throws Landscape2DException{
    for( int i=0; i<regs.size() ; i++ ){
        Region r= regs.get(i);
        if(!checkNumeric(r)){
            throw new Landscape2DException();
        }
    }
}
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
    if(!regs.isEmpty()){
        if(!r.higherThan(regs.get(regs.size()-1))){
            System.err.println((int)r.low+"    not higher than   "+ (int)regs.get(regs.size()-1).high);
            throw new Landscape2DException();
        }
        Region lr= regs.get(regs.size()-1);
        if(r.low== lr.high+1){
            if(((Double)lr.attr).equals( (Double)r.attr)){
                try{
                    Region nr= new Region(lr.low, r.high);
                    nr.attr= lr.attr;
                    regs.set(regs.size()-1, nr);
                }catch(RegionException re){}
            }else{
                regs.add(r);
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
public Region getXRange(){
    if(regs==null || regs.isEmpty()){
        return null;
    }
    try{
        return new Region(regs.get(0).low, regs.get(regs.size()-1).high);
    }catch(RegionException re){
        re.printStackTrace();
        return null;
    }
}
View Full Code Here
TOP

Related Classes of fork.lib.math.algebra.elementary.set.continuous.Region

  • data.cerevisiae.ConsToWig
  • data.cerevisiae.histmod.cai2011.ToWig
  • data.cerevisiae.histmod.guillemette2011.ToWig
  • data.cerevisiae.inhouse.a_norm.NormChipSeqRPM
  • data.cerevisiae.inhouse.chip.ChipChipRemoveExtreme
  • data.cerevisiae.region.CorrectXu2009
  • data.cerevisiae.region.GenerateWindowsNonOverlapping
  • data.human.inhouse.norm.NormChipSeq
  • data.human.statham2014mods.NormTest
  • fork.lib.math.algebra.elementary.function.v1.FunctionV1
    • Copyright © 2018 www.massapicom. 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.