aigroup-workflow 2.1.2 → 2.2.1

package/skills/go-rust-cpp/cpp-pro/references/templates.md

@@ -0,0 +1,357 @@
+# Template Metaprogramming
+
+## Variadic Templates
+
+```cpp
+#include <iostream>
+#include <utility>
+
+// Fold expressions (C++17)
+template<typename... Args>
+auto sum(Args... args) {
+    return (args + ...);  // Unary right fold
+}
+
+template<typename... Args>
+void print(Args&&... args) {
+    ((std::cout << args << ' '), ...);  // Binary left fold
+    std::cout << '\n';
+}
+
+// Recursive variadic template
+template<typename T>
+void log(T&& value) {
+    std::cout << value << '\n';
+}
+
+template<typename T, typename... Args>
+void log(T&& first, Args&&... rest) {
+    std::cout << first << ", ";
+    log(std::forward<Args>(rest)...);
+}
+
+// Parameter pack expansion
+template<typename... Types>
+struct TypeList {
+    static constexpr size_t size = sizeof...(Types);
+};
+
+template<typename... Args>
+auto make_tuple_advanced(Args&&... args) {
+    return std::tuple<std::decay_t<Args>...>(std::forward<Args>(args)...);
+}
+```
+
+## SFINAE and if constexpr
+
+```cpp
+#include <type_traits>
+
+// SFINAE with std::enable_if (older style)
+template<typename T>
+std::enable_if_t<std::is_integral_v<T>, T>
+double_value(T value) {
+    return value * 2;
+}
+
+template<typename T>
+std::enable_if_t<std::is_floating_point_v<T>, T>
+double_value(T value) {
+    return value * 2.0;
+}
+
+// Modern: if constexpr (C++17)
+template<typename T>
+auto process(T value) {
+    if constexpr (std::is_integral_v<T>) {
+        return value * 2;
+    } else if constexpr (std::is_floating_point_v<T>) {
+        return value * 2.0;
+    } else {
+        return value;
+    }
+}
+
+// Detection idiom
+template<typename T, typename = void>
+struct has_serialize : std::false_type {};
+
+template<typename T>
+struct has_serialize<T, std::void_t<decltype(std::declval<T>().serialize())>>
+    : std::true_type {};
+
+template<typename T>
+constexpr bool has_serialize_v = has_serialize<T>::value;
+
+// Use with if constexpr
+template<typename T>
+void save(const T& obj) {
+    if constexpr (has_serialize_v<T>) {
+        obj.serialize();
+    } else {
+        // Default serialization
+    }
+}
+```
+
+## Type Traits
+
+```cpp
+#include <type_traits>
+
+// Custom type traits
+template<typename T>
+struct remove_all_pointers {
+    using type = T;
+};
+
+template<typename T>
+struct remove_all_pointers<T*> {
+    using type = typename remove_all_pointers<T>::type;
+};
+
+template<typename T>
+using remove_all_pointers_t = typename remove_all_pointers<T>::type;
+
+// Conditional types
+template<bool Condition, typename T, typename F>
+struct conditional_type {
+    using type = T;
+};
+
+template<typename T, typename F>
+struct conditional_type<false, T, F> {
+    using type = F;
+};
+
+// Compile-time type selection
+template<size_t N>
+struct best_integral_type {
+    using type = std::conditional_t<N <= 8, uint8_t,
+                 std::conditional_t<N <= 16, uint16_t,
+                 std::conditional_t<N <= 32, uint32_t, uint64_t>>>;
+};
+
+// Check for member functions
+template<typename T, typename = void>
+struct has_reserve : std::false_type {};
+
+template<typename T>
+struct has_reserve<T, std::void_t<decltype(std::declval<T>().reserve(size_t{}))>>
+    : std::true_type {};
+```
+
+## CRTP (Curiously Recurring Template Pattern)
+
+```cpp
+// Static polymorphism with CRTP
+template<typename Derived>
+class Shape {
+public:
+    double area() const {
+        return static_cast<const Derived*>(this)->area_impl();
+    }
+
+    void draw() const {
+        static_cast<const Derived*>(this)->draw_impl();
+    }
+};
+
+class Circle : public Shape<Circle> {
+    double radius_;
+public:
+    Circle(double r) : radius_(r) {}
+
+    double area_impl() const {
+        return 3.14159 * radius_ * radius_;
+    }
+
+    void draw_impl() const {
+        std::cout << "Drawing circle\n";
+    }
+};
+
+class Rectangle : public Shape<Rectangle> {
+    double width_, height_;
+public:
+    Rectangle(double w, double h) : width_(w), height_(h) {}
+
+    double area_impl() const {
+        return width_ * height_;
+    }
+
+    void draw_impl() const {
+        std::cout << "Drawing rectangle\n";
+    }
+};
+
+// CRTP for mixin capabilities
+template<typename Derived>
+class Printable {
+public:
+    void print() const {
+        std::cout << static_cast<const Derived*>(this)->to_string() << '\n';
+    }
+};
+
+class User : public Printable<User> {
+    std::string name_;
+public:
+    User(std::string name) : name_(std::move(name)) {}
+
+    std::string to_string() const {
+        return "User: " + name_;
+    }
+};
+```
+
+## Template Template Parameters
+
+```cpp
+#include <vector>
+#include <list>
+#include <deque>
+
+// Template template parameter
+template<typename T, template<typename, typename> class Container>
+class Stack {
+    Container<T, std::allocator<T>> data_;
+
+public:
+    void push(const T& value) {
+        data_.push_back(value);
+    }
+
+    T pop() {
+        T value = data_.back();
+        data_.pop_back();
+        return value;
+    }
+
+    size_t size() const {
+        return data_.size();
+    }
+};
+
+// Usage with different containers
+Stack<int, std::vector> vector_stack;
+Stack<int, std::deque> deque_stack;
+Stack<int, std::list> list_stack;
+```
+
+## Compile-Time Computation
+
+```cpp
+#include <array>
+
+// Compile-time factorial
+constexpr int factorial(int n) {
+    return n <= 1 ? 1 : n * factorial(n - 1);
+}
+
+constexpr int fact_5 = factorial(5);  // Computed at compile time
+
+// Compile-time prime checking
+constexpr bool is_prime(int n) {
+    if (n < 2) return false;
+    for (int i = 2; i * i <= n; ++i) {
+        if (n % i == 0) return false;
+    }
+    return true;
+}
+
+// Generate compile-time array of primes
+template<size_t N>
+constexpr auto generate_primes() {
+    std::array<int, N> primes{};
+    int count = 0;
+    int candidate = 2;
+
+    while (count < N) {
+        if (is_prime(candidate)) {
+            primes[count++] = candidate;
+        }
+        ++candidate;
+    }
+
+    return primes;
+}
+
+constexpr auto first_10_primes = generate_primes<10>();
+```
+
+## Expression Templates
+
+```cpp
+// Lazy evaluation with expression templates
+template<typename E>
+class VecExpression {
+public:
+    double operator[](size_t i) const {
+        return static_cast<const E&>(*this)[i];
+    }
+
+    size_t size() const {
+        return static_cast<const E&>(*this).size();
+    }
+};
+
+class Vec : public VecExpression<Vec> {
+    std::vector<double> data_;
+
+public:
+    Vec(size_t n) : data_(n) {}
+
+    double operator[](size_t i) const { return data_[i]; }
+    double& operator[](size_t i) { return data_[i]; }
+    size_t size() const { return data_.size(); }
+
+    // Evaluate expression template
+    template<typename E>
+    Vec& operator=(const VecExpression<E>& expr) {
+        for (size_t i = 0; i < size(); ++i) {
+            data_[i] = expr[i];
+        }
+        return *this;
+    }
+};
+
+// Binary operation expression
+template<typename E1, typename E2>
+class VecSum : public VecExpression<VecSum<E1, E2>> {
+    const E1& lhs_;
+    const E2& rhs_;
+
+public:
+    VecSum(const E1& lhs, const E2& rhs) : lhs_(lhs), rhs_(rhs) {}
+
+    double operator[](size_t i) const {
+        return lhs_[i] + rhs_[i];
+    }
+
+    size_t size() const { return lhs_.size(); }
+};
+
+// Operator overload
+template<typename E1, typename E2>
+VecSum<E1, E2> operator+(const VecExpression<E1>& lhs,
+                         const VecExpression<E2>& rhs) {
+    return VecSum<E1, E2>(static_cast<const E1&>(lhs),
+                          static_cast<const E2&>(rhs));
+}
+
+// Usage: a = b + c + d  (no temporaries created!)
+```
+
+## Quick Reference
+
+| Technique | Use Case | Performance |
+|-----------|----------|-------------|
+| Variadic Templates | Variable arguments | Zero overhead |
+| SFINAE | Conditional compilation | Compile-time |
+| if constexpr | Type-based branching | Zero overhead |
+| CRTP | Static polymorphism | No vtable cost |
+| Expression Templates | Lazy evaluation | Eliminates temps |
+| Type Traits | Type introspection | Compile-time |
+| Fold Expressions | Parameter pack ops | Optimal |
+| Template Specialization | Type-specific impl | Zero overhead |

