1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
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
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
/*!
A simple model for constructing SKOS thesauri. This is not a complete API in
that it's extensibility with OWL is limited.

Details TBD

# Example

TBD

*/

use crate::ns;
use rdftk_core::{Literal, ObjectNode, Statement, SubjectNode};
use rdftk_graph::{Graph, PrefixMappings};
use rdftk_iri::IRI;
use rdftk_memgraph::{Mappings, MemGraph};
use rdftk_names::{dc, owl, rdf, xsd};
use std::collections::{HashMap, HashSet};
use std::rc::Rc;

// ------------------------------------------------------------------------------------------------
// Public Types
// ------------------------------------------------------------------------------------------------

#[derive(Clone, Debug)]
pub struct Scheme {
    uri: IRI,
    concepts: HashSet<Concept>,
    top_concepts: HashSet<IRI>,
    collections: HashSet<Collection>,
    properties: Vec<LiteralProperty>,
}

#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub struct Concept {
    uri: IRI,
    relations: Vec<Relation>,
    properties: Vec<LiteralProperty>,
}

#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub struct Collection {
    uri: IRI,
    ordered: bool,
    members: Vec<Relation>,
    properties: Vec<LiteralProperty>,
}

#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub struct LiteralProperty {
    predicate: IRI,
    value: Literal,
}

#[derive(Clone, Debug, PartialEq, Eq, Hash)]
pub struct Relation {
    predicate: IRI,
    other: IRI,
}

pub trait Named {
    fn new(uri: IRI) -> Self;

    fn new_with_label(uri: IRI, text: &str, language: Option<&str>) -> Self;

    fn uri(&self) -> &IRI;
}

pub trait Propertied {
    fn add_property(&mut self, property: LiteralProperty) {
        self.properties_mut().push(property);
    }
    fn has_property(&self, predicate: &IRI) -> bool {
        self.properties()
            .iter()
            .any(|property| property.predicate() == predicate)
    }
    fn has_properties(&self) -> bool {
        !self.properties().is_empty()
    }
    fn properties(&self) -> Vec<&LiteralProperty>;
    fn properties_mut(&mut self) -> &mut Vec<LiteralProperty>;
}

pub trait Labeled: Propertied {
    fn preferred_label(&self, for_language: &str) -> Option<String> {
        let preferred: HashMap<&Option<String>, &String> = self
            .properties()
            .iter()
            .filter(|property| property.predicate() == &ns::pref_label())
            .map(|label| (label.value().language(), label.value().lexical_form()))
            .collect();
        let language = Some(for_language.to_string());
        if preferred.contains_key(&language) {
            preferred.get(&language).cloned().cloned()
        } else if preferred.contains_key(&None) {
            preferred.get(&None).cloned().cloned()
        } else {
            let first_language = <&std::option::Option<std::string::String>>::clone(
                preferred.keys().next().unwrap(),
            );
            preferred.get(first_language).cloned().cloned()
        }
    }
    fn has_labels(&self) -> bool {
        self.properties().iter().any(|property| {
            property.predicate == ns::pref_label()
                || property.predicate == ns::alt_label()
                || property.predicate == ns::hidden_label()
        })
    }
    fn labels(&self) -> Vec<&LiteralProperty> {
        self.properties()
            .into_iter()
            .filter(|property| {
                property.predicate == ns::pref_label()
                    || property.predicate == ns::alt_label()
                    || property.predicate == ns::hidden_label()
            })
            .collect()
    }
    fn add_preferred_label(&mut self, text: &str) {
        self.properties_mut()
            .push(LiteralProperty::preferred_label(text))
    }
    fn add_preferred_label_with(&mut self, text: &str, language: &str) {
        self.properties_mut()
            .push(LiteralProperty::preferred_label_with(text, language))
    }
    fn add_alternative_label(&mut self, text: &str) {
        self.properties_mut()
            .push(LiteralProperty::alternative_label(text))
    }
    fn add_alternative_label_with(&mut self, text: &str, language: &str) {
        self.properties_mut()
            .push(LiteralProperty::alternative_label_with(text, language))
    }
    fn add_hidden_label(&mut self, text: &str) {
        self.properties_mut()
            .push(LiteralProperty::hidden_label(text))
    }
    fn add_hidden_label_with(&mut self, text: &str, language: &str) {
        self.properties_mut()
            .push(LiteralProperty::hidden_label_with(text, language))
    }
}

