Coverage Report - org.apache.giraph.edge.primitives.LongEdgeStore
 
Classes in this File Line Coverage Branch Coverage Complexity
LongEdgeStore
0%
0/34
0%
0/8
1.444
 
 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.edge.primitives;
 20  
 
 21  
 import org.apache.giraph.bsp.CentralizedServiceWorker;
 22  
 import org.apache.giraph.conf.ImmutableClassesGiraphConfiguration;
 23  
 import org.apache.giraph.edge.AbstractEdgeStore;
 24  
 import org.apache.giraph.edge.OutEdges;
 25  
 import org.apache.giraph.utils.VertexIdEdgeIterator;
 26  
 import org.apache.hadoop.io.LongWritable;
 27  
 import org.apache.hadoop.io.Writable;
 28  
 import org.apache.hadoop.util.Progressable;
 29  
 
 30  
 import it.unimi.dsi.fastutil.longs.Long2ObjectMap;
 31  
 import it.unimi.dsi.fastutil.longs.Long2ObjectMaps;
 32  
 import it.unimi.dsi.fastutil.longs.Long2ObjectOpenHashMap;
 33  
 
 34  
 import java.io.DataInput;
 35  
 import java.io.DataOutput;
 36  
 import java.io.IOException;
 37  
 import java.util.Iterator;
 38  
 import java.util.Map;
 39  
 
 40  
 /**
 41  
  * Special edge store to be used when ids are LongWritable.
 42  
  * Uses fastutil primitive maps in order to decrease number of objects and
 43  
  * get better performance.
 44  
  *
 45  
  * @param <V> Vertex value
 46  
  * @param <E> Edge value
 47  
  */
 48  0
 public class LongEdgeStore<V extends Writable, E extends Writable>
 49  
   extends AbstractEdgeStore<LongWritable, V, E, Long,
 50  
   Long2ObjectMap.Entry<OutEdges<LongWritable, E>>> {
 51  
 
 52  
   /**
 53  
    * Constructor.
 54  
    *
 55  
    * @param service Service worker
 56  
    * @param configuration Configuration
 57  
    * @param progressable Progressable
 58  
    */
 59  
   public LongEdgeStore(
 60  
     CentralizedServiceWorker<LongWritable, V, E> service,
 61  
     ImmutableClassesGiraphConfiguration<LongWritable, V, E> configuration,
 62  
     Progressable progressable) {
 63  0
     super(service, configuration, progressable);
 64  0
   }
 65  
 
 66  
   @Override
 67  
   protected LongWritable getVertexId(
 68  
     Long2ObjectMap.Entry<OutEdges<LongWritable, E>> entry,
 69  
     LongWritable representativeVertexId) {
 70  0
     representativeVertexId.set(entry.getLongKey());
 71  0
     return representativeVertexId;
 72  
   }
 73  
 
 74  
   @Override
 75  
   protected LongWritable createVertexId(
 76  
     Long2ObjectMap.Entry<OutEdges<LongWritable, E>> entry) {
 77  0
     return new LongWritable(entry.getLongKey());
 78  
   }
 79  
 
 80  
 
 81  
   @Override
 82  
   protected OutEdges<LongWritable, E> getPartitionEdges(
 83  
     Long2ObjectMap.Entry<OutEdges<LongWritable, E>> entry) {
 84  0
     return entry.getValue();
 85  
   }
 86  
 
 87  
   @Override
 88  
   protected void writeVertexKey(Long key, DataOutput output)
 89  
       throws IOException {
 90  0
     output.writeLong(key);
 91  0
   }
 92  
 
 93  
   @Override
 94  
   protected Long readVertexKey(DataInput input) throws IOException {
 95  0
     return input.readLong();
 96  
   }
 97  
 
 98  
   @Override
 99  
   protected Iterator<Long2ObjectMap.Entry<OutEdges<LongWritable, E>>>
 100  
   getPartitionEdgesIterator(
 101  
       Map<Long, OutEdges<LongWritable, E>> partitionEdges) {
 102  0
     return ((Long2ObjectMap<OutEdges<LongWritable, E>>) partitionEdges)
 103  0
         .long2ObjectEntrySet()
 104  0
         .iterator();
 105  
   }
 106  
 
 107  
   @Override
 108  
   protected Long2ObjectMap<OutEdges<LongWritable, E>> getPartitionEdges(
 109  
     int partitionId) {
 110  0
     Long2ObjectMap<OutEdges<LongWritable, E>> partitionEdges =
 111  
       (Long2ObjectMap<OutEdges<LongWritable, E>>)
 112  0
         transientEdges.get(partitionId);
 113  0
     if (partitionEdges == null) {
 114  0
       Long2ObjectMap<OutEdges<LongWritable, E>> newPartitionEdges =
 115  0
           Long2ObjectMaps.synchronize(
 116  
               new Long2ObjectOpenHashMap<OutEdges<LongWritable, E>>());
 117  0
       partitionEdges = (Long2ObjectMap<OutEdges<LongWritable, E>>)
 118  0
           transientEdges.putIfAbsent(partitionId,
 119  
           newPartitionEdges);
 120  0
       if (partitionEdges == null) {
 121  0
         partitionEdges = newPartitionEdges;
 122  
       }
 123  
     }
 124  0
     return partitionEdges;
 125  
   }
 126  
 
 127  
   @Override
 128  
   protected OutEdges<LongWritable, E> getVertexOutEdges(
 129  
     VertexIdEdgeIterator<LongWritable, E> vertexIdEdgeIterator,
 130  
     Map<Long, OutEdges<LongWritable, E>> partitionEdgesIn) {
 131  0
     Long2ObjectMap<OutEdges<LongWritable, E>> partitionEdges =
 132  
         (Long2ObjectMap<OutEdges<LongWritable, E>>) partitionEdgesIn;
 133  0
     LongWritable vertexId = vertexIdEdgeIterator.getCurrentVertexId();
 134  0
     OutEdges<LongWritable, E> outEdges = partitionEdges.get(vertexId.get());
 135  0
     if (outEdges == null) {
 136  0
       synchronized (partitionEdges) {
 137  0
         outEdges = partitionEdges.get(vertexId.get());
 138  0
         if (outEdges == null) {
 139  0
           outEdges = configuration.createAndInitializeInputOutEdges();
 140  0
           partitionEdges.put(vertexId.get(), outEdges);
 141  
         }
 142  0
       }
 143  
     }
 144  0
     return outEdges;
 145  
   }
 146  
 }