Node firstBNode = nil; if (!list.isEmpty()) { last = objectToRDF(list.get(list.size() - 1)); firstBNode = new BlankNode(api.generateBlankNodeIdentifier()); final Node object = objectToRDF(list.get(i)); triples.add(new Quad(firstBNode, first, object, graphName)); final Node restBNode = new BlankNode(api.generateBlankNodeIdentifier()); final Node object = objectToRDF(item); if (object != null) { triples.add(new Quad(subject, predicate, object, graphName));
Node firstBNode = nil; if (!list.isEmpty()) { last = objectToRDF(list.get(list.size() - 1)); firstBNode = new BlankNode(api.generateBlankNodeIdentifier()); final Node object = objectToRDF(list.get(i)); triples.add(new Quad(firstBNode, first, object, graphName)); final Node restBNode = new BlankNode(api.generateBlankNodeIdentifier()); final Node object = objectToRDF(item); if (object != null) { triples.add(new Quad(subject, predicate, object, graphName));
Node firstBNode = nil; if (!list.isEmpty()) { last = objectToRDF(list.get(list.size() - 1)); firstBNode = new BlankNode(api.generateBlankNodeIdentifier()); final Node object = objectToRDF(list.get(i)); triples.add(new Quad(firstBNode, first, object, graphName)); final Node restBNode = new BlankNode(api.generateBlankNodeIdentifier()); final Node object = objectToRDF(item); if (object != null) { triples.add(new Quad(subject, predicate, object, graphName));