pub trait ToStatements {
    fn to_statements(&self) -> Vec<Statement>;
}

pub trait ToStatement {
    fn to_statement(&self, subject: &SubjectNode) -> Statement;
}

// ------------------------------------------------------------------------------------------------
// Private Types
// ------------------------------------------------------------------------------------------------

// ------------------------------------------------------------------------------------------------
// Public Functions
// ------------------------------------------------------------------------------------------------

pub fn to_rdf_graph(scheme: &Scheme, default_namespace: Option<IRI>) -> MemGraph {
    let mut graph = MemGraph::default();

    let mut mappings = standard_mappings();
    if let Some(default_namespace) = default_namespace {
        mappings.insert_default(default_namespace.clone());
    }
    graph.mappings(Rc::new(mappings));

    for statement in scheme.to_statements() {
        graph.insert(statement);
    }

    graph
}

pub fn standard_mappings() -> Mappings {
    let mut mappings = Mappings::default();
    mappings.insert(ns::PREFIX, ns::NAMESPACE.parse().unwrap());
    mappings.insert(ns::iso::PREFIX, ns::iso::NAMESPACE.parse().unwrap());
    mappings.insert(dc::terms::PREFIX, dc::terms::NAMESPACE.parse().unwrap());
    mappings.insert(rdf::PREFIX, rdf::NAMESPACE.parse().unwrap());
    mappings.insert(owl::PREFIX, owl::NAMESPACE.parse().unwrap());
    mappings.insert(xsd::PREFIX, xsd::NAMESPACE.parse().unwrap());
    mappings
}

// ------------------------------------------------------------------------------------------------
// Implementations
// ------------------------------------------------------------------------------------------------

impl Named for Scheme {
    fn new(uri: IRI) -> Self {
        Self {
            uri,
            concepts: Default::default(),
            top_concepts: Default::default(),
            collections: Default::default(),
            properties: Default::default(),
        }
    }

    fn new_with_label(uri: IRI, text: &str, language: Option<&str>) -> Self {
        let mut scheme = Self::new(uri);
        scheme.properties.push(match language {
            None => LiteralProperty::preferred_label(text),
            Some(language) => LiteralProperty::preferred_label_with(text, language),
        });
        scheme
    }

    fn uri(&self) -> &IRI {
        &self.uri
    }
}

impl Propertied for Scheme {
    fn properties(&self) -> Vec<&LiteralProperty> {
        self.properties.iter().collect()
    }

    fn properties_mut(&mut self) -> &mut Vec<LiteralProperty> {
        &mut self.properties
    }
}

impl Labeled for Scheme {}

impl ToStatements for Scheme {
    fn to_statements(&self) -> Vec<Statement> {
        let mut statements: Vec<Statement> = Default::default();
        let subject = SubjectNode::named(self.uri().clone());
        statements.push(Statement::new(
            subject.clone(),
            rdf::a_type(),
            ns::concept_scheme().into(),
        ));
        for member in self.concepts() {
            statements.extend(member.to_statements().drain(..));
            if self.top_concepts.contains(member.uri()) {
                statements.push(Statement::new(
                    SubjectNode::named(member.uri().clone()),
                    ns::top_concept_of(),
                    subject.clone().into(),
                ));
            }
            statements.push(Statement::new(
                SubjectNode::named(member.uri().clone()),
                ns::in_scheme(),
                ObjectNode::named(self.uri().clone()),
            ));
        }
        for member in &self.top_concepts {
            statements.push(Statement::new(
                subject.clone(),
                ns::has_top_concept(),
                ObjectNode::named(member.clone()),
            ));
        }
        for member in self.collections() {
            statements.extend(member.to_statements().drain(..));
            statements.push(Statement::new(
                SubjectNode::named(member.uri().clone()),
                ns::in_scheme(),
                ObjectNode::named(self.uri().clone()),
            ));
        }
        for property in self.properties() {
            statements.push(property.to_statement(&subject));
        }
        statements
    }
}

impl Scheme {
    pub fn add_concept(&mut self, concept: Concept) {
        self.concepts.insert(concept);
    }
    pub fn add_top_concept(&mut self, concept: Concept) {
        let uri = concept.uri().clone();
        self.concepts.insert(concept);
        self.top_concepts.insert(uri);
    }
    pub fn is_top_collection(&self, uri: &IRI) -> bool {
        self.top_concepts.contains(uri)
    }
    pub fn has_concepts(&self) -> bool {
        !self.concepts.is_empty()
    }
    pub fn has_concept(&self, uri: &IRI) -> bool {
        self.concepts().any(|concept| concept.uri() == uri)
    }
    pub fn concepts(&self) -> impl Iterator<Item = &Concept> {
        self.concepts.iter()
    }
    pub fn concept(&self, uri: &IRI) -> Option<&Concept> {
        self.concepts().find(|concept| concept.uri() == uri)
    }

