public static void toNodeProperties( final ProjectVersionRef ref, final Node node, final boolean connected ) { Logger logger = LoggerFactory.getLogger( Conversions.class ); logger.debug( "Adding {} (type: {}) to node: {}", ref, ref.getClass().getSimpleName(), node ); if ( !( ref instanceof NeoProjectVersionRef ) || ( (NeoProjectVersionRef) ref ).isDirty() ) { final String g = ref.getGroupId(); final String a = ref.getArtifactId(); final String v = ref.getVersionString(); if ( empty( g ) || empty( a ) || empty( v ) ) { throw new IllegalArgumentException( String.format( "GAV cannot contain nulls: %s:%s:%s", g, a, v ) ); } node.setProperty( ARTIFACT_ID, a ); node.setProperty( GROUP_ID, g ); logger.debug( "Setting property: {} with value: {} for node: {}", VERSION, v, node.getId() ); node.setProperty( VERSION, v ); node.setProperty( GAV, ref.toString() ); } node.setProperty( NODE_TYPE, NodeType.PROJECT.name() ); if ( ref.isVariableVersion() ) { node.setProperty( VARIABLE, true ); } markConnected( node, connected ); // // logger.debug( "groupId of {} is:\nNeoIdentityUtils: {}\nConversions: {}\nDirect access: {}", node, // NeoIdentityUtils.getStringProperty( node, GROUP_ID, null, null ), // getStringProperty( GROUP_ID, node ), node.hasProperty( GROUP_ID ) ? node.getProperty( GROUP_ID ) : null ); }
if ( target.isVariableVersion() || !target.getVersionSpec() .isSingle() )
private Node newProjectNode( final ProjectVersionRef ref ) { final Node node = graph.createNode(); toNodeProperties( ref, node, false ); final String gav = ref.asProjectVersionRef() .toString(); graph.index() .forNodes( BY_GAV_IDX ) .add( node, GAV, gav ); graph.index() .forNodes( BY_GA_IDX ) .add( node, GA, ref.asProjectRef() .toString() ); graph.index() .forNodes( MISSING_NODES_IDX ) .add( node, GAV, gav ); if ( ref.isVariableVersion() ) { // logger.info( "Adding {} to variable-nodes index.", ref ); graph.index() .forNodes( VARIABLE_NODES_IDX ) .add( node, GAV, gav ); } // logger.info( "Created project node: {} with id: {}", ref, node.getId() ); return node; }