Removed the unused validator code

hed-standard · Dec 23, 2024 · 3dd3a15 · 3dd3a15
1 parent dcee6f0
commit 3dd3a15
Show file tree

Hide file tree

Showing 11 changed files with 80 additions and 904 deletions.
diff --git a/bids/index.js b/bids/index.js
@@ -1,7 +1,7 @@
-import buildBidsSchemas from './schema'
+import { buildBidsSchemas } from './schema'
 import validateBidsDataset from './validate'
 import { BidsJsonFile, BidsSidecar } from './types/json'
-import { BidsTabularFile, BidsTsvFile } from './types/tsv'
+import { BidsTsvFile } from './types/tsv'
 import BidsDataset from './types/dataset'
 import { BidsHedIssue, BidsIssue } from './types/issues'
 import BidsHedSidecarValidator from './validator/sidecarValidator'
@@ -10,7 +10,6 @@ import BidsHedTsvValidator from './validator/tsvValidator'
 export {
   BidsDataset,
   BidsTsvFile,
-  BidsTabularFile,
   BidsJsonFile,
   BidsSidecar,
   BidsIssue,
@@ -24,7 +23,6 @@ export {
 export default {
   BidsDataset,
   BidsTsvFile,
-  BidsTabularFile,
   BidsJsonFile,
   BidsSidecar,
   BidsIssue,

diff --git a/bids/types/dataset.js b/bids/types/dataset.js
@@ -1,7 +1,7 @@
 export class BidsDataset {
   /**
    * The dataset's event file data.
-   * @type {BidsEventFile[]}
+   * @type {BidsTsvFile[]}
    */
   eventData
   /**

diff --git a/utils/array.js b/utils/array.js
@@ -31,19 +31,19 @@ export function recursiveMap(fn, array) {
   }
 }
 
-/**
- * Apply a function recursively to an array.
- *
- * @template T,U
- * @param {function(T, U[]): U} fn The function to apply.
- * @param {T[]} array The array to map.
- * @param {U[]}  [issues] An optional array to collect issues.
- * @returns {U[]} The mapped array.
- */
-export function recursiveMapNew(fn, array, issues = []) {
-  if (Array.isArray(array)) {
-    return array.map((element) => recursiveMap(fn, element, issues))
-  } else {
-    return fn(array, issues)
-  }
-}
+// /**
+//  * Apply a function recursively to an array.
+//  *
+//  * @template T,U
+//  * @param {function(T, U[]): U} fn The function to apply.
+//  * @param {T[]} array The array to map.
+//  * @param {U[]}  [issues] An optional array to collect issues.
+//  * @returns {U[]} The mapped array.
+//  */
+// export function recursiveMapNew(fn, array, issues = []) {
+//   if (Array.isArray(array)) {
+//     return array.map((element) => recursiveMap(fn, element, issues))
+//   } else {
+//     return fn(array, issues)
+//   }
+// }
diff --git a/utils/hedData.js b/utils/hedData.js
@@ -1,7 +1,7 @@
 import lt from 'semver/functions/lt'
-
-import ParsedHedTag from '../parser/parsedHedTag'
-import { TagSpec } from '../parser/tokenizer'
+//
+// import ParsedHedTag from '../parser/parsedHedTag'
+// import { TagSpec } from '../parser/tokenizer'
 
 /**
  * Determine the HED generation for a base schema version number.
@@ -19,31 +19,31 @@ export const getGenerationForSchemaVersion = function (version) {
   }
 }
 
-export const mergeParsingIssues = function (previousIssues, currentIssues) {
-  for (const [key, currentIssue] of Object.entries(currentIssues)) {
-    previousIssues[key] = previousIssues[key] !== undefined ? previousIssues[key].concat(currentIssue) : currentIssue
-  }
-}
+// export const mergeParsingIssues = function (previousIssues, currentIssues) {
+//   for (const [key, currentIssue] of Object.entries(currentIssues)) {
+//     previousIssues[key] = previousIssues[key] !== undefined ? previousIssues[key].concat(currentIssue) : currentIssue
+//   }
+// }
 
-/**
- * Get the parent tag objects for a given short tag.
- *
- * @param {Schemas} hedSchemas The HED schema collection.
- * @param {string} shortTag A short-form HED 3 tag.
- * @returns {Map<Schema, ParsedHedTag>} A Map mapping a {@link Schema} to a {@link ParsedHedTag} object representing the full tag.
- */
-export const getParsedParentTags = function (hedSchemas, shortTag) {
-  const parentTags = new Map()
-  for (const [schemaNickname, schema] of hedSchemas.schemas) {
-    try {
-      const parentTag = new ParsedHedTag(
-        new TagSpec(shortTag, 0, shortTag.length - 1, schemaNickname),
-        hedSchemas,
-        shortTag,
-      )
-      parentTags.set(schema, parentTag)
-      // eslint-disable-next-line no-empty
-    } catch (e) {}
-  }
-  return parentTags
-}
+// /**
+//  * Get the parent tag objects for a given short tag.
+//  *
+//  * @param {Schemas} hedSchemas The HED schema collection.
+//  * @param {string} shortTag A short-form HED 3 tag.
+//  * @returns {Map<Schema, ParsedHedTag>} A Map mapping a {@link Schema} to a {@link ParsedHedTag} object representing the full tag.
+//  */
+// export const getParsedParentTags = function (hedSchemas, shortTag) {
+//   const parentTags = new Map()
+//   for (const [schemaNickname, schema] of hedSchemas.schemas) {
+//     try {
+//       const parentTag = new ParsedHedTag(
+//         new TagSpec(shortTag, 0, shortTag.length - 1, schemaNickname),
+//         hedSchemas,
+//         shortTag,
+//       )
+//       parentTags.set(schema, parentTag)
+//       // eslint-disable-next-line no-empty
+//     } catch (e) {}
+//   }
+//   return parentTags
+// }
diff --git a/utils/hedStrings.js b/utils/hedStrings.js
@@ -25,16 +25,16 @@ export const getTagSlashIndices = function (tag) {
   return indices
 }
 
-/**
- * Get the levels of a tag.
- *
- * @param {string} tag A HED tag string.
- * @returns {string[]} The levels of this tag.
- */
-export const getTagLevels = function (tag) {
-  const tagSlashIndices = getTagSlashIndices(tag)
-  return tagSlashIndices.map((tagSlashIndex) => tag.slice(0, tagSlashIndex))
-}
+// /**
+//  * Get the levels of a tag.
+//  *
+//  * @param {string} tag A HED tag string.
+//  * @returns {string[]} The levels of this tag.
+//  */
+// export const getTagLevels = function (tag) {
+//   const tagSlashIndices = getTagSlashIndices(tag)
+//   return tagSlashIndices.map((tagSlashIndex) => tag.slice(0, tagSlashIndex))
+// }
 
 /**
  * Get the last part of a HED tag.

diff --git a/utils/map.js b/utils/map.js
@@ -1,4 +1,4 @@
-import identity from 'lodash/identity'
+// import identity from 'lodash/identity'
 import isEqual from 'lodash/isEqual'
 
 /**
@@ -29,23 +29,23 @@ export const filterNonEqualDuplicates = function (list, equalityFunction = isEqu
   return [map, duplicates]
 }
 
-/**
- * Group a list by a given grouping function.
- *
- * @template T, U
- * @param {T[]} list The list to group.
- * @param {function (T): U} groupingFunction A function mapping a list value to the key it is to be grouped under.
- * @returns {Map<U, T[]>} The grouped map.
- */
-export const groupBy = function (list, groupingFunction = identity) {
-  const groupingMap = new Map()
-  for (const listEntry of list) {
-    const groupingValue = groupingFunction(listEntry)
-    if (groupingMap.has(groupingValue)) {
-      groupingMap.get(groupingValue).push(listEntry)
-    } else {
-      groupingMap.set(groupingValue, [listEntry])
-    }
-  }
-  return groupingMap
-}
+// /**
+//  * Group a list by a given grouping function.
+//  *
+//  * @template T, U
+//  * @param {T[]} list The list to group.
+//  * @param {function (T): U} groupingFunction A function mapping a list value to the key it is to be grouped under.
+//  * @returns {Map<U, T[]>} The grouped map.
+//  */
+// export const groupBy = function (list, groupingFunction = identity) {
+//   const groupingMap = new Map()
+//   for (const listEntry of list) {
+//     const groupingValue = groupingFunction(listEntry)
+//     if (groupingMap.has(groupingValue)) {
+//       groupingMap.get(groupingValue).push(listEntry)
+//     } else {
+//       groupingMap.set(groupingValue, [listEntry])
+//     }
+//   }
+//   return groupingMap
+// }