    pub fn add_collection(&mut self, collection: Collection) {
        self.collections.insert(collection);
    }
    pub fn has_collections(&self) -> bool {
        !self.collections.is_empty()
    }
    pub fn has_collection(&self, uri: &IRI) -> bool {
        self.collections().any(|collection| collection.uri() == uri)
    }
    pub fn collections(&self) -> impl Iterator<Item = &Collection> {
        self.collections.iter()
    }
    pub fn collection(&self, uri: &IRI) -> Option<&Collection> {
        self.collections()
            .find(|collection| collection.uri() == uri)
    }
}

// ------------------------------------------------------------------------------------------------

impl Named for Concept {
    fn new(uri: IRI) -> Self {
        Self {
            uri,
            relations: Default::default(),
            properties: Default::default(),
        }
    }

    fn new_with_label(uri: IRI, text: &str, language: Option<&str>) -> Self {
        let mut concept = Self::new(uri);
        concept.properties.push(match language {
            None => LiteralProperty::preferred_label(text),
            Some(language) => LiteralProperty::preferred_label_with(text, language),
        });
        concept
    }

    fn uri(&self) -> &IRI {
        &self.uri
    }
}

impl Propertied for Concept {
    fn properties(&self) -> Vec<&LiteralProperty> {
        self.properties.iter().collect()
    }

    fn properties_mut(&mut self) -> &mut Vec<LiteralProperty> {
        &mut self.properties
    }
}

impl Labeled for Concept {}

impl ToStatements for Concept {
    fn to_statements(&self) -> Vec<Statement> {
        let mut statements: Vec<Statement> = Default::default();
        let subject = SubjectNode::named(self.uri().clone());
        statements.push(Statement::new(
            subject.clone(),
            rdf::a_type(),
            ns::concept().into(),
        ));
        for relation in self.relations() {
            statements.push(relation.to_statement(&subject));
        }
        for property in self.properties() {
            statements.push(property.to_statement(&subject));
        }
        statements
    }
}

impl Concept {
    pub fn broader(&mut self, uri: IRI) -> Self {
        let mut new_concept = Self::new(uri);
        new_concept.add_relation(Relation::narrower(self.uri().clone()));
        self.add_relation(Relation::broader(new_concept.uri().clone()));
        new_concept
    }

    pub fn narrower(&mut self, uri: IRI) -> Self {
        let mut new_concept = Self::new(uri);
        new_concept.add_relation(Relation::broader(self.uri().clone()));
        self.add_relation(Relation::narrower(new_concept.uri().clone()));
        new_concept
    }

    pub fn add_relation(&mut self, relation: Relation) {
        self.relations.push(relation);
    }
    pub fn has_relation(&self, predicate: &IRI) -> bool {
        self.relations()
            .any(|relation| relation.predicate() == predicate)
    }
    pub fn has_relations(&self) -> bool {
        !self.relations.is_empty()
    }
    pub fn relations(&self) -> impl Iterator<Item = &Relation> {
        self.relations.iter()
    }
}

// ------------------------------------------------------------------------------------------------

impl Named for Collection {
    fn new(uri: IRI) -> Self {
        Self {
            uri,
            ordered: false,
            members: Default::default(),
            properties: Default::default(),
        }
    }

    fn new_with_label(uri: IRI, text: &str, language: Option<&str>) -> Self {
        let mut collection = Self {
            uri,
            ordered: false,
            members: Default::default(),
            properties: Default::default(),
        };
        collection.add_property(match language {
            None => LiteralProperty::preferred_label(text),
            Some(language) => LiteralProperty::preferred_label_with(text, language),
        });
        collection
    }

    fn uri(&self) -> &IRI {
        &self.uri
    }
}

impl Propertied for Collection {
    fn properties(&self) -> Vec<&LiteralProperty> {
        self.properties.iter().collect()
    }

    fn properties_mut(&mut self) -> &mut Vec<LiteralProperty> {
        &mut self.properties
    }
}

impl Labeled for Collection {}

