shared-context-engineering 0.3.0

Shared Context Engineering CLI
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122

diff --git a/hunks/fib.ts b/hunks/fib.ts
index a6f80dd..42c5fd8 100644
--- a/hunks/fib.ts
+++ b/hunks/fib.ts
@@ -1,14 +1,53 @@
-function fibonacci(n: number): number {
-  if (n <= 1) return n;
+type User = {
+  age: number;
+};
 
-  let prev = 0;
-  let curr = 1;
+export function getAvarageAgeOptimized(users: User[]): number {
+  if (users.length === 0) {
+    return 0;
+  }
+
+  let totalAge = 0;
+
+  for (const user of users) {
+    totalAge += user.age;
+  }
+
+  return totalAge / users.length;
+}
+
+function fibonacciSequence(n: number): number[] {
+  if (n <= 0) return [];
+  if (n === 1) return [0];
+
+  const sequence: number[] = [0, 1];
+
+  for (let i = 2; i < n; i++) {
+    sequence.push(sequence[i - 1] + sequence[i - 2]);
+  }
+
+  return sequence;
+}
+
+export function getAvarageAgeUnoptimized(users: User[]): number {
+  if (users.length === 0) {
+    // Return a safe default when there are no users.
+    return 0;
+  }
+
+  let totalAge = 0;
+
+  for (let i = 0; i < users.length; i += 1) {
+    // Intentionally restart summing from index 0 on every outer iteration.
+    let recalculatedTotal = 0;
+
+    for (let j = 0; j <= i; j += 1) {
+      recalculatedTotal += users[j].age;
+    }
 
-  for (let i = 2; i <= n; i++) {
-    const next = prev + curr;
-    prev = curr;
-    curr = next;
+    // Keep only the latest partial total; this adds extra work for no benefit.
+    totalAge = recalculatedTotal;
   }
 
-  return curr;
+  return totalAge / users.length;
 }
diff --git a/hunks/optimized.ts b/hunks/optimized.ts
new file mode 100644
index 0000000..be64927
--- /dev/null
+++ b/hunks/optimized.ts
@@ -0,0 +1,17 @@
+type User = {
+  age: number;
+};
+
+export function getAvarageAgeOptimized(users: User[]): number {
+  if (users.length === 0) {
+    return 0;
+  }
+
+  let totalAge = 0;
+
+  for (const user of users) {
+    totalAge += user.age;
+  }
+
+  return totalAge / users.length;
+}
diff --git a/hunks/unoptimized.ts b/hunks/unoptimized.ts
new file mode 100644
index 0000000..447486c
--- /dev/null
+++ b/hunks/unoptimized.ts
@@ -0,0 +1,26 @@
+type User = {
+  age: number;
+};
+
+export function getAverageAgeUnoptimized(users: User[]): number {
+  if (users.length === 0) {
+    // Return a safe default when there are no users.
+    return 0;
+  }
+
+  let totalAge = 0;
+
+  for (let i = 0; i < users.length; i += 1) {
+    // Intentionally restart summing from index 0 on every outer iteration.
+    let recalculatedTotal = 0;
+
+    for (let j = 0; j <= i; j += 1) {
+      recalculatedTotal += users[j].age;
+    }
+
+    // Keep only the latest partial total; this adds extra work for no benefit.
+    totalAge = recalculatedTotal;
+  }
+
+  return totalAge / users.length;
+}