/*
 * 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.block_app.library.prepare_graph.vertex;

import it.unimi.dsi.fastutil.longs.LongOpenHashSet;

import java.io.DataInput;
import java.io.DataOutput;
import java.io.IOException;

/**
 * Implementation of WeaklyConnectedComponentVertexValue
 */
public class WeaklyConnectedComponentVertexValueImpl
    implements WeaklyConnectedComponentVertexValue {
  private long component;
  private LongOpenHashSet edgeIds = null;

  @Override
  public long getComponent() {
    return component;
  }

  @Override
  public void setComponent(long component) {
    this.component = component;
  }

  @Override
  public void setEdgeIds(LongOpenHashSet edgeIds) {
    this.edgeIds = edgeIds;
  }

  @Override
  public LongOpenHashSet takeEdgeIds() {
    LongOpenHashSet res = edgeIds;
    edgeIds = null;
    return res;
  }

  @Override
  public void write(DataOutput out) throws IOException {
    out.writeLong(component);
    if (edgeIds == null) {
      out.writeBoolean(false);
    } else {
      out.writeBoolean(true);
      out.writeInt(edgeIds.size());
      for (long longId: edgeIds) {
        out.writeLong(longId);
      }
    }
  }

  @Override
  public void readFields(DataInput in) throws IOException {
    component = in.readLong();
    boolean isEdgeIds = in.readBoolean();
    if (isEdgeIds) {
      int friendsSize = in.readInt();
      edgeIds = new LongOpenHashSet(friendsSize);
      for (int i = 0; i < friendsSize; i++) {
        edgeIds.add(in.readLong());
      }
    } else {
      edgeIds = null;
    }
  }
}
