Coverage Report - org.apache.giraph.utils.InMemoryVertexInputFormat
 
Classes in this File Line Coverage Branch Coverage Complexity
InMemoryVertexInputFormat
0%
0/10
0%
0/2
1.3
InMemoryVertexInputFormat$1
N/A
N/A
1.3
InMemoryVertexInputFormat$InMemoryVertexReader
0%
0/10
0%
0/2
1.3
 
 1  
 /*
 2  
  * Licensed to the Apache Software Foundation (ASF) under one
 3  
  * or more contributor license agreements.  See the NOTICE file
 4  
  * distributed with this work for additional information
 5  
  * regarding copyright ownership.  The ASF licenses this file
 6  
  * to you under the Apache License, Version 2.0 (the
 7  
  * "License"); you may not use this file except in compliance
 8  
  * with the License.  You may obtain a copy of the License at
 9  
  *
 10  
  *     http://www.apache.org/licenses/LICENSE-2.0
 11  
  *
 12  
  * Unless required by applicable law or agreed to in writing, software
 13  
  * distributed under the License is distributed on an "AS IS" BASIS,
 14  
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 15  
  * See the License for the specific language governing permissions and
 16  
  * limitations under the License.
 17  
  */
 18  
 
 19  
 package org.apache.giraph.utils;
 20  
 
 21  
 import org.apache.giraph.bsp.BspInputSplit;
 22  
 import org.apache.giraph.graph.Vertex;
 23  
 import org.apache.giraph.io.VertexInputFormat;
 24  
 import org.apache.giraph.io.VertexReader;
 25  
 import org.apache.hadoop.conf.Configuration;
 26  
 import org.apache.hadoop.io.Writable;
 27  
 import org.apache.hadoop.io.WritableComparable;
 28  
 import org.apache.hadoop.mapreduce.InputSplit;
 29  
 import org.apache.hadoop.mapreduce.JobContext;
 30  
 import org.apache.hadoop.mapreduce.TaskAttemptContext;
 31  
 
 32  
 import java.io.IOException;
 33  
 import java.util.ArrayList;
 34  
 import java.util.Iterator;
 35  
 import java.util.List;
 36  
 
 37  
 /**
 38  
  * An input format that reads the input graph in memory. Used for unit tests.
 39  
  *
 40  
  * @param <I> The Input
 41  
  * @param <V> The vertex type
 42  
  * @param <E> The edge type
 43  
  */
 44  0
 public class InMemoryVertexInputFormat<I extends WritableComparable,
 45  
     V extends Writable, E extends Writable>
 46  
     extends VertexInputFormat<I, V, E> {
 47  
   /** The graph */
 48  
   private static TestGraph GRAPH;
 49  
 
 50  
   public static void setGraph(TestGraph graph) {
 51  0
     InMemoryVertexInputFormat.GRAPH = graph;
 52  0
   }
 53  
 
 54  
   public static TestGraph getGraph() {
 55  0
     return GRAPH;
 56  
   }
 57  
 
 58  0
   @Override public void checkInputSpecs(Configuration conf) { }
 59  
 
 60  
   @Override
 61  
   public List<InputSplit> getSplits(JobContext context, int minSplitCountHint)
 62  
     throws IOException, InterruptedException {
 63  
     // This is meaningless, the VertexReader will generate all the test
 64  
     // data.
 65  0
     List<InputSplit> inputSplitList = new ArrayList<InputSplit>();
 66  0
     for (int i = 0; i < minSplitCountHint; ++i) {
 67  0
       inputSplitList.add(new BspInputSplit(i, minSplitCountHint));
 68  
     }
 69  0
     return inputSplitList;
 70  
   }
 71  
 
 72  
   @Override
 73  
   public VertexReader<I, V, E> createVertexReader(InputSplit inputSplit,
 74  
       TaskAttemptContext context) throws IOException {
 75  0
     return new InMemoryVertexReader();
 76  
   }
 77  
 
 78  
   /**
 79  
    * Simple in memory reader
 80  
    */
 81  0
   private class InMemoryVertexReader extends VertexReader<I, V, E> {
 82  
     /** The iterator */
 83  
     private Iterator<Vertex<I, V, E>> vertexIterator;
 84  
     /** Current vertex */
 85  
     private Vertex<I, V, E> currentVertex;
 86  
 
 87  
     @Override
 88  
     public void initialize(InputSplit inputSplit,
 89  
                            TaskAttemptContext context) {
 90  0
       vertexIterator = GRAPH.iterator();
 91  0
     }
 92  
 
 93  
     @Override
 94  
     public boolean nextVertex() {
 95  0
       if (vertexIterator.hasNext()) {
 96  0
         currentVertex = vertexIterator.next();
 97  0
         return true;
 98  
       }
 99  0
       return false;
 100  
     }
 101  
 
 102  
     @Override
 103  
     public Vertex<I, V, E> getCurrentVertex() {
 104  0
       return currentVertex;
 105  
     }
 106  
 
 107  
     @Override
 108  
     public void close() {
 109  0
     }
 110  
 
 111  
     @Override
 112  
     public float getProgress() {
 113  0
       return 0;
 114  
     }
 115  
   }
 116  
 }