Work in progress

<rdf:RDF
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:j.0="http://qudt.org/schema/qudt/"
    xmlns:owl="http://www.w3.org/2002/07/owl#"
    xmlns:j.1="http://www.w3.org/ns/shacl#"
    xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="http://qudt.org/schema/qudt/EndianType">
    <j.1:property rdf:nodeID="A0"/>
    <rdfs:isDefinedBy rdf:resource="http://qudt.org/2.1/schema/qudt"/>
    <rdfs:isDefinedBy rdf:resource="http://qudt.org/2.1/schema/shacl/datatype"/>
    <j.0:informativeReference rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">http://en.wikipedia.org/wiki/Endianness</j.0:informativeReference>
    <rdf:type rdf:resource="http://www.w3.org/2000/01/rdf-schema#Class"/>
    <rdf:type rdf:resource="http://www.w3.org/2002/07/owl#Class"/>
    <owl:oneOf rdf:nodeID="A1"/>
    <rdfs:subClassOf rdf:resource="http://qudt.org/schema/qudt/EnumeratedValue"/>
    <j.0:plainTextDescription>In computing, endianness is the ordering used to represent some kind of data as a sequence of smaller units. Typical cases are the order in which integer values are stored as bytes in computer memory (relative to a given memory addressing scheme) and the transmission order over a network or other medium. When specifically talking about bytes, endianness is also referred to simply as byte order.  Most computer processors simply store integers as sequences of bytes, so that, conceptually, the encoded value can be obtained by simple concatenation. For an 'n-byte' integer value this allows 'n!' (n factorial) possible representations (one for each byte permutation). The two most common of them are: increasing numeric significance with increasing memory addresses, known as little-endian, and its opposite, called big-endian.</j.0:plainTextDescription>
    <rdf:type rdf:resource="http://www.w3.org/ns/shacl#NodeShape"/>
    <rdfs:label>Endian Type</rdfs:label>
  </rdf:Description>
</rdf:RDF>

@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<http://qudt.org/schema/qudt/EndianType>
  rdf:type rdfs:Class ;
  rdf:type owl:Class ;
  rdf:type <http://www.w3.org/ns/shacl#NodeShape> ;
  <http://qudt.org/schema/qudt/informativeReference> "http://en.wikipedia.org/wiki/Endianness"^^xsd:anyURI ;
  <http://qudt.org/schema/qudt/plainTextDescription> "In computing, endianness is the ordering used to represent some kind of data as a sequence of smaller units. Typical cases are the order in which integer values are stored as bytes in computer memory (relative to a given memory addressing scheme) and the transmission order over a network or other medium. When specifically talking about bytes, endianness is also referred to simply as byte order.  Most computer processors simply store integers as sequences of bytes, so that, conceptually, the encoded value can be obtained by simple concatenation. For an 'n-byte' integer value this allows 'n!' (n factorial) possible representations (one for each byte permutation). The two most common of them are: increasing numeric significance with increasing memory addresses, known as little-endian, and its opposite, called big-endian." ;
  rdfs:isDefinedBy <http://qudt.org/2.1/schema/qudt> ;
  rdfs:isDefinedBy <http://qudt.org/2.1/schema/shacl/datatype> ;
  rdfs:label "Endian Type" ;
  rdfs:subClassOf <http://qudt.org/schema/qudt/EnumeratedValue> ;
  owl:oneOf [] ;
  <http://www.w3.org/ns/shacl#property> [] ;
.

{"resource":"Endian Type" 
 ,"qname":"qudt:EndianType" 
 ,"uri":"http:\/\/qudt.org\/schema\/qudt\/EndianType" 
 ,"properties":["description (plain text)":"In computing, endianness is the ordering used to represent some kind of data as a sequence of smaller units. Typical cases are the order in which integer values are stored as bytes in computer memory (relative to a given memory addressing scheme) and the transmission order over a network or other medium. When specifically talking about bytes, endianness is also referred to simply as byte order.  Most computer processors simply store integers as sequences of bytes, so that, conceptually, the encoded value can be obtained by simple concatenation. For an 'n-byte' integer value this allows 'n!' (n factorial) possible representations (one for each byte permutation). The two most common of them are: increasing numeric significance with increasing memory addresses, known as little-endian, and its opposite, called big-endian." 
    ,"informative reference":"http:\/\/en.wikipedia.org\/wiki\/Endianness" 
    ,"isDefinedBy":"<http:\/\/qudt.org\/2.1\/schema\/qudt>" 
    ,"isDefinedBy":"<http:\/\/qudt.org\/2.1\/schema\/shacl\/datatype>" 
    ,"label":"Endian Type" 
    ,"oneOf":null 
    ,"property":null 
    ,"subClassOf":"qudt:EnumeratedValue" 
    ,"type":"rdfs:Class" 
    ,"type":"owl:Class" 
    ,"type":"sh:NodeShape" 
    ]}

{
  "@id" : "http://qudt.org/schema/qudt/EndianType",
  "@type" : [ "rdfs:Class", "owl:Class", "http://www.w3.org/ns/shacl#NodeShape" ],
  "informativeReference" : "http://en.wikipedia.org/wiki/Endianness",
  "plainTextDescription" : "In computing, endianness is the ordering used to represent some kind of data as a sequence of smaller units. Typical cases are the order in which integer values are stored as bytes in computer memory (relative to a given memory addressing scheme) and the transmission order over a network or other medium. When specifically talking about bytes, endianness is also referred to simply as byte order.  Most computer processors simply store integers as sequences of bytes, so that, conceptually, the encoded value can be obtained by simple concatenation. For an 'n-byte' integer value this allows 'n!' (n factorial) possible representations (one for each byte permutation). The two most common of them are: increasing numeric significance with increasing memory addresses, known as little-endian, and its opposite, called big-endian.",
  "isDefinedBy" : [ "http://qudt.org/2.1/schema/qudt", "http://qudt.org/2.1/schema/shacl/datatype" ],
  "label" : "Endian Type",
  "subClassOf" : "http://qudt.org/schema/qudt/EnumeratedValue",
  "oneOf" : "_:b1",
  "property" : "_:b0",
  "@context" : {
    "property" : {
      "@id" : "http://www.w3.org/ns/shacl#property",
      "@type" : "@id"
    },
    "isDefinedBy" : {
      "@id" : "http://www.w3.org/2000/01/rdf-schema#isDefinedBy",
      "@type" : "@id"
    },
    "informativeReference" : {
      "@id" : "http://qudt.org/schema/qudt/informativeReference",
      "@type" : "http://www.w3.org/2001/XMLSchema#anyURI"
    },
    "oneOf" : {
      "@id" : "http://www.w3.org/2002/07/owl#oneOf",
      "@type" : "@id"
    },
    "subClassOf" : {
      "@id" : "http://www.w3.org/2000/01/rdf-schema#subClassOf",
      "@type" : "@id"
    },
    "plainTextDescription" : {
      "@id" : "http://qudt.org/schema/qudt/plainTextDescription"
    },
    "label" : {
      "@id" : "http://www.w3.org/2000/01/rdf-schema#label"
    },
    "rdf" : "http://www.w3.org/1999/02/22-rdf-syntax-ns#",
    "owl" : "http://www.w3.org/2002/07/owl#",
    "xsd" : "http://www.w3.org/2001/XMLSchema#",
    "rdfs" : "http://www.w3.org/2000/01/rdf-schema#"
  }
}