Package com.hp.hpl.jena.graph

Examples of com.hp.hpl.jena.graph.Triple

94
95
96
97
98
99
100
101
    public boolean equivalent(OpBGP opBGP)
    {
        BasicPattern bgp = opBGP.getPattern() ;
        if ( bgp.size() != 1 ) return false ;
        Triple t = bgp.get(0) ;
        return triple.equals(t) ; 
    }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
        return new Applyer()
            {
            @Override
            public void applyToTriples( Domain d, Matcher m, StageElement next )
                {
                Triple t = new Triple( pt.S.finder( d ), pt.P.finder( d ), pt.O.finder( d ) );
                if (objects.containsBySameValueAs( t )) next.run( d );
                }   
            };
        }
View Full Code Here
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
        if ( triples == null || triples.size() == 0 )
            return ;
       
        // Do the first triple.
        Iterator<Triple> iter = triples.iterator() ;
        Triple t1 = iter.next() ;

//        int indent = TRIPLES_SUBJECT_COLUMN+TRIPLES_COLUMN_GAP ;
//        // Long subject => same line.  Works for single triple as well.
//        int s1_len = printSubject(t1.getSubject()) ;
//        //int x = out.getCol() ;

        int indent = subjectWidth + TRIPLES_COLUMN_GAP ;
        int s1_len = printSubject(t1.getSubject()) ;

        if ( s1_len > TRIPLES_SUBJECT_LONG )
        {
            // Too long - start a new line.
            out.incIndent(indent) ;
            out.println() ;
        }
        else
        {
            printGap() ;
            out.incIndent(indent) ;
        }

        // Remained of first triple
        printProperty(t1.getPredicate()) ;
        printGap() ;
        printObject(t1.getObject()) ;
       
        // Do the rest
       
        for (  ; iter.hasNext() ; )
        {
            Triple t = iter.next() ;
            out.println(" ;") ;
            printProperty(t.getPredicate()) ;
            printGap() ;
            printObject(t.getObject()) ;
            continue ;
            // print property list
        }

        // Finish off the block.
View Full Code Here
189
190
191
192
193
194
195
196
197
198
        for ( int i = 1 ; i < list.size() ; i++ )
        {
            Item item = list.get(i) ;
            if ( ! item.isList() )
                BuilderLib.broken(item, "Not a triple structure") ;
            Triple t = BuilderGraph.buildTriple(item.getList()) ;
            triples.add(t) ;
        }
        return triples ;
    }
View Full Code Here
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
      while ( subjects.hasNext() ) {
        Node subject = subjects.next() ;
        ExtendedIterator<Triple> triples = graph.find(subject, Node.ANY, Node.ANY) ;
        try {
          while ( triples.hasNext() ) {
            Triple triple = triples.next() ;
            Node p = triple.getPredicate() ;
            if ( predicates.containsKey(p) ) {
              predicates.get(p).add(triple.getObject()) ;
            } else {
              Set<Node> objects = new HashSet<Node>() ;
              objects.add(triple.getObject()) ;
              predicates.put(p, objects) ;
            }
          }       
        } finally {
          if ( triples != null ) triples.close() ;
View Full Code Here
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
        Node o1a=Node.createLiteral("55",XSDDatatype.XSDint);
        Node o1b=Node.createLiteral("55",XSDDatatype.XSDint);

        assertTrue(o1a!=o1b);

        Triple t1=new Triple(s1a,p1a,o1a);
        Triple t2=new Triple(s1b,p1b,o1b);
        assertTrue(t1!=t2);
        assertEquals(t1,t2);

        Economizer<Triple> e=new TripleEconomizer();

        Triple t3=e.economize(t1);
        Triple t4=e.economize(t2);

        assertTrue(t3.getSubject()==t4.getSubject());
        assertTrue(t3.getObject()==t4.getObject());
        assertTrue(t3.getPredicate()==t4.getPredicate());

        assertTrue(s1a.equals(t3.getSubject()));
        assertTrue(p1a.equals(t3.getPredicate()));
        assertTrue(o1a.equals(t3.getObject()));
View Full Code Here
24
25
26
27
28
29
30
        }
    };
   
    @Test
    public void testABC() {
        assertEquals(0,c.compare(base, new Triple(A,B,C)));
    }
View Full Code Here
29
30
31
32
33
34
35
        assertEquals(0,c.compare(base, new Triple(A,B,C)));
    }
   
    @Test
    public void testABA() {
        assertTrue(c.compare(base, new Triple(A,B,A))>0);
    }
View Full Code Here
34
35
36
37
38
39
40
        assertTrue(c.compare(base, new Triple(A,B,A))>0);
    }
   
    @Test
    public void testABB() {
        assertTrue(c.compare(base, new Triple(A,B,B))>0);
    }
View Full Code Here
39
40
41
42
43
44
45
        assertTrue(c.compare(base, new Triple(A,B,B))>0);
    }
   
    @Test
    public void testABBreversed() {
        assertTrue(c.compare(new Triple(A,B,B),base)<0);
    }
View Full Code Here
TOP

Related Classes of com.hp.hpl.jena.graph.Triple

  • arq.examples.AlgebraExec
  • arq.examples.ExProg1
  • arq.examples.ExProg2
  • arq.examples.propertyfunction.labelSearch
  • arq.examples.propertyfunction.localname
  • com.clarkparsia.pellet.sparqldl.parser.ARQParser
  • com.github.jsonldjava.jena.JenaRDFParser
  • com.github.jsonldjava.jena.JsonLDReader
  • com.hp.gloze.extension.Reify
  • com.hp.hpl.jena.graph.test.AbstractTestGraph
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.