Package edu.umd.cloud9.io.array

Examples of edu.umd.cloud9.io.array.ArrayListOfIntsWritable

27
28
29
30
31
32
33
    super();
    terms = new ArrayListOfIntsWritable();
  }

  public MinhashSignature(ArrayListOfIntsWritable b){
    terms = new ArrayListOfIntsWritable(b);
  }
View Full Code Here
36
37
38
39
40
41
42
    this(other.terms);
  }
 
  public MinhashSignature(int numTerms){      //need this constructor for general purposes.
    super();
    terms = new ArrayListOfIntsWritable(numTerms);
  }
View Full Code Here
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174

  @Override
  public int hammingDistance(Signature signature, int threshold){
    MinhashSignature s2 = (MinhashSignature) signature;
    ArrayListOfIntsWritable l1 = this.terms;
    ArrayListOfIntsWritable l2 = s2.terms;

    int count=0;
    for(int i=0;i<l1.size();i++){

      int i1 = l1.get(i), i2=l2.get(i);
      if(i1!=i2){
        count++;
        if(count>threshold){
          return count;
        }
View Full Code Here
239
240
241
242
243
244
245
246
247
248
249
   *   last index to be included in sub-list
   * @return
   *   return a new ArrayListOfIntsWritable object, containing the ints of this object from <code>start</code> to <code>end</code>
   */
  public ArrayListOfIntsWritable sub(ArrayListOfIntsWritable lst, int start, int end) {
    ArrayListOfIntsWritable sublst = new ArrayListOfIntsWritable(end-start+1);
    for(int i=start;i<=end;i++){
      sublst.add(lst.get(i));
    }
    return sublst;
  }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
  public ArrayListOfIntsWritable nextPermutation() {
    if(combEnd==NUM_BLOCKS){
      throw new RuntimeException("Too many calls! All permutations done!");
    }
    System.err.println(combStart+","+combEnd);
    ArrayListOfIntsWritable perm = new ArrayListOfIntsWritable();
    addAll(perm, blocks[combStart].getArray());
    addAll(perm, blocks[combEnd].getArray());
    //    if(combStart==(BLOCK_SIZE-1) ||combEnd==(BLOCK_SIZE-1)){
    //      keyLen = 25;
    //    }else{
    //      keyLen = 26;
    //    }
    ArrayList<Integer> rest = new ArrayList<Integer>();
    for(int i=0;i<NUM_BLOCKS;i++){
      if(i!=combStart && i!=combEnd){
        rest.add(i);
      }
    }
    Collections.shuffle(rest);

    for(int nextBlock : rest){
      addAll(perm, blocks[nextBlock].getArray());
    }
    if(perm.size()!=length){
      throw new RuntimeException("Number of elements not correct!");
    }
    if(combEnd==(NUM_BLOCKS-1)){
      combStart++;
      combEnd = combStart+1;
View Full Code Here
45
46
47
48
49
50
51
  /**
   * Constructs a target with an empty source list.
   */
  public AnchorTextTarget() {
    sources = new ArrayListOfIntsWritable();
  }
View Full Code Here
17
18
19
20
21
22
23
24
25
26
27
 
  public static void writeToFile(Permutation p, int numPerms, FileSystem fs, JobConf job, String fileName) throws IOException{
    SequenceFile.Writer writer = SequenceFile.createWriter(fs, job, new Path(fileName), IntWritable.class, ArrayListOfIntsWritable.class);

    for(int j=0;j<numPerms;j++){
      ArrayListOfIntsWritable perm = p.nextPermutation();
      writer.append(new IntWritable(j), perm);
      //            sLogger.debug(j +":"+perm);
    }
    writer.close();
  }
View Full Code Here
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
    public void map(LongWritable key, Text value,
        OutputCollector<IntWritable, HITSNode> output, Reporter reporter)
        throws IOException {

      ArrayListOfIntsWritable links = new ArrayListOfIntsWritable();
      String line = ((Text) value).toString();
      StringTokenizer itr = new StringTokenizer(line);
      if (itr.hasMoreTokens()) {
        int curr = Integer.parseInt(itr.nextToken());
        if (stopList.contains(curr)) {
          return;
        }
        links.add(curr);
        valOut.setInlinks(links);
        valOut.setARank((float) 0.0);
        valOut.setType(HITSNode.TYPE_AUTH_COMPLETE);
      }
      while (itr.hasMoreTokens()) {
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
      String[] arr = t.toString().trim().split("\\s+");

      nid.set(Integer.parseInt(arr[0]));
      if (arr.length == 1) {
        node.setNodeId(Integer.parseInt(arr[0]));
        node.setAdjacencyList(new ArrayListOfIntsWritable());

      } else {
        node.setNodeId(Integer.parseInt(arr[0]));

        int[] neighbors = new int[arr.length - 1];
        for (int i = 1; i < arr.length; i++) {
          neighbors[i - 1] = Integer.parseInt(arr[i]);
        }

        node.setAdjacencyList(new ArrayListOfIntsWritable(neighbors));
      }

      context.getCounter("graph", "numNodes").increment(1);
      context.getCounter("graph", "numEdges").increment(arr.length - 1);
View Full Code Here
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
        OutputCollector<IntWritable, HITSNode> output, Reporter reporter)
        throws IOException {

      mOutput = output;

      ArrayListOfIntsWritable links = new ArrayListOfIntsWritable();
      String line = ((Text) value).toString();
      //System.out.println(line);
      StringTokenizer itr = new StringTokenizer(line);
      if (itr.hasMoreTokens()) {
        int curr = Integer.parseInt(itr.nextToken());
        if (!(stopList.contains(curr))) {
          links.add(curr);
        } else {
          return;
        }
        // add to HMap here
      }
      while (itr.hasMoreTokens()) {
        int curr = Integer.parseInt(itr.nextToken());
        //System.out.println("-->" + curr + " " + links.toString());
        if (!(stopList.contains(curr))) {
          if (adjLists.containsKey(curr)) {
            //FIXME?
            ArrayListOfIntsWritable list = new ArrayListOfIntsWritable(adjLists.get(curr));
            list.trimToSize();
            links.trimToSize();
            list.addUnique(links.getArray());
            adjLists.remove(curr);
            adjLists.put(curr, list);
          } else {
            links.trimToSize();
            adjLists.put(curr, links);
View Full Code Here
TOP

Related Classes of edu.umd.cloud9.io.array.ArrayListOfIntsWritable

  • bak.pcj.IntIterator
  • cc.mrlda.InformedPrior
  • edu.umd.cloud9.example.bfs.BfsNodeTest
  • edu.umd.cloud9.example.pagerank.PageRankNodeTest
  • edu.umd.cloud9.io.array.ArrayListOfIntsWritable
  • edu.umd.cloud9.io.fastutil.Int2FloatOpenHashMapWritableTest
  • edu.umd.cloud9.io.fastutil.Int2IntOpenHashMapWritableTest
  • edu.umd.cloud9.io.fastutil.String2FloatOpenHashMapWritableTest
  • edu.umd.cloud9.io.fastutil.String2IntOpenHashMapWritableTest
  • edu.umd.cloud9.io.map.HMapIDW
    • 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.