proskomma-core 0.10.11 → 0.10.12

package/dist/index.js

@@ -15992,7 +15992,7 @@ var bitset = { exports: {} };
 var bitsetExports = bitset.exports;
 const BitSet = /* @__PURE__ */ getDefaultExportFromCjs(bitsetExports);
 const name = "proskomma-core";
-const version = "0.10.11";
+const version = "0.10.12";
 const description$b = "A Scripture Runtime Engine";
 const files = [
   "dist"
@@ -42063,6 +42063,18 @@ const keyValueResolvers = {
   key: (root) => root[0],
   value: (root) => root[1]
 };
+const keyCountSchemaString = `
+"""Key/Count tuple"""
+type KeyCount {
+    """The key"""
+    key: String!
+    """The number of occurrences"""
+    count: Int!
+}`;
+const keyCountResolvers = {
+  key: (root) => root[0],
+  count: (root) => root[1]
+};
 const cvSchemaString = `
 """A chapter-verse reference"""
 type cv {
@@ -44530,6 +44542,13 @@ type Sequence {
     """Whether to coerce the strings (toLower|toUpper|none)"""
     coerceCase: String
   ) : [String!]!
+  """A list of token strings the sequence with counts"""
+  uniqueTokenCounts(
+      """Whether to coerce the strings (toLower|toUpper|none)"""
+    coerceCase: String
+) : [KeyCount!]!
+    """A list of unique characters in the sequence with counts"""
+  uniqueCharacterCounts: [KeyCount!]!
   """Returns true if a main sequence contains the specified tokens"""
   hasChars(
     """Token strings to be matched exactly"""
@@ -44702,6 +44721,43 @@ const sequenceResolvers = {
     }
     return Array.from(tokens2).sort();
   },
+  uniqueCharacterCounts: (root, args, context) => {
+    const characters = {};
+    root.blocks.forEach(
+      (b) => context.docSet.unsuccinctifyItems(b.c, { tokens: true }, null).forEach(
+        (t) => {
+          const chars = t[2].split("");
+          for (const char of chars) {
+            characters[char] ? characters[char] += 1 : characters[char] = 1;
+          }
+        }
+      )
+    );
+    return Object.entries(characters).sort((a, b) => b[1] - a[1]);
+  },
+  uniqueTokenCounts: (root, args, context) => {
+    const wordlikes = {};
+    root.blocks.forEach(
+      (b) => context.docSet.unsuccinctifyItems(b.c, { tokens: true }, null).forEach(
+        (t) => {
+          let wordlike = t[2];
+          if (args.coerceCase && !["toLower", "toUpper", "none"].includes(args.coerceCase)) {
+            throw new Error(
+              `coerceCase, when present, must be 'toLower', 'toUpper' or 'none', not '${args.coerceCase}'`
+            );
+          }
+          if (args.coerceCase === "toLower") {
+            wordlike = wordlike.toLowerCase();
+          }
+          if (args.coerceCase === "toUpper") {
+            wordlike = wordlike.toUpperCase();
+          }
+          wordlikes[wordlike] ? wordlikes[wordlike] += 1 : wordlikes[wordlike] = 1;
+        }
+      )
+    );
+    return Object.entries(wordlikes).sort((a, b) => b[1] - a[1]);
+  },
   hasChars: (root, args, context) => {
     if (root.type !== "main") {
       throw new Error(`Only available for the main sequence, not ${root.type}`);
@@ -49905,6 +49961,7 @@ const typeDefs = `
       ${querySchemaString}
       ${mutationsSchemaString}
       ${keyValueSchemaString}
+      ${keyCountSchemaString}
       ${cvSchemaString}
       ${idPartsSchemaString}
       ${inputAttSpecSchemaString}
@@ -49946,6 +50003,7 @@ const resolvers = {
   Mutation: mutationsResolvers,
   Query: queryResolvers,
   KeyValue: keyValueResolvers,
+  KeyCount: keyCountResolvers,
   cv: cvResolvers,
   idParts: idPartsResolvers,
   Item: itemResolvers,

package/dist/index.mjs

@@ -15990,7 +15990,7 @@ var bitset = { exports: {} };
 var bitsetExports = bitset.exports;
 const BitSet = /* @__PURE__ */ getDefaultExportFromCjs(bitsetExports);
 const name = "proskomma-core";
-const version = "0.10.11";
+const version = "0.10.12";
 const description$b = "A Scripture Runtime Engine";
 const files = [
   "dist"
@@ -42061,6 +42061,18 @@ const keyValueResolvers = {
   key: (root) => root[0],
   value: (root) => root[1]
 };
+const keyCountSchemaString = `
+"""Key/Count tuple"""
+type KeyCount {
+    """The key"""
+    key: String!
+    """The number of occurrences"""
+    count: Int!
+}`;
+const keyCountResolvers = {
+  key: (root) => root[0],
+  count: (root) => root[1]
+};
 const cvSchemaString = `
 """A chapter-verse reference"""
 type cv {
@@ -44528,6 +44540,13 @@ type Sequence {
     """Whether to coerce the strings (toLower|toUpper|none)"""
     coerceCase: String
   ) : [String!]!
+  """A list of token strings the sequence with counts"""
+  uniqueTokenCounts(
+      """Whether to coerce the strings (toLower|toUpper|none)"""
+    coerceCase: String
+) : [KeyCount!]!
+    """A list of unique characters in the sequence with counts"""
+  uniqueCharacterCounts: [KeyCount!]!
   """Returns true if a main sequence contains the specified tokens"""
   hasChars(
     """Token strings to be matched exactly"""
@@ -44700,6 +44719,43 @@ const sequenceResolvers = {
     }
     return Array.from(tokens2).sort();
   },
+  uniqueCharacterCounts: (root, args, context) => {
+    const characters = {};
+    root.blocks.forEach(
+      (b) => context.docSet.unsuccinctifyItems(b.c, { tokens: true }, null).forEach(
+        (t) => {
+          const chars = t[2].split("");
+          for (const char of chars) {
+            characters[char] ? characters[char] += 1 : characters[char] = 1;
+          }
+        }
+      )
+    );
+    return Object.entries(characters).sort((a, b) => b[1] - a[1]);
+  },
+  uniqueTokenCounts: (root, args, context) => {
+    const wordlikes = {};
+    root.blocks.forEach(
+      (b) => context.docSet.unsuccinctifyItems(b.c, { tokens: true }, null).forEach(
+        (t) => {
+          let wordlike = t[2];
+          if (args.coerceCase && !["toLower", "toUpper", "none"].includes(args.coerceCase)) {
+            throw new Error(
+              `coerceCase, when present, must be 'toLower', 'toUpper' or 'none', not '${args.coerceCase}'`
+            );
+          }
+          if (args.coerceCase === "toLower") {
+            wordlike = wordlike.toLowerCase();
+          }
+          if (args.coerceCase === "toUpper") {
+            wordlike = wordlike.toUpperCase();
+          }
+          wordlikes[wordlike] ? wordlikes[wordlike] += 1 : wordlikes[wordlike] = 1;
+        }
+      )
+    );
+    return Object.entries(wordlikes).sort((a, b) => b[1] - a[1]);
+  },
   hasChars: (root, args, context) => {
     if (root.type !== "main") {
       throw new Error(`Only available for the main sequence, not ${root.type}`);
@@ -49903,6 +49959,7 @@ const typeDefs = `
       ${querySchemaString}
       ${mutationsSchemaString}
       ${keyValueSchemaString}
+      ${keyCountSchemaString}
       ${cvSchemaString}
       ${idPartsSchemaString}
       ${inputAttSpecSchemaString}
@@ -49944,6 +50001,7 @@ const resolvers = {
   Mutation: mutationsResolvers,
   Query: queryResolvers,
   KeyValue: keyValueResolvers,
+  KeyCount: keyCountResolvers,
   cv: cvResolvers,
   idParts: idPartsResolvers,
   Item: itemResolvers,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "proskomma-core",
-  "version": "0.10.11",
+  "version": "0.10.12",
   "description": "A Scripture Runtime Engine",
   "files": [
     "dist"