[{"data":1,"prerenderedAt":3399},["ShallowReactive",2],{"search-docs":3,"doc-\u002Fother\u002Fjava\u002Fcollection\u002Fmap-linkedhashmap":886},[4,8,12,16,20,24,28,32,36,40,44,48,52,56,60,64,68,72,76,80,84,88,92,96,100,104,108,112,116,120,124,128,132,136,140,144,148,152,156,159,162,165,169,172,175,178,182,186,190,194,198,202,206,210,214,218,222,226,230,234,238,242,246,250,254,258,262,266,269,273,277,281,285,288,291,294,298,301,304,307,310,313,316,319,322,325,329,332,336,340,344,348,352,356,359,362,365,368,371,374,377,380,383,386,389,393,396,399,402,405,408,411,414,417,420,424,428,432,435,438,442,446,450,454,458,462,466,470,474,477,480,483,487,491,494,497,500,504,507,511,515,518,521,524,527,530,533,536,539,542,545,548,551,554,557,560,563,566,569,572,575,579,583,587,591,595,599,603,606,610,614,617,620,623,626,629,633,637,640,643,646,649,652,655,658,661,664,667,670,673,676,679,682,685,688,691,694,697,700,703,706,709,712,716,720,724,728,732,736,740,744,748,752,756,760,764,768,772,775,779,783,787,790,793,796,799,802,805,808,811,814,818,822,825,829,832,835,838,841,844,848,851,854,858,862,865,869,873,876,879,882],{"path":5,"title":6,"description":7},"\u002Fabout\u002Fauthor","作者相关","只想纯粹的做一个程序员...",{"path":9,"title":10,"description":11},"\u002Fabout\u002Fjourney","心路历程","",{"path":13,"title":14,"description":15},"\u002Fai\u002Fagent\u002Fframeworks","Agent 框架","主流 Agent 框架：LangChain、LlamaIndex、AutoGen、CrewAI",{"path":17,"title":18,"description":19},"\u002Fai\u002Fagent\u002Fhooks","Agent Hooks 与自动化","Claude Agent 的 Hooks 生命周期、事件类型、典型自动化场景",{"path":21,"title":22,"description":23},"\u002Fai\u002Fagent\u002Fintroduction","AI Agent 概述","AI Agent 核心概念：感知、规划、执行、记忆",{"path":25,"title":26,"description":27},"\u002Fai\u002Fagent\u002Fpractice","Agent 实战","AI Agent 实战：构建自主任务执行系统",{"path":29,"title":30,"description":31},"\u002Fai\u002Fagent\u002Fsdk","Claude Agent SDK 开发","使用 Claude Agent SDK 构建自定义 AI Agent：架构、API、生命周期",{"path":33,"title":34,"description":35},"\u002Fai\u002Fagent\u002Fsubagents","Subagents 子代理","用 Subagents 分解复杂任务、并发执行、隔离上下文",{"path":37,"title":38,"description":39},"\u002Fai\u002Fagent\u002Ftool-use","工具调用","AI Agent 工具调用：Function Calling、Tool Use 原理与实践",{"path":41,"title":42,"description":43},"\u002Fai\u002Ffundamentals\u002Fdeep-learning","深度学习入门","深度学习基础知识：前向传播、反向传播、损失函数、优化器",{"path":45,"title":46,"description":47},"\u002Fai\u002Ffundamentals\u002Fml-basics","机器学习基础","机器学习核心概念：监督学习、无监督学习、强化学习",{"path":49,"title":50,"description":51},"\u002Fai\u002Ffundamentals\u002Fneural-networks","神经网络原理","神经网络架构：CNN、RNN、注意力机制",{"path":53,"title":54,"description":55},"\u002Fai\u002Fgetting-started","AI 学习路线","AI 技术学习路线图，从基础到实战的完整指南",{"path":57,"title":58,"description":59},"\u002Fai\u002Fllm\u002Ffine-tuning","模型微调","大模型微调技术：LoRA、QLoRA、全量微调、RLHF",{"path":61,"title":62,"description":63},"\u002Fai\u002Fllm\u002Fintroduction","大模型概述","大语言模型发展历程、核心能力与主流模型对比",{"path":65,"title":66,"description":67},"\u002Fai\u002Fllm\u002Flocal-deploy","本地部署","大模型本地部署：Ollama、vLLM、llama.cpp",{"path":69,"title":70,"description":71},"\u002Fai\u002Fllm\u002Ftransformer","Transformer 架构","Transformer 架构详解：自注意力机制、位置编码、多头注意力",{"path":73,"title":74,"description":75},"\u002Fai\u002Fmcp\u002Fclient","MCP Client 开发","MCP Client 开发指南：连接、调用、集成",{"path":77,"title":78,"description":79},"\u002Fai\u002Fmcp\u002Fdebugging","MCP 调试与排错","MCP Server 开发与集成过程中的常见问题、日志分析、诊断工具",{"path":81,"title":82,"description":83},"\u002Fai\u002Fmcp\u002Fintroduction","MCP 概述","Model Context Protocol 协议概述：架构、核心概念、应用场景",{"path":85,"title":86,"description":87},"\u002Fai\u002Fmcp\u002Fserver","MCP Server 开发","MCP Server 开发指南：资源、工具、提示词的实现",{"path":89,"title":90,"description":91},"\u002Fai\u002Fmcp\u002Ftools","MCP Tools 深入","深入理解 MCP Tools：与 Resources\u002FPrompts 的差异、Schema 设计、Annotations 与权限控制",{"path":93,"title":94,"description":95},"\u002Fai\u002Fprompt\u002Fadvanced","高级 Prompt 模式","高级 Prompt 设计模式：Tree-of-Thought、自我反思、多轮对话策略",{"path":97,"title":98,"description":99},"\u002Fai\u002Fprompt\u002Fbasics","Prompt 基础","Prompt Engineering 入门：基本概念、角色设定、输出格式控制",{"path":101,"title":102,"description":103},"\u002Fai\u002Fprompt\u002Ftechniques","提示词技巧","常用提示词技巧：Few-shot、Chain-of-Thought、ReAct",{"path":105,"title":106,"description":107},"\u002Fai\u002Frag\u002Fembedding","文本嵌入","文本嵌入模型：Embedding 原理、模型选择、相似度计算",{"path":109,"title":110,"description":111},"\u002Fai\u002Frag\u002Fintroduction","RAG 概述","检索增强生成（RAG）架构原理、优势与应用场景",{"path":113,"title":114,"description":115},"\u002Fai\u002Frag\u002Fpractice","RAG 实战","RAG 应用实战：文档问答系统、知识库搭建",{"path":117,"title":118,"description":119},"\u002Fai\u002Frag\u002Fvector-database","向量数据库","主流向量数据库对比：Milvus、Pinecone、Chroma、Weaviate",{"path":121,"title":122,"description":123},"\u002Fai\u002Fskills\u002Fbest-practices","Skill 最佳实践","编写高质量 Skill 的设计原则、常见陷阱与优化技巧",{"path":125,"title":126,"description":127},"\u002Fai\u002Fskills\u002Fcreating","创建自定义 Skill","从零编写一个可被 Agent 自动发现和调用的 Skill",{"path":129,"title":130,"description":131},"\u002Fai\u002Fskills\u002Fintroduction","Agent Skills 概述","Claude Agent Skills 概念、工作原理、与 Tools\u002FMCP 的区别",{"path":133,"title":134,"description":135},"\u002Fgolang\u002Fadvanced\u002Fconcurrency","Go - 并发深入","深入理解 Go 并发编程的核心机制。",{"path":137,"title":138,"description":139},"\u002Fgolang\u002Fadvanced\u002Fgc","Go - 垃圾回收","理解 Go 的垃圾回收机制，掌握 GC 调优方法。",{"path":141,"title":142,"description":143},"\u002Fgolang\u002Fadvanced\u002Fgmp","Go - GMP 调度模型","GMP 是 Go 运行时调度器的核心模型，理解它对于编写高性能 Go 程序至关重要。",{"path":145,"title":146,"description":147},"\u002Fgolang\u002Fadvanced\u002Fgo-concurrency","Go - 并发编程","Go 的并发是其核心特性之一，通过 Goroutine 和 Channel 实现。",{"path":149,"title":150,"description":151},"\u002Fgolang\u002Fadvanced\u002Fmemory","Go - 内存模型","理解 Go 的内存分配机制和内存模型。",{"path":153,"title":154,"description":155},"\u002Fgolang\u002Fadvanced\u002Fprofiling","Go - 性能分析","掌握 Go 的性能分析工具：pprof、trace、benchmark。",{"path":157,"title":158,"description":11},"\u002Fgolang\u002Fcore\u002Fgo-basic","Go - 基础语法",{"path":160,"title":161,"description":11},"\u002Fgolang\u002Fcore\u002Fgo-composite","Go - 复合类型",{"path":163,"title":164,"description":11},"\u002Fgolang\u002Fcore\u002Fgo-control","Go - 流程控制",{"path":166,"title":167,"description":168},"\u002Fgolang\u002Fcore\u002Fgo-error","Go - 错误处理","Go 使用显式的错误返回值来处理错误，而不是异常机制。",{"path":170,"title":171,"description":11},"\u002Fgolang\u002Fcore\u002Fgo-function","Go - 函数",{"path":173,"title":174,"description":11},"\u002Fgolang\u002Fcore\u002Fgo-install","Go - 环境搭建",{"path":176,"title":177,"description":11},"\u002Fgolang\u002Fcore\u002Fgo-interface","Go - 接口",{"path":179,"title":180,"description":181},"\u002Fgolang\u002Fcore\u002Fgo-module","Go - 包管理","Go Modules 是 Go 1.11 引入的官方依赖管理方案，Go 1.16 后成为默认模式。",{"path":183,"title":184,"description":185},"\u002Fgolang\u002Fdistributed\u002Fgrpc","Go - gRPC","gRPC 是 Google 开发的高性能 RPC 框架，使用 Protocol Buffers 作为序列化协议。",{"path":187,"title":188,"description":189},"\u002Fgolang\u002Fdistributed\u002Fmicroservice","Go - 微服务","微服务架构的核心组件：服务发现、负载均衡、熔断降级。",{"path":191,"title":192,"description":193},"\u002Fgolang\u002Fdistributed\u002Fmq","Go - 消息队列","使用 Go 操作 Kafka 和 RabbitMQ。",{"path":195,"title":196,"description":197},"\u002Fgolang\u002Fdistributed\u002Fredis","Go - Redis","使用 go-redis 操作 Redis，实现缓存、分布式锁等功能。",{"path":199,"title":200,"description":201},"\u002Fgolang\u002Fengineering\u002Fconfig","Go - 配置管理","使用 viper 进行配置管理，支持多种配置格式和配置中心。",{"path":203,"title":204,"description":205},"\u002Fgolang\u002Fengineering\u002Fdocker","Go - Docker 部署","使用 Docker 容器化部署 Go 应用。",{"path":207,"title":208,"description":209},"\u002Fgolang\u002Fengineering\u002Fkubernetes","Go - Kubernetes 部署","在 Kubernetes 上部署和管理 Go 应用。",{"path":211,"title":212,"description":213},"\u002Fgolang\u002Fengineering\u002Flogging","Go - 日志系统","使用 zap 和 logrus 构建高性能结构化日志系统。",{"path":215,"title":216,"description":217},"\u002Fgolang\u002Fengineering\u002Ftesting","Go - 单元测试","Go 内置了强大的测试框架，掌握测试是编写高质量代码的基础。",{"path":219,"title":220,"description":221},"\u002Fgolang\u002Fstdlib\u002Fbufio","bufio","在 Go 语言中，bufio 包提供了带缓冲的 I\u002FO 操作，能够提高读写性能。以下是一些常用的 bufio 包 API 及其详细说明：",{"path":223,"title":224,"description":225},"\u002Fgolang\u002Fstdlib\u002Fcontainer","container","在Go语言标准库中，container 包提供了几种常用的数据结构实现，这些数据结构对于高效地管理和操作数据非常有用。以下是 container 包中主要的数据结构：",{"path":227,"title":228,"description":229},"\u002Fgolang\u002Fstdlib\u002Fcrypto","crypto","在 Go 语言中，crypto 包提供了一组用于加密和解密的功能。以下是一些常用的 crypto 包及其子包的 API 及其详细说明：",{"path":231,"title":232,"description":233},"\u002Fgolang\u002Fstdlib\u002Fencoding-csv","encoding\u002Fcsv","在 Go 语言中，encoding\u002Fcsv 包提供了对 CSV（逗号分隔值）文件进行读写的功能。以下是一些常用的 encoding\u002Fcsv 包的 API 及其详细说明：",{"path":235,"title":236,"description":237},"\u002Fgolang\u002Fstdlib\u002Fencoding-json","encoding\u002Fjson","在 Go 语言中，encoding\u002Fjson 包提供了对 JSON 数据进行编码和解码的功能。以下是一些常用的 encoding\u002Fjson 包的 API 及其详细说明：",{"path":239,"title":240,"description":241},"\u002Fgolang\u002Fstdlib\u002Fencoding-xml","encoding\u002Fxml","在 Go 语言中，encoding\u002Fxml 包提供了对 XML 数据进行编码和解码的功能。以下是一些常用的 encoding\u002Fxml 包的 API 及其详细说明：",{"path":243,"title":244,"description":245},"\u002Fgolang\u002Fstdlib\u002Fflag","flag","在Go语言中，flag 包是用于处理命令行参数的标准库，它提供了一种简单而直接的方式来解析和使用命令行参数。下面是关于 flag 包的一些基本介绍和常用功能：",{"path":247,"title":248,"description":249},"\u002Fgolang\u002Fstdlib\u002Ffmt","fmt","在 Go 语言的标准库中，fmt 包是非常重要的，它提供了处理格式化输入和输出的基本工具。以下是一些 fmt 包内常用的API：",{"path":251,"title":252,"description":253},"\u002Fgolang\u002Fstdlib\u002Fhttp","net\u002Fhttp","在 Go 语言中，net\u002Fhttp 包提供了用于构建 HTTP 客户端和服务器的强大工具。以下是一些常用的 net\u002Fhttp 包的 API 及其详细说明：",{"path":255,"title":256,"description":257},"\u002Fgolang\u002Fstdlib\u002Fio","io","在 Go 语言中，io 包提供了基本的输入输出功能。以下是一些常用的 io 包的 API 及其详细说明：",{"path":259,"title":260,"description":261},"\u002Fgolang\u002Fstdlib\u002Flog","log","在 Go 语言中，log 包提供了简单的日志记录功能。以下是一些常用的 log 包的 API 及其详细说明：",{"path":263,"title":264,"description":265},"\u002Fgolang\u002Fstdlib\u002Fmath","math","在 Go 语言中，math 包提供了基本的数学函数和常量。以下是一些常用的 math 包的 API 及其详细说明：",{"path":267,"title":268,"description":11},"\u002Fgolang\u002Fstdlib\u002Fnet","net",{"path":270,"title":271,"description":272},"\u002Fgolang\u002Fstdlib\u002Fos","os","在Go语言中，os 包是一个非常重要且常用的标准库，它提供了与操作系统交互的功能，包括文件操作、环境变量管理、进程管理等。下面是一些 os 包中常用的功能和API：",{"path":274,"title":275,"description":276},"\u002Fgolang\u002Fstdlib\u002Fsort","order","在 Go 语言中，sort 包提供了对切片和用户定义的集合进行排序的函数。它实现了常见的排序算法，如快速排序（Quicksort）和堆排序（Heapsort），并且为自定义集合提供了接口，使得用户可以根据特定的需求进行排序。",{"path":278,"title":279,"description":280},"\u002Fgolang\u002Fstdlib\u002Fstrconv","strconv","在 Go 语言中，strconv 包提供了字符串和基本数据类型之间的转换函数，例如将整数转换为字符串、字符串转换为整数，以及其他类型之间的转换。这些功能非常有用，特别是在处理用户输入或从外部数据源读取数据时。",{"path":282,"title":283,"description":284},"\u002Fgolang\u002Fstdlib\u002Ftime","time","在 Go 语言中，time 包提供了处理时间和日期的功能。以下是一些常用的 time 包的 API 及其详细说明：",{"path":286,"title":287,"description":11},"\u002Fgolang\u002Fweb\u002Fgin\u002Ferror","Gin - 错误处理",{"path":289,"title":290,"description":11},"\u002Fgolang\u002Fweb\u002Fgin\u002Ffile","Gin - 文件处理",{"path":292,"title":293,"description":11},"\u002Fgolang\u002Fweb\u002Fgin\u002Fmiddleware","Gin - 中间件",{"path":295,"title":296,"description":297},"\u002Fgolang\u002Fweb\u002Fgin\u002Fquickstart","Gin - 快速开始","Gin 是目前最流行的 Go Web 框架，以高性能和简洁 API 著称。",{"path":299,"title":300,"description":11},"\u002Fgolang\u002Fweb\u002Fgin\u002Frequest","Gin - 请求处理",{"path":302,"title":303,"description":11},"\u002Fgolang\u002Fweb\u002Fgin\u002Fresponse","Gin - 响应处理",{"path":305,"title":306,"description":11},"\u002Fgolang\u002Fweb\u002Fgin\u002Frouter","Gin - 路由",{"path":308,"title":309,"description":11},"\u002Fgolang\u002Fweb\u002Fgin\u002Fvalidation","Gin - 参数校验",{"path":311,"title":312,"description":11},"\u002Fgolang\u002Fweb\u002Fgorm\u002Fassociation","GORM - 关联关系",{"path":314,"title":315,"description":11},"\u002Fgolang\u002Fweb\u002Fgorm\u002Fcrud","GORM - CRUD 操作",{"path":317,"title":318,"description":11},"\u002Fgolang\u002Fweb\u002Fgorm\u002Fmodel","GORM - 模型定义",{"path":320,"title":321,"description":11},"\u002Fgolang\u002Fweb\u002Fgorm\u002Fperformance","GORM - 日志与性能",{"path":323,"title":324,"description":11},"\u002Fgolang\u002Fweb\u002Fgorm\u002Fquery","GORM - 高级查询",{"path":326,"title":327,"description":328},"\u002Fgolang\u002Fweb\u002Fgorm\u002Fquickstart","GORM - 快速开始","GORM 是 Go 语言最流行的 ORM 库，功能强大，使用简单。",{"path":330,"title":331,"description":11},"\u002Fgolang\u002Fweb\u002Fgorm\u002Ftransaction","GORM - 事务与 Hook",{"path":333,"title":334,"description":335},"\u002Finterview\u002Fbasic","计算机基础面经","本章节汇总了面试中常见的通用技术概念，不局限于特定语言或数据库，是考察技术内功的关键考点。",{"path":337,"title":338,"description":339},"\u002Finterview\u002Fgolang","Golang 面试题","Go 语言面试高频考点，覆盖基础语法、数据结构、并发编程、内存管理、GC、调度器等核心知识。",{"path":341,"title":342,"description":343},"\u002Finterview\u002Fk8s","Kubernetes 面试题","Kubernetes（K8s）面试高频考点，覆盖架构原理、核心资源、网络存储、调度策略、运维监控等核心知识。",{"path":345,"title":346,"description":347},"\u002Finterview\u002Fmysql","MySQL 面试题","MySQL 数据库面试高频考点，覆盖索引、事务、锁、优化、主从复制等核心知识。",{"path":349,"title":350,"description":351},"\u002Finterview\u002Fredis","Redis 面试题","Redis 面试高频考点，覆盖数据结构、持久化、集群、缓存一致性、性能优化等核心知识。",{"path":353,"title":354,"description":355},"\u002Finterview\u002Frocketmq","RocketMQ 面试题","RocketMQ 面试高频考点，覆盖消息模型、可靠性、顺序消息、事务消息、存储与高可用等核心知识。",{"path":357,"title":358,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Flist-arraylist","List - ArrayList 源码解析",{"path":360,"title":361,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Flist-linkedlist","List - LinkedList 源码解析",{"path":363,"title":364,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Flist-stack","List - Satck源码解析",{"path":366,"title":367,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Flist-vectore","List - Vector 源码解析",{"path":369,"title":370,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Fmap-hashmap","Map - HashMap 源码解析",{"path":372,"title":373,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Fmap-linkedhashmap","Map - LinkedHashMap 源码解析",{"path":375,"title":376,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Fmap-treemap","Map - TreeMap 源码解析",{"path":378,"title":379,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Fqueue-deque","Queue - Deque 接口解析",{"path":381,"title":382,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Fqueue-queue","Queue - Queue 接口解析",{"path":384,"title":385,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Fset-hashset","Set - HashSet源码解析",{"path":387,"title":388,"description":11},"\u002Fother\u002Fjava\u002Fcollection\u002Fset-linkedhashset","Set - LinkedHashSet 源码解析",{"path":390,"title":391,"description":392},"\u002Fother\u002Fjava\u002Fcollection\u002Fset-treeset","Set - TreeSet源码解析","TreeSet 是一个 Set 集合接口的实现类，与 HashSet 类似，其底层也是通过维护了一个 TreeMap 对象来封装了一些实现方法，故本篇不再对 TreeSet 的底层原理进行详细说明，仅对常用 API 做简单介绍，如需了解 TreeMap 的底层实现原理，请移步 Map - HashMap 源码解析",{"path":394,"title":395,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fannotation","Java核心 - 注解",{"path":397,"title":398,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fbasic-grammar","Java核心 - 基础语法",{"path":400,"title":401,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fclass-and-object","Java核心 - 面向对象",{"path":403,"title":404,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fcommon-classes","Java核心 - 常用类",{"path":406,"title":407,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fexception","Java核心 - 异常处理",{"path":409,"title":410,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fgenerics","Java核心 - 泛型",{"path":412,"title":413,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fjdk-env-path","Java核心 - 环境搭建",{"path":415,"title":416,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Freflection","Java核心 - 反射",{"path":418,"title":419,"description":11},"\u002Fother\u002Fjava\u002Fcore\u002Fstring","Java核心 - String 字符串",{"path":421,"title":422,"description":423},"\u002Fother\u002Fjava\u002Fio\u002Fbuffer-stream","Java IO - 缓冲流","缓冲流是对基本流的包装，通过内置缓冲区减少系统调用次数，大幅提升读写效率。",{"path":425,"title":426,"description":427},"\u002Fother\u002Fjava\u002Fio\u002Fbyte-stream","Java IO - 字节流","字节流是 Java IO 中最基本的流类型，以字节（byte）为单位进行数据读写，可以处理任意类型的文件。",{"path":429,"title":430,"description":431},"\u002Fother\u002Fjava\u002Fio\u002Fchar-stream","Java IO - 字符流","字符流以字符为单位进行读写，专门用于处理文本文件。相比字节流，字符流能够正确处理字符编码，避免中文乱码问题。",{"path":433,"title":434,"description":11},"\u002Fother\u002Fjava\u002Fio\u002Ffile","Java IO - File 类",{"path":436,"title":437,"description":11},"\u002Fother\u002Fjava\u002Fio\u002Fio-stream-system","Java IO - IO流概述",{"path":439,"title":440,"description":441},"\u002Fother\u002Fjava\u002Fio\u002Fnio","Java IO - NIO","NIO（New IO）是 JDK 1.4 引入的新 IO 模型，提供了更高效的 IO 操作方式，支持非阻塞 IO 和多路复用。",{"path":443,"title":444,"description":445},"\u002Fother\u002Fjava\u002Fjvm\u002Fclass-loading","类加载机制","类加载机制是 JVM 将 .class 文件加载到内存，并对数据进行校验、转换解析和初始化，最终形成可被 JVM 直接使用的 Java 类型的过程。",{"path":447,"title":448,"description":449},"\u002Fother\u002Fjava\u002Fjvm\u002Fgarbage-collection","垃圾回收","垃圾回收（Garbage Collection，GC）是 JVM 自动管理内存的机制，负责回收不再使用的对象所占用的内存。",{"path":451,"title":452,"description":453},"\u002Fother\u002Fjava\u002Fjvm\u002Fjvm-memory","JVM 内存结构","JVM 在执行 Java 程序时，会把它管理的内存划分为若干个不同的数据区域。这些区域有各自的用途、创建和销毁时间。",{"path":455,"title":456,"description":457},"\u002Fother\u002Fjava\u002Fjvm\u002Fjvm-tuning","JVM 调优","JVM 调优是优化 Java 应用性能的重要手段，主要包括参数配置、性能监控和问题排查。",{"path":459,"title":460,"description":461},"\u002Fother\u002Fjava\u002Fthread\u002Fatomic","原子类","Java 原子类（Atomic Classes）提供了一种无锁的线程安全方式，基于 CAS（Compare-And-Swap）操作实现。",{"path":463,"title":464,"description":465},"\u002Fother\u002Fjava\u002Fthread\u002Fcompletable-future","CompletableFuture","CompletableFuture 是 JDK 8 引入的异步编程工具，实现了 Future 和 CompletionStage 接口，支持函数式编程和链式调用。",{"path":467,"title":468,"description":469},"\u002Fother\u002Fjava\u002Fthread\u002Fconcurrent-collections","并发集合","Java 并发包提供了多种线程安全的集合类，用于替代传统的同步集合（如 Collections.synchronizedList）。",{"path":471,"title":472,"description":473},"\u002Fother\u002Fjava\u002Fthread\u002Fconcurrent-utils","并发工具类","Java 并发包提供了多种实用的并发工具类，用于控制线程之间的协调与同步。",{"path":475,"title":476,"description":11},"\u002Fother\u002Fjava\u002Fthread\u002Fsynchronized-lock","同步机制",{"path":478,"title":479,"description":11},"\u002Fother\u002Fjava\u002Fthread\u002Fthread-basic","线程基础",{"path":481,"title":482,"description":11},"\u002Fother\u002Fjava\u002Fthread\u002Fthread-pool","线程池",{"path":484,"title":485,"description":486},"\u002Fother\u002Fspring-series\u002Fspring\u002Fannotations-beans","Spring - 基于注解管理Bean","从 Java 5 开始，Java 增加了对注解（Annotation）的支持，它是代码中的一种特殊标记，可以在编译、类加载和运行时被读取，执行相应的处理。开发人员可以通过注解在不改变原有代码和逻辑的情况下，在源代码中嵌入补充信息。",{"path":488,"title":489,"description":490},"\u002Fother\u002Fspring-series\u002Fspring\u002Fimplement-ioc","Spring - 原理手写IoC","Spring 框架的 IOC 是基于 Java 反射机制实现的，在学习手写 IoC 之前，你需要具备一定的 Java 反射相关的知识，参考本站内的 Java 教程。",{"path":492,"title":493,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fintroduction-case","Spring - 入门案例",{"path":495,"title":496,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-aop","Spring - 面向切面AOP",{"path":498,"title":499,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-aot","Spring - AOT提前编译",{"path":501,"title":502,"description":503},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-data-validation","Spring - 数据校验","在开发中，我们经常遇到参数校验的需求，比如用户注册的时候，要校验用户名不能为空、用户名长度不超过20个字符、手机号是合法的手机号格式等等。如果使用普通方式，我们会把校验的代码和真正的业务处理逻辑耦合在一起，而且如果未来要新增一种校验逻辑也需要在修改多个地方。而spring validation允许通过注解的方式来定义对象校验规则，把校验和业务逻辑分离开，让代码编写更加方便。Spring Validation其实就是对Hibernate Validator进一步的封装，方便在Spring中使用。",{"path":505,"title":506,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-i18n","Spring - 国际化i18n",{"path":508,"title":509,"description":510},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-ioc","Spring - IOC容器","IoC 是 Inversion of Control 的简写，译为“控制反转”，它不是一门技术，而是一种设计思想，是一个重要的面向对象编程法则，能够指导我们如何设计出松耦合、更优良的程序。",{"path":512,"title":513,"description":514},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-junit","Spring - 单元测试JUnit","在之前的测试方法中，几乎都能看到以下的两行代码：",{"path":516,"title":517,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-resources","Spring - 资源操作",{"path":519,"title":520,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-summarize","Spring - Spring概述",{"path":522,"title":523,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fspring-transaction","Spring - 事务",{"path":525,"title":526,"description":11},"\u002Fother\u002Fspring-series\u002Fspring\u002Fxml-beans","Spring - 基于XML管理Bean",{"path":528,"title":529,"description":11},"\u002Fother\u002Fspring-series\u002Fspringboot\u002Fspringboot-config","SpringBoot - 配置详解",{"path":531,"title":532,"description":11},"\u002Fother\u002Fspring-series\u002Fspringboot\u002Fspringboot-data","SpringBoot - 数据访问",{"path":534,"title":535,"description":11},"\u002Fother\u002Fspring-series\u002Fspringboot\u002Fspringboot-quickstart","SpringBoot - 快速入门",{"path":537,"title":538,"description":11},"\u002Fother\u002Fspring-series\u002Fspringboot\u002Fspringboot-web","SpringBoot - Web 开发",{"path":540,"title":541,"description":11},"\u002Fother\u002Fspring-series\u002Fspringcloud\u002Fspringcloud-config","SpringCloud - 配置中心",{"path":543,"title":544,"description":11},"\u002Fother\u002Fspring-series\u002Fspringcloud\u002Fspringcloud-discovery","SpringCloud - 服务注册与发现",{"path":546,"title":547,"description":11},"\u002Fother\u002Fspring-series\u002Fspringcloud\u002Fspringcloud-feign","SpringCloud - 服务调用",{"path":549,"title":550,"description":11},"\u002Fother\u002Fspring-series\u002Fspringcloud\u002Fspringcloud-gateway","SpringCloud - 服务网关",{"path":552,"title":553,"description":11},"\u002Fother\u002Fspring-series\u002Fspringcloud\u002Fspringcloud-introduction","SpringCloud - 微服务概述",{"path":555,"title":556,"description":11},"\u002Fother\u002Fspring-series\u002Fspringcloud\u002Fspringcloud-sentinel","SpringCloud - 服务保护",{"path":558,"title":559,"description":11},"\u002Fother\u002Fspring-series\u002Fspringmvc\u002Fspringmvc-databind","SpringMVC - 数据绑定与转换",{"path":561,"title":562,"description":11},"\u002Fother\u002Fspring-series\u002Fspringmvc\u002Fspringmvc-exception","SpringMVC - 异常处理",{"path":564,"title":565,"description":11},"\u002Fother\u002Fspring-series\u002Fspringmvc\u002Fspringmvc-interceptor","SpringMVC - 拦截器",{"path":567,"title":568,"description":11},"\u002Fother\u002Fspring-series\u002Fspringmvc\u002Fspringmvc-introduction","SpringMVC - 简介与环境搭建",{"path":570,"title":571,"description":11},"\u002Fother\u002Fspring-series\u002Fspringmvc\u002Fspringmvc-request","SpringMVC - 请求处理",{"path":573,"title":574,"description":11},"\u002Fother\u002Fspring-series\u002Fspringmvc\u002Fspringmvc-response","SpringMVC - 响应处理",{"path":576,"title":577,"description":578},"\u002Fproject\u002Frocket-leaf\u002Farchitecture","项目架构","Rocket-Leaf 的目录结构、模块划分、数据流向，以及各层之间的依赖关系。",{"path":580,"title":581,"description":582},"\u002Fproject\u002Frocket-leaf\u002Fbackend-layers","后端分层设计","Rocket-Leaf 的 model \u002F rocketmq \u002F service 三层结构，以及服务之间的依赖关系与设计取舍。",{"path":584,"title":585,"description":586},"\u002Fproject\u002Frocket-leaf\u002Fclient-manager","RocketMQ 客户端管理器","AdminClientManager 的多客户端池、默认连接懒加载、自动重连重试的设计与实现。",{"path":588,"title":589,"description":590},"\u002Fproject\u002Frocket-leaf\u002Fencryption","连接信息加密存储","AES-256-GCM + SHA-256 字段级派生密钥的实现，以及如何在不破坏兼容性的前提下为历史明文数据做透明迁移。",{"path":592,"title":593,"description":594},"\u002Fproject\u002Frocket-leaf\u002Ffrontend","前端结构与类型绑定","React + Vite 目录组织、自动生成的 Wails 绑定、api 薄封装与自定义 hooks 的职责划分。",{"path":596,"title":597,"description":598},"\u002Fproject\u002Frocket-leaf","项目简介","Rocket-Leaf 是一款基于 Wails v3 构建的跨平台 RocketMQ 桌面管理客户端，Go 后端 + React 前端。本文档系列拆解它的架构与关键实现。",{"path":600,"title":601,"description":602},"\u002Fproject\u002Frocket-leaf\u002Fwails-v3","Wails v3 入门","Wails v3 的核心概念、Service 绑定机制，以及 Rocket-Leaf 是如何用它把 Go 后端和 React 前端打通的。",{"path":604,"title":605,"description":11},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-basic","Docker - 入门基础",{"path":607,"title":608,"description":609},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-compose","Docker - Compose","在部署应用时，常常使用到不止一个容器，那么在部署容器的时候就需要一个一个进行部署，这样的部署过程也相对来说比较繁琐复杂，也容易出问题，那么有没有一种更为简单的方法呢？",{"path":611,"title":612,"description":613},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-container-connection","Docker - 容器互联","在上一个章节中我们学习了 Docker 容器的端口映射，可以将 Docker 容器和本地以及网络中的端口进行连接起来。",{"path":615,"title":616,"description":11},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-dockerfile","Docker - Dockerfile",{"path":618,"title":619,"description":11},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-helloworld","Docker - HelloWorld",{"path":621,"title":622,"description":11},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-install","Docker - 安装",{"path":624,"title":625,"description":11},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-introduce","Docker - 简介",{"path":627,"title":628,"description":11},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-object","Docker - 镜像、容器、仓库",{"path":630,"title":631,"description":632},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-warehouse","Docker - 仓库管理","仓库是集中存放资源的地方，代码仓库是存放代码的，那么Docker 中的仓库就是存放 Docker 镜像的。",{"path":634,"title":635,"description":636},"\u002Ftutorials\u002Fcloud\u002Fdocker\u002Fdocker-web-containers","Docker - WEB应用实例","在之前的章节中，仅对普通容器进行了演示，但在实际中常常使用到 Docker 容器中的 WEB 应用程序。",{"path":638,"title":639,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-config","Kubernetes - ConfigMap 与 Secret",{"path":641,"title":642,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-helm","Kubernetes - Helm 包管理",{"path":644,"title":645,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-install","Kubernetes - 集群安装",{"path":647,"title":648,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-introduction","Kubernetes - 简介与架构",{"path":650,"title":651,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-kubectl","Kubernetes - kubectl 命令行工具",{"path":653,"title":654,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-monitoring","Kubernetes - 监控与日志",{"path":656,"title":657,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-network-security","Kubernetes - 网络与安全",{"path":659,"title":660,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-service","Kubernetes - Service 与 Ingress",{"path":662,"title":663,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-storage","Kubernetes - 持久化存储",{"path":665,"title":666,"description":11},"\u002Ftutorials\u002Fcloud\u002Fkubernetes\u002Fk8s-workload","Kubernetes - 工作负载资源",{"path":668,"title":669,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-bash","Linux - Bash 基础语法",{"path":671,"title":672,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-file-directory","Linux - 文件与目录操作",{"path":674,"title":675,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-network","Linux - 网络配置",{"path":677,"title":678,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-package","Linux - 软件包管理",{"path":680,"title":681,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-process","Linux - 进程管理",{"path":683,"title":684,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-scripts","Linux - 常用脚本示例",{"path":686,"title":687,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-service","Linux - 服务管理",{"path":689,"title":690,"description":11},"\u002Ftutorials\u002Fcloud\u002Flinux\u002Flinux-user-permission","Linux - 用户与权限管理",{"path":692,"title":693,"description":11},"\u002Ftutorials\u002Fcloud\u002Fnginx\u002Fnginx-https","Nginx - HTTPS 配置",{"path":695,"title":696,"description":11},"\u002Ftutorials\u002Fcloud\u002Fnginx\u002Fnginx-install","Nginx - 安装与配置",{"path":698,"title":699,"description":11},"\u002Ftutorials\u002Fcloud\u002Fnginx\u002Fnginx-loadbalance","Nginx - 负载均衡",{"path":701,"title":702,"description":11},"\u002Ftutorials\u002Fcloud\u002Fnginx\u002Fnginx-optimization","Nginx - 性能优化",{"path":704,"title":705,"description":11},"\u002Ftutorials\u002Fcloud\u002Fnginx\u002Fnginx-proxy","Nginx - 反向代理",{"path":707,"title":708,"description":11},"\u002Ftutorials\u002Fcloud\u002Fnginx\u002Fnginx-static","Nginx - 静态资源服务",{"path":710,"title":711,"description":11},"\u002Ftutorials\u002Fcloud\u002Fnginx\u002Fnginx-vhost","Nginx - 虚拟主机配置",{"path":713,"title":714,"description":715},"\u002Ftutorials\u002Fdatabase\u002Fmysql\u002Fmysql-architecture","MySQL 高可用架构","主从复制、读写分离、分库分表。",{"path":717,"title":718,"description":719},"\u002Ftutorials\u002Fdatabase\u002Fmysql\u002Fmysql-index","MySQL 索引","索引是帮助 MySQL 高效获取数据的有序数据结构。",{"path":721,"title":722,"description":723},"\u002Ftutorials\u002Fdatabase\u002Fmysql\u002Fmysql-lock","MySQL 锁","锁用于解决并发访问时的数据一致性问题。",{"path":725,"title":726,"description":727},"\u002Ftutorials\u002Fdatabase\u002Fmysql\u002Fmysql-optimize","MySQL 性能优化","SQL 优化是后端开发必备技能。",{"path":729,"title":730,"description":731},"\u002Ftutorials\u002Fdatabase\u002Fmysql\u002Fmysql-transaction","MySQL 事务","事务是一组不可分割的操作，要么全部成功，要么全部失败。",{"path":733,"title":734,"description":735},"\u002Ftutorials\u002Fdatabase\u002Fmysql\u002Fsql-advanced","SQL 进阶","多表查询、子查询、函数、视图、存储过程。",{"path":737,"title":738,"description":739},"\u002Ftutorials\u002Fdatabase\u002Fmysql\u002Fsql-basic","SQL 基础","SQL（Structured Query Language）是操作关系型数据库的标准语言。",{"path":741,"title":742,"description":743},"\u002Ftutorials\u002Fdatabase\u002Fredis\u002Fredis-advanced","Redis 进阶功能","事务、发布订阅、Lua 脚本、Pipeline。",{"path":745,"title":746,"description":747},"\u002Ftutorials\u002Fdatabase\u002Fredis\u002Fredis-basic","Redis 基础","Redis 安装配置与基本命令。",{"path":749,"title":750,"description":751},"\u002Ftutorials\u002Fdatabase\u002Fredis\u002Fredis-cluster","Redis 高可用","主从复制、哨兵、Cluster 集群。",{"path":753,"title":754,"description":755},"\u002Ftutorials\u002Fdatabase\u002Fredis\u002Fredis-datatype","Redis 数据类型","Redis 5 种基本数据类型 + 4 种特殊类型。",{"path":757,"title":758,"description":759},"\u002Ftutorials\u002Fdatabase\u002Fredis\u002Fredis-optimize","Redis 性能优化","内存优化、缓存问题、最佳实践。",{"path":761,"title":762,"description":763},"\u002Ftutorials\u002Fdatabase\u002Fredis\u002Fredis-persistence","Redis 持久化","Redis 提供 RDB 和 AOF 两种持久化方式。",{"path":765,"title":766,"description":767},"\u002Ftutorials\u002Fdatabase\u002Fredis\u002Fredis-principle","Redis 底层原理","数据结构、线程模型、网络模型。",{"path":769,"title":770,"description":771},"\u002Ftutorials\u002Fdev-idea\u002Fdesign-patterns\u002Fbehaiver-patterns\u002Fobserver-pattern","观察者模式","观察者模式属于行为型模式，定义了对象之间的一对多的依赖关系，在这种模式中，当一个对象的状态发生变化时，所有依赖于它的对象都会得到通知，并且执行相关操作。观察者模式又被成为“发布—订阅模式”，即发布者发生改变后，会通知所有订阅者。",{"path":773,"title":774,"description":11},"\u002Ftutorials\u002Fdev-idea\u002Fdesign-patterns\u002Fcreate-patterns\u002Ffactory-pattern","工厂模式",{"path":776,"title":777,"description":778},"\u002Ftutorials\u002Fdev-idea\u002Fdesign-patterns\u002Fcreate-patterns\u002Fsingleton-pattern","单例模式","单例模式是最常用的设计模式之一，他可以保证在整个应用中，某个类只存在一个实例化对象，即全局使用到该类的只有一个对象，这种模式在需要限制某些类的实例数量时非常有用，通常全局只需要一个该对象即可，如一些配置文件映射对象、数据库连接对象等。",{"path":780,"title":781,"description":782},"\u002Ftutorials\u002Fdev-idea\u002Fdesign-patterns\u002Fstructural-patterns\u002Fadapter-pattern","适配器模式","适配器模式是一种结构型模式，可以将一个类的接口转换成客户端所期望的另一种接口，适配器模式可以帮助开发人员在不修改现有代码的情况下，将不兼容的类组合在一起。",{"path":784,"title":785,"description":786},"\u002Ftutorials\u002Fdev-tools\u002Fgit\u002Fgit-basic-operations","Git 创建版本库","在 Git 上创建版本库有两种方式，一种是直接拷贝远程 Git 仓库到本地，另外一种是我们自己创建本地的版本库。",{"path":788,"title":789,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fgit\u002Fgit-branch-manage","Git 分支管理",{"path":791,"title":792,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fgit\u002Fgit-content-operations","Git 仓库内容操作",{"path":794,"title":795,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fgit\u002Fgit-introduce-install","Git 介绍和安装",{"path":797,"title":798,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fgit\u002Fgit-remote-manage","Git 远程管理",{"path":800,"title":801,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fgit\u002Fgit-workspace-index-repo","Git 工作原理",{"path":803,"title":804,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fhomebrew","HomeBrew 教程",{"path":806,"title":807,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fidea\u002Fshortcuts","快捷键",{"path":809,"title":810,"description":11},"\u002Ftutorials\u002Fdev-tools\u002Fmaven\u002Fintroduce-install-config","Maven - 介绍、安装、配置",{"path":812,"title":813,"description":11},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fbasic-knowledge","2. 基础知识",{"path":815,"title":816,"description":817},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fcomponent-communication","9. 组件通信","在前面的章节内，介绍了 Vue 中最核心的内容——组件的介绍和使用，和 Java 等编程语言相反，组件并不近似于这些变成语言中的类，类可以通过类或者其实例化的对象来相互交互，但 Vue 组件之间的作用域是相互独立的，这就意味着不同组件之间的数据无法相互引用。",{"path":819,"title":820,"description":821},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fcomputed","4. 计算属性","虽然直接在模板中使用表达式方便，但是如果在模板中添加很多逻辑，会让模板变的臃肿且难维护，耦合度较高。有没有一种简单的方式来实现呢？答案是有的。",{"path":823,"title":824,"description":11},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fcreate-vue-project","1. 环境搭建及安装",{"path":826,"title":827,"description":828},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Flife-cycle","6. 生命周期","生命周期是指组件从创建、挂载、更新到销毁的整个过程中所经历的一系列阶段。在 Vue 中，每个组件都有自己的生命周期，可以通过生命周期钩子函数来监听和处理组件在不同阶段的行为和状态。",{"path":830,"title":831,"description":11},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fother-api","10. 其他 API",{"path":833,"title":834,"description":11},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fpinia","8. Pinia",{"path":836,"title":837,"description":11},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Frouter","7. 路由",{"path":839,"title":840,"description":11},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Ftemplate-grammar","3. 指令及模板语法",{"path":842,"title":843,"description":11},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fvue3-new-component","11. Vue3 新组件",{"path":845,"title":846,"description":847},"\u002Ftutorials\u002Ffront-end\u002Fvue3\u002Fwatch","5. 监视","Watch 是 Vue 提供的一个用于监视响应式数据变化并执行相应操作的 API，能够对响应式数据的变化做出一些操作的功能。Vue3 中的 Watch 支持多种用法，包括监视响应式对象、ref 对象、数组、函数等。",{"path":849,"title":850,"description":11},"\u002Ftutorials\u002Fmq\u002Fkafka\u002Fkafka-introduction","Kafka 简介与安装",{"path":852,"title":853,"description":11},"\u002Ftutorials\u002Fmq\u002Fkafka\u002Fkafka-producer-consumer","Kafka 生产者与消费者",{"path":855,"title":856,"description":857},"\u002Ftutorials\u002Fmq\u002Fkafka\u002Fkafka-springboot","Spring Boot 整合 Kafka","Spring Kafka 提供了对 Apache Kafka 的便捷集成。",{"path":859,"title":860,"description":861},"\u002Ftutorials\u002Fmq\u002Frabbitmq\u002Frabbitmq-exchange","RabbitMQ Exchange 详解","Exchange（交换机）是 RabbitMQ 的核心组件，负责接收生产者发送的消息，并根据规则将消息路由到一个或多个队列。",{"path":863,"title":864,"description":11},"\u002Ftutorials\u002Fmq\u002Frabbitmq\u002Frabbitmq-introduction","RabbitMQ 简介与安装",{"path":866,"title":867,"description":868},"\u002Ftutorials\u002Fmq\u002Frabbitmq\u002Frabbitmq-reliability","RabbitMQ 消息可靠性","消息可靠性是消息队列的核心要求，RabbitMQ 提供了多种机制来保证消息不丢失。",{"path":870,"title":871,"description":872},"\u002Ftutorials\u002Fmq\u002Frabbitmq\u002Frabbitmq-springboot","Spring Boot 整合 RabbitMQ","Spring AMQP 提供了对 RabbitMQ 的便捷集成，大大简化了开发工作。",{"path":874,"title":875,"description":11},"\u002Ftutorials\u002Fmq\u002Frocketmq\u002Frocketmq-client","RocketMQ 客户端使用",{"path":877,"title":878,"description":11},"\u002Ftutorials\u002Fmq\u002Frocketmq\u002Frocketmq-concepts","RocketMQ 核心概念",{"path":880,"title":881,"description":11},"\u002Ftutorials\u002Fmq\u002Frocketmq\u002Frocketmq-installation","RocketMQ 安装部署",{"path":883,"title":884,"description":885},"\u002Ftutorials\u002Fmq\u002Frocketmq\u002Frocketmq-message-type","RocketMQ 消息类型","RocketMQ 支持多种消息类型，满足不同业务场景需求。",{"id":887,"title":373,"body":888,"description":11,"extension":3394,"meta":3395,"navigation":1005,"path":372,"seo":3396,"stem":3397,"__hash__":3398},"docs\u002Fother\u002Fjava\u002Fcollection\u002Fmap-linkedhashmap.md",{"type":889,"value":890,"toc":3373},"minimark",[891,895,899,902,931,934,937,948,952,955,1237,1240,1245,1248,1393,1396,1501,1504,1694,1697,1700,1917,1921,2332,2335,2517,2521,2524,2581,2585,2588,2769,2772,2978,2981,2985,3105,3108,3254,3258,3335,3338,3369],[892,893,894],"h2",{"id":894},"介绍",[896,897,898],"p",{},"LinkedHashMap 是 HashMap 的子类，在 HashMap 的基础上维护了一个双向链表，用于记录元素的插入顺序或访问顺序。因此 LinkedHashMap 既具有 HashMap 的高效查找能力，又能保持元素的顺序。",[896,900,901],{},"LinkedHashMap 的特点：",[903,904,905,913,919,925],"ul",{},[906,907,908,912],"li",{},[909,910,911],"strong",{},"有序性","：可以按照插入顺序或访问顺序遍历元素",[906,914,915,918],{},[909,916,917],{},"继承 HashMap","：拥有 HashMap 的所有特性",[906,920,921,924],{},[909,922,923],{},"支持 LRU","：可用于实现 LRU（最近最少使用）缓存",[906,926,927,930],{},[909,928,929],{},"非线程安全","：与 HashMap 一样，不是线程安全的",[892,932,933],{"id":933},"数据结构",[896,935,936],{},"LinkedHashMap 在 HashMap 的基础上，增加了双向链表来维护顺序：",[938,939,945],"pre",{"className":940,"code":942,"language":943,"meta":944},[941],"language-text","flowchart LR\n    subgraph Table[\"HashMap 结构\"]\n        T0[\"table[0]\"] --> E1[\"Entry1\"] \u003C--> E2[\"Entry2\"]\n        T1[\"table[1]\"] --> E3[\"Entry3\"]\n        T2[\"table[2]\"] --> E4[\"Entry4\"] \u003C--> E5[\"Entry5\"] \u003C--> E6[\"Entry6\"]\n    end\n    subgraph DLL[\"双向链表 #40;按顺序连接所有 Entry#41;\"]\n        Head[\"head\"] \u003C--> L1[\"Entry1\"] \u003C--> L3[\"Entry3\"] \u003C--> L4[\"Entry4\"] \u003C--> L2[\"Entry2\"] \u003C--> Tail[\"tail\"]\n    end\n    Table --> DLL\n","text","mermaid",[946,947,942],"code",{"__ignoreMap":11},[892,949,951],{"id":950},"常用-api","常用 API",[896,953,954],{},"LinkedHashMap 继承自 HashMap，API 与 HashMap 基本一致：",[938,956,960],{"className":957,"code":958,"language":959,"meta":11,"style":11},"language-java shiki shiki-themes github-light github-light github-dark","\u002F\u002F 创建 LinkedHashMap\nLinkedHashMap\u003CString, Integer> map = new LinkedHashMap\u003C>();\n\n\u002F\u002F 创建按访问顺序排序的 LinkedHashMap\nLinkedHashMap\u003CString, Integer> accessOrderMap = new LinkedHashMap\u003C>(16, 0.75f, true);\n\n\u002F\u002F 添加元素\nmap.put(\"a\", 1);\nmap.put(\"b\", 2);\nmap.put(\"c\", 3);\n\n\u002F\u002F 获取元素\nInteger value = map.get(\"a\");\n\n\u002F\u002F 遍历（按插入顺序）\nfor (Map.Entry\u003CString, Integer> entry : map.entrySet()) {\n    System.out.println(entry.getKey() + \" = \" + entry.getValue());\n}\n","java",[946,961,962,971,1000,1007,1013,1051,1056,1062,1086,1105,1124,1129,1135,1155,1160,1166,1195,1231],{"__ignoreMap":11},[963,964,967],"span",{"class":965,"line":966},"line",1,[963,968,970],{"class":969},"sCsY4","\u002F\u002F 创建 LinkedHashMap\n",[963,972,974,978,982,985,988,991,994,997],{"class":965,"line":973},2,[963,975,977],{"class":976},"sxrX7","LinkedHashMap\u003C",[963,979,981],{"class":980},"s8jYJ","String",[963,983,984],{"class":976},", ",[963,986,987],{"class":980},"Integer",[963,989,990],{"class":976},"> map ",[963,992,993],{"class":980},"=",[963,995,996],{"class":980}," new",[963,998,999],{"class":976}," LinkedHashMap\u003C>();\n",[963,1001,1003],{"class":965,"line":1002},3,[963,1004,1006],{"emptyLinePlaceholder":1005},true,"\n",[963,1008,1010],{"class":965,"line":1009},4,[963,1011,1012],{"class":969},"\u002F\u002F 创建按访问顺序排序的 LinkedHashMap\n",[963,1014,1016,1018,1020,1022,1024,1027,1029,1031,1034,1038,1040,1043,1045,1048],{"class":965,"line":1015},5,[963,1017,977],{"class":976},[963,1019,981],{"class":980},[963,1021,984],{"class":976},[963,1023,987],{"class":980},[963,1025,1026],{"class":976},"> accessOrderMap ",[963,1028,993],{"class":980},[963,1030,996],{"class":980},[963,1032,1033],{"class":976}," LinkedHashMap\u003C>(",[963,1035,1037],{"class":1036},"sBjJW","16",[963,1039,984],{"class":976},[963,1041,1042],{"class":1036},"0.75f",[963,1044,984],{"class":976},[963,1046,1047],{"class":1036},"true",[963,1049,1050],{"class":976},");\n",[963,1052,1054],{"class":965,"line":1053},6,[963,1055,1006],{"emptyLinePlaceholder":1005},[963,1057,1059],{"class":965,"line":1058},7,[963,1060,1061],{"class":969},"\u002F\u002F 添加元素\n",[963,1063,1065,1068,1072,1075,1079,1081,1084],{"class":965,"line":1064},8,[963,1066,1067],{"class":976},"map.",[963,1069,1071],{"class":1070},"snPdu","put",[963,1073,1074],{"class":976},"(",[963,1076,1078],{"class":1077},"sIIMD","\"a\"",[963,1080,984],{"class":976},[963,1082,1083],{"class":1036},"1",[963,1085,1050],{"class":976},[963,1087,1089,1091,1093,1095,1098,1100,1103],{"class":965,"line":1088},9,[963,1090,1067],{"class":976},[963,1092,1071],{"class":1070},[963,1094,1074],{"class":976},[963,1096,1097],{"class":1077},"\"b\"",[963,1099,984],{"class":976},[963,1101,1102],{"class":1036},"2",[963,1104,1050],{"class":976},[963,1106,1108,1110,1112,1114,1117,1119,1122],{"class":965,"line":1107},10,[963,1109,1067],{"class":976},[963,1111,1071],{"class":1070},[963,1113,1074],{"class":976},[963,1115,1116],{"class":1077},"\"c\"",[963,1118,984],{"class":976},[963,1120,1121],{"class":1036},"3",[963,1123,1050],{"class":976},[963,1125,1127],{"class":965,"line":1126},11,[963,1128,1006],{"emptyLinePlaceholder":1005},[963,1130,1132],{"class":965,"line":1131},12,[963,1133,1134],{"class":969},"\u002F\u002F 获取元素\n",[963,1136,1138,1141,1143,1146,1149,1151,1153],{"class":965,"line":1137},13,[963,1139,1140],{"class":976},"Integer value ",[963,1142,993],{"class":980},[963,1144,1145],{"class":976}," map.",[963,1147,1148],{"class":1070},"get",[963,1150,1074],{"class":976},[963,1152,1078],{"class":1077},[963,1154,1050],{"class":976},[963,1156,1158],{"class":965,"line":1157},14,[963,1159,1006],{"emptyLinePlaceholder":1005},[963,1161,1163],{"class":965,"line":1162},15,[963,1164,1165],{"class":969},"\u002F\u002F 遍历（按插入顺序）\n",[963,1167,1169,1172,1175,1177,1179,1181,1184,1187,1189,1192],{"class":965,"line":1168},16,[963,1170,1171],{"class":980},"for",[963,1173,1174],{"class":976}," (Map.Entry\u003C",[963,1176,981],{"class":980},[963,1178,984],{"class":976},[963,1180,987],{"class":980},[963,1182,1183],{"class":976},"> entry ",[963,1185,1186],{"class":980},":",[963,1188,1145],{"class":976},[963,1190,1191],{"class":1070},"entrySet",[963,1193,1194],{"class":976},"()) {\n",[963,1196,1198,1201,1204,1207,1210,1213,1216,1219,1222,1225,1228],{"class":965,"line":1197},17,[963,1199,1200],{"class":976},"    System.out.",[963,1202,1203],{"class":1070},"println",[963,1205,1206],{"class":976},"(entry.",[963,1208,1209],{"class":1070},"getKey",[963,1211,1212],{"class":976},"() ",[963,1214,1215],{"class":980},"+",[963,1217,1218],{"class":1077}," \" = \"",[963,1220,1221],{"class":980}," +",[963,1223,1224],{"class":976}," entry.",[963,1226,1227],{"class":1070},"getValue",[963,1229,1230],{"class":976},"());\n",[963,1232,1234],{"class":965,"line":1233},18,[963,1235,1236],{"class":976},"}\n",[892,1238,1239],{"id":1239},"底层实现",[1241,1242,1244],"h3",{"id":1243},"entry-节点","Entry 节点",[896,1246,1247],{},"LinkedHashMap 的 Entry 继承自 HashMap.Node，增加了 before 和 after 指针：",[938,1249,1251],{"className":957,"code":1250,"language":959,"meta":11,"style":11},"\u002F**\n * LinkedHashMap 的 Entry，继承自 HashMap.Node\n *\u002F\nstatic class Entry\u003CK,V> extends HashMap.Node\u003CK,V> {\n    Entry\u003CK,V> before, after;  \u002F\u002F 双向链表指针\n    \n    Entry(int hash, K key, V value, Node\u003CK,V> next) {\n        super(hash, key, value, next);\n    }\n}\n",[946,1252,1253,1258,1263,1268,1311,1328,1333,1376,1384,1389],{"__ignoreMap":11},[963,1254,1255],{"class":965,"line":966},[963,1256,1257],{"class":969},"\u002F**\n",[963,1259,1260],{"class":965,"line":973},[963,1261,1262],{"class":969}," * LinkedHashMap 的 Entry，继承自 HashMap.Node\n",[963,1264,1265],{"class":965,"line":1002},[963,1266,1267],{"class":969}," *\u002F\n",[963,1269,1270,1273,1276,1279,1282,1285,1288,1291,1294,1297,1300,1302,1304,1306,1308],{"class":965,"line":1009},[963,1271,1272],{"class":980},"static",[963,1274,1275],{"class":980}," class",[963,1277,1278],{"class":1070}," Entry",[963,1280,1281],{"class":976},"\u003C",[963,1283,1284],{"class":980},"K",[963,1286,1287],{"class":976},",",[963,1289,1290],{"class":980},"V",[963,1292,1293],{"class":976},"> ",[963,1295,1296],{"class":980},"extends",[963,1298,1299],{"class":1070}," HashMap.Node",[963,1301,1281],{"class":976},[963,1303,1284],{"class":980},[963,1305,1287],{"class":976},[963,1307,1290],{"class":980},[963,1309,1310],{"class":976},"> {\n",[963,1312,1313,1316,1318,1320,1322,1325],{"class":965,"line":1015},[963,1314,1315],{"class":976},"    Entry\u003C",[963,1317,1284],{"class":980},[963,1319,1287],{"class":976},[963,1321,1290],{"class":980},[963,1323,1324],{"class":976},"> before, after;  ",[963,1326,1327],{"class":969},"\u002F\u002F 双向链表指针\n",[963,1329,1330],{"class":965,"line":1053},[963,1331,1332],{"class":976},"    \n",[963,1334,1335,1338,1340,1343,1347,1350,1353,1356,1359,1362,1364,1366,1368,1370,1373],{"class":965,"line":1058},[963,1336,1337],{"class":1070},"    Entry",[963,1339,1074],{"class":976},[963,1341,1342],{"class":980},"int",[963,1344,1346],{"class":1345},"sP4rz"," hash",[963,1348,1349],{"class":976},", K ",[963,1351,1352],{"class":1345},"key",[963,1354,1355],{"class":976},", V ",[963,1357,1358],{"class":1345},"value",[963,1360,1361],{"class":976},", Node\u003C",[963,1363,1284],{"class":980},[963,1365,1287],{"class":976},[963,1367,1290],{"class":980},[963,1369,1293],{"class":976},[963,1371,1372],{"class":1345},"next",[963,1374,1375],{"class":976},") {\n",[963,1377,1378,1381],{"class":965,"line":1064},[963,1379,1380],{"class":1036},"        super",[963,1382,1383],{"class":976},"(hash, key, value, next);\n",[963,1385,1386],{"class":965,"line":1088},[963,1387,1388],{"class":976},"    }\n",[963,1390,1391],{"class":965,"line":1107},[963,1392,1236],{"class":976},[1241,1394,1395],{"id":1395},"成员变量",[938,1397,1399],{"className":957,"code":1398,"language":959,"meta":11,"style":11},"\u002F**\n * 双向链表的头节点（最老的元素）\n *\u002F\ntransient LinkedHashMap.Entry\u003CK,V> head;\n\n\u002F**\n * 双向链表的尾节点（最新的元素）\n *\u002F\ntransient LinkedHashMap.Entry\u003CK,V> tail;\n\n\u002F**\n * 迭代顺序：\n * true - 按访问顺序\n * false - 按插入顺序（默认）\n *\u002F\nfinal boolean accessOrder;\n",[946,1400,1401,1405,1410,1414,1431,1435,1439,1444,1448,1463,1467,1471,1476,1481,1486,1490],{"__ignoreMap":11},[963,1402,1403],{"class":965,"line":966},[963,1404,1257],{"class":969},[963,1406,1407],{"class":965,"line":973},[963,1408,1409],{"class":969}," * 双向链表的头节点（最老的元素）\n",[963,1411,1412],{"class":965,"line":1002},[963,1413,1267],{"class":969},[963,1415,1416,1419,1422,1424,1426,1428],{"class":965,"line":1009},[963,1417,1418],{"class":980},"transient",[963,1420,1421],{"class":976}," LinkedHashMap.Entry\u003C",[963,1423,1284],{"class":980},[963,1425,1287],{"class":976},[963,1427,1290],{"class":980},[963,1429,1430],{"class":976},"> head;\n",[963,1432,1433],{"class":965,"line":1015},[963,1434,1006],{"emptyLinePlaceholder":1005},[963,1436,1437],{"class":965,"line":1053},[963,1438,1257],{"class":969},[963,1440,1441],{"class":965,"line":1058},[963,1442,1443],{"class":969}," * 双向链表的尾节点（最新的元素）\n",[963,1445,1446],{"class":965,"line":1064},[963,1447,1267],{"class":969},[963,1449,1450,1452,1454,1456,1458,1460],{"class":965,"line":1088},[963,1451,1418],{"class":980},[963,1453,1421],{"class":976},[963,1455,1284],{"class":980},[963,1457,1287],{"class":976},[963,1459,1290],{"class":980},[963,1461,1462],{"class":976},"> tail;\n",[963,1464,1465],{"class":965,"line":1107},[963,1466,1006],{"emptyLinePlaceholder":1005},[963,1468,1469],{"class":965,"line":1126},[963,1470,1257],{"class":969},[963,1472,1473],{"class":965,"line":1131},[963,1474,1475],{"class":969}," * 迭代顺序：\n",[963,1477,1478],{"class":965,"line":1137},[963,1479,1480],{"class":969}," * true - 按访问顺序\n",[963,1482,1483],{"class":965,"line":1157},[963,1484,1485],{"class":969}," * false - 按插入顺序（默认）\n",[963,1487,1488],{"class":965,"line":1162},[963,1489,1267],{"class":969},[963,1491,1492,1495,1498],{"class":965,"line":1168},[963,1493,1494],{"class":980},"final",[963,1496,1497],{"class":980}," boolean",[963,1499,1500],{"class":976}," accessOrder;\n",[1241,1502,1503],{"id":1503},"构造方法",[938,1505,1507],{"className":957,"code":1506,"language":959,"meta":11,"style":11},"\u002F**\n * 默认构造，按插入顺序\n *\u002F\npublic LinkedHashMap() {\n    super();\n    accessOrder = false;\n}\n\n\u002F**\n * 指定初始容量\n *\u002F\npublic LinkedHashMap(int initialCapacity) {\n    super(initialCapacity);\n    accessOrder = false;\n}\n\n\u002F**\n * 指定初始容量、负载因子和排序模式\n * @param accessOrder true 表示按访问顺序，false 表示按插入顺序\n *\u002F\npublic LinkedHashMap(int initialCapacity, float loadFactor, boolean accessOrder) {\n    super(initialCapacity, loadFactor);\n    this.accessOrder = accessOrder;\n}\n",[946,1508,1509,1513,1518,1522,1533,1541,1554,1558,1562,1566,1571,1575,1588,1595,1605,1609,1613,1617,1622,1637,1642,1668,1676,1689],{"__ignoreMap":11},[963,1510,1511],{"class":965,"line":966},[963,1512,1257],{"class":969},[963,1514,1515],{"class":965,"line":973},[963,1516,1517],{"class":969}," * 默认构造，按插入顺序\n",[963,1519,1520],{"class":965,"line":1002},[963,1521,1267],{"class":969},[963,1523,1524,1527,1530],{"class":965,"line":1009},[963,1525,1526],{"class":980},"public",[963,1528,1529],{"class":1070}," LinkedHashMap",[963,1531,1532],{"class":976},"() {\n",[963,1534,1535,1538],{"class":965,"line":1015},[963,1536,1537],{"class":1036},"    super",[963,1539,1540],{"class":976},"();\n",[963,1542,1543,1546,1548,1551],{"class":965,"line":1053},[963,1544,1545],{"class":976},"    accessOrder ",[963,1547,993],{"class":980},[963,1549,1550],{"class":1036}," false",[963,1552,1553],{"class":976},";\n",[963,1555,1556],{"class":965,"line":1058},[963,1557,1236],{"class":976},[963,1559,1560],{"class":965,"line":1064},[963,1561,1006],{"emptyLinePlaceholder":1005},[963,1563,1564],{"class":965,"line":1088},[963,1565,1257],{"class":969},[963,1567,1568],{"class":965,"line":1107},[963,1569,1570],{"class":969}," * 指定初始容量\n",[963,1572,1573],{"class":965,"line":1126},[963,1574,1267],{"class":969},[963,1576,1577,1579,1581,1583,1585],{"class":965,"line":1131},[963,1578,1526],{"class":980},[963,1580,1529],{"class":1070},[963,1582,1074],{"class":976},[963,1584,1342],{"class":980},[963,1586,1587],{"class":976}," initialCapacity) {\n",[963,1589,1590,1592],{"class":965,"line":1137},[963,1591,1537],{"class":1036},[963,1593,1594],{"class":976},"(initialCapacity);\n",[963,1596,1597,1599,1601,1603],{"class":965,"line":1157},[963,1598,1545],{"class":976},[963,1600,993],{"class":980},[963,1602,1550],{"class":1036},[963,1604,1553],{"class":976},[963,1606,1607],{"class":965,"line":1162},[963,1608,1236],{"class":976},[963,1610,1611],{"class":965,"line":1168},[963,1612,1006],{"emptyLinePlaceholder":1005},[963,1614,1615],{"class":965,"line":1197},[963,1616,1257],{"class":969},[963,1618,1619],{"class":965,"line":1233},[963,1620,1621],{"class":969}," * 指定初始容量、负载因子和排序模式\n",[963,1623,1625,1628,1631,1634],{"class":965,"line":1624},19,[963,1626,1627],{"class":969}," * ",[963,1629,1630],{"class":980},"@param",[963,1632,1633],{"class":1345}," accessOrder",[963,1635,1636],{"class":969}," true 表示按访问顺序，false 表示按插入顺序\n",[963,1638,1640],{"class":965,"line":1639},20,[963,1641,1267],{"class":969},[963,1643,1645,1647,1649,1651,1653,1656,1659,1662,1665],{"class":965,"line":1644},21,[963,1646,1526],{"class":980},[963,1648,1529],{"class":1070},[963,1650,1074],{"class":976},[963,1652,1342],{"class":980},[963,1654,1655],{"class":976}," initialCapacity, ",[963,1657,1658],{"class":980},"float",[963,1660,1661],{"class":976}," loadFactor, ",[963,1663,1664],{"class":980},"boolean",[963,1666,1667],{"class":976}," accessOrder) {\n",[963,1669,1671,1673],{"class":965,"line":1670},22,[963,1672,1537],{"class":1036},[963,1674,1675],{"class":976},"(initialCapacity, loadFactor);\n",[963,1677,1679,1682,1685,1687],{"class":965,"line":1678},23,[963,1680,1681],{"class":1036},"    this",[963,1683,1684],{"class":976},".accessOrder ",[963,1686,993],{"class":980},[963,1688,1500],{"class":976},[963,1690,1692],{"class":965,"line":1691},24,[963,1693,1236],{"class":976},[1241,1695,1696],{"id":1696},"创建节点",[896,1698,1699],{},"LinkedHashMap 重写了 HashMap 的 newNode 方法：",[938,1701,1703],{"className":957,"code":1702,"language":959,"meta":11,"style":11},"Node\u003CK,V> newNode(int hash, K key, V value, Node\u003CK,V> e) {\n    LinkedHashMap.Entry\u003CK,V> p = new LinkedHashMap.Entry\u003CK,V>(hash, key, value, e);\n    linkNodeLast(p);  \u002F\u002F 将新节点链接到双向链表末尾\n    return p;\n}\n\n\u002F**\n * 将节点链接到双向链表末尾\n *\u002F\nprivate void linkNodeLast(LinkedHashMap.Entry\u003CK,V> p) {\n    LinkedHashMap.Entry\u003CK,V> last = tail;\n    tail = p;\n    if (last == null)\n        head = p;\n    else {\n        p.before = last;\n        last.after = p;\n    }\n}\n",[946,1704,1705,1737,1766,1777,1785,1789,1793,1797,1802,1806,1829,1847,1856,1873,1882,1890,1900,1909,1913],{"__ignoreMap":11},[963,1706,1707,1710,1712,1715,1718,1721,1723,1725,1728,1730,1732,1734],{"class":965,"line":966},[963,1708,1709],{"class":976},"Node",[963,1711,1281],{"class":980},[963,1713,1714],{"class":976},"K,V",[963,1716,1717],{"class":980},">",[963,1719,1720],{"class":1070}," newNode",[963,1722,1074],{"class":976},[963,1724,1342],{"class":980},[963,1726,1727],{"class":976}," hash, K key, V value, Node",[963,1729,1281],{"class":980},[963,1731,1714],{"class":976},[963,1733,1717],{"class":980},[963,1735,1736],{"class":976}," e) {\n",[963,1738,1739,1742,1744,1746,1748,1751,1753,1755,1757,1759,1761,1763],{"class":965,"line":973},[963,1740,1741],{"class":976},"    LinkedHashMap.Entry\u003C",[963,1743,1284],{"class":980},[963,1745,1287],{"class":976},[963,1747,1290],{"class":980},[963,1749,1750],{"class":976},"> p ",[963,1752,993],{"class":980},[963,1754,996],{"class":980},[963,1756,1421],{"class":976},[963,1758,1284],{"class":980},[963,1760,1287],{"class":976},[963,1762,1290],{"class":980},[963,1764,1765],{"class":976},">(hash, key, value, e);\n",[963,1767,1768,1771,1774],{"class":965,"line":1002},[963,1769,1770],{"class":1070},"    linkNodeLast",[963,1772,1773],{"class":976},"(p);  ",[963,1775,1776],{"class":969},"\u002F\u002F 将新节点链接到双向链表末尾\n",[963,1778,1779,1782],{"class":965,"line":1009},[963,1780,1781],{"class":980},"    return",[963,1783,1784],{"class":976}," p;\n",[963,1786,1787],{"class":965,"line":1015},[963,1788,1236],{"class":976},[963,1790,1791],{"class":965,"line":1053},[963,1792,1006],{"emptyLinePlaceholder":1005},[963,1794,1795],{"class":965,"line":1058},[963,1796,1257],{"class":969},[963,1798,1799],{"class":965,"line":1064},[963,1800,1801],{"class":969}," * 将节点链接到双向链表末尾\n",[963,1803,1804],{"class":965,"line":1088},[963,1805,1267],{"class":969},[963,1807,1808,1811,1814,1817,1820,1822,1824,1826],{"class":965,"line":1107},[963,1809,1810],{"class":980},"private",[963,1812,1813],{"class":980}," void",[963,1815,1816],{"class":1070}," linkNodeLast",[963,1818,1819],{"class":976},"(LinkedHashMap.Entry",[963,1821,1281],{"class":980},[963,1823,1714],{"class":976},[963,1825,1717],{"class":980},[963,1827,1828],{"class":976}," p) {\n",[963,1830,1831,1833,1835,1837,1839,1842,1844],{"class":965,"line":1126},[963,1832,1741],{"class":976},[963,1834,1284],{"class":980},[963,1836,1287],{"class":976},[963,1838,1290],{"class":980},[963,1840,1841],{"class":976},"> last ",[963,1843,993],{"class":980},[963,1845,1846],{"class":976}," tail;\n",[963,1848,1849,1852,1854],{"class":965,"line":1131},[963,1850,1851],{"class":976},"    tail ",[963,1853,993],{"class":980},[963,1855,1784],{"class":976},[963,1857,1858,1861,1864,1867,1870],{"class":965,"line":1137},[963,1859,1860],{"class":980},"    if",[963,1862,1863],{"class":976}," (last ",[963,1865,1866],{"class":980},"==",[963,1868,1869],{"class":1036}," null",[963,1871,1872],{"class":976},")\n",[963,1874,1875,1878,1880],{"class":965,"line":1157},[963,1876,1877],{"class":976},"        head ",[963,1879,993],{"class":980},[963,1881,1784],{"class":976},[963,1883,1884,1887],{"class":965,"line":1162},[963,1885,1886],{"class":980},"    else",[963,1888,1889],{"class":976}," {\n",[963,1891,1892,1895,1897],{"class":965,"line":1168},[963,1893,1894],{"class":976},"        p.before ",[963,1896,993],{"class":980},[963,1898,1899],{"class":976}," last;\n",[963,1901,1902,1905,1907],{"class":965,"line":1197},[963,1903,1904],{"class":976},"        last.after ",[963,1906,993],{"class":980},[963,1908,1784],{"class":976},[963,1910,1911],{"class":965,"line":1233},[963,1912,1388],{"class":976},[963,1914,1915],{"class":965,"line":1624},[963,1916,1236],{"class":976},[1241,1918,1920],{"id":1919},"get-方法","get 方法",[938,1922,1924],{"className":957,"code":1923,"language":959,"meta":11,"style":11},"public V get(Object key) {\n    Node\u003CK,V> e;\n    if ((e = getNode(hash(key), key)) == null)\n        return null;\n    \u002F\u002F 如果是访问顺序，将访问的节点移到末尾\n    if (accessOrder)\n        afterNodeAccess(e);\n    return e.value;\n}\n\n\u002F**\n * 将节点移动到双向链表末尾（访问顺序模式下）\n *\u002F\nvoid afterNodeAccess(Node\u003CK,V> e) {\n    LinkedHashMap.Entry\u003CK,V> last;\n    if (accessOrder && (last = tail) != e) {\n        LinkedHashMap.Entry\u003CK,V> p = (LinkedHashMap.Entry\u003CK,V>)e;\n        LinkedHashMap.Entry\u003CK,V> b = p.before;\n        LinkedHashMap.Entry\u003CK,V> a = p.after;\n        p.after = null;\n        \n        if (b == null)\n            head = a;\n        else\n            b.after = a;\n        if (a != null)\n            a.before = b;\n        else\n            last = b;\n        if (last == null)\n            head = p;\n        else {\n            p.before = last;\n            last.after = p;\n        }\n        tail = p;\n        ++modCount;\n    }\n}\n",[946,1925,1926,1938,1952,1978,1987,1992,1999,2007,2014,2018,2022,2026,2031,2035,2054,2067,2089,2116,2134,2152,2163,2168,2182,2192,2197,2207,2221,2232,2237,2247,2260,2269,2277,2287,2297,2303,2313,2322,2327],{"__ignoreMap":11},[963,1927,1928,1930,1933,1935],{"class":965,"line":966},[963,1929,1526],{"class":980},[963,1931,1932],{"class":976}," V ",[963,1934,1148],{"class":1070},[963,1936,1937],{"class":976},"(Object key) {\n",[963,1939,1940,1943,1945,1947,1949],{"class":965,"line":973},[963,1941,1942],{"class":976},"    Node\u003C",[963,1944,1284],{"class":980},[963,1946,1287],{"class":976},[963,1948,1290],{"class":980},[963,1950,1951],{"class":976},"> e;\n",[963,1953,1954,1956,1959,1961,1964,1966,1969,1972,1974,1976],{"class":965,"line":1002},[963,1955,1860],{"class":980},[963,1957,1958],{"class":976}," ((e ",[963,1960,993],{"class":980},[963,1962,1963],{"class":1070}," getNode",[963,1965,1074],{"class":976},[963,1967,1968],{"class":1070},"hash",[963,1970,1971],{"class":976},"(key), key)) ",[963,1973,1866],{"class":980},[963,1975,1869],{"class":1036},[963,1977,1872],{"class":976},[963,1979,1980,1983,1985],{"class":965,"line":1009},[963,1981,1982],{"class":980},"        return",[963,1984,1869],{"class":1036},[963,1986,1553],{"class":976},[963,1988,1989],{"class":965,"line":1015},[963,1990,1991],{"class":969},"    \u002F\u002F 如果是访问顺序，将访问的节点移到末尾\n",[963,1993,1994,1996],{"class":965,"line":1053},[963,1995,1860],{"class":980},[963,1997,1998],{"class":976}," (accessOrder)\n",[963,2000,2001,2004],{"class":965,"line":1058},[963,2002,2003],{"class":1070},"        afterNodeAccess",[963,2005,2006],{"class":976},"(e);\n",[963,2008,2009,2011],{"class":965,"line":1064},[963,2010,1781],{"class":980},[963,2012,2013],{"class":976}," e.value;\n",[963,2015,2016],{"class":965,"line":1088},[963,2017,1236],{"class":976},[963,2019,2020],{"class":965,"line":1107},[963,2021,1006],{"emptyLinePlaceholder":1005},[963,2023,2024],{"class":965,"line":1126},[963,2025,1257],{"class":969},[963,2027,2028],{"class":965,"line":1131},[963,2029,2030],{"class":969}," * 将节点移动到双向链表末尾（访问顺序模式下）\n",[963,2032,2033],{"class":965,"line":1137},[963,2034,1267],{"class":969},[963,2036,2037,2040,2043,2046,2048,2050,2052],{"class":965,"line":1157},[963,2038,2039],{"class":980},"void",[963,2041,2042],{"class":1070}," afterNodeAccess",[963,2044,2045],{"class":976},"(Node",[963,2047,1281],{"class":980},[963,2049,1714],{"class":976},[963,2051,1717],{"class":980},[963,2053,1736],{"class":976},[963,2055,2056,2058,2060,2062,2064],{"class":965,"line":1162},[963,2057,1741],{"class":976},[963,2059,1284],{"class":980},[963,2061,1287],{"class":976},[963,2063,1290],{"class":980},[963,2065,2066],{"class":976},"> last;\n",[963,2068,2069,2071,2074,2077,2079,2081,2084,2087],{"class":965,"line":1168},[963,2070,1860],{"class":980},[963,2072,2073],{"class":976}," (accessOrder ",[963,2075,2076],{"class":980},"&&",[963,2078,1863],{"class":976},[963,2080,993],{"class":980},[963,2082,2083],{"class":976}," tail) ",[963,2085,2086],{"class":980},"!=",[963,2088,1736],{"class":976},[963,2090,2091,2094,2096,2098,2100,2102,2104,2107,2109,2111,2113],{"class":965,"line":1197},[963,2092,2093],{"class":976},"        LinkedHashMap.Entry\u003C",[963,2095,1284],{"class":980},[963,2097,1287],{"class":976},[963,2099,1290],{"class":980},[963,2101,1750],{"class":976},[963,2103,993],{"class":980},[963,2105,2106],{"class":976}," (LinkedHashMap.Entry",[963,2108,1281],{"class":980},[963,2110,1714],{"class":976},[963,2112,1717],{"class":980},[963,2114,2115],{"class":976},")e;\n",[963,2117,2118,2120,2122,2124,2126,2129,2131],{"class":965,"line":1233},[963,2119,2093],{"class":976},[963,2121,1284],{"class":980},[963,2123,1287],{"class":976},[963,2125,1290],{"class":980},[963,2127,2128],{"class":976},"> b ",[963,2130,993],{"class":980},[963,2132,2133],{"class":976}," p.before;\n",[963,2135,2136,2138,2140,2142,2144,2147,2149],{"class":965,"line":1624},[963,2137,2093],{"class":976},[963,2139,1284],{"class":980},[963,2141,1287],{"class":976},[963,2143,1290],{"class":980},[963,2145,2146],{"class":976},"> a ",[963,2148,993],{"class":980},[963,2150,2151],{"class":976}," p.after;\n",[963,2153,2154,2157,2159,2161],{"class":965,"line":1639},[963,2155,2156],{"class":976},"        p.after ",[963,2158,993],{"class":980},[963,2160,1869],{"class":1036},[963,2162,1553],{"class":976},[963,2164,2165],{"class":965,"line":1644},[963,2166,2167],{"class":976},"        \n",[963,2169,2170,2173,2176,2178,2180],{"class":965,"line":1670},[963,2171,2172],{"class":980},"        if",[963,2174,2175],{"class":976}," (b ",[963,2177,1866],{"class":980},[963,2179,1869],{"class":1036},[963,2181,1872],{"class":976},[963,2183,2184,2187,2189],{"class":965,"line":1678},[963,2185,2186],{"class":976},"            head ",[963,2188,993],{"class":980},[963,2190,2191],{"class":976}," a;\n",[963,2193,2194],{"class":965,"line":1691},[963,2195,2196],{"class":980},"        else\n",[963,2198,2200,2203,2205],{"class":965,"line":2199},25,[963,2201,2202],{"class":976},"            b.after ",[963,2204,993],{"class":980},[963,2206,2191],{"class":976},[963,2208,2210,2212,2215,2217,2219],{"class":965,"line":2209},26,[963,2211,2172],{"class":980},[963,2213,2214],{"class":976}," (a ",[963,2216,2086],{"class":980},[963,2218,1869],{"class":1036},[963,2220,1872],{"class":976},[963,2222,2224,2227,2229],{"class":965,"line":2223},27,[963,2225,2226],{"class":976},"            a.before ",[963,2228,993],{"class":980},[963,2230,2231],{"class":976}," b;\n",[963,2233,2235],{"class":965,"line":2234},28,[963,2236,2196],{"class":980},[963,2238,2240,2243,2245],{"class":965,"line":2239},29,[963,2241,2242],{"class":976},"            last ",[963,2244,993],{"class":980},[963,2246,2231],{"class":976},[963,2248,2250,2252,2254,2256,2258],{"class":965,"line":2249},30,[963,2251,2172],{"class":980},[963,2253,1863],{"class":976},[963,2255,1866],{"class":980},[963,2257,1869],{"class":1036},[963,2259,1872],{"class":976},[963,2261,2263,2265,2267],{"class":965,"line":2262},31,[963,2264,2186],{"class":976},[963,2266,993],{"class":980},[963,2268,1784],{"class":976},[963,2270,2272,2275],{"class":965,"line":2271},32,[963,2273,2274],{"class":980},"        else",[963,2276,1889],{"class":976},[963,2278,2280,2283,2285],{"class":965,"line":2279},33,[963,2281,2282],{"class":976},"            p.before ",[963,2284,993],{"class":980},[963,2286,1899],{"class":976},[963,2288,2290,2293,2295],{"class":965,"line":2289},34,[963,2291,2292],{"class":976},"            last.after ",[963,2294,993],{"class":980},[963,2296,1784],{"class":976},[963,2298,2300],{"class":965,"line":2299},35,[963,2301,2302],{"class":976},"        }\n",[963,2304,2306,2309,2311],{"class":965,"line":2305},36,[963,2307,2308],{"class":976},"        tail ",[963,2310,993],{"class":980},[963,2312,1784],{"class":976},[963,2314,2316,2319],{"class":965,"line":2315},37,[963,2317,2318],{"class":980},"        ++",[963,2320,2321],{"class":976},"modCount;\n",[963,2323,2325],{"class":965,"line":2324},38,[963,2326,1388],{"class":976},[963,2328,2330],{"class":965,"line":2329},39,[963,2331,1236],{"class":976},[1241,2333,2334],{"id":2334},"删除节点后的处理",[938,2336,2338],{"className":957,"code":2337,"language":959,"meta":11,"style":11},"\u002F**\n * 节点被删除后，从双向链表中移除\n *\u002F\nvoid afterNodeRemoval(Node\u003CK,V> e) {\n    LinkedHashMap.Entry\u003CK,V> p = (LinkedHashMap.Entry\u003CK,V>)e;\n    LinkedHashMap.Entry\u003CK,V> b = p.before;\n    LinkedHashMap.Entry\u003CK,V> a = p.after;\n    p.before = p.after = null;\n    \n    if (b == null)\n        head = a;\n    else\n        b.after = a;\n    if (a == null)\n        tail = b;\n    else\n        a.before = b;\n}\n",[946,2339,2340,2344,2349,2353,2370,2394,2410,2426,2442,2446,2458,2466,2471,2480,2492,2500,2504,2513],{"__ignoreMap":11},[963,2341,2342],{"class":965,"line":966},[963,2343,1257],{"class":969},[963,2345,2346],{"class":965,"line":973},[963,2347,2348],{"class":969}," * 节点被删除后，从双向链表中移除\n",[963,2350,2351],{"class":965,"line":1002},[963,2352,1267],{"class":969},[963,2354,2355,2357,2360,2362,2364,2366,2368],{"class":965,"line":1009},[963,2356,2039],{"class":980},[963,2358,2359],{"class":1070}," afterNodeRemoval",[963,2361,2045],{"class":976},[963,2363,1281],{"class":980},[963,2365,1714],{"class":976},[963,2367,1717],{"class":980},[963,2369,1736],{"class":976},[963,2371,2372,2374,2376,2378,2380,2382,2384,2386,2388,2390,2392],{"class":965,"line":1015},[963,2373,1741],{"class":976},[963,2375,1284],{"class":980},[963,2377,1287],{"class":976},[963,2379,1290],{"class":980},[963,2381,1750],{"class":976},[963,2383,993],{"class":980},[963,2385,2106],{"class":976},[963,2387,1281],{"class":980},[963,2389,1714],{"class":976},[963,2391,1717],{"class":980},[963,2393,2115],{"class":976},[963,2395,2396,2398,2400,2402,2404,2406,2408],{"class":965,"line":1053},[963,2397,1741],{"class":976},[963,2399,1284],{"class":980},[963,2401,1287],{"class":976},[963,2403,1290],{"class":980},[963,2405,2128],{"class":976},[963,2407,993],{"class":980},[963,2409,2133],{"class":976},[963,2411,2412,2414,2416,2418,2420,2422,2424],{"class":965,"line":1058},[963,2413,1741],{"class":976},[963,2415,1284],{"class":980},[963,2417,1287],{"class":976},[963,2419,1290],{"class":980},[963,2421,2146],{"class":976},[963,2423,993],{"class":980},[963,2425,2151],{"class":976},[963,2427,2428,2431,2433,2436,2438,2440],{"class":965,"line":1064},[963,2429,2430],{"class":976},"    p.before ",[963,2432,993],{"class":980},[963,2434,2435],{"class":976}," p.after ",[963,2437,993],{"class":980},[963,2439,1869],{"class":1036},[963,2441,1553],{"class":976},[963,2443,2444],{"class":965,"line":1088},[963,2445,1332],{"class":976},[963,2447,2448,2450,2452,2454,2456],{"class":965,"line":1107},[963,2449,1860],{"class":980},[963,2451,2175],{"class":976},[963,2453,1866],{"class":980},[963,2455,1869],{"class":1036},[963,2457,1872],{"class":976},[963,2459,2460,2462,2464],{"class":965,"line":1126},[963,2461,1877],{"class":976},[963,2463,993],{"class":980},[963,2465,2191],{"class":976},[963,2467,2468],{"class":965,"line":1131},[963,2469,2470],{"class":980},"    else\n",[963,2472,2473,2476,2478],{"class":965,"line":1137},[963,2474,2475],{"class":976},"        b.after ",[963,2477,993],{"class":980},[963,2479,2191],{"class":976},[963,2481,2482,2484,2486,2488,2490],{"class":965,"line":1157},[963,2483,1860],{"class":980},[963,2485,2214],{"class":976},[963,2487,1866],{"class":980},[963,2489,1869],{"class":1036},[963,2491,1872],{"class":976},[963,2493,2494,2496,2498],{"class":965,"line":1162},[963,2495,2308],{"class":976},[963,2497,993],{"class":980},[963,2499,2231],{"class":976},[963,2501,2502],{"class":965,"line":1168},[963,2503,2470],{"class":980},[963,2505,2506,2509,2511],{"class":965,"line":1197},[963,2507,2508],{"class":976},"        a.before ",[963,2510,993],{"class":980},[963,2512,2231],{"class":976},[963,2514,2515],{"class":965,"line":1233},[963,2516,1236],{"class":976},[1241,2518,2520],{"id":2519},"removeeldestentry-方法","removeEldestEntry 方法",[896,2522,2523],{},"这是一个钩子方法，用于实现 LRU 缓存：",[938,2525,2527],{"className":957,"code":2526,"language":959,"meta":11,"style":11},"\u002F**\n * 是否删除最老的元素\n * 默认返回 false，子类可重写实现 LRU 缓存\n *\u002F\nprotected boolean removeEldestEntry(Map.Entry\u003CK,V> eldest) {\n    return false;\n}\n",[946,2528,2529,2533,2538,2543,2547,2569,2577],{"__ignoreMap":11},[963,2530,2531],{"class":965,"line":966},[963,2532,1257],{"class":969},[963,2534,2535],{"class":965,"line":973},[963,2536,2537],{"class":969}," * 是否删除最老的元素\n",[963,2539,2540],{"class":965,"line":1002},[963,2541,2542],{"class":969}," * 默认返回 false，子类可重写实现 LRU 缓存\n",[963,2544,2545],{"class":965,"line":1009},[963,2546,1267],{"class":969},[963,2548,2549,2552,2554,2557,2560,2562,2564,2566],{"class":965,"line":1015},[963,2550,2551],{"class":980},"protected",[963,2553,1497],{"class":980},[963,2555,2556],{"class":1070}," removeEldestEntry",[963,2558,2559],{"class":976},"(Map.Entry",[963,2561,1281],{"class":980},[963,2563,1714],{"class":976},[963,2565,1717],{"class":980},[963,2567,2568],{"class":976}," eldest) {\n",[963,2570,2571,2573,2575],{"class":965,"line":1053},[963,2572,1781],{"class":980},[963,2574,1550],{"class":1036},[963,2576,1553],{"class":976},[963,2578,2579],{"class":965,"line":1058},[963,2580,1236],{"class":976},[892,2582,2584],{"id":2583},"实现-lru-缓存","实现 LRU 缓存",[896,2586,2587],{},"利用 LinkedHashMap 可以轻松实现 LRU 缓存：",[938,2589,2591],{"className":957,"code":2590,"language":959,"meta":11,"style":11},"public class LRUCache\u003CK, V> extends LinkedHashMap\u003CK, V> {\n    private final int maxSize;\n    \n    public LRUCache(int maxSize) {\n        \u002F\u002F 设置 accessOrder 为 true，按访问顺序排序\n        super(maxSize, 0.75f, true);\n        this.maxSize = maxSize;\n    }\n    \n    \u002F**\n     * 当元素数量超过 maxSize 时，删除最老的元素\n     *\u002F\n    @Override\n    protected boolean removeEldestEntry(Map.Entry\u003CK, V> eldest) {\n        return size() > maxSize;\n    }\n}\n",[946,2592,2593,2626,2640,2644,2660,2665,2680,2692,2696,2700,2705,2710,2715,2723,2748,2761,2765],{"__ignoreMap":11},[963,2594,2595,2597,2599,2602,2604,2606,2608,2610,2612,2614,2616,2618,2620,2622,2624],{"class":965,"line":966},[963,2596,1526],{"class":980},[963,2598,1275],{"class":980},[963,2600,2601],{"class":1070}," LRUCache",[963,2603,1281],{"class":976},[963,2605,1284],{"class":980},[963,2607,984],{"class":976},[963,2609,1290],{"class":980},[963,2611,1293],{"class":976},[963,2613,1296],{"class":980},[963,2615,1529],{"class":1070},[963,2617,1281],{"class":976},[963,2619,1284],{"class":980},[963,2621,984],{"class":976},[963,2623,1290],{"class":980},[963,2625,1310],{"class":976},[963,2627,2628,2631,2634,2637],{"class":965,"line":973},[963,2629,2630],{"class":980},"    private",[963,2632,2633],{"class":980}," final",[963,2635,2636],{"class":980}," int",[963,2638,2639],{"class":976}," maxSize;\n",[963,2641,2642],{"class":965,"line":1002},[963,2643,1332],{"class":976},[963,2645,2646,2649,2651,2653,2655,2658],{"class":965,"line":1009},[963,2647,2648],{"class":980},"    public",[963,2650,2601],{"class":1070},[963,2652,1074],{"class":976},[963,2654,1342],{"class":980},[963,2656,2657],{"class":1345}," maxSize",[963,2659,1375],{"class":976},[963,2661,2662],{"class":965,"line":1015},[963,2663,2664],{"class":969},"        \u002F\u002F 设置 accessOrder 为 true，按访问顺序排序\n",[963,2666,2667,2669,2672,2674,2676,2678],{"class":965,"line":1053},[963,2668,1380],{"class":1036},[963,2670,2671],{"class":976},"(maxSize, ",[963,2673,1042],{"class":1036},[963,2675,984],{"class":976},[963,2677,1047],{"class":1036},[963,2679,1050],{"class":976},[963,2681,2682,2685,2688,2690],{"class":965,"line":1058},[963,2683,2684],{"class":1036},"        this",[963,2686,2687],{"class":976},".maxSize ",[963,2689,993],{"class":980},[963,2691,2639],{"class":976},[963,2693,2694],{"class":965,"line":1064},[963,2695,1388],{"class":976},[963,2697,2698],{"class":965,"line":1088},[963,2699,1332],{"class":976},[963,2701,2702],{"class":965,"line":1107},[963,2703,2704],{"class":969},"    \u002F**\n",[963,2706,2707],{"class":965,"line":1126},[963,2708,2709],{"class":969},"     * 当元素数量超过 maxSize 时，删除最老的元素\n",[963,2711,2712],{"class":965,"line":1131},[963,2713,2714],{"class":969},"     *\u002F\n",[963,2716,2717,2720],{"class":965,"line":1137},[963,2718,2719],{"class":976},"    @",[963,2721,2722],{"class":980},"Override\n",[963,2724,2725,2728,2730,2732,2735,2737,2739,2741,2743,2746],{"class":965,"line":1157},[963,2726,2727],{"class":980},"    protected",[963,2729,1497],{"class":980},[963,2731,2556],{"class":1070},[963,2733,2734],{"class":976},"(Map.Entry\u003C",[963,2736,1284],{"class":980},[963,2738,984],{"class":976},[963,2740,1290],{"class":980},[963,2742,1293],{"class":976},[963,2744,2745],{"class":1345},"eldest",[963,2747,1375],{"class":976},[963,2749,2750,2752,2755,2757,2759],{"class":965,"line":1162},[963,2751,1982],{"class":980},[963,2753,2754],{"class":1070}," size",[963,2756,1212],{"class":976},[963,2758,1717],{"class":980},[963,2760,2639],{"class":976},[963,2762,2763],{"class":965,"line":1168},[963,2764,1388],{"class":976},[963,2766,2767],{"class":965,"line":1197},[963,2768,1236],{"class":976},[896,2770,2771],{},"使用示例：",[938,2773,2775],{"className":957,"code":2774,"language":959,"meta":11,"style":11},"public class LRUCacheDemo {\n    public static void main(String[] args) {\n        LRUCache\u003CString, Integer> cache = new LRUCache\u003C>(3);\n        \n        cache.put(\"a\", 1);\n        cache.put(\"b\", 2);\n        cache.put(\"c\", 3);\n        System.out.println(cache);  \u002F\u002F {a=1, b=2, c=3}\n        \n        cache.get(\"a\");  \u002F\u002F 访问 a，将 a 移到末尾\n        System.out.println(cache);  \u002F\u002F {b=2, c=3, a=1}\n        \n        cache.put(\"d\", 4);  \u002F\u002F 添加 d，超过容量，删除最老的 b\n        System.out.println(cache);  \u002F\u002F {c=3, a=1, d=4}\n    }\n}\n",[946,2776,2777,2788,2812,2837,2841,2858,2874,2890,2903,2907,2923,2934,2938,2959,2970,2974],{"__ignoreMap":11},[963,2778,2779,2781,2783,2786],{"class":965,"line":966},[963,2780,1526],{"class":980},[963,2782,1275],{"class":980},[963,2784,2785],{"class":1070}," LRUCacheDemo",[963,2787,1889],{"class":976},[963,2789,2790,2792,2795,2797,2800,2802,2804,2807,2810],{"class":965,"line":973},[963,2791,2648],{"class":980},[963,2793,2794],{"class":980}," static",[963,2796,1813],{"class":980},[963,2798,2799],{"class":1070}," main",[963,2801,1074],{"class":976},[963,2803,981],{"class":980},[963,2805,2806],{"class":976},"[] ",[963,2808,2809],{"class":1345},"args",[963,2811,1375],{"class":976},[963,2813,2814,2817,2819,2821,2823,2826,2828,2830,2833,2835],{"class":965,"line":1002},[963,2815,2816],{"class":976},"        LRUCache\u003C",[963,2818,981],{"class":980},[963,2820,984],{"class":976},[963,2822,987],{"class":980},[963,2824,2825],{"class":976},"> cache ",[963,2827,993],{"class":980},[963,2829,996],{"class":980},[963,2831,2832],{"class":976}," LRUCache\u003C>(",[963,2834,1121],{"class":1036},[963,2836,1050],{"class":976},[963,2838,2839],{"class":965,"line":1009},[963,2840,2167],{"class":976},[963,2842,2843,2846,2848,2850,2852,2854,2856],{"class":965,"line":1015},[963,2844,2845],{"class":976},"        cache.",[963,2847,1071],{"class":1070},[963,2849,1074],{"class":976},[963,2851,1078],{"class":1077},[963,2853,984],{"class":976},[963,2855,1083],{"class":1036},[963,2857,1050],{"class":976},[963,2859,2860,2862,2864,2866,2868,2870,2872],{"class":965,"line":1053},[963,2861,2845],{"class":976},[963,2863,1071],{"class":1070},[963,2865,1074],{"class":976},[963,2867,1097],{"class":1077},[963,2869,984],{"class":976},[963,2871,1102],{"class":1036},[963,2873,1050],{"class":976},[963,2875,2876,2878,2880,2882,2884,2886,2888],{"class":965,"line":1058},[963,2877,2845],{"class":976},[963,2879,1071],{"class":1070},[963,2881,1074],{"class":976},[963,2883,1116],{"class":1077},[963,2885,984],{"class":976},[963,2887,1121],{"class":1036},[963,2889,1050],{"class":976},[963,2891,2892,2895,2897,2900],{"class":965,"line":1064},[963,2893,2894],{"class":976},"        System.out.",[963,2896,1203],{"class":1070},[963,2898,2899],{"class":976},"(cache);  ",[963,2901,2902],{"class":969},"\u002F\u002F {a=1, b=2, c=3}\n",[963,2904,2905],{"class":965,"line":1088},[963,2906,2167],{"class":976},[963,2908,2909,2911,2913,2915,2917,2920],{"class":965,"line":1107},[963,2910,2845],{"class":976},[963,2912,1148],{"class":1070},[963,2914,1074],{"class":976},[963,2916,1078],{"class":1077},[963,2918,2919],{"class":976},");  ",[963,2921,2922],{"class":969},"\u002F\u002F 访问 a，将 a 移到末尾\n",[963,2924,2925,2927,2929,2931],{"class":965,"line":1126},[963,2926,2894],{"class":976},[963,2928,1203],{"class":1070},[963,2930,2899],{"class":976},[963,2932,2933],{"class":969},"\u002F\u002F {b=2, c=3, a=1}\n",[963,2935,2936],{"class":965,"line":1131},[963,2937,2167],{"class":976},[963,2939,2940,2942,2944,2946,2949,2951,2954,2956],{"class":965,"line":1137},[963,2941,2845],{"class":976},[963,2943,1071],{"class":1070},[963,2945,1074],{"class":976},[963,2947,2948],{"class":1077},"\"d\"",[963,2950,984],{"class":976},[963,2952,2953],{"class":1036},"4",[963,2955,2919],{"class":976},[963,2957,2958],{"class":969},"\u002F\u002F 添加 d，超过容量，删除最老的 b\n",[963,2960,2961,2963,2965,2967],{"class":965,"line":1157},[963,2962,2894],{"class":976},[963,2964,1203],{"class":1070},[963,2966,2899],{"class":976},[963,2968,2969],{"class":969},"\u002F\u002F {c=3, a=1, d=4}\n",[963,2971,2972],{"class":965,"line":1162},[963,2973,1388],{"class":976},[963,2975,2976],{"class":965,"line":1168},[963,2977,1236],{"class":976},[892,2979,2980],{"id":2980},"遍历顺序示例",[1241,2982,2984],{"id":2983},"插入顺序默认","插入顺序（默认）",[938,2986,2988],{"className":957,"code":2987,"language":959,"meta":11,"style":11},"LinkedHashMap\u003CString, Integer> map = new LinkedHashMap\u003C>();\nmap.put(\"c\", 3);\nmap.put(\"a\", 1);\nmap.put(\"b\", 2);\n\n\u002F\u002F 按插入顺序遍历\nfor (String key : map.keySet()) {\n    System.out.print(key + \" \");  \u002F\u002F c a b\n}\n",[946,2989,2990,3008,3024,3040,3056,3060,3065,3081,3101],{"__ignoreMap":11},[963,2991,2992,2994,2996,2998,3000,3002,3004,3006],{"class":965,"line":966},[963,2993,977],{"class":976},[963,2995,981],{"class":980},[963,2997,984],{"class":976},[963,2999,987],{"class":980},[963,3001,990],{"class":976},[963,3003,993],{"class":980},[963,3005,996],{"class":980},[963,3007,999],{"class":976},[963,3009,3010,3012,3014,3016,3018,3020,3022],{"class":965,"line":973},[963,3011,1067],{"class":976},[963,3013,1071],{"class":1070},[963,3015,1074],{"class":976},[963,3017,1116],{"class":1077},[963,3019,984],{"class":976},[963,3021,1121],{"class":1036},[963,3023,1050],{"class":976},[963,3025,3026,3028,3030,3032,3034,3036,3038],{"class":965,"line":1002},[963,3027,1067],{"class":976},[963,3029,1071],{"class":1070},[963,3031,1074],{"class":976},[963,3033,1078],{"class":1077},[963,3035,984],{"class":976},[963,3037,1083],{"class":1036},[963,3039,1050],{"class":976},[963,3041,3042,3044,3046,3048,3050,3052,3054],{"class":965,"line":1009},[963,3043,1067],{"class":976},[963,3045,1071],{"class":1070},[963,3047,1074],{"class":976},[963,3049,1097],{"class":1077},[963,3051,984],{"class":976},[963,3053,1102],{"class":1036},[963,3055,1050],{"class":976},[963,3057,3058],{"class":965,"line":1015},[963,3059,1006],{"emptyLinePlaceholder":1005},[963,3061,3062],{"class":965,"line":1053},[963,3063,3064],{"class":969},"\u002F\u002F 按插入顺序遍历\n",[963,3066,3067,3069,3072,3074,3076,3079],{"class":965,"line":1058},[963,3068,1171],{"class":980},[963,3070,3071],{"class":976}," (String key ",[963,3073,1186],{"class":980},[963,3075,1145],{"class":976},[963,3077,3078],{"class":1070},"keySet",[963,3080,1194],{"class":976},[963,3082,3083,3085,3088,3091,3093,3096,3098],{"class":965,"line":1064},[963,3084,1200],{"class":976},[963,3086,3087],{"class":1070},"print",[963,3089,3090],{"class":976},"(key ",[963,3092,1215],{"class":980},[963,3094,3095],{"class":1077}," \" \"",[963,3097,2919],{"class":976},[963,3099,3100],{"class":969},"\u002F\u002F c a b\n",[963,3102,3103],{"class":965,"line":1088},[963,3104,1236],{"class":976},[1241,3106,3107],{"id":3107},"访问顺序",[938,3109,3111],{"className":957,"code":3110,"language":959,"meta":11,"style":11},"LinkedHashMap\u003CString, Integer> map = new LinkedHashMap\u003C>(16, 0.75f, true);\nmap.put(\"c\", 3);\nmap.put(\"a\", 1);\nmap.put(\"b\", 2);\n\nmap.get(\"c\");  \u002F\u002F 访问 c\n\n\u002F\u002F 按访问顺序遍历（最近访问的在最后）\nfor (String key : map.keySet()) {\n    System.out.print(key + \" \");  \u002F\u002F a b c\n}\n",[946,3112,3113,3143,3159,3175,3191,3195,3210,3214,3219,3233,3250],{"__ignoreMap":11},[963,3114,3115,3117,3119,3121,3123,3125,3127,3129,3131,3133,3135,3137,3139,3141],{"class":965,"line":966},[963,3116,977],{"class":976},[963,3118,981],{"class":980},[963,3120,984],{"class":976},[963,3122,987],{"class":980},[963,3124,990],{"class":976},[963,3126,993],{"class":980},[963,3128,996],{"class":980},[963,3130,1033],{"class":976},[963,3132,1037],{"class":1036},[963,3134,984],{"class":976},[963,3136,1042],{"class":1036},[963,3138,984],{"class":976},[963,3140,1047],{"class":1036},[963,3142,1050],{"class":976},[963,3144,3145,3147,3149,3151,3153,3155,3157],{"class":965,"line":973},[963,3146,1067],{"class":976},[963,3148,1071],{"class":1070},[963,3150,1074],{"class":976},[963,3152,1116],{"class":1077},[963,3154,984],{"class":976},[963,3156,1121],{"class":1036},[963,3158,1050],{"class":976},[963,3160,3161,3163,3165,3167,3169,3171,3173],{"class":965,"line":1002},[963,3162,1067],{"class":976},[963,3164,1071],{"class":1070},[963,3166,1074],{"class":976},[963,3168,1078],{"class":1077},[963,3170,984],{"class":976},[963,3172,1083],{"class":1036},[963,3174,1050],{"class":976},[963,3176,3177,3179,3181,3183,3185,3187,3189],{"class":965,"line":1009},[963,3178,1067],{"class":976},[963,3180,1071],{"class":1070},[963,3182,1074],{"class":976},[963,3184,1097],{"class":1077},[963,3186,984],{"class":976},[963,3188,1102],{"class":1036},[963,3190,1050],{"class":976},[963,3192,3193],{"class":965,"line":1015},[963,3194,1006],{"emptyLinePlaceholder":1005},[963,3196,3197,3199,3201,3203,3205,3207],{"class":965,"line":1053},[963,3198,1067],{"class":976},[963,3200,1148],{"class":1070},[963,3202,1074],{"class":976},[963,3204,1116],{"class":1077},[963,3206,2919],{"class":976},[963,3208,3209],{"class":969},"\u002F\u002F 访问 c\n",[963,3211,3212],{"class":965,"line":1058},[963,3213,1006],{"emptyLinePlaceholder":1005},[963,3215,3216],{"class":965,"line":1064},[963,3217,3218],{"class":969},"\u002F\u002F 按访问顺序遍历（最近访问的在最后）\n",[963,3220,3221,3223,3225,3227,3229,3231],{"class":965,"line":1088},[963,3222,1171],{"class":980},[963,3224,3071],{"class":976},[963,3226,1186],{"class":980},[963,3228,1145],{"class":976},[963,3230,3078],{"class":1070},[963,3232,1194],{"class":976},[963,3234,3235,3237,3239,3241,3243,3245,3247],{"class":965,"line":1107},[963,3236,1200],{"class":976},[963,3238,3087],{"class":1070},[963,3240,3090],{"class":976},[963,3242,1215],{"class":980},[963,3244,3095],{"class":1077},[963,3246,2919],{"class":976},[963,3248,3249],{"class":969},"\u002F\u002F a b c\n",[963,3251,3252],{"class":965,"line":1126},[963,3253,1236],{"class":976},[892,3255,3257],{"id":3256},"linkedhashmap-vs-hashmap","LinkedHashMap vs HashMap",[3259,3260,3261,3277],"table",{},[3262,3263,3264],"thead",{},[3265,3266,3267,3271,3274],"tr",{},[3268,3269,3270],"th",{},"特性",[3268,3272,3273],{},"HashMap",[3268,3275,3276],{},"LinkedHashMap",[3278,3279,3280,3292,3302,3313,3324],"tbody",{},[3265,3281,3282,3286,3289],{},[3283,3284,3285],"td",{},"遍历顺序",[3283,3287,3288],{},"无序",[3283,3290,3291],{},"有序（插入\u002F访问顺序）",[3265,3293,3294,3296,3299],{},[3283,3295,933],{},[3283,3297,3298],{},"数组 + 链表\u002F红黑树",[3283,3300,3301],{},"数组 + 链表\u002F红黑树 + 双向链表",[3265,3303,3304,3307,3310],{},[3283,3305,3306],{},"内存占用",[3283,3308,3309],{},"较少",[3283,3311,3312],{},"较多（额外的链表指针）",[3265,3314,3315,3318,3321],{},[3283,3316,3317],{},"性能",[3283,3319,3320],{},"略高",[3283,3322,3323],{},"略低（维护链表开销）",[3265,3325,3326,3329,3332],{},[3283,3327,3328],{},"适用场景",[3283,3330,3331],{},"一般场景",[3283,3333,3334],{},"需要保持顺序、LRU 缓存",[892,3336,3337],{"id":3337},"小结",[903,3339,3340,3343,3353,3363,3366],{},[906,3341,3342],{},"LinkedHashMap 继承自 HashMap，在 HashMap 基础上增加了双向链表维护顺序",[906,3344,3345,3346,3349,3350,3352],{},"支持",[909,3347,3348],{},"插入顺序","和",[909,3351,3107],{},"两种遍历方式",[906,3354,3355,3356,3359,3360],{},"通过重写 ",[946,3357,3358],{},"removeEldestEntry"," 方法可以轻松实现 ",[909,3361,3362],{},"LRU 缓存",[906,3364,3365],{},"相比 HashMap 有额外的内存和性能开销",[906,3367,3368],{},"适用于需要保持元素顺序的场景",[3370,3371,3372],"style",{},"html pre.shiki code .sCsY4, html code.shiki .sCsY4{--shiki-light:#6A737D;--shiki-default:#6A737D;--shiki-dark:#6A737D}html pre.shiki code .sxrX7, html code.shiki .sxrX7{--shiki-light:#24292E;--shiki-default:#24292E;--shiki-dark:#E1E4E8}html pre.shiki code .s8jYJ, html code.shiki .s8jYJ{--shiki-light:#D73A49;--shiki-default:#D73A49;--shiki-dark:#F97583}html pre.shiki code .sBjJW, html code.shiki .sBjJW{--shiki-light:#005CC5;--shiki-default:#005CC5;--shiki-dark:#79B8FF}html pre.shiki code .snPdu, html code.shiki .snPdu{--shiki-light:#6F42C1;--shiki-default:#6F42C1;--shiki-dark:#B392F0}html pre.shiki code .sIIMD, html code.shiki .sIIMD{--shiki-light:#032F62;--shiki-default:#032F62;--shiki-dark:#9ECBFF}html .light .shiki span {color: var(--shiki-light);background: var(--shiki-light-bg);font-style: var(--shiki-light-font-style);font-weight: var(--shiki-light-font-weight);text-decoration: var(--shiki-light-text-decoration);}html.light .shiki span {color: var(--shiki-light);background: var(--shiki-light-bg);font-style: var(--shiki-light-font-style);font-weight: var(--shiki-light-font-weight);text-decoration: var(--shiki-light-text-decoration);}html .default .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .shiki span {color: var(--shiki-default);background: var(--shiki-default-bg);font-style: var(--shiki-default-font-style);font-weight: var(--shiki-default-font-weight);text-decoration: var(--shiki-default-text-decoration);}html .dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html.dark .shiki span {color: var(--shiki-dark);background: var(--shiki-dark-bg);font-style: var(--shiki-dark-font-style);font-weight: var(--shiki-dark-font-weight);text-decoration: var(--shiki-dark-text-decoration);}html pre.shiki code .sP4rz, html code.shiki .sP4rz{--shiki-light:#E36209;--shiki-default:#E36209;--shiki-dark:#FFAB70}",{"title":11,"searchDepth":973,"depth":973,"links":3374},[3375,3376,3377,3378,3387,3388,3392,3393],{"id":894,"depth":973,"text":894},{"id":933,"depth":973,"text":933},{"id":950,"depth":973,"text":951},{"id":1239,"depth":973,"text":1239,"children":3379},[3380,3381,3382,3383,3384,3385,3386],{"id":1243,"depth":1002,"text":1244},{"id":1395,"depth":1002,"text":1395},{"id":1503,"depth":1002,"text":1503},{"id":1696,"depth":1002,"text":1696},{"id":1919,"depth":1002,"text":1920},{"id":2334,"depth":1002,"text":2334},{"id":2519,"depth":1002,"text":2520},{"id":2583,"depth":973,"text":2584},{"id":2980,"depth":973,"text":2980,"children":3389},[3390,3391],{"id":2983,"depth":1002,"text":2984},{"id":3107,"depth":1002,"text":3107},{"id":3256,"depth":973,"text":3257},{"id":3337,"depth":973,"text":3337},"md",{},{"title":373,"description":11},"other\u002Fjava\u002Fcollection\u002Fmap-linkedhashmap","8c6dv7A0DiykNh4OJtMrnD8dSTnyFjhwMQigHdfaU1A",1775496427914]