[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"skill:01M6CWR1H8N5SWGK4CY88QHY2B":3,"skill-same:01M6CWR1H8N5SWGK4CY88QHY2B":64},{"skillNo":4,"name":5,"nameZh":6,"description":7,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":15,"categories":16,"keywords":22,"publishedAt":34,"linkOnly":35,"markdownContent":36,"markdownBody":37,"frontMatter":38,"refName":43,"commitSha":44,"skillDirectory":45,"forksCount":46,"repositoryHtmlUrl":47,"repositoryHomepageUrl":6,"ownerHtmlUrl":48,"ownerBlogUrl":6,"ownerDescription":6,"updatedAt":49,"install":50,"resources":63},"01M6CWR1H8N5SWGK4CY88QHY2B","Julia",null,"High-level, high-performance dynamic programming language for technical computing with JIT compilation.","ffsshhttiikk\u002Fopencode-agents-skills","ffsshhttiikk","https:\u002F\u002Favatars.githubusercontent.com\u002Fu\u002F226346827?v=4","01M6CWD9RR3Y7VRQX3MXYC8FYH","01M6CWD9WVPYAZW0J82G1VKGHY",3,"MIT","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fcomputer-science\u002Fjulia\u002FSKILL.md",[17],{"categoryNo":18,"categoryName":19,"taxonomyType":20,"taxonomyTypeDesc":21},"01JBSEEDCAT000000000000030","开发工程师","PROFESSION","适用职业",[5,23,24,25,26,27,28,29,30,31,32,33],"performance","machine learning","data science","programming language","jit","data","science","learning","programming","technical","language","2026-11-10 10:12:30",false,"---\nname: Julia\ndescription: High-level, high-performance dynamic programming language for technical computing with JIT compilation.\nlicense: MIT License\ncompatibility: Julia 1.8+\naudience: Scientific computing, data science, machine learning researchers\ncategory: Programming Languages\n---\n\n# Julia\n\n## What I do\n\nI am a high-level, dynamic programming language designed for technical computing, numerical analysis, and computational science. I was created by Jeff Bezanson, Stefan Karpinski, Viral B. Shah, and Alan Edelman, first released in 2012. I combine the ease of use of dynamic languages like Python with the performance of compiled languages like C. I feature multiple dispatch, JIT compilation (via LLVM), automatic differentiation, and native support for parallel and distributed computing. I am widely used in scientific computing, machine learning (Flux.jl, MLJ.jl), optimization (JuMP), and data analysis.\n\n## When to use me\n\nUse Julia when performing high-performance scientific computing, numerical simulation, optimization problems, machine learning research, data visualization, or when you need both interactive development and C-like performance.\n\n## Core Concepts\n\n- **Multiple Dispatch**: Functions can have different methods based on the types of all arguments, not just the receiver.\n- **JIT Compilation**: Code is compiled to native machine code at runtime using LLVM, combining interpreted feel with compiled speed.\n- **Type System**: Optional type annotations for performance and clarity, extensive parametric types.\n- **Multiple Return Values**: Functions can return multiple values as tuples, automatically unpacked.\n- **Metaprogramming**: Powerful macro system and expression manipulation like Lisp.\n- **Native Parallelism**: Built-in support for multi-threading, distributed computing, and GPU computing.\n- **Automatic Differentiation**: Packages like ForwardDiff and Zygote for gradient computation.\n- **Unicode Support**: Full Unicode support including mathematical symbols as operators (α = 1).\n- **Duck Typing with Type Stability**: Code works with any type that supports required operations.\n- **Performance Annotations**: @inbounds, @simd, @tturbo for fine-grained performance control.\n\n## Code Examples\n\n**Multiple Dispatch:**\n```julia\nabstract type Animal end\n\nstruct Dog \u003C: Animal\n    name::String\n    breed::String\nend\n\nstruct Cat \u003C: Animal\n    name::String\n    color::String\nend\n\nstruct Bird \u003C: Animal\n    name::String\n    species::String\nend\n\n# Multiple methods based on all argument types\nmake_sound(::Dog) = \"Woof!\"\nmake_sound(::Cat) = \"Meow!\"\nmake_sound(::Bird) = \"Tweet!\"\n\nfunction interact(a1::Animal, a2::Animal)\n    println(\"$(a1.name) and $(a2.name) interact\")\nend\n\nfunction interact(d::Dog, c::Cat)\n    println(\"$(d.name) the dog chases $(c.name) the cat!\")\nend\n\n# Method specialization based on all arguments\nfunction describe(a::Animal)\n    return \"$(a.name) is a $(typeof(a))\"\nend\n\nfunction describe(a::Dog)\n    return \"$(a.name) is a $(a.breed) dog\"\nend\n\ndog = Dog(\"Buddy\", \"Golden Retriever\")\ncat = Cat(\"Whiskers\", \"Orange\")\nbird = Bird(\"Tweety\", \"Canary\")\n\nprintln(make_sound(dog))\nprintln(make_sound(cat))\n\ninteract(dog, cat)\ninteract(dog, bird)\ninteract(cat, bird)\n```\n\n**Performance and Type Annotations:**\n```julia\n# Type-stable function (fast)\nfunction sum_even(numbers::AbstractVector{\u003C:Integer})\n    s = zero(eltype(numbers))\n    @inbounds for i in eachindex(numbers)\n        if iseven(numbers[i])\n            s += numbers[i]\n        end\n    end\n    return s\nend\n\n# Parametric types\nstruct Point{T\u003C:Real}\n    x::T\n    y::T\nend\n\n# Methods with parametric types\nBase.:+(p1::Point{T}, p2::Point{T}) where {T} = Point(p1.x + p2.x, p1.y + p2.y)\nBase.:-(p1::Point{T}, p2::Point{T}) where {T} = Point(p1.x - p2.x, p1.y - p2.y)\n\n# Type constraints\nfunction distance(p1::Point{T}, p2::Point{T})::T where {T\u003C:Real}\n    dx = p1.x - p2.x\n    dy = p1.y - p2.y\n    return sqrt(dx^2 + dy^2)\nend\n\n# Type piracy - avoid!\n# function Base.:+(a::Int, b::Int)\n#     error(\"Don't do this!\")\n# end\n\n# Composite types with inner constructors\nstruct Rational{T\u003C:Integer}\n    num::T\n    den::T\n    \n    function Rational{T}(num::T, den::T) where {T\u003C:Integer}\n        den == 0 && throw(ArgumentError(\"Denominator cannot be zero\"))\n        g = gcd(num, den)\n        new(num ÷ g, den ÷ g)\n    end\nend\n\n# Outer constructor\nRational(num::T, den::T) where {T\u003C:Integer} = Rational{T}(num, den)\n\np1 = Point(3.0, 4.0)\np2 = Point(1.0, 2.0)\nprintln(p1 + p2)\nprintln(distance(p1, p2))\n```\n\n**Data Science Workflow:**\n```julia\nusing DataFrames\nusing CSV\nusing Statistics\nusing StatsBase\n\n# Create DataFrame\ndf = DataFrame(\n    name = [\"Alice\", \"Bob\", \"Charlie\", \"Diana\", \"Eve\"],\n    age = [25, 30, 35, 28, 32],\n    department = [\"Engineering\", \"Sales\", \"Engineering\", \"Marketing\", \"Sales\"],\n    salary = [75000, 60000, 85000, 65000, 70000]\n)\n\n# Column operations\ndf.age_max = maximum(df.age)\ndf.salary_zscore = (df.salary .- mean(df.salary)) .\u002F std(df.salary)\n\n# Filter and select\nengineers = filter(row -> row.department == \"Engineering\", df)\nname_salary = select(df, :name, :salary)\n\n# Groupby and summarize\nby_dept = combine(groupby(df, :department), \n                  :salary => mean => :avg_salary,\n                  :age => mean => :avg_age,\n                  :name => length => :count)\n\n# Join\nbudgets = DataFrame(\n    department = [\"Engineering\", \"Sales\", \"Marketing\"],\n    budget = [500000, 300000, 200000]\n)\n\njoined = innerjoin(df, budgets, on = :department)\n\n# Statistics\ncor(df.age, df.salary)\ndescribe(df)\n\n# Multiple dispatch in data analysis\nfunction analyze_column(col::AbstractVector{\u003C:Number})\n    return (mean = mean(col), \n            std = std(col),\n            min = minimum(col),\n            max = maximum(col))\nend\n\nfunction analyze_column(col::AbstractVector{\u003C:String})\n    return (unique = unique(col),\n            counts = countmap(col),\n            nunique = length(unique(col)))\nend\n\nprintln(analyze_column(df.age))\nprintln(analyze_column(df.department))\n```\n\n**Parallel Computing:**\n```julia\nusing Distributed\nusing Base.Threads\n\n# Add worker processes\naddprocs(4)\n\n@everywhere function parallel_sum(n)\n    s = 0.0\n    for i in 1:n\n        s += sin(i) * cos(i)\n    end\n    return s\nend\n\n# Distributed computing\n@distributed (+) for i in 1:10000000\n    sin(i) * cos(i)\nend\n\n# Parallel map\npmap(x -> x^2, 1:1000)\n\n# Multi-threading\nfunction thread_sum(n)\n    @threads for i in 1:n\n        @atomic sum += i\n    end\n    return sum\nend\n\n# GPU computing (requires CUDA.jl)\n# using CUDA\n# a_gpu = cu([1, 2, 3, 4])\n# b_gpu = a_gpu .* 2\n\n# Performance benchmarks\nusing BenchmarkTools\n\nfunction benchmark_example(n)\n    s = zero(Float64)\n    @btime for i in 1:$n\n        $s += sin(i) * cos(i)\n    end\n    return s\nend\n\n# Memory allocation tracking\n@allocated 1 + 2\n\n# Code warming and JIT\n@time parallel_sum(1000000)\n@time parallel_sum(1000000)  # Faster after JIT\n```\n\n## Best Practices\n\n1. **Type Annotations for Performance**: Add type annotations to function signatures and struct fields for performance.\n2. **Avoid Global Scope**: Define functions inside modules; use const for global variables.\n3. **Use Multiple Dispatch**: Write functions with specific methods for different types to leverage dispatch.\n4. **Preallocate Outputs**: Preallocate arrays and vectors instead of growing them in loops.\n5. **Use @inbounds and @simd**: Add performance annotations when you're certain bounds are safe.\n6. **Use @time and @btime**: Profile code to identify bottlenecks before optimizing.\n7. **Use Revise.jl**: Use Revise for package development to see changes without restarting Julia.\n8. **Follow Performance Tips**: Read the official performance tips in Julia documentation.\n9. **Use Packages from Registry**: Use registered packages from JuliaHub for reliability.\n10. **Write Tests with Test.jl**: Use Test.jl for unit testing with @test, @testset macros.\n","# Julia\n\n## What I do\n\nI am a high-level, dynamic programming language designed for technical computing, numerical analysis, and computational science. I was created by Jeff Bezanson, Stefan Karpinski, Viral B. Shah, and Alan Edelman, first released in 2012. I combine the ease of use of dynamic languages like Python with the performance of compiled languages like C. I feature multiple dispatch, JIT compilation (via LLVM), automatic differentiation, and native support for parallel and distributed computing. I am widely used in scientific computing, machine learning (Flux.jl, MLJ.jl), optimization (JuMP), and data analysis.\n\n## When to use me\n\nUse Julia when performing high-performance scientific computing, numerical simulation, optimization problems, machine learning research, data visualization, or when you need both interactive development and C-like performance.\n\n## Core Concepts\n\n- **Multiple Dispatch**: Functions can have different methods based on the types of all arguments, not just the receiver.\n- **JIT Compilation**: Code is compiled to native machine code at runtime using LLVM, combining interpreted feel with compiled speed.\n- **Type System**: Optional type annotations for performance and clarity, extensive parametric types.\n- **Multiple Return Values**: Functions can return multiple values as tuples, automatically unpacked.\n- **Metaprogramming**: Powerful macro system and expression manipulation like Lisp.\n- **Native Parallelism**: Built-in support for multi-threading, distributed computing, and GPU computing.\n- **Automatic Differentiation**: Packages like ForwardDiff and Zygote for gradient computation.\n- **Unicode Support**: Full Unicode support including mathematical symbols as operators (α = 1).\n- **Duck Typing with Type Stability**: Code works with any type that supports required operations.\n- **Performance Annotations**: @inbounds, @simd, @tturbo for fine-grained performance control.\n\n## Code Examples\n\n**Multiple Dispatch:**\n```julia\nabstract type Animal end\n\nstruct Dog \u003C: Animal\n    name::String\n    breed::String\nend\n\nstruct Cat \u003C: Animal\n    name::String\n    color::String\nend\n\nstruct Bird \u003C: Animal\n    name::String\n    species::String\nend\n\n# Multiple methods based on all argument types\nmake_sound(::Dog) = \"Woof!\"\nmake_sound(::Cat) = \"Meow!\"\nmake_sound(::Bird) = \"Tweet!\"\n\nfunction interact(a1::Animal, a2::Animal)\n    println(\"$(a1.name) and $(a2.name) interact\")\nend\n\nfunction interact(d::Dog, c::Cat)\n    println(\"$(d.name) the dog chases $(c.name) the cat!\")\nend\n\n# Method specialization based on all arguments\nfunction describe(a::Animal)\n    return \"$(a.name) is a $(typeof(a))\"\nend\n\nfunction describe(a::Dog)\n    return \"$(a.name) is a $(a.breed) dog\"\nend\n\ndog = Dog(\"Buddy\", \"Golden Retriever\")\ncat = Cat(\"Whiskers\", \"Orange\")\nbird = Bird(\"Tweety\", \"Canary\")\n\nprintln(make_sound(dog))\nprintln(make_sound(cat))\n\ninteract(dog, cat)\ninteract(dog, bird)\ninteract(cat, bird)\n```\n\n**Performance and Type Annotations:**\n```julia\n# Type-stable function (fast)\nfunction sum_even(numbers::AbstractVector{\u003C:Integer})\n    s = zero(eltype(numbers))\n    @inbounds for i in eachindex(numbers)\n        if iseven(numbers[i])\n            s += numbers[i]\n        end\n    end\n    return s\nend\n\n# Parametric types\nstruct Point{T\u003C:Real}\n    x::T\n    y::T\nend\n\n# Methods with parametric types\nBase.:+(p1::Point{T}, p2::Point{T}) where {T} = Point(p1.x + p2.x, p1.y + p2.y)\nBase.:-(p1::Point{T}, p2::Point{T}) where {T} = Point(p1.x - p2.x, p1.y - p2.y)\n\n# Type constraints\nfunction distance(p1::Point{T}, p2::Point{T})::T where {T\u003C:Real}\n    dx = p1.x - p2.x\n    dy = p1.y - p2.y\n    return sqrt(dx^2 + dy^2)\nend\n\n# Type piracy - avoid!\n# function Base.:+(a::Int, b::Int)\n#     error(\"Don't do this!\")\n# end\n\n# Composite types with inner constructors\nstruct Rational{T\u003C:Integer}\n    num::T\n    den::T\n    \n    function Rational{T}(num::T, den::T) where {T\u003C:Integer}\n        den == 0 && throw(ArgumentError(\"Denominator cannot be zero\"))\n        g = gcd(num, den)\n        new(num ÷ g, den ÷ g)\n    end\nend\n\n# Outer constructor\nRational(num::T, den::T) where {T\u003C:Integer} = Rational{T}(num, den)\n\np1 = Point(3.0, 4.0)\np2 = Point(1.0, 2.0)\nprintln(p1 + p2)\nprintln(distance(p1, p2))\n```\n\n**Data Science Workflow:**\n```julia\nusing DataFrames\nusing CSV\nusing Statistics\nusing StatsBase\n\n# Create DataFrame\ndf = DataFrame(\n    name = [\"Alice\", \"Bob\", \"Charlie\", \"Diana\", \"Eve\"],\n    age = [25, 30, 35, 28, 32],\n    department = [\"Engineering\", \"Sales\", \"Engineering\", \"Marketing\", \"Sales\"],\n    salary = [75000, 60000, 85000, 65000, 70000]\n)\n\n# Column operations\ndf.age_max = maximum(df.age)\ndf.salary_zscore = (df.salary .- mean(df.salary)) .\u002F std(df.salary)\n\n# Filter and select\nengineers = filter(row -> row.department == \"Engineering\", df)\nname_salary = select(df, :name, :salary)\n\n# Groupby and summarize\nby_dept = combine(groupby(df, :department), \n                  :salary => mean => :avg_salary,\n                  :age => mean => :avg_age,\n                  :name => length => :count)\n\n# Join\nbudgets = DataFrame(\n    department = [\"Engineering\", \"Sales\", \"Marketing\"],\n    budget = [500000, 300000, 200000]\n)\n\njoined = innerjoin(df, budgets, on = :department)\n\n# Statistics\ncor(df.age, df.salary)\ndescribe(df)\n\n# Multiple dispatch in data analysis\nfunction analyze_column(col::AbstractVector{\u003C:Number})\n    return (mean = mean(col), \n            std = std(col),\n            min = minimum(col),\n            max = maximum(col))\nend\n\nfunction analyze_column(col::AbstractVector{\u003C:String})\n    return (unique = unique(col),\n            counts = countmap(col),\n            nunique = length(unique(col)))\nend\n\nprintln(analyze_column(df.age))\nprintln(analyze_column(df.department))\n```\n\n**Parallel Computing:**\n```julia\nusing Distributed\nusing Base.Threads\n\n# Add worker processes\naddprocs(4)\n\n@everywhere function parallel_sum(n)\n    s = 0.0\n    for i in 1:n\n        s += sin(i) * cos(i)\n    end\n    return s\nend\n\n# Distributed computing\n@distributed (+) for i in 1:10000000\n    sin(i) * cos(i)\nend\n\n# Parallel map\npmap(x -> x^2, 1:1000)\n\n# Multi-threading\nfunction thread_sum(n)\n    @threads for i in 1:n\n        @atomic sum += i\n    end\n    return sum\nend\n\n# GPU computing (requires CUDA.jl)\n# using CUDA\n# a_gpu = cu([1, 2, 3, 4])\n# b_gpu = a_gpu .* 2\n\n# Performance benchmarks\nusing BenchmarkTools\n\nfunction benchmark_example(n)\n    s = zero(Float64)\n    @btime for i in 1:$n\n        $s += sin(i) * cos(i)\n    end\n    return s\nend\n\n# Memory allocation tracking\n@allocated 1 + 2\n\n# Code warming and JIT\n@time parallel_sum(1000000)\n@time parallel_sum(1000000)  # Faster after JIT\n```\n\n## Best Practices\n\n1. **Type Annotations for Performance**: Add type annotations to function signatures and struct fields for performance.\n2. **Avoid Global Scope**: Define functions inside modules; use const for global variables.\n3. **Use Multiple Dispatch**: Write functions with specific methods for different types to leverage dispatch.\n4. **Preallocate Outputs**: Preallocate arrays and vectors instead of growing them in loops.\n5. **Use @inbounds and @simd**: Add performance annotations when you're certain bounds are safe.\n6. **Use @time and @btime**: Profile code to identify bottlenecks before optimizing.\n7. **Use Revise.jl**: Use Revise for package development to see changes without restarting Julia.\n8. **Follow Performance Tips**: Read the official performance tips in Julia documentation.\n9. **Use Packages from Registry**: Use registered packages from JuliaHub for reliability.\n10. **Write Tests with Test.jl**: Use Test.jl for unit testing with @test, @testset macros.\n",{"name":5,"license":39,"audience":40,"category":41,"description":7,"compatibility":42},"MIT License","Scientific computing, data science, machine learning researchers","Programming Languages","Julia 1.8+","main","5f7a3e453c98261f93d19a6a7de44ad8f7b72d41","computer-science\u002Fjulia",2,"https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk","2026-03-01 06:55:40",{"source":8,"skillName":5,"commands":51,"prompt":61,"zipAvailable":62},[52,55,58],{"tool":53,"command":54},"npx","npx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill Julia",{"tool":56,"command":57},"bunx","bunx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill Julia",{"tool":59,"command":60},"pnpm","pnpm dlx skills add ffsshhttiikk\u002Fopencode-agents-skills --skill Julia","安装技能，技能地址：https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fcomputer-science\u002Fjulia\u002FSKILL.md",true,[],[65,77,85,94,104,113],{"skillNo":66,"name":67,"nameZh":6,"description":68,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":69,"categories":70,"keywords":71,"publishedAt":34},"01M6CXT9TXDF79BWJTMQAPB49G","xamarin","Xamarin cross-platform development","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fxamarin\u002FSKILL.md",[],[67,72,73,74,75,76],"platform","cross-platform","mobile","opencode","development",{"skillNo":78,"name":79,"nameZh":6,"description":80,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":81,"categories":82,"keywords":83,"publishedAt":34},"01M6CXT8AD04MFYDA32VW3FKAG","wrangling","Data wrangling fundamentals","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwrangling\u002FSKILL.md",[],[79,84,75,29,28],"data wrangling",{"skillNo":86,"name":87,"nameZh":6,"description":88,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":89,"categories":90,"keywords":91,"publishedAt":34},"01M6CXT717GCN7SRRNPBDP4508","windows","Windows operating system administration and scripting","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwindows\u002FSKILL.md",[],[87,92,75,93],"system","scripting",{"skillNo":95,"name":96,"nameZh":6,"description":97,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":98,"categories":99,"keywords":100,"publishedAt":34},"01M6CXT54K794NMEM3XAPZZDKT","wide-column","Wide-column data model","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column\u002FSKILL.md",[],[101,102,75,103,28],"wide column","databases","model",{"skillNo":105,"name":106,"nameZh":6,"description":107,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":108,"categories":109,"keywords":110,"publishedAt":34},"01M6CXT28FMT2P4V9GZE67WA8E","wide-column-stores","Wide-column database stores","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwide-column-stores\u002FSKILL.md",[],[111,102,75,112],"wide column stores","database",{"skillNo":114,"name":115,"nameZh":6,"description":116,"descriptionZh":6,"repositoryFullName":8,"ownerLogin":9,"ownerAvatarUrl":10,"ownerAccountNo":11,"ownerDisplayName":6,"repositoryNo":12,"starsCount":13,"licenseSpdxId":14,"licenseFileUrl":6,"sourceHtmlUrl":117,"categories":118,"keywords":119,"publishedAt":34},"01M6CXT0D0M0Q4T2N7C2RX7DSN","websockets","WebSocket implementation and best practices","https:\u002F\u002Fgithub.com\u002Fffsshhttiikk\u002Fopencode-agents-skills\u002Fblob\u002Fmain\u002Fwebsockets\u002FSKILL.md",[],[115,120,121,122,75,123,124],"websocket","real-time","time","best practices","implementation"]