This repository has been archived by the owner on Oct 30, 2023. It is now read-only.
/
PartitionStore.java
116 lines (104 loc) · 3.38 KB
/
PartitionStore.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package org.apache.giraph.graph.partition;
import com.google.common.base.Function;
import com.google.common.collect.Iterables;
import org.apache.hadoop.io.Writable;
import org.apache.hadoop.io.WritableComparable;
/**
* Structure that stores partitions for a worker.
*
* @param <I> Vertex id
* @param <V> Vertex data
* @param <E> Edge data
* @param <M> Message data
*/
public abstract class PartitionStore<I extends WritableComparable,
V extends Writable, E extends Writable, M extends Writable> {
/**
* Add a new partition to the store or just the vertices from the partition
* to the old partition.
*
* @param partition Partition to add
*/
public abstract void addPartition(Partition<I, V, E, M> partition);
/**
* Get a partition.
*
* @param partitionId Partition id
* @return The requested partition
*/
public abstract Partition<I, V, E, M> getPartition(Integer partitionId);
/**
* Remove a partition and return it.
*
* @param partitionId Partition id
* @return The removed partition
*/
public abstract Partition<I, V, E, M> removePartition(Integer partitionId);
/**
* Just delete a partition
* (more efficient than {@link #removePartition(Integer partitionID)} if the
* partition is out of core).
*
* @param partitionId Partition id
*/
public abstract void deletePartition(Integer partitionId);
/**
* Whether a specific partition is present in the store.
*
* @param partitionId Partition id
* @return True iff the partition is present
*/
public abstract boolean hasPartition(Integer partitionId);
/**
* Return the ids of all the stored partitions as an Iterable.
*
* @return The partition ids
*/
public abstract Iterable<Integer> getPartitionIds();
/**
* Return the number of stored partitions.
*
* @return The number of partitions
*/
public abstract int getNumPartitions();
/**
* Whether the partition store is empty.
*
* @return True iff there are no partitions in the store
*/
public boolean isEmpty() {
return getNumPartitions() == 0;
}
/**
* Return all the stored partitions as an Iterable. Note that this may force
* out-of-core partitions to be loaded into memory if using out-of-core.
*
* @return The partition objects
*/
public Iterable<Partition<I, V, E, M>> getPartitions() {
return Iterables.transform(getPartitionIds(),
new Function<Integer, Partition<I, V, E, M>>() {
@Override
public Partition<I, V, E, M> apply(Integer partitionId) {
return getPartition(partitionId);
}
});
}
}