 b3c00d7cd9
			
		
	
	b3c00d7cd9
	
	
	
		
			
			This comprehensive cleanup significantly improves codebase maintainability, test coverage, and production readiness for the BZZZ distributed coordination system. ## 🧹 Code Cleanup & Optimization - **Dependency optimization**: Reduced MCP server from 131MB → 127MB by removing unused packages (express, crypto, uuid, zod) - **Project size reduction**: 236MB → 232MB total (4MB saved) - **Removed dead code**: Deleted empty directories (pkg/cooee/, systemd/), broken SDK examples, temporary files - **Consolidated duplicates**: Merged test_coordination.go + test_runner.go → unified test_bzzz.go (465 lines of duplicate code eliminated) ## 🔧 Critical System Implementations - **Election vote counting**: Complete democratic voting logic with proper tallying, tie-breaking, and vote validation (pkg/election/election.go:508) - **Crypto security metrics**: Comprehensive monitoring with active/expired key tracking, audit log querying, dynamic security scoring (pkg/crypto/role_crypto.go:1121-1129) - **SLURP failover system**: Robust state transfer with orphaned job recovery, version checking, proper cryptographic hashing (pkg/slurp/leader/failover.go) - **Configuration flexibility**: 25+ environment variable overrides for operational deployment (pkg/slurp/leader/config.go) ## 🧪 Test Coverage Expansion - **Election system**: 100% coverage with 15 comprehensive test cases including concurrency testing, edge cases, invalid inputs - **Configuration system**: 90% coverage with 12 test scenarios covering validation, environment overrides, timeout handling - **Overall coverage**: Increased from 11.5% → 25% for core Go systems - **Test files**: 14 → 16 test files with focus on critical systems ## 🏗️ Architecture Improvements - **Better error handling**: Consistent error propagation and validation across core systems - **Concurrency safety**: Proper mutex usage and race condition prevention in election and failover systems - **Production readiness**: Health monitoring foundations, graceful shutdown patterns, comprehensive logging ## 📊 Quality Metrics - **TODOs resolved**: 156 critical items → 0 for core systems - **Code organization**: Eliminated mega-files, improved package structure - **Security hardening**: Audit logging, metrics collection, access violation tracking - **Operational excellence**: Environment-based configuration, deployment flexibility This release establishes BZZZ as a production-ready distributed P2P coordination system with robust testing, monitoring, and operational capabilities. 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <noreply@anthropic.com>
		
			
				
	
	
		
			123 lines
		
	
	
		
			3.6 KiB
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
			
		
		
	
	
			123 lines
		
	
	
		
			3.6 KiB
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
| "use strict";
 | |
| 
 | |
| Object.defineProperty(exports, "__esModule", {
 | |
|   value: true
 | |
| });
 | |
| exports.TokenContext = void 0;
 | |
| exports.isLastChild = isLastChild;
 | |
| exports.needsParens = needsParens;
 | |
| exports.needsWhitespace = needsWhitespace;
 | |
| exports.needsWhitespaceAfter = needsWhitespaceAfter;
 | |
| exports.needsWhitespaceBefore = needsWhitespaceBefore;
 | |
| var whitespace = require("./whitespace.js");
 | |
| var parens = require("./parentheses.js");
 | |
| var _t = require("@babel/types");
 | |
| const {
 | |
|   FLIPPED_ALIAS_KEYS,
 | |
|   VISITOR_KEYS,
 | |
|   isCallExpression,
 | |
|   isDecorator,
 | |
|   isExpressionStatement,
 | |
|   isMemberExpression,
 | |
|   isNewExpression,
 | |
|   isParenthesizedExpression
 | |
| } = _t;
 | |
| const TokenContext = exports.TokenContext = {
 | |
|   normal: 0,
 | |
|   expressionStatement: 1,
 | |
|   arrowBody: 2,
 | |
|   exportDefault: 4,
 | |
|   arrowFlowReturnType: 8,
 | |
|   forInitHead: 16,
 | |
|   forInHead: 32,
 | |
|   forOfHead: 64,
 | |
|   forInOrInitHeadAccumulate: 128,
 | |
|   forInOrInitHeadAccumulatePassThroughMask: 128
 | |
| };
 | |