package/skills/go-rust-cpp/golang-pro/SKILL.md

@@ -0,0 +1,122 @@
+---
+name: golang-pro
+description: Implements concurrent Go patterns using goroutines and channels, designs and builds microservices with gRPC or REST, optimizes Go application performance with pprof, and enforces idiomatic Go with generics, interfaces, and robust error handling. Use when building Go applications requiring concurrent programming, microservices architecture, or high-performance systems. Invoke for goroutines, channels, Go generics, gRPC integration, CLI tools, benchmarks, or table-driven testing.
+license: MIT
+metadata:
+  author: https://github.com/Jeffallan
+  version: "1.1.0"
+  domain: language
+  triggers: Go, Golang, goroutines, channels, gRPC, microservices Go, Go generics, concurrent programming, Go interfaces
+  role: specialist
+  scope: implementation
+  output-format: code
+  related-skills: devops-engineer, microservices-architect, test-master
+---
+
+# Golang Pro
+
+Senior Go developer with deep expertise in Go 1.21+, concurrent programming, and cloud-native microservices. Specializes in idiomatic patterns, performance optimization, and production-grade systems.
+
+## Core Workflow
+
+1. **Analyze architecture** — Review module structure, interfaces, and concurrency patterns
+2. **Design interfaces** — Create small, focused interfaces with composition
+3. **Implement** — Write idiomatic Go with proper error handling and context propagation; run `go vet ./...` before proceeding
+4. **Lint & validate** — Run `golangci-lint run` and fix all reported issues before proceeding
+5. **Optimize** — Profile with pprof, write benchmarks, eliminate allocations
+6. **Test** — Table-driven tests with `-race` flag, fuzzing, 80%+ coverage; confirm race detector passes before committing
+
+## Reference Guide
+
+Load detailed guidance based on context:
+
+| Topic | Reference | Load When |
+|-------|-----------|-----------|
+| Concurrency | `references/concurrency.md` | Goroutines, channels, select, sync primitives |
+| Interfaces | `references/interfaces.md` | Interface design, io.Reader/Writer, composition |
+| Generics | `references/generics.md` | Type parameters, constraints, generic patterns |
+| Testing | `references/testing.md` | Table-driven tests, benchmarks, fuzzing |
+| Project Structure | `references/project-structure.md` | Module layout, internal packages, go.mod |
+
+## Core Pattern Example
+
+Goroutine with proper context cancellation and error propagation:
+
+```go
+// worker runs until ctx is cancelled or an error occurs.
+// Errors are returned via the errCh channel; the caller must drain it.
+func worker(ctx context.Context, jobs <-chan Job, errCh chan<- error) {
+    for {
+        select {
+        case <-ctx.Done():
+            errCh <- fmt.Errorf("worker cancelled: %w", ctx.Err())
+            return
+        case job, ok := <-jobs:
+            if !ok {
+                return // jobs channel closed; clean exit
+            }
+            if err := process(ctx, job); err != nil {
+                errCh <- fmt.Errorf("process job %v: %w", job.ID, err)
+                return
+            }
+        }
+    }
+}
+
+func runPipeline(ctx context.Context, jobs []Job) error {
+    ctx, cancel := context.WithTimeout(ctx, 30*time.Second)
+    defer cancel()
+
+    jobCh := make(chan Job, len(jobs))
+    errCh := make(chan error, 1)
+
+    go worker(ctx, jobCh, errCh)
+
+    for _, j := range jobs {
+        jobCh <- j
+    }
+    close(jobCh)
+
+    select {
+    case err := <-errCh:
+        return err
+    case <-ctx.Done():
+        return fmt.Errorf("pipeline timed out: %w", ctx.Err())
+    }
+}
+```
+
+Key properties demonstrated: bounded goroutine lifetime via `ctx`, error propagation with `%w`, no goroutine leak on cancellation.
+
+## Constraints
+
+### MUST DO
+- Use gofmt and golangci-lint on all code
+- Add context.Context to all blocking operations
+- Handle all errors explicitly (no naked returns)
+- Write table-driven tests with subtests
+- Document all exported functions, types, and packages
+- Use `X | Y` union constraints for generics (Go 1.18+)
+- Propagate errors with fmt.Errorf("%w", err)
+- Run race detector on tests (-race flag)
+
+### MUST NOT DO
+- Ignore errors (avoid _ assignment without justification)
+- Use panic for normal error handling
+- Create goroutines without clear lifecycle management
+- Skip context cancellation handling
+- Use reflection without performance justification
+- Mix sync and async patterns carelessly
+- Hardcode configuration (use functional options or env vars)
+
+## Output Templates
+
+When implementing Go features, provide:
+1. Interface definitions (contracts first)
+2. Implementation files with proper package structure
+3. Test file with table-driven tests
+4. Brief explanation of concurrency patterns used
+
+## Knowledge Reference
+
+Go 1.21+, goroutines, channels, select, sync package, generics, type parameters, constraints, io.Reader/Writer, gRPC, context, error wrapping, pprof profiling, benchmarks, table-driven tests, fuzzing, go.mod, internal packages, functional options