cokit-cli 1.0.9 → 1.2.0

package/{templates/repo/.github/skills/ck-sequential-thinking → skills/sequential-thinking}/scripts/process-thought.js

@@ -1,236 +1,236 @@
-#!/usr/bin/env node
-
-/**
- * Sequential Thinking Thought Processor
- *
- * Validates and tracks sequential thoughts with revision and branching support.
- * Provides deterministic validation and context management.
- *
- * Usage:
- *   node process-thought.js --thought "Analysis text" --number 1 --total 5 --next true
- *   node process-thought.js --thought "Revision" --number 2 --total 5 --next true --revision 1
- *   node process-thought.js --reset  # Reset thought history
- */
-
-const fs = require('fs');
-const path = require('path');
-
-// Configuration
-const HISTORY_FILE = path.join(__dirname, '.thought-history.json');
-const DISABLE_LOGGING = process.env.DISABLE_THOUGHT_LOGGING?.toLowerCase() === 'true';
-
-class ThoughtProcessor {
-  constructor() {
-    this.loadHistory();
-  }
-
-  loadHistory() {
-    try {
-      if (fs.existsSync(HISTORY_FILE)) {
-        const data = JSON.parse(fs.readFileSync(HISTORY_FILE, 'utf8'));
-        this.thoughtHistory = data.thoughtHistory || [];
-        this.branches = data.branches || {};
-      } else {
-        this.thoughtHistory = [];
-        this.branches = {};
-      }
-    } catch (error) {
-      this.thoughtHistory = [];
-      this.branches = {};
-    }
-  }
-
-  saveHistory() {
-    fs.writeFileSync(
-      HISTORY_FILE,
-      JSON.stringify({
-        thoughtHistory: this.thoughtHistory,
-        branches: this.branches
-      }, null, 2)
-    );
-  }
-
-  resetHistory() {
-    this.thoughtHistory = [];
-    this.branches = {};
-    if (fs.existsSync(HISTORY_FILE)) {
-      fs.unlinkSync(HISTORY_FILE);
-    }
-  }
-
-  validateThought(input) {
-    const errors = [];
-
-    if (!input.thought || typeof input.thought !== 'string' || input.thought.trim() === '') {
-      errors.push('Invalid thought: must be a non-empty string');
-    }
-
-    if (!input.thoughtNumber || typeof input.thoughtNumber !== 'number' || input.thoughtNumber < 1) {
-      errors.push('Invalid thoughtNumber: must be a positive number');
-    }
-
-    if (!input.totalThoughts || typeof input.totalThoughts !== 'number' || input.totalThoughts < 1) {
-      errors.push('Invalid totalThoughts: must be a positive number');
-    }
-
-    if (typeof input.nextThoughtNeeded !== 'boolean') {
-      errors.push('Invalid nextThoughtNeeded: must be a boolean');
-    }
-
-    // Optional field validations
-    if (input.isRevision !== undefined && typeof input.isRevision !== 'boolean') {
-      errors.push('Invalid isRevision: must be a boolean');
-    }
-
-    if (input.revisesThought !== undefined && (typeof input.revisesThought !== 'number' || input.revisesThought < 1)) {
-      errors.push('Invalid revisesThought: must be a positive number');
-    }
-
-    if (input.branchFromThought !== undefined && (typeof input.branchFromThought !== 'number' || input.branchFromThought < 1)) {
-      errors.push('Invalid branchFromThought: must be a positive number');
-    }
-
-    if (input.branchId !== undefined && typeof input.branchId !== 'string') {
-      errors.push('Invalid branchId: must be a string');
-    }
-
-    if (input.needsMoreThoughts !== undefined && typeof input.needsMoreThoughts !== 'boolean') {
-      errors.push('Invalid needsMoreThoughts: must be a boolean');
-    }
-
-    return errors;
-  }
-
-  processThought(input) {
-    const errors = this.validateThought(input);
-
-    if (errors.length > 0) {
-      return {
-        success: false,
-        errors,
-        status: 'failed'
-      };
-    }
-
-    // Auto-adjust totalThoughts if thoughtNumber exceeds it
-    if (input.thoughtNumber > input.totalThoughts) {
-      input.totalThoughts = input.thoughtNumber;
-    }
-
-    // Create thought data
-    const thoughtData = {
-      thought: input.thought,
-      thoughtNumber: input.thoughtNumber,
-      totalThoughts: input.totalThoughts,
-      nextThoughtNeeded: input.nextThoughtNeeded,
-      isRevision: input.isRevision,
-      revisesThought: input.revisesThought,
-      branchFromThought: input.branchFromThought,
-      branchId: input.branchId,
-      needsMoreThoughts: input.needsMoreThoughts,
-      timestamp: new Date().toISOString()
-    };
-
-    // Add to history
-    this.thoughtHistory.push(thoughtData);
-
-    // Track branches
-    if (thoughtData.branchFromThought && thoughtData.branchId) {
-      if (!this.branches[thoughtData.branchId]) {
-        this.branches[thoughtData.branchId] = [];
-      }
-      this.branches[thoughtData.branchId].push(thoughtData);
-    }
-
-    // Save history
-    this.saveHistory();
-
-    return {
-      success: true,
-      thoughtNumber: thoughtData.thoughtNumber,
-      totalThoughts: thoughtData.totalThoughts,
-      nextThoughtNeeded: thoughtData.nextThoughtNeeded,
-      branches: Object.keys(this.branches),
-      thoughtHistoryLength: this.thoughtHistory.length,
-      timestamp: thoughtData.timestamp
-    };
-  }
-
-  getHistory() {
-    return {
-      thoughts: this.thoughtHistory,
-      branches: this.branches,
-      totalThoughts: this.thoughtHistory.length
-    };
-  }
-}
-
-// CLI Interface
-if (require.main === module) {
-  const args = process.argv.slice(2);
-  const processor = new ThoughtProcessor();
-
-  // Parse arguments
-  const parseArgs = (args) => {
-    const parsed = {};
-    for (let i = 0; i < args.length; i++) {
-      const arg = args[i];
-      if (arg.startsWith('--')) {
-        const key = arg.slice(2);
-        const value = args[i + 1];
-
-        if (key === 'reset') {
-          return { reset: true };
-        }
-
-        if (key === 'history') {
-          return { history: true };
-        }
-
-        if (value && !value.startsWith('--')) {
-          // Parse boolean
-          if (value === 'true') parsed[key] = true;
-          else if (value === 'false') parsed[key] = false;
-          // Parse number
-          else if (!isNaN(value)) parsed[key] = parseFloat(value);
-          // String
-          else parsed[key] = value;
-          i++;
-        }
-      }
-    }
-    return parsed;
-  };
-
-  const input = parseArgs(args);
-
-  if (input.reset) {
-    processor.resetHistory();
-    console.log(JSON.stringify({ success: true, message: 'History reset' }, null, 2));
-    process.exit(0);
-  }
-
-  if (input.history) {
-    console.log(JSON.stringify(processor.getHistory(), null, 2));
-    process.exit(0);
-  }
-
-  // Map CLI args to expected field names
-  const thoughtInput = {
-    thought: input.thought,
-    thoughtNumber: input.number,
-    totalThoughts: input.total,
-    nextThoughtNeeded: input.next,
-    isRevision: input.revision !== undefined ? true : input.isRevision,
-    revisesThought: input.revision,
-    branchFromThought: input.branch,
-    branchId: input.branchId,
-    needsMoreThoughts: input.needsMore
-  };
-
-  const result = processor.processThought(thoughtInput);
-  console.log(JSON.stringify(result, null, 2));
-  process.exit(result.success ? 0 : 1);
-}
-
-module.exports = { ThoughtProcessor };
+#!/usr/bin/env node
+
+/**
+ * Sequential Thinking Thought Processor
+ *
+ * Validates and tracks sequential thoughts with revision and branching support.
+ * Provides deterministic validation and context management.
+ *
+ * Usage:
+ *   node process-thought.js --thought "Analysis text" --number 1 --total 5 --next true
+ *   node process-thought.js --thought "Revision" --number 2 --total 5 --next true --revision 1
+ *   node process-thought.js --reset  # Reset thought history
+ */
+
+const fs = require('fs');
+const path = require('path');
+
+// Configuration
+const HISTORY_FILE = path.join(__dirname, '.thought-history.json');
+const DISABLE_LOGGING = process.env.DISABLE_THOUGHT_LOGGING?.toLowerCase() === 'true';
+
+class ThoughtProcessor {
+  constructor() {
+    this.loadHistory();
+  }
+
+  loadHistory() {
+    try {
+      if (fs.existsSync(HISTORY_FILE)) {
+        const data = JSON.parse(fs.readFileSync(HISTORY_FILE, 'utf8'));
+        this.thoughtHistory = data.thoughtHistory || [];
+        this.branches = data.branches || {};
+      } else {
+        this.thoughtHistory = [];
+        this.branches = {};
+      }
+    } catch (error) {
+      this.thoughtHistory = [];
+      this.branches = {};
+    }
+  }
+
+  saveHistory() {
+    fs.writeFileSync(
+      HISTORY_FILE,
+      JSON.stringify({
+        thoughtHistory: this.thoughtHistory,
+        branches: this.branches
+      }, null, 2)
+    );
+  }
+
+  resetHistory() {
+    this.thoughtHistory = [];
+    this.branches = {};
+    if (fs.existsSync(HISTORY_FILE)) {
+      fs.unlinkSync(HISTORY_FILE);
+    }
+  }
+
+  validateThought(input) {
+    const errors = [];
+
+    if (!input.thought || typeof input.thought !== 'string' || input.thought.trim() === '') {
+      errors.push('Invalid thought: must be a non-empty string');
+    }
+
+    if (!input.thoughtNumber || typeof input.thoughtNumber !== 'number' || input.thoughtNumber < 1) {
+      errors.push('Invalid thoughtNumber: must be a positive number');
+    }
+
+    if (!input.totalThoughts || typeof input.totalThoughts !== 'number' || input.totalThoughts < 1) {
+      errors.push('Invalid totalThoughts: must be a positive number');
+    }
+
+    if (typeof input.nextThoughtNeeded !== 'boolean') {
+      errors.push('Invalid nextThoughtNeeded: must be a boolean');
+    }
+
+    // Optional field validations
+    if (input.isRevision !== undefined && typeof input.isRevision !== 'boolean') {
+      errors.push('Invalid isRevision: must be a boolean');
+    }
+
+    if (input.revisesThought !== undefined && (typeof input.revisesThought !== 'number' || input.revisesThought < 1)) {
+      errors.push('Invalid revisesThought: must be a positive number');
+    }
+
+    if (input.branchFromThought !== undefined && (typeof input.branchFromThought !== 'number' || input.branchFromThought < 1)) {
+      errors.push('Invalid branchFromThought: must be a positive number');
+    }
+
+    if (input.branchId !== undefined && typeof input.branchId !== 'string') {
+      errors.push('Invalid branchId: must be a string');
+    }
+
+    if (input.needsMoreThoughts !== undefined && typeof input.needsMoreThoughts !== 'boolean') {
+      errors.push('Invalid needsMoreThoughts: must be a boolean');
+    }
+
+    return errors;
+  }
+
+  processThought(input) {
+    const errors = this.validateThought(input);
+
+    if (errors.length > 0) {
+      return {
+        success: false,
+        errors,
+        status: 'failed'
+      };
+    }
+
+    // Auto-adjust totalThoughts if thoughtNumber exceeds it
+    if (input.thoughtNumber > input.totalThoughts) {
+      input.totalThoughts = input.thoughtNumber;
+    }
+
+    // Create thought data
+    const thoughtData = {
+      thought: input.thought,
+      thoughtNumber: input.thoughtNumber,
+      totalThoughts: input.totalThoughts,
+      nextThoughtNeeded: input.nextThoughtNeeded,
+      isRevision: input.isRevision,
+      revisesThought: input.revisesThought,
+      branchFromThought: input.branchFromThought,
+      branchId: input.branchId,
+      needsMoreThoughts: input.needsMoreThoughts,
+      timestamp: new Date().toISOString()
+    };
+
+    // Add to history
+    this.thoughtHistory.push(thoughtData);
+
+    // Track branches
+    if (thoughtData.branchFromThought && thoughtData.branchId) {
+      if (!this.branches[thoughtData.branchId]) {
+        this.branches[thoughtData.branchId] = [];
+      }
+      this.branches[thoughtData.branchId].push(thoughtData);
+    }
+
+    // Save history
+    this.saveHistory();
+
+    return {
+      success: true,
+      thoughtNumber: thoughtData.thoughtNumber,
+      totalThoughts: thoughtData.totalThoughts,
+      nextThoughtNeeded: thoughtData.nextThoughtNeeded,
+      branches: Object.keys(this.branches),
+      thoughtHistoryLength: this.thoughtHistory.length,
+      timestamp: thoughtData.timestamp
+    };
+  }
+
+  getHistory() {
+    return {
+      thoughts: this.thoughtHistory,
+      branches: this.branches,
+      totalThoughts: this.thoughtHistory.length
+    };
+  }
+}
+
+// CLI Interface
+if (require.main === module) {
+  const args = process.argv.slice(2);
+  const processor = new ThoughtProcessor();
+
+  // Parse arguments
+  const parseArgs = (args) => {
+    const parsed = {};
+    for (let i = 0; i < args.length; i++) {
+      const arg = args[i];
+      if (arg.startsWith('--')) {
+        const key = arg.slice(2);
+        const value = args[i + 1];
+
+        if (key === 'reset') {
+          return { reset: true };
+        }
+
+        if (key === 'history') {
+          return { history: true };
+        }
+
+        if (value && !value.startsWith('--')) {
+          // Parse boolean
+          if (value === 'true') parsed[key] = true;
+          else if (value === 'false') parsed[key] = false;
+          // Parse number
+          else if (!isNaN(value)) parsed[key] = parseFloat(value);
+          // String
+          else parsed[key] = value;
+          i++;
+        }
+      }
+    }
+    return parsed;
+  };
+
+  const input = parseArgs(args);
+
+  if (input.reset) {
+    processor.resetHistory();
+    console.log(JSON.stringify({ success: true, message: 'History reset' }, null, 2));
+    process.exit(0);
+  }
+
+  if (input.history) {
+    console.log(JSON.stringify(processor.getHistory(), null, 2));
+    process.exit(0);
+  }
+
+  // Map CLI args to expected field names
+  const thoughtInput = {
+    thought: input.thought,
+    thoughtNumber: input.number,
+    totalThoughts: input.total,
+    nextThoughtNeeded: input.next,
+    isRevision: input.revision !== undefined ? true : input.isRevision,
+    revisesThought: input.revision,
+    branchFromThought: input.branch,
+    branchId: input.branchId,
+    needsMoreThoughts: input.needsMore
+  };
+
+  const result = processor.processThought(thoughtInput);
+  console.log(JSON.stringify(result, null, 2));
+  process.exit(result.success ? 0 : 1);
+}
+
+module.exports = { ThoughtProcessor };

package/skills/ui-styling/LICENSE.txt

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.