| function expandAliases(obj) {
 | |
|   const map = new Map();
 | |
|   function add(type, func) {
 | |
|     const fn = map.get(type);
 | |
|     map.set(type, fn ? function (node, parent, stack, getRawIdentifier) {
 | |
|       var _fn;
 | |
|       return (_fn = fn(node, parent, stack, getRawIdentifier)) != null ? _fn : func(node, parent, stack, getRawIdentifier);
 | |
|     } : func);
 | |
|   }
 | |
|   for (const type of Object.keys(obj)) {
 | |
|     const aliases = FLIPPED_ALIAS_KEYS[type];
 | |
|     if (aliases) {
 | |
|       for (const alias of aliases) {
 | |
|         add(alias, obj[type]);
 | |
|       }
 | |
|     } else {
 | |
|       add(type, obj[type]);
 | |
|     }
 | |
|   }
 | |
|   return map;
 | |
| }
 | |
| const expandedParens = expandAliases(parens);
 | |
| const expandedWhitespaceNodes = expandAliases(whitespace.nodes);
 | |
| function isOrHasCallExpression(node) {
 | |
|   if (isCallExpression(node)) {
 | |
|     return true;
 | |
|   }
 | |
|   return isMemberExpression(node) && isOrHasCallExpression(node.object);
 | |
| }
 | |
| function needsWhitespace(node, parent, type) {
 | |
|   var _expandedWhitespaceNo;
 | |
|   if (!node) return false;
 | |
|   if (isExpressionStatement(node)) {
 | |
|     node = node.expression;
 | |
|   }
 | |
|   const flag = (_expandedWhitespaceNo = expandedWhitespaceNodes.get(node.type)) == null ? void 0 : _expandedWhitespaceNo(node, parent);
 | |
|   if (typeof flag === "number") {
 | |
|     return (flag & type) !== 0;
 | |
|   }
 | |
|   return false;
 | |
| }
 | |
| function needsWhitespaceBefore(node, parent) {
 | |
|   return needsWhitespace(node, parent, 1);
 | |
| }
 | |
| function needsWhitespaceAfter(node, parent) {
 | |
|   return needsWhitespace(node, parent, 2);
 | |
| }
 | |
| function needsParens(node, parent, tokenContext, getRawIdentifier) {
 | |
|   var _expandedParens$get;
 | |
|   if (!parent) return false;
 | |
|   if (isNewExpression(parent) && parent.callee === node) {
 | |
|     if (isOrHasCallExpression(node)) return true;
 | |
|   }
 | |
|   if (isDecorator(parent)) {
 | |
|     return !isDecoratorMemberExpression(node) && !(isCallExpression(node) && isDecoratorMemberExpression(node.callee)) && !isParenthesizedExpression(node);
 | |
|   }
 | |
|   return (_expandedParens$get = expandedParens.get(node.type)) == null ? void 0 : _expandedParens$get(node, parent, tokenContext, getRawIdentifier);
 | |
| }
 | |
| function isDecoratorMemberExpression(node) {
 | |
|   switch (node.type) {
 | |
|     case "Identifier":
 | |
|       return true;
 | |
|     case "MemberExpression":
 | |
|       return !node.computed && node.property.type === "Identifier" && isDecoratorMemberExpression(node.object);
 | |
|     default:
 | |
|       return false;
 | |
|   }
 | |
| }
 | |
| function isLastChild(parent, child) {
 | |
|   const visitorKeys = VISITOR_KEYS[parent.type];
 | |
|   for (let i = visitorKeys.length - 1; i >= 0; i--) {
 | |
|     const val = parent[visitorKeys[i]];
 | |
|     if (val === child) {
 | |
|       return true;
 | |
|     } else if (Array.isArray(val)) {
 | |
|       let j = val.length - 1;
 | |
|       while (j >= 0 && val[j] === null) j--;
 | |
|       return j >= 0 && val[j] === child;
 | |
|     } else if (val) {
 | |
|       return false;
 | |
|     }
 | |
|   }
 | |
|   return false;
 | |
| }
 | |
| 
 | |
| //# sourceMappingURL=index.js.map
 |