All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.bitplan.simplegraph.impl.SimpleNodeImpl Maven / Gradle / Ivy

Go to download

com.bitplan.simplegraph.core submodule of com.bitplan.simplegraph

There is a newer version: 0.0.5
Show newest version
/**
 * Copyright (c) 2018 BITPlan GmbH
 *
 * http://www.bitplan.com
 *
 * This file is part of the Opensource project at:
 * https://github.com/BITPlan/com.bitplan.simplegraph
 *
 * 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
 *
 *     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 com.bitplan.simplegraph.impl;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;

import org.apache.tinkerpop.gremlin.structure.T;
import org.apache.tinkerpop.gremlin.structure.Vertex;

import com.bitplan.simplegraph.core.Keys;
import com.bitplan.simplegraph.core.SimpleGraph;
import com.bitplan.simplegraph.core.SimpleNode;

/**
 * default implementation of a SimpleNode wraps a Tinkerpop/Gremlin Vertex
 * 
 * @author wf
 *
 */
public abstract class SimpleNodeImpl extends SimpleGraphImpl
    implements SimpleNode {

  private Vertex vertex;
  protected Keys keys;
  protected SimpleGraph simpleGraph;
  protected String kind;
  protected Map map = new HashMap();
  ArrayList keyValueList;

  /**
   * get my simple graph
   * @return
   */
  public SimpleGraph getSimpleGraph() {
    return simpleGraph;
  }

  /**
   * initialize me for the given graph
   * 
   * @param simpleGraph
   * @param kind
   */
  public SimpleNodeImpl(SimpleGraph simpleGraph, String kind, String... keys) {
    super(simpleGraph);
    this.keys = new KeysImpl(keys);
    this.simpleGraph = simpleGraph;
    this.kind = kind;
  }

  /**
   * get the Vertex
   */
  @Override
  public Vertex getVertex() {
    return vertex;
  }

  @Override
  public Vertex setVertex(Vertex vertex) {
    this.vertex = vertex;
    return vertex;
  }

  @Override
  public Map getMap() {
    return map;
  }

  @Override
  public void setMap(Map map) {
    this.map = map;
  }

  public Keys getKeys() {
    return keys;
  }

  @Override
  public Vertex setVertexFromMap() {
    return setVertexFromMap(initMap());
  }

  /**
   * set my vertex from the given map
   * 
   * @param map
   * @return
   */
  public Vertex setVertexFromMap(Map map) {
    keyValueList = new ArrayList();
    // first add a key value pair for my kind
    addKeyValue(keyValueList, T.label, this.kind);
    // now add the pointer to me
    // TODO - filter / ignore me when saving
    addKeyValue(keyValueList, getSelfLabel(), this);
    // add all key values from my map
    for (Entry entry : map.entrySet()) {
      if (entry.getValue() != null)
        addKeyValue(keyValueList, entry.getKey(), entry.getValue());
    }
    // create a vertex with the given data for later traversal
    vertex = this.graph.addVertex(keyValueList.toArray());
    return vertex;
  }

  /**
   * add a pair of values
   * 
   * @param keyValueList
   * @param name
   * @param value
   */
  private void addKeyValue(List keyValueList, Object name,
      Object value) {
    keyValueList.add(name);
    keyValueList.add(value);
  }

  /**
   * convert vertex property contents to a map
   * @param vertex
   * @param keys
   * @return a map
   */
  public static Map vertexToMap(Vertex vertex, String ... keys) {
    Map map=new HashMap();
    if (keys.length==0)
      keys=vertex.keys().toArray(new String[vertex.keys().size()]);
    for (String key:keys) {
      if (vertex.property(key).isPresent())
        map.put(key, vertex.property(key).value());
    }
    return map;
  }

}
    

    

    

            

    

            



    
    






    
© 2015 - 2024 Weber Informatics LLC | Privacy Policy