 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>
		
			
				
	
	
		
			115 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
			
		
		
	
	
			115 lines
		
	
	
		
			3.0 KiB
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
| 'use strict';
 | |
| /*
 | |
|  Copyright 2012-2015, Yahoo Inc.
 | |
|  Copyrights licensed under the New BSD License. See the accompanying LICENSE file for terms.
 | |
|  */
 | |
| function InsertionText(text, consumeBlanks) {
 | |
|     this.text = text;
 | |
|     this.origLength = text.length;
 | |
|     this.offsets = [];
 | |
|     this.consumeBlanks = consumeBlanks;
 | |
|     this.startPos = this.findFirstNonBlank();
 | |
|     this.endPos = this.findLastNonBlank();
 | |
| }
 | |
| 
 | |
| const WHITE_RE = /[ \f\n\r\t\v\u00A0\u2028\u2029]/;
 | |
| 
 | |
| InsertionText.prototype = {
 | |
|     findFirstNonBlank() {
 | |
|         let pos = -1;
 | |
|         const text = this.text;
 | |
|         const len = text.length;
 | |
|         let i;
 | |
|         for (i = 0; i < len; i += 1) {
 | |
|             if (!text.charAt(i).match(WHITE_RE)) {
 | |
|                 pos = i;
 | |
|                 break;
 | |
|             }
 | |
|         }
 | |
|         return pos;
 | |
|     },
 | |
|     findLastNonBlank() {
 | |
|         const text = this.text;
 | |
|         const len = text.length;
 | |
|         let pos = text.length + 1;
 | |
|         let i;
 | |
|         for (i = len - 1; i >= 0; i -= 1) {
 | |
|             if (!text.charAt(i).match(WHITE_RE)) {
 | |
|                 pos = i;
 | |
|                 break;
 | |
|             }
 | |
|         }
 | |
|         return pos;
 | |
|     },
 | |
|     originalLength() {
 | |
|         return this.origLength;
 | |
|     },
 | |
| 
 | |
|     insertAt(col, str, insertBefore, consumeBlanks) {
 | |
|         consumeBlanks =
 | |
|             typeof consumeBlanks === 'undefined'
 | |
|                 ? this.consumeBlanks
 | |
|                 : consumeBlanks;
 | |
|         col = col > this.originalLength() ? this.originalLength() : col;
 | |
|         col = col < 0 ? 0 : col;
 | |
| 
 | |
|         if (consumeBlanks) {
 | |
|             if (col <= this.startPos) {
 | |
|                 col = 0;
 | |
|             }
 | |
|             if (col > this.endPos) {
 | |
|                 col = this.origLength;
 | |
|             }
 | |
|         }
 | |
| 
 | |
|         const len = str.length;
 | |
|         const offset = this.findOffset(col, len, insertBefore);
 | |
|         const realPos = col + offset;
 | |
|         const text = this.text;
 | |
|         this.text = text.substring(0, realPos) + str + text.substring(realPos);
 | |
|         return this;
 | |
|     },
 | |
| 
 | |
|     findOffset(pos, len, insertBefore) {
 | |
|         const offsets = this.offsets;
 | |
|         let offsetObj;
 | |
|         let cumulativeOffset = 0;
 | |
|         let i;
 | |
| 
 | |
|         for (i = 0; i < offsets.length; i += 1) {
 | |
|             offsetObj = offsets[i];
 | |
|             if (
 | |
|                 offsetObj.pos < pos ||
 | |
|                 (offsetObj.pos === pos && !insertBefore)
 | |
|             ) {
 | |
|                 cumulativeOffset += offsetObj.len;
 | |
|             }
 | |
|             if (offsetObj.pos >= pos) {
 | |
|                 break;
 | |
|             }
 | |
|         }
 | |
|         if (offsetObj && offsetObj.pos === pos) {
 | |
|             offsetObj.len += len;
 | |
|         } else {
 | |
|             offsets.splice(i, 0, { pos, len });
 | |
|         }
 | |
|         return cumulativeOffset;
 | |
|     },
 | |
| 
 | |
|     wrap(startPos, startText, endPos, endText, consumeBlanks) {
 | |
|         this.insertAt(startPos, startText, true, consumeBlanks);
 | |
|         this.insertAt(endPos, endText, false, consumeBlanks);
 | |
|         return this;
 | |
|     },
 | |
| 
 | |
|     wrapLine(startText, endText) {
 | |
|         this.wrap(0, startText, this.originalLength(), endText);
 | |
|     },
 | |
| 
 | |
|     toString() {
 | |
|         return this.text;
 | |
|     }
 | |
| };
 | |
| 
 | |
| module.exports = InsertionText;
 |