impl ToStatements for Collection {
    fn to_statements(&self) -> Vec<Statement> {
        let mut statements: Vec<Statement> = Default::default();
        let subject = SubjectNode::named(self.uri().clone());
        if self.ordered {
            statements.push(Statement::new(
                subject.clone(),
                rdf::a_type(),
                ns::ordered_collection().into(),
            ));
        } else {
            statements.push(Statement::new(
                subject.clone(),
                rdf::a_type(),
                ns::collection().into(),
            ));
        }
        for member in self.members() {
            statements.push(member.to_statement(&subject));
        }
        for property in self.properties() {
            statements.push(property.to_statement(&subject));
        }
        statements
    }
}

impl Collection {
    pub fn member_collection(&mut self, uri: IRI, ordered: bool) -> Self {
        let mut member = Self::new(uri.clone());
        member.set_ordered(ordered);
        self.add_member(uri);
        member
    }

    pub fn member_collection_labeled(
        &mut self,
        uri: IRI,
        ordered: bool,
        label: &str,
        language: Option<&str>,
    ) -> Self {
        let mut member = Self::new_with_label(uri.clone(), label, language);
        member.set_ordered(ordered);
        self.add_member(uri);
        member
    }

    pub fn is_ordered(&self) -> bool {
        self.ordered
    }

    pub fn set_ordered(&mut self, ordered: bool) {
        self.ordered = ordered;
    }

    pub fn add_member(&mut self, uri: IRI) {
        self.members.push(Relation::member(uri));
    }
    pub fn add_list_member(&mut self, uri: IRI) {
        self.members.push(Relation::member_list(uri));
    }
    pub fn has_members(&self) -> bool {
        !self.members.is_empty()
    }
    pub fn members(&self) -> impl Iterator<Item = &Relation> {
        self.members.iter()
    }
}

// ------------------------------------------------------------------------------------------------

impl ToStatement for LiteralProperty {
    fn to_statement(&self, subject: &SubjectNode) -> Statement {
        Statement::new(
            subject.clone(),
            self.predicate().clone(),
            self.value().clone().into(),
        )
    }
}

impl LiteralProperty {
    pub fn new(predicate: IRI, value: Literal) -> Self {
        Self { predicate, value }
    }

    pub fn preferred_label(text: &str) -> Self {
        Self::new(ns::pref_label(), text.into())
    }
    pub fn preferred_label_with(text: &str, language: &str) -> Self {
        Self::new(ns::pref_label(), Literal::with_language(text, language))
    }
    pub fn alternative_label(text: &str) -> Self {
        Self::new(ns::alt_label(), text.into())
    }
    pub fn alternative_label_with(text: &str, language: &str) -> Self {
        Self::new(ns::alt_label(), Literal::with_language(text, language))
    }
    pub fn hidden_label(text: &str) -> Self {
        Self::new(ns::hidden_label(), text.into())
    }
    pub fn hidden_label_with(text: &str, language: &str) -> Self {
        Self::new(ns::hidden_label(), Literal::with_language(text, language))
    }

    pub fn change_note(text: &str) -> Self {
        Self::new(ns::change_note(), text.into())
    }
    pub fn change_note_with(text: &str, language: &str) -> Self {
        Self::new(ns::change_note(), Literal::with_language(text, language))
    }
    pub fn definition(text: &str) -> Self {
        Self::new(ns::definition(), text.into())
    }
    pub fn definition_with(text: &str, language: &str) -> Self {
        Self::new(ns::definition(), Literal::with_language(text, language))
    }
    pub fn editorial_note(text: &str) -> Self {
        Self::new(ns::editorial_note(), text.into())
    }
    pub fn editorial_note_with(text: &str, language: &str) -> Self {
        Self::new(ns::editorial_note(), Literal::with_language(text, language))
    }
    pub fn example(text: &str) -> Self {
        Self::new(ns::example(), text.into())
    }
    pub fn example_with(text: &str, language: &str) -> Self {
        Self::new(ns::example(), Literal::with_language(text, language))
    }
    pub fn history_note(text: &str) -> Self {
        Self::new(ns::history_note(), text.into())
    }
    pub fn history_note_with(text: &str, language: &str) -> Self {
        Self::new(ns::history_note(), Literal::with_language(text, language))
    }
    pub fn note(text: &str) -> Self {
        Self::new(ns::note(), text.into())
    }
    pub fn note_with(text: &str, language: &str) -> Self {
        Self::new(ns::note(), Literal::with_language(text, language))
    }
    pub fn scope_note(text: &str) -> Self {
        Self::new(ns::scope_note(), text.into())
    }
    pub fn scope_note_with(text: &str, language: &str) -> Self {
        Self::new(ns::scope_note(), Literal::with_language(text, language))
    }

