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

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

92
93
94
95
96
97
98
99
100
101
102
            for( int j=0; j<chrs.length ; j++ ){
                String chr= chrs[j];
                ArrayList<Region> rs= lb.getLandscape2DForChromosome(chr).getRegions();
                if(rs!=null && rs.size()>=1){
                    for( int i=0; i<rs.size() ; i++ ){
                        Region r = rs.get(i);
                        double v= Double.parseDouble(r.attr.toString());
                        if(v!=0 & r.low>0){
                            bw.write(chr+"\t"+
                                    (int)r.low+"\t"+
                                    (int)(r.high+1)+"\t"+
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127

public static void main(String[] args) throws Exception {

    Region[] rs1= new Region[]{
        new Region(210,350),
        new Region(-10,-1),
        new Region(1,20)
    };
    Region[] rs2= new Region[]{
        new Region(210,350),
        new Region(-10,-1),
        new Region(1,20)
    };
    Regions rr1= new Regions(rs1),
            rr2= new Regions(rs2);
   
    DiscreteNumericalSet d1= new DiscreteNumericalSet(5,6,7,18);
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127

public static void main(String[] args) throws Exception {

    Region[] rs1= new Region[]{
        new Region(210,350),
        new Region(-10,-1),
        new Region(1,20)
    };
    Region[] rs2= new Region[]{
        new Region(210,350),
        new Region(-10,-1),
        new Region(1,20)
    };
    Regions rr1= new Regions(rs1),
            rr2= new Regions(rs2);
   
    DiscreteNumericalSet d1= new DiscreteNumericalSet(5,6,7,18);
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
*/
public static ArrayList<Region> merge(ArrayList<Region> rs) throws RegionException{
    if(rs!=null){
        ArrayList<Region> ret= sortByLow(rs);
        for(int i=0;i<ret.size();i++){
            Region r1= ret.get(i);
            for(int j=i+1;j<ret.size();j++){
                Region r2= ret.get(j);
                if(r2.higherThan(r1)){
                    break;
                }
                if(r1.overlapsWith(r2)){
                    Region un= r1.getUnionRegion(r2);
                    ret.remove(j);
                    ret.remove(i);
                    ret.add(i, un);
                    i=-1;
                    break;
View Full Code Here
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
        return ret;
    }
    if(tar.low<ref.low){
        try{
            if(ifint){
                ret.add(new Region(tar.low, ref.low-1));
            }else{
                ret.add(new Region(tar.low, ref.low));
            }
        }catch(RegionException re){}
    }
    if(tar.high>ref.high){
        try{
            if(ifint){
                ret.add(new Region(ref.high+1, tar.high));
            }else{
                ret.add(new Region(ref.high, tar.high));
            }
        }catch(RegionException re){}
    }
    return ret;
}
View Full Code Here
214
215
216
217
218
219
220
221
222
223
224
225
226
227
*/
public static ArrayList<Region> getExtraRegionsAll(Region tar, ArrayList<Region> refs){
    ArrayList<Region> rets= new ArrayList<>();
    rets.add(tar);
    for( int i=0; i<refs.size() ; i++ ){
        Region ref= refs.get(i);
        for( int j=0; j<rets.size() ; j++ ){
            Region ret= rets.get(j);
            if(ret.overlapsWith(ref)){
                if(ref.contains(ret)){
                    rets.remove(ret);
                }else{
                    ArrayList<Region> ex= getExtraRegions(ret, ref);
                    if(ex.size()>=1){
View Full Code Here
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
   
   
   
public static void main(String[] args) throws RegionException{
    Region[] rs= new Region[]{
        new Region(17576,18566)
    };
    ArrayList<Region> al= new ArrayList<>();
    for( int i=0; i<rs.length ; i++ ){
        al.add(rs[i]);
    }
    Region r= new Region(17385,17596);
   
    ArrayList<Region> ex= getExtraRegionsAll(r, al);
    for( int i=0; i<ex.size() ; i++ ){
        System.out.print("aa: ");
        ex.get(i).printInt();
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
    String l= br.readLine();
    if(l==null){
        return null;
    }
    String[] s= l.split("\t");
    Region ret= new Region(
            Integer.parseInt(s[lowCol]),
            Integer.parseInt(s[highCol])
            );
    return ret;
}
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
* @return
* @throws Exception
*/
public ArrayList<Region> reloadAndGetList(Region r) throws Exception{
    while(true){
        Region nr= nextRegion();
        if(nr==null){
            break;
        }
        //nr.printIntAfter("### "+ (int)r.low+"   "+ (int)r.high+"  ");
        if(nr.higherThan(r)){
            doRegionHigherThanTarget();
            break;
        }
        if(nr.overlapsWith(r)){
            blist.add(nr);
        }
    }
    //System.out.print(blist.size()+"  ");
   
    while(true){
        if(blist.isEmpty()){
            break;
        }
        Region lowr= blist.get(0);
        if(lowr.lowerThan(r)){
            blist.remove(0);
        }else{
            break;
        }
    }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
* @return
* @throws Exception
*/
public ArrayList<Region> reloadAndGetList(Region r) throws Exception{
    while(true){
        Region nr= nextRegion();
        if(nr==null){
            break;
        }
        //nr.printIntAfter("### "+ (int)r.low+"   "+ (int)r.high+"  ");
        if(nr.higherThan(r)){
            doRegionHigherThanTarget();
            break;
        }
        if(nr.overlapsWith(r)){
            blist.add(nr);
        }
    }
    //System.out.print(blist.size()+"  ");
   
    while(true){
        if(blist.isEmpty()){
            break;
        }
        Region lowr= blist.get(0);
        if(lowr.lowerThan(r)){
            blist.remove(0);
        }else{
            break;
        }
    }
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.