content: /*
   * Tencent is pleased to support the open source community by making Angel available.
   *
   * Copyright (C) 2017-2018 THL A29 Limited, a Tencent company. All rights reserved.
   *
   * Licensed 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
   *
   * https://opensource.org/licenses/Apache-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 com.tencent.angel.graph.client.node2vec.updatefuncs.pushneighbor;
  
  import com.tencent.angel.PartitionKey;
  import com.tencent.angel.ml.matrix.psf.update.base.PartitionUpdateParam;
  import com.tencent.angel.ml.matrix.psf.update.base.UpdateParam;
  import com.tencent.angel.psagent.PSAgentContext;
  import it.unimi.dsi.fastutil.longs.Long2ObjectOpenHashMap;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.List;
  
  
  public class PushNeighborParam extends UpdateParam {
  
    private long[] keyIds;
    private Long2ObjectOpenHashMap<long[]> nodeIdToNeighborIndices;
  
    public PushNeighborParam(int matrixId, boolean updateClock,
        Long2ObjectOpenHashMap<long[]> adjTable) {
      super(matrixId, updateClock);
      this.nodeIdToNeighborIndices = adjTable;
      this.keyIds = adjTable.keySet().toLongArray();
      Arrays.sort(keyIds);
    }
  
    public PushNeighborParam(int matrixId, Long2ObjectOpenHashMap<long[]> adjTable) {
      this(matrixId, false, adjTable);
    }
  
  
    @Override
    public List<PartitionUpdateParam> split() {
      List<PartitionKey> parts = PSAgentContext.get().getMatrixMetaManager().getPartitions(matrixId);
  
      List<PartitionUpdateParam> partParams = new ArrayList<>(parts.size());
  
      int count = 0;
      int nodeIndex = 0;
      for (PartitionKey part : parts) {
        int start = nodeIndex;  // include start
        while (nodeIndex < keyIds.length && keyIds[nodeIndex] < part.getEndCol()) {
          nodeIndex++;
        }
        int end = nodeIndex;  // exclude end
        int sizePart = end - start;
        count += sizePart;
        if (sizePart > 0) {
          partParams.add(
              new PushNeighborPartitionParam(matrixId, part, nodeIdToNeighborIndices, keyIds, start,
                  end));
        }
      }
  
      assert (count == nodeIdToNeighborIndices.size());
      return partParams;
    }
  }
  