    pub fn notation(text: &str) -> Self {
        Self::new(ns::notation(), Literal::new(text))
    }

    pub fn created(text: &str) -> Self {
        Self::new(dc::terms::created(), Literal::new(text))
    }
    pub fn creator(text: &str) -> Self {
        Self::new(dc::terms::creator(), Literal::new(text))
    }
    pub fn description(text: &str) -> Self {
        Self::new(dc::terms::description(), Literal::new(text))
    }
    pub fn issued(text: &str) -> Self {
        Self::new(dc::terms::issued(), Literal::new(text))
    }
    pub fn modified(text: &str) -> Self {
        Self::new(dc::terms::modified(), Literal::new(text))
    }
    pub fn publisher(text: &str) -> Self {
        Self::new(dc::terms::publisher(), Literal::new(text))
    }
    pub fn rights(text: &str) -> Self {
        Self::new(dc::terms::rights(), Literal::new(text))
    }
    pub fn subject(text: &str) -> Self {
        Self::new(dc::terms::subject(), Literal::new(text))
    }
    pub fn title(text: &str) -> Self {
        Self::new(dc::terms::title(), Literal::new(text))
    }

    pub fn predicate(&self) -> &IRI {
        &self.predicate
    }

    pub fn value(&self) -> &Literal {
        &self.value
    }
}

// ------------------------------------------------------------------------------------------------

impl ToStatement for Relation {
    fn to_statement(&self, subject: &SubjectNode) -> Statement {
        Statement::new(
            subject.clone(),
            self.predicate().clone(),
            self.other().clone().into(),
        )
    }
}

impl Relation {
    pub fn new(predicate: IRI, other: IRI) -> Self {
        Self { predicate, other }
    }

    pub fn broader(other: IRI) -> Self {
        Self::new(ns::broader(), other)
    }
    pub fn transitively_broader(other: IRI) -> Self {
        Self::new(ns::broader_transitive(), other)
    }
    pub fn narrower(other: IRI) -> Self {
        Self::new(ns::narrower(), other)
    }
    pub fn transitively_narrower(other: IRI) -> Self {
        Self::new(ns::narrower_transitive(), other)
    }
    pub fn related_to(other: IRI) -> Self {
        Self::new(ns::related(), other)
    }

    pub fn broad_match(other: IRI) -> Self {
        Self::new(ns::broad_match(), other)
    }
    pub fn close_match(other: IRI) -> Self {
        Self::new(ns::close_match(), other)
    }
    pub fn exact_match(other: IRI) -> Self {
        Self::new(ns::exact_match(), other)
    }
    pub fn narrow_match(other: IRI) -> Self {
        Self::new(ns::narrow_match(), other)
    }
    pub fn related_match(other: IRI) -> Self {
        Self::new(ns::related_match(), other)
    }

    pub fn member(other: IRI) -> Self {
        Self::new(ns::member(), other)
    }
    pub fn member_list(other: IRI) -> Self {
        Self::new(ns::member_list(), other)
    }

    // ISO relationships
    pub fn broader_generic(other: IRI) -> Self {
        Self::new(ns::iso::broader_generic(), other)
    }
    pub fn broader_instantial(other: IRI) -> Self {
        Self::new(ns::iso::broader_instantial(), other)
    }
    pub fn broader_partitive(other: IRI) -> Self {
        Self::new(ns::iso::broader_partitive(), other)
    }
    pub fn narrower_generic(other: IRI) -> Self {
        Self::new(ns::iso::narrower_generic(), other)
    }
    pub fn narrower_instantial(other: IRI) -> Self {
        Self::new(ns::iso::narrower_instantial(), other)
    }
    pub fn narrower_partitive(other: IRI) -> Self {
        Self::new(ns::iso::narrower_partitive(), other)
    }

    pub fn predicate(&self) -> &IRI {
        &self.predicate
    }

    pub fn other(&self) -> &IRI {
        &self.other
    }
}

// ------------------------------------------------------------------------------------------------
// Private Functions
// ------------------------------------------------------------------------------------------------

// ------------------------------------------------------------------------------------------------
// Modules
// ------------------------------------------------------------------------------------------------