Example usage for org.apache.hadoop.io IntWritable get

List of usage examples for org.apache.hadoop.io IntWritable get

Introduction

In this page you can find the example usage for org.apache.hadoop.io IntWritable get.

Prototype

public int get() 

Source Link

Document

Return the value of this IntWritable.

Usage

From source file:org.apache.giraph.examples.SimpleMsgVertex.java

License:Apache License

@Override
public void compute(Iterable<IntWritable> messages) {
    if (getId().equals(new LongWritable(2))) {
        sendMessage(new LongWritable(1), new IntWritable(101));
        sendMessage(new LongWritable(1), new IntWritable(102));
        sendMessage(new LongWritable(1), new IntWritable(103));
    }/*from   w  w  w  .j a v a 2  s. co m*/
    if (!getId().equals(new LongWritable(1))) {
        voteToHalt();
    } else {
        /* Check the messages */
        int sum = 0;
        for (IntWritable message : messages) {
            sum += message.get();
        }
        LOG.info("compute: Received a sum of " + sum + " (will stop on 306)");

        if (sum == 306) {
            voteToHalt();
        }
    }
    if (getSuperstep() > 3) {
        System.err.println("compute: Vertex 1 failed to receive " + "messages in time");
        voteToHalt();
    }
}

From source file:org.apache.giraph.examples.SimpleSumCombiner.java

License:Apache License

@Override
public Iterable<IntWritable> combine(LongWritable vertexIndex, Iterable<IntWritable> messages)
        throws IOException {
    int sum = 0;/*from ww w. j  a  v  a2 s  . c o m*/
    for (IntWritable msg : messages) {
        sum += msg.get();
    }
    List<IntWritable> value = new ArrayList<IntWritable>();
    value.add(new IntWritable(sum));

    return value;
}

From source file:org.apache.giraph.graph.IntIntNullIntVertex.java

License:Apache License

@Override
public void initialize(IntWritable vertexId, IntWritable vertexValue, Map<IntWritable, NullWritable> edges,
        Iterable<IntWritable> messages) {
    id = vertexId.get();
    value = vertexValue.get();//  ww  w.jav  a  2s  .  com
    this.neighbors = new int[(edges != null) ? edges.size() : 0];
    int n = 0;
    if (edges != null) {
        for (IntWritable neighbor : edges.keySet()) {
            this.neighbors[n++] = neighbor.get();
        }
    }
    this.messages = new int[(messages != null) ? Iterables.size(messages) : 0];
    if (messages != null) {
        n = 0;
        for (IntWritable message : messages) {
            this.messages[n++] = message.get();
        }
    }
}

From source file:org.apache.giraph.graph.IntIntNullIntVertex.java

License:Apache License

@Override
public void setVertexValue(IntWritable vertexValue) {
    value = vertexValue.get();
}

From source file:org.apache.giraph.graph.IntIntNullIntVertex.java

License:Apache License

@Override
public boolean hasEdge(IntWritable targetVertexId) {
    for (int neighbor : neighbors) {
        if (neighbor == targetVertexId.get()) {
            return true;
        }/*from w  ww.j  a  v  a2 s  .  c  om*/
    }
    return false;
}

From source file:org.apache.giraph.graph.IntIntNullIntVertex.java

License:Apache License

@Override
public void putMessages(Iterable<IntWritable> newMessages) {
    messages = new int[Iterables.size(newMessages)];
    int n = 0;//from  w  ww. ja  v a 2 s. co m
    for (IntWritable message : newMessages) {
        messages[n++] = message.get();
    }
}

From source file:org.apache.giraph.graph.TestEdgeListVertex.java

License:Apache License

@Test
public void testEdges() {
    Map<IntWritable, DoubleWritable> edgeMap = Maps.newHashMap();
    for (int i = 1000; i > 0; --i) {
        edgeMap.put(new IntWritable(i), new DoubleWritable(i * 2.0));
    }//from ww  w .j  a va2  s. c  o m
    vertex.initialize(null, null, edgeMap, null);
    assertEquals(vertex.getNumOutEdges(), 1000);
    int expectedIndex = 1;
    for (IntWritable index : vertex) {
        assertEquals(index.get(), expectedIndex);
        assertEquals(vertex.getEdgeValue(index).get(), expectedIndex * 2.0d);
        ++expectedIndex;
    }
    assertEquals(vertex.removeEdge(new IntWritable(500)), new DoubleWritable(1000));
    assertEquals(vertex.getNumOutEdges(), 999);
}

From source file:org.apache.giraph.graph.TestEdgeListVertex.java

License:Apache License

@Test
public void testAddRemoveEdges() {
    Map<IntWritable, DoubleWritable> edgeMap = Maps.newHashMap();
    vertex.initialize(null, null, edgeMap, null);
    assertEquals(vertex.getNumOutEdges(), 0);
    assertTrue(vertex.addEdge(new IntWritable(2), new DoubleWritable(2.0)));
    assertEquals(vertex.getNumOutEdges(), 1);
    assertEquals(vertex.getEdgeValue(new IntWritable(2)), new DoubleWritable(2.0));
    assertTrue(vertex.addEdge(new IntWritable(4), new DoubleWritable(4.0)));
    assertTrue(vertex.addEdge(new IntWritable(3), new DoubleWritable(3.0)));
    assertTrue(vertex.addEdge(new IntWritable(1), new DoubleWritable(1.0)));
    assertEquals(vertex.getNumOutEdges(), 4);
    assertNull(vertex.getEdgeValue(new IntWritable(5)));
    assertNull(vertex.getEdgeValue(new IntWritable(0)));
    int i = 1;/* ww w .  jav  a  2 s .c  om*/
    for (IntWritable edgeDestId : vertex) {
        assertEquals(i, edgeDestId.get());
        assertEquals(i * 1.0d, vertex.getEdgeValue(edgeDestId).get());
        ++i;
    }
    assertNotNull(vertex.removeEdge(new IntWritable(1)));
    assertEquals(vertex.getNumOutEdges(), 3);
    assertNotNull(vertex.removeEdge(new IntWritable(3)));
    assertEquals(vertex.getNumOutEdges(), 2);
    assertNotNull(vertex.removeEdge(new IntWritable(2)));
    assertEquals(vertex.getNumOutEdges(), 1);
    assertNotNull(vertex.removeEdge(new IntWritable(4)));
    assertEquals(vertex.getNumOutEdges(), 0);
}

From source file:org.apache.giraph.partition.SimpleIntRangePartitionerFactory.java

License:Apache License

/**
 * Calculates in which partition current vertex belongs to,
 * from interval [0, partitionCount)./*w ww .j a va  2  s .  co  m*/
 *
 * @param id Vertex id
 * @param partitionCount Number of partitions
 * @return partition
 */
protected int getPartition(IntWritable id, int partitionCount) {
    return getPartitionInRange(id.get(), keySpaceSize, partitionCount);
}

From source file:org.apache.giraph.types.IntWritableToIntUnwrapper.java

License:Apache License

@Override
public Integer unwrap(IntWritable writableValue) {
    return writableValue.get();
}