commit aa2cf59e1f3fa8e5a86ed351bbf8abeb2cae4f1a Author: <> Date: Tue Feb 15 07:54:14 2022 +0000 Deployed d842961 with MkDocs version: 1.2.3 diff --git a/.nojekyll b/.nojekyll new file mode 100644 index 00000000..e69de29b diff --git a/404.html b/404.html new file mode 100644 index 00000000..aada20ed --- /dev/null +++ b/404.html @@ -0,0 +1,1951 @@ + + + + + + + + + + + + + + + + CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ +
+
+ +
+ + + + +
+ + +
+ +
+ + + + + + +
+
+ + + +
+
+
+ + + + +
+
+
+ + + +
+
+ +

404 - Not found

+ +
+
+
+ +
+ + + +
+
+
+
+ + + + + + + + \ No newline at end of file diff --git a/CNAME b/CNAME new file mode 100644 index 00000000..b920fd41 --- /dev/null +++ b/CNAME @@ -0,0 +1 @@ +csdiy.wiki \ No newline at end of file diff --git a/CS学习规划/index.html b/CS学习规划/index.html new file mode 100644 index 00000000..1ef577a9 --- /dev/null +++ b/CS学习规划/index.html @@ -0,0 +1,3379 @@ + + + + + + + + + + + + + + + + 一个仅供参考的CS学习规划 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + + Skip to content + + +
+
+ +
+ + + + +
+ + +
+ +
+ + + + + + +
+
+ + + +
+
+
+ + + + +
+
+
+ + + +
+
+
+ + + +
+
+
+ + +
+
+ + + + + + + +

一个仅供参考的CS学习规划

+

计算机领域方向庞杂,知识浩如烟海,每个细分领域如果深究下去都可以说学无止境。因此,一个清晰明确的学习规划是非常重要的。这一节的内容是对后续整本书的内容的一个概览,你可以将其看作是这本书的目录,按需选择自己感兴趣的内容进行学习。

+

不过,在开始学习之前,先向小白们强烈推荐一个科普向系列视频Crash Course: Computer Science,在短短8个小时里非常生动且全面地科普了关于计算机科学的方方面面:计算机的历史、计算机是如何运作的、组成计算机的各个重要模块、计算机科学中的重要思想等等等等。正如它的口号所说的Computers are not magic!,希望看完这个视频之后,大家能对计算机科学有个全貌性地感知,从而怀着兴趣去面对下面浩如烟海的更为细致且深入的学习内容。

+

必学工具

+
+

俗话说:磨刀不误砍柴工。如果你是一个刚刚接触计算机的24k纯小白,学会一些工具将会让你事半功倍。

+
+

MIT-Missing-Semester这门课覆盖了这些工具中绝大部分,而且有相当详细的使用指导,强烈建议小白学习。

+

翻墙:由于一些众所周知的原因,谷歌、Github等网站在大陆无法访问。然而很多时候,谷歌和Stackoverflow可以解决你在开发过程中遇到的95%的问题。因此,学会翻墙几乎是一个内地CSer的必备技能。(考虑到法律问题,这个文档提供的翻墙方式仅对拥有北大邮箱的用户适用)。

+

IDE(Integrated Development Environment):集成开发环境,说白了就是你写代码的地方。作为一个码农,IDE的重要性不言而喻,但由于很多IDE是为大型工程项目设计的,体量较大,功能也过于丰富。其实如今一些轻便的文本编辑器配合丰富的插件生态基本可以满足日常的轻量编程需求。个人常用的编辑器是VSCode和Sublime(前者的插件配置非常简单,后者略显复杂但颜值很高)。当然对于大型项目我还是会采用略重型的IDE,例如Pycharm(Python),IDEA(Java)等等(免责申明:所有的IDE都是世界上最好的IDE)。

+

Vim:一款命令行编辑工具。这是一个学习曲线有些陡峭的编辑器,不过学会它我觉得是非常有必要的,因为它将极大地提高你的开发效率。现在绝大多数IDE也都支持Vim插件,让你在享受现代开发环境的同时保留极客的炫酷(yue)。

+

Git:一款代码版本控制工具。Git的学习曲线可能更为陡峭,但出自Linux之父Linus之手的Git绝对是每个学CS的童鞋必须掌握的神器之一。

+

Github:基于Git的代码托管平台。全世界最大的代码开源社区,大佬集聚地。

+

Makefile:一款工程构建工具。善用Makefile会让你养成代码模块化的习惯,同时也能让你熟悉一些大型工程的编译链接流程。

+

CMake:一款功能比Makefile更为强大的构建工具,建议掌握Makefile之后再加以学习。

+

LaTex逼格提升论文排版工具。

+

Docker:一款相较于虚拟机更轻量级的软件打包与环境部署工具。

+

实用工具箱:除了上面提到的这些在开发中使用频率极高的工具之外,我还收集了很多实用有趣的免费工具,例如一些下载工具、设计工具、学习网站等等。

+

好书推荐

+
+

私以为一本好的教材应当是以人为本的,而不是炫技式的理论堆砌。告诉读者“是什么”固然重要,但更好的应当是教材作者将其在这个领域深耕几十年的经验融汇进书中,向读者娓娓道来“为什么”以及未来应该“怎么做”。

+
+

链接戳这里

+

环境配置

+
+

你以为的开发 —— 在IDE里疯狂码代码数小时。

+

实际上的开发 —— 配环境配几天还没开始写代码。

+
+

推荐一个非常不错的Github项目DevOps-Guide,其中涵盖了非常多的运维方面的基础知识和教程,例如Docker,K8s,Linux,CI-CD,Github Actions等等。

+

另外大家可以参考一份灵感来自 6.NULL MIT-Missing-Semester环境配置指南,重点在于终端的美化配置。此外还包括常用软件源(如GitHub, Anaconda, pip等)的加速与替换以及一些IDE的配置与激活教程。

+

More contents under construction.

+

课程地图

+
+

正如这章开头提到的,这份课程地图仅仅是一个仅供参考的课程规划,我作为一个临近毕业的本科生。深感自己没有权利也没有能力向别人宣扬“应该怎么学”。因此如果你觉得以下的课程分类与选择有不合理之处,我全盘接受,并深感抱歉。你可以在下一节定制属于你的课程地图

+
+

以下课程类别中除了含有基础入门字眼的以外,并无明确的先后次序,大家只要满足某个课程的先修要求,完全可以根据自己的需要和喜好选择想要学习的课程。

+

另外由于贡献者的不断增加,这份课程地图已经从最初我的学习经历,发展成为很多CS自学者的资源合集,其中难免有内容交叉甚至重复的。但之所以都列出来,还是希望集百家之长,给大家尽可能多的选择与参考。

+

数学基础

+

微积分与线性代数

+

作为大一新生,学好微积分线代是和写代码至少同等重要的事情,相信已经有无数的前人经验提到过这一点,但我还是要不厌其烦地再强调一遍:学好微积分线代真的很重要!你也许会吐槽这些东西岂不是考完就忘,那我觉得你是并没有把握住它们本质,对它们的理解还没有达到刻骨铭心的程度。如果觉得老师课上讲的内容晦涩难懂,不妨参考MIT的Calculus Course18.06: Linear Algebra的课程notes,至少于我而言,它帮助我深刻理解了微积分和线性代数的许多本质。顺道再安利一个油管数学网红3Blue1Brown,他的频道有很多用生动形象的动画阐释数学本质内核的视频,兼具深度和广度,质量非常高。

+

信息论入门

+

作为计算机系的学生,及早了解一些信息论的基础知识,我觉得是大有裨益的。但大多信息论课程都面向高年级本科生甚至研究生,对新手极不友好。而MIT的6.050J: Information theory and Entropy这门课正是为大一新生量身定制的,几乎没有先修要求,涵盖了编码、压缩、通信、信息熵等等内容,非常有趣。

+

数学进阶

+

离散数学与概率论

+

集合论、图论、概率论等等是算法推导与证明的重要工具,也是后续高阶数学课程的基础。但我觉得这类课程的讲授很容易落入理论化与形式化的窠臼,让课堂成为定理结论的堆砌,而无法使学生深刻把握理论的本质,进而造成学了就背,考了就忘的怪圈。如果能在理论教学中穿插算法运用实例,学生在拓展算法知识的同时也能窥见理论的力量和魅力。

+

UCB CS70 : discrete Math and probability theoryUCB CS126 : Probability theory是UC Berkeley的概率论课程,前者覆盖了离散数学和概率论基础,后者则涉及随机过程以及深入的理论内容。两者都非常注重理论和实践的结合,有丰富的算法实际运用实例,后者还有大量的Python编程作业来让学生运用概率论的知识解决实际问题。

+

数值分析

+

作为计算机系的学生,培养计算思维是很重要的,实际问题的建模、离散化,计算机的模拟、分析,是一项很重要的能力。而这两年开始风靡的,由MIT打造的Julia编程语言以其C一样的速度和Python一样友好的语法在数值计算领域有一统天下之势,MIT的许多数学课程也开始用Julia作为教学工具,把艰深的数学理论用直观清晰的代码展示出来。

+

ComputationalThinking是MIT开设的一门计算思维入门课,所有课程内容全部开源,可以在课程网站直接访问。这门课利用Julia编程语言,在图像处理、社会科学与数据科学、气候学建模三个topic下带领学生理解算法、数学建模、数据分析、交互设计、图例展示,让学生体验计算与科学的美妙结合。内容虽然不难,但给我最深刻的感受就是,科学的魅力并不是故弄玄虚的艰深理论,不是诘屈聱牙的术语行话,而是用直观生动的案例,用简练深刻的语言,让每个普通人都能理解。

+

上完上面的体验课之后,如果意犹未尽的话,不妨试试MIT的18.330 : Introduction to numerical analysis,这门课的编程作业同样会用Julia编程语言,不过难度和深度上都上了一个台阶。内容涉及了浮点编码、Root finding、线性系统、微分方程等等方面,整门课的主旨就是让你利用离散化的计算机表示去估计和逼近一个数学上连续的概念。这门课的教授还专门撰写了一本配套的开源教材Fundamentals of Numerical Computation,里面附有丰富的Julia代码实例和严谨的公式推导。

+

如果你还意犹未尽的话,还有MIT的研究生课程18.335: Introduction to numerical method供你参考。

+

微分方程

+

如果世间万物的运动发展都能用方程来刻画和描述,这是一件多么酷的事情呀!虽然几乎任何一所学校的CS培养方案中都没有微分方程相关的必修课程,但我还是觉得掌握它会赋予你一个新的视角来审视这个世界。

+

由于微分方程中往往会用到很多复变函数的知识,所以大家可以参考MIT18.04: Complex variables functions的课程notes来补齐先修知识。

+

MIT18.03: differential equations主要覆盖了常微分方程的求解,在此基础之上MIT18.152: Partial differential equations则会深入偏微分方程的建模与求解。掌握了微分方程这一有利工具,相信对于你的实际问题的建模能力以及从众多噪声变量中把握本质的直觉都会有很大帮助。

+

数学高阶

+

作为计算机系的学生,我经常听到数学无用论的论断,对此我不敢苟同但也无权反对,但若凡事都硬要争出个有用和无用的区别来,倒也着实无趣,因此下面这些面向高年级甚至研究生的数学课程,大家按兴趣自取所需。

+

凸优化

+

Standford EE364A: Convex Optimization

+

信息论

+

MIT6.441: Information Theory

+

应用统计学

+

MIT18.650: Statistics for Applications

+

初等数论

+

MIT18.781: Theory of Numbers

+

密码学

+

Standford CS255: Cryptography

+

编程入门

+
+

Languages are tools, you choose the right tool to do the right thing. Since there's no universally perfect tool, there's no universally perfect language.

+
+

Shell

+ +

Python

+ +

C++

+ +

Rust

+ +

OCaml

+ +

电子基础

+

电路基础

+

作为计算机系的学生,了解一些基础的电路知识,感受从传感器收集数据到数据分析再到算法预测整条流水线,对于后续知识的学习以及计算思维的培养还是很有帮助的。EE16A&B: Designing Information Devices and Systems I&II是伯克利EE学生的大一入门课,其中EE16A注重通过电路从实际环境中收集和分析数据,而EE16B则侧重从这些收集到的数据进行分析并做出预测行为。

+

信号与系统

+

信号与系统是一门我觉得非常值得一上的课,最初学它只是为了满足我对傅里叶变换的好奇,但学完之后我才不禁感叹,傅立叶变换给我提供了一个全新的视角去看待这个世界,就如同微分方程一样,让你沉浸在用数学去精确描绘和刻画这个世界的优雅与神奇之中。 +MIT 6.003 : signal and systems提供了全部的课程录影、书面作业以及答案。也可以去看这门课的远古版本 +而UCB EE120 : Signal and Systems关于傅立叶变换的notes写得非常好,并且提供了6个非常有趣的Python编程作业,让你实践中运用信号与系统的理论与算法。

+

数据结构与算法

+

数据结构与算法

+ +

算法设计与分析

+ +

软件工程

+

入门课

+

一份“能跑”的代码,和一份高质量的工业级代码是有本质区别的。因此我非常推荐低年级的同学学习一下MIT 6.031: Software Construction这门课,它会以Java语言为基础,以丰富细致的阅读材料和精心设计的编程练习传授如何编写不易出bug、简明易懂、易于维护修改的高质量代码。大到宏观数据结构设计,小到如何写注释,遵循这些前人总结的细节和经验,对于你此后的编程生涯大有裨益。

+

专业课

+

当然,如果你想系统性地上一门软件工程的课程,那我推荐的是伯克利的UCB CS169: software engineering。但需要提醒的是,和大多学校(包括贵校)的软件工程课程不同,这门课不会涉及传统的design and document模式,即强调各种类图、流程图及文档设计,而是采用近些年流行起来的小团队快速迭代Agile Develepment开发模式以及利用云平台的Software as a service服务模式。

+

体系结构

+

入门课

+

从小我就一直听说,计算机的世界是由01构成的,我不理解但大受震撼。如果你的内心也怀有这份好奇,不妨花一到两个月的时间学习Coursera: Nand2Tetris这门无门槛的计算机课程。这门麻雀虽小五脏俱全的课程会从01开始让你亲手造出一台计算机,并在上面运行俄罗斯方块小游戏。一门课里涵盖了编译、虚拟机、汇编、体系结构、数字电路、逻辑门等等从上至下、从软至硬的各类知识,非常全面。难度上也是通过精心的设计,略去了众多现代计算机复杂的细节,提取出了最核心本质的东西,力图让每个人都能理解。在低年级,如果就能从宏观上建立对整个计算机体系的鸟瞰图,是大有裨益的。

+

专业课

+

当然,如果想深入现代计算机体系结构的复杂细节,还得上一门大学本科难度的课程UCB CS61C: Great Ideas in Computer Architecture。UC Berkeley作为RISC-V架构的发源地,在体系结构领域算得上首屈一指。其课程非常注重实践,你会在Project中手写汇编构造神经网络,从零开始搭建一个CPU,这些实践都会让你对计算机体系结构有更为深入的理解,而不是仅停留于“取指译码执行访存写回”的单调背诵里。

+

系统入门

+

计算机系统是一个庞杂而深刻的主题,在深入学习某个细分领域之前,对各个领域有一个宏观概念性的理解,对一些通用性的设计原则有所知晓,会让你在之后的深入学习中不断强化一些最为核心乃至哲学的概念,而不会桎梏于复杂的内部细节和各种trick。因为在我看来,学习系统最关键的还是想让你领悟到这些最核心的东西,从而能够设计和实现出属于自己的系统。

+

MIT6.033: System Engineering是MIT的系统入门课,主题涉及了操作系统、网络、分布式和系统安全,除了知识点的传授外,这门课还会讲授一些写作和表达上的技巧,让你学会如何设计并向别人介绍和分析自己的系统。这本书配套的教材Principles of Computer System Design: An Introduction也写得非常好,推荐大家阅读。

+

CMU 15-213: Introduction to Computer System是CMU的系统入门课,内容覆盖了体系结构、操作系统、链接、并行、网络等等,兼具广度和深度,配套的教材Computer Systems: A Programmer's Perspective也是质量极高,强烈建议阅读。

+

操作系统

+

操作系统作为所有应用软件和底层硬件交互的掌舵者,了解它的内部原理和设计原则对于一个不满足于调包侠的程序员来说是很有帮助的。同时,国外操统课程的质量也是让上了多年网课的我也感到瞠目结舌。

+

MIT 6.S081: Operating System Engineering,MIT著名PDOS实验室出品,11个Project会让你在一个2万多行的教学用迷你操作系统上增加各类功能模块。这门课也让我深刻认识到,做系统不是靠PPT念出来的,是得几万行代码一点点累起来的。

+

UCB CS162: Operating System,伯克利的操作系统课,采用和Stanford同样的Project —— 一个教学用操作系统Pintos。我作为下学期北京大学操作系统实验班的助教,会尝试引入这个Project,欢迎大家选课尝试,同时课程资源也会全部开源,目前课程网站正在建设当中。

+

并行与分布式系统

+

想必这两年各类CS讲座里最常听到的话就是“摩尔定律正在走向终结”,此话不假。同时如今深度学习的兴起导致对计算机算力与存储的要求都达到了前所未有的高度,因此并行和分布式系统已成为一项热门技术话题。

+

并行计算

+

CMU 15-418/Stanford CS149: Parallel Computing

+

分布式系统

+

MIT 6.824: Distributed System

+

系统安全

+

不知道你当年选择计算机是不是因为怀着一个中二的黑客梦想,但现实却是成为黑客道阻且长。

+

理论

+

UCB CS161: Computer Security是伯克利的系统安全课程,会涵盖栈攻击、密码学、网站安全、网络安全等等内容。

+

实践

+

掌握这些理论知识之后,还需要在实践中培养和锻炼这些“安全素养”。CTF夺旗赛是一项比较热门的系统安全比赛,赛题中会融会贯通地考察你对计算机各个领域知识的理解和运用。北大今年也成功举办了第0届和第1届,也鼓励大家后期踊跃参与,在实践中提高自己。下面列举一些我平时学习(摸鱼)用到的资源:

+ +

计算机网络

+

计网著名教材《自顶向下方法》的配套学习资源Computer Networking: A Top-Down Approach

+

没有什么能比自己写个TCP/IP协议栈更能加深自己对计算机网络的理解了,所以不妨试试Stanford CS144: Computer Network,8个Project带你实现整个协议栈。

+

数据库系统

+

没有什么能比自己写个关系型数据库更能加深自己对数据库系统的理解了。

+

C++版

+

CMU 15-445: Introduction to Database System

+

Java版

+

UCB CS186: Introduction to Database System

+

编译原理

+

没有什么能比自己写个编译器更能加深自己对编译器的理解了。

+

Stanford CS143: Compilers

+

计算机图形学

+

Games101

+

Web开发

+

网站的开发很少在计算机的培养方案里被重视,但其实掌握这项技能还是好处多多的,例如搭建自己的个人主页,抑或是给自己的课程项目做一个精彩的展示网页。

+

两周速成版

+

MIT web development course

+

系统学习版

+

Stanford CS142: Web Applications

+

数据科学

+

UCB Data100: Principles and Techniques of Data Science

+

人工智能

+

入门课

+

Harvard CS50’s Introduction to AI with Python

+

专业课

+

UCB CS188: Introduction to Artificial Intelligence

+

机器学习

+

入门课

+

Coursera: Machine Learning

+

专业课

+ +

深度学习

+

入门课

+ +

计算机视觉

+

Stanford CS231n: CNN for Visual Recognition

+

自然语言处理

+

Stanford CS224n: Natural Language Processing

+

图神经网络

+

Stanford CS224w: Machine Learning with Graphs

+

强化学习

+

UCB CS285: Deep Reinforcement Learning

+

定制属于你的课程地图

+
+

授人以鱼不如授人以渔。

+
+

以上的课程规划难免有强烈的个人倾向和喜好,不一定适合所有人,更多的是起到抛砖引玉的作用。如果你想挑选自己感兴趣的方向和内容加以学习,可以参考我在下面列出来的资源。

+ + + +
+
+
+ +
+ + + +
+
+
+
+ + + + + + + + \ No newline at end of file diff --git a/Web开发/CS142/index.html b/Web开发/CS142/index.html new file mode 100644 index 00000000..0191c551 --- /dev/null +++ b/Web开发/CS142/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + Stanford CS142: Web Applications - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + + Skip to content + + +
+
+ +
+ + + + +
+ + +
+ +
+ + + + + + +
+
+ + + +
+
+
+ + + + +
+
+
+ + + +
+
+
+ + + +
+
+
+ + +
+
+ + + + + + + +

Stanford CS142: Web Applications

+

课程简介

+
    +
  • 所属大学:Stanford
  • +
  • 先修要求:有一定的编程经验
  • +
  • 编程语言:JavaScript/HTML/CSS
  • +
  • 课程难度:🌟🌟🌟🌟
  • +
  • 预计学时:100小时
  • +
+

斯坦福的Web应用开发课程,内容覆盖了HTML、CSS、JavaScript、ReactJs、NodeJS、ExpressJS、Web安全等等。8个Project会让你在实战中锻炼自己的Web开发技巧。

+

课程资源

+ + + +
+
+
+ +
+ + + +
+
+
+
+ + + + + + + + \ No newline at end of file diff --git a/Web开发/mitweb/index.html b/Web开发/mitweb/index.html new file mode 100644 index 00000000..9ce31ff3 --- /dev/null +++ b/Web开发/mitweb/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + MIT web development course - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
+ + + + Skip to content + + +
+
+ +
+ + + + +
+ + +
+ +
+ + + + + + +
+
+ + + +
+
+
+ + + + +
+
+
+ + + +
+
+
+ + + +
+
+
+ + +
+
+ + + + + + + +

MIT Web Development Crash Course

+

课程简介

+
    +
  • 所属大学:MIT
  • +
  • 先修要求:掌握至少一门编程语言
  • +
  • 编程语言:JavaScript/HTML/CSS/NoSQL
  • +
  • 课程难度:🌟🌟🌟
  • +
  • 预计学时:因人而异
  • +
+

MIT在每年1月份会有一个为期4周的Independent Activities Period (IAP),在这个月里,MIT的学生和老师可以自由地开设很多有趣的课程,而这门网站开发课程就是其中之一。

+

在一个月的时间里,你会从零开始掌握一个网站的设计、搭建、美化、交互等等核心内容,基本覆盖了Web开发的前后端大部分技术栈。如果你不需要系统地学习网络开发,而只是出于兴趣想把它加入自己的技能包里,那么这门课将非常适合你。

+

课程资源

+
    +
  • 课程网站
  • +
  • 课程视频:参见课程网站链接
  • +
  • 课程作业:参见课程schedule
  • +
+ + +
+
+
+ +
+ + + +
+
+
+
+ + + + + + + + \ No newline at end of file diff --git a/assets/images/favicon.png b/assets/images/favicon.png new file mode 100644 index 00000000..1cf13b9f Binary files /dev/null and b/assets/images/favicon.png differ diff --git a/assets/javascripts/bundle.5a9542cf.min.js b/assets/javascripts/bundle.5a9542cf.min.js new file mode 100644 index 00000000..38825e68 --- /dev/null +++ b/assets/javascripts/bundle.5a9542cf.min.js @@ -0,0 +1,29 @@ +(()=>{var Yi=Object.create;var Mt=Object.defineProperty;var Bi=Object.getOwnPropertyDescriptor;var Gi=Object.getOwnPropertyNames,_t=Object.getOwnPropertySymbols,Ji=Object.getPrototypeOf,br=Object.prototype.hasOwnProperty,tn=Object.prototype.propertyIsEnumerable;var en=(e,t,r)=>t in e?Mt(e,t,{enumerable:!0,configurable:!0,writable:!0,value:r}):e[t]=r,F=(e,t)=>{for(var r in t||(t={}))br.call(t,r)&&en(e,r,t[r]);if(_t)for(var r of _t(t))tn.call(t,r)&&en(e,r,t[r]);return e};var Xi=e=>Mt(e,"__esModule",{value:!0});var rn=(e,t)=>{var r={};for(var n in e)br.call(e,n)&&t.indexOf(n)<0&&(r[n]=e[n]);if(e!=null&&_t)for(var n of _t(e))t.indexOf(n)<0&&tn.call(e,n)&&(r[n]=e[n]);return r};var ht=(e,t)=>()=>(t||e((t={exports:{}}).exports,t),t.exports);var Zi=(e,t,r,n)=>{if(t&&typeof t=="object"||typeof t=="function")for(let o of Gi(t))!br.call(e,o)&&(r||o!=="default")&&Mt(e,o,{get:()=>t[o],enumerable:!(n=Bi(t,o))||n.enumerable});return e},Ne=(e,t)=>Zi(Xi(Mt(e!=null?Yi(Ji(e)):{},"default",!t&&e&&e.__esModule?{get:()=>e.default,enumerable:!0}:{value:e,enumerable:!0})),e);var on=ht((vr,nn)=>{(function(e,t){typeof vr=="object"&&typeof nn!="undefined"?t():typeof define=="function"&&define.amd?define(t):t()})(vr,function(){"use strict";function e(r){var n=!0,o=!1,i=null,a={text:!0,search:!0,url:!0,tel:!0,email:!0,password:!0,number:!0,date:!0,month:!0,week:!0,time:!0,datetime:!0,"datetime-local":!0};function c(w){return!!(w&&w!==document&&w.nodeName!=="HTML"&&w.nodeName!=="BODY"&&"classList"in w&&"contains"in w.classList)}function s(w){var Ie=w.type,me=w.tagName;return!!(me==="INPUT"&&a[Ie]&&!w.readOnly||me==="TEXTAREA"&&!w.readOnly||w.isContentEditable)}function u(w){w.classList.contains("focus-visible")||(w.classList.add("focus-visible"),w.setAttribute("data-focus-visible-added",""))}function f(w){!w.hasAttribute("data-focus-visible-added")||(w.classList.remove("focus-visible"),w.removeAttribute("data-focus-visible-added"))}function l(w){w.metaKey||w.altKey||w.ctrlKey||(c(r.activeElement)&&u(r.activeElement),n=!0)}function p(w){n=!1}function d(w){!c(w.target)||(n||s(w.target))&&u(w.target)}function h(w){!c(w.target)||(w.target.classList.contains("focus-visible")||w.target.hasAttribute("data-focus-visible-added"))&&(o=!0,window.clearTimeout(i),i=window.setTimeout(function(){o=!1},100),f(w.target))}function b(w){document.visibilityState==="hidden"&&(o&&(n=!0),I())}function I(){document.addEventListener("mousemove",$),document.addEventListener("mousedown",$),document.addEventListener("mouseup",$),document.addEventListener("pointermove",$),document.addEventListener("pointerdown",$),document.addEventListener("pointerup",$),document.addEventListener("touchmove",$),document.addEventListener("touchstart",$),document.addEventListener("touchend",$)}function Q(){document.removeEventListener("mousemove",$),document.removeEventListener("mousedown",$),document.removeEventListener("mouseup",$),document.removeEventListener("pointermove",$),document.removeEventListener("pointerdown",$),document.removeEventListener("pointerup",$),document.removeEventListener("touchmove",$),document.removeEventListener("touchstart",$),document.removeEventListener("touchend",$)}function $(w){w.target.nodeName&&w.target.nodeName.toLowerCase()==="html"||(n=!1,Q())}document.addEventListener("keydown",l,!0),document.addEventListener("mousedown",p,!0),document.addEventListener("pointerdown",p,!0),document.addEventListener("touchstart",p,!0),document.addEventListener("visibilitychange",b,!0),I(),r.addEventListener("focus",d,!0),r.addEventListener("blur",h,!0),r.nodeType===Node.DOCUMENT_FRAGMENT_NODE&&r.host?r.host.setAttribute("data-js-focus-visible",""):r.nodeType===Node.DOCUMENT_NODE&&(document.documentElement.classList.add("js-focus-visible"),document.documentElement.setAttribute("data-js-focus-visible",""))}if(typeof window!="undefined"&&typeof document!="undefined"){window.applyFocusVisiblePolyfill=e;var t;try{t=new CustomEvent("focus-visible-polyfill-ready")}catch(r){t=document.createEvent("CustomEvent"),t.initCustomEvent("focus-visible-polyfill-ready",!1,!1,{})}window.dispatchEvent(t)}typeof document!="undefined"&&e(document)})});var an=ht(gr=>{(function(e){var t=function(){try{return!!Symbol.iterator}catch(u){return!1}},r=t(),n=function(u){var f={next:function(){var l=u.shift();return{done:l===void 0,value:l}}};return r&&(f[Symbol.iterator]=function(){return f}),f},o=function(u){return encodeURIComponent(u).replace(/%20/g,"+")},i=function(u){return decodeURIComponent(String(u).replace(/\+/g," "))},a=function(){var u=function(l){Object.defineProperty(this,"_entries",{writable:!0,value:{}});var p=typeof l;if(p!=="undefined")if(p==="string")l!==""&&this._fromString(l);else if(l instanceof u){var d=this;l.forEach(function(Q,$){d.append($,Q)})}else if(l!==null&&p==="object")if(Object.prototype.toString.call(l)==="[object Array]")for(var h=0;hd[0]?1:0}),u._entries&&(u._entries={});for(var l=0;l1?i(d[1]):"")}})})(typeof global!="undefined"?global:typeof window!="undefined"?window:typeof self!="undefined"?self:gr);(function(e){var t=function(){try{var o=new e.URL("b","http://a");return o.pathname="c d",o.href==="http://a/c%20d"&&o.searchParams}catch(i){return!1}},r=function(){var o=e.URL,i=function(s,u){typeof s!="string"&&(s=String(s)),u&&typeof u!="string"&&(u=String(u));var f=document,l;if(u&&(e.location===void 0||u!==e.location.href)){u=u.toLowerCase(),f=document.implementation.createHTMLDocument(""),l=f.createElement("base"),l.href=u,f.head.appendChild(l);try{if(l.href.indexOf(u)!==0)throw new Error(l.href)}catch(w){throw new Error("URL unable to set base "+u+" due to "+w)}}var p=f.createElement("a");p.href=s,l&&(f.body.appendChild(p),p.href=p.href);var d=f.createElement("input");if(d.type="url",d.value=s,p.protocol===":"||!/:/.test(p.href)||!d.checkValidity()&&!u)throw new TypeError("Invalid URL");Object.defineProperty(this,"_anchorElement",{value:p});var h=new e.URLSearchParams(this.search),b=!0,I=!0,Q=this;["append","delete","set"].forEach(function(w){var Ie=h[w];h[w]=function(){Ie.apply(h,arguments),b&&(I=!1,Q.search=h.toString(),I=!0)}}),Object.defineProperty(this,"searchParams",{value:h,enumerable:!0});var $=void 0;Object.defineProperty(this,"_updateSearchParams",{enumerable:!1,configurable:!1,writable:!1,value:function(){this.search!==$&&($=this.search,I&&(b=!1,this.searchParams._fromString(this.search),b=!0))}})},a=i.prototype,c=function(s){Object.defineProperty(a,s,{get:function(){return this._anchorElement[s]},set:function(u){this._anchorElement[s]=u},enumerable:!0})};["hash","host","hostname","port","protocol"].forEach(function(s){c(s)}),Object.defineProperty(a,"search",{get:function(){return this._anchorElement.search},set:function(s){this._anchorElement.search=s,this._updateSearchParams()},enumerable:!0}),Object.defineProperties(a,{toString:{get:function(){var s=this;return function(){return s.href}}},href:{get:function(){return this._anchorElement.href.replace(/\?$/,"")},set:function(s){this._anchorElement.href=s,this._updateSearchParams()},enumerable:!0},pathname:{get:function(){return this._anchorElement.pathname.replace(/(^\/?)/,"/")},set:function(s){this._anchorElement.pathname=s},enumerable:!0},origin:{get:function(){var s={"http:":80,"https:":443,"ftp:":21}[this._anchorElement.protocol],u=this._anchorElement.port!=s&&this._anchorElement.port!=="";return this._anchorElement.protocol+"//"+this._anchorElement.hostname+(u?":"+this._anchorElement.port:"")},enumerable:!0},password:{get:function(){return""},set:function(s){},enumerable:!0},username:{get:function(){return""},set:function(s){},enumerable:!0}}),i.createObjectURL=function(s){return o.createObjectURL.apply(o,arguments)},i.revokeObjectURL=function(s){return o.revokeObjectURL.apply(o,arguments)},e.URL=i};if(t()||r(),e.location!==void 0&&!("origin"in e.location)){var n=function(){return e.location.protocol+"//"+e.location.hostname+(e.location.port?":"+e.location.port:"")};try{Object.defineProperty(e.location,"origin",{get:n,enumerable:!0})}catch(o){setInterval(function(){e.location.origin=n()},100)}}})(typeof global!="undefined"?global:typeof window!="undefined"?window:typeof self!="undefined"?self:gr)});var Mn=ht((Ls,Ct)=>{/*! ***************************************************************************** +Copyright (c) Microsoft Corporation. + +Permission to use, copy, modify, and/or distribute this software for any +purpose with or without fee is hereby granted. + +THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH +REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY +AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, +INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM +LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR +OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR +PERFORMANCE OF THIS SOFTWARE. +***************************************************************************** */var sn,cn,un,fn,pn,ln,mn,dn,hn,Lt,yr,bn,vn,gn,Xe,yn,xn,Sn,wn,En,On,Tn,_n,At;(function(e){var t=typeof global=="object"?global:typeof self=="object"?self:typeof this=="object"?this:{};typeof define=="function"&&define.amd?define("tslib",["exports"],function(n){e(r(t,r(n)))}):typeof Ct=="object"&&typeof Ct.exports=="object"?e(r(t,r(Ct.exports))):e(r(t));function r(n,o){return n!==t&&(typeof Object.create=="function"?Object.defineProperty(n,"__esModule",{value:!0}):n.__esModule=!0),function(i,a){return n[i]=o?o(i,a):a}}})(function(e){var t=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(n,o){n.__proto__=o}||function(n,o){for(var i in o)Object.prototype.hasOwnProperty.call(o,i)&&(n[i]=o[i])};sn=function(n,o){if(typeof o!="function"&&o!==null)throw new TypeError("Class extends value "+String(o)+" is not a constructor or null");t(n,o);function i(){this.constructor=n}n.prototype=o===null?Object.create(o):(i.prototype=o.prototype,new i)},cn=Object.assign||function(n){for(var o,i=1,a=arguments.length;i=0;f--)(u=n[f])&&(s=(c<3?u(s):c>3?u(o,i,s):u(o,i))||s);return c>3&&s&&Object.defineProperty(o,i,s),s},pn=function(n,o){return function(i,a){o(i,a,n)}},ln=function(n,o){if(typeof Reflect=="object"&&typeof Reflect.metadata=="function")return Reflect.metadata(n,o)},mn=function(n,o,i,a){function c(s){return s instanceof i?s:new i(function(u){u(s)})}return new(i||(i=Promise))(function(s,u){function f(d){try{p(a.next(d))}catch(h){u(h)}}function l(d){try{p(a.throw(d))}catch(h){u(h)}}function p(d){d.done?s(d.value):c(d.value).then(f,l)}p((a=a.apply(n,o||[])).next())})},dn=function(n,o){var i={label:0,sent:function(){if(s[0]&1)throw s[1];return s[1]},trys:[],ops:[]},a,c,s,u;return u={next:f(0),throw:f(1),return:f(2)},typeof Symbol=="function"&&(u[Symbol.iterator]=function(){return this}),u;function f(p){return function(d){return l([p,d])}}function l(p){if(a)throw new TypeError("Generator is already executing.");for(;i;)try{if(a=1,c&&(s=p[0]&2?c.return:p[0]?c.throw||((s=c.return)&&s.call(c),0):c.next)&&!(s=s.call(c,p[1])).done)return s;switch(c=0,s&&(p=[p[0]&2,s.value]),p[0]){case 0:case 1:s=p;break;case 4:return i.label++,{value:p[1],done:!1};case 5:i.label++,c=p[1],p=[0];continue;case 7:p=i.ops.pop(),i.trys.pop();continue;default:if(s=i.trys,!(s=s.length>0&&s[s.length-1])&&(p[0]===6||p[0]===2)){i=0;continue}if(p[0]===3&&(!s||p[1]>s[0]&&p[1]=n.length&&(n=void 0),{value:n&&n[a++],done:!n}}};throw new TypeError(o?"Object is not iterable.":"Symbol.iterator is not defined.")},yr=function(n,o){var i=typeof Symbol=="function"&&n[Symbol.iterator];if(!i)return n;var a=i.call(n),c,s=[],u;try{for(;(o===void 0||o-- >0)&&!(c=a.next()).done;)s.push(c.value)}catch(f){u={error:f}}finally{try{c&&!c.done&&(i=a.return)&&i.call(a)}finally{if(u)throw u.error}}return s},bn=function(){for(var n=[],o=0;o1||f(b,I)})})}function f(b,I){try{l(a[b](I))}catch(Q){h(s[0][3],Q)}}function l(b){b.value instanceof Xe?Promise.resolve(b.value.v).then(p,d):h(s[0][2],b)}function p(b){f("next",b)}function d(b){f("throw",b)}function h(b,I){b(I),s.shift(),s.length&&f(s[0][0],s[0][1])}},xn=function(n){var o,i;return o={},a("next"),a("throw",function(c){throw c}),a("return"),o[Symbol.iterator]=function(){return this},o;function a(c,s){o[c]=n[c]?function(u){return(i=!i)?{value:Xe(n[c](u)),done:c==="return"}:s?s(u):u}:s}},Sn=function(n){if(!Symbol.asyncIterator)throw new TypeError("Symbol.asyncIterator is not defined.");var o=n[Symbol.asyncIterator],i;return o?o.call(n):(n=typeof Lt=="function"?Lt(n):n[Symbol.iterator](),i={},a("next"),a("throw"),a("return"),i[Symbol.asyncIterator]=function(){return this},i);function a(s){i[s]=n[s]&&function(u){return new Promise(function(f,l){u=n[s](u),c(f,l,u.done,u.value)})}}function c(s,u,f,l){Promise.resolve(l).then(function(p){s({value:p,done:f})},u)}},wn=function(n,o){return Object.defineProperty?Object.defineProperty(n,"raw",{value:o}):n.raw=o,n};var r=Object.create?function(n,o){Object.defineProperty(n,"default",{enumerable:!0,value:o})}:function(n,o){n.default=o};En=function(n){if(n&&n.__esModule)return n;var o={};if(n!=null)for(var i in n)i!=="default"&&Object.prototype.hasOwnProperty.call(n,i)&&At(o,n,i);return r(o,n),o},On=function(n){return n&&n.__esModule?n:{default:n}},Tn=function(n,o,i,a){if(i==="a"&&!a)throw new TypeError("Private accessor was defined without a getter");if(typeof o=="function"?n!==o||!a:!o.has(n))throw new TypeError("Cannot read private member from an object whose class did not declare it");return i==="m"?a:i==="a"?a.call(n):a?a.value:o.get(n)},_n=function(n,o,i,a,c){if(a==="m")throw new TypeError("Private method is not writable");if(a==="a"&&!c)throw new TypeError("Private accessor was defined without a setter");if(typeof o=="function"?n!==o||!c:!o.has(n))throw new TypeError("Cannot write private member to an object whose class did not declare it");return a==="a"?c.call(n,i):c?c.value=i:o.set(n,i),i},e("__extends",sn),e("__assign",cn),e("__rest",un),e("__decorate",fn),e("__param",pn),e("__metadata",ln),e("__awaiter",mn),e("__generator",dn),e("__exportStar",hn),e("__createBinding",At),e("__values",Lt),e("__read",yr),e("__spread",bn),e("__spreadArrays",vn),e("__spreadArray",gn),e("__await",Xe),e("__asyncGenerator",yn),e("__asyncDelegator",xn),e("__asyncValues",Sn),e("__makeTemplateObject",wn),e("__importStar",En),e("__importDefault",On),e("__classPrivateFieldGet",Tn),e("__classPrivateFieldSet",_n)})});var qr=ht((Et,Nr)=>{/*! + * clipboard.js v2.0.10 + * https://clipboardjs.com/ + * + * Licensed MIT © Zeno Rocha + */(function(t,r){typeof Et=="object"&&typeof Nr=="object"?Nr.exports=r():typeof define=="function"&&define.amd?define([],r):typeof Et=="object"?Et.ClipboardJS=r():t.ClipboardJS=r()})(Et,function(){return function(){var e={686:function(n,o,i){"use strict";i.d(o,{default:function(){return Ki}});var a=i(279),c=i.n(a),s=i(370),u=i.n(s),f=i(817),l=i.n(f);function p(P){try{return document.execCommand(P)}catch(_){return!1}}var d=function(_){var x=l()(_);return p("cut"),x},h=d;function b(P){var _=document.documentElement.getAttribute("dir")==="rtl",x=document.createElement("textarea");x.style.fontSize="12pt",x.style.border="0",x.style.padding="0",x.style.margin="0",x.style.position="absolute",x.style[_?"right":"left"]="-9999px";var j=window.pageYOffset||document.documentElement.scrollTop;return x.style.top="".concat(j,"px"),x.setAttribute("readonly",""),x.value=P,x}var I=function(_){var x=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{container:document.body},j="";if(typeof _=="string"){var L=b(_);x.container.appendChild(L),j=l()(L),p("copy"),L.remove()}else j=l()(_),p("copy");return j},Q=I;function $(P){return typeof Symbol=="function"&&typeof Symbol.iterator=="symbol"?$=function(x){return typeof x}:$=function(x){return x&&typeof Symbol=="function"&&x.constructor===Symbol&&x!==Symbol.prototype?"symbol":typeof x},$(P)}var w=function(){var _=arguments.length>0&&arguments[0]!==void 0?arguments[0]:{},x=_.action,j=x===void 0?"copy":x,L=_.container,z=_.target,we=_.text;if(j!=="copy"&&j!=="cut")throw new Error('Invalid "action" value, use either "copy" or "cut"');if(z!==void 0)if(z&&$(z)==="object"&&z.nodeType===1){if(j==="copy"&&z.hasAttribute("disabled"))throw new Error('Invalid "target" attribute. Please use "readonly" instead of "disabled" attribute');if(j==="cut"&&(z.hasAttribute("readonly")||z.hasAttribute("disabled")))throw new Error(`Invalid "target" attribute. You can't cut text from elements with "readonly" or "disabled" attributes`)}else throw new Error('Invalid "target" value, use a valid Element');if(we)return Q(we,{container:L});if(z)return j==="cut"?h(z):Q(z,{container:L})},Ie=w;function me(P){return typeof Symbol=="function"&&typeof Symbol.iterator=="symbol"?me=function(x){return typeof x}:me=function(x){return x&&typeof Symbol=="function"&&x.constructor===Symbol&&x!==Symbol.prototype?"symbol":typeof x},me(P)}function Je(P,_){if(!(P instanceof _))throw new TypeError("Cannot call a class as a function")}function Zr(P,_){for(var x=0;x<_.length;x++){var j=_[x];j.enumerable=j.enumerable||!1,j.configurable=!0,"value"in j&&(j.writable=!0),Object.defineProperty(P,j.key,j)}}function Wi(P,_,x){return _&&Zr(P.prototype,_),x&&Zr(P,x),P}function Di(P,_){if(typeof _!="function"&&_!==null)throw new TypeError("Super expression must either be null or a function");P.prototype=Object.create(_&&_.prototype,{constructor:{value:P,writable:!0,configurable:!0}}),_&&dr(P,_)}function dr(P,_){return dr=Object.setPrototypeOf||function(j,L){return j.__proto__=L,j},dr(P,_)}function Vi(P){var _=qi();return function(){var j=Ot(P),L;if(_){var z=Ot(this).constructor;L=Reflect.construct(j,arguments,z)}else L=j.apply(this,arguments);return zi(this,L)}}function zi(P,_){return _&&(me(_)==="object"||typeof _=="function")?_:Ni(P)}function Ni(P){if(P===void 0)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return P}function qi(){if(typeof Reflect=="undefined"||!Reflect.construct||Reflect.construct.sham)return!1;if(typeof Proxy=="function")return!0;try{return Date.prototype.toString.call(Reflect.construct(Date,[],function(){})),!0}catch(P){return!1}}function Ot(P){return Ot=Object.setPrototypeOf?Object.getPrototypeOf:function(x){return x.__proto__||Object.getPrototypeOf(x)},Ot(P)}function hr(P,_){var x="data-clipboard-".concat(P);if(!!_.hasAttribute(x))return _.getAttribute(x)}var Qi=function(P){Di(x,P);var _=Vi(x);function x(j,L){var z;return Je(this,x),z=_.call(this),z.resolveOptions(L),z.listenClick(j),z}return Wi(x,[{key:"resolveOptions",value:function(){var L=arguments.length>0&&arguments[0]!==void 0?arguments[0]:{};this.action=typeof L.action=="function"?L.action:this.defaultAction,this.target=typeof L.target=="function"?L.target:this.defaultTarget,this.text=typeof L.text=="function"?L.text:this.defaultText,this.container=me(L.container)==="object"?L.container:document.body}},{key:"listenClick",value:function(L){var z=this;this.listener=u()(L,"click",function(we){return z.onClick(we)})}},{key:"onClick",value:function(L){var z=L.delegateTarget||L.currentTarget,we=this.action(z)||"copy",Tt=Ie({action:we,container:this.container,target:this.target(z),text:this.text(z)});this.emit(Tt?"success":"error",{action:we,text:Tt,trigger:z,clearSelection:function(){z&&z.focus(),document.activeElement.blur(),window.getSelection().removeAllRanges()}})}},{key:"defaultAction",value:function(L){return hr("action",L)}},{key:"defaultTarget",value:function(L){var z=hr("target",L);if(z)return document.querySelector(z)}},{key:"defaultText",value:function(L){return hr("text",L)}},{key:"destroy",value:function(){this.listener.destroy()}}],[{key:"copy",value:function(L){var z=arguments.length>1&&arguments[1]!==void 0?arguments[1]:{container:document.body};return Q(L,z)}},{key:"cut",value:function(L){return h(L)}},{key:"isSupported",value:function(){var L=arguments.length>0&&arguments[0]!==void 0?arguments[0]:["copy","cut"],z=typeof L=="string"?[L]:L,we=!!document.queryCommandSupported;return z.forEach(function(Tt){we=we&&!!document.queryCommandSupported(Tt)}),we}}]),x}(c()),Ki=Qi},828:function(n){var o=9;if(typeof Element!="undefined"&&!Element.prototype.matches){var i=Element.prototype;i.matches=i.matchesSelector||i.mozMatchesSelector||i.msMatchesSelector||i.oMatchesSelector||i.webkitMatchesSelector}function a(c,s){for(;c&&c.nodeType!==o;){if(typeof c.matches=="function"&&c.matches(s))return c;c=c.parentNode}}n.exports=a},438:function(n,o,i){var a=i(828);function c(f,l,p,d,h){var b=u.apply(this,arguments);return f.addEventListener(p,b,h),{destroy:function(){f.removeEventListener(p,b,h)}}}function s(f,l,p,d,h){return typeof f.addEventListener=="function"?c.apply(null,arguments):typeof p=="function"?c.bind(null,document).apply(null,arguments):(typeof f=="string"&&(f=document.querySelectorAll(f)),Array.prototype.map.call(f,function(b){return c(b,l,p,d,h)}))}function u(f,l,p,d){return function(h){h.delegateTarget=a(h.target,l),h.delegateTarget&&d.call(f,h)}}n.exports=s},879:function(n,o){o.node=function(i){return i!==void 0&&i instanceof HTMLElement&&i.nodeType===1},o.nodeList=function(i){var a=Object.prototype.toString.call(i);return i!==void 0&&(a==="[object NodeList]"||a==="[object HTMLCollection]")&&"length"in i&&(i.length===0||o.node(i[0]))},o.string=function(i){return typeof i=="string"||i instanceof String},o.fn=function(i){var a=Object.prototype.toString.call(i);return a==="[object Function]"}},370:function(n,o,i){var a=i(879),c=i(438);function s(p,d,h){if(!p&&!d&&!h)throw new Error("Missing required arguments");if(!a.string(d))throw new TypeError("Second argument must be a String");if(!a.fn(h))throw new TypeError("Third argument must be a Function");if(a.node(p))return u(p,d,h);if(a.nodeList(p))return f(p,d,h);if(a.string(p))return l(p,d,h);throw new TypeError("First argument must be a String, HTMLElement, HTMLCollection, or NodeList")}function u(p,d,h){return p.addEventListener(d,h),{destroy:function(){p.removeEventListener(d,h)}}}function f(p,d,h){return Array.prototype.forEach.call(p,function(b){b.addEventListener(d,h)}),{destroy:function(){Array.prototype.forEach.call(p,function(b){b.removeEventListener(d,h)})}}}function l(p,d,h){return c(document.body,p,d,h)}n.exports=s},817:function(n){function o(i){var a;if(i.nodeName==="SELECT")i.focus(),a=i.value;else if(i.nodeName==="INPUT"||i.nodeName==="TEXTAREA"){var c=i.hasAttribute("readonly");c||i.setAttribute("readonly",""),i.select(),i.setSelectionRange(0,i.value.length),c||i.removeAttribute("readonly"),a=i.value}else{i.hasAttribute("contenteditable")&&i.focus();var s=window.getSelection(),u=document.createRange();u.selectNodeContents(i),s.removeAllRanges(),s.addRange(u),a=s.toString()}return a}n.exports=o},279:function(n){function o(){}o.prototype={on:function(i,a,c){var s=this.e||(this.e={});return(s[i]||(s[i]=[])).push({fn:a,ctx:c}),this},once:function(i,a,c){var s=this;function u(){s.off(i,u),a.apply(c,arguments)}return u._=a,this.on(i,u,c)},emit:function(i){var a=[].slice.call(arguments,1),c=((this.e||(this.e={}))[i]||[]).slice(),s=0,u=c.length;for(s;s{"use strict";/*! + * escape-html + * Copyright(c) 2012-2013 TJ Holowaychuk + * Copyright(c) 2015 Andreas Lubbe + * Copyright(c) 2015 Tiancheng "Timothy" Gu + * MIT Licensed + */var us=/["'&<>]/;li.exports=fs;function fs(e){var t=""+e,r=us.exec(t);if(!r)return t;var n,o="",i=0,a=0;for(i=r.index;i0},enumerable:!1,configurable:!0}),t.prototype._trySubscribe=function(r){return this._throwIfClosed(),e.prototype._trySubscribe.call(this,r)},t.prototype._subscribe=function(r){return this._throwIfClosed(),this._checkFinalizedStatuses(r),this._innerSubscribe(r)},t.prototype._innerSubscribe=function(r){var n=this,o=n.hasError,i=n.isStopped,a=n.observers;return o||i?xr:(a.push(r),new Me(function(){return He(a,r)}))},t.prototype._checkFinalizedStatuses=function(r){var n=this,o=n.hasError,i=n.thrownError,a=n.isStopped;o?r.error(i):a&&r.complete()},t.prototype.asObservable=function(){var r=new U;return r.source=this,r},t.create=function(r,n){return new Dn(r,n)},t}(U);var Dn=function(e){ee(t,e);function t(r,n){var o=e.call(this)||this;return o.destination=r,o.source=n,o}return t.prototype.next=function(r){var n,o;(o=(n=this.destination)===null||n===void 0?void 0:n.next)===null||o===void 0||o.call(n,r)},t.prototype.error=function(r){var n,o;(o=(n=this.destination)===null||n===void 0?void 0:n.error)===null||o===void 0||o.call(n,r)},t.prototype.complete=function(){var r,n;(n=(r=this.destination)===null||r===void 0?void 0:r.complete)===null||n===void 0||n.call(r)},t.prototype._subscribe=function(r){var n,o;return(o=(n=this.source)===null||n===void 0?void 0:n.subscribe(r))!==null&&o!==void 0?o:xr},t}(S);var vt={now:function(){return(vt.delegate||Date).now()},delegate:void 0};var gt=function(e){ee(t,e);function t(r,n,o){r===void 0&&(r=1/0),n===void 0&&(n=1/0),o===void 0&&(o=vt);var i=e.call(this)||this;return i._bufferSize=r,i._windowTime=n,i._timestampProvider=o,i._buffer=[],i._infiniteTimeWindow=!0,i._infiniteTimeWindow=n===1/0,i._bufferSize=Math.max(1,r),i._windowTime=Math.max(1,n),i}return t.prototype.next=function(r){var n=this,o=n.isStopped,i=n._buffer,a=n._infiniteTimeWindow,c=n._timestampProvider,s=n._windowTime;o||(i.push(r),!a&&i.push(c.now()+s)),this._trimBuffer(),e.prototype.next.call(this,r)},t.prototype._subscribe=function(r){this._throwIfClosed(),this._trimBuffer();for(var n=this._innerSubscribe(r),o=this,i=o._infiniteTimeWindow,a=o._buffer,c=a.slice(),s=0;s0?e.prototype.requestAsyncId.call(this,r,n,o):(r.actions.push(this),r._scheduled||(r._scheduled=nt.requestAnimationFrame(function(){return r.flush(void 0)})))},t.prototype.recycleAsyncId=function(r,n,o){if(o===void 0&&(o=0),o!=null&&o>0||o==null&&this.delay>0)return e.prototype.recycleAsyncId.call(this,r,n,o);r.actions.some(function(i){return i.id===n})||(nt.cancelAnimationFrame(n),r._scheduled=void 0)},t}(jt);var Nn=function(e){ee(t,e);function t(){return e!==null&&e.apply(this,arguments)||this}return t.prototype.flush=function(r){this._active=!0;var n=this._scheduled;this._scheduled=void 0;var o=this.actions,i;r=r||o.shift();do if(i=r.execute(r.state,r.delay))break;while((r=o[0])&&r.id===n&&o.shift());if(this._active=!1,i){for(;(r=o[0])&&r.id===n&&o.shift();)r.unsubscribe();throw i}},t}(Ft);var Oe=new Nn(zn);var q=new U(function(e){return e.complete()});function Ut(e){return e&&E(e.schedule)}function Lr(e){return e[e.length-1]}function $e(e){return E(Lr(e))?e.pop():void 0}function ye(e){return Ut(Lr(e))?e.pop():void 0}function Wt(e,t){return typeof Lr(e)=="number"?e.pop():t}var ot=function(e){return e&&typeof e.length=="number"&&typeof e!="function"};function Dt(e){return E(e==null?void 0:e.then)}function Vt(e){return E(e[rt])}function zt(e){return Symbol.asyncIterator&&E(e==null?void 0:e[Symbol.asyncIterator])}function Nt(e){return new TypeError("You provided "+(e!==null&&typeof e=="object"?"an invalid object":"'"+e+"'")+" where a stream was expected. You can provide an Observable, Promise, ReadableStream, Array, AsyncIterable, or Iterable.")}function aa(){return typeof Symbol!="function"||!Symbol.iterator?"@@iterator":Symbol.iterator}var qt=aa();function Qt(e){return E(e==null?void 0:e[qt])}function Kt(e){return Cn(this,arguments,function(){var r,n,o,i;return Rt(this,function(a){switch(a.label){case 0:r=e.getReader(),a.label=1;case 1:a.trys.push([1,,9,10]),a.label=2;case 2:return[4,Ht(r.read())];case 3:return n=a.sent(),o=n.value,i=n.done,i?[4,Ht(void 0)]:[3,5];case 4:return[2,a.sent()];case 5:return[4,Ht(o)];case 6:return[4,a.sent()];case 7:return a.sent(),[3,2];case 8:return[3,10];case 9:return r.releaseLock(),[7];case 10:return[2]}})})}function Yt(e){return E(e==null?void 0:e.getReader)}function V(e){if(e instanceof U)return e;if(e!=null){if(Vt(e))return sa(e);if(ot(e))return ca(e);if(Dt(e))return ua(e);if(zt(e))return qn(e);if(Qt(e))return fa(e);if(Yt(e))return pa(e)}throw Nt(e)}function sa(e){return new U(function(t){var r=e[rt]();if(E(r.subscribe))return r.subscribe(t);throw new TypeError("Provided object does not correctly implement Symbol.observable")})}function ca(e){return new U(function(t){for(var r=0;r=2,!0))}function fe(e){e===void 0&&(e={});var t=e.connector,r=t===void 0?function(){return new S}:t,n=e.resetOnError,o=n===void 0?!0:n,i=e.resetOnComplete,a=i===void 0?!0:i,c=e.resetOnRefCountZero,s=c===void 0?!0:c;return function(u){var f=null,l=null,p=null,d=0,h=!1,b=!1,I=function(){l==null||l.unsubscribe(),l=null},Q=function(){I(),f=p=null,h=b=!1},$=function(){var w=f;Q(),w==null||w.unsubscribe()};return v(function(w,Ie){d++,!b&&!h&&I();var me=p=p!=null?p:r();Ie.add(function(){d--,d===0&&!b&&!h&&(l=Ir($,s))}),me.subscribe(Ie),f||(f=new tt({next:function(Je){return me.next(Je)},error:function(Je){b=!0,I(),l=Ir(Q,o,Je),me.error(Je)},complete:function(){h=!0,I(),l=Ir(Q,a),me.complete()}}),te(w).subscribe(f))})(u)}}function Ir(e,t){for(var r=[],n=2;ne.next(document)),e}function J(e,t=document){return Array.from(t.querySelectorAll(e))}function B(e,t=document){let r=ce(e,t);if(typeof r=="undefined")throw new ReferenceError(`Missing element: expected "${e}" to be present`);return r}function ce(e,t=document){return t.querySelector(e)||void 0}function We(){return document.activeElement instanceof HTMLElement&&document.activeElement||void 0}function Zt(e){return A(y(document.body,"focusin"),y(document.body,"focusout")).pipe(Ye(1),m(()=>{let t=We();return typeof t!="undefined"?e.contains(t):!1}),N(e===We()),Y())}function De(e){return{x:e.offsetLeft,y:e.offsetTop}}function po(e){return A(y(window,"load"),y(window,"resize")).pipe(Pe(0,Oe),m(()=>De(e)),N(De(e)))}function lo(e){return{x:e.scrollLeft,y:e.scrollTop}}function er(e){return A(y(e,"scroll"),y(window,"resize")).pipe(Pe(0,Oe),m(()=>lo(e)),N(lo(e)))}var ho=function(){if(typeof Map!="undefined")return Map;function e(t,r){var n=-1;return t.some(function(o,i){return o[0]===r?(n=i,!0):!1}),n}return function(){function t(){this.__entries__=[]}return Object.defineProperty(t.prototype,"size",{get:function(){return this.__entries__.length},enumerable:!0,configurable:!0}),t.prototype.get=function(r){var n=e(this.__entries__,r),o=this.__entries__[n];return o&&o[1]},t.prototype.set=function(r,n){var o=e(this.__entries__,r);~o?this.__entries__[o][1]=n:this.__entries__.push([r,n])},t.prototype.delete=function(r){var n=this.__entries__,o=e(n,r);~o&&n.splice(o,1)},t.prototype.has=function(r){return!!~e(this.__entries__,r)},t.prototype.clear=function(){this.__entries__.splice(0)},t.prototype.forEach=function(r,n){n===void 0&&(n=null);for(var o=0,i=this.__entries__;o0},e.prototype.connect_=function(){!Dr||this.connected_||(document.addEventListener("transitionend",this.onTransitionEnd_),window.addEventListener("resize",this.refresh),Pa?(this.mutationsObserver_=new MutationObserver(this.refresh),this.mutationsObserver_.observe(document,{attributes:!0,childList:!0,characterData:!0,subtree:!0})):(document.addEventListener("DOMSubtreeModified",this.refresh),this.mutationEventsAdded_=!0),this.connected_=!0)},e.prototype.disconnect_=function(){!Dr||!this.connected_||(document.removeEventListener("transitionend",this.onTransitionEnd_),window.removeEventListener("resize",this.refresh),this.mutationsObserver_&&this.mutationsObserver_.disconnect(),this.mutationEventsAdded_&&document.removeEventListener("DOMSubtreeModified",this.refresh),this.mutationsObserver_=null,this.mutationEventsAdded_=!1,this.connected_=!1)},e.prototype.onTransitionEnd_=function(t){var r=t.propertyName,n=r===void 0?"":r,o=Ha.some(function(i){return!!~n.indexOf(i)});o&&this.refresh()},e.getInstance=function(){return this.instance_||(this.instance_=new e),this.instance_},e.instance_=null,e}(),bo=function(e,t){for(var r=0,n=Object.keys(t);r0},e}(),go=typeof WeakMap!="undefined"?new WeakMap:new ho,yo=function(){function e(t){if(!(this instanceof e))throw new TypeError("Cannot call a class as a function.");if(!arguments.length)throw new TypeError("1 argument required, but only 0 present.");var r=ka.getInstance(),n=new Na(t,r,this);go.set(this,n)}return e}();["observe","unobserve","disconnect"].forEach(function(e){yo.prototype[e]=function(){var t;return(t=go.get(this))[e].apply(t,arguments)}});var qa=function(){return typeof tr.ResizeObserver!="undefined"?tr.ResizeObserver:yo}(),xo=qa;var So=new S,Qa=W(()=>R(new xo(e=>{for(let t of e)So.next(t)}))).pipe(T(e=>A(xe,R(e)).pipe(C(()=>e.disconnect()))),X(1));function Le(e){return{width:e.offsetWidth,height:e.offsetHeight}}function be(e){return Qa.pipe(O(t=>t.observe(e)),T(t=>So.pipe(M(({target:r})=>r===e),C(()=>t.unobserve(e)),m(()=>Le(e)))),N(Le(e)))}function or(e){return{width:e.scrollWidth,height:e.scrollHeight}}var Ka=new S,uv=W(()=>R(new IntersectionObserver(e=>{for(let t of e)Ka.next(t)},{threshold:1}))).pipe(T(e=>A(xe,R(e)).pipe(C(()=>e.disconnect()))),X(1));function wo(e,t=16){return er(e).pipe(m(({y:r})=>{let n=Le(e),o=or(e);return r>=o.height-n.height-t}),Y())}var ir={drawer:B("[data-md-toggle=drawer]"),search:B("[data-md-toggle=search]")};function Eo(e){return ir[e].checked}function Ve(e,t){ir[e].checked!==t&&ir[e].click()}function ar(e){let t=ir[e];return y(t,"change").pipe(m(()=>t.checked),N(t.checked))}function Ya(e,t){switch(e.constructor){case HTMLInputElement:return e.type==="radio"?/^Arrow/.test(t):!0;case HTMLSelectElement:case HTMLTextAreaElement:return!0;default:return e.isContentEditable}}function Oo(){return y(window,"keydown").pipe(M(e=>!(e.metaKey||e.ctrlKey)),m(e=>({mode:Eo("search")?"search":"global",type:e.key,claim(){e.preventDefault(),e.stopPropagation()}})),M(({mode:e,type:t})=>{if(e==="global"){let r=We();if(typeof r!="undefined")return!Ya(r,t)}return!0}),fe())}function Ae(){return new URL(location.href)}function To(e){location.href=e.href}function _o(){return new S}function Mo(e,t){if(typeof t=="string"||typeof t=="number")e.innerHTML+=t.toString();else if(t instanceof Node)e.appendChild(t);else if(Array.isArray(t))for(let r of t)Mo(e,r)}function H(e,t,...r){let n=document.createElement(e);if(t)for(let o of Object.keys(t))typeof t[o]!="boolean"?n.setAttribute(o,t[o]):t[o]&&n.setAttribute(o,"");for(let o of r)Mo(n,o);return n}function Lo(e,t){let r=t;if(e.length>r){for(;e[r]!==" "&&--r>0;);return`${e.substring(0,r)}...`}return e}function sr(e){if(e>999){let t=+((e-950)%1e3>99);return`${((e+1e-6)/1e3).toFixed(t)}k`}else return e.toString()}function Ao(){return location.hash.substring(1)}function Co(e){let t=H("a",{href:e});t.addEventListener("click",r=>r.stopPropagation()),t.click()}function Ba(){return y(window,"hashchange").pipe(m(Ao),N(Ao()),M(e=>e.length>0),X(1))}function Ro(){return Ba().pipe(m(e=>ce(`[id="${e}"]`)),M(e=>typeof e!="undefined"))}function Vr(e){let t=matchMedia(e);return Jt(r=>t.addListener(()=>r(t.matches))).pipe(N(t.matches))}function Ho(){let e=matchMedia("print");return A(y(window,"beforeprint").pipe(re(!0)),y(window,"afterprint").pipe(re(!1))).pipe(N(e.matches))}function zr(e,t){return e.pipe(T(r=>r?t():q))}function cr(e,t={credentials:"same-origin"}){return te(fetch(`${e}`,t)).pipe(M(r=>r.status===200),Ue(()=>q))}function Ce(e,t){return cr(e,t).pipe(T(r=>r.json()),X(1))}function Po(e,t){let r=new DOMParser;return cr(e,t).pipe(T(n=>n.text()),m(n=>r.parseFromString(n,"text/xml")),X(1))}function ko(){return{x:Math.max(0,scrollX),y:Math.max(0,scrollY)}}function Io(){return A(y(window,"scroll",{passive:!0}),y(window,"resize",{passive:!0})).pipe(m(ko),N(ko()))}function $o(){return{width:innerWidth,height:innerHeight}}function jo(){return y(window,"resize",{passive:!0}).pipe(m($o),N($o()))}function Fo(){return K([Io(),jo()]).pipe(m(([e,t])=>({offset:e,size:t})),X(1))}function ur(e,{viewport$:t,header$:r}){let n=t.pipe(G("size")),o=K([n,r]).pipe(m(()=>De(e)));return K([r,t,o]).pipe(m(([{height:i},{offset:a,size:c},{x:s,y:u}])=>({offset:{x:a.x-s,y:a.y-u+i},size:c})))}function Uo(e,{tx$:t}){let r=y(e,"message").pipe(m(({data:n})=>n));return t.pipe(wt(()=>r,{leading:!0,trailing:!0}),O(n=>e.postMessage(n)),$r(r),fe())}var Ga=B("#__config"),pt=JSON.parse(Ga.textContent);pt.base=`${new URL(pt.base,Ae())}`;function ve(){return pt}function ae(e){return pt.features.includes(e)}function Z(e,t){return typeof t!="undefined"?pt.translations[e].replace("#",t.toString()):pt.translations[e]}function Re(e,t=document){return B(`[data-md-component=${e}]`,t)}function ne(e,t=document){return J(`[data-md-component=${e}]`,t)}var Go=Ne(qr());function Wo(e){return H("aside",{class:"md-annotation",tabIndex:0},H("div",{class:"md-annotation__inner md-tooltip"},H("div",{class:"md-tooltip__inner md-typeset"})),H("span",{class:"md-annotation__index"},H("span",{"data-md-annotation-id":e})))}function Do(e){return H("button",{class:"md-clipboard md-icon",title:Z("clipboard.copy"),"data-clipboard-target":`#${e} > code`})}function Qr(e,t){let r=t&2,n=t&1,o=Object.keys(e.terms).filter(a=>!e.terms[a]).reduce((a,c)=>[...a,H("del",null,c)," "],[]).slice(0,-1),i=new URL(e.location);return ae("search.highlight")&&i.searchParams.set("h",Object.entries(e.terms).filter(([,a])=>a).reduce((a,[c])=>`${a} ${c}`.trim(),"")),H("a",{href:`${i}`,class:"md-search-result__link",tabIndex:-1},H("article",{class:["md-search-result__article",...r?["md-search-result__article--document"]:[]].join(" "),"data-md-score":e.score.toFixed(2)},r>0&&H("div",{class:"md-search-result__icon md-icon"}),H("h1",{class:"md-search-result__title"},e.title),n>0&&e.text.length>0&&H("p",{class:"md-search-result__teaser"},Lo(e.text,320)),n>0&&o.length>0&&H("p",{class:"md-search-result__terms"},Z("search.result.term.missing"),": ",o)))}function Vo(e){let t=e[0].score,r=[...e],n=r.findIndex(u=>!u.location.includes("#")),[o]=r.splice(n,1),i=r.findIndex(u=>u.scoreQr(u,1)),...c.length?[H("details",{class:"md-search-result__more"},H("summary",{tabIndex:-1},c.length>0&&c.length===1?Z("search.result.more.one"):Z("search.result.more.other",c.length)),c.map(u=>Qr(u,1)))]:[]];return H("li",{class:"md-search-result__item"},s)}function zo(e){return H("ul",{class:"md-source__facts"},Object.entries(e).map(([t,r])=>H("li",{class:`md-source__fact md-source__fact--${t}`},typeof r=="number"?sr(r):r)))}function No(e){return H("div",{class:"md-typeset__scrollwrap"},H("div",{class:"md-typeset__table"},e))}function Ja(e){let t=ve(),r=new URL(`../${e.version}/`,t.base);return H("li",{class:"md-version__item"},H("a",{href:r.toString(),class:"md-version__link"},e.title))}function qo(e,t){return H("div",{class:"md-version"},H("button",{class:"md-version__current","aria-label":Z("select.version.title")},t.title),H("ul",{class:"md-version__list"},e.map(Ja)))}function Xa(e,t){let r=W(()=>K([po(e),er(t)])).pipe(m(([{x:n,y:o},i])=>{let{width:a}=Le(e);return{x:n-i.x+a/2,y:o-i.y}}));return Zt(e).pipe(T(n=>r.pipe(m(o=>({active:n,offset:o})),le(+!n||1/0))))}function Qo(e,t){return W(()=>{let r=new S;r.subscribe({next({offset:i}){e.style.setProperty("--md-tooltip-x",`${i.x}px`),e.style.setProperty("--md-tooltip-y",`${i.y}px`)},complete(){e.style.removeProperty("--md-tooltip-x"),e.style.removeProperty("--md-tooltip-y")}}),r.pipe(Ur(500,Oe),m(()=>t.getBoundingClientRect()),m(({x:i})=>i)).subscribe({next(i){i?e.style.setProperty("--md-tooltip-0",`${-i}px`):e.style.removeProperty("--md-tooltip-0")},complete(){e.style.removeProperty("--md-tooltip-0")}});let n=B(":scope > :last-child",e),o=y(n,"mousedown",{once:!0});return r.pipe(T(({active:i})=>i?o:q),O(i=>i.preventDefault())).subscribe(()=>e.blur()),Xa(e,t).pipe(O(i=>r.next(i)),C(()=>r.complete()),m(i=>F({ref:e},i)))})}function Za(e){let t=[];for(let r of J(".c, .c1, .cm",e)){let n,o=r.firstChild;for(;n=/\((\d+)\)/.exec(o.textContent);){let i=o.splitText(n.index);o=i.splitText(n[0].length),t.push(i)}}return t}function Ko(e,t){t.append(...Array.from(e.childNodes))}function Yo(e,t,{print$:r}){let n=new Map;for(let o of Za(t)){let[,i]=o.textContent.match(/\((\d+)\)/);ce(`li:nth-child(${i})`,e)&&(n.set(+i,Wo(+i)),o.replaceWith(n.get(+i)))}return n.size===0?q:W(()=>{let o=new S;return r.pipe(se(o.pipe(ue(1)))).subscribe(i=>{e.hidden=!i;for(let[a,c]of n){let s=B(".md-typeset",c),u=B(`li:nth-child(${a})`,e);i?Ko(s,u):Ko(u,s)}}),A(...[...n].map(([,i])=>Qo(i,t))).pipe(C(()=>o.complete()),fe())})}var es=0;function Jo(e){if(e.nextElementSibling){let t=e.nextElementSibling;if(t.tagName==="OL")return t;if(t.tagName==="P"&&!t.children.length)return Jo(t)}}function Bo(e){return be(e).pipe(m(({width:t})=>({scrollable:or(e).width>t})),G("scrollable"))}function Xo(e,t){let{matches:r}=matchMedia("(hover)");return W(()=>{let n=new S;if(n.subscribe(({scrollable:i})=>{i&&r?e.setAttribute("tabindex","0"):e.removeAttribute("tabindex")}),Go.default.isSupported()){let i=e.closest("pre");i.id=`__code_${++es}`,i.insertBefore(Do(i.id),e)}let o=e.closest([":not(td):not(.code) > .highlight",".highlighttable"].join(", "));if(o instanceof HTMLElement){let i=Jo(o);if(typeof i!="undefined"&&(o.classList.contains("annotate")||ae("content.code.annotate"))){let a=Yo(i,e,t);return Bo(e).pipe(O(c=>n.next(c)),C(()=>n.complete()),m(c=>F({ref:e},c)),Ge(be(o).pipe(se(n.pipe(ue(1))),m(({width:c,height:s})=>c&&s),Y(),T(c=>c?a:q))))}}return Bo(e).pipe(O(i=>n.next(i)),C(()=>n.complete()),m(i=>F({ref:e},i)))})}function ts(e,{target$:t,print$:r}){let n=!0;return A(t.pipe(m(o=>o.closest("details:not([open])")),M(o=>e===o),re({action:"open",reveal:!0})),r.pipe(M(o=>o||!n),O(()=>n=e.open),m(o=>({action:o?"open":"close"}))))}function Zo(e,t){return W(()=>{let r=new S;return r.subscribe(({action:n,reveal:o})=>{n==="open"?e.setAttribute("open",""):e.removeAttribute("open"),o&&e.scrollIntoView()}),ts(e,t).pipe(O(n=>r.next(n)),C(()=>r.complete()),m(n=>F({ref:e},n)))})}var ei=H("table");function ti(e){return e.replaceWith(ei),ei.replaceWith(No(e)),R({ref:e})}function rs(e){let t=J(":scope > input",e);return A(...t.map(r=>y(r,"change").pipe(re({active:B(`label[for=${r.id}]`)})))).pipe(N({active:B(`label[for=${t[0].id}]`)}))}function ri(e){let t=B(".tabbed-labels",e);return W(()=>{let r=new S;return K([r,be(e)]).pipe(Pe(1,Oe),se(r.pipe(ue(1)))).subscribe({next([{active:n}]){let o=De(n),{width:i}=Le(n);e.style.setProperty("--md-indicator-x",`${o.x}px`),e.style.setProperty("--md-indicator-width",`${i}px`),t.scrollTo({behavior:"smooth",left:o.x})},complete(){e.style.removeProperty("--md-indicator-x"),e.style.removeProperty("--md-indicator-width")}}),rs(e).pipe(O(n=>r.next(n)),C(()=>r.complete()),m(n=>F({ref:e},n)))})}function ni(e,{target$:t,print$:r}){return A(...J("pre > code",e).map(n=>Xo(n,{print$:r})),...J("table:not([class])",e).map(n=>ti(n)),...J("details",e).map(n=>Zo(n,{target$:t,print$:r})),...J("[data-tabs]",e).map(n=>ri(n)))}function ns(e,{alert$:t}){return t.pipe(T(r=>A(R(!0),R(!1).pipe(ke(2e3))).pipe(m(n=>({message:r,active:n})))))}function oi(e,t){let r=B(".md-typeset",e);return W(()=>{let n=new S;return n.subscribe(({message:o,active:i})=>{r.textContent=o,i?e.setAttribute("data-md-state","open"):e.removeAttribute("data-md-state")}),ns(e,t).pipe(O(o=>n.next(o)),C(()=>n.complete()),m(o=>F({ref:e},o)))})}function os({viewport$:e}){if(!ae("header.autohide"))return R(!1);let t=e.pipe(m(({offset:{y:o}})=>o),Te(2,1),m(([o,i])=>[oMath.abs(i-o.y)>100),m(([,[o]])=>o),Y()),n=ar("search");return K([e,n]).pipe(m(([{offset:o},i])=>o.y>400&&!i),Y(),T(o=>o?r:R(!1)),N(!1))}function ii(e,t){return W(()=>{let r=getComputedStyle(e);return R(r.position==="sticky"||r.position==="-webkit-sticky")}).pipe(st(be(e),os(t)),m(([r,{height:n},o])=>({height:r?n:0,sticky:r,hidden:o})),Y((r,n)=>r.sticky===n.sticky&&r.height===n.height&&r.hidden===n.hidden),X(1))}function ai(e,{header$:t,main$:r}){return W(()=>{let n=new S;return n.pipe(G("active"),st(t)).subscribe(([{active:o},{hidden:i}])=>{o?e.setAttribute("data-md-state",i?"hidden":"shadow"):e.removeAttribute("data-md-state")}),r.subscribe(n),t.pipe(se(n.pipe(ue(1))),m(o=>F({ref:e},o)))})}function is(e,{viewport$:t,header$:r}){return ur(e,{viewport$:t,header$:r}).pipe(m(({offset:{y:n}})=>{let{height:o}=Le(e);return{active:n>=o}}),G("active"))}function si(e,t){return W(()=>{let r=new S;r.subscribe(({active:o})=>{o?e.setAttribute("data-md-state","active"):e.removeAttribute("data-md-state")});let n=ce("article h1");return typeof n=="undefined"?q:is(n,t).pipe(O(o=>r.next(o)),C(()=>r.complete()),m(o=>F({ref:e},o)))})}function ci(e,{viewport$:t,header$:r}){let n=r.pipe(m(({height:i})=>i),Y()),o=n.pipe(T(()=>be(e).pipe(m(({height:i})=>({top:e.offsetTop,bottom:e.offsetTop+i})),G("bottom"))));return K([n,o,t]).pipe(m(([i,{top:a,bottom:c},{offset:{y:s},size:{height:u}}])=>(u=Math.max(0,u-Math.max(0,a-s,i)-Math.max(0,u+s-c)),{offset:a-i,height:u,active:a-i<=s})),Y((i,a)=>i.offset===a.offset&&i.height===a.height&&i.active===a.active))}function as(e){let t=__md_get("__palette")||{index:e.findIndex(r=>matchMedia(r.getAttribute("data-md-color-media")).matches)};return R(...e).pipe(ie(r=>y(r,"change").pipe(re(r))),N(e[Math.max(0,t.index)]),m(r=>({index:e.indexOf(r),color:{scheme:r.getAttribute("data-md-color-scheme"),primary:r.getAttribute("data-md-color-primary"),accent:r.getAttribute("data-md-color-accent")}})),X(1))}function ui(e){return W(()=>{let t=new S;t.subscribe(n=>{for(let[o,i]of Object.entries(n.color))document.body.setAttribute(`data-md-color-${o}`,i);for(let o=0;ot.next(n)),C(()=>t.complete()),m(n=>F({ref:e},n)))})}var Kr=Ne(qr());function ss(e){e.setAttribute("data-md-copying","");let t=e.innerText;return e.removeAttribute("data-md-copying"),t}function fi({alert$:e}){Kr.default.isSupported()&&new U(t=>{new Kr.default("[data-clipboard-target], [data-clipboard-text]",{text:r=>r.getAttribute("data-clipboard-text")||ss(B(r.getAttribute("data-clipboard-target")))}).on("success",r=>t.next(r))}).pipe(O(t=>{t.trigger.focus()}),re(Z("clipboard.copied"))).subscribe(e)}function cs(e){if(e.length<2)return e;let[t,r]=e.sort((i,a)=>i.length-a.length).map(i=>i.replace(/[^/]+$/,"")),n=0;if(t===r)n=t.length;else for(;t.charCodeAt(n)===r.charCodeAt(n);)n++;let o=ve();return e.map(i=>i.replace(t.slice(0,n),o.base))}function pi({document$:e,location$:t,viewport$:r}){let n=ve();if(location.protocol==="file:")return;"scrollRestoration"in history&&(history.scrollRestoration="manual",y(window,"beforeunload").subscribe(()=>{history.scrollRestoration="auto"}));let o=ce("link[rel=icon]");typeof o!="undefined"&&(o.href=o.href);let i=Po(new URL("sitemap.xml",n.base)).pipe(m(u=>cs(J("loc",u).map(f=>f.textContent))),T(u=>y(document.body,"click").pipe(M(f=>!f.metaKey&&!f.ctrlKey),T(f=>{if(f.target instanceof Element){let l=f.target.closest("a");if(l&&!l.target){let p=new URL(l.href);if(p.search="",p.hash="",p.pathname!==location.pathname&&u.includes(p.toString()))return f.preventDefault(),R({url:new URL(l.href)})}}return xe}))),fe()),a=y(window,"popstate").pipe(M(u=>u.state!==null),m(u=>({url:new URL(location.href),offset:u.state})),fe());A(i,a).pipe(Y((u,f)=>u.url.href===f.url.href),m(({url:u})=>u)).subscribe(t);let c=t.pipe(G("pathname"),T(u=>cr(u.href).pipe(Ue(()=>(To(u),xe)))),fe());i.pipe(ct(c)).subscribe(({url:u})=>{history.pushState({},"",`${u}`)});let s=new DOMParser;c.pipe(T(u=>u.text()),m(u=>s.parseFromString(u,"text/html"))).subscribe(e),e.pipe(ut(1)).subscribe(u=>{for(let f of["title","link[rel=canonical]","meta[name=author]","meta[name=description]","[data-md-component=announce]","[data-md-component=container]","[data-md-component=header-topic]","[data-md-component=logo]","[data-md-component=skip]",...ae("navigation.tabs.sticky")?["[data-md-component=tabs]"]:[]]){let l=ce(f),p=ce(f,u);typeof l!="undefined"&&typeof p!="undefined"&&l.replaceWith(p)}}),e.pipe(ut(1),m(()=>Re("container")),T(u=>R(...J("script",u))),Rr(u=>{let f=H("script");if(u.src){for(let l of u.getAttributeNames())f.setAttribute(l,u.getAttribute(l));return u.replaceWith(f),new U(l=>{f.onload=()=>l.complete()})}else return f.textContent=u.textContent,u.replaceWith(f),q})).subscribe(),A(i,a).pipe(ct(e)).subscribe(({url:u,offset:f})=>{u.hash&&!f?Co(u.hash):window.scrollTo(0,(f==null?void 0:f.y)||0)}),r.pipe(St(i),Ye(250),G("offset")).subscribe(({offset:u})=>{history.replaceState(u,"")}),A(i,a).pipe(Te(2,1),M(([u,f])=>u.url.pathname===f.url.pathname),m(([,u])=>u)).subscribe(({offset:u})=>{window.scrollTo(0,(u==null?void 0:u.y)||0)})}var ps=Ne(Yr());var mi=Ne(Yr());function Br(e,t){let r=new RegExp(e.separator,"img"),n=(o,i,a)=>`${i}${a}`;return o=>{o=o.replace(/[\s*+\-:~^]+/g," ").trim();let i=new RegExp(`(^|${e.separator})(${o.replace(/[|\\{}()[\]^$+*?.-]/g,"\\$&").replace(r,"|")})`,"img");return a=>(t?(0,mi.default)(a):a).replace(i,n).replace(/<\/mark>(\s+)]*>/img,"$1")}}function di(e){return e.split(/"([^"]+)"/g).map((t,r)=>r&1?t.replace(/^\b|^(?![^\x00-\x7F]|$)|\s+/g," +"):t).join("").replace(/"|(?:^|\s+)[*+\-:^~]+(?=\s+|$)/g,"").trim()}function lt(e){return e.type===1}function hi(e){return e.type===2}function mt(e){return e.type===3}function ms({config:e,docs:t}){e.lang.length===1&&e.lang[0]==="en"&&(e.lang=[Z("search.config.lang")]),e.separator==="[\\s\\-]+"&&(e.separator=Z("search.config.separator"));let n={pipeline:Z("search.config.pipeline").split(/\s*,\s*/).filter(Boolean),suggestions:ae("search.suggest")};return{config:e,docs:t,options:n}}function bi(e,t){let r=ve(),n=new Worker(e),o=new S,i=Uo(n,{tx$:o}).pipe(m(a=>{if(mt(a))for(let c of a.data.items)for(let s of c)s.location=`${new URL(s.location,r.base)}`;return a}),fe());return te(t).pipe(m(a=>({type:0,data:ms(a)}))).subscribe(o.next.bind(o)),{tx$:o,rx$:i}}function vi(){let e=ve(),t=Ce(new URL("../versions.json",e.base)),r=t.pipe(m(n=>{let[,o]=e.base.match(/([^/]+)\/?$/);return n.find(({version:i,aliases:a})=>i===o||a.includes(o))||n[0]}));K([t,r]).subscribe(([n,o])=>{var a;if(B(".md-header__topic").appendChild(qo(n,o)),__md_get("__outdated",sessionStorage)===null){let c=((a=e.version)==null?void 0:a.default)||"latest",s=!o.aliases.includes(c);if(__md_set("__outdated",s,sessionStorage),s)for(let u of ne("outdated"))u.hidden=!1}})}function ds(e,{rx$:t}){let r=(__search==null?void 0:__search.transform)||di,{searchParams:n}=Ae();n.has("q")&&Ve("search",!0);let o=t.pipe(M(lt),le(1),m(()=>n.get("q")||""));o.subscribe(c=>{c&&(e.value=c)});let i=Zt(e),a=A(y(e,"keyup"),y(e,"focus").pipe(ke(1)),o).pipe(m(()=>r(e.value)),N(""),Y());return K([a,i]).pipe(m(([c,s])=>({value:c,focus:s})),X(1))}function gi(e,{tx$:t,rx$:r}){let n=new S;return n.pipe(G("value"),m(({value:o})=>({type:2,data:o}))).subscribe(t.next.bind(t)),n.pipe(G("focus")).subscribe(({focus:o})=>{o?(Ve("search",o),e.placeholder=""):e.placeholder=Z("search.placeholder")}),y(e.form,"reset").pipe(se(n.pipe(ue(1)))).subscribe(()=>e.focus()),ds(e,{tx$:t,rx$:r}).pipe(O(o=>n.next(o)),C(()=>n.complete()),m(o=>F({ref:e},o)))}function yi(e,{rx$:t},{query$:r}){let n=new S,o=wo(e.parentElement).pipe(M(Boolean)),i=B(":scope > :first-child",e),a=B(":scope > :last-child",e),c=t.pipe(M(lt),le(1));return n.pipe(_e(r),St(c)).subscribe(([{items:u},{value:f}])=>{if(f)switch(u.length){case 0:i.textContent=Z("search.result.none");break;case 1:i.textContent=Z("search.result.one");break;default:i.textContent=Z("search.result.other",sr(u.length))}else i.textContent=Z("search.result.placeholder")}),n.pipe(O(()=>a.innerHTML=""),T(({items:u})=>A(R(...u.slice(0,10)),R(...u.slice(10)).pipe(Te(4),Wr(o),T(([f])=>R(...f)))))).subscribe(u=>a.appendChild(Vo(u))),t.pipe(M(mt),m(({data:u})=>u)).pipe(O(u=>n.next(u)),C(()=>n.complete()),m(u=>F({ref:e},u)))}function hs(e,{query$:t}){return t.pipe(m(({value:r})=>{let n=Ae();return n.hash="",n.searchParams.delete("h"),n.searchParams.set("q",r),{url:n}}))}function xi(e,t){let r=new S;return r.subscribe(({url:n})=>{e.setAttribute("data-clipboard-text",e.href),e.href=`${n}`}),y(e,"click").subscribe(n=>n.preventDefault()),hs(e,t).pipe(O(n=>r.next(n)),C(()=>r.complete()),m(n=>F({ref:e},n)))}function Si(e,{rx$:t},{keyboard$:r}){let n=new S,o=Re("search-query"),i=A(y(o,"keydown"),y(o,"focus")).pipe(Qe(ge),m(()=>o.value),Y());return n.pipe(st(i),m(([{suggestions:c},s])=>{let u=s.split(/([\s-]+)/);if((c==null?void 0:c.length)&&u[u.length-1]){let f=c[c.length-1];f.startsWith(u[u.length-1])&&(u[u.length-1]=f)}else u.length=0;return u})).subscribe(c=>e.innerHTML=c.join("").replace(/\s/g," ")),r.pipe(M(({mode:c})=>c==="search")).subscribe(c=>{switch(c.type){case"ArrowRight":e.innerText.length&&o.selectionStart===o.value.length&&(o.value=e.innerText);break}}),t.pipe(M(mt),m(({data:c})=>c)).pipe(O(c=>n.next(c)),C(()=>n.complete()),m(()=>({ref:e})))}function wi(e,{index$:t,keyboard$:r}){let n=ve();try{let o=(__search==null?void 0:__search.worker)||n.search,i=bi(o,t),a=Re("search-query",e),c=Re("search-result",e),{tx$:s,rx$:u}=i;s.pipe(M(hi),ct(u.pipe(M(lt))),le(1)).subscribe(s.next.bind(s)),r.pipe(M(({mode:p})=>p==="search")).subscribe(p=>{let d=We();switch(p.type){case"Enter":if(d===a){let h=new Map;for(let b of J(":first-child [href]",c)){let I=b.firstElementChild;h.set(b,parseFloat(I.getAttribute("data-md-score")))}if(h.size){let[[b]]=[...h].sort(([,I],[,Q])=>Q-I);b.click()}p.claim()}break;case"Escape":case"Tab":Ve("search",!1),a.blur();break;case"ArrowUp":case"ArrowDown":if(typeof d=="undefined")a.focus();else{let h=[a,...J(":not(details) > [href], summary, details[open] [href]",c)],b=Math.max(0,(Math.max(0,h.indexOf(d))+h.length+(p.type==="ArrowUp"?-1:1))%h.length);h[b].focus()}p.claim();break;default:a!==We()&&a.focus()}}),r.pipe(M(({mode:p})=>p==="global")).subscribe(p=>{switch(p.type){case"f":case"s":case"/":a.focus(),a.select(),p.claim();break}});let f=gi(a,i),l=yi(c,i,{query$:f});return A(f,l).pipe(Ge(...ne("search-share",e).map(p=>xi(p,{query$:f})),...ne("search-suggest",e).map(p=>Si(p,i,{keyboard$:r}))))}catch(o){return e.hidden=!0,xe}}function Ei(e,{index$:t,location$:r}){return K([t,r.pipe(N(Ae()),M(n=>!!n.searchParams.get("h")))]).pipe(m(([n,o])=>Br(n.config,!0)(o.searchParams.get("h"))),m(n=>{var a;let o=new Map,i=document.createNodeIterator(e,NodeFilter.SHOW_TEXT);for(let c=i.nextNode();c;c=i.nextNode())if((a=c.parentElement)==null?void 0:a.offsetHeight){let s=c.textContent,u=n(s);u.length>s.length&&o.set(c,u)}for(let[c,s]of o){let{childNodes:u}=H("span",null,s);c.replaceWith(...Array.from(u))}return{ref:e,nodes:o}}))}function bs(e,{viewport$:t,main$:r}){let n=e.parentElement,o=n.offsetTop-n.parentElement.offsetTop;return K([r,t]).pipe(m(([{offset:i,height:a},{offset:{y:c}}])=>(a=a+Math.min(o,Math.max(0,c-i))-o,{height:a,locked:c>=i+o})),Y((i,a)=>i.height===a.height&&i.locked===a.locked))}function Gr(e,n){var o=n,{header$:t}=o,r=rn(o,["header$"]);let i=B(".md-sidebar__scrollwrap",e),{y:a}=De(i);return W(()=>{let c=new S;return c.pipe(Pe(0,Oe),_e(t)).subscribe({next([{height:s},{height:u}]){i.style.height=`${s-2*a}px`,e.style.top=`${u}px`},complete(){i.style.height="",e.style.top=""}}),bs(e,r).pipe(O(s=>c.next(s)),C(()=>c.complete()),m(s=>F({ref:e},s)))})}function Oi(e,t){if(typeof t!="undefined"){let r=`https://api.github.com/repos/${e}/${t}`;return xt(Ce(`${r}/releases/latest`).pipe(m(n=>({version:n.tag_name})),Be({})),Ce(r).pipe(m(n=>({stars:n.stargazers_count,forks:n.forks_count})),Be({}))).pipe(m(([n,o])=>F(F({},n),o)))}else{let r=`https://api.github.com/users/${e}`;return Ce(r).pipe(m(n=>({repositories:n.public_repos})),Be({}))}}function Ti(e,t){let r=`https://${e}/api/v4/projects/${encodeURIComponent(t)}`;return Ce(r).pipe(m(({star_count:n,forks_count:o})=>({stars:n,forks:o})),Be({}))}function _i(e){let[t]=e.match(/(git(?:hub|lab))/i)||[];switch(t.toLowerCase()){case"github":let[,r,n]=e.match(/^.+github\.com\/([^/]+)\/?([^/]+)?/i);return Oi(r,n);case"gitlab":let[,o,i]=e.match(/^.+?([^/]*gitlab[^/]+)\/(.+?)\/?$/i);return Ti(o,i);default:return q}}var vs;function gs(e){return vs||(vs=W(()=>{let t=__md_get("__source",sessionStorage);return t?R(t):_i(e.href).pipe(O(r=>__md_set("__source",r,sessionStorage)))}).pipe(Ue(()=>q),M(t=>Object.keys(t).length>0),m(t=>({facts:t})),X(1)))}function Mi(e){let t=B(":scope > :last-child",e);return W(()=>{let r=new S;return r.subscribe(({facts:n})=>{t.appendChild(zo(n)),t.setAttribute("data-md-state","done")}),gs(e).pipe(O(n=>r.next(n)),C(()=>r.complete()),m(n=>F({ref:e},n)))})}function ys(e,{viewport$:t,header$:r}){return be(document.body).pipe(T(()=>ur(e,{header$:r,viewport$:t})),m(({offset:{y:n}})=>({hidden:n>=10})),G("hidden"))}function Li(e,t){return W(()=>{let r=new S;return r.subscribe({next({hidden:n}){n?e.setAttribute("data-md-state","hidden"):e.removeAttribute("data-md-state")},complete(){e.removeAttribute("data-md-state")}}),(ae("navigation.tabs.sticky")?R({hidden:!1}):ys(e,t)).pipe(O(n=>r.next(n)),C(()=>r.complete()),m(n=>F({ref:e},n)))})}function xs(e,{viewport$:t,header$:r}){let n=new Map,o=J("[href^=\\#]",e);for(let c of o){let s=decodeURIComponent(c.hash.substring(1)),u=ce(`[id="${s}"]`);typeof u!="undefined"&&n.set(c,u)}let i=r.pipe(m(c=>24+c.height));return be(document.body).pipe(G("height"),T(c=>W(()=>{let s=[];return R([...n].reduce((u,[f,l])=>{for(;s.length&&n.get(s[s.length-1]).tagName>=l.tagName;)s.pop();let p=l.offsetTop;for(;!p&&l.parentElement;)l=l.parentElement,p=l.offsetTop;return u.set([...s=[...s,f]].reverse(),p)},new Map))}).pipe(m(s=>new Map([...s].sort(([,u],[,f])=>u-f))),T(s=>K([t,i]).pipe(kr(([u,f],[{offset:{y:l},size:p},d])=>{let h=l+p.height>=Math.floor(c.height);for(;f.length;){let[,b]=f[0];if(b-d=l&&!h)f=[u.pop(),...f];else break}return[u,f]},[[],[...s]]),Y((u,f)=>u[0]===f[0]&&u[1]===f[1])))))).pipe(m(([c,s])=>({prev:c.map(([u])=>u),next:s.map(([u])=>u)})),N({prev:[],next:[]}),Te(2,1),m(([c,s])=>c.prev.length{let n=new S;return n.subscribe(({prev:o,next:i})=>{for(let[a]of i)a.removeAttribute("data-md-state"),a.classList.remove("md-nav__link--active");for(let[a,[c]]of o.entries())c.setAttribute("data-md-state","blur"),c.classList.toggle("md-nav__link--active",a===o.length-1)}),ae("navigation.tracking")&&t.pipe(se(n.pipe(ue(1))),G("offset"),Ye(250),_e(n)).subscribe(([,{prev:o}])=>{let i=Ae(),a=o[o.length-1];if(a&&a.length){let[c]=a,{hash:s}=new URL(c.href);i.hash!==s&&(i.hash=s,history.replaceState({},"",`${i}`))}else i.hash="",history.replaceState({},"",`${i}`)}),xs(e,{viewport$:t,header$:r}).pipe(O(o=>n.next(o)),C(()=>n.complete()),m(o=>F({ref:e},o)))})}function Ss(e,{viewport$:t,main$:r,target$:n}){let o=t.pipe(m(({offset:{y:a}})=>a),Te(2,1),m(([a,c])=>a>c&&c>0),Y()),i=r.pipe(m(({active:a})=>a));return K([i,o]).pipe(m(([a,c])=>!(a&&c)),Y(),se(n.pipe(ut(1))),Xt(!0),Pr({delay:250}),m(a=>({hidden:a})))}function Ci(e,{viewport$:t,header$:r,main$:n,target$:o}){let i=new S;return i.subscribe({next({hidden:a}){a?(e.setAttribute("data-md-state","hidden"),e.setAttribute("tabindex","-1"),e.blur()):(e.removeAttribute("data-md-state"),e.removeAttribute("tabindex"))},complete(){e.style.top="",e.setAttribute("data-md-state","hidden"),e.removeAttribute("tabindex")}}),r.pipe(se(i.pipe(Xt(0),ue(1))),G("height")).subscribe(({height:a})=>{e.style.top=`${a+16}px`}),Ss(e,{viewport$:t,main$:n,target$:o}).pipe(O(a=>i.next(a)),C(()=>i.complete()),m(a=>F({ref:e},a)))}function Ri({document$:e,tablet$:t}){e.pipe(T(()=>R(...J("[data-md-state=indeterminate]"))),O(r=>{r.indeterminate=!0,r.checked=!1}),ie(r=>y(r,"change").pipe(jr(()=>r.hasAttribute("data-md-state")),re(r))),_e(t)).subscribe(([r,n])=>{r.removeAttribute("data-md-state"),n&&(r.checked=!1)})}function ws(){return/(iPad|iPhone|iPod)/.test(navigator.userAgent)}function Hi({document$:e}){e.pipe(T(()=>R(...J("[data-md-scrollfix]"))),O(t=>t.removeAttribute("data-md-scrollfix")),M(ws),ie(t=>y(t,"touchstart").pipe(re(t)))).subscribe(t=>{let r=t.scrollTop;r===0?t.scrollTop=1:r+t.offsetHeight===t.scrollHeight&&(t.scrollTop=r-1)})}function Pi({viewport$:e,tablet$:t}){K([ar("search"),t]).pipe(m(([r,n])=>r&&!n),T(r=>R(r).pipe(ke(r?400:100))),_e(e)).subscribe(([r,{offset:{y:n}}])=>{if(r)document.body.setAttribute("data-md-state","lock"),document.body.style.top=`-${n}px`;else{let o=-1*parseInt(document.body.style.top,10);document.body.removeAttribute("data-md-state"),document.body.style.top="",o&&window.scrollTo(0,o)}})}Object.entries||(Object.entries=function(e){let t=[];for(let r of Object.keys(e))t.push([r,e[r]]);return t});Object.values||(Object.values=function(e){let t=[];for(let r of Object.keys(e))t.push(e[r]);return t});typeof Element!="undefined"&&(Element.prototype.scrollTo||(Element.prototype.scrollTo=function(e,t){typeof e=="object"?(this.scrollLeft=e.left,this.scrollTop=e.top):(this.scrollLeft=e,this.scrollTop=t)}),Element.prototype.replaceWith||(Element.prototype.replaceWith=function(...e){let t=this.parentNode;if(t){e.length===0&&t.removeChild(this);for(let r=e.length-1;r>=0;r--){let n=e[r];typeof n!="object"?n=document.createTextNode(n):n.parentNode&&n.parentNode.removeChild(n),r?t.insertBefore(this.previousSibling,n):t.replaceChild(n,this)}}}));document.documentElement.classList.remove("no-js");document.documentElement.classList.add("js");var dt=fo(),lr=_o(),pr=Ro(),Jr=Oo(),Se=Fo(),mr=Vr("(min-width: 960px)"),Ii=Vr("(min-width: 1220px)"),$i=Ho(),ji=ve(),Fi=document.forms.namedItem("search")?(__search==null?void 0:__search.index)||Ce(new URL("search/search_index.json",ji.base)):xe,Xr=new S;fi({alert$:Xr});ae("navigation.instant")&&pi({document$:dt,location$:lr,viewport$:Se});var ki;((ki=ji.version)==null?void 0:ki.provider)==="mike"&&vi();A(lr,pr).pipe(ke(125)).subscribe(()=>{Ve("drawer",!1),Ve("search",!1)});Jr.pipe(M(({mode:e})=>e==="global")).subscribe(e=>{switch(e.type){case"p":case",":let t=ce("[href][rel=prev]");typeof t!="undefined"&&t.click();break;case"n":case".":let r=ce("[href][rel=next]");typeof r!="undefined"&&r.click();break}});Ri({document$:dt,tablet$:mr});Hi({document$:dt});Pi({viewport$:Se,tablet$:mr});var ze=ii(Re("header"),{viewport$:Se}),fr=dt.pipe(m(()=>Re("main")),T(e=>ci(e,{viewport$:Se,header$:ze})),X(1)),Es=A(...ne("dialog").map(e=>oi(e,{alert$:Xr})),...ne("header").map(e=>ai(e,{viewport$:Se,header$:ze,main$:fr})),...ne("palette").map(e=>ui(e)),...ne("search").map(e=>wi(e,{index$:Fi,keyboard$:Jr})),...ne("source").map(e=>Mi(e))),Os=W(()=>A(...ne("content").map(e=>ni(e,{target$:pr,print$:$i})),...ne("content").map(e=>ae("search.highlight")?Ei(e,{index$:Fi,location$:lr}):q),...ne("header-title").map(e=>si(e,{viewport$:Se,header$:ze})),...ne("sidebar").map(e=>e.getAttribute("data-md-type")==="navigation"?zr(Ii,()=>Gr(e,{viewport$:Se,header$:ze,main$:fr})):zr(mr,()=>Gr(e,{viewport$:Se,header$:ze,main$:fr}))),...ne("tabs").map(e=>Li(e,{viewport$:Se,header$:ze})),...ne("toc").map(e=>Ai(e,{viewport$:Se,header$:ze})),...ne("top").map(e=>Ci(e,{viewport$:Se,header$:ze,main$:fr,target$:pr})))),Ui=dt.pipe(T(()=>Os),Ge(Es),X(1));Ui.subscribe();window.document$=dt;window.location$=lr;window.target$=pr;window.keyboard$=Jr;window.viewport$=Se;window.tablet$=mr;window.screen$=Ii;window.print$=$i;window.alert$=Xr;window.component$=Ui;})(); +//# sourceMappingURL=bundle.5a9542cf.min.js.map + diff --git a/assets/javascripts/bundle.5a9542cf.min.js.map b/assets/javascripts/bundle.5a9542cf.min.js.map new file mode 100644 index 00000000..04591c48 --- /dev/null +++ b/assets/javascripts/bundle.5a9542cf.min.js.map @@ -0,0 +1,8 @@ +{ + "version": 3, + "sources": ["node_modules/focus-visible/dist/focus-visible.js", "node_modules/url-polyfill/url-polyfill.js", "node_modules/rxjs/node_modules/tslib/tslib.js", "node_modules/clipboard/dist/clipboard.js", "node_modules/escape-html/index.js", "node_modules/array-flat-polyfill/index.mjs", "src/assets/javascripts/bundle.ts", "node_modules/unfetch/polyfill/index.js", "node_modules/rxjs/node_modules/tslib/modules/index.js", "node_modules/rxjs/src/internal/util/isFunction.ts", "node_modules/rxjs/src/internal/util/createErrorClass.ts", "node_modules/rxjs/src/internal/util/UnsubscriptionError.ts", "node_modules/rxjs/src/internal/util/arrRemove.ts", "node_modules/rxjs/src/internal/Subscription.ts", "node_modules/rxjs/src/internal/config.ts", "node_modules/rxjs/src/internal/scheduler/timeoutProvider.ts", "node_modules/rxjs/src/internal/util/reportUnhandledError.ts", "node_modules/rxjs/src/internal/util/noop.ts", "node_modules/rxjs/src/internal/NotificationFactories.ts", "node_modules/rxjs/src/internal/util/errorContext.ts", "node_modules/rxjs/src/internal/Subscriber.ts", "node_modules/rxjs/src/internal/symbol/observable.ts", "node_modules/rxjs/src/internal/util/identity.ts", "node_modules/rxjs/src/internal/util/pipe.ts", "node_modules/rxjs/src/internal/Observable.ts", "node_modules/rxjs/src/internal/util/lift.ts", "node_modules/rxjs/src/internal/operators/OperatorSubscriber.ts", "node_modules/rxjs/src/internal/scheduler/animationFrameProvider.ts", "node_modules/rxjs/src/internal/util/ObjectUnsubscribedError.ts", "node_modules/rxjs/src/internal/Subject.ts", "node_modules/rxjs/src/internal/scheduler/dateTimestampProvider.ts", "node_modules/rxjs/src/internal/ReplaySubject.ts", "node_modules/rxjs/src/internal/scheduler/Action.ts", "node_modules/rxjs/src/internal/scheduler/intervalProvider.ts", "node_modules/rxjs/src/internal/scheduler/AsyncAction.ts", "node_modules/rxjs/src/internal/Scheduler.ts", "node_modules/rxjs/src/internal/scheduler/AsyncScheduler.ts", "node_modules/rxjs/src/internal/scheduler/async.ts", "node_modules/rxjs/src/internal/scheduler/AnimationFrameAction.ts", "node_modules/rxjs/src/internal/scheduler/AnimationFrameScheduler.ts", "node_modules/rxjs/src/internal/scheduler/animationFrame.ts", "node_modules/rxjs/src/internal/observable/empty.ts", "node_modules/rxjs/src/internal/util/isScheduler.ts", "node_modules/rxjs/src/internal/util/args.ts", "node_modules/rxjs/src/internal/util/isArrayLike.ts", "node_modules/rxjs/src/internal/util/isPromise.ts", "node_modules/rxjs/src/internal/util/isInteropObservable.ts", "node_modules/rxjs/src/internal/util/isAsyncIterable.ts", "node_modules/rxjs/src/internal/util/throwUnobservableError.ts", "node_modules/rxjs/src/internal/symbol/iterator.ts", "node_modules/rxjs/src/internal/util/isIterable.ts", "node_modules/rxjs/src/internal/util/isReadableStreamLike.ts", "node_modules/rxjs/src/internal/observable/innerFrom.ts", "node_modules/rxjs/src/internal/util/executeSchedule.ts", "node_modules/rxjs/src/internal/operators/observeOn.ts", "node_modules/rxjs/src/internal/operators/subscribeOn.ts", "node_modules/rxjs/src/internal/scheduled/scheduleObservable.ts", "node_modules/rxjs/src/internal/scheduled/schedulePromise.ts", "node_modules/rxjs/src/internal/scheduled/scheduleArray.ts", "node_modules/rxjs/src/internal/scheduled/scheduleIterable.ts", "node_modules/rxjs/src/internal/scheduled/scheduleAsyncIterable.ts", "node_modules/rxjs/src/internal/scheduled/scheduleReadableStreamLike.ts", "node_modules/rxjs/src/internal/scheduled/scheduled.ts", "node_modules/rxjs/src/internal/observable/from.ts", "node_modules/rxjs/src/internal/observable/of.ts", "node_modules/rxjs/src/internal/util/isDate.ts", "node_modules/rxjs/src/internal/operators/map.ts", "node_modules/rxjs/src/internal/util/mapOneOrManyArgs.ts", "node_modules/rxjs/src/internal/util/argsArgArrayOrObject.ts", "node_modules/rxjs/src/internal/util/createObject.ts", "node_modules/rxjs/src/internal/observable/combineLatest.ts", "node_modules/rxjs/src/internal/operators/mergeInternals.ts", "node_modules/rxjs/src/internal/operators/mergeMap.ts", "node_modules/rxjs/src/internal/operators/mergeAll.ts", "node_modules/rxjs/src/internal/operators/concatAll.ts", "node_modules/rxjs/src/internal/observable/concat.ts", "node_modules/rxjs/src/internal/observable/defer.ts", "node_modules/rxjs/src/internal/observable/fromEvent.ts", "node_modules/rxjs/src/internal/observable/fromEventPattern.ts", "node_modules/rxjs/src/internal/observable/timer.ts", "node_modules/rxjs/src/internal/observable/merge.ts", "node_modules/rxjs/src/internal/observable/never.ts", "node_modules/rxjs/src/internal/util/argsOrArgArray.ts", "node_modules/rxjs/src/internal/operators/filter.ts", "node_modules/rxjs/src/internal/observable/zip.ts", "node_modules/rxjs/src/internal/operators/audit.ts", "node_modules/rxjs/src/internal/operators/auditTime.ts", "node_modules/rxjs/src/internal/operators/bufferCount.ts", "node_modules/rxjs/src/internal/operators/catchError.ts", "node_modules/rxjs/src/internal/operators/scanInternals.ts", "node_modules/rxjs/src/internal/operators/combineLatest.ts", "node_modules/rxjs/src/internal/operators/combineLatestWith.ts", "node_modules/rxjs/src/internal/operators/concatMap.ts", "node_modules/rxjs/src/internal/operators/debounceTime.ts", "node_modules/rxjs/src/internal/operators/defaultIfEmpty.ts", "node_modules/rxjs/src/internal/operators/take.ts", "node_modules/rxjs/src/internal/operators/ignoreElements.ts", "node_modules/rxjs/src/internal/operators/mapTo.ts", "node_modules/rxjs/src/internal/operators/delayWhen.ts", "node_modules/rxjs/src/internal/operators/delay.ts", "node_modules/rxjs/src/internal/operators/distinctUntilChanged.ts", "node_modules/rxjs/src/internal/operators/distinctUntilKeyChanged.ts", "node_modules/rxjs/src/internal/operators/endWith.ts", "node_modules/rxjs/src/internal/operators/finalize.ts", "node_modules/rxjs/src/internal/operators/takeLast.ts", "node_modules/rxjs/src/internal/operators/merge.ts", "node_modules/rxjs/src/internal/operators/mergeWith.ts", "node_modules/rxjs/src/internal/operators/repeat.ts", "node_modules/rxjs/src/internal/operators/sample.ts", "node_modules/rxjs/src/internal/operators/scan.ts", "node_modules/rxjs/src/internal/operators/share.ts", "node_modules/rxjs/src/internal/operators/shareReplay.ts", "node_modules/rxjs/src/internal/operators/skip.ts", "node_modules/rxjs/src/internal/operators/skipUntil.ts", "node_modules/rxjs/src/internal/operators/startWith.ts", "node_modules/rxjs/src/internal/operators/switchMap.ts", "node_modules/rxjs/src/internal/operators/switchMapTo.ts", "node_modules/rxjs/src/internal/operators/takeUntil.ts", "node_modules/rxjs/src/internal/operators/takeWhile.ts", "node_modules/rxjs/src/internal/operators/tap.ts", "node_modules/rxjs/src/internal/operators/throttle.ts", "node_modules/rxjs/src/internal/operators/throttleTime.ts", "node_modules/rxjs/src/internal/operators/withLatestFrom.ts", "node_modules/rxjs/src/internal/operators/zip.ts", "node_modules/rxjs/src/internal/operators/zipWith.ts", "src/assets/javascripts/browser/document/index.ts", "src/assets/javascripts/browser/element/_/index.ts", "src/assets/javascripts/browser/element/focus/index.ts", "src/assets/javascripts/browser/element/offset/_/index.ts", "src/assets/javascripts/browser/element/offset/content/index.ts", "node_modules/resize-observer-polyfill/dist/ResizeObserver.es.js", "src/assets/javascripts/browser/element/size/_/index.ts", "src/assets/javascripts/browser/element/size/content/index.ts", "src/assets/javascripts/browser/element/visibility/index.ts", "src/assets/javascripts/browser/toggle/index.ts", "src/assets/javascripts/browser/keyboard/index.ts", "src/assets/javascripts/browser/location/_/index.ts", "src/assets/javascripts/utilities/h/index.ts", "src/assets/javascripts/utilities/string/index.ts", "src/assets/javascripts/browser/location/hash/index.ts", "src/assets/javascripts/browser/media/index.ts", "src/assets/javascripts/browser/request/index.ts", "src/assets/javascripts/browser/viewport/offset/index.ts", "src/assets/javascripts/browser/viewport/size/index.ts", "src/assets/javascripts/browser/viewport/_/index.ts", "src/assets/javascripts/browser/viewport/at/index.ts", "src/assets/javascripts/browser/worker/index.ts", "src/assets/javascripts/_/index.ts", "src/assets/javascripts/components/_/index.ts", "src/assets/javascripts/components/content/code/index.ts", "src/assets/javascripts/templates/annotation/index.tsx", "src/assets/javascripts/templates/clipboard/index.tsx", "src/assets/javascripts/templates/search/index.tsx", "src/assets/javascripts/templates/source/index.tsx", "src/assets/javascripts/templates/table/index.tsx", "src/assets/javascripts/templates/version/index.tsx", "src/assets/javascripts/components/content/annotation/_/index.ts", "src/assets/javascripts/components/content/annotation/list/index.ts", "src/assets/javascripts/components/content/details/index.ts", "src/assets/javascripts/components/content/table/index.ts", "src/assets/javascripts/components/content/tabs/index.ts", "src/assets/javascripts/components/content/_/index.ts", "src/assets/javascripts/components/dialog/index.ts", "src/assets/javascripts/components/header/_/index.ts", "src/assets/javascripts/components/header/title/index.ts", "src/assets/javascripts/components/main/index.ts", "src/assets/javascripts/components/palette/index.ts", "src/assets/javascripts/integrations/clipboard/index.ts", "src/assets/javascripts/integrations/instant/index.ts", "src/assets/javascripts/integrations/search/document/index.ts", "src/assets/javascripts/integrations/search/highlighter/index.ts", "src/assets/javascripts/integrations/search/query/transform/index.ts", "src/assets/javascripts/integrations/search/worker/message/index.ts", "src/assets/javascripts/integrations/search/worker/_/index.ts", "src/assets/javascripts/integrations/version/index.ts", "src/assets/javascripts/components/search/query/index.ts", "src/assets/javascripts/components/search/result/index.ts", "src/assets/javascripts/components/search/share/index.ts", "src/assets/javascripts/components/search/suggest/index.ts", "src/assets/javascripts/components/search/_/index.ts", "src/assets/javascripts/components/search/highlight/index.ts", "src/assets/javascripts/components/sidebar/index.ts", "src/assets/javascripts/components/source/facts/github/index.ts", "src/assets/javascripts/components/source/facts/gitlab/index.ts", "src/assets/javascripts/components/source/facts/_/index.ts", "src/assets/javascripts/components/source/_/index.ts", "src/assets/javascripts/components/tabs/index.ts", "src/assets/javascripts/components/toc/index.ts", "src/assets/javascripts/components/top/index.ts", "src/assets/javascripts/patches/indeterminate/index.ts", "src/assets/javascripts/patches/scrollfix/index.ts", "src/assets/javascripts/patches/scrolllock/index.ts", "src/assets/javascripts/polyfills/index.ts"], + "sourceRoot": "../../../..", + "sourcesContent": ["(function (global, factory) {\n typeof exports === 'object' && typeof module !== 'undefined' ? factory() :\n typeof define === 'function' && define.amd ? define(factory) :\n (factory());\n}(this, (function () { 'use strict';\n\n /**\n * Applies the :focus-visible polyfill at the given scope.\n * A scope in this case is either the top-level Document or a Shadow Root.\n *\n * @param {(Document|ShadowRoot)} scope\n * @see https://github.com/WICG/focus-visible\n */\n function applyFocusVisiblePolyfill(scope) {\n var hadKeyboardEvent = true;\n var hadFocusVisibleRecently = false;\n var hadFocusVisibleRecentlyTimeout = null;\n\n var inputTypesAllowlist = {\n text: true,\n search: true,\n url: true,\n tel: true,\n email: true,\n password: true,\n number: true,\n date: true,\n month: true,\n week: true,\n time: true,\n datetime: true,\n 'datetime-local': true\n };\n\n /**\n * Helper function for legacy browsers and iframes which sometimes focus\n * elements like document, body, and non-interactive SVG.\n * @param {Element} el\n */\n function isValidFocusTarget(el) {\n if (\n el &&\n el !== document &&\n el.nodeName !== 'HTML' &&\n el.nodeName !== 'BODY' &&\n 'classList' in el &&\n 'contains' in el.classList\n ) {\n return true;\n }\n return false;\n }\n\n /**\n * Computes whether the given element should automatically trigger the\n * `focus-visible` class being added, i.e. whether it should always match\n * `:focus-visible` when focused.\n * @param {Element} el\n * @return {boolean}\n */\n function focusTriggersKeyboardModality(el) {\n var type = el.type;\n var tagName = el.tagName;\n\n if (tagName === 'INPUT' && inputTypesAllowlist[type] && !el.readOnly) {\n return true;\n }\n\n if (tagName === 'TEXTAREA' && !el.readOnly) {\n return true;\n }\n\n if (el.isContentEditable) {\n return true;\n }\n\n return false;\n }\n\n /**\n * Add the `focus-visible` class to the given element if it was not added by\n * the author.\n * @param {Element} el\n */\n function addFocusVisibleClass(el) {\n if (el.classList.contains('focus-visible')) {\n return;\n }\n el.classList.add('focus-visible');\n el.setAttribute('data-focus-visible-added', '');\n }\n\n /**\n * Remove the `focus-visible` class from the given element if it was not\n * originally added by the author.\n * @param {Element} el\n */\n function removeFocusVisibleClass(el) {\n if (!el.hasAttribute('data-focus-visible-added')) {\n return;\n }\n el.classList.remove('focus-visible');\n el.removeAttribute('data-focus-visible-added');\n }\n\n /**\n * If the most recent user interaction was via the keyboard;\n * and the key press did not include a meta, alt/option, or control key;\n * then the modality is keyboard. Otherwise, the modality is not keyboard.\n * Apply `focus-visible` to any current active element and keep track\n * of our keyboard modality state with `hadKeyboardEvent`.\n * @param {KeyboardEvent} e\n */\n function onKeyDown(e) {\n if (e.metaKey || e.altKey || e.ctrlKey) {\n return;\n }\n\n if (isValidFocusTarget(scope.activeElement)) {\n addFocusVisibleClass(scope.activeElement);\n }\n\n hadKeyboardEvent = true;\n }\n\n /**\n * If at any point a user clicks with a pointing device, ensure that we change\n * the modality away from keyboard.\n * This avoids the situation where a user presses a key on an already focused\n * element, and then clicks on a different element, focusing it with a\n * pointing device, while we still think we're in keyboard modality.\n * @param {Event} e\n */\n function onPointerDown(e) {\n hadKeyboardEvent = false;\n }\n\n /**\n * On `focus`, add the `focus-visible` class to the target if:\n * - the target received focus as a result of keyboard navigation, or\n * - the event target is an element that will likely require interaction\n * via the keyboard (e.g. a text box)\n * @param {Event} e\n */\n function onFocus(e) {\n // Prevent IE from focusing the document or HTML element.\n if (!isValidFocusTarget(e.target)) {\n return;\n }\n\n if (hadKeyboardEvent || focusTriggersKeyboardModality(e.target)) {\n addFocusVisibleClass(e.target);\n }\n }\n\n /**\n * On `blur`, remove the `focus-visible` class from the target.\n * @param {Event} e\n */\n function onBlur(e) {\n if (!isValidFocusTarget(e.target)) {\n return;\n }\n\n if (\n e.target.classList.contains('focus-visible') ||\n e.target.hasAttribute('data-focus-visible-added')\n ) {\n // To detect a tab/window switch, we look for a blur event followed\n // rapidly by a visibility change.\n // If we don't see a visibility change within 100ms, it's probably a\n // regular focus change.\n hadFocusVisibleRecently = true;\n window.clearTimeout(hadFocusVisibleRecentlyTimeout);\n hadFocusVisibleRecentlyTimeout = window.setTimeout(function() {\n hadFocusVisibleRecently = false;\n }, 100);\n removeFocusVisibleClass(e.target);\n }\n }\n\n /**\n * If the user changes tabs, keep track of whether or not the previously\n * focused element had .focus-visible.\n * @param {Event} e\n */\n function onVisibilityChange(e) {\n if (document.visibilityState === 'hidden') {\n // If the tab becomes active again, the browser will handle calling focus\n // on the element (Safari actually calls it twice).\n // If this tab change caused a blur on an element with focus-visible,\n // re-apply the class when the user switches back to the tab.\n if (hadFocusVisibleRecently) {\n hadKeyboardEvent = true;\n }\n addInitialPointerMoveListeners();\n }\n }\n\n /**\n * Add a group of listeners to detect usage of any pointing devices.\n * These listeners will be added when the polyfill first loads, and anytime\n * the window is blurred, so that they are active when the window regains\n * focus.\n */\n function addInitialPointerMoveListeners() {\n document.addEventListener('mousemove', onInitialPointerMove);\n document.addEventListener('mousedown', onInitialPointerMove);\n document.addEventListener('mouseup', onInitialPointerMove);\n document.addEventListener('pointermove', onInitialPointerMove);\n document.addEventListener('pointerdown', onInitialPointerMove);\n document.addEventListener('pointerup', onInitialPointerMove);\n document.addEventListener('touchmove', onInitialPointerMove);\n document.addEventListener('touchstart', onInitialPointerMove);\n document.addEventListener('touchend', onInitialPointerMove);\n }\n\n function removeInitialPointerMoveListeners() {\n document.removeEventListener('mousemove', onInitialPointerMove);\n document.removeEventListener('mousedown', onInitialPointerMove);\n document.removeEventListener('mouseup', onInitialPointerMove);\n document.removeEventListener('pointermove', onInitialPointerMove);\n document.removeEventListener('pointerdown', onInitialPointerMove);\n document.removeEventListener('pointerup', onInitialPointerMove);\n document.removeEventListener('touchmove', onInitialPointerMove);\n document.removeEventListener('touchstart', onInitialPointerMove);\n document.removeEventListener('touchend', onInitialPointerMove);\n }\n\n /**\n * When the polfyill first loads, assume the user is in keyboard modality.\n * If any event is received from a pointing device (e.g. mouse, pointer,\n * touch), turn off keyboard modality.\n * This accounts for situations where focus enters the page from the URL bar.\n * @param {Event} e\n */\n function onInitialPointerMove(e) {\n // Work around a Safari quirk that fires a mousemove on whenever the\n // window blurs, even if you're tabbing out of the page. \u00AF\\_(\u30C4)_/\u00AF\n if (e.target.nodeName && e.target.nodeName.toLowerCase() === 'html') {\n return;\n }\n\n hadKeyboardEvent = false;\n removeInitialPointerMoveListeners();\n }\n\n // For some kinds of state, we are interested in changes at the global scope\n // only. For example, global pointer input, global key presses and global\n // visibility change should affect the state at every scope:\n document.addEventListener('keydown', onKeyDown, true);\n document.addEventListener('mousedown', onPointerDown, true);\n document.addEventListener('pointerdown', onPointerDown, true);\n document.addEventListener('touchstart', onPointerDown, true);\n document.addEventListener('visibilitychange', onVisibilityChange, true);\n\n addInitialPointerMoveListeners();\n\n // For focus and blur, we specifically care about state changes in the local\n // scope. This is because focus / blur events that originate from within a\n // shadow root are not re-dispatched from the host element if it was already\n // the active element in its own scope:\n scope.addEventListener('focus', onFocus, true);\n scope.addEventListener('blur', onBlur, true);\n\n // We detect that a node is a ShadowRoot by ensuring that it is a\n // DocumentFragment and also has a host property. This check covers native\n // implementation and polyfill implementation transparently. If we only cared\n // about the native implementation, we could just check if the scope was\n // an instance of a ShadowRoot.\n if (scope.nodeType === Node.DOCUMENT_FRAGMENT_NODE && scope.host) {\n // Since a ShadowRoot is a special kind of DocumentFragment, it does not\n // have a root element to add a class to. So, we add this attribute to the\n // host element instead:\n scope.host.setAttribute('data-js-focus-visible', '');\n } else if (scope.nodeType === Node.DOCUMENT_NODE) {\n document.documentElement.classList.add('js-focus-visible');\n document.documentElement.setAttribute('data-js-focus-visible', '');\n }\n }\n\n // It is important to wrap all references to global window and document in\n // these checks to support server-side rendering use cases\n // @see https://github.com/WICG/focus-visible/issues/199\n if (typeof window !== 'undefined' && typeof document !== 'undefined') {\n // Make the polyfill helper globally available. This can be used as a signal\n // to interested libraries that wish to coordinate with the polyfill for e.g.,\n // applying the polyfill to a shadow root:\n window.applyFocusVisiblePolyfill = applyFocusVisiblePolyfill;\n\n // Notify interested libraries of the polyfill's presence, in case the\n // polyfill was loaded lazily:\n var event;\n\n try {\n event = new CustomEvent('focus-visible-polyfill-ready');\n } catch (error) {\n // IE11 does not support using CustomEvent as a constructor directly:\n event = document.createEvent('CustomEvent');\n event.initCustomEvent('focus-visible-polyfill-ready', false, false, {});\n }\n\n window.dispatchEvent(event);\n }\n\n if (typeof document !== 'undefined') {\n // Apply the polyfill to the global document, so that no JavaScript\n // coordination is required to use the polyfill in the top-level document:\n applyFocusVisiblePolyfill(document);\n }\n\n})));\n", "(function(global) {\r\n /**\r\n * Polyfill URLSearchParams\r\n *\r\n * Inspired from : https://github.com/WebReflection/url-search-params/blob/master/src/url-search-params.js\r\n */\r\n\r\n var checkIfIteratorIsSupported = function() {\r\n try {\r\n return !!Symbol.iterator;\r\n } catch (error) {\r\n return false;\r\n }\r\n };\r\n\r\n\r\n var iteratorSupported = checkIfIteratorIsSupported();\r\n\r\n var createIterator = function(items) {\r\n var iterator = {\r\n next: function() {\r\n var value = items.shift();\r\n return { done: value === void 0, value: value };\r\n }\r\n };\r\n\r\n if (iteratorSupported) {\r\n iterator[Symbol.iterator] = function() {\r\n return iterator;\r\n };\r\n }\r\n\r\n return iterator;\r\n };\r\n\r\n /**\r\n * Search param name and values should be encoded according to https://url.spec.whatwg.org/#urlencoded-serializing\r\n * encodeURIComponent() produces the same result except encoding spaces as `%20` instead of `+`.\r\n */\r\n var serializeParam = function(value) {\r\n return encodeURIComponent(value).replace(/%20/g, '+');\r\n };\r\n\r\n var deserializeParam = function(value) {\r\n return decodeURIComponent(String(value).replace(/\\+/g, ' '));\r\n };\r\n\r\n var polyfillURLSearchParams = function() {\r\n\r\n var URLSearchParams = function(searchString) {\r\n Object.defineProperty(this, '_entries', { writable: true, value: {} });\r\n var typeofSearchString = typeof searchString;\r\n\r\n if (typeofSearchString === 'undefined') {\r\n // do nothing\r\n } else if (typeofSearchString === 'string') {\r\n if (searchString !== '') {\r\n this._fromString(searchString);\r\n }\r\n } else if (searchString instanceof URLSearchParams) {\r\n var _this = this;\r\n searchString.forEach(function(value, name) {\r\n _this.append(name, value);\r\n });\r\n } else if ((searchString !== null) && (typeofSearchString === 'object')) {\r\n if (Object.prototype.toString.call(searchString) === '[object Array]') {\r\n for (var i = 0; i < searchString.length; i++) {\r\n var entry = searchString[i];\r\n if ((Object.prototype.toString.call(entry) === '[object Array]') || (entry.length !== 2)) {\r\n this.append(entry[0], entry[1]);\r\n } else {\r\n throw new TypeError('Expected [string, any] as entry at index ' + i + ' of URLSearchParams\\'s input');\r\n }\r\n }\r\n } else {\r\n for (var key in searchString) {\r\n if (searchString.hasOwnProperty(key)) {\r\n this.append(key, searchString[key]);\r\n }\r\n }\r\n }\r\n } else {\r\n throw new TypeError('Unsupported input\\'s type for URLSearchParams');\r\n }\r\n };\r\n\r\n var proto = URLSearchParams.prototype;\r\n\r\n proto.append = function(name, value) {\r\n if (name in this._entries) {\r\n this._entries[name].push(String(value));\r\n } else {\r\n this._entries[name] = [String(value)];\r\n }\r\n };\r\n\r\n proto.delete = function(name) {\r\n delete this._entries[name];\r\n };\r\n\r\n proto.get = function(name) {\r\n return (name in this._entries) ? this._entries[name][0] : null;\r\n };\r\n\r\n proto.getAll = function(name) {\r\n return (name in this._entries) ? this._entries[name].slice(0) : [];\r\n };\r\n\r\n proto.has = function(name) {\r\n return (name in this._entries);\r\n };\r\n\r\n proto.set = function(name, value) {\r\n this._entries[name] = [String(value)];\r\n };\r\n\r\n proto.forEach = function(callback, thisArg) {\r\n var entries;\r\n for (var name in this._entries) {\r\n if (this._entries.hasOwnProperty(name)) {\r\n entries = this._entries[name];\r\n for (var i = 0; i < entries.length; i++) {\r\n callback.call(thisArg, entries[i], name, this);\r\n }\r\n }\r\n }\r\n };\r\n\r\n proto.keys = function() {\r\n var items = [];\r\n this.forEach(function(value, name) {\r\n items.push(name);\r\n });\r\n return createIterator(items);\r\n };\r\n\r\n proto.values = function() {\r\n var items = [];\r\n this.forEach(function(value) {\r\n items.push(value);\r\n });\r\n return createIterator(items);\r\n };\r\n\r\n proto.entries = function() {\r\n var items = [];\r\n this.forEach(function(value, name) {\r\n items.push([name, value]);\r\n });\r\n return createIterator(items);\r\n };\r\n\r\n if (iteratorSupported) {\r\n proto[Symbol.iterator] = proto.entries;\r\n }\r\n\r\n proto.toString = function() {\r\n var searchArray = [];\r\n this.forEach(function(value, name) {\r\n searchArray.push(serializeParam(name) + '=' + serializeParam(value));\r\n });\r\n return searchArray.join('&');\r\n };\r\n\r\n\r\n global.URLSearchParams = URLSearchParams;\r\n };\r\n\r\n var checkIfURLSearchParamsSupported = function() {\r\n try {\r\n var URLSearchParams = global.URLSearchParams;\r\n\r\n return (\r\n (new URLSearchParams('?a=1').toString() === 'a=1') &&\r\n (typeof URLSearchParams.prototype.set === 'function') &&\r\n (typeof URLSearchParams.prototype.entries === 'function')\r\n );\r\n } catch (e) {\r\n return false;\r\n }\r\n };\r\n\r\n if (!checkIfURLSearchParamsSupported()) {\r\n polyfillURLSearchParams();\r\n }\r\n\r\n var proto = global.URLSearchParams.prototype;\r\n\r\n if (typeof proto.sort !== 'function') {\r\n proto.sort = function() {\r\n var _this = this;\r\n var items = [];\r\n this.forEach(function(value, name) {\r\n items.push([name, value]);\r\n if (!_this._entries) {\r\n _this.delete(name);\r\n }\r\n });\r\n items.sort(function(a, b) {\r\n if (a[0] < b[0]) {\r\n return -1;\r\n } else if (a[0] > b[0]) {\r\n return +1;\r\n } else {\r\n return 0;\r\n }\r\n });\r\n if (_this._entries) { // force reset because IE keeps keys index\r\n _this._entries = {};\r\n }\r\n for (var i = 0; i < items.length; i++) {\r\n this.append(items[i][0], items[i][1]);\r\n }\r\n };\r\n }\r\n\r\n if (typeof proto._fromString !== 'function') {\r\n Object.defineProperty(proto, '_fromString', {\r\n enumerable: false,\r\n configurable: false,\r\n writable: false,\r\n value: function(searchString) {\r\n if (this._entries) {\r\n this._entries = {};\r\n } else {\r\n var keys = [];\r\n this.forEach(function(value, name) {\r\n keys.push(name);\r\n });\r\n for (var i = 0; i < keys.length; i++) {\r\n this.delete(keys[i]);\r\n }\r\n }\r\n\r\n searchString = searchString.replace(/^\\?/, '');\r\n var attributes = searchString.split('&');\r\n var attribute;\r\n for (var i = 0; i < attributes.length; i++) {\r\n attribute = attributes[i].split('=');\r\n this.append(\r\n deserializeParam(attribute[0]),\r\n (attribute.length > 1) ? deserializeParam(attribute[1]) : ''\r\n );\r\n }\r\n }\r\n });\r\n }\r\n\r\n // HTMLAnchorElement\r\n\r\n})(\r\n (typeof global !== 'undefined') ? global\r\n : ((typeof window !== 'undefined') ? window\r\n : ((typeof self !== 'undefined') ? self : this))\r\n);\r\n\r\n(function(global) {\r\n /**\r\n * Polyfill URL\r\n *\r\n * Inspired from : https://github.com/arv/DOM-URL-Polyfill/blob/master/src/url.js\r\n */\r\n\r\n var checkIfURLIsSupported = function() {\r\n try {\r\n var u = new global.URL('b', 'http://a');\r\n u.pathname = 'c d';\r\n return (u.href === 'http://a/c%20d') && u.searchParams;\r\n } catch (e) {\r\n return false;\r\n }\r\n };\r\n\r\n\r\n var polyfillURL = function() {\r\n var _URL = global.URL;\r\n\r\n var URL = function(url, base) {\r\n if (typeof url !== 'string') url = String(url);\r\n if (base && typeof base !== 'string') base = String(base);\r\n\r\n // Only create another document if the base is different from current location.\r\n var doc = document, baseElement;\r\n if (base && (global.location === void 0 || base !== global.location.href)) {\r\n base = base.toLowerCase();\r\n doc = document.implementation.createHTMLDocument('');\r\n baseElement = doc.createElement('base');\r\n baseElement.href = base;\r\n doc.head.appendChild(baseElement);\r\n try {\r\n if (baseElement.href.indexOf(base) !== 0) throw new Error(baseElement.href);\r\n } catch (err) {\r\n throw new Error('URL unable to set base ' + base + ' due to ' + err);\r\n }\r\n }\r\n\r\n var anchorElement = doc.createElement('a');\r\n anchorElement.href = url;\r\n if (baseElement) {\r\n doc.body.appendChild(anchorElement);\r\n anchorElement.href = anchorElement.href; // force href to refresh\r\n }\r\n\r\n var inputElement = doc.createElement('input');\r\n inputElement.type = 'url';\r\n inputElement.value = url;\r\n\r\n if (anchorElement.protocol === ':' || !/:/.test(anchorElement.href) || (!inputElement.checkValidity() && !base)) {\r\n throw new TypeError('Invalid URL');\r\n }\r\n\r\n Object.defineProperty(this, '_anchorElement', {\r\n value: anchorElement\r\n });\r\n\r\n\r\n // create a linked searchParams which reflect its changes on URL\r\n var searchParams = new global.URLSearchParams(this.search);\r\n var enableSearchUpdate = true;\r\n var enableSearchParamsUpdate = true;\r\n var _this = this;\r\n ['append', 'delete', 'set'].forEach(function(methodName) {\r\n var method = searchParams[methodName];\r\n searchParams[methodName] = function() {\r\n method.apply(searchParams, arguments);\r\n if (enableSearchUpdate) {\r\n enableSearchParamsUpdate = false;\r\n _this.search = searchParams.toString();\r\n enableSearchParamsUpdate = true;\r\n }\r\n };\r\n });\r\n\r\n Object.defineProperty(this, 'searchParams', {\r\n value: searchParams,\r\n enumerable: true\r\n });\r\n\r\n var search = void 0;\r\n Object.defineProperty(this, '_updateSearchParams', {\r\n enumerable: false,\r\n configurable: false,\r\n writable: false,\r\n value: function() {\r\n if (this.search !== search) {\r\n search = this.search;\r\n if (enableSearchParamsUpdate) {\r\n enableSearchUpdate = false;\r\n this.searchParams._fromString(this.search);\r\n enableSearchUpdate = true;\r\n }\r\n }\r\n }\r\n });\r\n };\r\n\r\n var proto = URL.prototype;\r\n\r\n var linkURLWithAnchorAttribute = function(attributeName) {\r\n Object.defineProperty(proto, attributeName, {\r\n get: function() {\r\n return this._anchorElement[attributeName];\r\n },\r\n set: function(value) {\r\n this._anchorElement[attributeName] = value;\r\n },\r\n enumerable: true\r\n });\r\n };\r\n\r\n ['hash', 'host', 'hostname', 'port', 'protocol']\r\n .forEach(function(attributeName) {\r\n linkURLWithAnchorAttribute(attributeName);\r\n });\r\n\r\n Object.defineProperty(proto, 'search', {\r\n get: function() {\r\n return this._anchorElement['search'];\r\n },\r\n set: function(value) {\r\n this._anchorElement['search'] = value;\r\n this._updateSearchParams();\r\n },\r\n enumerable: true\r\n });\r\n\r\n Object.defineProperties(proto, {\r\n\r\n 'toString': {\r\n get: function() {\r\n var _this = this;\r\n return function() {\r\n return _this.href;\r\n };\r\n }\r\n },\r\n\r\n 'href': {\r\n get: function() {\r\n return this._anchorElement.href.replace(/\\?$/, '');\r\n },\r\n set: function(value) {\r\n this._anchorElement.href = value;\r\n this._updateSearchParams();\r\n },\r\n enumerable: true\r\n },\r\n\r\n 'pathname': {\r\n get: function() {\r\n return this._anchorElement.pathname.replace(/(^\\/?)/, '/');\r\n },\r\n set: function(value) {\r\n this._anchorElement.pathname = value;\r\n },\r\n enumerable: true\r\n },\r\n\r\n 'origin': {\r\n get: function() {\r\n // get expected port from protocol\r\n var expectedPort = { 'http:': 80, 'https:': 443, 'ftp:': 21 }[this._anchorElement.protocol];\r\n // add port to origin if, expected port is different than actual port\r\n // and it is not empty f.e http://foo:8080\r\n // 8080 != 80 && 8080 != ''\r\n var addPortToOrigin = this._anchorElement.port != expectedPort &&\r\n this._anchorElement.port !== '';\r\n\r\n return this._anchorElement.protocol +\r\n '//' +\r\n this._anchorElement.hostname +\r\n (addPortToOrigin ? (':' + this._anchorElement.port) : '');\r\n },\r\n enumerable: true\r\n },\r\n\r\n 'password': { // TODO\r\n get: function() {\r\n return '';\r\n },\r\n set: function(value) {\r\n },\r\n enumerable: true\r\n },\r\n\r\n 'username': { // TODO\r\n get: function() {\r\n return '';\r\n },\r\n set: function(value) {\r\n },\r\n enumerable: true\r\n },\r\n });\r\n\r\n URL.createObjectURL = function(blob) {\r\n return _URL.createObjectURL.apply(_URL, arguments);\r\n };\r\n\r\n URL.revokeObjectURL = function(url) {\r\n return _URL.revokeObjectURL.apply(_URL, arguments);\r\n };\r\n\r\n global.URL = URL;\r\n\r\n };\r\n\r\n if (!checkIfURLIsSupported()) {\r\n polyfillURL();\r\n }\r\n\r\n if ((global.location !== void 0) && !('origin' in global.location)) {\r\n var getOrigin = function() {\r\n return global.location.protocol + '//' + global.location.hostname + (global.location.port ? (':' + global.location.port) : '');\r\n };\r\n\r\n try {\r\n Object.defineProperty(global.location, 'origin', {\r\n get: getOrigin,\r\n enumerable: true\r\n });\r\n } catch (e) {\r\n setInterval(function() {\r\n global.location.origin = getOrigin();\r\n }, 100);\r\n }\r\n }\r\n\r\n})(\r\n (typeof global !== 'undefined') ? global\r\n : ((typeof window !== 'undefined') ? window\r\n : ((typeof self !== 'undefined') ? self : this))\r\n);\r\n", "/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global global, define, System, Reflect, Promise */\r\nvar __extends;\r\nvar __assign;\r\nvar __rest;\r\nvar __decorate;\r\nvar __param;\r\nvar __metadata;\r\nvar __awaiter;\r\nvar __generator;\r\nvar __exportStar;\r\nvar __values;\r\nvar __read;\r\nvar __spread;\r\nvar __spreadArrays;\r\nvar __spreadArray;\r\nvar __await;\r\nvar __asyncGenerator;\r\nvar __asyncDelegator;\r\nvar __asyncValues;\r\nvar __makeTemplateObject;\r\nvar __importStar;\r\nvar __importDefault;\r\nvar __classPrivateFieldGet;\r\nvar __classPrivateFieldSet;\r\nvar __createBinding;\r\n(function (factory) {\r\n var root = typeof global === \"object\" ? global : typeof self === \"object\" ? self : typeof this === \"object\" ? this : {};\r\n if (typeof define === \"function\" && define.amd) {\r\n define(\"tslib\", [\"exports\"], function (exports) { factory(createExporter(root, createExporter(exports))); });\r\n }\r\n else if (typeof module === \"object\" && typeof module.exports === \"object\") {\r\n factory(createExporter(root, createExporter(module.exports)));\r\n }\r\n else {\r\n factory(createExporter(root));\r\n }\r\n function createExporter(exports, previous) {\r\n if (exports !== root) {\r\n if (typeof Object.create === \"function\") {\r\n Object.defineProperty(exports, \"__esModule\", { value: true });\r\n }\r\n else {\r\n exports.__esModule = true;\r\n }\r\n }\r\n return function (id, v) { return exports[id] = previous ? previous(id, v) : v; };\r\n }\r\n})\r\n(function (exporter) {\r\n var extendStatics = Object.setPrototypeOf ||\r\n ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n\r\n __extends = function (d, b) {\r\n if (typeof b !== \"function\" && b !== null)\r\n throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n extendStatics(d, b);\r\n function __() { this.constructor = d; }\r\n d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n };\r\n\r\n __assign = Object.assign || function (t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n };\r\n\r\n __rest = function (s, e) {\r\n var t = {};\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n t[p] = s[p];\r\n if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n t[p[i]] = s[p[i]];\r\n }\r\n return t;\r\n };\r\n\r\n __decorate = function (decorators, target, key, desc) {\r\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n };\r\n\r\n __param = function (paramIndex, decorator) {\r\n return function (target, key) { decorator(target, key, paramIndex); }\r\n };\r\n\r\n __metadata = function (metadataKey, metadataValue) {\r\n if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n };\r\n\r\n __awaiter = function (thisArg, _arguments, P, generator) {\r\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n return new (P || (P = Promise))(function (resolve, reject) {\r\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n });\r\n };\r\n\r\n __generator = function (thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n };\r\n\r\n __exportStar = function(m, o) {\r\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n };\r\n\r\n __createBinding = Object.create ? (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\r\n }) : (function(o, m, k, k2) {\r\n if (k2 === undefined) k2 = k;\r\n o[k2] = m[k];\r\n });\r\n\r\n __values = function (o) {\r\n var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n if (m) return m.call(o);\r\n if (o && typeof o.length === \"number\") return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n };\r\n\r\n __read = function (o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n };\r\n\r\n /** @deprecated */\r\n __spread = function () {\r\n for (var ar = [], i = 0; i < arguments.length; i++)\r\n ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n };\r\n\r\n /** @deprecated */\r\n __spreadArrays = function () {\r\n for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n r[k] = a[j];\r\n return r;\r\n };\r\n\r\n __spreadArray = function (to, from, pack) {\r\n if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n if (ar || !(i in from)) {\r\n if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n ar[i] = from[i];\r\n }\r\n }\r\n return to.concat(ar || Array.prototype.slice.call(from));\r\n };\r\n\r\n __await = function (v) {\r\n return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n };\r\n\r\n __asyncGenerator = function (thisArg, _arguments, generator) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n function fulfill(value) { resume(\"next\", value); }\r\n function reject(value) { resume(\"throw\", value); }\r\n function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n };\r\n\r\n __asyncDelegator = function (o) {\r\n var i, p;\r\n return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n };\r\n\r\n __asyncValues = function (o) {\r\n if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n var m = o[Symbol.asyncIterator], i;\r\n return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n };\r\n\r\n __makeTemplateObject = function (cooked, raw) {\r\n if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n return cooked;\r\n };\r\n\r\n var __setModuleDefault = Object.create ? (function(o, v) {\r\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n }) : function(o, v) {\r\n o[\"default\"] = v;\r\n };\r\n\r\n __importStar = function (mod) {\r\n if (mod && mod.__esModule) return mod;\r\n var result = {};\r\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n __setModuleDefault(result, mod);\r\n return result;\r\n };\r\n\r\n __importDefault = function (mod) {\r\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\r\n };\r\n\r\n __classPrivateFieldGet = function (receiver, state, kind, f) {\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n };\r\n\r\n __classPrivateFieldSet = function (receiver, state, value, kind, f) {\r\n if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n };\r\n\r\n exporter(\"__extends\", __extends);\r\n exporter(\"__assign\", __assign);\r\n exporter(\"__rest\", __rest);\r\n exporter(\"__decorate\", __decorate);\r\n exporter(\"__param\", __param);\r\n exporter(\"__metadata\", __metadata);\r\n exporter(\"__awaiter\", __awaiter);\r\n exporter(\"__generator\", __generator);\r\n exporter(\"__exportStar\", __exportStar);\r\n exporter(\"__createBinding\", __createBinding);\r\n exporter(\"__values\", __values);\r\n exporter(\"__read\", __read);\r\n exporter(\"__spread\", __spread);\r\n exporter(\"__spreadArrays\", __spreadArrays);\r\n exporter(\"__spreadArray\", __spreadArray);\r\n exporter(\"__await\", __await);\r\n exporter(\"__asyncGenerator\", __asyncGenerator);\r\n exporter(\"__asyncDelegator\", __asyncDelegator);\r\n exporter(\"__asyncValues\", __asyncValues);\r\n exporter(\"__makeTemplateObject\", __makeTemplateObject);\r\n exporter(\"__importStar\", __importStar);\r\n exporter(\"__importDefault\", __importDefault);\r\n exporter(\"__classPrivateFieldGet\", __classPrivateFieldGet);\r\n exporter(\"__classPrivateFieldSet\", __classPrivateFieldSet);\r\n});\r\n", "/*!\n * clipboard.js v2.0.10\n * https://clipboardjs.com/\n *\n * Licensed MIT \u00A9 Zeno Rocha\n */\n(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"ClipboardJS\"] = factory();\n\telse\n\t\troot[\"ClipboardJS\"] = factory();\n})(this, function() {\nreturn /******/ (function() { // webpackBootstrap\n/******/ \tvar __webpack_modules__ = ({\n\n/***/ 686:\n/***/ (function(__unused_webpack_module, __webpack_exports__, __webpack_require__) {\n\n\"use strict\";\n\n// EXPORTS\n__webpack_require__.d(__webpack_exports__, {\n \"default\": function() { return /* binding */ clipboard; }\n});\n\n// EXTERNAL MODULE: ./node_modules/tiny-emitter/index.js\nvar tiny_emitter = __webpack_require__(279);\nvar tiny_emitter_default = /*#__PURE__*/__webpack_require__.n(tiny_emitter);\n// EXTERNAL MODULE: ./node_modules/good-listener/src/listen.js\nvar listen = __webpack_require__(370);\nvar listen_default = /*#__PURE__*/__webpack_require__.n(listen);\n// EXTERNAL MODULE: ./node_modules/select/src/select.js\nvar src_select = __webpack_require__(817);\nvar select_default = /*#__PURE__*/__webpack_require__.n(src_select);\n;// CONCATENATED MODULE: ./src/common/command.js\n/**\n * Executes a given operation type.\n * @param {String} type\n * @return {Boolean}\n */\nfunction command(type) {\n try {\n return document.execCommand(type);\n } catch (err) {\n return false;\n }\n}\n;// CONCATENATED MODULE: ./src/actions/cut.js\n\n\n/**\n * Cut action wrapper.\n * @param {String|HTMLElement} target\n * @return {String}\n */\n\nvar ClipboardActionCut = function ClipboardActionCut(target) {\n var selectedText = select_default()(target);\n command('cut');\n return selectedText;\n};\n\n/* harmony default export */ var actions_cut = (ClipboardActionCut);\n;// CONCATENATED MODULE: ./src/common/create-fake-element.js\n/**\n * Creates a fake textarea element with a value.\n * @param {String} value\n * @return {HTMLElement}\n */\nfunction createFakeElement(value) {\n var isRTL = document.documentElement.getAttribute('dir') === 'rtl';\n var fakeElement = document.createElement('textarea'); // Prevent zooming on iOS\n\n fakeElement.style.fontSize = '12pt'; // Reset box model\n\n fakeElement.style.border = '0';\n fakeElement.style.padding = '0';\n fakeElement.style.margin = '0'; // Move element out of screen horizontally\n\n fakeElement.style.position = 'absolute';\n fakeElement.style[isRTL ? 'right' : 'left'] = '-9999px'; // Move element to the same position vertically\n\n var yPosition = window.pageYOffset || document.documentElement.scrollTop;\n fakeElement.style.top = \"\".concat(yPosition, \"px\");\n fakeElement.setAttribute('readonly', '');\n fakeElement.value = value;\n return fakeElement;\n}\n;// CONCATENATED MODULE: ./src/actions/copy.js\n\n\n\n/**\n * Copy action wrapper.\n * @param {String|HTMLElement} target\n * @param {Object} options\n * @return {String}\n */\n\nvar ClipboardActionCopy = function ClipboardActionCopy(target) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n container: document.body\n };\n var selectedText = '';\n\n if (typeof target === 'string') {\n var fakeElement = createFakeElement(target);\n options.container.appendChild(fakeElement);\n selectedText = select_default()(fakeElement);\n command('copy');\n fakeElement.remove();\n } else {\n selectedText = select_default()(target);\n command('copy');\n }\n\n return selectedText;\n};\n\n/* harmony default export */ var actions_copy = (ClipboardActionCopy);\n;// CONCATENATED MODULE: ./src/actions/default.js\nfunction _typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\n\n\n/**\n * Inner function which performs selection from either `text` or `target`\n * properties and then executes copy or cut operations.\n * @param {Object} options\n */\n\nvar ClipboardActionDefault = function ClipboardActionDefault() {\n var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n // Defines base properties passed from constructor.\n var _options$action = options.action,\n action = _options$action === void 0 ? 'copy' : _options$action,\n container = options.container,\n target = options.target,\n text = options.text; // Sets the `action` to be performed which can be either 'copy' or 'cut'.\n\n if (action !== 'copy' && action !== 'cut') {\n throw new Error('Invalid \"action\" value, use either \"copy\" or \"cut\"');\n } // Sets the `target` property using an element that will be have its content copied.\n\n\n if (target !== undefined) {\n if (target && _typeof(target) === 'object' && target.nodeType === 1) {\n if (action === 'copy' && target.hasAttribute('disabled')) {\n throw new Error('Invalid \"target\" attribute. Please use \"readonly\" instead of \"disabled\" attribute');\n }\n\n if (action === 'cut' && (target.hasAttribute('readonly') || target.hasAttribute('disabled'))) {\n throw new Error('Invalid \"target\" attribute. You can\\'t cut text from elements with \"readonly\" or \"disabled\" attributes');\n }\n } else {\n throw new Error('Invalid \"target\" value, use a valid Element');\n }\n } // Define selection strategy based on `text` property.\n\n\n if (text) {\n return actions_copy(text, {\n container: container\n });\n } // Defines which selection strategy based on `target` property.\n\n\n if (target) {\n return action === 'cut' ? actions_cut(target) : actions_copy(target, {\n container: container\n });\n }\n};\n\n/* harmony default export */ var actions_default = (ClipboardActionDefault);\n;// CONCATENATED MODULE: ./src/clipboard.js\nfunction clipboard_typeof(obj) { \"@babel/helpers - typeof\"; if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { clipboard_typeof = function _typeof(obj) { return typeof obj; }; } else { clipboard_typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return clipboard_typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _createSuper(Derived) { var hasNativeReflectConstruct = _isNativeReflectConstruct(); return function _createSuperInternal() { var Super = _getPrototypeOf(Derived), result; if (hasNativeReflectConstruct) { var NewTarget = _getPrototypeOf(this).constructor; result = Reflect.construct(Super, arguments, NewTarget); } else { result = Super.apply(this, arguments); } return _possibleConstructorReturn(this, result); }; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (clipboard_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\n\n\n\n\n\n/**\n * Helper function to retrieve attribute value.\n * @param {String} suffix\n * @param {Element} element\n */\n\nfunction getAttributeValue(suffix, element) {\n var attribute = \"data-clipboard-\".concat(suffix);\n\n if (!element.hasAttribute(attribute)) {\n return;\n }\n\n return element.getAttribute(attribute);\n}\n/**\n * Base class which takes one or more elements, adds event listeners to them,\n * and instantiates a new `ClipboardAction` on each click.\n */\n\n\nvar Clipboard = /*#__PURE__*/function (_Emitter) {\n _inherits(Clipboard, _Emitter);\n\n var _super = _createSuper(Clipboard);\n\n /**\n * @param {String|HTMLElement|HTMLCollection|NodeList} trigger\n * @param {Object} options\n */\n function Clipboard(trigger, options) {\n var _this;\n\n _classCallCheck(this, Clipboard);\n\n _this = _super.call(this);\n\n _this.resolveOptions(options);\n\n _this.listenClick(trigger);\n\n return _this;\n }\n /**\n * Defines if attributes would be resolved using internal setter functions\n * or custom functions that were passed in the constructor.\n * @param {Object} options\n */\n\n\n _createClass(Clipboard, [{\n key: \"resolveOptions\",\n value: function resolveOptions() {\n var options = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : {};\n this.action = typeof options.action === 'function' ? options.action : this.defaultAction;\n this.target = typeof options.target === 'function' ? options.target : this.defaultTarget;\n this.text = typeof options.text === 'function' ? options.text : this.defaultText;\n this.container = clipboard_typeof(options.container) === 'object' ? options.container : document.body;\n }\n /**\n * Adds a click event listener to the passed trigger.\n * @param {String|HTMLElement|HTMLCollection|NodeList} trigger\n */\n\n }, {\n key: \"listenClick\",\n value: function listenClick(trigger) {\n var _this2 = this;\n\n this.listener = listen_default()(trigger, 'click', function (e) {\n return _this2.onClick(e);\n });\n }\n /**\n * Defines a new `ClipboardAction` on each click event.\n * @param {Event} e\n */\n\n }, {\n key: \"onClick\",\n value: function onClick(e) {\n var trigger = e.delegateTarget || e.currentTarget;\n var action = this.action(trigger) || 'copy';\n var text = actions_default({\n action: action,\n container: this.container,\n target: this.target(trigger),\n text: this.text(trigger)\n }); // Fires an event based on the copy operation result.\n\n this.emit(text ? 'success' : 'error', {\n action: action,\n text: text,\n trigger: trigger,\n clearSelection: function clearSelection() {\n if (trigger) {\n trigger.focus();\n }\n\n document.activeElement.blur();\n window.getSelection().removeAllRanges();\n }\n });\n }\n /**\n * Default `action` lookup function.\n * @param {Element} trigger\n */\n\n }, {\n key: \"defaultAction\",\n value: function defaultAction(trigger) {\n return getAttributeValue('action', trigger);\n }\n /**\n * Default `target` lookup function.\n * @param {Element} trigger\n */\n\n }, {\n key: \"defaultTarget\",\n value: function defaultTarget(trigger) {\n var selector = getAttributeValue('target', trigger);\n\n if (selector) {\n return document.querySelector(selector);\n }\n }\n /**\n * Allow fire programmatically a copy action\n * @param {String|HTMLElement} target\n * @param {Object} options\n * @returns Text copied.\n */\n\n }, {\n key: \"defaultText\",\n\n /**\n * Default `text` lookup function.\n * @param {Element} trigger\n */\n value: function defaultText(trigger) {\n return getAttributeValue('text', trigger);\n }\n /**\n * Destroy lifecycle.\n */\n\n }, {\n key: \"destroy\",\n value: function destroy() {\n this.listener.destroy();\n }\n }], [{\n key: \"copy\",\n value: function copy(target) {\n var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {\n container: document.body\n };\n return actions_copy(target, options);\n }\n /**\n * Allow fire programmatically a cut action\n * @param {String|HTMLElement} target\n * @returns Text cutted.\n */\n\n }, {\n key: \"cut\",\n value: function cut(target) {\n return actions_cut(target);\n }\n /**\n * Returns the support of the given action, or all actions if no action is\n * given.\n * @param {String} [action]\n */\n\n }, {\n key: \"isSupported\",\n value: function isSupported() {\n var action = arguments.length > 0 && arguments[0] !== undefined ? arguments[0] : ['copy', 'cut'];\n var actions = typeof action === 'string' ? [action] : action;\n var support = !!document.queryCommandSupported;\n actions.forEach(function (action) {\n support = support && !!document.queryCommandSupported(action);\n });\n return support;\n }\n }]);\n\n return Clipboard;\n}((tiny_emitter_default()));\n\n/* harmony default export */ var clipboard = (Clipboard);\n\n/***/ }),\n\n/***/ 828:\n/***/ (function(module) {\n\nvar DOCUMENT_NODE_TYPE = 9;\n\n/**\n * A polyfill for Element.matches()\n */\nif (typeof Element !== 'undefined' && !Element.prototype.matches) {\n var proto = Element.prototype;\n\n proto.matches = proto.matchesSelector ||\n proto.mozMatchesSelector ||\n proto.msMatchesSelector ||\n proto.oMatchesSelector ||\n proto.webkitMatchesSelector;\n}\n\n/**\n * Finds the closest parent that matches a selector.\n *\n * @param {Element} element\n * @param {String} selector\n * @return {Function}\n */\nfunction closest (element, selector) {\n while (element && element.nodeType !== DOCUMENT_NODE_TYPE) {\n if (typeof element.matches === 'function' &&\n element.matches(selector)) {\n return element;\n }\n element = element.parentNode;\n }\n}\n\nmodule.exports = closest;\n\n\n/***/ }),\n\n/***/ 438:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar closest = __webpack_require__(828);\n\n/**\n * Delegates event to a selector.\n *\n * @param {Element} element\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @param {Boolean} useCapture\n * @return {Object}\n */\nfunction _delegate(element, selector, type, callback, useCapture) {\n var listenerFn = listener.apply(this, arguments);\n\n element.addEventListener(type, listenerFn, useCapture);\n\n return {\n destroy: function() {\n element.removeEventListener(type, listenerFn, useCapture);\n }\n }\n}\n\n/**\n * Delegates event to a selector.\n *\n * @param {Element|String|Array} [elements]\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @param {Boolean} useCapture\n * @return {Object}\n */\nfunction delegate(elements, selector, type, callback, useCapture) {\n // Handle the regular Element usage\n if (typeof elements.addEventListener === 'function') {\n return _delegate.apply(null, arguments);\n }\n\n // Handle Element-less usage, it defaults to global delegation\n if (typeof type === 'function') {\n // Use `document` as the first parameter, then apply arguments\n // This is a short way to .unshift `arguments` without running into deoptimizations\n return _delegate.bind(null, document).apply(null, arguments);\n }\n\n // Handle Selector-based usage\n if (typeof elements === 'string') {\n elements = document.querySelectorAll(elements);\n }\n\n // Handle Array-like based usage\n return Array.prototype.map.call(elements, function (element) {\n return _delegate(element, selector, type, callback, useCapture);\n });\n}\n\n/**\n * Finds closest match and invokes callback.\n *\n * @param {Element} element\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @return {Function}\n */\nfunction listener(element, selector, type, callback) {\n return function(e) {\n e.delegateTarget = closest(e.target, selector);\n\n if (e.delegateTarget) {\n callback.call(element, e);\n }\n }\n}\n\nmodule.exports = delegate;\n\n\n/***/ }),\n\n/***/ 879:\n/***/ (function(__unused_webpack_module, exports) {\n\n/**\n * Check if argument is a HTML element.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.node = function(value) {\n return value !== undefined\n && value instanceof HTMLElement\n && value.nodeType === 1;\n};\n\n/**\n * Check if argument is a list of HTML elements.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.nodeList = function(value) {\n var type = Object.prototype.toString.call(value);\n\n return value !== undefined\n && (type === '[object NodeList]' || type === '[object HTMLCollection]')\n && ('length' in value)\n && (value.length === 0 || exports.node(value[0]));\n};\n\n/**\n * Check if argument is a string.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.string = function(value) {\n return typeof value === 'string'\n || value instanceof String;\n};\n\n/**\n * Check if argument is a function.\n *\n * @param {Object} value\n * @return {Boolean}\n */\nexports.fn = function(value) {\n var type = Object.prototype.toString.call(value);\n\n return type === '[object Function]';\n};\n\n\n/***/ }),\n\n/***/ 370:\n/***/ (function(module, __unused_webpack_exports, __webpack_require__) {\n\nvar is = __webpack_require__(879);\nvar delegate = __webpack_require__(438);\n\n/**\n * Validates all params and calls the right\n * listener function based on its target type.\n *\n * @param {String|HTMLElement|HTMLCollection|NodeList} target\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listen(target, type, callback) {\n if (!target && !type && !callback) {\n throw new Error('Missing required arguments');\n }\n\n if (!is.string(type)) {\n throw new TypeError('Second argument must be a String');\n }\n\n if (!is.fn(callback)) {\n throw new TypeError('Third argument must be a Function');\n }\n\n if (is.node(target)) {\n return listenNode(target, type, callback);\n }\n else if (is.nodeList(target)) {\n return listenNodeList(target, type, callback);\n }\n else if (is.string(target)) {\n return listenSelector(target, type, callback);\n }\n else {\n throw new TypeError('First argument must be a String, HTMLElement, HTMLCollection, or NodeList');\n }\n}\n\n/**\n * Adds an event listener to a HTML element\n * and returns a remove listener function.\n *\n * @param {HTMLElement} node\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listenNode(node, type, callback) {\n node.addEventListener(type, callback);\n\n return {\n destroy: function() {\n node.removeEventListener(type, callback);\n }\n }\n}\n\n/**\n * Add an event listener to a list of HTML elements\n * and returns a remove listener function.\n *\n * @param {NodeList|HTMLCollection} nodeList\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listenNodeList(nodeList, type, callback) {\n Array.prototype.forEach.call(nodeList, function(node) {\n node.addEventListener(type, callback);\n });\n\n return {\n destroy: function() {\n Array.prototype.forEach.call(nodeList, function(node) {\n node.removeEventListener(type, callback);\n });\n }\n }\n}\n\n/**\n * Add an event listener to a selector\n * and returns a remove listener function.\n *\n * @param {String} selector\n * @param {String} type\n * @param {Function} callback\n * @return {Object}\n */\nfunction listenSelector(selector, type, callback) {\n return delegate(document.body, selector, type, callback);\n}\n\nmodule.exports = listen;\n\n\n/***/ }),\n\n/***/ 817:\n/***/ (function(module) {\n\nfunction select(element) {\n var selectedText;\n\n if (element.nodeName === 'SELECT') {\n element.focus();\n\n selectedText = element.value;\n }\n else if (element.nodeName === 'INPUT' || element.nodeName === 'TEXTAREA') {\n var isReadOnly = element.hasAttribute('readonly');\n\n if (!isReadOnly) {\n element.setAttribute('readonly', '');\n }\n\n element.select();\n element.setSelectionRange(0, element.value.length);\n\n if (!isReadOnly) {\n element.removeAttribute('readonly');\n }\n\n selectedText = element.value;\n }\n else {\n if (element.hasAttribute('contenteditable')) {\n element.focus();\n }\n\n var selection = window.getSelection();\n var range = document.createRange();\n\n range.selectNodeContents(element);\n selection.removeAllRanges();\n selection.addRange(range);\n\n selectedText = selection.toString();\n }\n\n return selectedText;\n}\n\nmodule.exports = select;\n\n\n/***/ }),\n\n/***/ 279:\n/***/ (function(module) {\n\nfunction E () {\n // Keep this empty so it's easier to inherit from\n // (via https://github.com/lipsmack from https://github.com/scottcorgan/tiny-emitter/issues/3)\n}\n\nE.prototype = {\n on: function (name, callback, ctx) {\n var e = this.e || (this.e = {});\n\n (e[name] || (e[name] = [])).push({\n fn: callback,\n ctx: ctx\n });\n\n return this;\n },\n\n once: function (name, callback, ctx) {\n var self = this;\n function listener () {\n self.off(name, listener);\n callback.apply(ctx, arguments);\n };\n\n listener._ = callback\n return this.on(name, listener, ctx);\n },\n\n emit: function (name) {\n var data = [].slice.call(arguments, 1);\n var evtArr = ((this.e || (this.e = {}))[name] || []).slice();\n var i = 0;\n var len = evtArr.length;\n\n for (i; i < len; i++) {\n evtArr[i].fn.apply(evtArr[i].ctx, data);\n }\n\n return this;\n },\n\n off: function (name, callback) {\n var e = this.e || (this.e = {});\n var evts = e[name];\n var liveEvents = [];\n\n if (evts && callback) {\n for (var i = 0, len = evts.length; i < len; i++) {\n if (evts[i].fn !== callback && evts[i].fn._ !== callback)\n liveEvents.push(evts[i]);\n }\n }\n\n // Remove event from queue to prevent memory leak\n // Suggested by https://github.com/lazd\n // Ref: https://github.com/scottcorgan/tiny-emitter/commit/c6ebfaa9bc973b33d110a84a307742b7cf94c953#commitcomment-5024910\n\n (liveEvents.length)\n ? e[name] = liveEvents\n : delete e[name];\n\n return this;\n }\n};\n\nmodule.exports = E;\nmodule.exports.TinyEmitter = E;\n\n\n/***/ })\n\n/******/ \t});\n/************************************************************************/\n/******/ \t// The module cache\n/******/ \tvar __webpack_module_cache__ = {};\n/******/ \t\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(__webpack_module_cache__[moduleId]) {\n/******/ \t\t\treturn __webpack_module_cache__[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = __webpack_module_cache__[moduleId] = {\n/******/ \t\t\t// no module.id needed\n/******/ \t\t\t// no module.loaded needed\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/ \t\n/******/ \t\t// Execute the module function\n/******/ \t\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n/******/ \t\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/ \t\n/************************************************************************/\n/******/ \t/* webpack/runtime/compat get default export */\n/******/ \t!function() {\n/******/ \t\t// getDefaultExport function for compatibility with non-harmony modules\n/******/ \t\t__webpack_require__.n = function(module) {\n/******/ \t\t\tvar getter = module && module.__esModule ?\n/******/ \t\t\t\tfunction() { return module['default']; } :\n/******/ \t\t\t\tfunction() { return module; };\n/******/ \t\t\t__webpack_require__.d(getter, { a: getter });\n/******/ \t\t\treturn getter;\n/******/ \t\t};\n/******/ \t}();\n/******/ \t\n/******/ \t/* webpack/runtime/define property getters */\n/******/ \t!function() {\n/******/ \t\t// define getter functions for harmony exports\n/******/ \t\t__webpack_require__.d = function(exports, definition) {\n/******/ \t\t\tfor(var key in definition) {\n/******/ \t\t\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n/******/ \t\t\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n/******/ \t\t\t\t}\n/******/ \t\t\t}\n/******/ \t\t};\n/******/ \t}();\n/******/ \t\n/******/ \t/* webpack/runtime/hasOwnProperty shorthand */\n/******/ \t!function() {\n/******/ \t\t__webpack_require__.o = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }\n/******/ \t}();\n/******/ \t\n/************************************************************************/\n/******/ \t// module exports must be returned from runtime so entry inlining is disabled\n/******/ \t// startup\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(686);\n/******/ })()\n.default;\n});", "/*!\n * escape-html\n * Copyright(c) 2012-2013 TJ Holowaychuk\n * Copyright(c) 2015 Andreas Lubbe\n * Copyright(c) 2015 Tiancheng \"Timothy\" Gu\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module variables.\n * @private\n */\n\nvar matchHtmlRegExp = /[\"'&<>]/;\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = escapeHtml;\n\n/**\n * Escape special characters in the given string of html.\n *\n * @param {string} string The string to escape for inserting into HTML\n * @return {string}\n * @public\n */\n\nfunction escapeHtml(string) {\n var str = '' + string;\n var match = matchHtmlRegExp.exec(str);\n\n if (!match) {\n return str;\n }\n\n var escape;\n var html = '';\n var index = 0;\n var lastIndex = 0;\n\n for (index = match.index; index < str.length; index++) {\n switch (str.charCodeAt(index)) {\n case 34: // \"\n escape = '"';\n break;\n case 38: // &\n escape = '&';\n break;\n case 39: // '\n escape = ''';\n break;\n case 60: // <\n escape = '<';\n break;\n case 62: // >\n escape = '>';\n break;\n default:\n continue;\n }\n\n if (lastIndex !== index) {\n html += str.substring(lastIndex, index);\n }\n\n lastIndex = index + 1;\n html += escape;\n }\n\n return lastIndex !== index\n ? html + str.substring(lastIndex, index)\n : html;\n}\n", "Array.prototype.flat||Object.defineProperty(Array.prototype,\"flat\",{configurable:!0,value:function r(){var t=isNaN(arguments[0])?1:Number(arguments[0]);return t?Array.prototype.reduce.call(this,function(a,e){return Array.isArray(e)?a.push.apply(a,r.call(e,t-1)):a.push(e),a},[]):Array.prototype.slice.call(this)},writable:!0}),Array.prototype.flatMap||Object.defineProperty(Array.prototype,\"flatMap\",{configurable:!0,value:function(r){return Array.prototype.map.apply(this,arguments).flat()},writable:!0})\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport \"array-flat-polyfill\"\nimport \"focus-visible\"\nimport \"unfetch/polyfill\"\nimport \"url-polyfill\"\n\nimport {\n EMPTY,\n NEVER,\n Subject,\n defer,\n delay,\n filter,\n map,\n merge,\n mergeWith,\n shareReplay,\n switchMap\n} from \"rxjs\"\n\nimport { configuration, feature } from \"./_\"\nimport {\n at,\n getOptionalElement,\n requestJSON,\n setToggle,\n watchDocument,\n watchKeyboard,\n watchLocation,\n watchLocationTarget,\n watchMedia,\n watchPrint,\n watchViewport\n} from \"./browser\"\nimport {\n getComponentElement,\n getComponentElements,\n mountBackToTop,\n mountContent,\n mountDialog,\n mountHeader,\n mountHeaderTitle,\n mountPalette,\n mountSearch,\n mountSearchHiglight,\n mountSidebar,\n mountSource,\n mountTableOfContents,\n mountTabs,\n watchHeader,\n watchMain\n} from \"./components\"\nimport {\n SearchIndex,\n setupClipboardJS,\n setupInstantLoading,\n setupVersionSelector\n} from \"./integrations\"\nimport {\n patchIndeterminate,\n patchScrollfix,\n patchScrolllock\n} from \"./patches\"\nimport \"./polyfills\"\n\n/* ----------------------------------------------------------------------------\n * Application\n * ------------------------------------------------------------------------- */\n\n/* Yay, JavaScript is available */\ndocument.documentElement.classList.remove(\"no-js\")\ndocument.documentElement.classList.add(\"js\")\n\n/* Set up navigation observables and subjects */\nconst document$ = watchDocument()\nconst location$ = watchLocation()\nconst target$ = watchLocationTarget()\nconst keyboard$ = watchKeyboard()\n\n/* Set up media observables */\nconst viewport$ = watchViewport()\nconst tablet$ = watchMedia(\"(min-width: 960px)\")\nconst screen$ = watchMedia(\"(min-width: 1220px)\")\nconst print$ = watchPrint()\n\n/* Retrieve search index, if search is enabled */\nconst config = configuration()\nconst index$ = document.forms.namedItem(\"search\")\n ? __search?.index || requestJSON(\n new URL(\"search/search_index.json\", config.base)\n )\n : NEVER\n\n/* Set up Clipboard.js integration */\nconst alert$ = new Subject()\nsetupClipboardJS({ alert$ })\n\n/* Set up instant loading, if enabled */\nif (feature(\"navigation.instant\"))\n setupInstantLoading({ document$, location$, viewport$ })\n\n/* Set up version selector */\nif (config.version?.provider === \"mike\")\n setupVersionSelector()\n\n/* Always close drawer and search on navigation */\nmerge(location$, target$)\n .pipe(\n delay(125)\n )\n .subscribe(() => {\n setToggle(\"drawer\", false)\n setToggle(\"search\", false)\n })\n\n/* Set up global keyboard handlers */\nkeyboard$\n .pipe(\n filter(({ mode }) => mode === \"global\")\n )\n .subscribe(key => {\n switch (key.type) {\n\n /* Go to previous page */\n case \"p\":\n case \",\":\n const prev = getOptionalElement(\"[href][rel=prev]\")\n if (typeof prev !== \"undefined\")\n prev.click()\n break\n\n /* Go to next page */\n case \"n\":\n case \".\":\n const next = getOptionalElement(\"[href][rel=next]\")\n if (typeof next !== \"undefined\")\n next.click()\n break\n }\n })\n\n/* Set up patches */\npatchIndeterminate({ document$, tablet$ })\npatchScrollfix({ document$ })\npatchScrolllock({ viewport$, tablet$ })\n\n/* Set up header and main area observable */\nconst header$ = watchHeader(getComponentElement(\"header\"), { viewport$ })\nconst main$ = document$\n .pipe(\n map(() => getComponentElement(\"main\")),\n switchMap(el => watchMain(el, { viewport$, header$ })),\n shareReplay(1)\n )\n\n/* Set up control component observables */\nconst control$ = merge(\n\n /* Dialog */\n ...getComponentElements(\"dialog\")\n .map(el => mountDialog(el, { alert$ })),\n\n /* Header */\n ...getComponentElements(\"header\")\n .map(el => mountHeader(el, { viewport$, header$, main$ })),\n\n /* Color palette */\n ...getComponentElements(\"palette\")\n .map(el => mountPalette(el)),\n\n /* Search */\n ...getComponentElements(\"search\")\n .map(el => mountSearch(el, { index$, keyboard$ })),\n\n /* Repository information */\n ...getComponentElements(\"source\")\n .map(el => mountSource(el))\n)\n\n/* Set up content component observables */\nconst content$ = defer(() => merge(\n\n /* Content */\n ...getComponentElements(\"content\")\n .map(el => mountContent(el, { target$, print$ })),\n\n /* Search highlighting */\n ...getComponentElements(\"content\")\n .map(el => feature(\"search.highlight\")\n ? mountSearchHiglight(el, { index$, location$ })\n : EMPTY\n ),\n\n /* Header title */\n ...getComponentElements(\"header-title\")\n .map(el => mountHeaderTitle(el, { viewport$, header$ })),\n\n /* Sidebar */\n ...getComponentElements(\"sidebar\")\n .map(el => el.getAttribute(\"data-md-type\") === \"navigation\"\n ? at(screen$, () => mountSidebar(el, { viewport$, header$, main$ }))\n : at(tablet$, () => mountSidebar(el, { viewport$, header$, main$ }))\n ),\n\n /* Navigation tabs */\n ...getComponentElements(\"tabs\")\n .map(el => mountTabs(el, { viewport$, header$ })),\n\n /* Table of contents */\n ...getComponentElements(\"toc\")\n .map(el => mountTableOfContents(el, { viewport$, header$ })),\n\n /* Back-to-top button */\n ...getComponentElements(\"top\")\n .map(el => mountBackToTop(el, { viewport$, header$, main$, target$ }))\n))\n\n/* Set up component observables */\nconst component$ = document$\n .pipe(\n switchMap(() => content$),\n mergeWith(control$),\n shareReplay(1)\n )\n\n/* Subscribe to all components */\ncomponent$.subscribe()\n\n/* ----------------------------------------------------------------------------\n * Exports\n * ------------------------------------------------------------------------- */\n\nwindow.document$ = document$ /* Document observable */\nwindow.location$ = location$ /* Location subject */\nwindow.target$ = target$ /* Location target observable */\nwindow.keyboard$ = keyboard$ /* Keyboard observable */\nwindow.viewport$ = viewport$ /* Viewport observable */\nwindow.tablet$ = tablet$ /* Media tablet observable */\nwindow.screen$ = screen$ /* Media screen observable */\nwindow.print$ = print$ /* Media print observable */\nwindow.alert$ = alert$ /* Alert subject */\nwindow.component$ = component$ /* Component observable */\n", "self.fetch||(self.fetch=function(e,n){return n=n||{},new Promise(function(t,s){var r=new XMLHttpRequest,o=[],u=[],i={},a=function(){return{ok:2==(r.status/100|0),statusText:r.statusText,status:r.status,url:r.responseURL,text:function(){return Promise.resolve(r.responseText)},json:function(){return Promise.resolve(r.responseText).then(JSON.parse)},blob:function(){return Promise.resolve(new Blob([r.response]))},clone:a,headers:{keys:function(){return o},entries:function(){return u},get:function(e){return i[e.toLowerCase()]},has:function(e){return e.toLowerCase()in i}}}};for(var c in r.open(n.method||\"get\",e,!0),r.onload=function(){r.getAllResponseHeaders().replace(/^(.*?):[^\\S\\n]*([\\s\\S]*?)$/gm,function(e,n,t){o.push(n=n.toLowerCase()),u.push([n,t]),i[n]=i[n]?i[n]+\",\"+t:t}),t(a())},r.onerror=s,r.withCredentials=\"include\"==n.credentials,n.headers)r.setRequestHeader(c,n.headers[c]);r.send(n.body||null)})});\n", "import tslib from '../tslib.js';\r\nconst {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __spreadArray,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n} = tslib;\r\nexport {\r\n __extends,\r\n __assign,\r\n __rest,\r\n __decorate,\r\n __param,\r\n __metadata,\r\n __awaiter,\r\n __generator,\r\n __exportStar,\r\n __createBinding,\r\n __values,\r\n __read,\r\n __spread,\r\n __spreadArrays,\r\n __spreadArray,\r\n __await,\r\n __asyncGenerator,\r\n __asyncDelegator,\r\n __asyncValues,\r\n __makeTemplateObject,\r\n __importStar,\r\n __importDefault,\r\n __classPrivateFieldGet,\r\n __classPrivateFieldSet,\r\n};\r\n", null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n ReplaySubject,\n Subject,\n fromEvent\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch document\n *\n * Documents are implemented as subjects, so all downstream observables are\n * automatically updated when a new document is emitted.\n *\n * @returns Document subject\n */\nexport function watchDocument(): Subject {\n const document$ = new ReplaySubject(1)\n fromEvent(document, \"DOMContentLoaded\", { once: true })\n .subscribe(() => document$.next(document))\n\n /* Return document */\n return document$\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve all elements matching the query selector\n *\n * @template T - Element type\n *\n * @param selector - Query selector\n * @param node - Node of reference\n *\n * @returns Elements\n */\nexport function getElements(\n selector: T, node?: ParentNode\n): HTMLElementTagNameMap[T][]\n\nexport function getElements(\n selector: string, node?: ParentNode\n): T[]\n\nexport function getElements(\n selector: string, node: ParentNode = document\n): T[] {\n return Array.from(node.querySelectorAll(selector))\n}\n\n/**\n * Retrieve an element matching a query selector or throw a reference error\n *\n * Note that this function assumes that the element is present. If unsure if an\n * element is existent, use the `getOptionalElement` function instead.\n *\n * @template T - Element type\n *\n * @param selector - Query selector\n * @param node - Node of reference\n *\n * @returns Element\n */\nexport function getElement(\n selector: T, node?: ParentNode\n): HTMLElementTagNameMap[T]\n\nexport function getElement(\n selector: string, node?: ParentNode\n): T\n\nexport function getElement(\n selector: string, node: ParentNode = document\n): T {\n const el = getOptionalElement(selector, node)\n if (typeof el === \"undefined\")\n throw new ReferenceError(\n `Missing element: expected \"${selector}\" to be present`\n )\n\n /* Return element */\n return el\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Retrieve an optional element matching the query selector\n *\n * @template T - Element type\n *\n * @param selector - Query selector\n * @param node - Node of reference\n *\n * @returns Element or nothing\n */\nexport function getOptionalElement(\n selector: T, node?: ParentNode\n): HTMLElementTagNameMap[T] | undefined\n\nexport function getOptionalElement(\n selector: string, node?: ParentNode\n): T | undefined\n\nexport function getOptionalElement(\n selector: string, node: ParentNode = document\n): T | undefined {\n return node.querySelector(selector) || undefined\n}\n\n/**\n * Retrieve the currently active element\n *\n * @returns Element or nothing\n */\nexport function getActiveElement(): HTMLElement | undefined {\n return document.activeElement instanceof HTMLElement\n ? document.activeElement || undefined\n : undefined\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n debounceTime,\n distinctUntilChanged,\n fromEvent,\n map,\n merge,\n startWith\n} from \"rxjs\"\n\nimport { getActiveElement } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch element focus\n *\n * Previously, this function used `focus` and `blur` events to determine whether\n * an element is focused, but this doesn't work if there are focusable elements\n * within the elements itself. A better solutions are `focusin` and `focusout`\n * events, which bubble up the tree and allow for more fine-grained control.\n *\n * `debounceTime` is necessary, because when a focus change happens inside an\n * element, the observable would first emit `false` and then `true` again.\n *\n * @param el - Element\n *\n * @returns Element focus observable\n */\nexport function watchElementFocus(\n el: HTMLElement\n): Observable {\n return merge(\n fromEvent(document.body, \"focusin\"),\n fromEvent(document.body, \"focusout\")\n )\n .pipe(\n debounceTime(1),\n map(() => {\n const active = getActiveElement()\n return typeof active !== \"undefined\"\n ? el.contains(active)\n : false\n }),\n startWith(el === getActiveElement()),\n distinctUntilChanged()\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n animationFrameScheduler,\n auditTime,\n fromEvent,\n map,\n merge,\n startWith\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Element offset\n */\nexport interface ElementOffset {\n x: number /* Horizontal offset */\n y: number /* Vertical offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve element offset\n *\n * @param el - Element\n *\n * @returns Element offset\n */\nexport function getElementOffset(\n el: HTMLElement\n): ElementOffset {\n return {\n x: el.offsetLeft,\n y: el.offsetTop\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch element offset\n *\n * @param el - Element\n *\n * @returns Element offset observable\n */\nexport function watchElementOffset(\n el: HTMLElement\n): Observable {\n return merge(\n fromEvent(window, \"load\"),\n fromEvent(window, \"resize\")\n )\n .pipe(\n auditTime(0, animationFrameScheduler),\n map(() => getElementOffset(el)),\n startWith(getElementOffset(el))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n animationFrameScheduler,\n auditTime,\n fromEvent,\n map,\n merge,\n startWith\n} from \"rxjs\"\n\nimport { ElementOffset } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve element content offset (= scroll offset)\n *\n * @param el - Element\n *\n * @returns Element content offset\n */\nexport function getElementContentOffset(\n el: HTMLElement\n): ElementOffset {\n return {\n x: el.scrollLeft,\n y: el.scrollTop\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch element content offset\n *\n * @param el - Element\n *\n * @returns Element content offset observable\n */\nexport function watchElementContentOffset(\n el: HTMLElement\n): Observable {\n return merge(\n fromEvent(el, \"scroll\"),\n fromEvent(window, \"resize\")\n )\n .pipe(\n auditTime(0, animationFrameScheduler),\n map(() => getElementContentOffset(el)),\n startWith(getElementContentOffset(el))\n )\n}\n", "/**\r\n * A collection of shims that provide minimal functionality of the ES6 collections.\r\n *\r\n * These implementations are not meant to be used outside of the ResizeObserver\r\n * modules as they cover only a limited range of use cases.\r\n */\r\n/* eslint-disable require-jsdoc, valid-jsdoc */\r\nvar MapShim = (function () {\r\n if (typeof Map !== 'undefined') {\r\n return Map;\r\n }\r\n /**\r\n * Returns index in provided array that matches the specified key.\r\n *\r\n * @param {Array} arr\r\n * @param {*} key\r\n * @returns {number}\r\n */\r\n function getIndex(arr, key) {\r\n var result = -1;\r\n arr.some(function (entry, index) {\r\n if (entry[0] === key) {\r\n result = index;\r\n return true;\r\n }\r\n return false;\r\n });\r\n return result;\r\n }\r\n return /** @class */ (function () {\r\n function class_1() {\r\n this.__entries__ = [];\r\n }\r\n Object.defineProperty(class_1.prototype, \"size\", {\r\n /**\r\n * @returns {boolean}\r\n */\r\n get: function () {\r\n return this.__entries__.length;\r\n },\r\n enumerable: true,\r\n configurable: true\r\n });\r\n /**\r\n * @param {*} key\r\n * @returns {*}\r\n */\r\n class_1.prototype.get = function (key) {\r\n var index = getIndex(this.__entries__, key);\r\n var entry = this.__entries__[index];\r\n return entry && entry[1];\r\n };\r\n /**\r\n * @param {*} key\r\n * @param {*} value\r\n * @returns {void}\r\n */\r\n class_1.prototype.set = function (key, value) {\r\n var index = getIndex(this.__entries__, key);\r\n if (~index) {\r\n this.__entries__[index][1] = value;\r\n }\r\n else {\r\n this.__entries__.push([key, value]);\r\n }\r\n };\r\n /**\r\n * @param {*} key\r\n * @returns {void}\r\n */\r\n class_1.prototype.delete = function (key) {\r\n var entries = this.__entries__;\r\n var index = getIndex(entries, key);\r\n if (~index) {\r\n entries.splice(index, 1);\r\n }\r\n };\r\n /**\r\n * @param {*} key\r\n * @returns {void}\r\n */\r\n class_1.prototype.has = function (key) {\r\n return !!~getIndex(this.__entries__, key);\r\n };\r\n /**\r\n * @returns {void}\r\n */\r\n class_1.prototype.clear = function () {\r\n this.__entries__.splice(0);\r\n };\r\n /**\r\n * @param {Function} callback\r\n * @param {*} [ctx=null]\r\n * @returns {void}\r\n */\r\n class_1.prototype.forEach = function (callback, ctx) {\r\n if (ctx === void 0) { ctx = null; }\r\n for (var _i = 0, _a = this.__entries__; _i < _a.length; _i++) {\r\n var entry = _a[_i];\r\n callback.call(ctx, entry[1], entry[0]);\r\n }\r\n };\r\n return class_1;\r\n }());\r\n})();\n\n/**\r\n * Detects whether window and document objects are available in current environment.\r\n */\r\nvar isBrowser = typeof window !== 'undefined' && typeof document !== 'undefined' && window.document === document;\n\n// Returns global object of a current environment.\r\nvar global$1 = (function () {\r\n if (typeof global !== 'undefined' && global.Math === Math) {\r\n return global;\r\n }\r\n if (typeof self !== 'undefined' && self.Math === Math) {\r\n return self;\r\n }\r\n if (typeof window !== 'undefined' && window.Math === Math) {\r\n return window;\r\n }\r\n // eslint-disable-next-line no-new-func\r\n return Function('return this')();\r\n})();\n\n/**\r\n * A shim for the requestAnimationFrame which falls back to the setTimeout if\r\n * first one is not supported.\r\n *\r\n * @returns {number} Requests' identifier.\r\n */\r\nvar requestAnimationFrame$1 = (function () {\r\n if (typeof requestAnimationFrame === 'function') {\r\n // It's required to use a bounded function because IE sometimes throws\r\n // an \"Invalid calling object\" error if rAF is invoked without the global\r\n // object on the left hand side.\r\n return requestAnimationFrame.bind(global$1);\r\n }\r\n return function (callback) { return setTimeout(function () { return callback(Date.now()); }, 1000 / 60); };\r\n})();\n\n// Defines minimum timeout before adding a trailing call.\r\nvar trailingTimeout = 2;\r\n/**\r\n * Creates a wrapper function which ensures that provided callback will be\r\n * invoked only once during the specified delay period.\r\n *\r\n * @param {Function} callback - Function to be invoked after the delay period.\r\n * @param {number} delay - Delay after which to invoke callback.\r\n * @returns {Function}\r\n */\r\nfunction throttle (callback, delay) {\r\n var leadingCall = false, trailingCall = false, lastCallTime = 0;\r\n /**\r\n * Invokes the original callback function and schedules new invocation if\r\n * the \"proxy\" was called during current request.\r\n *\r\n * @returns {void}\r\n */\r\n function resolvePending() {\r\n if (leadingCall) {\r\n leadingCall = false;\r\n callback();\r\n }\r\n if (trailingCall) {\r\n proxy();\r\n }\r\n }\r\n /**\r\n * Callback invoked after the specified delay. It will further postpone\r\n * invocation of the original function delegating it to the\r\n * requestAnimationFrame.\r\n *\r\n * @returns {void}\r\n */\r\n function timeoutCallback() {\r\n requestAnimationFrame$1(resolvePending);\r\n }\r\n /**\r\n * Schedules invocation of the original function.\r\n *\r\n * @returns {void}\r\n */\r\n function proxy() {\r\n var timeStamp = Date.now();\r\n if (leadingCall) {\r\n // Reject immediately following calls.\r\n if (timeStamp - lastCallTime < trailingTimeout) {\r\n return;\r\n }\r\n // Schedule new call to be in invoked when the pending one is resolved.\r\n // This is important for \"transitions\" which never actually start\r\n // immediately so there is a chance that we might miss one if change\r\n // happens amids the pending invocation.\r\n trailingCall = true;\r\n }\r\n else {\r\n leadingCall = true;\r\n trailingCall = false;\r\n setTimeout(timeoutCallback, delay);\r\n }\r\n lastCallTime = timeStamp;\r\n }\r\n return proxy;\r\n}\n\n// Minimum delay before invoking the update of observers.\r\nvar REFRESH_DELAY = 20;\r\n// A list of substrings of CSS properties used to find transition events that\r\n// might affect dimensions of observed elements.\r\nvar transitionKeys = ['top', 'right', 'bottom', 'left', 'width', 'height', 'size', 'weight'];\r\n// Check if MutationObserver is available.\r\nvar mutationObserverSupported = typeof MutationObserver !== 'undefined';\r\n/**\r\n * Singleton controller class which handles updates of ResizeObserver instances.\r\n */\r\nvar ResizeObserverController = /** @class */ (function () {\r\n /**\r\n * Creates a new instance of ResizeObserverController.\r\n *\r\n * @private\r\n */\r\n function ResizeObserverController() {\r\n /**\r\n * Indicates whether DOM listeners have been added.\r\n *\r\n * @private {boolean}\r\n */\r\n this.connected_ = false;\r\n /**\r\n * Tells that controller has subscribed for Mutation Events.\r\n *\r\n * @private {boolean}\r\n */\r\n this.mutationEventsAdded_ = false;\r\n /**\r\n * Keeps reference to the instance of MutationObserver.\r\n *\r\n * @private {MutationObserver}\r\n */\r\n this.mutationsObserver_ = null;\r\n /**\r\n * A list of connected observers.\r\n *\r\n * @private {Array}\r\n */\r\n this.observers_ = [];\r\n this.onTransitionEnd_ = this.onTransitionEnd_.bind(this);\r\n this.refresh = throttle(this.refresh.bind(this), REFRESH_DELAY);\r\n }\r\n /**\r\n * Adds observer to observers list.\r\n *\r\n * @param {ResizeObserverSPI} observer - Observer to be added.\r\n * @returns {void}\r\n */\r\n ResizeObserverController.prototype.addObserver = function (observer) {\r\n if (!~this.observers_.indexOf(observer)) {\r\n this.observers_.push(observer);\r\n }\r\n // Add listeners if they haven't been added yet.\r\n if (!this.connected_) {\r\n this.connect_();\r\n }\r\n };\r\n /**\r\n * Removes observer from observers list.\r\n *\r\n * @param {ResizeObserverSPI} observer - Observer to be removed.\r\n * @returns {void}\r\n */\r\n ResizeObserverController.prototype.removeObserver = function (observer) {\r\n var observers = this.observers_;\r\n var index = observers.indexOf(observer);\r\n // Remove observer if it's present in registry.\r\n if (~index) {\r\n observers.splice(index, 1);\r\n }\r\n // Remove listeners if controller has no connected observers.\r\n if (!observers.length && this.connected_) {\r\n this.disconnect_();\r\n }\r\n };\r\n /**\r\n * Invokes the update of observers. It will continue running updates insofar\r\n * it detects changes.\r\n *\r\n * @returns {void}\r\n */\r\n ResizeObserverController.prototype.refresh = function () {\r\n var changesDetected = this.updateObservers_();\r\n // Continue running updates if changes have been detected as there might\r\n // be future ones caused by CSS transitions.\r\n if (changesDetected) {\r\n this.refresh();\r\n }\r\n };\r\n /**\r\n * Updates every observer from observers list and notifies them of queued\r\n * entries.\r\n *\r\n * @private\r\n * @returns {boolean} Returns \"true\" if any observer has detected changes in\r\n * dimensions of it's elements.\r\n */\r\n ResizeObserverController.prototype.updateObservers_ = function () {\r\n // Collect observers that have active observations.\r\n var activeObservers = this.observers_.filter(function (observer) {\r\n return observer.gatherActive(), observer.hasActive();\r\n });\r\n // Deliver notifications in a separate cycle in order to avoid any\r\n // collisions between observers, e.g. when multiple instances of\r\n // ResizeObserver are tracking the same element and the callback of one\r\n // of them changes content dimensions of the observed target. Sometimes\r\n // this may result in notifications being blocked for the rest of observers.\r\n activeObservers.forEach(function (observer) { return observer.broadcastActive(); });\r\n return activeObservers.length > 0;\r\n };\r\n /**\r\n * Initializes DOM listeners.\r\n *\r\n * @private\r\n * @returns {void}\r\n */\r\n ResizeObserverController.prototype.connect_ = function () {\r\n // Do nothing if running in a non-browser environment or if listeners\r\n // have been already added.\r\n if (!isBrowser || this.connected_) {\r\n return;\r\n }\r\n // Subscription to the \"Transitionend\" event is used as a workaround for\r\n // delayed transitions. This way it's possible to capture at least the\r\n // final state of an element.\r\n document.addEventListener('transitionend', this.onTransitionEnd_);\r\n window.addEventListener('resize', this.refresh);\r\n if (mutationObserverSupported) {\r\n this.mutationsObserver_ = new MutationObserver(this.refresh);\r\n this.mutationsObserver_.observe(document, {\r\n attributes: true,\r\n childList: true,\r\n characterData: true,\r\n subtree: true\r\n });\r\n }\r\n else {\r\n document.addEventListener('DOMSubtreeModified', this.refresh);\r\n this.mutationEventsAdded_ = true;\r\n }\r\n this.connected_ = true;\r\n };\r\n /**\r\n * Removes DOM listeners.\r\n *\r\n * @private\r\n * @returns {void}\r\n */\r\n ResizeObserverController.prototype.disconnect_ = function () {\r\n // Do nothing if running in a non-browser environment or if listeners\r\n // have been already removed.\r\n if (!isBrowser || !this.connected_) {\r\n return;\r\n }\r\n document.removeEventListener('transitionend', this.onTransitionEnd_);\r\n window.removeEventListener('resize', this.refresh);\r\n if (this.mutationsObserver_) {\r\n this.mutationsObserver_.disconnect();\r\n }\r\n if (this.mutationEventsAdded_) {\r\n document.removeEventListener('DOMSubtreeModified', this.refresh);\r\n }\r\n this.mutationsObserver_ = null;\r\n this.mutationEventsAdded_ = false;\r\n this.connected_ = false;\r\n };\r\n /**\r\n * \"Transitionend\" event handler.\r\n *\r\n * @private\r\n * @param {TransitionEvent} event\r\n * @returns {void}\r\n */\r\n ResizeObserverController.prototype.onTransitionEnd_ = function (_a) {\r\n var _b = _a.propertyName, propertyName = _b === void 0 ? '' : _b;\r\n // Detect whether transition may affect dimensions of an element.\r\n var isReflowProperty = transitionKeys.some(function (key) {\r\n return !!~propertyName.indexOf(key);\r\n });\r\n if (isReflowProperty) {\r\n this.refresh();\r\n }\r\n };\r\n /**\r\n * Returns instance of the ResizeObserverController.\r\n *\r\n * @returns {ResizeObserverController}\r\n */\r\n ResizeObserverController.getInstance = function () {\r\n if (!this.instance_) {\r\n this.instance_ = new ResizeObserverController();\r\n }\r\n return this.instance_;\r\n };\r\n /**\r\n * Holds reference to the controller's instance.\r\n *\r\n * @private {ResizeObserverController}\r\n */\r\n ResizeObserverController.instance_ = null;\r\n return ResizeObserverController;\r\n}());\n\n/**\r\n * Defines non-writable/enumerable properties of the provided target object.\r\n *\r\n * @param {Object} target - Object for which to define properties.\r\n * @param {Object} props - Properties to be defined.\r\n * @returns {Object} Target object.\r\n */\r\nvar defineConfigurable = (function (target, props) {\r\n for (var _i = 0, _a = Object.keys(props); _i < _a.length; _i++) {\r\n var key = _a[_i];\r\n Object.defineProperty(target, key, {\r\n value: props[key],\r\n enumerable: false,\r\n writable: false,\r\n configurable: true\r\n });\r\n }\r\n return target;\r\n});\n\n/**\r\n * Returns the global object associated with provided element.\r\n *\r\n * @param {Object} target\r\n * @returns {Object}\r\n */\r\nvar getWindowOf = (function (target) {\r\n // Assume that the element is an instance of Node, which means that it\r\n // has the \"ownerDocument\" property from which we can retrieve a\r\n // corresponding global object.\r\n var ownerGlobal = target && target.ownerDocument && target.ownerDocument.defaultView;\r\n // Return the local global object if it's not possible extract one from\r\n // provided element.\r\n return ownerGlobal || global$1;\r\n});\n\n// Placeholder of an empty content rectangle.\r\nvar emptyRect = createRectInit(0, 0, 0, 0);\r\n/**\r\n * Converts provided string to a number.\r\n *\r\n * @param {number|string} value\r\n * @returns {number}\r\n */\r\nfunction toFloat(value) {\r\n return parseFloat(value) || 0;\r\n}\r\n/**\r\n * Extracts borders size from provided styles.\r\n *\r\n * @param {CSSStyleDeclaration} styles\r\n * @param {...string} positions - Borders positions (top, right, ...)\r\n * @returns {number}\r\n */\r\nfunction getBordersSize(styles) {\r\n var positions = [];\r\n for (var _i = 1; _i < arguments.length; _i++) {\r\n positions[_i - 1] = arguments[_i];\r\n }\r\n return positions.reduce(function (size, position) {\r\n var value = styles['border-' + position + '-width'];\r\n return size + toFloat(value);\r\n }, 0);\r\n}\r\n/**\r\n * Extracts paddings sizes from provided styles.\r\n *\r\n * @param {CSSStyleDeclaration} styles\r\n * @returns {Object} Paddings box.\r\n */\r\nfunction getPaddings(styles) {\r\n var positions = ['top', 'right', 'bottom', 'left'];\r\n var paddings = {};\r\n for (var _i = 0, positions_1 = positions; _i < positions_1.length; _i++) {\r\n var position = positions_1[_i];\r\n var value = styles['padding-' + position];\r\n paddings[position] = toFloat(value);\r\n }\r\n return paddings;\r\n}\r\n/**\r\n * Calculates content rectangle of provided SVG element.\r\n *\r\n * @param {SVGGraphicsElement} target - Element content rectangle of which needs\r\n * to be calculated.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction getSVGContentRect(target) {\r\n var bbox = target.getBBox();\r\n return createRectInit(0, 0, bbox.width, bbox.height);\r\n}\r\n/**\r\n * Calculates content rectangle of provided HTMLElement.\r\n *\r\n * @param {HTMLElement} target - Element for which to calculate the content rectangle.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction getHTMLElementContentRect(target) {\r\n // Client width & height properties can't be\r\n // used exclusively as they provide rounded values.\r\n var clientWidth = target.clientWidth, clientHeight = target.clientHeight;\r\n // By this condition we can catch all non-replaced inline, hidden and\r\n // detached elements. Though elements with width & height properties less\r\n // than 0.5 will be discarded as well.\r\n //\r\n // Without it we would need to implement separate methods for each of\r\n // those cases and it's not possible to perform a precise and performance\r\n // effective test for hidden elements. E.g. even jQuery's ':visible' filter\r\n // gives wrong results for elements with width & height less than 0.5.\r\n if (!clientWidth && !clientHeight) {\r\n return emptyRect;\r\n }\r\n var styles = getWindowOf(target).getComputedStyle(target);\r\n var paddings = getPaddings(styles);\r\n var horizPad = paddings.left + paddings.right;\r\n var vertPad = paddings.top + paddings.bottom;\r\n // Computed styles of width & height are being used because they are the\r\n // only dimensions available to JS that contain non-rounded values. It could\r\n // be possible to utilize the getBoundingClientRect if only it's data wasn't\r\n // affected by CSS transformations let alone paddings, borders and scroll bars.\r\n var width = toFloat(styles.width), height = toFloat(styles.height);\r\n // Width & height include paddings and borders when the 'border-box' box\r\n // model is applied (except for IE).\r\n if (styles.boxSizing === 'border-box') {\r\n // Following conditions are required to handle Internet Explorer which\r\n // doesn't include paddings and borders to computed CSS dimensions.\r\n //\r\n // We can say that if CSS dimensions + paddings are equal to the \"client\"\r\n // properties then it's either IE, and thus we don't need to subtract\r\n // anything, or an element merely doesn't have paddings/borders styles.\r\n if (Math.round(width + horizPad) !== clientWidth) {\r\n width -= getBordersSize(styles, 'left', 'right') + horizPad;\r\n }\r\n if (Math.round(height + vertPad) !== clientHeight) {\r\n height -= getBordersSize(styles, 'top', 'bottom') + vertPad;\r\n }\r\n }\r\n // Following steps can't be applied to the document's root element as its\r\n // client[Width/Height] properties represent viewport area of the window.\r\n // Besides, it's as well not necessary as the itself neither has\r\n // rendered scroll bars nor it can be clipped.\r\n if (!isDocumentElement(target)) {\r\n // In some browsers (only in Firefox, actually) CSS width & height\r\n // include scroll bars size which can be removed at this step as scroll\r\n // bars are the only difference between rounded dimensions + paddings\r\n // and \"client\" properties, though that is not always true in Chrome.\r\n var vertScrollbar = Math.round(width + horizPad) - clientWidth;\r\n var horizScrollbar = Math.round(height + vertPad) - clientHeight;\r\n // Chrome has a rather weird rounding of \"client\" properties.\r\n // E.g. for an element with content width of 314.2px it sometimes gives\r\n // the client width of 315px and for the width of 314.7px it may give\r\n // 314px. And it doesn't happen all the time. So just ignore this delta\r\n // as a non-relevant.\r\n if (Math.abs(vertScrollbar) !== 1) {\r\n width -= vertScrollbar;\r\n }\r\n if (Math.abs(horizScrollbar) !== 1) {\r\n height -= horizScrollbar;\r\n }\r\n }\r\n return createRectInit(paddings.left, paddings.top, width, height);\r\n}\r\n/**\r\n * Checks whether provided element is an instance of the SVGGraphicsElement.\r\n *\r\n * @param {Element} target - Element to be checked.\r\n * @returns {boolean}\r\n */\r\nvar isSVGGraphicsElement = (function () {\r\n // Some browsers, namely IE and Edge, don't have the SVGGraphicsElement\r\n // interface.\r\n if (typeof SVGGraphicsElement !== 'undefined') {\r\n return function (target) { return target instanceof getWindowOf(target).SVGGraphicsElement; };\r\n }\r\n // If it's so, then check that element is at least an instance of the\r\n // SVGElement and that it has the \"getBBox\" method.\r\n // eslint-disable-next-line no-extra-parens\r\n return function (target) { return (target instanceof getWindowOf(target).SVGElement &&\r\n typeof target.getBBox === 'function'); };\r\n})();\r\n/**\r\n * Checks whether provided element is a document element ().\r\n *\r\n * @param {Element} target - Element to be checked.\r\n * @returns {boolean}\r\n */\r\nfunction isDocumentElement(target) {\r\n return target === getWindowOf(target).document.documentElement;\r\n}\r\n/**\r\n * Calculates an appropriate content rectangle for provided html or svg element.\r\n *\r\n * @param {Element} target - Element content rectangle of which needs to be calculated.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction getContentRect(target) {\r\n if (!isBrowser) {\r\n return emptyRect;\r\n }\r\n if (isSVGGraphicsElement(target)) {\r\n return getSVGContentRect(target);\r\n }\r\n return getHTMLElementContentRect(target);\r\n}\r\n/**\r\n * Creates rectangle with an interface of the DOMRectReadOnly.\r\n * Spec: https://drafts.fxtf.org/geometry/#domrectreadonly\r\n *\r\n * @param {DOMRectInit} rectInit - Object with rectangle's x/y coordinates and dimensions.\r\n * @returns {DOMRectReadOnly}\r\n */\r\nfunction createReadOnlyRect(_a) {\r\n var x = _a.x, y = _a.y, width = _a.width, height = _a.height;\r\n // If DOMRectReadOnly is available use it as a prototype for the rectangle.\r\n var Constr = typeof DOMRectReadOnly !== 'undefined' ? DOMRectReadOnly : Object;\r\n var rect = Object.create(Constr.prototype);\r\n // Rectangle's properties are not writable and non-enumerable.\r\n defineConfigurable(rect, {\r\n x: x, y: y, width: width, height: height,\r\n top: y,\r\n right: x + width,\r\n bottom: height + y,\r\n left: x\r\n });\r\n return rect;\r\n}\r\n/**\r\n * Creates DOMRectInit object based on the provided dimensions and the x/y coordinates.\r\n * Spec: https://drafts.fxtf.org/geometry/#dictdef-domrectinit\r\n *\r\n * @param {number} x - X coordinate.\r\n * @param {number} y - Y coordinate.\r\n * @param {number} width - Rectangle's width.\r\n * @param {number} height - Rectangle's height.\r\n * @returns {DOMRectInit}\r\n */\r\nfunction createRectInit(x, y, width, height) {\r\n return { x: x, y: y, width: width, height: height };\r\n}\n\n/**\r\n * Class that is responsible for computations of the content rectangle of\r\n * provided DOM element and for keeping track of it's changes.\r\n */\r\nvar ResizeObservation = /** @class */ (function () {\r\n /**\r\n * Creates an instance of ResizeObservation.\r\n *\r\n * @param {Element} target - Element to be observed.\r\n */\r\n function ResizeObservation(target) {\r\n /**\r\n * Broadcasted width of content rectangle.\r\n *\r\n * @type {number}\r\n */\r\n this.broadcastWidth = 0;\r\n /**\r\n * Broadcasted height of content rectangle.\r\n *\r\n * @type {number}\r\n */\r\n this.broadcastHeight = 0;\r\n /**\r\n * Reference to the last observed content rectangle.\r\n *\r\n * @private {DOMRectInit}\r\n */\r\n this.contentRect_ = createRectInit(0, 0, 0, 0);\r\n this.target = target;\r\n }\r\n /**\r\n * Updates content rectangle and tells whether it's width or height properties\r\n * have changed since the last broadcast.\r\n *\r\n * @returns {boolean}\r\n */\r\n ResizeObservation.prototype.isActive = function () {\r\n var rect = getContentRect(this.target);\r\n this.contentRect_ = rect;\r\n return (rect.width !== this.broadcastWidth ||\r\n rect.height !== this.broadcastHeight);\r\n };\r\n /**\r\n * Updates 'broadcastWidth' and 'broadcastHeight' properties with a data\r\n * from the corresponding properties of the last observed content rectangle.\r\n *\r\n * @returns {DOMRectInit} Last observed content rectangle.\r\n */\r\n ResizeObservation.prototype.broadcastRect = function () {\r\n var rect = this.contentRect_;\r\n this.broadcastWidth = rect.width;\r\n this.broadcastHeight = rect.height;\r\n return rect;\r\n };\r\n return ResizeObservation;\r\n}());\n\nvar ResizeObserverEntry = /** @class */ (function () {\r\n /**\r\n * Creates an instance of ResizeObserverEntry.\r\n *\r\n * @param {Element} target - Element that is being observed.\r\n * @param {DOMRectInit} rectInit - Data of the element's content rectangle.\r\n */\r\n function ResizeObserverEntry(target, rectInit) {\r\n var contentRect = createReadOnlyRect(rectInit);\r\n // According to the specification following properties are not writable\r\n // and are also not enumerable in the native implementation.\r\n //\r\n // Property accessors are not being used as they'd require to define a\r\n // private WeakMap storage which may cause memory leaks in browsers that\r\n // don't support this type of collections.\r\n defineConfigurable(this, { target: target, contentRect: contentRect });\r\n }\r\n return ResizeObserverEntry;\r\n}());\n\nvar ResizeObserverSPI = /** @class */ (function () {\r\n /**\r\n * Creates a new instance of ResizeObserver.\r\n *\r\n * @param {ResizeObserverCallback} callback - Callback function that is invoked\r\n * when one of the observed elements changes it's content dimensions.\r\n * @param {ResizeObserverController} controller - Controller instance which\r\n * is responsible for the updates of observer.\r\n * @param {ResizeObserver} callbackCtx - Reference to the public\r\n * ResizeObserver instance which will be passed to callback function.\r\n */\r\n function ResizeObserverSPI(callback, controller, callbackCtx) {\r\n /**\r\n * Collection of resize observations that have detected changes in dimensions\r\n * of elements.\r\n *\r\n * @private {Array}\r\n */\r\n this.activeObservations_ = [];\r\n /**\r\n * Registry of the ResizeObservation instances.\r\n *\r\n * @private {Map}\r\n */\r\n this.observations_ = new MapShim();\r\n if (typeof callback !== 'function') {\r\n throw new TypeError('The callback provided as parameter 1 is not a function.');\r\n }\r\n this.callback_ = callback;\r\n this.controller_ = controller;\r\n this.callbackCtx_ = callbackCtx;\r\n }\r\n /**\r\n * Starts observing provided element.\r\n *\r\n * @param {Element} target - Element to be observed.\r\n * @returns {void}\r\n */\r\n ResizeObserverSPI.prototype.observe = function (target) {\r\n if (!arguments.length) {\r\n throw new TypeError('1 argument required, but only 0 present.');\r\n }\r\n // Do nothing if current environment doesn't have the Element interface.\r\n if (typeof Element === 'undefined' || !(Element instanceof Object)) {\r\n return;\r\n }\r\n if (!(target instanceof getWindowOf(target).Element)) {\r\n throw new TypeError('parameter 1 is not of type \"Element\".');\r\n }\r\n var observations = this.observations_;\r\n // Do nothing if element is already being observed.\r\n if (observations.has(target)) {\r\n return;\r\n }\r\n observations.set(target, new ResizeObservation(target));\r\n this.controller_.addObserver(this);\r\n // Force the update of observations.\r\n this.controller_.refresh();\r\n };\r\n /**\r\n * Stops observing provided element.\r\n *\r\n * @param {Element} target - Element to stop observing.\r\n * @returns {void}\r\n */\r\n ResizeObserverSPI.prototype.unobserve = function (target) {\r\n if (!arguments.length) {\r\n throw new TypeError('1 argument required, but only 0 present.');\r\n }\r\n // Do nothing if current environment doesn't have the Element interface.\r\n if (typeof Element === 'undefined' || !(Element instanceof Object)) {\r\n return;\r\n }\r\n if (!(target instanceof getWindowOf(target).Element)) {\r\n throw new TypeError('parameter 1 is not of type \"Element\".');\r\n }\r\n var observations = this.observations_;\r\n // Do nothing if element is not being observed.\r\n if (!observations.has(target)) {\r\n return;\r\n }\r\n observations.delete(target);\r\n if (!observations.size) {\r\n this.controller_.removeObserver(this);\r\n }\r\n };\r\n /**\r\n * Stops observing all elements.\r\n *\r\n * @returns {void}\r\n */\r\n ResizeObserverSPI.prototype.disconnect = function () {\r\n this.clearActive();\r\n this.observations_.clear();\r\n this.controller_.removeObserver(this);\r\n };\r\n /**\r\n * Collects observation instances the associated element of which has changed\r\n * it's content rectangle.\r\n *\r\n * @returns {void}\r\n */\r\n ResizeObserverSPI.prototype.gatherActive = function () {\r\n var _this = this;\r\n this.clearActive();\r\n this.observations_.forEach(function (observation) {\r\n if (observation.isActive()) {\r\n _this.activeObservations_.push(observation);\r\n }\r\n });\r\n };\r\n /**\r\n * Invokes initial callback function with a list of ResizeObserverEntry\r\n * instances collected from active resize observations.\r\n *\r\n * @returns {void}\r\n */\r\n ResizeObserverSPI.prototype.broadcastActive = function () {\r\n // Do nothing if observer doesn't have active observations.\r\n if (!this.hasActive()) {\r\n return;\r\n }\r\n var ctx = this.callbackCtx_;\r\n // Create ResizeObserverEntry instance for every active observation.\r\n var entries = this.activeObservations_.map(function (observation) {\r\n return new ResizeObserverEntry(observation.target, observation.broadcastRect());\r\n });\r\n this.callback_.call(ctx, entries, ctx);\r\n this.clearActive();\r\n };\r\n /**\r\n * Clears the collection of active observations.\r\n *\r\n * @returns {void}\r\n */\r\n ResizeObserverSPI.prototype.clearActive = function () {\r\n this.activeObservations_.splice(0);\r\n };\r\n /**\r\n * Tells whether observer has active observations.\r\n *\r\n * @returns {boolean}\r\n */\r\n ResizeObserverSPI.prototype.hasActive = function () {\r\n return this.activeObservations_.length > 0;\r\n };\r\n return ResizeObserverSPI;\r\n}());\n\n// Registry of internal observers. If WeakMap is not available use current shim\r\n// for the Map collection as it has all required methods and because WeakMap\r\n// can't be fully polyfilled anyway.\r\nvar observers = typeof WeakMap !== 'undefined' ? new WeakMap() : new MapShim();\r\n/**\r\n * ResizeObserver API. Encapsulates the ResizeObserver SPI implementation\r\n * exposing only those methods and properties that are defined in the spec.\r\n */\r\nvar ResizeObserver = /** @class */ (function () {\r\n /**\r\n * Creates a new instance of ResizeObserver.\r\n *\r\n * @param {ResizeObserverCallback} callback - Callback that is invoked when\r\n * dimensions of the observed elements change.\r\n */\r\n function ResizeObserver(callback) {\r\n if (!(this instanceof ResizeObserver)) {\r\n throw new TypeError('Cannot call a class as a function.');\r\n }\r\n if (!arguments.length) {\r\n throw new TypeError('1 argument required, but only 0 present.');\r\n }\r\n var controller = ResizeObserverController.getInstance();\r\n var observer = new ResizeObserverSPI(callback, controller, this);\r\n observers.set(this, observer);\r\n }\r\n return ResizeObserver;\r\n}());\r\n// Expose public methods of ResizeObserver.\r\n[\r\n 'observe',\r\n 'unobserve',\r\n 'disconnect'\r\n].forEach(function (method) {\r\n ResizeObserver.prototype[method] = function () {\r\n var _a;\r\n return (_a = observers.get(this))[method].apply(_a, arguments);\r\n };\r\n});\n\nvar index = (function () {\r\n // Export existing implementation if available.\r\n if (typeof global$1.ResizeObserver !== 'undefined') {\r\n return global$1.ResizeObserver;\r\n }\r\n return ResizeObserver;\r\n})();\n\nexport default index;\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport ResizeObserver from \"resize-observer-polyfill\"\nimport {\n NEVER,\n Observable,\n Subject,\n defer,\n filter,\n finalize,\n map,\n merge,\n of,\n shareReplay,\n startWith,\n switchMap,\n tap\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Element offset\n */\nexport interface ElementSize {\n width: number /* Element width */\n height: number /* Element height */\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Resize observer entry subject\n */\nconst entry$ = new Subject()\n\n/**\n * Resize observer observable\n *\n * This observable will create a `ResizeObserver` on the first subscription\n * and will automatically terminate it when there are no more subscribers.\n * It's quite important to centralize observation in a single `ResizeObserver`,\n * as the performance difference can be quite dramatic, as the link shows.\n *\n * @see https://bit.ly/3iIYfEm - Google Groups on performance\n */\nconst observer$ = defer(() => of(\n new ResizeObserver(entries => {\n for (const entry of entries)\n entry$.next(entry)\n })\n))\n .pipe(\n switchMap(observer => merge(NEVER, of(observer))\n .pipe(\n finalize(() => observer.disconnect())\n )\n ),\n shareReplay(1)\n )\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve element size\n *\n * @param el - Element\n *\n * @returns Element size\n */\nexport function getElementSize(\n el: HTMLElement\n): ElementSize {\n return {\n width: el.offsetWidth,\n height: el.offsetHeight\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch element size\n *\n * This function returns an observable that subscribes to a single internal\n * instance of `ResizeObserver` upon subscription, and emit resize events until\n * termination. Note that this function should not be called with the same\n * element twice, as the first unsubscription will terminate observation.\n *\n * Sadly, we can't use the `DOMRect` objects returned by the observer, because\n * we need the emitted values to be consistent with `getElementSize`, which will\n * return the used values (rounded) and not actual values (unrounded). Thus, we\n * use the `offset*` properties. See the linked GitHub issue.\n *\n * @see https://bit.ly/3m0k3he - GitHub issue\n *\n * @param el - Element\n *\n * @returns Element size observable\n */\nexport function watchElementSize(\n el: HTMLElement\n): Observable {\n return observer$\n .pipe(\n tap(observer => observer.observe(el)),\n switchMap(observer => entry$\n .pipe(\n filter(({ target }) => target === el),\n finalize(() => observer.unobserve(el)),\n map(() => getElementSize(el))\n )\n ),\n startWith(getElementSize(el))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { ElementSize } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve element content size (= scroll width and height)\n *\n * @param el - Element\n *\n * @returns Element content size\n */\nexport function getElementContentSize(\n el: HTMLElement\n): ElementSize {\n return {\n width: el.scrollWidth,\n height: el.scrollHeight\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n NEVER,\n Observable,\n Subject,\n defer,\n distinctUntilChanged,\n filter,\n finalize,\n map,\n merge,\n of,\n shareReplay,\n switchMap,\n tap\n} from \"rxjs\"\n\nimport {\n getElementContentSize,\n getElementSize,\n watchElementContentOffset\n} from \"~/browser\"\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Intersection observer entry subject\n */\nconst entry$ = new Subject()\n\n/**\n * Intersection observer observable\n *\n * This observable will create an `IntersectionObserver` on first subscription\n * and will automatically terminate it when there are no more subscribers.\n *\n * @see https://bit.ly/3iIYfEm - Google Groups on performance\n */\nconst observer$ = defer(() => of(\n new IntersectionObserver(entries => {\n for (const entry of entries)\n entry$.next(entry)\n }, {\n threshold: 1\n })\n))\n .pipe(\n switchMap(observer => merge(NEVER, of(observer))\n .pipe(\n finalize(() => observer.disconnect())\n )\n ),\n shareReplay(1)\n )\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch element visibility\n *\n * @param el - Element\n *\n * @returns Element visibility observable\n */\nexport function watchElementVisibility(\n el: HTMLElement\n): Observable {\n return observer$\n .pipe(\n tap(observer => observer.observe(el)),\n switchMap(observer => entry$\n .pipe(\n filter(({ target }) => target === el),\n finalize(() => observer.unobserve(el)),\n map(({ isIntersecting }) => isIntersecting)\n )\n )\n )\n}\n\n/**\n * Watch element boundary\n *\n * This function returns an observable which emits whether the bottom content\n * boundary (= scroll offset) of an element is within a certain threshold.\n *\n * @param el - Element\n * @param threshold - Threshold\n *\n * @returns Element boundary observable\n */\nexport function watchElementBoundary(\n el: HTMLElement, threshold = 16\n): Observable {\n return watchElementContentOffset(el)\n .pipe(\n map(({ y }) => {\n const visible = getElementSize(el)\n const content = getElementContentSize(el)\n return y >= (\n content.height - visible.height - threshold\n )\n }),\n distinctUntilChanged()\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n fromEvent,\n map,\n startWith\n} from \"rxjs\"\n\nimport { getElement } from \"../element\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Toggle\n */\nexport type Toggle =\n | \"drawer\" /* Toggle for drawer */\n | \"search\" /* Toggle for search */\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Toggle map\n */\nconst toggles: Record = {\n drawer: getElement(\"[data-md-toggle=drawer]\"),\n search: getElement(\"[data-md-toggle=search]\")\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve the value of a toggle\n *\n * @param name - Toggle\n *\n * @returns Toggle value\n */\nexport function getToggle(name: Toggle): boolean {\n return toggles[name].checked\n}\n\n/**\n * Set toggle\n *\n * Simulating a click event seems to be the most cross-browser compatible way\n * of changing the value while also emitting a `change` event. Before, Material\n * used `CustomEvent` to programmatically change the value of a toggle, but this\n * is a much simpler and cleaner solution which doesn't require a polyfill.\n *\n * @param name - Toggle\n * @param value - Toggle value\n */\nexport function setToggle(name: Toggle, value: boolean): void {\n if (toggles[name].checked !== value)\n toggles[name].click()\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch toggle\n *\n * @param name - Toggle\n *\n * @returns Toggle value observable\n */\nexport function watchToggle(name: Toggle): Observable {\n const el = toggles[name]\n return fromEvent(el, \"change\")\n .pipe(\n map(() => el.checked),\n startWith(el.checked)\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n filter,\n fromEvent,\n map,\n share\n} from \"rxjs\"\n\nimport { getActiveElement } from \"../element\"\nimport { getToggle } from \"../toggle\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Keyboard mode\n */\nexport type KeyboardMode =\n | \"global\" /* Global */\n | \"search\" /* Search is open */\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Keyboard\n */\nexport interface Keyboard {\n mode: KeyboardMode /* Keyboard mode */\n type: string /* Key type */\n claim(): void /* Key claim */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Check whether an element may receive keyboard input\n *\n * @param el - Element\n * @param type - Key type\n *\n * @returns Test result\n */\nfunction isSusceptibleToKeyboard(\n el: HTMLElement, type: string\n): boolean {\n switch (el.constructor) {\n\n /* Input elements */\n case HTMLInputElement:\n /* @ts-expect-error - omit unnecessary type cast */\n if (el.type === \"radio\")\n return /^Arrow/.test(type)\n else\n return true\n\n /* Select element and textarea */\n case HTMLSelectElement:\n case HTMLTextAreaElement:\n return true\n\n /* Everything else */\n default:\n return el.isContentEditable\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch keyboard\n *\n * @returns Keyboard observable\n */\nexport function watchKeyboard(): Observable {\n return fromEvent(window, \"keydown\")\n .pipe(\n filter(ev => !(ev.metaKey || ev.ctrlKey)),\n map(ev => ({\n mode: getToggle(\"search\") ? \"search\" : \"global\",\n type: ev.key,\n claim() {\n ev.preventDefault()\n ev.stopPropagation()\n }\n } as Keyboard)),\n filter(({ mode, type }) => {\n if (mode === \"global\") {\n const active = getActiveElement()\n if (typeof active !== \"undefined\")\n return !isSusceptibleToKeyboard(active, type)\n }\n return true\n }),\n share()\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Subject } from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve location\n *\n * This function returns a `URL` object (and not `Location`) to normalize the\n * typings across the application. Furthermore, locations need to be tracked\n * without setting them and `Location` is a singleton which represents the\n * current location.\n *\n * @returns URL\n */\nexport function getLocation(): URL {\n return new URL(location.href)\n}\n\n/**\n * Set location\n *\n * @param url - URL to change to\n */\nexport function setLocation(url: URL): void {\n location.href = url.href\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch location\n *\n * @returns Location subject\n */\nexport function watchLocation(): Subject {\n return new Subject()\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { JSX as JSXInternal } from \"preact\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * HTML attributes\n */\ntype Attributes =\n & JSXInternal.HTMLAttributes\n & JSXInternal.SVGAttributes\n & Record\n\n/**\n * Child element\n */\ntype Child =\n | HTMLElement\n | Text\n | string\n | number\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Append a child node to an element\n *\n * @param el - Element\n * @param child - Child node(s)\n */\nfunction appendChild(el: HTMLElement, child: Child | Child[]): void {\n\n /* Handle primitive types (including raw HTML) */\n if (typeof child === \"string\" || typeof child === \"number\") {\n el.innerHTML += child.toString()\n\n /* Handle nodes */\n } else if (child instanceof Node) {\n el.appendChild(child)\n\n /* Handle nested children */\n } else if (Array.isArray(child)) {\n for (const node of child)\n appendChild(el, node)\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * JSX factory\n *\n * @template T - Element type\n *\n * @param tag - HTML tag\n * @param attributes - HTML attributes\n * @param children - Child elements\n *\n * @returns Element\n */\nexport function h(\n tag: T, attributes?: Attributes | null, ...children: Child[]\n): HTMLElementTagNameMap[T]\n\nexport function h(\n tag: string, attributes?: Attributes | null, ...children: Child[]\n): T\n\nexport function h(\n tag: string, attributes?: Attributes | null, ...children: Child[]\n): T {\n const el = document.createElement(tag)\n\n /* Set attributes, if any */\n if (attributes)\n for (const attr of Object.keys(attributes))\n if (typeof attributes[attr] !== \"boolean\")\n el.setAttribute(attr, attributes[attr])\n else if (attributes[attr])\n el.setAttribute(attr, \"\")\n\n /* Append child nodes */\n for (const child of children)\n appendChild(el, child)\n\n /* Return element */\n return el as T\n}\n\n/* ----------------------------------------------------------------------------\n * Namespace\n * ------------------------------------------------------------------------- */\n\nexport declare namespace h {\n namespace JSX {\n type Element = HTMLElement\n type IntrinsicElements = JSXInternal.IntrinsicElements\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Truncate a string after the given number of characters\n *\n * This is not a very reasonable approach, since the summaries kind of suck.\n * It would be better to create something more intelligent, highlighting the\n * search occurrences and making a better summary out of it, but this note was\n * written three years ago, so who knows if we'll ever fix it.\n *\n * @param value - Value to be truncated\n * @param n - Number of characters\n *\n * @returns Truncated value\n */\nexport function truncate(value: string, n: number): string {\n let i = n\n if (value.length > i) {\n while (value[i] !== \" \" && --i > 0) { /* keep eating */ }\n return `${value.substring(0, i)}...`\n }\n return value\n}\n\n/**\n * Round a number for display with repository facts\n *\n * This is a reverse-engineered version of GitHub's weird rounding algorithm\n * for stars, forks and all other numbers. While all numbers below `1,000` are\n * returned as-is, bigger numbers are converted to fixed numbers:\n *\n * - `1,049` => `1k`\n * - `1,050` => `1.1k`\n * - `1,949` => `1.9k`\n * - `1,950` => `2k`\n *\n * @param value - Original value\n *\n * @returns Rounded value\n */\nexport function round(value: number): string {\n if (value > 999) {\n const digits = +((value - 950) % 1000 > 99)\n return `${((value + 0.000001) / 1000).toFixed(digits)}k`\n } else {\n return value.toString()\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n filter,\n fromEvent,\n map,\n shareReplay,\n startWith\n} from \"rxjs\"\n\nimport { getOptionalElement } from \"~/browser\"\nimport { h } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve location hash\n *\n * @returns Location hash\n */\nexport function getLocationHash(): string {\n return location.hash.substring(1)\n}\n\n/**\n * Set location hash\n *\n * Setting a new fragment identifier via `location.hash` will have no effect\n * if the value doesn't change. When a new fragment identifier is set, we want\n * the browser to target the respective element at all times, which is why we\n * use this dirty little trick.\n *\n * @param hash - Location hash\n */\nexport function setLocationHash(hash: string): void {\n const el = h(\"a\", { href: hash })\n el.addEventListener(\"click\", ev => ev.stopPropagation())\n el.click()\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch location hash\n *\n * @returns Location hash observable\n */\nexport function watchLocationHash(): Observable {\n return fromEvent(window, \"hashchange\")\n .pipe(\n map(getLocationHash),\n startWith(getLocationHash()),\n filter(hash => hash.length > 0),\n shareReplay(1)\n )\n}\n\n/**\n * Watch location target\n *\n * @returns Location target observable\n */\nexport function watchLocationTarget(): Observable {\n return watchLocationHash()\n .pipe(\n map(id => getOptionalElement(`[id=\"${id}\"]`)!),\n filter(el => typeof el !== \"undefined\")\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n fromEvent,\n fromEventPattern,\n mapTo,\n merge,\n startWith,\n switchMap\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch media query\n *\n * Note that although `MediaQueryList.addListener` is deprecated we have to\n * use it, because it's the only way to ensure proper downward compatibility.\n *\n * @see https://bit.ly/3dUBH2m - GitHub issue\n *\n * @param query - Media query\n *\n * @returns Media observable\n */\nexport function watchMedia(query: string): Observable {\n const media = matchMedia(query)\n return fromEventPattern(next => (\n media.addListener(() => next(media.matches))\n ))\n .pipe(\n startWith(media.matches)\n )\n}\n\n/**\n * Watch print mode\n *\n * @returns Print observable\n */\nexport function watchPrint(): Observable {\n const media = matchMedia(\"print\")\n return merge(\n fromEvent(window, \"beforeprint\").pipe(mapTo(true)),\n fromEvent(window, \"afterprint\").pipe(mapTo(false))\n )\n .pipe(\n startWith(media.matches)\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Toggle an observable with a media observable\n *\n * @template T - Data type\n *\n * @param query$ - Media observable\n * @param factory - Observable factory\n *\n * @returns Toggled observable\n */\nexport function at(\n query$: Observable, factory: () => Observable\n): Observable {\n return query$\n .pipe(\n switchMap(active => active ? factory() : EMPTY)\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n catchError,\n filter,\n from,\n map,\n shareReplay,\n switchMap\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Fetch the given URL\n *\n * If the request fails (e.g. when dispatched from `file://` locations), the\n * observable will complete without emitting a value.\n *\n * @param url - Request URL\n * @param options - Options\n *\n * @returns Response observable\n */\nexport function request(\n url: URL | string, options: RequestInit = { credentials: \"same-origin\" }\n): Observable {\n return from(fetch(`${url}`, options))\n .pipe(\n filter(res => res.status === 200),\n catchError(() => EMPTY)\n )\n}\n\n/**\n * Fetch JSON from the given URL\n *\n * @template T - Data type\n *\n * @param url - Request URL\n * @param options - Options\n *\n * @returns Data observable\n */\nexport function requestJSON(\n url: URL | string, options?: RequestInit\n): Observable {\n return request(url, options)\n .pipe(\n switchMap(res => res.json()),\n shareReplay(1)\n )\n}\n\n/**\n * Fetch XML from the given URL\n *\n * @param url - Request URL\n * @param options - Options\n *\n * @returns Data observable\n */\nexport function requestXML(\n url: URL | string, options?: RequestInit\n): Observable {\n const dom = new DOMParser()\n return request(url, options)\n .pipe(\n switchMap(res => res.text()),\n map(res => dom.parseFromString(res, \"text/xml\")),\n shareReplay(1)\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n fromEvent,\n map,\n merge,\n startWith\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Viewport offset\n */\nexport interface ViewportOffset {\n x: number /* Horizontal offset */\n y: number /* Vertical offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve viewport offset\n *\n * On iOS Safari, viewport offset can be negative due to overflow scrolling.\n * As this may induce strange behaviors downstream, we'll just limit it to 0.\n *\n * @returns Viewport offset\n */\nexport function getViewportOffset(): ViewportOffset {\n return {\n x: Math.max(0, scrollX),\n y: Math.max(0, scrollY)\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport offset\n *\n * @returns Viewport offset observable\n */\nexport function watchViewportOffset(): Observable {\n return merge(\n fromEvent(window, \"scroll\", { passive: true }),\n fromEvent(window, \"resize\", { passive: true })\n )\n .pipe(\n map(getViewportOffset),\n startWith(getViewportOffset())\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n fromEvent,\n map,\n startWith\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Viewport size\n */\nexport interface ViewportSize {\n width: number /* Viewport width */\n height: number /* Viewport height */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve viewport size\n *\n * @returns Viewport size\n */\nexport function getViewportSize(): ViewportSize {\n return {\n width: innerWidth,\n height: innerHeight\n }\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport size\n *\n * @returns Viewport size observable\n */\nexport function watchViewportSize(): Observable {\n return fromEvent(window, \"resize\", { passive: true })\n .pipe(\n map(getViewportSize),\n startWith(getViewportSize())\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n combineLatest,\n map,\n shareReplay\n} from \"rxjs\"\n\nimport {\n ViewportOffset,\n watchViewportOffset\n} from \"../offset\"\nimport {\n ViewportSize,\n watchViewportSize\n} from \"../size\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Viewport\n */\nexport interface Viewport {\n offset: ViewportOffset /* Viewport offset */\n size: ViewportSize /* Viewport size */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport\n *\n * @returns Viewport observable\n */\nexport function watchViewport(): Observable {\n return combineLatest([\n watchViewportOffset(),\n watchViewportSize()\n ])\n .pipe(\n map(([offset, size]) => ({ offset, size })),\n shareReplay(1)\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n combineLatest,\n distinctUntilKeyChanged,\n map\n} from \"rxjs\"\n\nimport { Header } from \"~/components\"\n\nimport { getElementOffset } from \"../../element\"\nimport { Viewport } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
/* Header observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch viewport relative to element\n *\n * @param el - Element\n * @param options - Options\n *\n * @returns Viewport observable\n */\nexport function watchViewportAt(\n el: HTMLElement, { viewport$, header$ }: WatchOptions\n): Observable {\n const size$ = viewport$\n .pipe(\n distinctUntilKeyChanged(\"size\")\n )\n\n /* Compute element offset */\n const offset$ = combineLatest([size$, header$])\n .pipe(\n map(() => getElementOffset(el))\n )\n\n /* Compute relative viewport, return hot observable */\n return combineLatest([header$, viewport$, offset$])\n .pipe(\n map(([{ height }, { offset, size }, { x, y }]) => ({\n offset: {\n x: offset.x - x,\n y: offset.y - y + height\n },\n size\n }))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n fromEvent,\n map,\n share,\n switchMapTo,\n tap,\n throttle\n} from \"rxjs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Worker message\n */\nexport interface WorkerMessage {\n type: unknown /* Message type */\n data?: unknown /* Message data */\n}\n\n/**\n * Worker handler\n *\n * @template T - Message type\n */\nexport interface WorkerHandler<\n T extends WorkerMessage\n> {\n tx$: Subject /* Message transmission subject */\n rx$: Observable /* Message receive observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n *\n * @template T - Worker message type\n */\ninterface WatchOptions {\n tx$: Observable /* Message transmission observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch a web worker\n *\n * This function returns an observable that sends all values emitted by the\n * message observable to the web worker. Web worker communication is expected\n * to be bidirectional (request-response) and synchronous. Messages that are\n * emitted during a pending request are throttled, the last one is emitted.\n *\n * @param worker - Web worker\n * @param options - Options\n *\n * @returns Worker message observable\n */\nexport function watchWorker(\n worker: Worker, { tx$ }: WatchOptions\n): Observable {\n\n /* Intercept messages from worker-like objects */\n const rx$ = fromEvent(worker, \"message\")\n .pipe(\n map(({ data }) => data as T)\n )\n\n /* Send and receive messages, return hot observable */\n return tx$\n .pipe(\n throttle(() => rx$, { leading: true, trailing: true }),\n tap(message => worker.postMessage(message)),\n switchMapTo(rx$),\n share()\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { getElement, getLocation } from \"~/browser\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Feature flag\n */\nexport type Flag =\n | \"content.code.annotate\" /* Code annotations */\n | \"header.autohide\" /* Hide header */\n | \"navigation.expand\" /* Automatic expansion */\n | \"navigation.indexes\" /* Section pages */\n | \"navigation.instant\" /* Instant loading */\n | \"navigation.sections\" /* Section navigation */\n | \"navigation.tabs\" /* Tabs navigation */\n | \"navigation.tabs.sticky\" /* Tabs navigation (sticky) */\n | \"navigation.top\" /* Back-to-top button */\n | \"navigation.tracking\" /* Anchor tracking */\n | \"search.highlight\" /* Search highlighting */\n | \"search.share\" /* Search sharing */\n | \"search.suggest\" /* Search suggestions */\n | \"toc.integrate\" /* Integrated table of contents */\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Translation\n */\nexport type Translation =\n | \"clipboard.copy\" /* Copy to clipboard */\n | \"clipboard.copied\" /* Copied to clipboard */\n | \"search.config.lang\" /* Search language */\n | \"search.config.pipeline\" /* Search pipeline */\n | \"search.config.separator\" /* Search separator */\n | \"search.placeholder\" /* Search */\n | \"search.result.placeholder\" /* Type to start searching */\n | \"search.result.none\" /* No matching documents */\n | \"search.result.one\" /* 1 matching document */\n | \"search.result.other\" /* # matching documents */\n | \"search.result.more.one\" /* 1 more on this page */\n | \"search.result.more.other\" /* # more on this page */\n | \"search.result.term.missing\" /* Missing */\n | \"select.version.title\" /* Version selector */\n\n/**\n * Translations\n */\nexport type Translations = Record\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Versioning\n */\nexport interface Versioning {\n provider: \"mike\" /* Version provider */\n default?: string /* Default version */\n}\n\n/**\n * Configuration\n */\nexport interface Config {\n base: string /* Base URL */\n features: Flag[] /* Feature flags */\n translations: Translations /* Translations */\n search: string /* Search worker URL */\n version?: Versioning /* Versioning */\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve global configuration and make base URL absolute\n */\nconst script = getElement(\"#__config\")\nconst config: Config = JSON.parse(script.textContent!)\nconfig.base = `${new URL(config.base, getLocation())}`\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve global configuration\n *\n * @returns Global configuration\n */\nexport function configuration(): Config {\n return config\n}\n\n/**\n * Check whether a feature flag is enabled\n *\n * @param flag - Feature flag\n *\n * @returns Test result\n */\nexport function feature(flag: Flag): boolean {\n return config.features.includes(flag)\n}\n\n/**\n * Retrieve the translation for the given key\n *\n * @param key - Key to be translated\n * @param value - Positional value, if any\n *\n * @returns Translation\n */\nexport function translation(\n key: Translation, value?: string | number\n): string {\n return typeof value !== \"undefined\"\n ? config.translations[key].replace(\"#\", value.toString())\n : config.translations[key]\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { getElement, getElements } from \"~/browser\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Component type\n */\nexport type ComponentType =\n | \"announce\" /* Announcement bar */\n | \"container\" /* Container */\n | \"content\" /* Content */\n | \"dialog\" /* Dialog */\n | \"header\" /* Header */\n | \"header-title\" /* Header title */\n | \"header-topic\" /* Header topic */\n | \"main\" /* Main area */\n | \"outdated\" /* Version warning */\n | \"palette\" /* Color palette */\n | \"search\" /* Search */\n | \"search-query\" /* Search input */\n | \"search-result\" /* Search results */\n | \"search-share\" /* Search sharing */\n | \"search-suggest\" /* Search suggestions */\n | \"sidebar\" /* Sidebar */\n | \"skip\" /* Skip link */\n | \"source\" /* Repository information */\n | \"tabs\" /* Navigation tabs */\n | \"toc\" /* Table of contents */\n | \"top\" /* Back-to-top button */\n\n/**\n * Component\n *\n * @template T - Component type\n * @template U - Reference type\n */\nexport type Component<\n T extends {} = {},\n U extends HTMLElement = HTMLElement\n> =\n T & {\n ref: U /* Component reference */\n }\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Component type map\n */\ninterface ComponentTypeMap {\n \"announce\": HTMLElement /* Announcement bar */\n \"container\": HTMLElement /* Container */\n \"content\": HTMLElement /* Content */\n \"dialog\": HTMLElement /* Dialog */\n \"header\": HTMLElement /* Header */\n \"header-title\": HTMLElement /* Header title */\n \"header-topic\": HTMLElement /* Header topic */\n \"main\": HTMLElement /* Main area */\n \"outdated\": HTMLElement /* Version warning */\n \"palette\": HTMLElement /* Color palette */\n \"search\": HTMLElement /* Search */\n \"search-query\": HTMLInputElement /* Search input */\n \"search-result\": HTMLElement /* Search results */\n \"search-share\": HTMLAnchorElement /* Search sharing */\n \"search-suggest\": HTMLElement /* Search suggestions */\n \"sidebar\": HTMLElement /* Sidebar */\n \"skip\": HTMLAnchorElement /* Skip link */\n \"source\": HTMLAnchorElement /* Repository information */\n \"tabs\": HTMLElement /* Navigation tabs */\n \"toc\": HTMLElement /* Table of contents */\n \"top\": HTMLAnchorElement /* Back-to-top button */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Retrieve the element for a given component or throw a reference error\n *\n * @template T - Component type\n *\n * @param type - Component type\n * @param node - Node of reference\n *\n * @returns Element\n */\nexport function getComponentElement(\n type: T, node: ParentNode = document\n): ComponentTypeMap[T] {\n return getElement(`[data-md-component=${type}]`, node)\n}\n\n/**\n * Retrieve all elements for a given component\n *\n * @template T - Component type\n *\n * @param type - Component type\n * @param node - Node of reference\n *\n * @returns Elements\n */\nexport function getComponentElements(\n type: T, node: ParentNode = document\n): ComponentTypeMap[T][] {\n return getElements(`[data-md-component=${type}]`, node)\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport ClipboardJS from \"clipboard\"\nimport {\n EMPTY,\n Observable,\n Subject,\n defer,\n distinctUntilChanged,\n distinctUntilKeyChanged,\n finalize,\n map,\n mergeWith,\n switchMap,\n takeLast,\n takeUntil,\n tap\n} from \"rxjs\"\n\nimport { feature } from \"~/_\"\nimport {\n getElementContentSize,\n watchElementSize\n} from \"~/browser\"\nimport { renderClipboardButton } from \"~/templates\"\n\nimport { Component } from \"../../_\"\nimport {\n Annotation,\n mountAnnotationList\n} from \"../annotation\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Code block\n */\nexport interface CodeBlock {\n scrollable: boolean /* Code block overflows */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount options\n */\ninterface MountOptions {\n print$: Observable /* Media print observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Global sequence number for Clipboard.js integration\n */\nlet sequence = 0\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Find candidate list element directly following a code block\n *\n * @param el - Code block element\n *\n * @returns List element or nothing\n */\nfunction findCandidateList(el: HTMLElement): HTMLElement | undefined {\n if (el.nextElementSibling) {\n const sibling = el.nextElementSibling as HTMLElement\n if (sibling.tagName === \"OL\")\n return sibling\n\n /* Skip empty paragraphs - see https://bit.ly/3r4ZJ2O */\n else if (sibling.tagName === \"P\" && !sibling.children.length)\n return findCandidateList(sibling)\n }\n\n /* Everything else */\n return undefined\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch code block\n *\n * This function monitors size changes of the viewport, as well as switches of\n * content tabs with embedded code blocks, as both may trigger overflow.\n *\n * @param el - Code block element\n *\n * @returns Code block observable\n */\nexport function watchCodeBlock(\n el: HTMLElement\n): Observable {\n return watchElementSize(el)\n .pipe(\n map(({ width }) => {\n const content = getElementContentSize(el)\n return {\n scrollable: content.width > width\n }\n }),\n distinctUntilKeyChanged(\"scrollable\")\n )\n}\n\n/**\n * Mount code block\n *\n * This function ensures that an overflowing code block is focusable through\n * keyboard, so it can be scrolled without a mouse to improve on accessibility.\n * Furthermore, if code annotations are enabled, they are mounted if and only\n * if the code block is currently visible, e.g., not in a hidden content tab.\n *\n * @param el - Code block element\n * @param options - Options\n *\n * @returns Code block and annotation component observable\n */\nexport function mountCodeBlock(\n el: HTMLElement, options: MountOptions\n): Observable> {\n const { matches: hover } = matchMedia(\"(hover)\")\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe(({ scrollable }) => {\n if (scrollable && hover)\n el.setAttribute(\"tabindex\", \"0\")\n else\n el.removeAttribute(\"tabindex\")\n })\n\n /* Render button for Clipboard.js integration */\n if (ClipboardJS.isSupported()) {\n const parent = el.closest(\"pre\")!\n parent.id = `__code_${++sequence}`\n parent.insertBefore(\n renderClipboardButton(parent.id),\n el\n )\n }\n\n /* Handle code annotations */\n const container = el.closest([\n \":not(td):not(.code) > .highlight\",\n \".highlighttable\"\n ].join(\", \"))\n if (container instanceof HTMLElement) {\n const list = findCandidateList(container)\n\n /* Mount code annotations, if enabled */\n if (typeof list !== \"undefined\" && (\n container.classList.contains(\"annotate\") ||\n feature(\"content.code.annotate\")\n )) {\n const annotations$ = mountAnnotationList(list, el, options)\n\n /* Create and return component */\n return watchCodeBlock(el)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state })),\n mergeWith(watchElementSize(container)\n .pipe(\n takeUntil(push$.pipe(takeLast(1))),\n map(({ width, height }) => width && height),\n distinctUntilChanged(),\n switchMap(active => active ? annotations$ : EMPTY)\n )\n )\n )\n }\n }\n\n /* Create and return component */\n return watchCodeBlock(el)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render an empty annotation\n *\n * @param id - Annotation identifier\n *\n * @returns Element\n */\nexport function renderAnnotation(id: number): HTMLElement {\n return (\n \n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { translation } from \"~/_\"\nimport { h } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a 'copy-to-clipboard' button\n *\n * @param id - Unique identifier\n *\n * @returns Element\n */\nexport function renderClipboardButton(id: string): HTMLElement {\n return (\n code`}\n >\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { ComponentChild } from \"preact\"\n\nimport { feature, translation } from \"~/_\"\nimport {\n SearchDocument,\n SearchMetadata,\n SearchResultItem\n} from \"~/integrations/search\"\nimport { h, truncate } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Render flag\n */\nconst enum Flag {\n TEASER = 1, /* Render teaser */\n PARENT = 2 /* Render as parent */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper function\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a search document\n *\n * @param document - Search document\n * @param flag - Render flags\n *\n * @returns Element\n */\nfunction renderSearchDocument(\n document: SearchDocument & SearchMetadata, flag: Flag\n): HTMLElement {\n const parent = flag & Flag.PARENT\n const teaser = flag & Flag.TEASER\n\n /* Render missing query terms */\n const missing = Object.keys(document.terms)\n .filter(key => !document.terms[key])\n .reduce((list, key) => [\n ...list, {key}, \" \"\n ], [])\n .slice(0, -1)\n\n /* Assemble query string for highlighting */\n const url = new URL(document.location)\n if (feature(\"search.highlight\"))\n url.searchParams.set(\"h\", Object.entries(document.terms)\n .filter(([, match]) => match)\n .reduce((highlight, [value]) => `${highlight} ${value}`.trim(), \"\")\n )\n\n /* Render article or section, depending on flags */\n return (\n \n \n {parent > 0 &&
}\n

{document.title}

\n {teaser > 0 && document.text.length > 0 &&\n

\n {truncate(document.text, 320)}\n

\n }\n {teaser > 0 && missing.length > 0 &&\n

\n {translation(\"search.result.term.missing\")}: {...missing}\n

\n }\n \n
\n )\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a search result\n *\n * @param result - Search result\n *\n * @returns Element\n */\nexport function renderSearchResultItem(\n result: SearchResultItem\n): HTMLElement {\n const threshold = result[0].score\n const docs = [...result]\n\n /* Find and extract parent article */\n const parent = docs.findIndex(doc => !doc.location.includes(\"#\"))\n const [article] = docs.splice(parent, 1)\n\n /* Determine last index above threshold */\n let index = docs.findIndex(doc => doc.score < threshold)\n if (index === -1)\n index = docs.length\n\n /* Partition sections */\n const best = docs.slice(0, index)\n const more = docs.slice(index)\n\n /* Render children */\n const children = [\n renderSearchDocument(article, Flag.PARENT | +(!parent && index === 0)),\n ...best.map(section => renderSearchDocument(section, Flag.TEASER)),\n ...more.length ? [\n
\n \n {more.length > 0 && more.length === 1\n ? translation(\"search.result.more.one\")\n : translation(\"search.result.more.other\", more.length)\n }\n \n {...more.map(section => renderSearchDocument(section, Flag.TEASER))}\n
\n ] : []\n ]\n\n /* Render search result */\n return (\n
  • \n {children}\n
  • \n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SourceFacts } from \"~/components\"\nimport { h, round } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render repository facts\n *\n * @param facts - Repository facts\n *\n * @returns Element\n */\nexport function renderSourceFacts(facts: SourceFacts): HTMLElement {\n return (\n
      \n {Object.entries(facts).map(([key, value]) => (\n
    • \n {typeof value === \"number\" ? round(value) : value}\n
    • \n ))}\n
    \n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { h } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a table inside a wrapper to improve scrolling on mobile\n *\n * @param table - Table element\n *\n * @returns Element\n */\nexport function renderTable(table: HTMLElement): HTMLElement {\n return (\n
    \n
    \n {table}\n
    \n
    \n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { configuration, translation } from \"~/_\"\nimport { h } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Version\n */\nexport interface Version {\n version: string /* Version identifier */\n title: string /* Version title */\n aliases: string[] /* Version aliases */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a version\n *\n * @param version - Version\n *\n * @returns Element\n */\nfunction renderVersion(version: Version): HTMLElement {\n const config = configuration()\n\n /* Ensure trailing slash, see https://bit.ly/3rL5u3f */\n const url = new URL(`../${version.version}/`, config.base)\n return (\n
  • \n \n {version.title}\n \n
  • \n )\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Render a version selector\n *\n * @param versions - Versions\n * @param active - Active version\n *\n * @returns Element\n */\nexport function renderVersionSelector(\n versions: Version[], active: Version\n): HTMLElement {\n return (\n
    \n \n {active.title}\n \n
      \n {versions.map(renderVersion)}\n
    \n
    \n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n Subject,\n animationFrameScheduler,\n combineLatest,\n defer,\n finalize,\n fromEvent,\n map,\n switchMap,\n take,\n tap,\n throttleTime\n} from \"rxjs\"\n\nimport {\n ElementOffset,\n getElement,\n getElementSize,\n watchElementContentOffset,\n watchElementFocus,\n watchElementOffset\n} from \"~/browser\"\n\nimport { Component } from \"../../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Annotation\n */\nexport interface Annotation {\n active: boolean /* Annotation is active */\n offset: ElementOffset /* Annotation offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch annotation\n *\n * @param el - Annotation element\n * @param container - Containing element\n *\n * @returns Annotation observable\n */\nexport function watchAnnotation(\n el: HTMLElement, container: HTMLElement\n): Observable {\n const offset$ = defer(() => combineLatest([\n watchElementOffset(el),\n watchElementContentOffset(container)\n ]))\n .pipe(\n map(([{ x, y }, scroll]) => {\n const { width } = getElementSize(el)\n return ({\n x: x - scroll.x + width / 2,\n y: y - scroll.y\n })\n })\n )\n\n /* Actively watch annotation on focus */\n return watchElementFocus(el)\n .pipe(\n switchMap(active => offset$\n .pipe(\n map(offset => ({ active, offset })),\n take(+!active || Infinity)\n )\n )\n )\n}\n\n/**\n * Mount annotation\n *\n * @param el - Annotation element\n * @param container - Containing element\n *\n * @returns Annotation component observable\n */\nexport function mountAnnotation(\n el: HTMLElement, container: HTMLElement\n): Observable> {\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe({\n\n /* Handle emission */\n next({ offset }) {\n el.style.setProperty(\"--md-tooltip-x\", `${offset.x}px`)\n el.style.setProperty(\"--md-tooltip-y\", `${offset.y}px`)\n },\n\n /* Handle complete */\n complete() {\n el.style.removeProperty(\"--md-tooltip-x\")\n el.style.removeProperty(\"--md-tooltip-y\")\n }\n })\n\n /* Track relative origin of tooltip */\n push$\n .pipe(\n throttleTime(500, animationFrameScheduler),\n map(() => container.getBoundingClientRect()),\n map(({ x }) => x)\n )\n .subscribe({\n\n /* Handle emission */\n next(origin) {\n if (origin)\n el.style.setProperty(\"--md-tooltip-0\", `${-origin}px`)\n else\n el.style.removeProperty(\"--md-tooltip-0\")\n },\n\n /* Handle complete */\n complete() {\n el.style.removeProperty(\"--md-tooltip-0\")\n }\n })\n\n /* Close open annotation on click */\n const index = getElement(\":scope > :last-child\", el)\n const blur$ = fromEvent(index, \"mousedown\", { once: true })\n push$\n .pipe(\n switchMap(({ active }) => active ? blur$ : EMPTY),\n tap(ev => ev.preventDefault())\n )\n .subscribe(() => el.blur())\n\n /* Create and return component */\n return watchAnnotation(el, container)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n Subject,\n defer,\n finalize,\n merge,\n share,\n takeLast,\n takeUntil\n} from \"rxjs\"\n\nimport {\n getElement,\n getElements,\n getOptionalElement\n} from \"~/browser\"\nimport { renderAnnotation } from \"~/templates\"\n\nimport { Component } from \"../../../_\"\nimport {\n Annotation,\n mountAnnotation\n} from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount options\n */\ninterface MountOptions {\n print$: Observable /* Media print observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Find all annotation markers in the given code block\n *\n * @param container - Containing element\n *\n * @returns Annotation markers\n */\nfunction findAnnotationMarkers(container: HTMLElement): Text[] {\n const markers: Text[] = []\n for (const comment of getElements(\".c, .c1, .cm\", container)) {\n let match: RegExpExecArray | null\n let text = comment.firstChild as Text\n\n /* Split text at marker and add to list */\n while ((match = /\\((\\d+)\\)/.exec(text.textContent!))) {\n const marker = text.splitText(match.index)\n text = marker.splitText(match[0].length)\n markers.push(marker)\n }\n }\n return markers\n}\n\n/**\n * Swap the child nodes of two elements\n *\n * @param source - Source element\n * @param target - Target element\n */\nfunction swap(source: HTMLElement, target: HTMLElement): void {\n target.append(...Array.from(source.childNodes))\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount annotation list\n *\n * This function analyzes the containing code block and checks for markers\n * referring to elements in the given annotation list. If no markers are found,\n * the list is left untouched. Otherwise, list elements are rendered as\n * annotations inside the code block.\n *\n * @param el - Annotation list element\n * @param container - Containing element\n * @param options - Options\n *\n * @returns Annotation component observable\n */\nexport function mountAnnotationList(\n el: HTMLElement, container: HTMLElement, { print$ }: MountOptions\n): Observable> {\n\n /* Find and replace all markers with empty annotations */\n const annotations = new Map()\n for (const marker of findAnnotationMarkers(container)) {\n const [, id] = marker.textContent!.match(/\\((\\d+)\\)/)!\n if (getOptionalElement(`li:nth-child(${id})`, el)) {\n annotations.set(+id, renderAnnotation(+id))\n marker.replaceWith(annotations.get(+id)!)\n }\n }\n\n /* Keep list if there are no annotations to render */\n if (annotations.size === 0)\n return EMPTY\n\n /* Create and return component */\n return defer(() => {\n const done$ = new Subject()\n\n /* Handle print mode - see https://bit.ly/3rgPdpt */\n print$\n .pipe(\n takeUntil(done$.pipe(takeLast(1)))\n )\n .subscribe(active => {\n el.hidden = !active\n\n /* Show annotations in code block or list (print) */\n for (const [id, annotation] of annotations) {\n const inner = getElement(\".md-typeset\", annotation)\n const child = getElement(`li:nth-child(${id})`, el)\n if (!active)\n swap(child, inner)\n else\n swap(inner, child)\n }\n })\n\n /* Create and return component */\n return merge(...[...annotations]\n .map(([, annotation]) => (\n mountAnnotation(annotation, container)\n ))\n )\n .pipe(\n finalize(() => done$.complete()),\n share()\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n defer,\n filter,\n finalize,\n map,\n mapTo,\n merge,\n tap\n} from \"rxjs\"\n\nimport { Component } from \"../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Details\n */\nexport interface Details {\n action: \"open\" | \"close\" /* Details state */\n reveal?: boolean /* Details is revealed */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n target$: Observable /* Location target observable */\n print$: Observable /* Media print observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n target$: Observable /* Location target observable */\n print$: Observable /* Media print observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch details\n *\n * @param el - Details element\n * @param options - Options\n *\n * @returns Details observable\n */\nexport function watchDetails(\n el: HTMLDetailsElement, { target$, print$ }: WatchOptions\n): Observable
    {\n let open = true\n return merge(\n\n /* Open and focus details on location target */\n target$\n .pipe(\n map(target => target.closest(\"details:not([open])\")!),\n filter(details => el === details),\n mapTo
    ({ action: \"open\", reveal: true })\n ),\n\n /* Open details on print and close afterwards */\n print$\n .pipe(\n filter(active => active || !open),\n tap(() => open = el.open),\n map(active => ({\n action: active ? \"open\" : \"close\"\n }) as Details)\n )\n )\n}\n\n/**\n * Mount details\n *\n * This function ensures that `details` tags are opened on anchor jumps and\n * prior to printing, so the whole content of the page is visible.\n *\n * @param el - Details element\n * @param options - Options\n *\n * @returns Details component observable\n */\nexport function mountDetails(\n el: HTMLDetailsElement, options: MountOptions\n): Observable> {\n return defer(() => {\n const push$ = new Subject
    ()\n push$.subscribe(({ action, reveal }) => {\n if (action === \"open\")\n el.setAttribute(\"open\", \"\")\n else\n el.removeAttribute(\"open\")\n if (reveal)\n el.scrollIntoView()\n })\n\n /* Create and return component */\n return watchDetails(el, options)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, of } from \"rxjs\"\n\nimport { renderTable } from \"~/templates\"\nimport { h } from \"~/utilities\"\n\nimport { Component } from \"../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Data table\n */\nexport interface DataTable {}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Sentinel for replacement\n */\nconst sentinel = h(\"table\")\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount data table\n *\n * This function wraps a data table in another scrollable container, so it can\n * be smoothly scrolled on smaller screen sizes and won't break the layout.\n *\n * @param el - Data table element\n *\n * @returns Data table component observable\n */\nexport function mountDataTable(\n el: HTMLElement\n): Observable> {\n el.replaceWith(sentinel)\n sentinel.replaceWith(renderTable(el))\n\n /* Create and return component */\n return of({ ref: el })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n animationFrameScheduler,\n auditTime,\n combineLatest,\n defer,\n finalize,\n fromEvent,\n map,\n mapTo,\n merge,\n startWith,\n takeLast,\n takeUntil,\n tap\n} from \"rxjs\"\n\nimport {\n getElement,\n getElementOffset,\n getElementSize,\n getElements,\n watchElementSize\n} from \"~/browser\"\n\nimport { Component } from \"../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Content tabs\n */\nexport interface ContentTabs {\n active: HTMLLabelElement /* Active tab label */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch content tabs\n *\n * @param el - Content tabs element\n *\n * @returns Content tabs observable\n */\nexport function watchContentTabs(\n el: HTMLElement\n): Observable {\n const inputs = getElements(\":scope > input\", el)\n return merge(...inputs.map(input => fromEvent(input, \"change\")\n .pipe(\n mapTo({\n active: getElement(`label[for=${input.id}]`)\n })\n )\n ))\n .pipe(\n startWith({\n active: getElement(`label[for=${inputs[0].id}]`)\n } as ContentTabs)\n )\n}\n\n/**\n * Mount content tabs\n *\n * This function scrolls the active tab into view. While this functionality is\n * provided by browsers as part of `scrollInfoView`, browsers will always also\n * scroll the vertical axis, which we do not want. Thus, we decided to provide\n * this functionality ourselves.\n *\n * @param el - Content tabs element\n *\n * @returns Content tabs component observable\n */\nexport function mountContentTabs(\n el: HTMLElement\n): Observable> {\n const container = getElement(\".tabbed-labels\", el)\n return defer(() => {\n const push$ = new Subject()\n combineLatest([push$, watchElementSize(el)])\n .pipe(\n auditTime(1, animationFrameScheduler),\n takeUntil(push$.pipe(takeLast(1)))\n )\n .subscribe({\n\n /* Handle emission */\n next([{ active }]) {\n const offset = getElementOffset(active)\n const { width } = getElementSize(active)\n\n /* Set tab indicator offset and width */\n el.style.setProperty(\"--md-indicator-x\", `${offset.x}px`)\n el.style.setProperty(\"--md-indicator-width\", `${width}px`)\n\n /* Smoothly scroll container */\n container.scrollTo({\n behavior: \"smooth\",\n left: offset.x\n })\n },\n\n /* Handle complete */\n complete() {\n el.style.removeProperty(\"--md-indicator-x\")\n el.style.removeProperty(\"--md-indicator-width\")\n }\n })\n\n /* Create and return component */\n return watchContentTabs(el)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Observable, merge } from \"rxjs\"\n\nimport { getElements } from \"~/browser\"\n\nimport { Component } from \"../../_\"\nimport { Annotation } from \"../annotation\"\nimport { CodeBlock, mountCodeBlock } from \"../code\"\nimport { Details, mountDetails } from \"../details\"\nimport { DataTable, mountDataTable } from \"../table\"\nimport { ContentTabs, mountContentTabs } from \"../tabs\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Content\n */\nexport type Content =\n | Annotation\n | ContentTabs\n | CodeBlock\n | DataTable\n | Details\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount options\n */\ninterface MountOptions {\n target$: Observable /* Location target observable */\n print$: Observable /* Media print observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount content\n *\n * This function mounts all components that are found in the content of the\n * actual article, including code blocks, data tables and details.\n *\n * @param el - Content element\n * @param options - Options\n *\n * @returns Content component observable\n */\nexport function mountContent(\n el: HTMLElement, { target$, print$ }: MountOptions\n): Observable> {\n return merge(\n\n /* Code blocks */\n ...getElements(\"pre > code\", el)\n .map(child => mountCodeBlock(child, { print$ })),\n\n /* Data tables */\n ...getElements(\"table:not([class])\", el)\n .map(child => mountDataTable(child)),\n\n /* Details */\n ...getElements(\"details\", el)\n .map(child => mountDetails(child, { target$, print$ })),\n\n /* Content tabs */\n ...getElements(\"[data-tabs]\", el)\n .map(child => mountContentTabs(child))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n defer,\n delay,\n finalize,\n map,\n merge,\n of,\n switchMap,\n tap\n} from \"rxjs\"\n\nimport { getElement } from \"~/browser\"\n\nimport { Component } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Dialog\n */\nexport interface Dialog {\n message: string /* Dialog message */\n active: boolean /* Dialog is active */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n alert$: Subject /* Alert subject */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n alert$: Subject /* Alert subject */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch dialog\n *\n * @param _el - Dialog element\n * @param options - Options\n *\n * @returns Dialog observable\n */\nexport function watchDialog(\n _el: HTMLElement, { alert$ }: WatchOptions\n): Observable {\n return alert$\n .pipe(\n switchMap(message => merge(\n of(true),\n of(false).pipe(delay(2000))\n )\n .pipe(\n map(active => ({ message, active }))\n )\n )\n )\n}\n\n/**\n * Mount dialog\n *\n * This function reveals the dialog in the right corner when a new alert is\n * emitted through the subject that is passed as part of the options.\n *\n * @param el - Dialog element\n * @param options - Options\n *\n * @returns Dialog component observable\n */\nexport function mountDialog(\n el: HTMLElement, options: MountOptions\n): Observable> {\n const inner = getElement(\".md-typeset\", el)\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe(({ message, active }) => {\n inner.textContent = message\n if (active)\n el.setAttribute(\"data-md-state\", \"open\")\n else\n el.removeAttribute(\"data-md-state\")\n })\n\n /* Create and return component */\n return watchDialog(el, options)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n bufferCount,\n combineLatest,\n combineLatestWith,\n defer,\n distinctUntilChanged,\n distinctUntilKeyChanged,\n filter,\n map,\n of,\n shareReplay,\n startWith,\n switchMap,\n takeLast,\n takeUntil\n} from \"rxjs\"\n\nimport { feature } from \"~/_\"\nimport {\n Viewport,\n watchElementSize,\n watchToggle\n} from \"~/browser\"\n\nimport { Component } from \"../../_\"\nimport { Main } from \"../../main\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Header\n */\nexport interface Header {\n height: number /* Header visible height */\n sticky: boolean /* Header stickyness */\n hidden: boolean /* Header is hidden */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n main$: Observable
    /* Main area observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Compute whether the header is hidden\n *\n * If the user scrolls past a certain threshold, the header can be hidden when\n * scrolling down, and shown when scrolling up.\n *\n * @param options - Options\n *\n * @returns Toggle observable\n */\nfunction isHidden({ viewport$ }: WatchOptions): Observable {\n if (!feature(\"header.autohide\"))\n return of(false)\n\n /* Compute direction and turning point */\n const direction$ = viewport$\n .pipe(\n map(({ offset: { y } }) => y),\n bufferCount(2, 1),\n map(([a, b]) => [a < b, b] as const),\n distinctUntilKeyChanged(0)\n )\n\n /* Compute whether header should be hidden */\n const hidden$ = combineLatest([viewport$, direction$])\n .pipe(\n filter(([{ offset }, [, y]]) => Math.abs(y - offset.y) > 100),\n map(([, [direction]]) => direction),\n distinctUntilChanged()\n )\n\n /* Compute threshold for hiding */\n const search$ = watchToggle(\"search\")\n return combineLatest([viewport$, search$])\n .pipe(\n map(([{ offset }, search]) => offset.y > 400 && !search),\n distinctUntilChanged(),\n switchMap(active => active ? hidden$ : of(false)),\n startWith(false)\n )\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch header\n *\n * @param el - Header element\n * @param options - Options\n *\n * @returns Header observable\n */\nexport function watchHeader(\n el: HTMLElement, options: WatchOptions\n): Observable
    {\n return defer(() => {\n const styles = getComputedStyle(el)\n return of(\n styles.position === \"sticky\" ||\n styles.position === \"-webkit-sticky\"\n )\n })\n .pipe(\n combineLatestWith(watchElementSize(el), isHidden(options)),\n map(([sticky, { height }, hidden]) => ({\n height: sticky ? height : 0,\n sticky,\n hidden\n })),\n distinctUntilChanged((a, b) => (\n a.sticky === b.sticky &&\n a.height === b.height &&\n a.hidden === b.hidden\n )),\n shareReplay(1)\n )\n}\n\n/**\n * Mount header\n *\n * This function manages the different states of the header, i.e. whether it's\n * hidden or rendered with a shadow. This depends heavily on the main area.\n *\n * @param el - Header element\n * @param options - Options\n *\n * @returns Header component observable\n */\nexport function mountHeader(\n el: HTMLElement, { header$, main$ }: MountOptions\n): Observable> {\n return defer(() => {\n const push$ = new Subject
    ()\n push$\n .pipe(\n distinctUntilKeyChanged(\"active\"),\n combineLatestWith(header$)\n )\n .subscribe(([{ active }, { hidden }]) => {\n if (active)\n el.setAttribute(\"data-md-state\", hidden ? \"hidden\" : \"shadow\")\n else\n el.removeAttribute(\"data-md-state\")\n })\n\n /* Link to main area */\n main$.subscribe(push$)\n\n /* Create and return component */\n return header$\n .pipe(\n takeUntil(push$.pipe(takeLast(1))),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n Subject,\n defer,\n distinctUntilKeyChanged,\n finalize,\n map,\n tap\n} from \"rxjs\"\n\nimport {\n Viewport,\n getElementSize,\n getOptionalElement,\n watchViewportAt\n} from \"~/browser\"\n\nimport { Component } from \"../../_\"\nimport { Header } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Header\n */\nexport interface HeaderTitle {\n active: boolean /* Header title is active */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch header title\n *\n * @param el - Heading element\n * @param options - Options\n *\n * @returns Header title observable\n */\nexport function watchHeaderTitle(\n el: HTMLElement, { viewport$, header$ }: WatchOptions\n): Observable {\n return watchViewportAt(el, { viewport$, header$ })\n .pipe(\n map(({ offset: { y } }) => {\n const { height } = getElementSize(el)\n return {\n active: y >= height\n }\n }),\n distinctUntilKeyChanged(\"active\")\n )\n}\n\n/**\n * Mount header title\n *\n * This function swaps the header title from the site title to the title of the\n * current page when the user scrolls past the first headline.\n *\n * @param el - Header title element\n * @param options - Options\n *\n * @returns Header title component observable\n */\nexport function mountHeaderTitle(\n el: HTMLElement, options: MountOptions\n): Observable> {\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe(({ active }) => {\n if (active)\n el.setAttribute(\"data-md-state\", \"active\")\n else\n el.removeAttribute(\"data-md-state\")\n })\n\n /* Obtain headline, if any */\n const heading = getOptionalElement(\"article h1\")\n if (typeof heading === \"undefined\")\n return EMPTY\n\n /* Create and return component */\n return watchHeaderTitle(heading, options)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n combineLatest,\n distinctUntilChanged,\n distinctUntilKeyChanged,\n map,\n switchMap\n} from \"rxjs\"\n\nimport {\n Viewport,\n watchElementSize\n} from \"~/browser\"\n\nimport { Header } from \"../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Main area\n */\nexport interface Main {\n offset: number /* Main area top offset */\n height: number /* Main area visible height */\n active: boolean /* Main area is active */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch main area\n *\n * This function returns an observable that computes the visual parameters of\n * the main area which depends on the viewport vertical offset and height, as\n * well as the height of the header element, if the header is fixed.\n *\n * @param el - Main area element\n * @param options - Options\n *\n * @returns Main area observable\n */\nexport function watchMain(\n el: HTMLElement, { viewport$, header$ }: WatchOptions\n): Observable
    {\n\n /* Compute necessary adjustment for header */\n const adjust$ = header$\n .pipe(\n map(({ height }) => height),\n distinctUntilChanged()\n )\n\n /* Compute the main area's top and bottom borders */\n const border$ = adjust$\n .pipe(\n switchMap(() => watchElementSize(el)\n .pipe(\n map(({ height }) => ({\n top: el.offsetTop,\n bottom: el.offsetTop + height\n })),\n distinctUntilKeyChanged(\"bottom\")\n )\n )\n )\n\n /* Compute the main area's offset, visible height and if we scrolled past */\n return combineLatest([adjust$, border$, viewport$])\n .pipe(\n map(([header, { top, bottom }, { offset: { y }, size: { height } }]) => {\n height = Math.max(0, height\n - Math.max(0, top - y, header)\n - Math.max(0, height + y - bottom)\n )\n return {\n offset: top - header,\n height,\n active: top - header <= y\n }\n }),\n distinctUntilChanged((a, b) => (\n a.offset === b.offset &&\n a.height === b.height &&\n a.active === b.active\n ))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n defer,\n finalize,\n fromEvent,\n map,\n mapTo,\n mergeMap,\n of,\n shareReplay,\n startWith,\n tap\n} from \"rxjs\"\n\nimport { getElements } from \"~/browser\"\n\nimport { Component } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Palette colors\n */\nexport interface PaletteColor {\n scheme?: string /* Color scheme */\n primary?: string /* Primary color */\n accent?: string /* Accent color */\n}\n\n/**\n * Palette\n */\nexport interface Palette {\n index: number /* Palette index */\n color: PaletteColor /* Palette colors */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch color palette\n *\n * @param inputs - Color palette element\n *\n * @returns Color palette observable\n */\nexport function watchPalette(\n inputs: HTMLInputElement[]\n): Observable {\n const current = __md_get(\"__palette\") || {\n index: inputs.findIndex(input => matchMedia(\n input.getAttribute(\"data-md-color-media\")!\n ).matches)\n }\n\n /* Emit changes in color palette */\n return of(...inputs)\n .pipe(\n mergeMap(input => fromEvent(input, \"change\")\n .pipe(\n mapTo(input)\n )\n ),\n startWith(inputs[Math.max(0, current.index)]),\n map(input => ({\n index: inputs.indexOf(input),\n color: {\n scheme: input.getAttribute(\"data-md-color-scheme\"),\n primary: input.getAttribute(\"data-md-color-primary\"),\n accent: input.getAttribute(\"data-md-color-accent\")\n }\n } as Palette)),\n shareReplay(1)\n )\n}\n\n/**\n * Mount color palette\n *\n * @param el - Color palette element\n *\n * @returns Color palette component observable\n */\nexport function mountPalette(\n el: HTMLElement\n): Observable> {\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe(palette => {\n\n /* Set color palette */\n for (const [key, value] of Object.entries(palette.color))\n document.body.setAttribute(`data-md-color-${key}`, value)\n\n /* Toggle visibility */\n for (let index = 0; index < inputs.length; index++) {\n const label = inputs[index].nextElementSibling\n if (label instanceof HTMLElement)\n label.hidden = palette.index !== index\n }\n\n /* Persist preference in local storage */\n __md_set(\"__palette\", palette)\n })\n\n /* Create and return component */\n const inputs = getElements(\"input\", el)\n return watchPalette(inputs)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport ClipboardJS from \"clipboard\"\nimport {\n Observable,\n Subject,\n mapTo,\n tap\n} from \"rxjs\"\n\nimport { translation } from \"~/_\"\nimport { getElement } from \"~/browser\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Setup options\n */\ninterface SetupOptions {\n alert$: Subject /* Alert subject */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Extract text to copy\n *\n * @param el - HTML element\n *\n * @returns Extracted text\n */\nfunction extract(el: HTMLElement): string {\n el.setAttribute(\"data-md-copying\", \"\")\n const text = el.innerText\n el.removeAttribute(\"data-md-copying\")\n return text\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set up Clipboard.js integration\n *\n * @param options - Options\n */\nexport function setupClipboardJS(\n { alert$ }: SetupOptions\n): void {\n if (ClipboardJS.isSupported()) {\n new Observable(subscriber => {\n new ClipboardJS(\"[data-clipboard-target], [data-clipboard-text]\", {\n text: el => (\n el.getAttribute(\"data-clipboard-text\")! ||\n extract(getElement(\n el.getAttribute(\"data-clipboard-target\")!\n ))\n )\n })\n .on(\"success\", ev => subscriber.next(ev))\n })\n .pipe(\n tap(ev => {\n const trigger = ev.trigger as HTMLElement\n trigger.focus()\n }),\n mapTo(translation(\"clipboard.copied\"))\n )\n .subscribe(alert$)\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n NEVER,\n Observable,\n Subject,\n bufferCount,\n catchError,\n concatMap,\n debounceTime,\n distinctUntilChanged,\n distinctUntilKeyChanged,\n filter,\n fromEvent,\n map,\n merge,\n of,\n sample,\n share,\n skip,\n skipUntil,\n switchMap\n} from \"rxjs\"\n\nimport { configuration, feature } from \"~/_\"\nimport {\n Viewport,\n ViewportOffset,\n getElements,\n getOptionalElement,\n request,\n requestXML,\n setLocation,\n setLocationHash\n} from \"~/browser\"\nimport { getComponentElement } from \"~/components\"\nimport { h } from \"~/utilities\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * History state\n */\nexport interface HistoryState {\n url: URL /* State URL */\n offset?: ViewportOffset /* State viewport offset */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Setup options\n */\ninterface SetupOptions {\n document$: Subject /* Document subject */\n location$: Subject /* Location subject */\n viewport$: Observable /* Viewport observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Preprocess a list of URLs\n *\n * This function replaces the `site_url` in the sitemap with the actual base\n * URL, to allow instant loading to work in occasions like Netlify previews.\n *\n * @param urls - URLs\n *\n * @returns Processed URLs\n */\nfunction preprocess(urls: string[]): string[] {\n if (urls.length < 2)\n return urls\n\n /* Take the first two URLs and remove everything after the last slash */\n const [root, next] = urls\n .sort((a, b) => a.length - b.length)\n .map(url => url.replace(/[^/]+$/, \"\"))\n\n /* Compute common prefix */\n let index = 0\n if (root === next)\n index = root.length\n else\n while (root.charCodeAt(index) === next.charCodeAt(index))\n index++\n\n /* Replace common prefix (i.e. base) with effective base */\n const config = configuration()\n return urls.map(url => (\n url.replace(root.slice(0, index), config.base)\n ))\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set up instant loading\n *\n * When fetching, theoretically, we could use `responseType: \"document\"`, but\n * since all MkDocs links are relative, we need to make sure that the current\n * location matches the document we just loaded. Otherwise any relative links\n * in the document could use the old location.\n *\n * This is the reason why we need to synchronize history events and the process\n * of fetching the document for navigation changes (except `popstate` events):\n *\n * 1. Fetch document via `XMLHTTPRequest`\n * 2. Set new location via `history.pushState`\n * 3. Parse and emit fetched document\n *\n * For `popstate` events, we must not use `history.pushState`, or the forward\n * history will be irreversibly overwritten. In case the request fails, the\n * location change is dispatched regularly.\n *\n * @param options - Options\n */\nexport function setupInstantLoading(\n { document$, location$, viewport$ }: SetupOptions\n): void {\n const config = configuration()\n if (location.protocol === \"file:\")\n return\n\n /* Disable automatic scroll restoration */\n if (\"scrollRestoration\" in history) {\n history.scrollRestoration = \"manual\"\n\n /* Hack: ensure that reloads restore viewport offset */\n fromEvent(window, \"beforeunload\")\n .subscribe(() => {\n history.scrollRestoration = \"auto\"\n })\n }\n\n /* Hack: ensure absolute favicon link to omit 404s when switching */\n const favicon = getOptionalElement(\"link[rel=icon]\")\n if (typeof favicon !== \"undefined\")\n favicon.href = favicon.href\n\n /* Intercept internal navigation */\n const push$ = requestXML(new URL(\"sitemap.xml\", config.base))\n .pipe(\n map(sitemap => preprocess(getElements(\"loc\", sitemap)\n .map(node => node.textContent!)\n )),\n switchMap(urls => fromEvent(document.body, \"click\")\n .pipe(\n filter(ev => !ev.metaKey && !ev.ctrlKey),\n switchMap(ev => {\n\n /* Handle HTML and SVG elements */\n if (ev.target instanceof Element) {\n const el = ev.target.closest(\"a\")\n if (el && !el.target) {\n const url = new URL(el.href)\n\n /* Canonicalize URL */\n url.search = \"\"\n url.hash = \"\"\n\n /* Check if URL should be intercepted */\n if (\n url.pathname !== location.pathname &&\n urls.includes(url.toString())\n ) {\n ev.preventDefault()\n return of({\n url: new URL(el.href)\n })\n }\n }\n }\n return NEVER\n })\n )\n ),\n share()\n )\n\n /* Intercept history back and forward */\n const pop$ = fromEvent(window, \"popstate\")\n .pipe(\n filter(ev => ev.state !== null),\n map(ev => ({\n url: new URL(location.href),\n offset: ev.state\n })),\n share()\n )\n\n /* Emit location change */\n merge(push$, pop$)\n .pipe(\n distinctUntilChanged((a, b) => a.url.href === b.url.href),\n map(({ url }) => url)\n )\n .subscribe(location$)\n\n /* Fetch document via `XMLHTTPRequest` */\n const response$ = location$\n .pipe(\n distinctUntilKeyChanged(\"pathname\"),\n switchMap(url => request(url.href)\n .pipe(\n catchError(() => {\n setLocation(url)\n return NEVER\n })\n )\n ),\n share()\n )\n\n /* Set new location via `history.pushState` */\n push$\n .pipe(\n sample(response$)\n )\n .subscribe(({ url }) => {\n history.pushState({}, \"\", `${url}`)\n })\n\n /* Parse and emit fetched document */\n const dom = new DOMParser()\n response$\n .pipe(\n switchMap(res => res.text()),\n map(res => dom.parseFromString(res, \"text/html\"))\n )\n .subscribe(document$)\n\n /* Replace meta tags and components */\n document$\n .pipe(\n skip(1)\n )\n .subscribe(replacement => {\n for (const selector of [\n\n /* Meta tags */\n \"title\",\n \"link[rel=canonical]\",\n \"meta[name=author]\",\n \"meta[name=description]\",\n\n /* Components */\n \"[data-md-component=announce]\",\n \"[data-md-component=container]\",\n \"[data-md-component=header-topic]\",\n \"[data-md-component=logo]\",\n \"[data-md-component=skip]\",\n ...feature(\"navigation.tabs.sticky\")\n ? [\"[data-md-component=tabs]\"]\n : []\n ]) {\n const source = getOptionalElement(selector)\n const target = getOptionalElement(selector, replacement)\n if (\n typeof source !== \"undefined\" &&\n typeof target !== \"undefined\"\n ) {\n source.replaceWith(target)\n }\n }\n })\n\n /* Re-evaluate scripts */\n document$\n .pipe(\n skip(1),\n map(() => getComponentElement(\"container\")),\n switchMap(el => of(...getElements(\"script\", el))),\n concatMap(el => {\n const script = h(\"script\")\n if (el.src) {\n for (const name of el.getAttributeNames())\n script.setAttribute(name, el.getAttribute(name)!)\n el.replaceWith(script)\n\n /* Complete when script is loaded */\n return new Observable(observer => {\n script.onload = () => observer.complete()\n })\n\n /* Complete immediately */\n } else {\n script.textContent = el.textContent\n el.replaceWith(script)\n return EMPTY\n }\n })\n )\n .subscribe()\n\n /* Emit history state change */\n merge(push$, pop$)\n .pipe(\n sample(document$)\n )\n .subscribe(({ url, offset }) => {\n if (url.hash && !offset) {\n setLocationHash(url.hash)\n } else {\n window.scrollTo(0, offset?.y || 0)\n }\n })\n\n /* Debounce update of viewport offset */\n viewport$\n .pipe(\n skipUntil(push$),\n debounceTime(250),\n distinctUntilKeyChanged(\"offset\")\n )\n .subscribe(({ offset }) => {\n history.replaceState(offset, \"\")\n })\n\n /* Set viewport offset from history */\n merge(push$, pop$)\n .pipe(\n bufferCount(2, 1),\n filter(([a, b]) => a.url.pathname === b.url.pathname),\n map(([, state]) => state)\n )\n .subscribe(({ offset }) => {\n window.scrollTo(0, offset?.y || 0)\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport escapeHTML from \"escape-html\"\n\nimport { SearchIndexDocument } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search document\n */\nexport interface SearchDocument extends SearchIndexDocument {\n parent?: SearchIndexDocument /* Parent article */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search document mapping\n */\nexport type SearchDocumentMap = Map\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search document mapping\n *\n * @param docs - Search index documents\n *\n * @returns Search document map\n */\nexport function setupSearchDocumentMap(\n docs: SearchIndexDocument[]\n): SearchDocumentMap {\n const documents = new Map()\n const parents = new Set()\n for (const doc of docs) {\n const [path, hash] = doc.location.split(\"#\")\n\n /* Extract location and title */\n const location = doc.location\n const title = doc.title\n\n /* Escape and cleanup text */\n const text = escapeHTML(doc.text)\n .replace(/\\s+(?=[,.:;!?])/g, \"\")\n .replace(/\\s+/g, \" \")\n\n /* Handle section */\n if (hash) {\n const parent = documents.get(path)!\n\n /* Ignore first section, override article */\n if (!parents.has(parent)) {\n parent.title = doc.title\n parent.text = text\n\n /* Remember that we processed the article */\n parents.add(parent)\n\n /* Add subsequent section */\n } else {\n documents.set(location, {\n location,\n title,\n text,\n parent\n })\n }\n\n /* Add article */\n } else {\n documents.set(location, {\n location,\n title,\n text\n })\n }\n }\n return documents\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport escapeHTML from \"escape-html\"\n\nimport { SearchIndexConfig } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search highlight function\n *\n * @param value - Value\n *\n * @returns Highlighted value\n */\nexport type SearchHighlightFn = (value: string) => string\n\n/**\n * Search highlight factory function\n *\n * @param query - Query value\n *\n * @returns Search highlight function\n */\nexport type SearchHighlightFactoryFn = (query: string) => SearchHighlightFn\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search highlighter\n *\n * @param config - Search index configuration\n * @param escape - Whether to escape HTML\n *\n * @returns Search highlight factory function\n */\nexport function setupSearchHighlighter(\n config: SearchIndexConfig, escape: boolean\n): SearchHighlightFactoryFn {\n const separator = new RegExp(config.separator, \"img\")\n const highlight = (_: unknown, data: string, term: string) => {\n return `${data}${term}`\n }\n\n /* Return factory function */\n return (query: string) => {\n query = query\n .replace(/[\\s*+\\-:~^]+/g, \" \")\n .trim()\n\n /* Create search term match expression */\n const match = new RegExp(`(^|${config.separator})(${\n query\n .replace(/[|\\\\{}()[\\]^$+*?.-]/g, \"\\\\$&\")\n .replace(separator, \"|\")\n })`, \"img\")\n\n /* Highlight string value */\n return value => (\n escape\n ? escapeHTML(value)\n : value\n )\n .replace(match, highlight)\n .replace(/<\\/mark>(\\s+)]*>/img, \"$1\")\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search transformation function\n *\n * @param value - Query value\n *\n * @returns Transformed query value\n */\nexport type SearchTransformFn = (value: string) => string\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Default transformation function\n *\n * 1. Search for terms in quotation marks and prepend a `+` modifier to denote\n * that the resulting document must contain all terms, converting the query\n * to an `AND` query (as opposed to the default `OR` behavior). While users\n * may expect terms enclosed in quotation marks to map to span queries, i.e.\n * for which order is important, Lunr.js doesn't support them, so the best\n * we can do is to convert the terms to an `AND` query.\n *\n * 2. Replace control characters which are not located at the beginning of the\n * query or preceded by white space, or are not followed by a non-whitespace\n * character or are at the end of the query string. Furthermore, filter\n * unmatched quotation marks.\n *\n * 3. Trim excess whitespace from left and right.\n *\n * @param query - Query value\n *\n * @returns Transformed query value\n */\nexport function defaultTransform(query: string): string {\n return query\n .split(/\"([^\"]+)\"/g) /* => 1 */\n .map((terms, index) => index & 1\n ? terms.replace(/^\\b|^(?![^\\x00-\\x7F]|$)|\\s+/g, \" +\")\n : terms\n )\n .join(\"\")\n .replace(/\"|(?:^|\\s+)[*+\\-:^~]+(?=\\s+|$)/g, \"\") /* => 2 */\n .trim() /* => 3 */\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { SearchIndex, SearchResult } from \"../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search message type\n */\nexport const enum SearchMessageType {\n SETUP, /* Search index setup */\n READY, /* Search index ready */\n QUERY, /* Search query */\n RESULT /* Search results */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Message containing the data necessary to setup the search index\n */\nexport interface SearchSetupMessage {\n type: SearchMessageType.SETUP /* Message type */\n data: SearchIndex /* Message data */\n}\n\n/**\n * Message indicating the search index is ready\n */\nexport interface SearchReadyMessage {\n type: SearchMessageType.READY /* Message type */\n}\n\n/**\n * Message containing a search query\n */\nexport interface SearchQueryMessage {\n type: SearchMessageType.QUERY /* Message type */\n data: string /* Message data */\n}\n\n/**\n * Message containing results for a search query\n */\nexport interface SearchResultMessage {\n type: SearchMessageType.RESULT /* Message type */\n data: SearchResult /* Message data */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Message exchanged with the search worker\n */\nexport type SearchMessage =\n | SearchSetupMessage\n | SearchReadyMessage\n | SearchQueryMessage\n | SearchResultMessage\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Type guard for search setup messages\n *\n * @param message - Search worker message\n *\n * @returns Test result\n */\nexport function isSearchSetupMessage(\n message: SearchMessage\n): message is SearchSetupMessage {\n return message.type === SearchMessageType.SETUP\n}\n\n/**\n * Type guard for search ready messages\n *\n * @param message - Search worker message\n *\n * @returns Test result\n */\nexport function isSearchReadyMessage(\n message: SearchMessage\n): message is SearchReadyMessage {\n return message.type === SearchMessageType.READY\n}\n\n/**\n * Type guard for search query messages\n *\n * @param message - Search worker message\n *\n * @returns Test result\n */\nexport function isSearchQueryMessage(\n message: SearchMessage\n): message is SearchQueryMessage {\n return message.type === SearchMessageType.QUERY\n}\n\n/**\n * Type guard for search result messages\n *\n * @param message - Search worker message\n *\n * @returns Test result\n */\nexport function isSearchResultMessage(\n message: SearchMessage\n): message is SearchResultMessage {\n return message.type === SearchMessageType.RESULT\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n ObservableInput,\n Subject,\n from,\n map,\n share\n} from \"rxjs\"\n\nimport { configuration, feature, translation } from \"~/_\"\nimport { WorkerHandler, watchWorker } from \"~/browser\"\n\nimport { SearchIndex } from \"../../_\"\nimport {\n SearchOptions,\n SearchPipeline\n} from \"../../options\"\nimport {\n SearchMessage,\n SearchMessageType,\n SearchSetupMessage,\n isSearchResultMessage\n} from \"../message\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search worker\n */\nexport type SearchWorker = WorkerHandler\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set up search index\n *\n * @param data - Search index\n *\n * @returns Search index\n */\nfunction setupSearchIndex({ config, docs }: SearchIndex): SearchIndex {\n\n /* Override default language with value from translation */\n if (config.lang.length === 1 && config.lang[0] === \"en\")\n config.lang = [\n translation(\"search.config.lang\")\n ]\n\n /* Override default separator with value from translation */\n if (config.separator === \"[\\\\s\\\\-]+\")\n config.separator = translation(\"search.config.separator\")\n\n /* Set pipeline from translation */\n const pipeline = translation(\"search.config.pipeline\")\n .split(/\\s*,\\s*/)\n .filter(Boolean) as SearchPipeline\n\n /* Determine search options */\n const options: SearchOptions = {\n pipeline,\n suggestions: feature(\"search.suggest\")\n }\n\n /* Return search index after defaulting */\n return { config, docs, options }\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set up search worker\n *\n * This function creates a web worker to set up and query the search index,\n * which is done using Lunr.js. The index must be passed as an observable to\n * enable hacks like _localsearch_ via search index embedding as JSON.\n *\n * @param url - Worker URL\n * @param index - Search index observable input\n *\n * @returns Search worker\n */\nexport function setupSearchWorker(\n url: string, index: ObservableInput\n): SearchWorker {\n const config = configuration()\n const worker = new Worker(url)\n\n /* Create communication channels and resolve relative links */\n const tx$ = new Subject()\n const rx$ = watchWorker(worker, { tx$ })\n .pipe(\n map(message => {\n if (isSearchResultMessage(message)) {\n for (const result of message.data.items)\n for (const document of result)\n document.location = `${new URL(document.location, config.base)}`\n }\n return message\n }),\n share()\n )\n\n /* Set up search index */\n from(index)\n .pipe(\n map(data => ({\n type: SearchMessageType.SETUP,\n data: setupSearchIndex(data)\n } as SearchSetupMessage))\n )\n .subscribe(tx$.next.bind(tx$))\n\n /* Return search worker */\n return { tx$, rx$ }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { combineLatest, map } from \"rxjs\"\n\nimport { configuration } from \"~/_\"\nimport {\n getElement,\n requestJSON\n} from \"~/browser\"\nimport { getComponentElements } from \"~/components\"\nimport {\n Version,\n renderVersionSelector\n} from \"~/templates\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Set up version selector\n */\nexport function setupVersionSelector(): void {\n const config = configuration()\n const versions$ = requestJSON(\n new URL(\"../versions.json\", config.base)\n )\n\n /* Determine current version */\n const current$ = versions$\n .pipe(\n map(versions => {\n const [, current] = config.base.match(/([^/]+)\\/?$/)!\n return versions.find(({ version, aliases }) => (\n version === current || aliases.includes(current)\n )) || versions[0]\n })\n )\n\n /* Render version selector and warning */\n combineLatest([versions$, current$])\n .subscribe(([versions, current]) => {\n const topic = getElement(\".md-header__topic\")\n topic.appendChild(renderVersionSelector(versions, current))\n\n /* Check if version state was already determined */\n if (__md_get(\"__outdated\", sessionStorage) === null) {\n const latest = config.version?.default || \"latest\"\n const outdated = !current.aliases.includes(latest)\n\n /* Persist version state in session storage */\n __md_set(\"__outdated\", outdated, sessionStorage)\n if (outdated)\n for (const warning of getComponentElements(\"outdated\"))\n warning.hidden = false\n }\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n combineLatest,\n delay,\n distinctUntilChanged,\n distinctUntilKeyChanged,\n filter,\n finalize,\n fromEvent,\n map,\n merge,\n shareReplay,\n startWith,\n take,\n takeLast,\n takeUntil,\n tap\n} from \"rxjs\"\n\nimport { translation } from \"~/_\"\nimport {\n getLocation,\n setToggle,\n watchElementFocus\n} from \"~/browser\"\nimport {\n SearchMessageType,\n SearchQueryMessage,\n SearchWorker,\n defaultTransform,\n isSearchReadyMessage\n} from \"~/integrations\"\n\nimport { Component } from \"../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search query\n */\nexport interface SearchQuery {\n value: string /* Query value */\n focus: boolean /* Query focus */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch search query\n *\n * Note that the focus event which triggers re-reading the current query value\n * is delayed by `1ms` so the input's empty state is allowed to propagate.\n *\n * @param el - Search query element\n * @param worker - Search worker\n *\n * @returns Search query observable\n */\nexport function watchSearchQuery(\n el: HTMLInputElement, { rx$ }: SearchWorker\n): Observable {\n const fn = __search?.transform || defaultTransform\n\n /* Immediately show search dialog */\n const { searchParams } = getLocation()\n if (searchParams.has(\"q\"))\n setToggle(\"search\", true)\n\n /* Intercept query parameter (deep link) */\n const param$ = rx$\n .pipe(\n filter(isSearchReadyMessage),\n take(1),\n map(() => searchParams.get(\"q\") || \"\")\n )\n\n /* Set query from parameter */\n param$.subscribe(value => { // TODO: not ideal - find a better way\n if (value)\n el.value = value\n })\n\n /* Intercept focus and input events */\n const focus$ = watchElementFocus(el)\n const value$ = merge(\n fromEvent(el, \"keyup\"),\n fromEvent(el, \"focus\").pipe(delay(1)),\n param$\n )\n .pipe(\n map(() => fn(el.value)),\n startWith(\"\"),\n distinctUntilChanged(),\n )\n\n /* Combine into single observable */\n return combineLatest([value$, focus$])\n .pipe(\n map(([value, focus]) => ({ value, focus })),\n shareReplay(1)\n )\n}\n\n/**\n * Mount search query\n *\n * @param el - Search query element\n * @param worker - Search worker\n *\n * @returns Search query component observable\n */\nexport function mountSearchQuery(\n el: HTMLInputElement, { tx$, rx$ }: SearchWorker\n): Observable> {\n const push$ = new Subject()\n\n /* Handle value changes */\n push$\n .pipe(\n distinctUntilKeyChanged(\"value\"),\n map(({ value }): SearchQueryMessage => ({\n type: SearchMessageType.QUERY,\n data: value\n }))\n )\n .subscribe(tx$.next.bind(tx$))\n\n /* Handle focus changes */\n push$\n .pipe(\n distinctUntilKeyChanged(\"focus\")\n )\n .subscribe(({ focus }) => {\n if (focus) {\n setToggle(\"search\", focus)\n el.placeholder = \"\"\n } else {\n el.placeholder = translation(\"search.placeholder\")\n }\n })\n\n /* Handle reset */\n fromEvent(el.form!, \"reset\")\n .pipe(\n takeUntil(push$.pipe(takeLast(1)))\n )\n .subscribe(() => el.focus())\n\n /* Create and return component */\n return watchSearchQuery(el, { tx$, rx$ })\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n bufferCount,\n filter,\n finalize,\n map,\n merge,\n of,\n skipUntil,\n switchMap,\n take,\n tap,\n withLatestFrom,\n zipWith\n} from \"rxjs\"\n\nimport { translation } from \"~/_\"\nimport {\n getElement,\n watchElementBoundary\n} from \"~/browser\"\nimport {\n SearchResult,\n SearchWorker,\n isSearchReadyMessage,\n isSearchResultMessage\n} from \"~/integrations\"\nimport { renderSearchResultItem } from \"~/templates\"\nimport { round } from \"~/utilities\"\n\nimport { Component } from \"../../_\"\nimport { SearchQuery } from \"../query\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount options\n */\ninterface MountOptions {\n query$: Observable /* Search query observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount search result list\n *\n * This function performs a lazy rendering of the search results, depending on\n * the vertical offset of the search result container.\n *\n * @param el - Search result list element\n * @param worker - Search worker\n * @param options - Options\n *\n * @returns Search result list component observable\n */\nexport function mountSearchResult(\n el: HTMLElement, { rx$ }: SearchWorker, { query$ }: MountOptions\n): Observable> {\n const push$ = new Subject()\n const boundary$ = watchElementBoundary(el.parentElement!)\n .pipe(\n filter(Boolean)\n )\n\n /* Retrieve nested components */\n const meta = getElement(\":scope > :first-child\", el)\n const list = getElement(\":scope > :last-child\", el)\n\n /* Wait until search is ready */\n const ready$ = rx$\n .pipe(\n filter(isSearchReadyMessage),\n take(1)\n )\n\n /* Update search result metadata */\n push$\n .pipe(\n withLatestFrom(query$),\n skipUntil(ready$)\n )\n .subscribe(([{ items }, { value }]) => {\n if (value) {\n switch (items.length) {\n\n /* No results */\n case 0:\n meta.textContent = translation(\"search.result.none\")\n break\n\n /* One result */\n case 1:\n meta.textContent = translation(\"search.result.one\")\n break\n\n /* Multiple result */\n default:\n meta.textContent = translation(\n \"search.result.other\",\n round(items.length)\n )\n }\n } else {\n meta.textContent = translation(\"search.result.placeholder\")\n }\n })\n\n /* Update search result list */\n push$\n .pipe(\n tap(() => list.innerHTML = \"\"),\n switchMap(({ items }) => merge(\n of(...items.slice(0, 10)),\n of(...items.slice(10))\n .pipe(\n bufferCount(4),\n zipWith(boundary$),\n switchMap(([chunk]) => of(...chunk))\n )\n ))\n )\n .subscribe(result => list.appendChild(\n renderSearchResultItem(result)\n ))\n\n /* Filter search result message */\n const result$ = rx$\n .pipe(\n filter(isSearchResultMessage),\n map(({ data }) => data)\n )\n\n /* Create and return component */\n return result$\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n finalize,\n fromEvent,\n map,\n tap\n} from \"rxjs\"\n\nimport { getLocation } from \"~/browser\"\n\nimport { Component } from \"../../_\"\nimport { SearchQuery } from \"../query\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search sharing\n */\nexport interface SearchShare {\n url: URL /* Deep link for sharing */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n query$: Observable /* Search query observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n query$: Observable /* Search query observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount search sharing\n *\n * @param _el - Search sharing element\n * @param options - Options\n *\n * @returns Search sharing observable\n */\nexport function watchSearchShare(\n _el: HTMLElement, { query$ }: WatchOptions\n): Observable {\n return query$\n .pipe(\n map(({ value }) => {\n const url = getLocation()\n url.hash = \"\"\n url.searchParams.delete(\"h\")\n url.searchParams.set(\"q\", value)\n return { url }\n })\n )\n}\n\n/**\n * Mount search sharing\n *\n * @param el - Search sharing element\n * @param options - Options\n *\n * @returns Search sharing component observable\n */\nexport function mountSearchShare(\n el: HTMLAnchorElement, options: MountOptions\n): Observable> {\n const push$ = new Subject()\n push$.subscribe(({ url }) => {\n el.setAttribute(\"data-clipboard-text\", el.href)\n el.href = `${url}`\n })\n\n /* Prevent following of link */\n fromEvent(el, \"click\")\n .subscribe(ev => ev.preventDefault())\n\n /* Create and return component */\n return watchSearchShare(el, options)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n asyncScheduler,\n combineLatestWith,\n distinctUntilChanged,\n filter,\n finalize,\n fromEvent,\n map,\n merge,\n observeOn,\n tap\n} from \"rxjs\"\n\nimport { Keyboard } from \"~/browser\"\nimport {\n SearchResult,\n SearchWorker,\n isSearchResultMessage\n} from \"~/integrations\"\n\nimport { Component, getComponentElement } from \"../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search suggestions\n */\nexport interface SearchSuggest {}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount options\n */\ninterface MountOptions {\n keyboard$: Observable /* Keyboard observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount search suggestions\n *\n * This function will perform a lazy rendering of the search results, depending\n * on the vertical offset of the search result container.\n *\n * @param el - Search result list element\n * @param worker - Search worker\n * @param options - Options\n *\n * @returns Search result list component observable\n */\nexport function mountSearchSuggest(\n el: HTMLElement, { rx$ }: SearchWorker, { keyboard$ }: MountOptions\n): Observable> {\n const push$ = new Subject()\n\n /* Retrieve query component and track all changes */\n const query = getComponentElement(\"search-query\")\n const query$ = merge(\n fromEvent(query, \"keydown\"),\n fromEvent(query, \"focus\")\n )\n .pipe(\n observeOn(asyncScheduler),\n map(() => query.value),\n distinctUntilChanged(),\n )\n\n /* Update search suggestions */\n push$\n .pipe(\n combineLatestWith(query$),\n map(([{ suggestions }, value]) => {\n const words = value.split(/([\\s-]+)/)\n if (suggestions?.length && words[words.length - 1]) {\n const last = suggestions[suggestions.length - 1]\n if (last.startsWith(words[words.length - 1]))\n words[words.length - 1] = last\n } else {\n words.length = 0\n }\n return words\n })\n )\n .subscribe(words => el.innerHTML = words\n .join(\"\")\n .replace(/\\s/g, \" \")\n )\n\n /* Set up search keyboard handlers */\n keyboard$\n .pipe(\n filter(({ mode }) => mode === \"search\")\n )\n .subscribe(key => {\n switch (key.type) {\n\n /* Right arrow: accept current suggestion */\n case \"ArrowRight\":\n if (\n el.innerText.length &&\n query.selectionStart === query.value.length\n )\n query.value = el.innerText\n break\n }\n })\n\n /* Filter search result message */\n const result$ = rx$\n .pipe(\n filter(isSearchResultMessage),\n map(({ data }) => data)\n )\n\n /* Create and return component */\n return result$\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(() => ({ ref: el }))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n NEVER,\n Observable,\n ObservableInput,\n filter,\n merge,\n mergeWith,\n sample,\n take\n} from \"rxjs\"\n\nimport { configuration } from \"~/_\"\nimport {\n Keyboard,\n getActiveElement,\n getElements,\n setToggle\n} from \"~/browser\"\nimport {\n SearchIndex,\n SearchResult,\n isSearchQueryMessage,\n isSearchReadyMessage,\n setupSearchWorker\n} from \"~/integrations\"\n\nimport {\n Component,\n getComponentElement,\n getComponentElements\n} from \"../../_\"\nimport {\n SearchQuery,\n mountSearchQuery\n} from \"../query\"\nimport { mountSearchResult } from \"../result\"\nimport {\n SearchShare,\n mountSearchShare\n} from \"../share\"\nimport {\n SearchSuggest,\n mountSearchSuggest\n} from \"../suggest\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search\n */\nexport type Search =\n | SearchQuery\n | SearchResult\n | SearchShare\n | SearchSuggest\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount options\n */\ninterface MountOptions {\n index$: ObservableInput /* Search index observable */\n keyboard$: Observable /* Keyboard observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount search\n *\n * This function sets up the search functionality, including the underlying\n * web worker and all keyboard bindings.\n *\n * @param el - Search element\n * @param options - Options\n *\n * @returns Search component observable\n */\nexport function mountSearch(\n el: HTMLElement, { index$, keyboard$ }: MountOptions\n): Observable> {\n const config = configuration()\n try {\n const url = __search?.worker || config.search\n const worker = setupSearchWorker(url, index$)\n\n /* Retrieve query and result components */\n const query = getComponentElement(\"search-query\", el)\n const result = getComponentElement(\"search-result\", el)\n\n /* Re-emit query when search is ready */\n const { tx$, rx$ } = worker\n tx$\n .pipe(\n filter(isSearchQueryMessage),\n sample(rx$.pipe(filter(isSearchReadyMessage))),\n take(1)\n )\n .subscribe(tx$.next.bind(tx$))\n\n /* Set up search keyboard handlers */\n keyboard$\n .pipe(\n filter(({ mode }) => mode === \"search\")\n )\n .subscribe(key => {\n const active = getActiveElement()\n switch (key.type) {\n\n /* Enter: go to first (best) result */\n case \"Enter\":\n if (active === query) {\n const anchors = new Map()\n for (const anchor of getElements(\n \":first-child [href]\", result\n )) {\n const article = anchor.firstElementChild!\n anchors.set(anchor, parseFloat(\n article.getAttribute(\"data-md-score\")!\n ))\n }\n\n /* Go to result with highest score, if any */\n if (anchors.size) {\n const [[best]] = [...anchors].sort(([, a], [, b]) => b - a)\n best.click()\n }\n\n /* Otherwise omit form submission */\n key.claim()\n }\n break\n\n /* Escape or Tab: close search */\n case \"Escape\":\n case \"Tab\":\n setToggle(\"search\", false)\n query.blur()\n break\n\n /* Vertical arrows: select previous or next search result */\n case \"ArrowUp\":\n case \"ArrowDown\":\n if (typeof active === \"undefined\") {\n query.focus()\n } else {\n const els = [query, ...getElements(\n \":not(details) > [href], summary, details[open] [href]\",\n result\n )]\n const i = Math.max(0, (\n Math.max(0, els.indexOf(active)) + els.length + (\n key.type === \"ArrowUp\" ? -1 : +1\n )\n ) % els.length)\n els[i].focus()\n }\n\n /* Prevent scrolling of page */\n key.claim()\n break\n\n /* All other keys: hand to search query */\n default:\n if (query !== getActiveElement())\n query.focus()\n }\n })\n\n /* Set up global keyboard handlers */\n keyboard$\n .pipe(\n filter(({ mode }) => mode === \"global\"),\n )\n .subscribe(key => {\n switch (key.type) {\n\n /* Open search and select query */\n case \"f\":\n case \"s\":\n case \"/\":\n query.focus()\n query.select()\n\n /* Prevent scrolling of page */\n key.claim()\n break\n }\n })\n\n /* Create and return component */\n const query$ = mountSearchQuery(query, worker)\n const result$ = mountSearchResult(result, worker, { query$ })\n return merge(query$, result$)\n .pipe(\n mergeWith(\n\n /* Search sharing */\n ...getComponentElements(\"search-share\", el)\n .map(child => mountSearchShare(child, { query$ })),\n\n /* Search suggestions */\n ...getComponentElements(\"search-suggest\", el)\n .map(child => mountSearchSuggest(child, worker, { keyboard$ }))\n )\n )\n\n /* Gracefully handle broken search */\n } catch (err) {\n el.hidden = true\n return NEVER\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n ObservableInput,\n combineLatest,\n filter,\n map,\n startWith\n} from \"rxjs\"\n\nimport { getLocation } from \"~/browser\"\nimport {\n SearchIndex,\n setupSearchHighlighter\n} from \"~/integrations\"\nimport { h } from \"~/utilities\"\n\nimport { Component } from \"../../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search highlighting\n */\nexport interface SearchHighlight {\n nodes: Map /* Map of replacements */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount options\n */\ninterface MountOptions {\n index$: ObservableInput /* Search index observable */\n location$: Observable /* Location observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Mount search highlighting\n *\n * @param el - Content element\n * @param options - Options\n *\n * @returns Search highlighting component observable\n */\nexport function mountSearchHiglight(\n el: HTMLElement, { index$, location$ }: MountOptions\n): Observable> {\n return combineLatest([\n index$,\n location$\n .pipe(\n startWith(getLocation()),\n filter(url => !!url.searchParams.get(\"h\"))\n )\n ])\n .pipe(\n map(([index, url]) => setupSearchHighlighter(index.config, true)(\n url.searchParams.get(\"h\")!\n )),\n map(fn => {\n const nodes = new Map()\n\n /* Traverse text nodes and collect matches */\n const it = document.createNodeIterator(el, NodeFilter.SHOW_TEXT)\n for (let node = it.nextNode(); node; node = it.nextNode()) {\n if (node.parentElement?.offsetHeight) {\n const original = node.textContent!\n const replaced = fn(original)\n if (replaced.length > original.length)\n nodes.set(node as ChildNode, replaced)\n }\n }\n\n /* Replace original nodes with matches */\n for (const [node, text] of nodes) {\n const { childNodes } = h(\"span\", null, text)\n node.replaceWith(...Array.from(childNodes))\n }\n\n /* Return component */\n return { ref: el, nodes }\n })\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n animationFrameScheduler,\n auditTime,\n combineLatest,\n defer,\n distinctUntilChanged,\n finalize,\n map,\n tap,\n withLatestFrom\n} from \"rxjs\"\n\nimport {\n Viewport,\n getElement,\n getElementOffset\n} from \"~/browser\"\n\nimport { Component } from \"../_\"\nimport { Header } from \"../header\"\nimport { Main } from \"../main\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Sidebar\n */\nexport interface Sidebar {\n height: number /* Sidebar height */\n locked: boolean /* Sidebar is locked */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n main$: Observable
    /* Main area observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n main$: Observable
    /* Main area observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch sidebar\n *\n * This function returns an observable that computes the visual parameters of\n * the sidebar which depends on the vertical viewport offset, as well as the\n * height of the main area. When the page is scrolled beyond the header, the\n * sidebar is locked and fills the remaining space.\n *\n * @param el - Sidebar element\n * @param options - Options\n *\n * @returns Sidebar observable\n */\nexport function watchSidebar(\n el: HTMLElement, { viewport$, main$ }: WatchOptions\n): Observable {\n const parent = el.parentElement!\n const adjust =\n parent.offsetTop -\n parent.parentElement!.offsetTop\n\n /* Compute the sidebar's available height and if it should be locked */\n return combineLatest([main$, viewport$])\n .pipe(\n map(([{ offset, height }, { offset: { y } }]) => {\n height = height\n + Math.min(adjust, Math.max(0, y - offset))\n - adjust\n return {\n height,\n locked: y >= offset + adjust\n }\n }),\n distinctUntilChanged((a, b) => (\n a.height === b.height &&\n a.locked === b.locked\n ))\n )\n}\n\n/**\n * Mount sidebar\n *\n * This function doesn't set the height of the actual sidebar, but of its first\n * child \u2013 the `.md-sidebar__scrollwrap` element in order to mitigiate jittery\n * sidebars when the footer is scrolled into view. At some point we switched\n * from `absolute` / `fixed` positioning to `sticky` positioning, significantly\n * reducing jitter in some browsers (respectively Firefox and Safari) when\n * scrolling from the top. However, top-aligned sticky positioning means that\n * the sidebar snaps to the bottom when the end of the container is reached.\n * This is what leads to the mentioned jitter, as the sidebar's height may be\n * updated too slowly.\n *\n * This behaviour can be mitigiated by setting the height of the sidebar to `0`\n * while preserving the padding, and the height on its first element.\n *\n * @param el - Sidebar element\n * @param options - Options\n *\n * @returns Sidebar component observable\n */\nexport function mountSidebar(\n el: HTMLElement, { header$, ...options }: MountOptions\n): Observable> {\n const inner = getElement(\".md-sidebar__scrollwrap\", el)\n const { y } = getElementOffset(inner)\n return defer(() => {\n const push$ = new Subject()\n push$\n .pipe(\n auditTime(0, animationFrameScheduler),\n withLatestFrom(header$)\n )\n .subscribe({\n\n /* Handle emission */\n next([{ height }, { height: offset }]) {\n inner.style.height = `${height - 2 * y}px`\n el.style.top = `${offset}px`\n },\n\n /* Handle complete */\n complete() {\n inner.style.height = \"\"\n el.style.top = \"\"\n }\n })\n\n /* Create and return component */\n return watchSidebar(el, options)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { Repo, User } from \"github-types\"\nimport {\n Observable,\n defaultIfEmpty,\n map,\n zip\n} from \"rxjs\"\n\nimport { requestJSON } from \"~/browser\"\n\nimport { SourceFacts } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * GitHub release (partial)\n */\ninterface Release {\n tag_name: string /* Tag name */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Fetch GitHub repository facts\n *\n * @param user - GitHub user or organization\n * @param repo - GitHub repository\n *\n * @returns Repository facts observable\n */\nexport function fetchSourceFactsFromGitHub(\n user: string, repo?: string\n): Observable {\n if (typeof repo !== \"undefined\") {\n const url = `https://api.github.com/repos/${user}/${repo}`\n return zip(\n\n /* Fetch version */\n requestJSON(`${url}/releases/latest`)\n .pipe(\n map(release => ({\n version: release.tag_name\n })),\n defaultIfEmpty({})\n ),\n\n /* Fetch stars and forks */\n requestJSON(url)\n .pipe(\n map(info => ({\n stars: info.stargazers_count,\n forks: info.forks_count\n })),\n defaultIfEmpty({})\n )\n )\n .pipe(\n map(([release, info]) => ({ ...release, ...info }))\n )\n\n /* User or organization */\n } else {\n const url = `https://api.github.com/users/${user}`\n return requestJSON(url)\n .pipe(\n map(info => ({\n repositories: info.public_repos\n })),\n defaultIfEmpty({})\n )\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { ProjectSchema } from \"gitlab\"\nimport {\n Observable,\n defaultIfEmpty,\n map\n} from \"rxjs\"\n\nimport { requestJSON } from \"~/browser\"\n\nimport { SourceFacts } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Fetch GitLab repository facts\n *\n * @param base - GitLab base\n * @param project - GitLab project\n *\n * @returns Repository facts observable\n */\nexport function fetchSourceFactsFromGitLab(\n base: string, project: string\n): Observable {\n const url = `https://${base}/api/v4/projects/${encodeURIComponent(project)}`\n return requestJSON(url)\n .pipe(\n map(({ star_count, forks_count }) => ({\n stars: star_count,\n forks: forks_count\n })),\n defaultIfEmpty({})\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport { EMPTY, Observable } from \"rxjs\"\n\nimport { fetchSourceFactsFromGitHub } from \"../github\"\nimport { fetchSourceFactsFromGitLab } from \"../gitlab\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Repository facts for repositories\n */\nexport interface RepositoryFacts {\n stars?: number /* Number of stars */\n forks?: number /* Number of forks */\n version?: string /* Latest version */\n}\n\n/**\n * Repository facts for organizations\n */\nexport interface OrganizationFacts {\n repositories?: number /* Number of repositories */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Repository facts\n */\nexport type SourceFacts =\n | RepositoryFacts\n | OrganizationFacts\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Fetch repository facts\n *\n * @param url - Repository URL\n *\n * @returns Repository facts observable\n */\nexport function fetchSourceFacts(\n url: string\n): Observable {\n const [type] = url.match(/(git(?:hub|lab))/i) || []\n switch (type.toLowerCase()) {\n\n /* GitHub repository */\n case \"github\":\n const [, user, repo] = url.match(/^.+github\\.com\\/([^/]+)\\/?([^/]+)?/i)!\n return fetchSourceFactsFromGitHub(user, repo)\n\n /* GitLab repository */\n case \"gitlab\":\n const [, base, slug] = url.match(/^.+?([^/]*gitlab[^/]+)\\/(.+?)\\/?$/i)!\n return fetchSourceFactsFromGitLab(base, slug)\n\n /* Everything else */\n default:\n return EMPTY\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n EMPTY,\n Observable,\n Subject,\n catchError,\n defer,\n filter,\n finalize,\n map,\n of,\n shareReplay,\n tap\n} from \"rxjs\"\n\nimport { getElement } from \"~/browser\"\nimport { renderSourceFacts } from \"~/templates\"\n\nimport { Component } from \"../../_\"\nimport {\n SourceFacts,\n fetchSourceFacts\n} from \"../facts\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Repository information\n */\nexport interface Source {\n facts: SourceFacts /* Repository facts */\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Repository information observable\n */\nlet fetch$: Observable\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch repository information\n *\n * This function tries to read the repository facts from session storage, and\n * if unsuccessful, fetches them from the underlying provider.\n *\n * @param el - Repository information element\n *\n * @returns Repository information observable\n */\nexport function watchSource(\n el: HTMLAnchorElement\n): Observable {\n return fetch$ ||= defer(() => {\n const cached = __md_get(\"__source\", sessionStorage)\n if (cached)\n return of(cached)\n else\n return fetchSourceFacts(el.href)\n .pipe(\n tap(facts => __md_set(\"__source\", facts, sessionStorage))\n )\n })\n .pipe(\n catchError(() => EMPTY),\n filter(facts => Object.keys(facts).length > 0),\n map(facts => ({ facts })),\n shareReplay(1)\n )\n}\n\n/**\n * Mount repository information\n *\n * @param el - Repository information element\n *\n * @returns Repository information component observable\n */\nexport function mountSource(\n el: HTMLAnchorElement\n): Observable> {\n const inner = getElement(\":scope > :last-child\", el)\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe(({ facts }) => {\n inner.appendChild(renderSourceFacts(facts))\n inner.setAttribute(\"data-md-state\", \"done\")\n })\n\n /* Create and return component */\n return watchSource(el)\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n defer,\n distinctUntilKeyChanged,\n finalize,\n map,\n of,\n switchMap,\n tap\n} from \"rxjs\"\n\nimport { feature } from \"~/_\"\nimport {\n Viewport,\n watchElementSize,\n watchViewportAt\n} from \"~/browser\"\n\nimport { Component } from \"../_\"\nimport { Header } from \"../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Navigation tabs\n */\nexport interface Tabs {\n hidden: boolean /* Navigation tabs are hidden */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch navigation tabs\n *\n * @param el - Navigation tabs element\n * @param options - Options\n *\n * @returns Navigation tabs observable\n */\nexport function watchTabs(\n el: HTMLElement, { viewport$, header$ }: WatchOptions\n): Observable {\n return watchElementSize(document.body)\n .pipe(\n switchMap(() => watchViewportAt(el, { header$, viewport$ })),\n map(({ offset: { y } }) => {\n return {\n hidden: y >= 10\n }\n }),\n distinctUntilKeyChanged(\"hidden\")\n )\n}\n\n/**\n * Mount navigation tabs\n *\n * This function hides the navigation tabs when scrolling past the threshold\n * and makes them reappear in a nice CSS animation when scrolling back up.\n *\n * @param el - Navigation tabs element\n * @param options - Options\n *\n * @returns Navigation tabs component observable\n */\nexport function mountTabs(\n el: HTMLElement, options: MountOptions\n): Observable> {\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe({\n\n /* Handle emission */\n next({ hidden }) {\n if (hidden)\n el.setAttribute(\"data-md-state\", \"hidden\")\n else\n el.removeAttribute(\"data-md-state\")\n },\n\n /* Handle complete */\n complete() {\n el.removeAttribute(\"data-md-state\")\n }\n })\n\n /* Create and return component */\n return (\n feature(\"navigation.tabs.sticky\")\n ? of({ hidden: false })\n : watchTabs(el, options)\n )\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n bufferCount,\n combineLatest,\n debounceTime,\n defer,\n distinctUntilChanged,\n distinctUntilKeyChanged,\n finalize,\n map,\n of,\n scan,\n startWith,\n switchMap,\n takeLast,\n takeUntil,\n tap,\n withLatestFrom\n} from \"rxjs\"\n\nimport { feature } from \"~/_\"\nimport {\n Viewport,\n getElements,\n getLocation,\n getOptionalElement,\n watchElementSize\n} from \"~/browser\"\n\nimport { Component } from \"../_\"\nimport { Header } from \"../header\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Table of contents\n */\nexport interface TableOfContents {\n prev: HTMLAnchorElement[][] /* Anchors (previous) */\n next: HTMLAnchorElement[][] /* Anchors (next) */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch table of contents\n *\n * This is effectively a scroll spy implementation which will account for the\n * fixed header and automatically re-calculate anchor offsets when the viewport\n * is resized. The returned observable will only emit if the table of contents\n * needs to be repainted.\n *\n * This implementation tracks an anchor element's entire path starting from its\n * level up to the top-most anchor element, e.g. `[h3, h2, h1]`. Although the\n * Material theme currently doesn't make use of this information, it enables\n * the styling of the entire hierarchy through customization.\n *\n * Note that the current anchor is the last item of the `prev` anchor list.\n *\n * @param el - Table of contents element\n * @param options - Options\n *\n * @returns Table of contents observable\n */\nexport function watchTableOfContents(\n el: HTMLElement, { viewport$, header$ }: WatchOptions\n): Observable {\n const table = new Map()\n\n /* Compute anchor-to-target mapping */\n const anchors = getElements(\"[href^=\\\\#]\", el)\n for (const anchor of anchors) {\n const id = decodeURIComponent(anchor.hash.substring(1))\n const target = getOptionalElement(`[id=\"${id}\"]`)\n if (typeof target !== \"undefined\")\n table.set(anchor, target)\n }\n\n /* Compute necessary adjustment for header */\n const adjust$ = header$\n .pipe(\n map(header => 24 + header.height)\n )\n\n /* Compute partition of previous and next anchors */\n const partition$ = watchElementSize(document.body)\n .pipe(\n distinctUntilKeyChanged(\"height\"),\n\n /* Build index to map anchor paths to vertical offsets */\n switchMap(body => defer(() => {\n let path: HTMLAnchorElement[] = []\n return of([...table].reduce((index, [anchor, target]) => {\n while (path.length) {\n const last = table.get(path[path.length - 1])!\n if (last.tagName >= target.tagName) {\n path.pop()\n } else {\n break\n }\n }\n\n /* If the current anchor is hidden, continue with its parent */\n let offset = target.offsetTop\n while (!offset && target.parentElement) {\n target = target.parentElement\n offset = target.offsetTop\n }\n\n /* Map reversed anchor path to vertical offset */\n return index.set(\n [...path = [...path, anchor]].reverse(),\n offset\n )\n }, new Map()))\n })\n .pipe(\n\n /* Sort index by vertical offset (see https://bit.ly/30z6QSO) */\n map(index => new Map([...index].sort(([, a], [, b]) => a - b))),\n\n /* Re-compute partition when viewport offset changes */\n switchMap(index => combineLatest([viewport$, adjust$])\n .pipe(\n scan(([prev, next], [{ offset: { y }, size }, adjust]) => {\n const last = y + size.height >= Math.floor(body.height)\n\n /* Look forward */\n while (next.length) {\n const [, offset] = next[0]\n if (offset - adjust < y || last) {\n prev = [...prev, next.shift()!]\n } else {\n break\n }\n }\n\n /* Look backward */\n while (prev.length) {\n const [, offset] = prev[prev.length - 1]\n if (offset - adjust >= y && !last) {\n next = [prev.pop()!, ...next]\n } else {\n break\n }\n }\n\n /* Return partition */\n return [prev, next]\n }, [[], [...index]]),\n distinctUntilChanged((a, b) => (\n a[0] === b[0] &&\n a[1] === b[1]\n ))\n )\n )\n )\n )\n )\n\n /* Compute and return anchor list migrations */\n return partition$\n .pipe(\n map(([prev, next]) => ({\n prev: prev.map(([path]) => path),\n next: next.map(([path]) => path)\n })),\n\n /* Extract anchor list migrations */\n startWith({ prev: [], next: [] }),\n bufferCount(2, 1),\n map(([a, b]) => {\n\n /* Moving down */\n if (a.prev.length < b.prev.length) {\n return {\n prev: b.prev.slice(Math.max(0, a.prev.length - 1), b.prev.length),\n next: []\n }\n\n /* Moving up */\n } else {\n return {\n prev: b.prev.slice(-1),\n next: b.next.slice(0, b.next.length - a.next.length)\n }\n }\n })\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount table of contents\n *\n * @param el - Table of contents element\n * @param options - Options\n *\n * @returns Table of contents component observable\n */\nexport function mountTableOfContents(\n el: HTMLElement, { viewport$, header$ }: MountOptions\n): Observable> {\n return defer(() => {\n const push$ = new Subject()\n push$.subscribe(({ prev, next }) => {\n\n /* Look forward */\n for (const [anchor] of next) {\n anchor.removeAttribute(\"data-md-state\")\n anchor.classList.remove(\n \"md-nav__link--active\"\n )\n }\n\n /* Look backward */\n for (const [index, [anchor]] of prev.entries()) {\n anchor.setAttribute(\"data-md-state\", \"blur\")\n anchor.classList.toggle(\n \"md-nav__link--active\",\n index === prev.length - 1\n )\n }\n })\n\n /* Set up anchor tracking, if enabled */\n if (feature(\"navigation.tracking\"))\n viewport$\n .pipe(\n takeUntil(push$.pipe(takeLast(1))),\n distinctUntilKeyChanged(\"offset\"),\n debounceTime(250),\n withLatestFrom(push$)\n )\n .subscribe(([, { prev }]) => {\n const url = getLocation()\n\n /* Set hash fragment to active anchor */\n const anchor = prev[prev.length - 1]\n if (anchor && anchor.length) {\n const [active] = anchor\n const { hash } = new URL(active.href)\n if (url.hash !== hash) {\n url.hash = hash\n history.replaceState({}, \"\", `${url}`)\n }\n\n /* Reset anchor when at the top */\n } else {\n url.hash = \"\"\n history.replaceState({}, \"\", `${url}`)\n }\n })\n\n /* Create and return component */\n return watchTableOfContents(el, { viewport$, header$ })\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n Subject,\n bufferCount,\n combineLatest,\n distinctUntilChanged,\n distinctUntilKeyChanged,\n endWith,\n finalize,\n map,\n repeat,\n skip,\n takeLast,\n takeUntil,\n tap\n} from \"rxjs\"\n\nimport { Viewport } from \"~/browser\"\n\nimport { Component } from \"../_\"\nimport { Header } from \"../header\"\nimport { Main } from \"../main\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Back-to-top button\n */\nexport interface BackToTop {\n hidden: boolean /* Back-to-top button is hidden */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch options\n */\ninterface WatchOptions {\n viewport$: Observable /* Viewport observable */\n main$: Observable
    /* Main area observable */\n target$: Observable /* Location target observable */\n}\n\n/**\n * Mount options\n */\ninterface MountOptions {\n viewport$: Observable /* Viewport observable */\n header$: Observable
    /* Header observable */\n main$: Observable
    /* Main area observable */\n target$: Observable /* Location target observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Watch back-to-top\n *\n * @param _el - Back-to-top element\n * @param options - Options\n *\n * @returns Back-to-top observable\n */\nexport function watchBackToTop(\n _el: HTMLElement, { viewport$, main$, target$ }: WatchOptions\n): Observable {\n\n /* Compute direction */\n const direction$ = viewport$\n .pipe(\n map(({ offset: { y } }) => y),\n bufferCount(2, 1),\n map(([a, b]) => a > b && b > 0),\n distinctUntilChanged()\n )\n\n /* Compute whether main area is active */\n const active$ = main$\n .pipe(\n map(({ active }) => active)\n )\n\n /* Compute threshold for hiding */\n return combineLatest([active$, direction$])\n .pipe(\n map(([active, direction]) => !(active && direction)),\n distinctUntilChanged(),\n takeUntil(target$.pipe(skip(1))),\n endWith(true),\n repeat({ delay: 250 }),\n map(hidden => ({ hidden }))\n )\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Mount back-to-top\n *\n * @param el - Back-to-top element\n * @param options - Options\n *\n * @returns Back-to-top component observable\n */\nexport function mountBackToTop(\n el: HTMLElement, { viewport$, header$, main$, target$ }: MountOptions\n): Observable> {\n const push$ = new Subject()\n push$.subscribe({\n\n /* Handle emission */\n next({ hidden }) {\n if (hidden) {\n el.setAttribute(\"data-md-state\", \"hidden\")\n el.setAttribute(\"tabindex\", \"-1\")\n el.blur()\n } else {\n el.removeAttribute(\"data-md-state\")\n el.removeAttribute(\"tabindex\")\n }\n },\n\n /* Handle complete */\n complete() {\n el.style.top = \"\"\n el.setAttribute(\"data-md-state\", \"hidden\")\n el.removeAttribute(\"tabindex\")\n }\n })\n\n /* Watch header height */\n header$\n .pipe(\n takeUntil(push$.pipe(endWith(0), takeLast(1))),\n distinctUntilKeyChanged(\"height\")\n )\n .subscribe(({ height }) => {\n el.style.top = `${height + 16}px`\n })\n\n /* Create and return component */\n return watchBackToTop(el, { viewport$, main$, target$ })\n .pipe(\n tap(state => push$.next(state)),\n finalize(() => push$.complete()),\n map(state => ({ ref: el, ...state }))\n )\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n fromEvent,\n mapTo,\n mergeMap,\n of,\n switchMap,\n takeWhile,\n tap,\n withLatestFrom\n} from \"rxjs\"\n\nimport { getElements } from \"~/browser\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Patch options\n */\ninterface PatchOptions {\n document$: Observable /* Document observable */\n tablet$: Observable /* Media tablet observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Patch indeterminate checkboxes\n *\n * This function replaces the indeterminate \"pseudo state\" with the actual\n * indeterminate state, which is used to keep navigation always expanded.\n *\n * @param options - Options\n */\nexport function patchIndeterminate(\n { document$, tablet$ }: PatchOptions\n): void {\n document$\n .pipe(\n switchMap(() => of(...getElements(\n \"[data-md-state=indeterminate]\"\n ))),\n tap(el => {\n el.indeterminate = true\n el.checked = false\n }),\n mergeMap(el => fromEvent(el, \"change\")\n .pipe(\n takeWhile(() => el.hasAttribute(\"data-md-state\")),\n mapTo(el)\n )\n ),\n withLatestFrom(tablet$)\n )\n .subscribe(([el, tablet]) => {\n el.removeAttribute(\"data-md-state\")\n if (tablet)\n el.checked = false\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n filter,\n fromEvent,\n mapTo,\n mergeMap,\n of,\n switchMap,\n tap\n} from \"rxjs\"\n\nimport { getElements } from \"~/browser\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Patch options\n */\ninterface PatchOptions {\n document$: Observable /* Document observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Check whether the given device is an Apple device\n *\n * @returns Test result\n */\nfunction isAppleDevice(): boolean {\n return /(iPad|iPhone|iPod)/.test(navigator.userAgent)\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Patch all elements with `data-md-scrollfix` attributes\n *\n * This is a year-old patch which ensures that overflow scrolling works at the\n * top and bottom of containers on iOS by ensuring a `1px` scroll offset upon\n * the start of a touch event.\n *\n * @see https://bit.ly/2SCtAOO - Original source\n *\n * @param options - Options\n */\nexport function patchScrollfix(\n { document$ }: PatchOptions\n): void {\n document$\n .pipe(\n switchMap(() => of(...getElements(\"[data-md-scrollfix]\"))),\n tap(el => el.removeAttribute(\"data-md-scrollfix\")),\n filter(isAppleDevice),\n mergeMap(el => fromEvent(el, \"touchstart\")\n .pipe(\n mapTo(el)\n )\n )\n )\n .subscribe(el => {\n const top = el.scrollTop\n\n /* We're at the top of the container */\n if (top === 0) {\n el.scrollTop = 1\n\n /* We're at the bottom of the container */\n } else if (top + el.offsetHeight === el.scrollHeight) {\n el.scrollTop = top - 1\n }\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n Observable,\n combineLatest,\n delay,\n map,\n of,\n switchMap,\n withLatestFrom\n} from \"rxjs\"\n\nimport {\n Viewport,\n watchToggle\n} from \"~/browser\"\n\n/* ----------------------------------------------------------------------------\n * Helper types\n * ------------------------------------------------------------------------- */\n\n/**\n * Patch options\n */\ninterface PatchOptions {\n viewport$: Observable /* Viewport observable */\n tablet$: Observable /* Media tablet observable */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Patch the document body to lock when search is open\n *\n * For mobile and tablet viewports, the search is rendered full screen, which\n * leads to scroll leaking when at the top or bottom of the search result. This\n * function locks the body when the search is in full screen mode, and restores\n * the scroll position when leaving.\n *\n * @param options - Options\n */\nexport function patchScrolllock(\n { viewport$, tablet$ }: PatchOptions\n): void {\n combineLatest([watchToggle(\"search\"), tablet$])\n .pipe(\n map(([active, tablet]) => active && !tablet),\n switchMap(active => of(active)\n .pipe(\n delay(active ? 400 : 100)\n )\n ),\n withLatestFrom(viewport$)\n )\n .subscribe(([active, { offset: { y }}]) => {\n if (active) {\n document.body.setAttribute(\"data-md-state\", \"lock\")\n document.body.style.top = `-${y}px`\n } else {\n const value = -1 * parseInt(document.body.style.top, 10)\n document.body.removeAttribute(\"data-md-state\")\n document.body.style.top = \"\"\n if (value)\n window.scrollTo(0, value)\n }\n })\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Polyfills\n * ------------------------------------------------------------------------- */\n\n/* Polyfill `Object.entries` */\nif (!Object.entries)\n Object.entries = function (obj: object) {\n const data: [string, string][] = []\n for (const key of Object.keys(obj))\n // @ts-expect-error - ignore property access warning\n data.push([key, obj[key]])\n\n /* Return entries */\n return data\n }\n\n/* Polyfill `Object.values` */\nif (!Object.values)\n Object.values = function (obj: object) {\n const data: string[] = []\n for (const key of Object.keys(obj))\n // @ts-expect-error - ignore property access warning\n data.push(obj[key])\n\n /* Return values */\n return data\n }\n\n/* ------------------------------------------------------------------------- */\n\n/* Polyfills for `Element` */\nif (typeof Element !== \"undefined\") {\n\n /* Polyfill `Element.scrollTo` */\n if (!Element.prototype.scrollTo)\n Element.prototype.scrollTo = function (\n x?: ScrollToOptions | number, y?: number\n ): void {\n if (typeof x === \"object\") {\n this.scrollLeft = x.left!\n this.scrollTop = x.top!\n } else {\n this.scrollLeft = x!\n this.scrollTop = y!\n }\n }\n\n /* Polyfill `Element.replaceWith` */\n if (!Element.prototype.replaceWith)\n Element.prototype.replaceWith = function (\n ...nodes: Array\n ): void {\n const parent = this.parentNode\n if (parent) {\n if (nodes.length === 0)\n parent.removeChild(this)\n\n /* Replace children and create text nodes */\n for (let i = nodes.length - 1; i >= 0; i--) {\n let node = nodes[i]\n if (typeof node !== \"object\")\n node = document.createTextNode(node)\n else if (node.parentNode)\n node.parentNode.removeChild(node)\n\n /* Replace child or insert before previous sibling */\n if (!i)\n parent.replaceChild(node, this)\n else\n parent.insertBefore(this.previousSibling!, node)\n }\n }\n }\n}\n"], + "mappings": "4iCAAA,oBAAC,UAAU,EAAQ,EAAS,CAC1B,MAAO,KAAY,UAAY,MAAO,KAAW,YAAc,IAC/D,MAAO,SAAW,YAAc,OAAO,IAAM,OAAO,GACnD,MACD,GAAO,UAAY,CAAE,aASrB,WAAmC,EAAO,CACxC,GAAI,GAAmB,GACnB,EAA0B,GAC1B,EAAiC,KAEjC,EAAsB,CACxB,KAAM,GACN,OAAQ,GACR,IAAK,GACL,IAAK,GACL,MAAO,GACP,SAAU,GACV,OAAQ,GACR,KAAM,GACN,MAAO,GACP,KAAM,GACN,KAAM,GACN,SAAU,GACV,iBAAkB,IAQpB,WAA4B,EAAI,CAC9B,MACE,MACA,IAAO,UACP,EAAG,WAAa,QAChB,EAAG,WAAa,QAChB,aAAe,IACf,YAAc,GAAG,WAcrB,WAAuC,EAAI,CACzC,GAAI,IAAO,EAAG,KACV,GAAU,EAAG,QAUjB,MARI,QAAY,SAAW,EAAoB,KAAS,CAAC,EAAG,UAIxD,KAAY,YAAc,CAAC,EAAG,UAI9B,EAAG,mBAYT,WAA8B,EAAI,CAChC,AAAI,EAAG,UAAU,SAAS,kBAG1B,GAAG,UAAU,IAAI,iBACjB,EAAG,aAAa,2BAA4B,KAQ9C,WAAiC,EAAI,CACnC,AAAI,CAAC,EAAG,aAAa,6BAGrB,GAAG,UAAU,OAAO,iBACpB,EAAG,gBAAgB,6BAWrB,WAAmB,EAAG,CACpB,AAAI,EAAE,SAAW,EAAE,QAAU,EAAE,SAI3B,GAAmB,EAAM,gBAC3B,EAAqB,EAAM,eAG7B,EAAmB,IAWrB,WAAuB,EAAG,CACxB,EAAmB,GAUrB,WAAiB,EAAG,CAElB,AAAI,CAAC,EAAmB,EAAE,SAItB,IAAoB,EAA8B,EAAE,UACtD,EAAqB,EAAE,QAQ3B,WAAgB,EAAG,CACjB,AAAI,CAAC,EAAmB,EAAE,SAKxB,GAAE,OAAO,UAAU,SAAS,kBAC5B,EAAE,OAAO,aAAa,8BAMtB,GAA0B,GAC1B,OAAO,aAAa,GACpB,EAAiC,OAAO,WAAW,UAAW,CAC5D,EAA0B,IACzB,KACH,EAAwB,EAAE,SAS9B,WAA4B,EAAG,CAC7B,AAAI,SAAS,kBAAoB,UAK3B,IACF,GAAmB,IAErB,KAUJ,YAA0C,CACxC,SAAS,iBAAiB,YAAa,GACvC,SAAS,iBAAiB,YAAa,GACvC,SAAS,iBAAiB,UAAW,GACrC,SAAS,iBAAiB,cAAe,GACzC,SAAS,iBAAiB,cAAe,GACzC,SAAS,iBAAiB,YAAa,GACvC,SAAS,iBAAiB,YAAa,GACvC,SAAS,iBAAiB,aAAc,GACxC,SAAS,iBAAiB,WAAY,GAGxC,YAA6C,CAC3C,SAAS,oBAAoB,YAAa,GAC1C,SAAS,oBAAoB,YAAa,GAC1C,SAAS,oBAAoB,UAAW,GACxC,SAAS,oBAAoB,cAAe,GAC5C,SAAS,oBAAoB,cAAe,GAC5C,SAAS,oBAAoB,YAAa,GAC1C,SAAS,oBAAoB,YAAa,GAC1C,SAAS,oBAAoB,aAAc,GAC3C,SAAS,oBAAoB,WAAY,GAU3C,WAA8B,EAAG,CAG/B,AAAI,EAAE,OAAO,UAAY,EAAE,OAAO,SAAS,gBAAkB,QAI7D,GAAmB,GACnB,KAMF,SAAS,iBAAiB,UAAW,EAAW,IAChD,SAAS,iBAAiB,YAAa,EAAe,IACtD,SAAS,iBAAiB,cAAe,EAAe,IACxD,SAAS,iBAAiB,aAAc,EAAe,IACvD,SAAS,iBAAiB,mBAAoB,EAAoB,IAElE,IAMA,EAAM,iBAAiB,QAAS,EAAS,IACzC,EAAM,iBAAiB,OAAQ,EAAQ,IAOvC,AAAI,EAAM,WAAa,KAAK,wBAA0B,EAAM,KAI1D,EAAM,KAAK,aAAa,wBAAyB,IACxC,EAAM,WAAa,KAAK,eACjC,UAAS,gBAAgB,UAAU,IAAI,oBACvC,SAAS,gBAAgB,aAAa,wBAAyB,KAOnE,GAAI,MAAO,SAAW,aAAe,MAAO,WAAa,YAAa,CAIpE,OAAO,0BAA4B,EAInC,GAAI,GAEJ,GAAI,CACF,EAAQ,GAAI,aAAY,sCACjB,EAAP,CAEA,EAAQ,SAAS,YAAY,eAC7B,EAAM,gBAAgB,+BAAgC,GAAO,GAAO,IAGtE,OAAO,cAAc,GAGvB,AAAI,MAAO,WAAa,aAGtB,EAA0B,cCpT9B,eAAC,UAAS,EAAQ,CAOhB,GAAI,GAA6B,UAAW,CAC1C,GAAI,CACF,MAAO,CAAC,CAAC,OAAO,eACT,EAAP,CACA,MAAO,KAKP,EAAoB,IAEpB,EAAiB,SAAS,EAAO,CACnC,GAAI,GAAW,CACb,KAAM,UAAW,CACf,GAAI,GAAQ,EAAM,QAClB,MAAO,CAAE,KAAM,IAAU,OAAQ,MAAO,KAI5C,MAAI,IACF,GAAS,OAAO,UAAY,UAAW,CACrC,MAAO,KAIJ,GAOL,EAAiB,SAAS,EAAO,CACnC,MAAO,oBAAmB,GAAO,QAAQ,OAAQ,MAG/C,EAAmB,SAAS,EAAO,CACrC,MAAO,oBAAmB,OAAO,GAAO,QAAQ,MAAO,OAGrD,EAA0B,UAAW,CAEvC,GAAI,GAAkB,SAAS,EAAc,CAC3C,OAAO,eAAe,KAAM,WAAY,CAAE,SAAU,GAAM,MAAO,KACjE,GAAI,GAAqB,MAAO,GAEhC,GAAI,IAAuB,YAEpB,GAAI,IAAuB,SAChC,AAAI,IAAiB,IACnB,KAAK,YAAY,WAEV,YAAwB,GAAiB,CAClD,GAAI,GAAQ,KACZ,EAAa,QAAQ,SAAS,EAAO,EAAM,CACzC,EAAM,OAAO,EAAM,aAEX,IAAiB,MAAU,IAAuB,SAC5D,GAAI,OAAO,UAAU,SAAS,KAAK,KAAkB,iBACnD,OAAS,GAAI,EAAG,EAAI,EAAa,OAAQ,IAAK,CAC5C,GAAI,GAAQ,EAAa,GACzB,GAAK,OAAO,UAAU,SAAS,KAAK,KAAW,kBAAsB,EAAM,SAAW,EACpF,KAAK,OAAO,EAAM,GAAI,EAAM,QAE5B,MAAM,IAAI,WAAU,4CAA8C,EAAI,mCAI1E,QAAS,KAAO,GACd,AAAI,EAAa,eAAe,IAC9B,KAAK,OAAO,EAAK,EAAa,QAKpC,MAAM,IAAI,WAAU,iDAIpB,EAAQ,EAAgB,UAE5B,EAAM,OAAS,SAAS,EAAM,EAAO,CACnC,AAAI,IAAQ,MAAK,SACf,KAAK,SAAS,GAAM,KAAK,OAAO,IAEhC,KAAK,SAAS,GAAQ,CAAC,OAAO,KAIlC,EAAM,OAAS,SAAS,EAAM,CAC5B,MAAO,MAAK,SAAS,IAGvB,EAAM,IAAM,SAAS,EAAM,CACzB,MAAQ,KAAQ,MAAK,SAAY,KAAK,SAAS,GAAM,GAAK,MAG5D,EAAM,OAAS,SAAS,EAAM,CAC5B,MAAQ,KAAQ,MAAK,SAAY,KAAK,SAAS,GAAM,MAAM,GAAK,IAGlE,EAAM,IAAM,SAAS,EAAM,CACzB,MAAQ,KAAQ,MAAK,UAGvB,EAAM,IAAM,SAAS,EAAM,EAAO,CAChC,KAAK,SAAS,GAAQ,CAAC,OAAO,KAGhC,EAAM,QAAU,SAAS,EAAU,EAAS,CAC1C,GAAI,GACJ,OAAS,KAAQ,MAAK,SACpB,GAAI,KAAK,SAAS,eAAe,GAAO,CACtC,EAAU,KAAK,SAAS,GACxB,OAAS,GAAI,EAAG,EAAI,EAAQ,OAAQ,IAClC,EAAS,KAAK,EAAS,EAAQ,GAAI,EAAM,QAMjD,EAAM,KAAO,UAAW,CACtB,GAAI,GAAQ,GACZ,YAAK,QAAQ,SAAS,EAAO,EAAM,CACjC,EAAM,KAAK,KAEN,EAAe,IAGxB,EAAM,OAAS,UAAW,CACxB,GAAI,GAAQ,GACZ,YAAK,QAAQ,SAAS,EAAO,CAC3B,EAAM,KAAK,KAEN,EAAe,IAGxB,EAAM,QAAU,UAAW,CACzB,GAAI,GAAQ,GACZ,YAAK,QAAQ,SAAS,EAAO,EAAM,CACjC,EAAM,KAAK,CAAC,EAAM,MAEb,EAAe,IAGpB,GACF,GAAM,OAAO,UAAY,EAAM,SAGjC,EAAM,SAAW,UAAW,CAC1B,GAAI,GAAc,GAClB,YAAK,QAAQ,SAAS,EAAO,EAAM,CACjC,EAAY,KAAK,EAAe,GAAQ,IAAM,EAAe,MAExD,EAAY,KAAK,MAI1B,EAAO,gBAAkB,GAGvB,EAAkC,UAAW,CAC/C,GAAI,CACF,GAAI,GAAkB,EAAO,gBAE7B,MACG,IAAI,GAAgB,QAAQ,aAAe,OAC3C,MAAO,GAAgB,UAAU,KAAQ,YACzC,MAAO,GAAgB,UAAU,SAAY,iBAEzC,EAAP,CACA,MAAO,KAIX,AAAK,KACH,IAGF,GAAI,GAAQ,EAAO,gBAAgB,UAEnC,AAAI,MAAO,GAAM,MAAS,YACxB,GAAM,KAAO,UAAW,CACtB,GAAI,GAAQ,KACR,EAAQ,GACZ,KAAK,QAAQ,SAAS,EAAO,EAAM,CACjC,EAAM,KAAK,CAAC,EAAM,IACb,EAAM,UACT,EAAM,OAAO,KAGjB,EAAM,KAAK,SAAS,EAAG,EAAG,CACxB,MAAI,GAAE,GAAK,EAAE,GACJ,GACE,EAAE,GAAK,EAAE,GACX,EAEA,IAGP,EAAM,UACR,GAAM,SAAW,IAEnB,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,KAAK,OAAO,EAAM,GAAG,GAAI,EAAM,GAAG,MAKpC,MAAO,GAAM,aAAgB,YAC/B,OAAO,eAAe,EAAO,cAAe,CAC1C,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,SAAS,EAAc,CAC5B,GAAI,KAAK,SACP,KAAK,SAAW,OACX,CACL,GAAI,GAAO,GACX,KAAK,QAAQ,SAAS,EAAO,EAAM,CACjC,EAAK,KAAK,KAEZ,OAAS,GAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,KAAK,OAAO,EAAK,IAIrB,EAAe,EAAa,QAAQ,MAAO,IAG3C,OAFI,GAAa,EAAa,MAAM,KAChC,EACK,EAAI,EAAG,EAAI,EAAW,OAAQ,IACrC,EAAY,EAAW,GAAG,MAAM,KAChC,KAAK,OACH,EAAiB,EAAU,IAC1B,EAAU,OAAS,EAAK,EAAiB,EAAU,IAAM,SAUnE,MAAO,SAAW,YAAe,OAC5B,MAAO,SAAW,YAAe,OACjC,MAAO,OAAS,YAAe,KAAO,IAG9C,AAAC,UAAS,EAAQ,CAOhB,GAAI,GAAwB,UAAW,CACrC,GAAI,CACF,GAAI,GAAI,GAAI,GAAO,IAAI,IAAK,YAC5B,SAAE,SAAW,MACL,EAAE,OAAS,kBAAqB,EAAE,mBACnC,EAAP,CACA,MAAO,KAKP,EAAc,UAAW,CAC3B,GAAI,GAAO,EAAO,IAEd,EAAM,SAAS,EAAK,EAAM,CAC5B,AAAI,MAAO,IAAQ,UAAU,GAAM,OAAO,IACtC,GAAQ,MAAO,IAAS,UAAU,GAAO,OAAO,IAGpD,GAAI,GAAM,SAAU,EACpB,GAAI,GAAS,GAAO,WAAa,QAAU,IAAS,EAAO,SAAS,MAAO,CACzE,EAAO,EAAK,cACZ,EAAM,SAAS,eAAe,mBAAmB,IACjD,EAAc,EAAI,cAAc,QAChC,EAAY,KAAO,EACnB,EAAI,KAAK,YAAY,GACrB,GAAI,CACF,GAAI,EAAY,KAAK,QAAQ,KAAU,EAAG,KAAM,IAAI,OAAM,EAAY,YAC/D,EAAP,CACA,KAAM,IAAI,OAAM,0BAA4B,EAAO,WAAa,IAIpE,GAAI,GAAgB,EAAI,cAAc,KACtC,EAAc,KAAO,EACjB,GACF,GAAI,KAAK,YAAY,GACrB,EAAc,KAAO,EAAc,MAGrC,GAAI,GAAe,EAAI,cAAc,SAIrC,GAHA,EAAa,KAAO,MACpB,EAAa,MAAQ,EAEjB,EAAc,WAAa,KAAO,CAAC,IAAI,KAAK,EAAc,OAAU,CAAC,EAAa,iBAAmB,CAAC,EACxG,KAAM,IAAI,WAAU,eAGtB,OAAO,eAAe,KAAM,iBAAkB,CAC5C,MAAO,IAKT,GAAI,GAAe,GAAI,GAAO,gBAAgB,KAAK,QAC/C,EAAqB,GACrB,EAA2B,GAC3B,EAAQ,KACZ,CAAC,SAAU,SAAU,OAAO,QAAQ,SAAS,EAAY,CACvD,GAAI,IAAS,EAAa,GAC1B,EAAa,GAAc,UAAW,CACpC,GAAO,MAAM,EAAc,WACvB,GACF,GAA2B,GAC3B,EAAM,OAAS,EAAa,WAC5B,EAA2B,OAKjC,OAAO,eAAe,KAAM,eAAgB,CAC1C,MAAO,EACP,WAAY,KAGd,GAAI,GAAS,OACb,OAAO,eAAe,KAAM,sBAAuB,CACjD,WAAY,GACZ,aAAc,GACd,SAAU,GACV,MAAO,UAAW,CAChB,AAAI,KAAK,SAAW,GAClB,GAAS,KAAK,OACV,GACF,GAAqB,GACrB,KAAK,aAAa,YAAY,KAAK,QACnC,EAAqB,SAO3B,EAAQ,EAAI,UAEZ,EAA6B,SAAS,EAAe,CACvD,OAAO,eAAe,EAAO,EAAe,CAC1C,IAAK,UAAW,CACd,MAAO,MAAK,eAAe,IAE7B,IAAK,SAAS,EAAO,CACnB,KAAK,eAAe,GAAiB,GAEvC,WAAY,MAIhB,CAAC,OAAQ,OAAQ,WAAY,OAAQ,YAClC,QAAQ,SAAS,EAAe,CAC/B,EAA2B,KAG/B,OAAO,eAAe,EAAO,SAAU,CACrC,IAAK,UAAW,CACd,MAAO,MAAK,eAAe,QAE7B,IAAK,SAAS,EAAO,CACnB,KAAK,eAAe,OAAY,EAChC,KAAK,uBAEP,WAAY,KAGd,OAAO,iBAAiB,EAAO,CAE7B,SAAY,CACV,IAAK,UAAW,CACd,GAAI,GAAQ,KACZ,MAAO,WAAW,CAChB,MAAO,GAAM,QAKnB,KAAQ,CACN,IAAK,UAAW,CACd,MAAO,MAAK,eAAe,KAAK,QAAQ,MAAO,KAEjD,IAAK,SAAS,EAAO,CACnB,KAAK,eAAe,KAAO,EAC3B,KAAK,uBAEP,WAAY,IAGd,SAAY,CACV,IAAK,UAAW,CACd,MAAO,MAAK,eAAe,SAAS,QAAQ,SAAU,MAExD,IAAK,SAAS,EAAO,CACnB,KAAK,eAAe,SAAW,GAEjC,WAAY,IAGd,OAAU,CACR,IAAK,UAAW,CAEd,GAAI,GAAe,CAAE,QAAS,GAAI,SAAU,IAAK,OAAQ,IAAK,KAAK,eAAe,UAI9E,EAAkB,KAAK,eAAe,MAAQ,GAChD,KAAK,eAAe,OAAS,GAE/B,MAAO,MAAK,eAAe,SACzB,KACA,KAAK,eAAe,SACnB,GAAmB,IAAM,KAAK,eAAe,KAAQ,KAE1D,WAAY,IAGd,SAAY,CACV,IAAK,UAAW,CACd,MAAO,IAET,IAAK,SAAS,EAAO,GAErB,WAAY,IAGd,SAAY,CACV,IAAK,UAAW,CACd,MAAO,IAET,IAAK,SAAS,EAAO,GAErB,WAAY,MAIhB,EAAI,gBAAkB,SAAS,EAAM,CACnC,MAAO,GAAK,gBAAgB,MAAM,EAAM,YAG1C,EAAI,gBAAkB,SAAS,EAAK,CAClC,MAAO,GAAK,gBAAgB,MAAM,EAAM,YAG1C,EAAO,IAAM,GAQf,GAJK,KACH,IAGG,EAAO,WAAa,QAAW,CAAE,WAAY,GAAO,UAAW,CAClE,GAAI,GAAY,UAAW,CACzB,MAAO,GAAO,SAAS,SAAW,KAAO,EAAO,SAAS,SAAY,GAAO,SAAS,KAAQ,IAAM,EAAO,SAAS,KAAQ,KAG7H,GAAI,CACF,OAAO,eAAe,EAAO,SAAU,SAAU,CAC/C,IAAK,EACL,WAAY,WAEP,EAAP,CACA,YAAY,UAAW,CACrB,EAAO,SAAS,OAAS,KACxB,SAKN,MAAO,SAAW,YAAe,OAC5B,MAAO,SAAW,YAAe,OACjC,MAAO,OAAS,YAAe,KAAO,MC3e9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gFAeA,GAAI,IACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACA,GACJ,AAAC,UAAU,EAAS,CAChB,GAAI,GAAO,MAAO,SAAW,SAAW,OAAS,MAAO,OAAS,SAAW,KAAO,MAAO,OAAS,SAAW,KAAO,GACrH,AAAI,MAAO,SAAW,YAAc,OAAO,IACvC,OAAO,QAAS,CAAC,WAAY,SAAU,EAAS,CAAE,EAAQ,EAAe,EAAM,EAAe,OAE7F,AAAI,MAAO,KAAW,UAAY,MAAO,IAAO,SAAY,SAC7D,EAAQ,EAAe,EAAM,EAAe,GAAO,WAGnD,EAAQ,EAAe,IAE3B,WAAwB,EAAS,EAAU,CACvC,MAAI,KAAY,GACZ,CAAI,MAAO,QAAO,QAAW,WACzB,OAAO,eAAe,EAAS,aAAc,CAAE,MAAO,KAGtD,EAAQ,WAAa,IAGtB,SAAU,EAAI,EAAG,CAAE,MAAO,GAAQ,GAAM,EAAW,EAAS,EAAI,GAAK,MAGnF,SAAU,EAAU,CACjB,GAAI,GAAgB,OAAO,gBACtB,CAAE,UAAW,aAAgB,QAAS,SAAU,EAAG,EAAG,CAAE,EAAE,UAAY,IACvE,SAAU,EAAG,EAAG,CAAE,OAAS,KAAK,GAAG,AAAI,OAAO,UAAU,eAAe,KAAK,EAAG,IAAI,GAAE,GAAK,EAAE,KAEhG,GAAY,SAAU,EAAG,EAAG,CACxB,GAAI,MAAO,IAAM,YAAc,IAAM,KACjC,KAAM,IAAI,WAAU,uBAAyB,OAAO,GAAK,iCAC7D,EAAc,EAAG,GACjB,YAAc,CAAE,KAAK,YAAc,EACnC,EAAE,UAAY,IAAM,KAAO,OAAO,OAAO,GAAM,GAAG,UAAY,EAAE,UAAW,GAAI,KAGnF,GAAW,OAAO,QAAU,SAAU,EAAG,CACrC,OAAS,GAAG,EAAI,EAAG,EAAI,UAAU,OAAQ,EAAI,EAAG,IAAK,CACjD,EAAI,UAAU,GACd,OAAS,KAAK,GAAG,AAAI,OAAO,UAAU,eAAe,KAAK,EAAG,IAAI,GAAE,GAAK,EAAE,IAE9E,MAAO,IAGX,GAAS,SAAU,EAAG,EAAG,CACrB,GAAI,GAAI,GACR,OAAS,KAAK,GAAG,AAAI,OAAO,UAAU,eAAe,KAAK,EAAG,IAAM,EAAE,QAAQ,GAAK,GAC9E,GAAE,GAAK,EAAE,IACb,GAAI,GAAK,MAAQ,MAAO,QAAO,uBAA0B,WACrD,OAAS,GAAI,EAAG,EAAI,OAAO,sBAAsB,GAAI,EAAI,EAAE,OAAQ,IAC/D,AAAI,EAAE,QAAQ,EAAE,IAAM,GAAK,OAAO,UAAU,qBAAqB,KAAK,EAAG,EAAE,KACvE,GAAE,EAAE,IAAM,EAAE,EAAE,KAE1B,MAAO,IAGX,GAAa,SAAU,EAAY,EAAQ,EAAK,EAAM,CAClD,GAAI,GAAI,UAAU,OAAQ,EAAI,EAAI,EAAI,EAAS,IAAS,KAAO,EAAO,OAAO,yBAAyB,EAAQ,GAAO,EAAM,EAC3H,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,EAAI,QAAQ,SAAS,EAAY,EAAQ,EAAK,OACpH,QAAS,GAAI,EAAW,OAAS,EAAG,GAAK,EAAG,IAAK,AAAI,GAAI,EAAW,KAAI,GAAK,GAAI,EAAI,EAAE,GAAK,EAAI,EAAI,EAAE,EAAQ,EAAK,GAAK,EAAE,EAAQ,KAAS,GAChJ,MAAO,GAAI,GAAK,GAAK,OAAO,eAAe,EAAQ,EAAK,GAAI,GAGhE,GAAU,SAAU,EAAY,EAAW,CACvC,MAAO,UAAU,EAAQ,EAAK,CAAE,EAAU,EAAQ,EAAK,KAG3D,GAAa,SAAU,EAAa,EAAe,CAC/C,GAAI,MAAO,UAAY,UAAY,MAAO,SAAQ,UAAa,WAAY,MAAO,SAAQ,SAAS,EAAa,IAGpH,GAAY,SAAU,EAAS,EAAY,EAAG,EAAW,CACrD,WAAe,EAAO,CAAE,MAAO,aAAiB,GAAI,EAAQ,GAAI,GAAE,SAAU,EAAS,CAAE,EAAQ,KAC/F,MAAO,IAAK,IAAM,GAAI,UAAU,SAAU,EAAS,EAAQ,CACvD,WAAmB,EAAO,CAAE,GAAI,CAAE,EAAK,EAAU,KAAK,UAAkB,EAAP,CAAY,EAAO,IACpF,WAAkB,EAAO,CAAE,GAAI,CAAE,EAAK,EAAU,MAAS,UAAkB,EAAP,CAAY,EAAO,IACvF,WAAc,EAAQ,CAAE,EAAO,KAAO,EAAQ,EAAO,OAAS,EAAM,EAAO,OAAO,KAAK,EAAW,GAClG,EAAM,GAAY,EAAU,MAAM,EAAS,GAAc,KAAK,WAItE,GAAc,SAAU,EAAS,EAAM,CACnC,GAAI,GAAI,CAAE,MAAO,EAAG,KAAM,UAAW,CAAE,GAAI,EAAE,GAAK,EAAG,KAAM,GAAE,GAAI,MAAO,GAAE,IAAO,KAAM,GAAI,IAAK,IAAM,EAAG,EAAG,EAAG,EAC/G,MAAO,GAAI,CAAE,KAAM,EAAK,GAAI,MAAS,EAAK,GAAI,OAAU,EAAK,IAAM,MAAO,SAAW,YAAe,GAAE,OAAO,UAAY,UAAW,CAAE,MAAO,QAAU,EACvJ,WAAc,EAAG,CAAE,MAAO,UAAU,EAAG,CAAE,MAAO,GAAK,CAAC,EAAG,KACzD,WAAc,EAAI,CACd,GAAI,EAAG,KAAM,IAAI,WAAU,mCAC3B,KAAO,GAAG,GAAI,CACV,GAAI,EAAI,EAAG,GAAM,GAAI,EAAG,GAAK,EAAI,EAAE,OAAY,EAAG,GAAK,EAAE,OAAc,IAAI,EAAE,SAAc,EAAE,KAAK,GAAI,GAAK,EAAE,OAAS,CAAE,GAAI,EAAE,KAAK,EAAG,EAAG,KAAK,KAAM,MAAO,GAE3J,OADI,EAAI,EAAG,GAAG,GAAK,CAAC,EAAG,GAAK,EAAG,EAAE,QACzB,EAAG,QACF,OAAQ,GAAG,EAAI,EAAI,UACnB,GAAG,SAAE,QAAgB,CAAE,MAAO,EAAG,GAAI,KAAM,QAC3C,GAAG,EAAE,QAAS,EAAI,EAAG,GAAI,EAAK,CAAC,GAAI,aACnC,GAAG,EAAK,EAAE,IAAI,MAAO,EAAE,KAAK,MAAO,iBAEpC,GAAM,EAAI,EAAE,KAAM,IAAI,EAAE,OAAS,GAAK,EAAE,EAAE,OAAS,KAAQ,GAAG,KAAO,GAAK,EAAG,KAAO,GAAI,CAAE,EAAI,EAAG,SACjG,GAAI,EAAG,KAAO,GAAM,EAAC,GAAM,EAAG,GAAK,EAAE,IAAM,EAAG,GAAK,EAAE,IAAM,CAAE,EAAE,MAAQ,EAAG,GAAI,MAC9E,GAAI,EAAG,KAAO,GAAK,EAAE,MAAQ,EAAE,GAAI,CAAE,EAAE,MAAQ,EAAE,GAAI,EAAI,EAAI,MAC7D,GAAI,GAAK,EAAE,MAAQ,EAAE,GAAI,CAAE,EAAE,MAAQ,EAAE,GAAI,EAAE,IAAI,KAAK,GAAK,MAC3D,AAAI,EAAE,IAAI,EAAE,IAAI,MAChB,EAAE,KAAK,MAAO,SAEtB,EAAK,EAAK,KAAK,EAAS,SACnB,EAAP,CAAY,EAAK,CAAC,EAAG,GAAI,EAAI,SAAK,CAAU,EAAI,EAAI,EACtD,GAAI,EAAG,GAAK,EAAG,KAAM,GAAG,GAAI,MAAO,CAAE,MAAO,EAAG,GAAK,EAAG,GAAK,OAAQ,KAAM,MAIlF,GAAe,SAAS,EAAG,EAAG,CAC1B,OAAS,KAAK,GAAG,AAAI,IAAM,WAAa,CAAC,OAAO,UAAU,eAAe,KAAK,EAAG,IAAI,GAAgB,EAAG,EAAG,IAG/G,GAAkB,OAAO,OAAU,SAAS,EAAG,EAAG,EAAG,EAAI,CACrD,AAAI,IAAO,QAAW,GAAK,GAC3B,OAAO,eAAe,EAAG,EAAI,CAAE,WAAY,GAAM,IAAK,UAAW,CAAE,MAAO,GAAE,OAC1E,SAAS,EAAG,EAAG,EAAG,EAAI,CACxB,AAAI,IAAO,QAAW,GAAK,GAC3B,EAAE,GAAM,EAAE,IAGd,GAAW,SAAU,EAAG,CACpB,GAAI,GAAI,MAAO,SAAW,YAAc,OAAO,SAAU,EAAI,GAAK,EAAE,GAAI,EAAI,EAC5E,GAAI,EAAG,MAAO,GAAE,KAAK,GACrB,GAAI,GAAK,MAAO,GAAE,QAAW,SAAU,MAAO,CAC1C,KAAM,UAAY,CACd,MAAI,IAAK,GAAK,EAAE,QAAQ,GAAI,QACrB,CAAE,MAAO,GAAK,EAAE,KAAM,KAAM,CAAC,KAG5C,KAAM,IAAI,WAAU,EAAI,0BAA4B,oCAGxD,GAAS,SAAU,EAAG,EAAG,CACrB,GAAI,GAAI,MAAO,SAAW,YAAc,EAAE,OAAO,UACjD,GAAI,CAAC,EAAG,MAAO,GACf,GAAI,GAAI,EAAE,KAAK,GAAI,EAAG,EAAK,GAAI,EAC/B,GAAI,CACA,KAAQ,KAAM,QAAU,KAAM,IAAM,CAAE,GAAI,EAAE,QAAQ,MAAM,EAAG,KAAK,EAAE,aAEjE,EAAP,CAAgB,EAAI,CAAE,MAAO,UAC7B,CACI,GAAI,CACA,AAAI,GAAK,CAAC,EAAE,MAAS,GAAI,EAAE,SAAY,EAAE,KAAK,UAElD,CAAU,GAAI,EAAG,KAAM,GAAE,OAE7B,MAAO,IAIX,GAAW,UAAY,CACnB,OAAS,GAAK,GAAI,EAAI,EAAG,EAAI,UAAU,OAAQ,IAC3C,EAAK,EAAG,OAAO,GAAO,UAAU,KACpC,MAAO,IAIX,GAAiB,UAAY,CACzB,OAAS,GAAI,EAAG,EAAI,EAAG,EAAK,UAAU,OAAQ,EAAI,EAAI,IAAK,GAAK,UAAU,GAAG,OAC7E,OAAS,GAAI,MAAM,GAAI,EAAI,EAAG,EAAI,EAAG,EAAI,EAAI,IACzC,OAAS,GAAI,UAAU,GAAI,EAAI,EAAG,EAAK,EAAE,OAAQ,EAAI,EAAI,IAAK,IAC1D,EAAE,GAAK,EAAE,GACjB,MAAO,IAGX,GAAgB,SAAU,EAAI,EAAM,EAAM,CACtC,GAAI,GAAQ,UAAU,SAAW,EAAG,OAAS,GAAI,EAAG,EAAI,EAAK,OAAQ,EAAI,EAAI,EAAG,IAC5E,AAAI,IAAM,CAAE,KAAK,MACR,IAAI,GAAK,MAAM,UAAU,MAAM,KAAK,EAAM,EAAG,IAClD,EAAG,GAAK,EAAK,IAGrB,MAAO,GAAG,OAAO,GAAM,MAAM,UAAU,MAAM,KAAK,KAGtD,GAAU,SAAU,EAAG,CACnB,MAAO,gBAAgB,IAAW,MAAK,EAAI,EAAG,MAAQ,GAAI,IAAQ,IAGtE,GAAmB,SAAU,EAAS,EAAY,EAAW,CACzD,GAAI,CAAC,OAAO,cAAe,KAAM,IAAI,WAAU,wCAC/C,GAAI,GAAI,EAAU,MAAM,EAAS,GAAc,IAAK,EAAG,EAAI,GAC3D,MAAO,GAAI,GAAI,EAAK,QAAS,EAAK,SAAU,EAAK,UAAW,EAAE,OAAO,eAAiB,UAAY,CAAE,MAAO,OAAS,EACpH,WAAc,EAAG,CAAE,AAAI,EAAE,IAAI,GAAE,GAAK,SAAU,EAAG,CAAE,MAAO,IAAI,SAAQ,SAAU,EAAG,EAAG,CAAE,EAAE,KAAK,CAAC,EAAG,EAAG,EAAG,IAAM,GAAK,EAAO,EAAG,OAC9H,WAAgB,EAAG,EAAG,CAAE,GAAI,CAAE,EAAK,EAAE,GAAG,UAAc,EAAP,CAAY,EAAO,EAAE,GAAG,GAAI,IAC3E,WAAc,EAAG,CAAE,EAAE,gBAAiB,IAAU,QAAQ,QAAQ,EAAE,MAAM,GAAG,KAAK,EAAS,GAAU,EAAO,EAAE,GAAG,GAAI,GACnH,WAAiB,EAAO,CAAE,EAAO,OAAQ,GACzC,WAAgB,EAAO,CAAE,EAAO,QAAS,GACzC,WAAgB,EAAG,EAAG,CAAE,AAAI,EAAE,GAAI,EAAE,QAAS,EAAE,QAAQ,EAAO,EAAE,GAAG,GAAI,EAAE,GAAG,MAGhF,GAAmB,SAAU,EAAG,CAC5B,GAAI,GAAG,EACP,MAAO,GAAI,GAAI,EAAK,QAAS,EAAK,QAAS,SAAU,EAAG,CAAE,KAAM,KAAO,EAAK,UAAW,EAAE,OAAO,UAAY,UAAY,CAAE,MAAO,OAAS,EAC1I,WAAc,EAAG,EAAG,CAAE,EAAE,GAAK,EAAE,GAAK,SAAU,EAAG,CAAE,MAAQ,GAAI,CAAC,GAAK,CAAE,MAAO,GAAQ,EAAE,GAAG,IAAK,KAAM,IAAM,UAAa,EAAI,EAAE,GAAK,GAAO,IAG/I,GAAgB,SAAU,EAAG,CACzB,GAAI,CAAC,OAAO,cAAe,KAAM,IAAI,WAAU,wCAC/C,GAAI,GAAI,EAAE,OAAO,eAAgB,EACjC,MAAO,GAAI,EAAE,KAAK,GAAM,GAAI,MAAO,KAAa,WAAa,GAAS,GAAK,EAAE,OAAO,YAAa,EAAI,GAAI,EAAK,QAAS,EAAK,SAAU,EAAK,UAAW,EAAE,OAAO,eAAiB,UAAY,CAAE,MAAO,OAAS,GAC9M,WAAc,EAAG,CAAE,EAAE,GAAK,EAAE,IAAM,SAAU,EAAG,CAAE,MAAO,IAAI,SAAQ,SAAU,EAAS,EAAQ,CAAE,EAAI,EAAE,GAAG,GAAI,EAAO,EAAS,EAAQ,EAAE,KAAM,EAAE,UAChJ,WAAgB,EAAS,EAAQ,EAAG,EAAG,CAAE,QAAQ,QAAQ,GAAG,KAAK,SAAS,EAAG,CAAE,EAAQ,CAAE,MAAO,EAAG,KAAM,KAAS,KAGtH,GAAuB,SAAU,EAAQ,EAAK,CAC1C,MAAI,QAAO,eAAkB,OAAO,eAAe,EAAQ,MAAO,CAAE,MAAO,IAAiB,EAAO,IAAM,EAClG,GAGX,GAAI,GAAqB,OAAO,OAAU,SAAS,EAAG,EAAG,CACrD,OAAO,eAAe,EAAG,UAAW,CAAE,WAAY,GAAM,MAAO,KAC9D,SAAS,EAAG,EAAG,CAChB,EAAE,QAAa,GAGnB,GAAe,SAAU,EAAK,CAC1B,GAAI,GAAO,EAAI,WAAY,MAAO,GAClC,GAAI,GAAS,GACb,GAAI,GAAO,KAAM,OAAS,KAAK,GAAK,AAAI,IAAM,WAAa,OAAO,UAAU,eAAe,KAAK,EAAK,IAAI,GAAgB,EAAQ,EAAK,GACtI,SAAmB,EAAQ,GACpB,GAGX,GAAkB,SAAU,EAAK,CAC7B,MAAQ,IAAO,EAAI,WAAc,EAAM,CAAE,QAAW,IAGxD,GAAyB,SAAU,EAAU,EAAO,EAAM,EAAG,CACzD,GAAI,IAAS,KAAO,CAAC,EAAG,KAAM,IAAI,WAAU,iDAC5C,GAAI,MAAO,IAAU,WAAa,IAAa,GAAS,CAAC,EAAI,CAAC,EAAM,IAAI,GAAW,KAAM,IAAI,WAAU,4EACvG,MAAO,KAAS,IAAM,EAAI,IAAS,IAAM,EAAE,KAAK,GAAY,EAAI,EAAE,MAAQ,EAAM,IAAI,IAGxF,GAAyB,SAAU,EAAU,EAAO,EAAO,EAAM,EAAG,CAChE,GAAI,IAAS,IAAK,KAAM,IAAI,WAAU,kCACtC,GAAI,IAAS,KAAO,CAAC,EAAG,KAAM,IAAI,WAAU,iDAC5C,GAAI,MAAO,IAAU,WAAa,IAAa,GAAS,CAAC,EAAI,CAAC,EAAM,IAAI,GAAW,KAAM,IAAI,WAAU,2EACvG,MAAQ,KAAS,IAAM,EAAE,KAAK,EAAU,GAAS,EAAI,EAAE,MAAQ,EAAQ,EAAM,IAAI,EAAU,GAAS,GAGxG,EAAS,YAAa,IACtB,EAAS,WAAY,IACrB,EAAS,SAAU,IACnB,EAAS,aAAc,IACvB,EAAS,UAAW,IACpB,EAAS,aAAc,IACvB,EAAS,YAAa,IACtB,EAAS,cAAe,IACxB,EAAS,eAAgB,IACzB,EAAS,kBAAmB,IAC5B,EAAS,WAAY,IACrB,EAAS,SAAU,IACnB,EAAS,WAAY,IACrB,EAAS,iBAAkB,IAC3B,EAAS,gBAAiB,IAC1B,EAAS,UAAW,IACpB,EAAS,mBAAoB,IAC7B,EAAS,mBAAoB,IAC7B,EAAS,gBAAiB,IAC1B,EAAS,uBAAwB,IACjC,EAAS,eAAgB,IACzB,EAAS,kBAAmB,IAC5B,EAAS,yBAA0B,IACnC,EAAS,yBAA0B,QChTvC;AAAA;AAAA;AAAA;AAAA;AAAA,GAMA,AAAC,UAA0C,EAAM,EAAS,CACzD,AAAG,MAAO,KAAY,UAAY,MAAO,KAAW,SACnD,GAAO,QAAU,IACb,AAAG,MAAO,SAAW,YAAc,OAAO,IAC9C,OAAO,GAAI,GACP,AAAG,MAAO,KAAY,SAC1B,GAAQ,YAAiB,IAEzB,EAAK,YAAiB,MACrB,GAAM,UAAW,CACpB,MAAiB,WAAW,CAClB,GAAI,GAAuB,CAE/B,IACC,SAAS,EAAyB,EAAqB,EAAqB,CAEnF,aAGA,EAAoB,EAAE,EAAqB,CACzC,QAAW,UAAW,CAAE,MAAqB,OAI/C,GAAI,GAAe,EAAoB,KACnC,EAAoC,EAAoB,EAAE,GAE1D,EAAS,EAAoB,KAC7B,EAA8B,EAAoB,EAAE,GAEpD,EAAa,EAAoB,KACjC,EAA8B,EAAoB,EAAE,GAOxD,WAAiB,EAAM,CACrB,GAAI,CACF,MAAO,UAAS,YAAY,SACrB,EAAP,CACA,MAAO,IAYX,GAAI,GAAqB,SAA4B,EAAQ,CAC3D,GAAI,GAAe,IAAiB,GACpC,SAAQ,OACD,GAGwB,EAAe,EAOhD,WAA2B,EAAO,CAChC,GAAI,GAAQ,SAAS,gBAAgB,aAAa,SAAW,MACzD,EAAc,SAAS,cAAc,YAEzC,EAAY,MAAM,SAAW,OAE7B,EAAY,MAAM,OAAS,IAC3B,EAAY,MAAM,QAAU,IAC5B,EAAY,MAAM,OAAS,IAE3B,EAAY,MAAM,SAAW,WAC7B,EAAY,MAAM,EAAQ,QAAU,QAAU,UAE9C,GAAI,GAAY,OAAO,aAAe,SAAS,gBAAgB,UAC/D,SAAY,MAAM,IAAM,GAAG,OAAO,EAAW,MAC7C,EAAY,aAAa,WAAY,IACrC,EAAY,MAAQ,EACb,EAaT,GAAI,GAAsB,SAA6B,EAAQ,CAC7D,GAAI,GAAU,UAAU,OAAS,GAAK,UAAU,KAAO,OAAY,UAAU,GAAK,CAChF,UAAW,SAAS,MAElB,EAAe,GAEnB,GAAI,MAAO,IAAW,SAAU,CAC9B,GAAI,GAAc,EAAkB,GACpC,EAAQ,UAAU,YAAY,GAC9B,EAAe,IAAiB,GAChC,EAAQ,QACR,EAAY,aAEZ,GAAe,IAAiB,GAChC,EAAQ,QAGV,MAAO,IAGwB,EAAgB,EAEjD,WAAiB,EAAK,CAA6B,MAAI,OAAO,SAAW,YAAc,MAAO,QAAO,UAAa,SAAY,EAAU,SAAiB,EAAK,CAAE,MAAO,OAAO,IAAiB,EAAU,SAAiB,EAAK,CAAE,MAAO,IAAO,MAAO,SAAW,YAAc,EAAI,cAAgB,QAAU,IAAQ,OAAO,UAAY,SAAW,MAAO,IAAiB,EAAQ,GAUnX,GAAI,GAAyB,UAAkC,CAC7D,GAAI,GAAU,UAAU,OAAS,GAAK,UAAU,KAAO,OAAY,UAAU,GAAK,GAE9E,EAAkB,EAAQ,OAC1B,EAAS,IAAoB,OAAS,OAAS,EAC/C,EAAY,EAAQ,UACpB,EAAS,EAAQ,OACjB,GAAO,EAAQ,KAEnB,GAAI,IAAW,QAAU,IAAW,MAClC,KAAM,IAAI,OAAM,sDAIlB,GAAI,IAAW,OACb,GAAI,GAAU,EAAQ,KAAY,UAAY,EAAO,WAAa,EAAG,CACnE,GAAI,IAAW,QAAU,EAAO,aAAa,YAC3C,KAAM,IAAI,OAAM,qFAGlB,GAAI,IAAW,OAAU,GAAO,aAAa,aAAe,EAAO,aAAa,aAC9E,KAAM,IAAI,OAAM,6GAGlB,MAAM,IAAI,OAAM,+CAKpB,GAAI,GACF,MAAO,GAAa,GAAM,CACxB,UAAW,IAKf,GAAI,EACF,MAAO,KAAW,MAAQ,EAAY,GAAU,EAAa,EAAQ,CACnE,UAAW,KAKgB,GAAmB,EAEpD,YAA0B,EAAK,CAA6B,MAAI,OAAO,SAAW,YAAc,MAAO,QAAO,UAAa,SAAY,GAAmB,SAAiB,EAAK,CAAE,MAAO,OAAO,IAAiB,GAAmB,SAAiB,EAAK,CAAE,MAAO,IAAO,MAAO,SAAW,YAAc,EAAI,cAAgB,QAAU,IAAQ,OAAO,UAAY,SAAW,MAAO,IAAiB,GAAiB,GAEvZ,YAAyB,EAAU,EAAa,CAAE,GAAI,CAAE,aAAoB,IAAgB,KAAM,IAAI,WAAU,qCAEhH,YAA2B,EAAQ,EAAO,CAAE,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CAAE,GAAI,GAAa,EAAM,GAAI,EAAW,WAAa,EAAW,YAAc,GAAO,EAAW,aAAe,GAAU,SAAW,IAAY,GAAW,SAAW,IAAM,OAAO,eAAe,EAAQ,EAAW,IAAK,IAE7S,YAAsB,EAAa,EAAY,EAAa,CAAE,MAAI,IAAY,GAAkB,EAAY,UAAW,GAAiB,GAAa,GAAkB,EAAa,GAAqB,EAEzM,YAAmB,EAAU,EAAY,CAAE,GAAI,MAAO,IAAe,YAAc,IAAe,KAAQ,KAAM,IAAI,WAAU,sDAAyD,EAAS,UAAY,OAAO,OAAO,GAAc,EAAW,UAAW,CAAE,YAAa,CAAE,MAAO,EAAU,SAAU,GAAM,aAAc,MAAe,GAAY,GAAgB,EAAU,GAEnX,YAAyB,EAAG,EAAG,CAAE,UAAkB,OAAO,gBAAkB,SAAyB,EAAG,EAAG,CAAE,SAAE,UAAY,EAAU,GAAa,GAAgB,EAAG,GAErK,YAAsB,EAAS,CAAE,GAAI,GAA4B,KAA6B,MAAO,WAAgC,CAAE,GAAI,GAAQ,GAAgB,GAAU,EAAQ,GAAI,EAA2B,CAAE,GAAI,GAAY,GAAgB,MAAM,YAAa,EAAS,QAAQ,UAAU,EAAO,UAAW,OAAqB,GAAS,EAAM,MAAM,KAAM,WAAc,MAAO,IAA2B,KAAM,IAE5Z,YAAoC,EAAM,EAAM,CAAE,MAAI,IAAS,IAAiB,KAAU,UAAY,MAAO,IAAS,YAAsB,EAAe,GAAuB,GAElL,YAAgC,EAAM,CAAE,GAAI,IAAS,OAAU,KAAM,IAAI,gBAAe,6DAAgE,MAAO,GAE/J,aAAqC,CAA0E,GAApE,MAAO,UAAY,aAAe,CAAC,QAAQ,WAA6B,QAAQ,UAAU,KAAM,MAAO,GAAO,GAAI,MAAO,QAAU,WAAY,MAAO,GAAM,GAAI,CAAE,YAAK,UAAU,SAAS,KAAK,QAAQ,UAAU,KAAM,GAAI,UAAY,KAAa,SAAe,EAAP,CAAY,MAAO,IAE1T,YAAyB,EAAG,CAAE,UAAkB,OAAO,eAAiB,OAAO,eAAiB,SAAyB,EAAG,CAAE,MAAO,GAAE,WAAa,OAAO,eAAe,IAAc,GAAgB,GAaxM,YAA2B,EAAQ,EAAS,CAC1C,GAAI,GAAY,kBAAkB,OAAO,GAEzC,GAAI,EAAC,EAAQ,aAAa,GAI1B,MAAO,GAAQ,aAAa,GAQ9B,GAAI,IAAyB,SAAU,EAAU,CAC/C,GAAU,EAAW,GAErB,GAAI,GAAS,GAAa,GAM1B,WAAmB,EAAS,EAAS,CACnC,GAAI,GAEJ,UAAgB,KAAM,GAEtB,EAAQ,EAAO,KAAK,MAEpB,EAAM,eAAe,GAErB,EAAM,YAAY,GAEX,EAST,UAAa,EAAW,CAAC,CACvB,IAAK,iBACL,MAAO,UAA0B,CAC/B,GAAI,GAAU,UAAU,OAAS,GAAK,UAAU,KAAO,OAAY,UAAU,GAAK,GAClF,KAAK,OAAS,MAAO,GAAQ,QAAW,WAAa,EAAQ,OAAS,KAAK,cAC3E,KAAK,OAAS,MAAO,GAAQ,QAAW,WAAa,EAAQ,OAAS,KAAK,cAC3E,KAAK,KAAO,MAAO,GAAQ,MAAS,WAAa,EAAQ,KAAO,KAAK,YACrE,KAAK,UAAY,GAAiB,EAAQ,aAAe,SAAW,EAAQ,UAAY,SAAS,OAOlG,CACD,IAAK,cACL,MAAO,SAAqB,EAAS,CACnC,GAAI,GAAS,KAEb,KAAK,SAAW,IAAiB,EAAS,QAAS,SAAU,GAAG,CAC9D,MAAO,GAAO,QAAQ,QAQzB,CACD,IAAK,UACL,MAAO,SAAiB,EAAG,CACzB,GAAI,GAAU,EAAE,gBAAkB,EAAE,cAChC,GAAS,KAAK,OAAO,IAAY,OACjC,GAAO,GAAgB,CACzB,OAAQ,GACR,UAAW,KAAK,UAChB,OAAQ,KAAK,OAAO,GACpB,KAAM,KAAK,KAAK,KAGlB,KAAK,KAAK,GAAO,UAAY,QAAS,CACpC,OAAQ,GACR,KAAM,GACN,QAAS,EACT,eAAgB,UAA0B,CACxC,AAAI,GACF,EAAQ,QAGV,SAAS,cAAc,OACvB,OAAO,eAAe,uBAS3B,CACD,IAAK,gBACL,MAAO,SAAuB,EAAS,CACrC,MAAO,IAAkB,SAAU,KAOpC,CACD,IAAK,gBACL,MAAO,SAAuB,EAAS,CACrC,GAAI,GAAW,GAAkB,SAAU,GAE3C,GAAI,EACF,MAAO,UAAS,cAAc,KAUjC,CACD,IAAK,cAML,MAAO,SAAqB,EAAS,CACnC,MAAO,IAAkB,OAAQ,KAMlC,CACD,IAAK,UACL,MAAO,UAAmB,CACxB,KAAK,SAAS,aAEd,CAAC,CACH,IAAK,OACL,MAAO,SAAc,EAAQ,CAC3B,GAAI,GAAU,UAAU,OAAS,GAAK,UAAU,KAAO,OAAY,UAAU,GAAK,CAChF,UAAW,SAAS,MAEtB,MAAO,GAAa,EAAQ,KAQ7B,CACD,IAAK,MACL,MAAO,SAAa,EAAQ,CAC1B,MAAO,GAAY,KAQpB,CACD,IAAK,cACL,MAAO,UAAuB,CAC5B,GAAI,GAAS,UAAU,OAAS,GAAK,UAAU,KAAO,OAAY,UAAU,GAAK,CAAC,OAAQ,OACtF,EAAU,MAAO,IAAW,SAAW,CAAC,GAAU,EAClD,GAAU,CAAC,CAAC,SAAS,sBACzB,SAAQ,QAAQ,SAAU,GAAQ,CAChC,GAAU,IAAW,CAAC,CAAC,SAAS,sBAAsB,MAEjD,OAIJ,GACN,KAE8B,GAAa,IAIxC,IACC,SAAS,EAAQ,CAExB,GAAI,GAAqB,EAKzB,GAAI,MAAO,UAAY,aAAe,CAAC,QAAQ,UAAU,QAAS,CAC9D,GAAI,GAAQ,QAAQ,UAEpB,EAAM,QAAU,EAAM,iBACN,EAAM,oBACN,EAAM,mBACN,EAAM,kBACN,EAAM,sBAU1B,WAAkB,EAAS,EAAU,CACjC,KAAO,GAAW,EAAQ,WAAa,GAAoB,CACvD,GAAI,MAAO,GAAQ,SAAY,YAC3B,EAAQ,QAAQ,GAClB,MAAO,GAET,EAAU,EAAQ,YAI1B,EAAO,QAAU,GAKX,IACC,SAAS,EAAQ,EAA0B,EAAqB,CAEvE,GAAI,GAAU,EAAoB,KAYlC,WAAmB,EAAS,EAAU,EAAM,EAAU,EAAY,CAC9D,GAAI,GAAa,EAAS,MAAM,KAAM,WAEtC,SAAQ,iBAAiB,EAAM,EAAY,GAEpC,CACH,QAAS,UAAW,CAChB,EAAQ,oBAAoB,EAAM,EAAY,KAe1D,WAAkB,EAAU,EAAU,EAAM,EAAU,EAAY,CAE9D,MAAI,OAAO,GAAS,kBAAqB,WAC9B,EAAU,MAAM,KAAM,WAI7B,MAAO,IAAS,WAGT,EAAU,KAAK,KAAM,UAAU,MAAM,KAAM,WAIlD,OAAO,IAAa,UACpB,GAAW,SAAS,iBAAiB,IAIlC,MAAM,UAAU,IAAI,KAAK,EAAU,SAAU,EAAS,CACzD,MAAO,GAAU,EAAS,EAAU,EAAM,EAAU,MAa5D,WAAkB,EAAS,EAAU,EAAM,EAAU,CACjD,MAAO,UAAS,EAAG,CACf,EAAE,eAAiB,EAAQ,EAAE,OAAQ,GAEjC,EAAE,gBACF,EAAS,KAAK,EAAS,IAKnC,EAAO,QAAU,GAKX,IACC,SAAS,EAAyB,EAAS,CAQlD,EAAQ,KAAO,SAAS,EAAO,CAC3B,MAAO,KAAU,QACV,YAAiB,cACjB,EAAM,WAAa,GAS9B,EAAQ,SAAW,SAAS,EAAO,CAC/B,GAAI,GAAO,OAAO,UAAU,SAAS,KAAK,GAE1C,MAAO,KAAU,QACT,KAAS,qBAAuB,IAAS,4BACzC,UAAY,IACZ,GAAM,SAAW,GAAK,EAAQ,KAAK,EAAM,MASrD,EAAQ,OAAS,SAAS,EAAO,CAC7B,MAAO,OAAO,IAAU,UACjB,YAAiB,SAS5B,EAAQ,GAAK,SAAS,EAAO,CACzB,GAAI,GAAO,OAAO,UAAU,SAAS,KAAK,GAE1C,MAAO,KAAS,sBAMd,IACC,SAAS,EAAQ,EAA0B,EAAqB,CAEvE,GAAI,GAAK,EAAoB,KACzB,EAAW,EAAoB,KAWnC,WAAgB,EAAQ,EAAM,EAAU,CACpC,GAAI,CAAC,GAAU,CAAC,GAAQ,CAAC,EACrB,KAAM,IAAI,OAAM,8BAGpB,GAAI,CAAC,EAAG,OAAO,GACX,KAAM,IAAI,WAAU,oCAGxB,GAAI,CAAC,EAAG,GAAG,GACP,KAAM,IAAI,WAAU,qCAGxB,GAAI,EAAG,KAAK,GACR,MAAO,GAAW,EAAQ,EAAM,GAE/B,GAAI,EAAG,SAAS,GACjB,MAAO,GAAe,EAAQ,EAAM,GAEnC,GAAI,EAAG,OAAO,GACf,MAAO,GAAe,EAAQ,EAAM,GAGpC,KAAM,IAAI,WAAU,6EAa5B,WAAoB,EAAM,EAAM,EAAU,CACtC,SAAK,iBAAiB,EAAM,GAErB,CACH,QAAS,UAAW,CAChB,EAAK,oBAAoB,EAAM,KAc3C,WAAwB,EAAU,EAAM,EAAU,CAC9C,aAAM,UAAU,QAAQ,KAAK,EAAU,SAAS,EAAM,CAClD,EAAK,iBAAiB,EAAM,KAGzB,CACH,QAAS,UAAW,CAChB,MAAM,UAAU,QAAQ,KAAK,EAAU,SAAS,EAAM,CAClD,EAAK,oBAAoB,EAAM,OAe/C,WAAwB,EAAU,EAAM,EAAU,CAC9C,MAAO,GAAS,SAAS,KAAM,EAAU,EAAM,GAGnD,EAAO,QAAU,GAKX,IACC,SAAS,EAAQ,CAExB,WAAgB,EAAS,CACrB,GAAI,GAEJ,GAAI,EAAQ,WAAa,SACrB,EAAQ,QAER,EAAe,EAAQ,cAElB,EAAQ,WAAa,SAAW,EAAQ,WAAa,WAAY,CACtE,GAAI,GAAa,EAAQ,aAAa,YAEtC,AAAK,GACD,EAAQ,aAAa,WAAY,IAGrC,EAAQ,SACR,EAAQ,kBAAkB,EAAG,EAAQ,MAAM,QAEtC,GACD,EAAQ,gBAAgB,YAG5B,EAAe,EAAQ,UAEtB,CACD,AAAI,EAAQ,aAAa,oBACrB,EAAQ,QAGZ,GAAI,GAAY,OAAO,eACnB,EAAQ,SAAS,cAErB,EAAM,mBAAmB,GACzB,EAAU,kBACV,EAAU,SAAS,GAEnB,EAAe,EAAU,WAG7B,MAAO,GAGX,EAAO,QAAU,GAKX,IACC,SAAS,EAAQ,CAExB,YAAc,EAKd,EAAE,UAAY,CACZ,GAAI,SAAU,EAAM,EAAU,EAAK,CACjC,GAAI,GAAI,KAAK,GAAM,MAAK,EAAI,IAE5B,MAAC,GAAE,IAAU,GAAE,GAAQ,KAAK,KAAK,CAC/B,GAAI,EACJ,IAAK,IAGA,MAGT,KAAM,SAAU,EAAM,EAAU,EAAK,CACnC,GAAI,GAAO,KACX,YAAqB,CACnB,EAAK,IAAI,EAAM,GACf,EAAS,MAAM,EAAK,WAGtB,SAAS,EAAI,EACN,KAAK,GAAG,EAAM,EAAU,IAGjC,KAAM,SAAU,EAAM,CACpB,GAAI,GAAO,GAAG,MAAM,KAAK,UAAW,GAChC,EAAW,OAAK,GAAM,MAAK,EAAI,KAAK,IAAS,IAAI,QACjD,EAAI,EACJ,EAAM,EAAO,OAEjB,IAAK,EAAG,EAAI,EAAK,IACf,EAAO,GAAG,GAAG,MAAM,EAAO,GAAG,IAAK,GAGpC,MAAO,OAGT,IAAK,SAAU,EAAM,EAAU,CAC7B,GAAI,GAAI,KAAK,GAAM,MAAK,EAAI,IACxB,EAAO,EAAE,GACT,EAAa,GAEjB,GAAI,GAAQ,EACV,OAAS,GAAI,EAAG,EAAM,EAAK,OAAQ,EAAI,EAAK,IAC1C,AAAI,EAAK,GAAG,KAAO,GAAY,EAAK,GAAG,GAAG,IAAM,GAC9C,EAAW,KAAK,EAAK,IAQ3B,MAAC,GAAW,OACR,EAAE,GAAQ,EACV,MAAO,GAAE,GAEN,OAIX,EAAO,QAAU,EACjB,EAAO,QAAQ,YAAc,IAQf,EAA2B,GAG/B,WAA6B,EAAU,CAEtC,GAAG,EAAyB,GAC3B,MAAO,GAAyB,GAAU,QAG3C,GAAI,GAAS,EAAyB,GAAY,CAGjD,QAAS,IAIV,SAAoB,GAAU,EAAQ,EAAO,QAAS,GAG/C,EAAO,QAKf,MAAC,WAAW,CAEX,EAAoB,EAAI,SAAS,EAAQ,CACxC,GAAI,GAAS,GAAU,EAAO,WAC7B,UAAW,CAAE,MAAO,GAAO,SAC3B,UAAW,CAAE,MAAO,IACrB,SAAoB,EAAE,EAAQ,CAAE,EAAG,IAC5B,MAKR,UAAW,CAEX,EAAoB,EAAI,SAAS,EAAS,EAAY,CACrD,OAAQ,KAAO,GACd,AAAG,EAAoB,EAAE,EAAY,IAAQ,CAAC,EAAoB,EAAE,EAAS,IAC5E,OAAO,eAAe,EAAS,EAAK,CAAE,WAAY,GAAM,IAAK,EAAW,SAO3E,UAAW,CACX,EAAoB,EAAI,SAAS,EAAK,EAAM,CAAE,MAAO,QAAO,UAAU,eAAe,KAAK,EAAK,OAOzF,EAAoB,QAEpC,YC12BD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAeA,GAAI,IAAkB,UAOtB,GAAO,QAAU,GAUjB,YAAoB,EAAQ,CAC1B,GAAI,GAAM,GAAK,EACX,EAAQ,GAAgB,KAAK,GAEjC,GAAI,CAAC,EACH,MAAO,GAGT,GAAI,GACA,EAAO,GACP,EAAQ,EACR,EAAY,EAEhB,IAAK,EAAQ,EAAM,MAAO,EAAQ,EAAI,OAAQ,IAAS,CACrD,OAAQ,EAAI,WAAW,QAChB,IACH,EAAS,SACT,UACG,IACH,EAAS,QACT,UACG,IACH,EAAS,QACT,UACG,IACH,EAAS,OACT,UACG,IACH,EAAS,OACT,cAEA,SAGJ,AAAI,IAAc,GAChB,IAAQ,EAAI,UAAU,EAAW,IAGnC,EAAY,EAAQ,EACpB,GAAQ,EAGV,MAAO,KAAc,EACjB,EAAO,EAAI,UAAU,EAAW,GAChC,KC5EN,MAAM,UAAU,MAAM,OAAO,eAAe,MAAM,UAAU,OAAO,CAAC,aAAa,GAAG,MAAM,YAAY,CAAC,GAAI,GAAE,MAAM,UAAU,IAAI,EAAE,OAAO,UAAU,IAAI,MAAO,GAAE,MAAM,UAAU,OAAO,KAAK,KAAK,SAAS,EAAE,EAAE,CAAC,MAAO,OAAM,QAAQ,GAAG,EAAE,KAAK,MAAM,EAAE,EAAE,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,GAAG,GAAG,IAAI,MAAM,UAAU,MAAM,KAAK,OAAO,SAAS,KAAK,MAAM,UAAU,SAAS,OAAO,eAAe,MAAM,UAAU,UAAU,CAAC,aAAa,GAAG,MAAM,SAAS,EAAE,CAAC,MAAO,OAAM,UAAU,IAAI,MAAM,KAAK,WAAW,QAAQ,SAAS,KCuBrf,OAAO,SCvBP,KAAK,OAAQ,MAAK,MAAM,SAAS,EAAE,EAAE,CAAC,MAAO,GAAE,GAAG,GAAG,GAAI,SAAQ,SAAS,EAAE,EAAE,CAAC,GAAI,GAAE,GAAI,gBAAe,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,UAAU,CAAC,MAAM,CAAC,GAAG,AAAI,GAAE,OAAO,IAAI,IAAjB,EAAoB,WAAW,EAAE,WAAW,OAAO,EAAE,OAAO,IAAI,EAAE,YAAY,KAAK,UAAU,CAAC,MAAO,SAAQ,QAAQ,EAAE,eAAe,KAAK,UAAU,CAAC,MAAO,SAAQ,QAAQ,EAAE,cAAc,KAAK,KAAK,QAAQ,KAAK,UAAU,CAAC,MAAO,SAAQ,QAAQ,GAAI,MAAK,CAAC,EAAE,aAAa,MAAM,EAAE,QAAQ,CAAC,KAAK,UAAU,CAAC,MAAO,IAAG,QAAQ,UAAU,CAAC,MAAO,IAAG,IAAI,SAAS,EAAE,CAAC,MAAO,GAAE,EAAE,gBAAgB,IAAI,SAAS,EAAE,CAAC,MAAO,GAAE,eAAgB,OAAM,OAAQ,KAAK,GAAE,KAAK,EAAE,QAAQ,MAAM,EAAE,IAAI,EAAE,OAAO,UAAU,CAAC,EAAE,wBAAwB,QAAQ,+BAA+B,SAAS,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,eAAe,EAAE,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,gBAAgB,AAAW,EAAE,aAAb,UAAyB,EAAE,QAAQ,EAAE,iBAAiB,EAAE,EAAE,QAAQ,IAAI,EAAE,KAAK,EAAE,MAAM,UDyB14B,OAAO,SEzBP,OAAkB,WACZ,CACF,aACA,YACA,UACA,cACA,WACA,cACA,aACA,eACA,gBACA,mBACA,YACA,SACA,YACA,kBACA,gBACA,WACA,oBACA,oBACA,iBACA,wBACA,gBACA,mBACA,0BACA,2BACA,WCtBE,WAAqB,EAAU,CACnC,MAAO,OAAO,IAAU,WCIpB,YAA8B,EAAgC,CAClE,GAAM,GAAS,SAAC,EAAa,CAC3B,MAAM,KAAK,GACX,EAAS,MAAQ,GAAI,SAAQ,OAGzB,EAAW,EAAW,GAC5B,SAAS,UAAY,OAAO,OAAO,MAAM,WACzC,EAAS,UAAU,YAAc,EAC1B,ECAF,GAAM,IAA+C,GAC1D,SAAC,EAAM,CACL,MAAA,UAA4C,EAA0B,CACpE,EAAO,MACP,KAAK,QAAU,EACR,EAAO,OAAM;EACxB,EAAO,IAAI,SAAC,EAAK,EAAC,CAAK,MAAG,GAAI,EAAC,KAAK,EAAI,aAAc,KAAK;KACnD,GACJ,KAAK,KAAO,sBACZ,KAAK,OAAS,KCtBd,YAAuB,EAA6B,EAAO,CAC/D,GAAI,EAAK,CACP,GAAM,GAAQ,EAAI,QAAQ,GAC1B,GAAK,GAAS,EAAI,OAAO,EAAO,ICSpC,GAAA,IAAA,UAAA,CAyBE,WAAoB,EAA4B,CAA5B,KAAA,gBAAA,EAdb,KAAA,OAAS,GAER,KAAA,WAAmD,KAMnD,KAAA,WAAoD,KAc5D,SAAA,UAAA,YAAA,UAAA,aACM,EAEJ,GAAI,CAAC,KAAK,OAAQ,CAChB,KAAK,OAAS,GAGN,GAAA,GAAe,KAAI,WAC3B,GAAI,EAEF,GADA,KAAK,WAAa,KACd,MAAM,QAAQ,OAChB,OAAqB,GAAA,GAAA,GAAU,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAA5B,GAAM,GAAM,EAAA,MACf,EAAO,OAAO,4GAGhB,GAAW,OAAO,MAId,GAAA,GAAoB,KAAI,gBAChC,GAAI,EAAW,GACb,GAAI,CACF,UACO,EAAP,CACA,EAAS,YAAa,IAAsB,EAAE,OAAS,CAAC,GAIpD,GAAA,GAAe,KAAI,WAC3B,GAAI,EAAY,CACd,KAAK,WAAa,SAClB,OAAuB,GAAA,GAAA,GAAU,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAA9B,GAAM,GAAQ,EAAA,MACjB,GAAI,CACF,GAAa,SACN,EAAP,CACA,EAAS,GAAM,KAAN,EAAU,GACnB,AAAI,YAAe,IACjB,EAAM,EAAA,EAAA,GAAA,EAAO,IAAM,EAAK,EAAI,SAE5B,EAAO,KAAK,uGAMpB,GAAI,EACF,KAAM,IAAI,IAAoB,KAuBpC,EAAA,UAAA,IAAA,SAAI,EAAuB,OAGzB,GAAI,GAAY,IAAa,KAC3B,GAAI,KAAK,OAGP,GAAa,OACR,CACL,GAAI,YAAoB,GAAc,CAGpC,GAAI,EAAS,QAAU,EAAS,WAAW,MACzC,OAEF,EAAS,WAAW,MAEtB,AAAC,MAAK,WAAa,GAAA,KAAK,cAAU,MAAA,IAAA,OAAA,EAAI,IAAI,KAAK,KAU7C,EAAA,UAAA,WAAR,SAAmB,EAAoB,CAC7B,GAAA,GAAe,KAAI,WAC3B,MAAO,KAAe,GAAW,MAAM,QAAQ,IAAe,EAAW,SAAS,IAU5E,EAAA,UAAA,WAAR,SAAmB,EAAoB,CAC7B,GAAA,GAAe,KAAI,WAC3B,KAAK,WAAa,MAAM,QAAQ,GAAe,GAAW,KAAK,GAAS,GAAc,EAAa,CAAC,EAAY,GAAU,GAOpH,EAAA,UAAA,cAAR,SAAsB,EAAoB,CAChC,GAAA,GAAe,KAAI,WAC3B,AAAI,IAAe,EACjB,KAAK,WAAa,KACT,MAAM,QAAQ,IACvB,GAAU,EAAY,IAkB1B,EAAA,UAAA,OAAA,SAAO,EAAsC,CACnC,GAAA,GAAe,KAAI,WAC3B,GAAc,GAAU,EAAY,GAEhC,YAAoB,IACtB,EAAS,cAAc,OAhLb,EAAA,MAAS,UAAA,CACrB,GAAM,GAAQ,GAAI,GAClB,SAAM,OAAS,GACR,KAgLX,KAEO,GAAM,IAAqB,GAAa,MAEzC,YAAyB,EAAU,CACvC,MACE,aAAiB,KAChB,GAAS,UAAY,IAAS,EAAW,EAAM,SAAW,EAAW,EAAM,MAAQ,EAAW,EAAM,aAIzG,YAAsB,EAAuC,CAC3D,AAAI,EAAW,GACb,IAEA,EAAS,cC9MN,GAAM,IAAuB,CAClC,iBAAkB,KAClB,sBAAuB,KACvB,QAAS,OACT,sCAAuC,GACvC,yBAA0B,ICErB,GAAM,IAAmC,CAG9C,WAAU,UAAA,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACD,GAAA,GAAa,GAAe,SACpC,MAAQ,KAAQ,KAAA,OAAR,EAAU,aAAc,YAAW,MAAA,OAAA,EAAA,GAAA,EAAI,MAEjD,aAAY,SAAC,EAAM,CACT,GAAA,GAAa,GAAe,SACpC,MAAQ,KAAQ,KAAA,OAAR,EAAU,eAAgB,cAAc,IAElD,SAAU,QCbN,YAA+B,EAAQ,CAC3C,GAAgB,WAAW,UAAA,CACjB,GAAA,GAAqB,GAAM,iBACnC,GAAI,EAEF,EAAiB,OAGjB,MAAM,KCnBN,aAAc,ECMb,GAAM,IAAyB,UAAA,CAAM,MAAA,IAAmB,IAAK,OAAW,WAOzE,YAA4B,EAAU,CAC1C,MAAO,IAAmB,IAAK,OAAW,GAQtC,YAA8B,EAAQ,CAC1C,MAAO,IAAmB,IAAK,EAAO,QASlC,YAA6B,EAAuB,EAAY,EAAU,CAC9E,MAAO,CACL,KAAI,EACJ,MAAK,EACL,MAAK,GCnCT,GAAI,IAAuD,KASrD,YAAuB,EAAc,CACzC,GAAI,GAAO,sCAAuC,CAChD,GAAM,GAAS,CAAC,GAKhB,GAJI,GACF,IAAU,CAAE,YAAa,GAAO,MAAO,OAEzC,IACI,EAAQ,CACJ,GAAA,GAAyB,GAAvB,EAAW,EAAA,YAAE,EAAK,EAAA,MAE1B,GADA,GAAU,KACN,EACF,KAAM,QAMV,KAQE,YAAuB,EAAQ,CACnC,AAAI,GAAO,uCAAyC,IAClD,IAAQ,YAAc,GACtB,GAAQ,MAAQ,GCnBpB,GAAA,IAAA,SAAA,EAAA,CAAmC,GAAA,EAAA,GA6BjC,WAAY,EAA6C,CAAzD,GAAA,GACE,EAAA,KAAA,OAAO,KATC,SAAA,UAAqB,GAU7B,AAAI,EACF,GAAK,YAAc,EAGf,GAAe,IACjB,EAAY,IAAI,IAGlB,EAAK,YAAc,KAvBhB,SAAA,OAAP,SAAiB,EAAwB,EAA2B,EAAqB,CACvF,MAAO,IAAI,IAAe,EAAM,EAAO,IAiCzC,EAAA,UAAA,KAAA,SAAK,EAAS,CACZ,AAAI,KAAK,UACP,GAA0B,GAAiB,GAAQ,MAEnD,KAAK,MAAM,IAWf,EAAA,UAAA,MAAA,SAAM,EAAS,CACb,AAAI,KAAK,UACP,GAA0B,GAAkB,GAAM,MAElD,MAAK,UAAY,GACjB,KAAK,OAAO,KAUhB,EAAA,UAAA,SAAA,UAAA,CACE,AAAI,KAAK,UACP,GAA0B,GAAuB,MAEjD,MAAK,UAAY,GACjB,KAAK,cAIT,EAAA,UAAA,YAAA,UAAA,CACE,AAAK,KAAK,QACR,MAAK,UAAY,GACjB,EAAA,UAAM,YAAW,KAAA,MACjB,KAAK,YAAc,OAIb,EAAA,UAAA,MAAV,SAAgB,EAAQ,CACtB,KAAK,YAAY,KAAK,IAGd,EAAA,UAAA,OAAV,SAAiB,EAAQ,CACvB,GAAI,CACF,KAAK,YAAY,MAAM,WAEvB,KAAK,gBAIC,EAAA,UAAA,UAAV,UAAA,CACE,GAAI,CACF,KAAK,YAAY,mBAEjB,KAAK,gBAGX,GApHmC,IA2HnC,GAAM,IAAQ,SAAS,UAAU,KAEjC,YAAkD,EAAQ,EAAY,CACpE,MAAO,IAAM,KAAK,EAAI,GAGxB,GAAA,IAAA,SAAA,EAAA,CAAuC,GAAA,EAAA,GACrC,WACE,EACA,EACA,EAA8B,CAHhC,GAAA,GAKE,EAAA,KAAA,OAAO,KAEH,EACJ,GAAI,EAAW,GAGb,EAAO,UACE,EAAgB,CAMzB,AAAG,EAA0B,EAAc,KAAlC,EAAoB,EAAc,MAA3B,EAAa,EAAc,SAC3C,GAAI,GACJ,AAAI,GAAQ,GAAO,yBAIjB,GAAU,OAAO,OAAO,GACxB,EAAQ,YAAc,UAAA,CAAM,MAAA,GAAK,gBAEjC,EAAU,EAEZ,EAAO,GAAQ,GAAK,EAAM,GAC1B,EAAQ,GAAS,GAAK,EAAO,GAC7B,EAAW,GAAY,GAAK,EAAU,GAKxC,SAAK,YAAc,CACjB,KAAM,EAAO,GAAqB,EAAM,GAAQ,GAChD,MAAO,GAAqB,GAAK,KAAL,EAAS,GAAqB,GAC1D,SAAU,EAAW,GAAqB,EAAU,GAAQ,MAGlE,MAAA,IA3CuC,IAoDvC,YAA8B,EAA8B,EAA6B,CACvF,MAAO,WAAA,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACN,GAAI,CACF,EAAO,MAAA,OAAA,EAAA,GAAA,EAAI,WACJ,EAAP,CACA,AAAI,GAAO,sCACT,GAAa,GAIb,GAAqB,KAW7B,YAA6B,EAAQ,CACnC,KAAM,GAQR,YAAmC,EAA2C,EAA2B,CAC/F,GAAA,GAA0B,GAAM,sBACxC,GAAyB,GAAgB,WAAW,UAAA,CAAM,MAAA,GAAsB,EAAc,KAQzF,GAAM,IAA6D,CACxE,OAAQ,GACR,KAAM,GACN,MAAO,GACP,SAAU,ICpPL,GAAM,IAA+B,UAAA,CAAM,MAAC,OAAO,SAAW,YAAc,OAAO,YAAe,kBCyCnG,YAAsB,EAAI,CAC9B,MAAO,GCkCH,aAAc,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACnB,MAAO,IAAc,GAIjB,YAA8B,EAA+B,CACjE,MAAI,GAAI,SAAW,EACV,GAGL,EAAI,SAAW,EACV,EAAI,GAGN,SAAe,EAAQ,CAC5B,MAAO,GAAI,OAAO,SAAC,EAAW,EAAuB,CAAK,MAAA,GAAG,IAAO,IC5ExE,GAAA,GAAA,UAAA,CAkBE,WAAY,EAA6E,CACvF,AAAI,GACF,MAAK,WAAa,GA8BtB,SAAA,UAAA,KAAA,SAAQ,EAAyB,CAC/B,GAAM,GAAa,GAAI,GACvB,SAAW,OAAS,KACpB,EAAW,SAAW,EACf,GA+IT,EAAA,UAAA,UAAA,SACE,EACA,EACA,EAA8B,CAHhC,GAAA,GAAA,KAKQ,EAAa,GAAa,GAAkB,EAAiB,GAAI,IAAe,EAAgB,EAAO,GAE7G,UAAa,UAAA,CACL,GAAA,GAAuB,EAArB,EAAQ,EAAA,SAAE,EAAM,EAAA,OACxB,EAAW,IACT,EAGI,EAAS,KAAK,EAAY,GAC1B,EAIA,EAAK,WAAW,GAGhB,EAAK,cAAc,MAIpB,GAIC,EAAA,UAAA,cAAV,SAAwB,EAAmB,CACzC,GAAI,CACF,MAAO,MAAK,WAAW,SAChB,EAAP,CAIA,EAAK,MAAM,KA+Df,EAAA,UAAA,QAAA,SAAQ,EAA0B,EAAoC,CAAtE,GAAA,GAAA,KACE,SAAc,GAAe,GAEtB,GAAI,GAAkB,SAAC,EAAS,EAAM,CAC3C,GAAM,GAAa,GAAI,IAAkB,CACvC,KAAM,SAAC,EAAK,CACV,GAAI,CACF,EAAK,SACE,EAAP,CACA,EAAO,GACP,EAAW,gBAGf,MAAO,EACP,SAAU,IAEZ,EAAK,UAAU,MAKT,EAAA,UAAA,WAAV,SAAqB,EAA2B,OAC9C,MAAO,GAAA,KAAK,UAAM,MAAA,IAAA,OAAA,OAAA,EAAE,UAAU,IAQhC,EAAA,UAAC,IAAD,UAAA,CACE,MAAO,OA6FT,EAAA,UAAA,KAAA,UAAA,QAAK,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACH,MAAO,IAAc,GAAY,OA8BnC,EAAA,UAAA,UAAA,SAAU,EAAoC,CAA9C,GAAA,GAAA,KACE,SAAc,GAAe,GAEtB,GAAI,GAAY,SAAC,EAAS,EAAM,CACrC,GAAI,GACJ,EAAK,UACH,SAAC,EAAI,CAAK,MAAC,GAAQ,GACnB,SAAC,EAAQ,CAAK,MAAA,GAAO,IACrB,UAAA,CAAM,MAAA,GAAQ,QAxab,EAAA,OAAkC,SAAI,EAAwD,CACnG,MAAO,IAAI,GAAc,IA2a7B,KASA,YAAwB,EAA+C,OACrE,MAAO,GAAA,GAAW,KAAX,EAAe,GAAO,WAAO,MAAA,IAAA,OAAA,EAAI,QAG1C,YAAuB,EAAU,CAC/B,MAAO,IAAS,EAAW,EAAM,OAAS,EAAW,EAAM,QAAU,EAAW,EAAM,UAGxF,YAAyB,EAAU,CACjC,MAAQ,IAAS,YAAiB,KAAgB,GAAW,IAAU,GAAe,GCzelF,YAAkB,EAAW,CACjC,MAAO,GAAW,GAAM,KAAA,OAAN,EAAQ,MAOtB,WACJ,EAAqF,CAErF,MAAO,UAAC,EAAqB,CAC3B,GAAI,GAAQ,GACV,MAAO,GAAO,KAAK,SAA+B,EAA2B,CAC3E,GAAI,CACF,MAAO,GAAK,EAAc,YACnB,EAAP,CACA,KAAK,MAAM,MAIjB,KAAM,IAAI,WAAU,2CCflB,WACJ,EACA,EACA,EACA,EACA,EAAuB,CAEvB,MAAO,IAAI,IAAmB,EAAa,EAAQ,EAAY,EAAS,GAO1E,GAAA,IAAA,SAAA,EAAA,CAA2C,GAAA,EAAA,GAiBzC,WACE,EACA,EACA,EACA,EACQ,EACA,EAAiC,CAN3C,GAAA,GAoBE,EAAA,KAAA,KAAM,IAAY,KAfV,SAAA,WAAA,EACA,EAAA,kBAAA,EAeR,EAAK,MAAQ,EACT,SAAuC,EAAQ,CAC7C,GAAI,CACF,EAAO,SACA,EAAP,CACA,EAAY,MAAM,KAGtB,EAAA,UAAM,MACV,EAAK,OAAS,EACV,SAAuC,EAAQ,CAC7C,GAAI,CACF,EAAQ,SACD,EAAP,CAEA,EAAY,MAAM,WAGlB,KAAK,gBAGT,EAAA,UAAM,OACV,EAAK,UAAY,EACb,UAAA,CACE,GAAI,CACF,UACO,EAAP,CAEA,EAAY,MAAM,WAGlB,KAAK,gBAGT,EAAA,UAAM,YAGZ,SAAA,UAAA,YAAA,UAAA,OACE,GAAI,CAAC,KAAK,mBAAqB,KAAK,oBAAqB,CAC/C,GAAA,GAAW,KAAI,OACvB,EAAA,UAAM,YAAW,KAAA,MAEjB,CAAC,GAAU,IAAA,KAAK,cAAU,MAAA,IAAA,QAAA,EAAA,KAAf,SAGjB,GAnF2C,ICdpC,GAAM,IAAiD,CAG5D,SAAA,SAAS,EAAQ,CACf,GAAI,GAAU,sBACV,EAAkD,qBAC9C,EAAa,GAAsB,SAC3C,AAAI,GACF,GAAU,EAAS,sBACnB,EAAS,EAAS,sBAEpB,GAAM,GAAS,EAAQ,SAAC,EAAS,CAI/B,EAAS,OACT,EAAS,KAEX,MAAO,IAAI,IAAa,UAAA,CAAM,MAAA,IAAM,KAAA,OAAN,EAAS,MAEzC,sBAAqB,UAAA,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACZ,GAAA,GAAa,GAAsB,SAC3C,MAAQ,KAAQ,KAAA,OAAR,EAAU,wBAAyB,uBAAsB,MAAA,OAAA,EAAA,GAAA,EAAI,MAEvE,qBAAoB,UAAA,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACX,GAAA,GAAa,GAAsB,SAC3C,MAAQ,KAAQ,KAAA,OAAR,EAAU,uBAAwB,sBAAqB,MAAA,OAAA,EAAA,GAAA,EAAI,MAErE,SAAU,QCrBL,GAAM,IAAuD,GAClE,SAAC,EAAM,CACL,MAAA,WAAoC,CAClC,EAAO,MACP,KAAK,KAAO,0BACZ,KAAK,QAAU,yBCVrB,GAAA,GAAA,SAAA,EAAA,CAAgC,GAAA,EAAA,GAqB9B,YAAA,CAAA,GAAA,GAEE,EAAA,KAAA,OAAO,KAtBT,SAAA,OAAS,GAET,EAAA,UAA2B,GAE3B,EAAA,UAAY,GAEZ,EAAA,SAAW,GAEX,EAAA,YAAmB,OAkBnB,SAAA,UAAA,KAAA,SAAQ,EAAwB,CAC9B,GAAM,GAAU,GAAI,IAAiB,KAAM,MAC3C,SAAQ,SAAW,EACZ,GAIC,EAAA,UAAA,eAAV,UAAA,CACE,GAAI,KAAK,OACP,KAAM,IAAI,KAId,EAAA,UAAA,KAAA,SAAK,EAAQ,CAAb,GAAA,GAAA,KACE,GAAa,UAAA,SAEX,GADA,EAAK,iBACD,CAAC,EAAK,UAAW,CACnB,GAAM,GAAO,EAAK,UAAU,YAC5B,OAAuB,GAAA,GAAA,GAAI,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAAxB,GAAM,GAAQ,EAAA,MACjB,EAAS,KAAK,0GAMtB,EAAA,UAAA,MAAA,SAAM,EAAQ,CAAd,GAAA,GAAA,KACE,GAAa,UAAA,CAEX,GADA,EAAK,iBACD,CAAC,EAAK,UAAW,CACnB,EAAK,SAAW,EAAK,UAAY,GACjC,EAAK,YAAc,EAEnB,OADQ,GAAc,EAAI,UACnB,EAAU,QACf,EAAU,QAAS,MAAM,OAMjC,EAAA,UAAA,SAAA,UAAA,CAAA,GAAA,GAAA,KACE,GAAa,UAAA,CAEX,GADA,EAAK,iBACD,CAAC,EAAK,UAAW,CACnB,EAAK,UAAY,GAEjB,OADQ,GAAc,EAAI,UACnB,EAAU,QACf,EAAU,QAAS,eAM3B,EAAA,UAAA,YAAA,UAAA,CACE,KAAK,UAAY,KAAK,OAAS,GAC/B,KAAK,UAAY,MAGnB,OAAA,eAAI,EAAA,UAAA,WAAQ,KAAZ,UAAA,OACE,MAAO,IAAA,KAAK,aAAS,MAAA,IAAA,OAAA,OAAA,EAAE,QAAS,mCAIxB,EAAA,UAAA,cAAV,SAAwB,EAAyB,CAC/C,YAAK,iBACE,EAAA,UAAM,cAAa,KAAA,KAAC,IAInB,EAAA,UAAA,WAAV,SAAqB,EAAyB,CAC5C,YAAK,iBACL,KAAK,wBAAwB,GACtB,KAAK,gBAAgB,IAIpB,EAAA,UAAA,gBAAV,SAA0B,EAA2B,CAC7C,GAAA,GAAqC,KAAnC,EAAQ,EAAA,SAAE,EAAS,EAAA,UAAE,EAAS,EAAA,UACtC,MAAO,IAAY,EACf,GACC,GAAU,KAAK,GAAa,GAAI,IAAa,UAAA,CAAM,MAAA,IAAU,EAAW,OAIrE,EAAA,UAAA,wBAAV,SAAkC,EAA2B,CACrD,GAAA,GAAuC,KAArC,EAAQ,EAAA,SAAE,EAAW,EAAA,YAAE,EAAS,EAAA,UACxC,AAAI,EACF,EAAW,MAAM,GACR,GACT,EAAW,YAUf,EAAA,UAAA,aAAA,UAAA,CACE,GAAM,GAAkB,GAAI,GAC5B,SAAW,OAAS,KACb,GA/GF,EAAA,OAAkC,SAAI,EAA0B,EAAqB,CAC1F,MAAO,IAAI,IAAoB,EAAa,IAgHhD,GAlIgC,GAuIhC,GAAA,IAAA,SAAA,EAAA,CAAyC,GAAA,EAAA,GACvC,WAES,EACP,EAAsB,CAHxB,GAAA,GAKE,EAAA,KAAA,OAAO,KAHA,SAAA,YAAA,EAIP,EAAK,OAAS,IAGhB,SAAA,UAAA,KAAA,SAAK,EAAQ,SACX,AAAA,GAAA,GAAA,KAAK,eAAW,MAAA,IAAA,OAAA,OAAA,EAAE,QAAI,MAAA,IAAA,QAAA,EAAA,KAAA,EAAG,IAG3B,EAAA,UAAA,MAAA,SAAM,EAAQ,SACZ,AAAA,GAAA,GAAA,KAAK,eAAW,MAAA,IAAA,OAAA,OAAA,EAAE,SAAK,MAAA,IAAA,QAAA,EAAA,KAAA,EAAG,IAG5B,EAAA,UAAA,SAAA,UAAA,SACE,AAAA,GAAA,GAAA,KAAK,eAAW,MAAA,IAAA,OAAA,OAAA,EAAE,YAAQ,MAAA,IAAA,QAAA,EAAA,KAAA,IAIlB,EAAA,UAAA,WAAV,SAAqB,EAAyB,SAC5C,MAAO,GAAA,GAAA,KAAK,UAAM,MAAA,IAAA,OAAA,OAAA,EAAE,UAAU,MAAW,MAAA,IAAA,OAAA,EAAI,IAEjD,GA1ByC,GCjJlC,GAAM,IAA+C,CAC1D,IAAG,UAAA,CAGD,MAAQ,IAAsB,UAAY,MAAM,OAElD,SAAU,QCwBZ,GAAA,IAAA,SAAA,EAAA,CAAsC,GAAA,EAAA,GAUpC,WACU,EACA,EACA,EAA6D,CAF7D,AAAA,IAAA,QAAA,GAAA,KACA,IAAA,QAAA,GAAA,KACA,IAAA,QAAA,GAAA,IAHV,GAAA,GAKE,EAAA,KAAA,OAAO,KAJC,SAAA,YAAA,EACA,EAAA,YAAA,EACA,EAAA,mBAAA,EAZF,EAAA,QAA0B,GAC1B,EAAA,oBAAsB,GAc5B,EAAK,oBAAsB,IAAgB,IAC3C,EAAK,YAAc,KAAK,IAAI,EAAG,GAC/B,EAAK,YAAc,KAAK,IAAI,EAAG,KAGjC,SAAA,UAAA,KAAA,SAAK,EAAQ,CACL,GAAA,GAA+E,KAA7E,EAAS,EAAA,UAAE,EAAO,EAAA,QAAE,EAAmB,EAAA,oBAAE,EAAkB,EAAA,mBAAE,EAAW,EAAA,YAChF,AAAK,GACH,GAAQ,KAAK,GACb,CAAC,GAAuB,EAAQ,KAAK,EAAmB,MAAQ,IAElE,KAAK,cACL,EAAA,UAAM,KAAI,KAAA,KAAC,IAIH,EAAA,UAAA,WAAV,SAAqB,EAAyB,CAC5C,KAAK,iBACL,KAAK,cAQL,OANM,GAAe,KAAK,gBAAgB,GAEpC,EAAmC,KAAjC,EAAmB,EAAA,oBAAE,EAAO,EAAA,QAG9B,EAAO,EAAQ,QACZ,EAAI,EAAG,EAAI,EAAK,QAAU,CAAC,EAAW,OAAQ,GAAK,EAAsB,EAAI,EACpF,EAAW,KAAK,EAAK,IAGvB,YAAK,wBAAwB,GAEtB,GAGD,EAAA,UAAA,YAAR,UAAA,CACQ,GAAA,GAAoE,KAAlE,EAAW,EAAA,YAAE,EAAkB,EAAA,mBAAE,EAAO,EAAA,QAAE,EAAmB,EAAA,oBAK/D,EAAsB,GAAsB,EAAI,GAAK,EAK3D,GAJA,EAAc,KAAY,EAAqB,EAAQ,QAAU,EAAQ,OAAO,EAAG,EAAQ,OAAS,GAIhG,CAAC,EAAqB,CAKxB,OAJM,GAAM,EAAmB,MAC3B,EAAO,EAGF,EAAI,EAAG,EAAI,EAAQ,QAAW,EAAQ,IAAiB,EAAK,GAAK,EACxE,EAAO,EAET,GAAQ,EAAQ,OAAO,EAAG,EAAO,KAGvC,GAzEsC,GClBtC,GAAA,IAAA,SAAA,EAAA,CAA+B,GAAA,EAAA,GAC7B,WAAY,EAAsB,EAAmD,OACnF,GAAA,KAAA,OAAO,KAYF,SAAA,UAAA,SAAP,SAAgB,EAAW,EAAiB,CAAjB,MAAA,KAAA,QAAA,GAAA,GAClB,MAEX,GAjB+B,ICJxB,GAAM,IAAqC,CAGhD,YAAW,UAAA,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACF,GAAA,GAAa,GAAgB,SACrC,MAAQ,KAAQ,KAAA,OAAR,EAAU,cAAe,aAAY,MAAA,OAAA,EAAA,GAAA,EAAI,MAEnD,cAAa,SAAC,EAAM,CACV,GAAA,GAAa,GAAgB,SACrC,MAAQ,KAAQ,KAAA,OAAR,EAAU,gBAAiB,eAAe,IAEpD,SAAU,QClBZ,GAAA,IAAA,SAAA,EAAA,CAAoC,GAAA,EAAA,GAOlC,WAAsB,EAAqC,EAAmD,CAA9G,GAAA,GACE,EAAA,KAAA,KAAM,EAAW,IAAK,KADF,SAAA,UAAA,EAAqC,EAAA,KAAA,EAFjD,EAAA,QAAmB,KAMtB,SAAA,UAAA,SAAP,SAAgB,EAAW,EAAiB,CAC1C,GADyB,IAAA,QAAA,GAAA,GACrB,KAAK,OACP,MAAO,MAIT,KAAK,MAAQ,EAEb,GAAM,GAAK,KAAK,GACV,EAAY,KAAK,UAuBvB,MAAI,IAAM,MACR,MAAK,GAAK,KAAK,eAAe,EAAW,EAAI,IAK/C,KAAK,QAAU,GAEf,KAAK,MAAQ,EAEb,KAAK,GAAK,KAAK,IAAM,KAAK,eAAe,EAAW,KAAK,GAAI,GAEtD,MAGC,EAAA,UAAA,eAAV,SAAyB,EAA2B,EAAW,EAAiB,CAAjB,MAAA,KAAA,QAAA,GAAA,GACtD,GAAiB,YAAY,EAAU,MAAM,KAAK,EAAW,MAAO,IAGnE,EAAA,UAAA,eAAV,SAAyB,EAA4B,EAAS,EAAwB,CAEpF,GAF4D,IAAA,QAAA,GAAA,GAExD,GAAS,MAAQ,KAAK,QAAU,GAAS,KAAK,UAAY,GAC5D,MAAO,GAIT,GAAiB,cAAc,IAQ1B,EAAA,UAAA,QAAP,SAAe,EAAU,EAAa,CACpC,GAAI,KAAK,OACP,MAAO,IAAI,OAAM,gCAGnB,KAAK,QAAU,GACf,GAAM,GAAQ,KAAK,SAAS,EAAO,GACnC,GAAI,EACF,MAAO,GACF,AAAI,KAAK,UAAY,IAAS,KAAK,IAAM,MAc9C,MAAK,GAAK,KAAK,eAAe,KAAK,UAAW,KAAK,GAAI,QAIjD,EAAA,UAAA,SAAV,SAAmB,EAAU,EAAc,CACzC,GAAI,GAAmB,GACnB,EACJ,GAAI,CACF,KAAK,KAAK,SACH,EAAP,CACA,EAAU,GAIV,EAAa,GAAQ,GAAI,OAAM,sCAEjC,GAAI,EACF,YAAK,cACE,GAIX,EAAA,UAAA,YAAA,UAAA,CACE,GAAI,CAAC,KAAK,OAAQ,CACV,GAAA,GAAoB,KAAlB,EAAE,EAAA,GAAE,EAAS,EAAA,UACb,EAAY,EAAS,QAE7B,KAAK,KAAO,KAAK,MAAQ,KAAK,UAAY,KAC1C,KAAK,QAAU,GAEf,GAAU,EAAS,MACf,GAAM,MACR,MAAK,GAAK,KAAK,eAAe,EAAW,EAAI,OAG/C,KAAK,MAAQ,KACb,EAAA,UAAM,YAAW,KAAA,QAGvB,GA3IoC,ICiBpC,GAAA,IAAA,UAAA,CAGE,WAAoB,EAAoC,EAAiC,CAAjC,AAAA,IAAA,QAAA,GAAoB,EAAU,KAAlE,KAAA,oBAAA,EAClB,KAAK,IAAM,EA8BN,SAAA,UAAA,SAAP,SAAmB,EAAqD,EAAmB,EAAS,CAA5B,MAAA,KAAA,QAAA,GAAA,GAC/D,GAAI,MAAK,oBAAuB,KAAM,GAAM,SAAS,EAAO,IAlCvD,EAAA,IAAoB,GAAsB,IAoC1D,KCzDA,GAAA,IAAA,SAAA,EAAA,CAAoC,GAAA,EAAA,GAkBlC,WAAY,EAAgC,EAAiC,CAAjC,AAAA,IAAA,QAAA,GAAoB,GAAU,KAA1E,GAAA,GACE,EAAA,KAAA,KAAM,EAAiB,IAAI,KAlBtB,SAAA,QAAmC,GAOnC,EAAA,QAAmB,GAQnB,EAAA,WAAkB,SAMlB,SAAA,UAAA,MAAP,SAAa,EAAwB,CAC3B,GAAA,GAAY,KAAI,QAExB,GAAI,KAAK,QAAS,CAChB,EAAQ,KAAK,GACb,OAGF,GAAI,GACJ,KAAK,QAAU,GAEf,EACE,IAAK,EAAQ,EAAO,QAAQ,EAAO,MAAO,EAAO,OAC/C,YAEM,EAAS,EAAQ,SAI3B,GAFA,KAAK,QAAU,GAEX,EAAO,CACT,KAAQ,EAAS,EAAQ,SACvB,EAAO,cAET,KAAM,KAGZ,GAhDoC,IC8C7B,GAAM,IAAiB,GAAI,IAAe,IAKpC,GAAQ,GClDrB,GAAA,IAAA,SAAA,EAAA,CAA6C,GAAA,EAAA,GAC3C,WAAsB,EAA8C,EAAmD,CAAvH,GAAA,GACE,EAAA,KAAA,KAAM,EAAW,IAAK,KADF,SAAA,UAAA,EAA8C,EAAA,KAAA,IAI1D,SAAA,UAAA,eAAV,SAAyB,EAAoC,EAAU,EAAiB,CAEtF,MAFqE,KAAA,QAAA,GAAA,GAEjE,IAAU,MAAQ,EAAQ,EACrB,EAAA,UAAM,eAAc,KAAA,KAAC,EAAW,EAAI,GAG7C,GAAU,QAAQ,KAAK,MAIhB,EAAU,YAAe,GAAU,WAAa,GAAuB,sBAAsB,UAAA,CAAM,MAAA,GAAU,MAAM,aAElH,EAAA,UAAA,eAAV,SAAyB,EAAoC,EAAU,EAAiB,CAItF,GAJqE,IAAA,QAAA,GAAA,GAIhE,GAAS,MAAQ,EAAQ,GAAO,GAAS,MAAQ,KAAK,MAAQ,EACjE,MAAO,GAAA,UAAM,eAAc,KAAA,KAAC,EAAW,EAAI,GAK7C,AAAK,EAAU,QAAQ,KAAK,SAAC,EAAM,CAAK,MAAA,GAAO,KAAO,KACpD,IAAuB,qBAAqB,GAC5C,EAAU,WAAa,SAK7B,GAlC6C,ICF7C,GAAA,IAAA,SAAA,EAAA,CAA6C,GAAA,EAAA,GAA7C,YAAA,gDACS,SAAA,UAAA,MAAP,SAAa,EAAyB,CACpC,KAAK,QAAU,GAUf,GAAM,GAAU,KAAK,WACrB,KAAK,WAAa,OAEV,GAAA,GAAY,KAAI,QACpB,EACJ,EAAS,GAAU,EAAQ,QAE3B,EACE,IAAK,EAAQ,EAAO,QAAQ,EAAO,MAAO,EAAO,OAC/C,YAEM,GAAS,EAAQ,KAAO,EAAO,KAAO,GAAW,EAAQ,SAInE,GAFA,KAAK,QAAU,GAEX,EAAO,CACT,KAAQ,GAAS,EAAQ,KAAO,EAAO,KAAO,GAAW,EAAQ,SAC/D,EAAO,cAET,KAAM,KAGZ,GAlC6C,ICgCtC,GAAM,IAA0B,GAAI,IAAwB,IC8B5D,GAAM,GAAQ,GAAI,GAAkB,SAAC,EAAU,CAAK,MAAA,GAAW,aC9DhE,YAAsB,EAAU,CACpC,MAAO,IAAS,EAAW,EAAM,UCAnC,YAAiB,EAAQ,CACvB,MAAO,GAAI,EAAI,OAAS,GAGpB,YAA4B,EAAW,CAC3C,MAAO,GAAW,GAAK,IAAS,EAAK,MAAQ,OAGzC,YAAuB,EAAW,CACtC,MAAO,IAAY,GAAK,IAAS,EAAK,MAAQ,OAG1C,YAAoB,EAAa,EAAoB,CACzD,MAAO,OAAO,IAAK,IAAU,SAAW,EAAK,MAAS,ECjBjD,GAAM,IAAe,SAAI,EAAM,CAAwB,MAAA,IAAK,MAAO,GAAE,QAAW,UAAY,MAAO,IAAM,YCM1G,YAAoB,EAAU,CAClC,MAAO,GAAW,GAAK,KAAA,OAAL,EAAO,MCFrB,YAA8B,EAAU,CAC5C,MAAO,GAAW,EAAM,KCJpB,YAA6B,EAAQ,CACzC,MAAO,QAAO,eAAiB,EAAW,GAAG,KAAA,OAAH,EAAM,OAAO,gBCCnD,YAA2C,EAAU,CAEzD,MAAO,IAAI,WACT,gBACE,KAAU,MAAQ,MAAO,IAAU,SAAW,oBAAsB,IAAI,EAAK,KAAG,4HCRhF,aAA2B,CAC/B,MAAI,OAAO,SAAW,YAAc,CAAC,OAAO,SACnC,aAGF,OAAO,SAGT,GAAM,IAAW,KCJlB,YAAqB,EAAU,CACnC,MAAO,GAAW,GAAK,KAAA,OAAL,EAAQ,KCFtB,YAAuD,EAAqC,mGAC1F,EAAS,EAAe,qEAGF,MAAA,CAAA,EAAA,GAAM,EAAO,sBAA/B,GAAkB,EAAA,OAAhB,EAAK,EAAA,MAAE,EAAI,EAAA,KACf,iBAAA,CAAA,EAAA,UACF,MAAA,CAAA,EAAA,EAAA,2BAEI,WAAN,MAAA,CAAA,EAAA,EAAA,eAAA,SAAA,wCAGF,SAAO,yCAIL,YAAkC,EAAQ,CAG9C,MAAO,GAAW,GAAG,KAAA,OAAH,EAAK,WCPnB,WAAuB,EAAyB,CACpD,GAAI,YAAiB,GACnB,MAAO,GAET,GAAI,GAAS,KAAM,CACjB,GAAI,GAAoB,GACtB,MAAO,IAAsB,GAE/B,GAAI,GAAY,GACd,MAAO,IAAc,GAEvB,GAAI,GAAU,GACZ,MAAO,IAAY,GAErB,GAAI,GAAgB,GAClB,MAAO,IAAkB,GAE3B,GAAI,GAAW,GACb,MAAO,IAAa,GAEtB,GAAI,GAAqB,GACvB,MAAO,IAAuB,GAIlC,KAAM,IAAiC,GAOnC,YAAmC,EAAQ,CAC/C,MAAO,IAAI,GAAW,SAAC,EAAyB,CAC9C,GAAM,GAAM,EAAI,MAChB,GAAI,EAAW,EAAI,WACjB,MAAO,GAAI,UAAU,GAGvB,KAAM,IAAI,WAAU,oEAWlB,YAA2B,EAAmB,CAClD,MAAO,IAAI,GAAW,SAAC,EAAyB,CAU9C,OAAS,GAAI,EAAG,EAAI,EAAM,QAAU,CAAC,EAAW,OAAQ,IACtD,EAAW,KAAK,EAAM,IAExB,EAAW,aAIT,YAAyB,EAAuB,CACpD,MAAO,IAAI,GAAW,SAAC,EAAyB,CAC9C,EACG,KACC,SAAC,EAAK,CACJ,AAAK,EAAW,QACd,GAAW,KAAK,GAChB,EAAW,aAGf,SAAC,EAAQ,CAAK,MAAA,GAAW,MAAM,KAEhC,KAAK,KAAM,MAIZ,YAA0B,EAAqB,CACnD,MAAO,IAAI,GAAW,SAAC,EAAyB,aAC9C,OAAoB,GAAA,GAAA,GAAQ,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAAzB,GAAM,GAAK,EAAA,MAEd,GADA,EAAW,KAAK,GACZ,EAAW,OACb,yGAGJ,EAAW,aAIT,YAA+B,EAA+B,CAClE,MAAO,IAAI,GAAW,SAAC,EAAyB,CAC9C,GAAQ,EAAe,GAAY,MAAM,SAAC,EAAG,CAAK,MAAA,GAAW,MAAM,OAIjE,YAAoC,EAAqC,CAC7E,MAAO,IAAkB,GAAmC,IAG9D,YAA0B,EAAiC,EAAyB,uIACxD,EAAA,GAAA,iFAIxB,GAJe,EAAK,EAAA,MACpB,EAAW,KAAK,GAGZ,EAAW,OACb,MAAA,CAAA,8RAGJ,SAAW,oBC/GP,YACJ,EACA,EACA,EACA,EACA,EAAc,CADd,AAAA,IAAA,QAAA,GAAA,GACA,IAAA,QAAA,GAAA,IAEA,GAAM,GAAuB,EAAU,SAAS,UAAA,CAC9C,IACA,AAAI,EACF,EAAmB,IAAI,KAAK,SAAS,KAAM,IAE3C,KAAK,eAEN,GAIH,GAFA,EAAmB,IAAI,GAEnB,CAAC,EAKH,MAAO,GCiBL,YAAuB,EAA0B,EAAS,CAAT,MAAA,KAAA,QAAA,GAAA,GAC9C,EAAQ,SAAC,EAAQ,EAAU,CAChC,EAAO,UACL,EACE,EACA,SAAC,EAAK,CAAK,MAAA,IAAgB,EAAY,EAAW,UAAA,CAAM,MAAA,GAAW,KAAK,IAAQ,IAChF,UAAA,CAAM,MAAA,IAAgB,EAAY,EAAW,UAAA,CAAM,MAAA,GAAW,YAAY,IAC1E,SAAC,EAAG,CAAK,MAAA,IAAgB,EAAY,EAAW,UAAA,CAAM,MAAA,GAAW,MAAM,IAAM,QCH/E,YAAyB,EAA0B,EAAiB,CAAjB,MAAA,KAAA,QAAA,GAAA,GAChD,EAAQ,SAAC,EAAQ,EAAU,CAChC,EAAW,IAAI,EAAU,SAAS,UAAA,CAAM,MAAA,GAAO,UAAU,IAAa,MC3DpE,YAAgC,EAA6B,EAAwB,CACzF,MAAO,GAAU,GAAO,KAAK,GAAY,GAAY,GAAU,ICD3D,YAA6B,EAAuB,EAAwB,CAChF,MAAO,GAAU,GAAO,KAAK,GAAY,GAAY,GAAU,ICH3D,YAA2B,EAAqB,EAAwB,CAC5E,MAAO,IAAI,GAAc,SAAC,EAAU,CAElC,GAAI,GAAI,EAER,MAAO,GAAU,SAAS,UAAA,CACxB,AAAI,IAAM,EAAM,OAGd,EAAW,WAIX,GAAW,KAAK,EAAM,MAIjB,EAAW,QACd,KAAK,gBCVT,YAA8B,EAAoB,EAAwB,CAC9E,MAAO,IAAI,GAAc,SAAC,EAAU,CAClC,GAAI,GAKJ,UAAgB,EAAY,EAAW,UAAA,CAErC,EAAY,EAAc,MAE1B,GACE,EACA,EACA,UAAA,OACM,EACA,EACJ,GAAI,CAEF,AAAC,EAAkB,EAAS,OAAzB,EAAK,EAAA,MAAE,EAAI,EAAA,WACP,EAAP,CAEA,EAAW,MAAM,GACjB,OAGF,AAAI,EAKF,EAAW,WAGX,EAAW,KAAK,IAGpB,EACA,MAQG,UAAA,CAAM,MAAA,GAAW,GAAQ,KAAA,OAAR,EAAU,SAAW,EAAS,YCrDpD,YAAmC,EAAyB,EAAwB,CACxF,GAAI,CAAC,EACH,KAAM,IAAI,OAAM,2BAElB,MAAO,IAAI,GAAc,SAAC,EAAU,CAClC,GAAgB,EAAY,EAAW,UAAA,CACrC,GAAM,GAAW,EAAM,OAAO,iBAC9B,GACE,EACA,EACA,UAAA,CACE,EAAS,OAAO,KAAK,SAAC,EAAM,CAC1B,AAAI,EAAO,KAGT,EAAW,WAEX,EAAW,KAAK,EAAO,UAI7B,EACA,QCrBF,YAAwC,EAA8B,EAAwB,CAClG,MAAO,IAAsB,GAAmC,GAAQ,GCqBpE,YAAuB,EAA2B,EAAwB,CAC9E,GAAI,GAAS,KAAM,CACjB,GAAI,GAAoB,GACtB,MAAO,IAAmB,EAAO,GAEnC,GAAI,GAAY,GACd,MAAO,IAAc,EAAO,GAE9B,GAAI,GAAU,GACZ,MAAO,IAAgB,EAAO,GAEhC,GAAI,GAAgB,GAClB,MAAO,IAAsB,EAAO,GAEtC,GAAI,GAAW,GACb,MAAO,IAAiB,EAAO,GAEjC,GAAI,GAAqB,GACvB,MAAO,IAA2B,EAAO,GAG7C,KAAM,IAAiC,GCqDnC,YAAkB,EAA2B,EAAyB,CAC1E,MAAO,GAAY,GAAU,EAAO,GAAa,EAAU,GCvBvD,YAAY,QAAI,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACpB,GAAM,GAAY,GAAa,GAC/B,MAAO,IAAK,EAAa,GC1ErB,YAAsB,EAAU,CACpC,MAAO,aAAiB,OAAQ,CAAC,MAAM,GCuCnC,WAAoB,EAAyC,EAAa,CAC9E,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAEhC,GAAI,GAAQ,EAGZ,EAAO,UACL,EAAyB,EAAY,SAAC,EAAQ,CAG5C,EAAW,KAAK,EAAQ,KAAK,EAAS,EAAO,WCtD7C,GAAA,IAAY,MAAK,QAEzB,YAA2B,EAA6B,EAAW,CAC/D,MAAO,IAAQ,GAAQ,EAAE,MAAA,OAAA,EAAA,GAAA,EAAI,KAAQ,EAAG,GAOtC,YAAiC,EAA2B,CAC9D,MAAO,GAAI,SAAA,EAAI,CAAI,MAAA,IAAY,EAAI,KCd/B,GAAA,IAAY,MAAK,QACjB,GAA0D,OAAM,eAArC,GAA+B,OAAM,UAAlB,GAAY,OAAM,KAQlE,YAA+D,EAAuB,CAC1F,GAAI,EAAK,SAAW,EAAG,CACrB,GAAM,GAAQ,EAAK,GACnB,GAAI,GAAQ,GACV,MAAO,CAAE,KAAM,EAAO,KAAM,MAE9B,GAAI,GAAO,GAAQ,CACjB,GAAM,GAAO,GAAQ,GACrB,MAAO,CACL,KAAM,EAAK,IAAI,SAAC,EAAG,CAAK,MAAA,GAAM,KAC9B,KAAI,IAKV,MAAO,CAAE,KAAM,EAAa,KAAM,MAGpC,YAAgB,EAAQ,CACtB,MAAO,IAAO,MAAO,IAAQ,UAAY,GAAe,KAAS,GC5B7D,YAAuB,EAAgB,EAAa,CACxD,MAAO,GAAK,OAAO,SAAC,EAAQ,EAAK,EAAC,CAAK,MAAE,GAAO,GAAO,EAAO,GAAK,GAAS,ICuMxE,YAAuB,QAAoC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAC/D,GAAM,GAAY,GAAa,GACzB,EAAiB,GAAkB,GAEnC,EAA8B,GAAqB,GAA3C,EAAW,EAAA,KAAE,EAAI,EAAA,KAE/B,GAAI,EAAY,SAAW,EAIzB,MAAO,IAAK,GAAI,GAGlB,GAAM,GAAS,GAAI,GACjB,GACE,EACA,EACA,EAEI,SAAC,EAAM,CAAK,MAAA,IAAa,EAAM,IAE/B,KAIR,MAAO,GAAkB,EAAO,KAAK,GAAiB,IAAqC,EAGvF,YACJ,EACA,EACA,EAAiD,CAAjD,MAAA,KAAA,QAAA,GAAA,IAEO,SAAC,EAA2B,CAGjC,GACE,EACA,UAAA,CAaE,OAZQ,GAAW,EAAW,OAExB,EAAS,GAAI,OAAM,GAGrB,EAAS,EAIT,EAAuB,aAGlB,EAAC,CACR,GACE,EACA,UAAA,CACE,GAAM,GAAS,GAAK,EAAY,GAAI,GAChC,EAAgB,GACpB,EAAO,UACL,EACE,EACA,SAAC,EAAK,CAEJ,EAAO,GAAK,EACP,GAEH,GAAgB,GAChB,KAEG,GAGH,EAAW,KAAK,EAAe,EAAO,WAG1C,UAAA,CACE,AAAK,EAAE,GAGL,EAAW,eAMrB,IAjCK,EAAI,EAAG,EAAI,EAAQ,MAAnB,IAqCX,IASN,YAAuB,EAAsC,EAAqB,EAA0B,CAC1G,AAAI,EACF,GAAgB,EAAc,EAAW,GAEzC,ICzRE,YACJ,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EAA+B,CAG/B,GAAM,GAAc,GAEhB,EAAS,EAET,EAAQ,EAER,EAAa,GAKX,EAAgB,UAAA,CAIpB,AAAI,GAAc,CAAC,EAAO,QAAU,CAAC,GACnC,EAAW,YAKT,EAAY,SAAC,EAAQ,CAAK,MAAC,GAAS,EAAa,EAAW,GAAS,EAAO,KAAK,IAEjF,EAAa,SAAC,EAAQ,CAI1B,GAAU,EAAW,KAAK,GAI1B,IAKA,GAAI,GAAgB,GAGpB,EAAU,EAAQ,EAAO,MAAU,UACjC,EACE,EACA,SAAC,EAAU,CAGT,GAAY,MAAZ,EAAe,GAEf,AAAI,EAGF,EAAU,GAGV,EAAW,KAAK,IAGpB,UAAA,CAGE,EAAgB,IAGlB,OACA,UAAA,CAIE,GAAI,EAKF,GAAI,CAIF,IAKA,qBACE,GAAM,GAAgB,EAAO,QAI7B,AAAI,EACF,GAAgB,EAAY,EAAmB,UAAA,CAAM,MAAA,GAAW,KAEhE,EAAW,IARR,EAAO,QAAU,EAAS,OAYjC,UACO,EAAP,CACA,EAAW,MAAM,QAS7B,SAAO,UACL,EAAyB,EAAY,EAAW,UAAA,CAE9C,EAAa,GACb,OAMG,UAAA,CACL,GAAkB,MAAlB,KChEE,YACJ,EACA,EACA,EAA6B,CAE7B,MAFA,KAAA,QAAA,GAAA,KAEI,EAAW,GAEN,GAAS,SAAC,EAAG,EAAC,CAAK,MAAA,GAAI,SAAC,EAAQ,EAAU,CAAK,MAAA,GAAe,EAAG,EAAG,EAAG,KAAK,EAAU,EAAQ,EAAG,MAAM,GACrG,OAAO,IAAmB,UACnC,GAAa,GAGR,EAAQ,SAAC,EAAQ,EAAU,CAAK,MAAA,IAAe,EAAQ,EAAY,EAAS,MC/B/E,YAAmD,EAA6B,CAA7B,MAAA,KAAA,QAAA,GAAA,KAChD,GAAS,GAAU,GCLtB,aAAmB,CACvB,MAAO,IAAS,GCoDZ,aAAgB,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACrB,MAAO,MAAY,GAAK,EAAM,GAAa,KC7DvC,WAAgD,EAA0B,CAC9E,MAAO,IAAI,GAA+B,SAAC,EAAU,CACnD,EAAU,KAAqB,UAAU,KC9C7C,GAAM,IAA0B,CAAC,cAAe,kBAC1C,GAAqB,CAAC,mBAAoB,uBAC1C,GAAgB,CAAC,KAAM,OA8NvB,WACJ,EACA,EACA,EACA,EAAsC,CAMtC,GAJI,EAAW,IACb,GAAiB,EACjB,EAAU,QAER,EACF,MAAO,GAAa,EAAQ,EAAW,GAAiC,KAAK,GAAiB,IAU1F,GAAA,GAAA,EAEJ,GAAc,GACV,GAAmB,IAAI,SAAC,EAAU,CAAK,MAAA,UAAC,EAAY,CAAK,MAAA,GAAO,GAAY,EAAW,EAAS,MAElG,GAAwB,GACtB,GAAwB,IAAI,GAAwB,EAAQ,IAC5D,GAA0B,GAC1B,GAAc,IAAI,GAAwB,EAAQ,IAClD,GAAE,GATD,EAAG,EAAA,GAAE,EAAM,EAAA,GAgBlB,GAAI,CAAC,GACC,GAAY,GACd,MAAO,IAAS,SAAC,EAAc,CAAK,MAAA,GAAU,EAAW,EAAW,KAClE,EAAU,IAOhB,GAAI,CAAC,EACH,KAAM,IAAI,WAAU,wBAGtB,MAAO,IAAI,GAAc,SAAC,EAAU,CAIlC,GAAM,GAAU,UAAA,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAAmB,MAAA,GAAW,KAAK,EAAI,EAAK,OAAS,EAAO,EAAK,KAElF,SAAI,GAEG,UAAA,CAAM,MAAA,GAAQ,MAWzB,YAAiC,EAAa,EAAiB,CAC7D,MAAO,UAAC,EAAkB,CAAK,MAAA,UAAC,EAAY,CAAK,MAAA,GAAO,GAAY,EAAW,KAQjF,YAAiC,EAAW,CAC1C,MAAO,GAAW,EAAO,cAAgB,EAAW,EAAO,gBAQ7D,YAAmC,EAAW,CAC5C,MAAO,GAAW,EAAO,KAAO,EAAW,EAAO,KAQpD,YAAuB,EAAW,CAChC,MAAO,GAAW,EAAO,mBAAqB,EAAW,EAAO,qBC9L5D,YACJ,EACA,EACA,EAAsC,CAEtC,MAAI,GACK,GAAoB,EAAY,GAAe,KAAK,GAAiB,IAGvE,GAAI,GAAoB,SAAC,EAAU,CACxC,GAAM,GAAU,UAAA,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAAc,MAAA,GAAW,KAAK,EAAE,SAAW,EAAI,EAAE,GAAK,IACjE,EAAW,EAAW,GAC5B,MAAO,GAAW,GAAiB,UAAA,CAAM,MAAA,GAAc,EAAS,IAAY,SCpB1E,YACJ,EACA,EACA,EAAyC,CAFzC,AAAA,IAAA,QAAA,GAAA,GAEA,IAAA,QAAA,GAAA,IAIA,GAAI,GAAmB,GAEvB,MAAI,IAAuB,MAIzB,CAAI,GAAY,GACd,EAAY,EAIZ,EAAmB,GAIhB,GAAI,GAAW,SAAC,EAAU,CAI/B,GAAI,GAAM,GAAY,GAAW,CAAC,EAAU,EAAW,MAAQ,EAE/D,AAAI,EAAM,GAER,GAAM,GAIR,GAAI,GAAI,EAGR,MAAO,GAAU,SAAS,UAAA,CACxB,AAAK,EAAW,QAEd,GAAW,KAAK,KAEhB,AAAI,GAAK,EAGP,KAAK,SAAS,OAAW,GAGzB,EAAW,aAGd,KC9FD,YAAe,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACpB,GAAM,GAAY,GAAa,GACzB,EAAa,GAAU,EAAM,KAC7B,EAAU,EAChB,MAAO,AAAC,GAAQ,OAGZ,EAAQ,SAAW,EAEnB,EAAU,EAAQ,IAElB,GAAS,GAAY,GAAK,EAAS,IALnC,EC3DC,GAAM,IAAQ,GAAI,GAAkB,ICpCnC,GAAA,IAAY,MAAK,QAMnB,YAA4B,EAAiB,CACjD,MAAO,GAAK,SAAW,GAAK,GAAQ,EAAK,IAAM,EAAK,GAAM,ECqDtD,WAAoB,EAAiD,EAAa,CACtF,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAEhC,GAAI,GAAQ,EAIZ,EAAO,UAIL,EAAyB,EAAY,SAAC,EAAK,CAAK,MAAA,GAAU,KAAK,EAAS,EAAO,MAAY,EAAW,KAAK,QCrB3G,aAAa,QAAC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAClB,GAAM,GAAiB,GAAkB,GAEnC,EAAU,GAAe,GAE/B,MAAO,GAAQ,OACX,GAAI,GAAsB,SAAC,EAAU,CAGnC,GAAI,GAAuB,EAAQ,IAAI,UAAA,CAAM,MAAA,KAKzC,EAAY,EAAQ,IAAI,UAAA,CAAM,MAAA,KAGlC,EAAW,IAAI,UAAA,CACb,EAAU,EAAY,OAMxB,mBAAS,EAAW,CAClB,EAAU,EAAQ,IAAc,UAC9B,EACE,EACA,SAAC,EAAK,CAKJ,GAJA,EAAQ,GAAa,KAAK,GAItB,EAAQ,MAAM,SAAC,EAAM,CAAK,MAAA,GAAO,SAAS,CAC5C,GAAM,GAAc,EAAQ,IAAI,SAAC,EAAM,CAAK,MAAA,GAAO,UAEnD,EAAW,KAAK,EAAiB,EAAc,MAAA,OAAA,EAAA,GAAA,EAAI,KAAU,GAIzD,EAAQ,KAAK,SAAC,EAAQ,EAAC,CAAK,MAAA,CAAC,EAAO,QAAU,EAAU,MAC1D,EAAW,aAIjB,UAAA,CAGE,EAAU,GAAe,GAIzB,CAAC,EAAQ,GAAa,QAAU,EAAW,eA5B1C,EAAc,EAAG,CAAC,EAAW,QAAU,EAAc,EAAQ,OAAQ,MAArE,GAmCT,MAAO,WAAA,CACL,EAAU,EAAY,QAG1B,EC7DA,YAAmB,EAAoD,CAC3E,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAW,GACX,EAAsB,KACtB,EAA6C,KAC7C,EAAa,GAEX,EAAc,UAAA,CAGlB,GAFA,GAAkB,MAAlB,EAAoB,cACpB,EAAqB,KACjB,EAAU,CACZ,EAAW,GACX,GAAM,GAAQ,EACd,EAAY,KACZ,EAAW,KAAK,GAElB,GAAc,EAAW,YAGrB,EAAkB,UAAA,CACtB,EAAqB,KACrB,GAAc,EAAW,YAG3B,EAAO,UACL,EACE,EACA,SAAC,EAAK,CACJ,EAAW,GACX,EAAY,EACP,GACH,EAAU,EAAiB,IAAQ,UAChC,EAAqB,EAAyB,EAAY,EAAa,KAI9E,UAAA,CACE,EAAa,GACZ,EAAC,GAAY,CAAC,GAAsB,EAAmB,SAAW,EAAW,gBCtClF,YAAuB,EAAkB,EAAyC,CAAzC,MAAA,KAAA,QAAA,GAAA,IACtC,GAAM,UAAA,CAAM,MAAA,IAAM,EAAU,KCG/B,YAAyB,EAAoB,EAAsC,CAAtC,MAAA,KAAA,QAAA,GAAA,MAGjD,EAAmB,GAAgB,KAAhB,EAAoB,EAEhC,EAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAiB,GACjB,EAAQ,EAEZ,EAAO,UACL,EACE,EACA,SAAC,EAAK,aACA,EAAuB,KAK3B,AAAI,IAAU,IAAsB,GAClC,EAAQ,KAAK,QAIf,OAAqB,GAAA,GAAA,GAAO,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAAzB,GAAM,GAAM,EAAA,MACf,EAAO,KAAK,GAMR,GAAc,EAAO,QACvB,GAAS,GAAM,KAAN,EAAU,GACnB,EAAO,KAAK,sGAIhB,GAAI,MAIF,OAAqB,GAAA,GAAA,GAAM,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAAxB,GAAM,GAAM,EAAA,MACf,GAAU,EAAS,GACnB,EAAW,KAAK,uGAItB,UAAA,aAGE,OAAqB,GAAA,GAAA,GAAO,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAAzB,GAAM,GAAM,EAAA,MACf,EAAW,KAAK,qGAElB,EAAW,YAGb,OACA,UAAA,CAEE,EAAU,UCRd,YACJ,EAAgD,CAEhD,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAgC,KAChC,EAAY,GACZ,EAEJ,EAAW,EAAO,UAChB,EAAyB,EAAY,OAAW,OAAW,SAAC,EAAG,CAC7D,EAAgB,EAAU,EAAS,EAAK,GAAW,GAAU,KAC7D,AAAI,EACF,GAAS,cACT,EAAW,KACX,EAAc,UAAU,IAIxB,EAAY,MAKd,GAMF,GAAS,cACT,EAAW,KACX,EAAe,UAAU,MC5HzB,YACJ,EACA,EACA,EACA,EACA,EAAqC,CAErC,MAAO,UAAC,EAAuB,EAA2B,CAIxD,GAAI,GAAW,EAIX,EAAa,EAEb,EAAQ,EAGZ,EAAO,UACL,EACE,EACA,SAAC,EAAK,CAEJ,GAAM,GAAI,IAEV,EAAQ,EAEJ,EAAY,EAAO,EAAO,GAIxB,GAAW,GAAO,GAGxB,GAAc,EAAW,KAAK,IAIhC,GACG,UAAA,CACC,GAAY,EAAW,KAAK,GAC5B,EAAW,eC9BjB,aAAuB,QAAO,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAClC,GAAM,GAAiB,GAAkB,GACzC,MAAO,GACH,GAAK,GAAa,MAAA,OAAA,EAAA,GAAA,EAAK,KAAuC,GAAiB,IAC/E,EAAQ,SAAC,EAAQ,EAAU,CACzB,GAAiB,EAAA,CAAE,GAAM,EAAK,GAAe,MAAQ,KCYvD,aAA2B,QAC/B,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAEA,MAAO,IAAa,MAAA,OAAA,EAAA,GAAA,EAAI,KCgCpB,YACJ,EACA,EAA6G,CAE7G,MAAO,GAAW,GAAkB,GAAS,EAAS,EAAgB,GAAK,GAAS,EAAS,GCnBzF,YAA0B,EAAiB,EAAyC,CAAzC,MAAA,KAAA,QAAA,GAAA,IACxC,EAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAkC,KAClC,EAAsB,KACtB,EAA0B,KAExB,EAAO,UAAA,CACX,GAAI,EAAY,CAEd,EAAW,cACX,EAAa,KACb,GAAM,GAAQ,EACd,EAAY,KACZ,EAAW,KAAK,KAGpB,YAAqB,CAInB,GAAM,GAAa,EAAY,EACzB,EAAM,EAAU,MACtB,GAAI,EAAM,EAAY,CAEpB,EAAa,KAAK,SAAS,OAAW,EAAa,GACnD,EAAW,IAAI,GACf,OAGF,IAGF,EAAO,UACL,EACE,EACA,SAAC,EAAQ,CACP,EAAY,EACZ,EAAW,EAAU,MAGhB,GACH,GAAa,EAAU,SAAS,EAAc,GAC9C,EAAW,IAAI,KAGnB,UAAA,CAGE,IACA,EAAW,YAGb,OACA,UAAA,CAEE,EAAY,EAAa,UC/E7B,YAA+B,EAAe,CAClD,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAW,GACf,EAAO,UACL,EACE,EACA,SAAC,EAAK,CACJ,EAAW,GACX,EAAW,KAAK,IAElB,UAAA,CACE,AAAK,GACH,EAAW,KAAK,GAElB,EAAW,gBCNf,YAAkB,EAAa,CACnC,MAAO,IAAS,EAEZ,UAAA,CAAM,MAAA,IACN,EAAQ,SAAC,EAAQ,EAAU,CACzB,GAAI,GAAO,EACX,EAAO,UACL,EAAyB,EAAY,SAAC,EAAK,CAIzC,AAAI,EAAE,GAAQ,GACZ,GAAW,KAAK,GAIZ,GAAS,GACX,EAAW,iBCxBrB,aAAwB,CAC5B,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,EAAO,UAAU,EAAyB,EAAY,OCHpD,YAAmB,EAAQ,CAC/B,MAAO,GAAI,UAAA,CAAM,MAAA,KCkCb,YACJ,EACA,EAAmC,CAEnC,MAAI,GAEK,SAAC,EAAqB,CAC3B,MAAA,IAAO,EAAkB,KAAK,GAAK,GAAI,MAAmB,EAAO,KAAK,GAAU,MAG7E,GAAS,SAAC,EAAO,EAAK,CAAK,MAAA,GAAsB,EAAO,GAAO,KAAK,GAAK,GAAI,GAAM,MCvBtF,YAAmB,EAAoB,EAAyC,CAAzC,AAAA,IAAA,QAAA,GAAA,IAC3C,GAAM,GAAW,GAAM,EAAK,GAC5B,MAAO,IAAU,UAAA,CAAM,MAAA,KC6EnB,WACJ,EACA,EAA0D,CAA1D,MAAA,KAAA,QAAA,GAA+B,IAK/B,EAAa,GAAU,KAAV,EAAc,GAEpB,EAAQ,SAAC,EAAQ,EAAU,CAGhC,GAAI,GAEA,EAAQ,GAEZ,EAAO,UACL,EAAyB,EAAY,SAAC,EAAK,CAEzC,GAAM,GAAa,EAAY,GAK/B,AAAI,IAAS,CAAC,EAAY,EAAa,KAMrC,GAAQ,GACR,EAAc,EAGd,EAAW,KAAK,SAO1B,YAAwB,EAAQ,EAAM,CACpC,MAAO,KAAM,EClHT,WAAwD,EAAQ,EAAuC,CAC3G,MAAO,GAAqB,SAAC,EAAM,EAAI,CAAK,MAAA,GAAU,EAAQ,EAAE,GAAM,EAAE,IAAQ,EAAE,KAAS,EAAE,KCJzF,aAAiB,QAAI,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACzB,MAAO,UAAC,EAAqB,CAAK,MAAA,IAAO,EAAQ,EAAE,MAAA,OAAA,EAAA,GAAA,EAAI,OCFnD,WAAsB,EAAoB,CAC9C,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAGhC,GAAI,CACF,EAAO,UAAU,WAEjB,EAAW,IAAI,MC3Bf,YAAsB,EAAa,CACvC,MAAO,IAAS,EACZ,UAAA,CAAM,MAAA,IACN,EAAQ,SAAC,EAAQ,EAAU,CAKzB,GAAI,GAAc,GAClB,EAAO,UACL,EACE,EACA,SAAC,EAAK,CAEJ,EAAO,KAAK,GAGZ,EAAQ,EAAO,QAAU,EAAO,SAElC,UAAA,aAGE,OAAoB,GAAA,GAAA,GAAM,EAAA,EAAA,OAAA,CAAA,EAAA,KAAA,EAAA,EAAA,OAAE,CAAvB,GAAM,GAAK,EAAA,MACd,EAAW,KAAK,qGAElB,EAAW,YAGb,OACA,UAAA,CAEE,EAAS,UCrDjB,aAAe,QAAI,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACvB,GAAM,GAAY,GAAa,GACzB,EAAa,GAAU,EAAM,KACnC,SAAO,GAAe,GAEf,EAAQ,SAAC,EAAQ,EAAU,CAChC,GAAS,GAAY,GAAI,EAAA,CAAE,GAAM,EAAM,IAAgC,IAAY,UAAU,KCgB3F,aAAmB,QACvB,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAEA,MAAO,IAAK,MAAA,OAAA,EAAA,GAAA,EAAI,KCoEZ,YAAoB,EAAqC,OACzD,EAAQ,IACR,EAEJ,MAAI,IAAiB,MACnB,CAAI,MAAO,IAAkB,SACxB,GAA4B,EAAa,MAAzC,EAAK,IAAA,OAAG,IAAQ,EAAE,EAAU,EAAa,OAE5C,EAAQ,GAIL,GAAS,EACZ,UAAA,CAAM,MAAA,IACN,EAAQ,SAAC,EAAQ,EAAU,CACzB,GAAI,GAAQ,EACR,EAEE,EAAc,UAAA,CAGlB,GAFA,GAAS,MAAT,EAAW,cACX,EAAY,KACR,GAAS,KAAM,CACjB,GAAM,GAAW,MAAO,IAAU,SAAW,GAAM,GAAS,EAAU,EAAM,IACtE,EAAqB,EAAyB,EAAY,UAAA,CAC9D,EAAmB,cACnB,MAEF,EAAS,UAAU,OAEnB,MAIE,EAAoB,UAAA,CACxB,GAAI,GAAY,GAChB,EAAY,EAAO,UACjB,EAAyB,EAAY,OAAW,UAAA,CAC9C,AAAI,EAAE,EAAQ,EACZ,AAAI,EACF,IAEA,EAAY,GAGd,EAAW,cAKb,GACF,KAIJ,MC3HF,YAAoB,EAAyB,CACjD,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAW,GACX,EAAsB,KAC1B,EAAO,UACL,EAAyB,EAAY,SAAC,EAAK,CACzC,EAAW,GACX,EAAY,KAGhB,EAAS,UACP,EACE,EACA,UAAA,CACE,GAAI,EAAU,CACZ,EAAW,GACX,GAAM,GAAQ,EACd,EAAY,KACZ,EAAW,KAAK,KAGpB,OCoBF,YAAwB,EAA6D,EAAQ,CAMjG,MAAO,GAAQ,GAAc,EAAa,EAAW,UAAU,QAAU,EAAG,KCkDxE,YAAmB,EAA4B,CAA5B,AAAA,IAAA,QAAA,GAAA,IACf,GAAA,GAAgH,EAAO,UAAvH,EAAS,IAAA,OAAG,UAAA,CAAM,MAAA,IAAI,IAAY,EAAE,EAA4E,EAAO,aAAnF,EAAY,IAAA,OAAG,GAAI,EAAE,EAAuD,EAAO,gBAA9D,EAAe,IAAA,OAAG,GAAI,EAAE,EAA+B,EAAO,oBAAtC,EAAmB,IAAA,OAAG,GAAI,EAUnH,MAAO,UAAC,EAAa,CACnB,GAAI,GAAuC,KACvC,EAAuC,KACvC,EAAiC,KACjC,EAAW,EACX,EAAe,GACf,EAAa,GAEX,EAAc,UAAA,CAClB,GAAe,MAAf,EAAiB,cACjB,EAAkB,MAId,EAAQ,UAAA,CACZ,IACA,EAAa,EAAU,KACvB,EAAe,EAAa,IAExB,EAAsB,UAAA,CAG1B,GAAM,GAAO,EACb,IACA,GAAI,MAAJ,EAAM,eAGR,MAAO,GAAc,SAAC,EAAQ,GAAU,CACtC,IACI,CAAC,GAAc,CAAC,GAClB,IAOF,GAAM,IAAQ,EAAU,GAAO,KAAP,EAAW,IAOnC,GAAW,IAAI,UAAA,CACb,IAKI,IAAa,GAAK,CAAC,GAAc,CAAC,GACpC,GAAkB,GAAY,EAAqB,MAMvD,GAAK,UAAU,IAEV,GAMH,GAAa,GAAI,IAAe,CAC9B,KAAM,SAAC,GAAK,CAAK,MAAA,IAAK,KAAK,KAC3B,MAAO,SAAC,GAAG,CACT,EAAa,GACb,IACA,EAAkB,GAAY,EAAO,EAAc,IACnD,GAAK,MAAM,KAEb,SAAU,UAAA,CACR,EAAe,GACf,IACA,EAAkB,GAAY,EAAO,GACrC,GAAK,cAGT,GAAK,GAAQ,UAAU,MAExB,IAIP,YACE,EACA,EAA+C,QAC/C,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,EAAA,GAAA,UAAA,GAEA,MAAI,KAAO,GACT,KAEO,MAGL,IAAO,GACF,KAGF,EAAE,MAAA,OAAA,EAAA,GAAA,EAAI,KACV,KAAK,GAAK,IACV,UAAU,UAAA,CAAM,MAAA,OCxGf,WACJ,EACA,EACA,EAAyB,SAErB,EACA,EAAW,GACf,MAAI,IAAsB,MAAO,IAAuB,SACtD,GAAa,GAAA,EAAmB,cAAU,MAAA,IAAA,OAAA,EAAI,IAC9C,EAAa,GAAA,EAAmB,cAAU,MAAA,IAAA,OAAA,EAAI,IAC9C,EAAW,CAAC,CAAC,EAAmB,SAChC,EAAY,EAAmB,WAE/B,EAAa,GAAkB,KAAlB,EAAsB,IAE9B,GAAS,CACd,UAAW,UAAA,CAAM,MAAA,IAAI,IAAc,EAAY,EAAY,IAC3D,aAAc,GACd,gBAAiB,GACjB,oBAAqB,ICxInB,YAAkB,EAAa,CACnC,MAAO,GAAO,SAAC,EAAG,EAAK,CAAK,MAAA,IAAS,ICYjC,YAAuB,EAAyB,CACpD,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAS,GAEP,EAAiB,EACrB,EACA,UAAA,CACE,GAAc,MAAd,EAAgB,cAChB,EAAS,IAEX,IAGF,EAAU,GAAU,UAAU,GAE9B,EAAO,UAAU,EAAyB,EAAY,SAAC,EAAK,CAAK,MAAA,IAAU,EAAW,KAAK,QCNzF,YAAmB,QAAO,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GAC9B,GAAM,GAAY,GAAa,GAC/B,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAIhC,AAAC,GAAY,GAAO,EAAQ,EAAQ,GAAa,GAAO,EAAQ,IAAS,UAAU,KCqBjF,WACJ,EACA,EAA6G,CAE7G,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAyD,KACzD,EAAQ,EAER,EAAa,GAIX,EAAgB,UAAA,CAAM,MAAA,IAAc,CAAC,GAAmB,EAAW,YAEzE,EAAO,UACL,EACE,EACA,SAAC,EAAK,CAEJ,GAAe,MAAf,EAAiB,cACjB,GAAI,GAAa,EACX,EAAa,IAEnB,EAAU,EAAQ,EAAO,IAAa,UACnC,EAAkB,EACjB,EAIA,SAAC,EAAU,CAAK,MAAA,GAAW,KAAK,EAAiB,EAAe,EAAO,EAAY,EAAY,KAAgB,IAC/G,UAAA,CAIE,EAAkB,KAClB,QAKR,UAAA,CACE,EAAa,GACb,SCrEJ,YACJ,EACA,EAA6G,CAE7G,MAAO,GAAW,GAAkB,EAAU,UAAA,CAAM,MAAA,IAAiB,GAAkB,EAAU,UAAA,CAAM,MAAA,KCjBnG,YAAuB,EAA8B,CACzD,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,EAAU,GAAU,UAAU,EAAyB,EAAY,UAAA,CAAM,MAAA,GAAW,YAAY,KAChG,CAAC,EAAW,QAAU,EAAO,UAAU,KCMrC,YAAuB,EAAiD,EAAiB,CAAjB,MAAA,KAAA,QAAA,GAAA,IACrE,EAAQ,SAAC,EAAQ,EAAU,CAChC,GAAI,GAAQ,EACZ,EAAO,UACL,EAAyB,EAAY,SAAC,EAAK,CACzC,GAAM,GAAS,EAAU,EAAO,KAChC,AAAC,IAAU,IAAc,EAAW,KAAK,GACzC,CAAC,GAAU,EAAW,gBC6CxB,WACJ,EACA,EACA,EAA8B,CAK9B,GAAM,GACJ,EAAW,IAAmB,GAAS,EAElC,CAAE,KAAM,EAA2E,MAAK,EAAE,SAAQ,GACnG,EAEN,MAAO,GACH,EAAQ,SAAC,EAAQ,EAAU,OACzB,AAAA,GAAA,EAAY,aAAS,MAAA,IAAA,QAAA,EAAA,KAArB,GACA,GAAI,GAAU,GACd,EAAO,UACL,EACE,EACA,SAAC,EAAK,OACJ,AAAA,GAAA,EAAY,QAAI,MAAA,IAAA,QAAA,EAAA,KAAhB,EAAmB,GACnB,EAAW,KAAK,IAElB,UAAA,OACE,EAAU,GACV,GAAA,EAAY,YAAQ,MAAA,IAAA,QAAA,EAAA,KAApB,GACA,EAAW,YAEb,SAAC,EAAG,OACF,EAAU,GACV,GAAA,EAAY,SAAK,MAAA,IAAA,QAAA,EAAA,KAAjB,EAAoB,GACpB,EAAW,MAAM,IAEnB,UAAA,SACE,AAAI,GACF,IAAA,EAAY,eAAW,MAAA,IAAA,QAAA,EAAA,KAAvB,IAEF,GAAA,EAAY,YAAQ,MAAA,IAAA,QAAA,EAAA,KAApB,QAQR,GC7IC,GAAM,IAAwC,CACnD,QAAS,GACT,SAAU,IAiDN,YACJ,EACA,EAA8C,CAA9C,MAAA,KAAA,QAAA,GAAA,IAEO,EAAQ,SAAC,EAAQ,EAAU,CACxB,GAAA,GAAsB,EAAM,QAAnB,EAAa,EAAM,SAChC,EAAW,GACX,EAAsB,KACtB,EAAiC,KACjC,EAAa,GAEX,EAAgB,UAAA,CACpB,GAAS,MAAT,EAAW,cACX,EAAY,KACR,GACF,KACA,GAAc,EAAW,aAIvB,EAAoB,UAAA,CACxB,EAAY,KACZ,GAAc,EAAW,YAGrB,EAAgB,SAAC,EAAQ,CAC7B,MAAC,GAAY,EAAU,EAAiB,IAAQ,UAAU,EAAyB,EAAY,EAAe,KAE1G,EAAO,UAAA,CACX,GAAI,EAAU,CAIZ,EAAW,GACX,GAAM,GAAQ,EACd,EAAY,KAEZ,EAAW,KAAK,GAChB,CAAC,GAAc,EAAc,KAIjC,EAAO,UACL,EACE,EAMA,SAAC,EAAK,CACJ,EAAW,GACX,EAAY,EACZ,CAAE,IAAa,CAAC,EAAU,SAAY,GAAU,IAAS,EAAc,KAEzE,UAAA,CACE,EAAa,GACb,CAAE,IAAY,GAAY,GAAa,CAAC,EAAU,SAAW,EAAW,gBClE5E,YACJ,EACA,EACA,EAA8B,CAD9B,AAAA,IAAA,QAAA,GAAA,IACA,IAAA,QAAA,GAAA,IAEA,GAAM,GAAY,GAAM,EAAU,GAClC,MAAO,IAAS,UAAA,CAAM,MAAA,IAAW,GCH7B,aAAwB,QAAO,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACnC,GAAM,GAAU,GAAkB,GAElC,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAehC,OAdM,GAAM,EAAO,OACb,EAAc,GAAI,OAAM,GAI1B,EAAW,EAAO,IAAI,UAAA,CAAM,MAAA,KAG5B,EAAQ,cAMH,EAAC,CACR,EAAU,EAAO,IAAI,UACnB,EACE,EACA,SAAC,EAAK,CACJ,EAAY,GAAK,EACb,CAAC,GAAS,CAAC,EAAS,IAEtB,GAAS,GAAK,GAKb,GAAQ,EAAS,MAAM,MAAe,GAAW,QAKtD,MAlBG,EAAI,EAAG,EAAI,EAAK,MAAhB,GAwBT,EAAO,UACL,EAAyB,EAAY,SAAC,EAAK,CACzC,GAAI,EAAO,CAET,GAAM,GAAM,EAAA,CAAI,GAAK,EAAK,IAC1B,EAAW,KAAK,EAAU,EAAO,MAAA,OAAA,EAAA,GAAA,EAAI,KAAU,SCnFnD,aAAa,QAAO,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACxB,MAAO,GAAQ,SAAC,EAAQ,EAAU,CAChC,GAAS,MAAA,OAAA,EAAA,CAAC,GAA8B,EAAM,KAAyC,UAAU,KCG/F,aAAiB,QAAkC,GAAA,GAAA,EAAA,EAAA,EAAA,UAAA,OAAA,IAAA,EAAA,GAAA,UAAA,GACvD,MAAO,IAAG,MAAA,OAAA,EAAA,GAAA,EAAI,KCaT,aAA4C,CACjD,GAAM,GAAY,GAAI,IAAwB,GAC9C,SAAU,SAAU,mBAAoB,CAAE,KAAM,KAC7C,UAAU,IAAM,EAAU,KAAK,WAG3B,ECFF,WACL,EAAkB,EAAmB,SAChC,CACL,MAAO,OAAM,KAAK,EAAK,iBAAoB,IAwBtC,WACL,EAAkB,EAAmB,SAClC,CACH,GAAM,GAAK,GAAsB,EAAU,GAC3C,GAAI,MAAO,IAAO,YAChB,KAAM,IAAI,gBACR,8BAA8B,oBAIlC,MAAO,GAuBF,YACL,EAAkB,EAAmB,SACtB,CACf,MAAO,GAAK,cAAiB,IAAa,OAQrC,aAAqD,CAC1D,MAAO,UAAS,wBAAyB,cACrC,SAAS,eAAiB,OChEzB,YACL,EACqB,CACrB,MAAO,GACL,EAAU,SAAS,KAAM,WACzB,EAAU,SAAS,KAAM,aAExB,KACC,GAAa,GACb,EAAI,IAAM,CACR,GAAM,GAAS,KACf,MAAO,OAAO,IAAW,YACrB,EAAG,SAAS,GACZ,KAEN,EAAU,IAAO,MACjB,KCdC,YACL,EACe,CACf,MAAO,CACL,EAAG,EAAG,WACN,EAAG,EAAG,WAaH,YACL,EAC2B,CAC3B,MAAO,GACL,EAAU,OAAQ,QAClB,EAAU,OAAQ,WAEjB,KACC,GAAU,EAAG,IACb,EAAI,IAAM,GAAiB,IAC3B,EAAU,GAAiB,KCtC1B,YACL,EACe,CACf,MAAO,CACL,EAAG,EAAG,WACN,EAAG,EAAG,WAaH,YACL,EAC2B,CAC3B,MAAO,GACL,EAAU,EAAI,UACd,EAAU,OAAQ,WAEjB,KACC,GAAU,EAAG,IACb,EAAI,IAAM,GAAwB,IAClC,EAAU,GAAwB,KClExC,GAAI,IAAW,UAAY,CACvB,GAAI,MAAO,MAAQ,YACf,MAAO,KASX,WAAkB,EAAK,EAAK,CACxB,GAAI,GAAS,GACb,SAAI,KAAK,SAAU,EAAO,EAAO,CAC7B,MAAI,GAAM,KAAO,EACb,GAAS,EACF,IAEJ,KAEJ,EAEX,MAAsB,WAAY,CAC9B,YAAmB,CACf,KAAK,YAAc,GAEvB,cAAO,eAAe,EAAQ,UAAW,OAAQ,CAI7C,IAAK,UAAY,CACb,MAAO,MAAK,YAAY,QAE5B,WAAY,GACZ,aAAc,KAMlB,EAAQ,UAAU,IAAM,SAAU,EAAK,CACnC,GAAI,GAAQ,EAAS,KAAK,YAAa,GACnC,EAAQ,KAAK,YAAY,GAC7B,MAAO,IAAS,EAAM,IAO1B,EAAQ,UAAU,IAAM,SAAU,EAAK,EAAO,CAC1C,GAAI,GAAQ,EAAS,KAAK,YAAa,GACvC,AAAI,CAAC,EACD,KAAK,YAAY,GAAO,GAAK,EAG7B,KAAK,YAAY,KAAK,CAAC,EAAK,KAOpC,EAAQ,UAAU,OAAS,SAAU,EAAK,CACtC,GAAI,GAAU,KAAK,YACf,EAAQ,EAAS,EAAS,GAC9B,AAAI,CAAC,GACD,EAAQ,OAAO,EAAO,IAO9B,EAAQ,UAAU,IAAM,SAAU,EAAK,CACnC,MAAO,CAAC,CAAC,CAAC,EAAS,KAAK,YAAa,IAKzC,EAAQ,UAAU,MAAQ,UAAY,CAClC,KAAK,YAAY,OAAO,IAO5B,EAAQ,UAAU,QAAU,SAAU,EAAU,EAAK,CACjD,AAAI,IAAQ,QAAU,GAAM,MAC5B,OAAS,GAAK,EAAG,EAAK,KAAK,YAAa,EAAK,EAAG,OAAQ,IAAM,CAC1D,GAAI,GAAQ,EAAG,GACf,EAAS,KAAK,EAAK,EAAM,GAAI,EAAM,MAGpC,QAOX,GAAY,MAAO,SAAW,aAAe,MAAO,WAAa,aAAe,OAAO,WAAa,SAGpG,GAAY,UAAY,CACxB,MAAI,OAAO,SAAW,aAAe,OAAO,OAAS,KAC1C,OAEP,MAAO,OAAS,aAAe,KAAK,OAAS,KACtC,KAEP,MAAO,SAAW,aAAe,OAAO,OAAS,KAC1C,OAGJ,SAAS,oBAShB,GAA2B,UAAY,CACvC,MAAI,OAAO,wBAA0B,WAI1B,sBAAsB,KAAK,IAE/B,SAAU,EAAU,CAAE,MAAO,YAAW,UAAY,CAAE,MAAO,GAAS,KAAK,QAAW,IAAO,QAIpG,GAAkB,EAStB,YAAmB,EAAU,EAAO,CAChC,GAAI,GAAc,GAAO,EAAe,GAAO,EAAe,EAO9D,YAA0B,CACtB,AAAI,GACA,GAAc,GACd,KAEA,GACA,IAUR,YAA2B,CACvB,GAAwB,GAO5B,YAAiB,CACb,GAAI,GAAY,KAAK,MACrB,GAAI,EAAa,CAEb,GAAI,EAAY,EAAe,GAC3B,OAMJ,EAAe,OAGf,GAAc,GACd,EAAe,GACf,WAAW,EAAiB,GAEhC,EAAe,EAEnB,MAAO,GAIX,GAAI,IAAgB,GAGhB,GAAiB,CAAC,MAAO,QAAS,SAAU,OAAQ,QAAS,SAAU,OAAQ,UAE/E,GAA4B,MAAO,mBAAqB,YAIxD,GAA0C,UAAY,CAMtD,YAAoC,CAMhC,KAAK,WAAa,GAMlB,KAAK,qBAAuB,GAM5B,KAAK,mBAAqB,KAM1B,KAAK,WAAa,GAClB,KAAK,iBAAmB,KAAK,iBAAiB,KAAK,MACnD,KAAK,QAAU,GAAS,KAAK,QAAQ,KAAK,MAAO,IAQrD,SAAyB,UAAU,YAAc,SAAU,EAAU,CACjE,AAAK,CAAC,KAAK,WAAW,QAAQ,IAC1B,KAAK,WAAW,KAAK,GAGpB,KAAK,YACN,KAAK,YASb,EAAyB,UAAU,eAAiB,SAAU,EAAU,CACpE,GAAI,GAAY,KAAK,WACjB,EAAQ,EAAU,QAAQ,GAE9B,AAAI,CAAC,GACD,EAAU,OAAO,EAAO,GAGxB,CAAC,EAAU,QAAU,KAAK,YAC1B,KAAK,eASb,EAAyB,UAAU,QAAU,UAAY,CACrD,GAAI,GAAkB,KAAK,mBAG3B,AAAI,GACA,KAAK,WAWb,EAAyB,UAAU,iBAAmB,UAAY,CAE9D,GAAI,GAAkB,KAAK,WAAW,OAAO,SAAU,EAAU,CAC7D,MAAO,GAAS,eAAgB,EAAS,cAO7C,SAAgB,QAAQ,SAAU,EAAU,CAAE,MAAO,GAAS,oBACvD,EAAgB,OAAS,GAQpC,EAAyB,UAAU,SAAW,UAAY,CAGtD,AAAI,CAAC,IAAa,KAAK,YAMvB,UAAS,iBAAiB,gBAAiB,KAAK,kBAChD,OAAO,iBAAiB,SAAU,KAAK,SACvC,AAAI,GACA,MAAK,mBAAqB,GAAI,kBAAiB,KAAK,SACpD,KAAK,mBAAmB,QAAQ,SAAU,CACtC,WAAY,GACZ,UAAW,GACX,cAAe,GACf,QAAS,MAIb,UAAS,iBAAiB,qBAAsB,KAAK,SACrD,KAAK,qBAAuB,IAEhC,KAAK,WAAa,KAQtB,EAAyB,UAAU,YAAc,UAAY,CAGzD,AAAI,CAAC,IAAa,CAAC,KAAK,YAGxB,UAAS,oBAAoB,gBAAiB,KAAK,kBACnD,OAAO,oBAAoB,SAAU,KAAK,SACtC,KAAK,oBACL,KAAK,mBAAmB,aAExB,KAAK,sBACL,SAAS,oBAAoB,qBAAsB,KAAK,SAE5D,KAAK,mBAAqB,KAC1B,KAAK,qBAAuB,GAC5B,KAAK,WAAa,KAStB,EAAyB,UAAU,iBAAmB,SAAU,EAAI,CAChE,GAAI,GAAK,EAAG,aAAc,EAAe,IAAO,OAAS,GAAK,EAE1D,EAAmB,GAAe,KAAK,SAAU,EAAK,CACtD,MAAO,CAAC,CAAC,CAAC,EAAa,QAAQ,KAEnC,AAAI,GACA,KAAK,WAQb,EAAyB,YAAc,UAAY,CAC/C,MAAK,MAAK,WACN,MAAK,UAAY,GAAI,IAElB,KAAK,WAOhB,EAAyB,UAAY,KAC9B,KAUP,GAAsB,SAAU,EAAQ,EAAO,CAC/C,OAAS,GAAK,EAAG,EAAK,OAAO,KAAK,GAAQ,EAAK,EAAG,OAAQ,IAAM,CAC5D,GAAI,GAAM,EAAG,GACb,OAAO,eAAe,EAAQ,EAAK,CAC/B,MAAO,EAAM,GACb,WAAY,GACZ,SAAU,GACV,aAAc,KAGtB,MAAO,IASP,GAAe,SAAU,EAAQ,CAIjC,GAAI,GAAc,GAAU,EAAO,eAAiB,EAAO,cAAc,YAGzE,MAAO,IAAe,IAItB,GAAY,GAAe,EAAG,EAAG,EAAG,GAOxC,YAAiB,EAAO,CACpB,MAAO,YAAW,IAAU,EAShC,YAAwB,EAAQ,CAE5B,OADI,GAAY,GACP,EAAK,EAAG,EAAK,UAAU,OAAQ,IACpC,EAAU,EAAK,GAAK,UAAU,GAElC,MAAO,GAAU,OAAO,SAAU,EAAM,EAAU,CAC9C,GAAI,GAAQ,EAAO,UAAY,EAAW,UAC1C,MAAO,GAAO,GAAQ,IACvB,GAQP,YAAqB,EAAQ,CAGzB,OAFI,GAAY,CAAC,MAAO,QAAS,SAAU,QACvC,EAAW,GACN,EAAK,EAAG,EAAc,EAAW,EAAK,EAAY,OAAQ,IAAM,CACrE,GAAI,GAAW,EAAY,GACvB,EAAQ,EAAO,WAAa,GAChC,EAAS,GAAY,GAAQ,GAEjC,MAAO,GASX,YAA2B,EAAQ,CAC/B,GAAI,GAAO,EAAO,UAClB,MAAO,IAAe,EAAG,EAAG,EAAK,MAAO,EAAK,QAQjD,YAAmC,EAAQ,CAGvC,GAAI,GAAc,EAAO,YAAa,EAAe,EAAO,aAS5D,GAAI,CAAC,GAAe,CAAC,EACjB,MAAO,IAEX,GAAI,GAAS,GAAY,GAAQ,iBAAiB,GAC9C,EAAW,GAAY,GACvB,EAAW,EAAS,KAAO,EAAS,MACpC,EAAU,EAAS,IAAM,EAAS,OAKlC,EAAQ,GAAQ,EAAO,OAAQ,EAAS,GAAQ,EAAO,QAqB3D,GAlBI,EAAO,YAAc,cAOjB,MAAK,MAAM,EAAQ,KAAc,GACjC,IAAS,GAAe,EAAQ,OAAQ,SAAW,GAEnD,KAAK,MAAM,EAAS,KAAa,GACjC,IAAU,GAAe,EAAQ,MAAO,UAAY,IAOxD,CAAC,GAAkB,GAAS,CAK5B,GAAI,GAAgB,KAAK,MAAM,EAAQ,GAAY,EAC/C,EAAiB,KAAK,MAAM,EAAS,GAAW,EAMpD,AAAI,KAAK,IAAI,KAAmB,GAC5B,IAAS,GAET,KAAK,IAAI,KAAoB,GAC7B,IAAU,GAGlB,MAAO,IAAe,EAAS,KAAM,EAAS,IAAK,EAAO,GAQ9D,GAAI,IAAwB,UAAY,CAGpC,MAAI,OAAO,qBAAuB,YACvB,SAAU,EAAQ,CAAE,MAAO,aAAkB,IAAY,GAAQ,oBAKrE,SAAU,EAAQ,CAAE,MAAQ,aAAkB,IAAY,GAAQ,YACrE,MAAO,GAAO,SAAY,eAQlC,YAA2B,EAAQ,CAC/B,MAAO,KAAW,GAAY,GAAQ,SAAS,gBAQnD,YAAwB,EAAQ,CAC5B,MAAK,IAGD,GAAqB,GACd,GAAkB,GAEtB,GAA0B,GALtB,GAcf,YAA4B,EAAI,CAC5B,GAAI,GAAI,EAAG,EAAG,EAAI,EAAG,EAAG,EAAQ,EAAG,MAAO,EAAS,EAAG,OAElD,EAAS,MAAO,kBAAoB,YAAc,gBAAkB,OACpE,EAAO,OAAO,OAAO,EAAO,WAEhC,UAAmB,EAAM,CACrB,EAAG,EAAG,EAAG,EAAG,MAAO,EAAO,OAAQ,EAClC,IAAK,EACL,MAAO,EAAI,EACX,OAAQ,EAAS,EACjB,KAAM,IAEH,EAYX,YAAwB,EAAG,EAAG,EAAO,EAAQ,CACzC,MAAO,CAAE,EAAG,EAAG,EAAG,EAAG,MAAO,EAAO,OAAQ,GAO/C,GAAI,IAAmC,UAAY,CAM/C,WAA2B,EAAQ,CAM/B,KAAK,eAAiB,EAMtB,KAAK,gBAAkB,EAMvB,KAAK,aAAe,GAAe,EAAG,EAAG,EAAG,GAC5C,KAAK,OAAS,EAQlB,SAAkB,UAAU,SAAW,UAAY,CAC/C,GAAI,GAAO,GAAe,KAAK,QAC/B,YAAK,aAAe,EACZ,EAAK,QAAU,KAAK,gBACxB,EAAK,SAAW,KAAK,iBAQ7B,EAAkB,UAAU,cAAgB,UAAY,CACpD,GAAI,GAAO,KAAK,aAChB,YAAK,eAAiB,EAAK,MAC3B,KAAK,gBAAkB,EAAK,OACrB,GAEJ,KAGP,GAAqC,UAAY,CAOjD,WAA6B,EAAQ,EAAU,CAC3C,GAAI,GAAc,GAAmB,GAOrC,GAAmB,KAAM,CAAE,OAAQ,EAAQ,YAAa,IAE5D,MAAO,MAGP,GAAmC,UAAY,CAW/C,WAA2B,EAAU,EAAY,EAAa,CAc1D,GAPA,KAAK,oBAAsB,GAM3B,KAAK,cAAgB,GAAI,IACrB,MAAO,IAAa,WACpB,KAAM,IAAI,WAAU,2DAExB,KAAK,UAAY,EACjB,KAAK,YAAc,EACnB,KAAK,aAAe,EAQxB,SAAkB,UAAU,QAAU,SAAU,EAAQ,CACpD,GAAI,CAAC,UAAU,OACX,KAAM,IAAI,WAAU,4CAGxB,GAAI,QAAO,UAAY,aAAe,CAAE,mBAAmB,UAG3D,IAAI,CAAE,aAAkB,IAAY,GAAQ,SACxC,KAAM,IAAI,WAAU,yCAExB,GAAI,GAAe,KAAK,cAExB,AAAI,EAAa,IAAI,IAGrB,GAAa,IAAI,EAAQ,GAAI,IAAkB,IAC/C,KAAK,YAAY,YAAY,MAE7B,KAAK,YAAY,aAQrB,EAAkB,UAAU,UAAY,SAAU,EAAQ,CACtD,GAAI,CAAC,UAAU,OACX,KAAM,IAAI,WAAU,4CAGxB,GAAI,QAAO,UAAY,aAAe,CAAE,mBAAmB,UAG3D,IAAI,CAAE,aAAkB,IAAY,GAAQ,SACxC,KAAM,IAAI,WAAU,yCAExB,GAAI,GAAe,KAAK,cAExB,AAAI,CAAC,EAAa,IAAI,IAGtB,GAAa,OAAO,GACf,EAAa,MACd,KAAK,YAAY,eAAe,SAQxC,EAAkB,UAAU,WAAa,UAAY,CACjD,KAAK,cACL,KAAK,cAAc,QACnB,KAAK,YAAY,eAAe,OAQpC,EAAkB,UAAU,aAAe,UAAY,CACnD,GAAI,GAAQ,KACZ,KAAK,cACL,KAAK,cAAc,QAAQ,SAAU,EAAa,CAC9C,AAAI,EAAY,YACZ,EAAM,oBAAoB,KAAK,MAU3C,EAAkB,UAAU,gBAAkB,UAAY,CAEtD,GAAI,EAAC,KAAK,YAGV,IAAI,GAAM,KAAK,aAEX,EAAU,KAAK,oBAAoB,IAAI,SAAU,EAAa,CAC9D,MAAO,IAAI,IAAoB,EAAY,OAAQ,EAAY,mBAEnE,KAAK,UAAU,KAAK,EAAK,EAAS,GAClC,KAAK,gBAOT,EAAkB,UAAU,YAAc,UAAY,CAClD,KAAK,oBAAoB,OAAO,IAOpC,EAAkB,UAAU,UAAY,UAAY,CAChD,MAAO,MAAK,oBAAoB,OAAS,GAEtC,KAMP,GAAY,MAAO,UAAY,YAAc,GAAI,SAAY,GAAI,IAKjE,GAAgC,UAAY,CAO5C,WAAwB,EAAU,CAC9B,GAAI,CAAE,gBAAgB,IAClB,KAAM,IAAI,WAAU,sCAExB,GAAI,CAAC,UAAU,OACX,KAAM,IAAI,WAAU,4CAExB,GAAI,GAAa,GAAyB,cACtC,EAAW,GAAI,IAAkB,EAAU,EAAY,MAC3D,GAAU,IAAI,KAAM,GAExB,MAAO,MAGX,CACI,UACA,YACA,cACF,QAAQ,SAAU,EAAQ,CACxB,GAAe,UAAU,GAAU,UAAY,CAC3C,GAAI,GACJ,MAAQ,GAAK,GAAU,IAAI,OAAO,GAAQ,MAAM,EAAI,cAI5D,GAAI,IAAS,UAAY,CAErB,MAAI,OAAO,IAAS,gBAAmB,YAC5B,GAAS,eAEb,MAGJ,GAAQ,GCr2Bf,GAAM,IAAS,GAAI,GAYb,GAAY,EAAM,IAAM,EAC5B,GAAI,IAAe,GAAW,CAC5B,OAAW,KAAS,GAClB,GAAO,KAAK,OAGf,KACC,EAAU,GAAY,EAAM,GAAO,EAAG,IACnC,KACC,EAAS,IAAM,EAAS,gBAG5B,EAAY,IAcT,YACL,EACa,CACb,MAAO,CACL,MAAQ,EAAG,YACX,OAAQ,EAAG,cAyBR,YACL,EACyB,CACzB,MAAO,IACJ,KACC,EAAI,GAAY,EAAS,QAAQ,IACjC,EAAU,GAAY,GACnB,KACC,EAAO,CAAC,CAAE,YAAa,IAAW,GAClC,EAAS,IAAM,EAAS,UAAU,IAClC,EAAI,IAAM,GAAe,MAG7B,EAAU,GAAe,KCxGxB,YACL,EACa,CACb,MAAO,CACL,MAAQ,EAAG,YACX,OAAQ,EAAG,cCWf,GAAM,IAAS,GAAI,GAUb,GAAY,EAAM,IAAM,EAC5B,GAAI,sBAAqB,GAAW,CAClC,OAAW,KAAS,GAClB,GAAO,KAAK,IACb,CACD,UAAW,MAGZ,KACC,EAAU,GAAY,EAAM,GAAO,EAAG,IACnC,KACC,EAAS,IAAM,EAAS,gBAG5B,EAAY,IAyCT,YACL,EAAiB,EAAY,GACR,CACrB,MAAO,IAA0B,GAC9B,KACC,EAAI,CAAC,CAAE,OAAQ,CACb,GAAM,GAAU,GAAe,GACzB,EAAU,GAAsB,GACtC,MAAO,IACL,EAAQ,OAAS,EAAQ,OAAS,IAGtC,KC/EN,GAAM,IAA4C,CAChD,OAAQ,EAAW,2BACnB,OAAQ,EAAW,4BAcd,YAAmB,EAAuB,CAC/C,MAAO,IAAQ,GAAM,QAchB,YAAmB,EAAc,EAAsB,CAC5D,AAAI,GAAQ,GAAM,UAAY,GAC5B,GAAQ,GAAM,QAYX,YAAqB,EAAmC,CAC7D,GAAM,GAAK,GAAQ,GACnB,MAAO,GAAU,EAAI,UAClB,KACC,EAAI,IAAM,EAAG,SACb,EAAU,EAAG,UChCnB,YACE,EAAiB,EACR,CACT,OAAQ,EAAG,iBAGJ,kBAEH,MAAI,GAAG,OAAS,QACP,SAAS,KAAK,GAEd,OAGN,uBACA,qBACH,MAAO,WAIP,MAAO,GAAG,mBAaT,aAA+C,CACpD,MAAO,GAAyB,OAAQ,WACrC,KACC,EAAO,GAAM,CAAE,GAAG,SAAW,EAAG,UAChC,EAAI,GAAO,EACT,KAAM,GAAU,UAAY,SAAW,SACvC,KAAM,EAAG,IACT,OAAQ,CACN,EAAG,iBACH,EAAG,sBAGP,EAAO,CAAC,CAAE,OAAM,UAAW,CACzB,GAAI,IAAS,SAAU,CACrB,GAAM,GAAS,KACf,GAAI,MAAO,IAAW,YACpB,MAAO,CAAC,GAAwB,EAAQ,GAE5C,MAAO,KAET,MClFC,aAA4B,CACjC,MAAO,IAAI,KAAI,SAAS,MAQnB,YAAqB,EAAgB,CAC1C,SAAS,KAAO,EAAI,KAUf,aAAuC,CAC5C,MAAO,IAAI,GCJb,YAAqB,EAAiB,EAA8B,CAGlE,GAAI,MAAO,IAAU,UAAY,MAAO,IAAU,SAChD,EAAG,WAAa,EAAM,mBAGb,YAAiB,MAC1B,EAAG,YAAY,WAGN,MAAM,QAAQ,GACvB,OAAW,KAAQ,GACjB,GAAY,EAAI,GA2Bf,WACL,EAAa,KAAmC,EAC7C,CACH,GAAM,GAAK,SAAS,cAAc,GAGlC,GAAI,EACF,OAAW,KAAQ,QAAO,KAAK,GAC7B,AAAI,MAAO,GAAW,IAAU,UAC9B,EAAG,aAAa,EAAM,EAAW,IAC1B,EAAW,IAClB,EAAG,aAAa,EAAM,IAG5B,OAAW,KAAS,GAClB,GAAY,EAAI,GAGlB,MAAO,GC1EF,YAAkB,EAAe,EAAmB,CACzD,GAAI,GAAI,EACR,GAAI,EAAM,OAAS,EAAG,CACpB,KAAO,EAAM,KAAO,KAAO,EAAE,EAAI,GAAG,CACpC,MAAO,GAAG,EAAM,UAAU,EAAG,QAE/B,MAAO,GAmBF,YAAe,EAAuB,CAC3C,GAAI,EAAQ,IAAK,CACf,GAAM,GAAS,CAAG,IAAQ,KAAO,IAAO,IACxC,MAAO,GAAK,IAAQ,MAAY,KAAM,QAAQ,UAE9C,OAAO,GAAM,WC1BV,aAAmC,CACxC,MAAO,UAAS,KAAK,UAAU,GAa1B,YAAyB,EAAoB,CAClD,GAAM,GAAK,EAAE,IAAK,CAAE,KAAM,IAC1B,EAAG,iBAAiB,QAAS,GAAM,EAAG,mBACtC,EAAG,QAUE,aAAiD,CACtD,MAAO,GAA2B,OAAQ,cACvC,KACC,EAAI,IACJ,EAAU,MACV,EAAO,GAAQ,EAAK,OAAS,GAC7B,EAAY,IASX,aAAwD,CAC7D,MAAO,MACJ,KACC,EAAI,GAAM,GAAmB,QAAQ,QACrC,EAAO,GAAM,MAAO,IAAO,cCxC1B,YAAoB,EAAoC,CAC7D,GAAM,GAAQ,WAAW,GACzB,MAAO,IAA0B,GAC/B,EAAM,YAAY,IAAM,EAAK,EAAM,WAElC,KACC,EAAU,EAAM,UASf,aAA2C,CAChD,GAAM,GAAQ,WAAW,SACzB,MAAO,GACL,EAAU,OAAQ,eAAe,KAAK,GAAM,KAC5C,EAAU,OAAQ,cAAc,KAAK,GAAM,MAE1C,KACC,EAAU,EAAM,UAgBf,YACL,EAA6B,EACd,CACf,MAAO,GACJ,KACC,EAAU,GAAU,EAAS,IAAY,IC5CxC,YACL,EAAmB,EAAuB,CAAE,YAAa,eACnC,CACtB,MAAO,IAAK,MAAM,GAAG,IAAO,IACzB,KACC,EAAO,GAAO,EAAI,SAAW,KAC7B,GAAW,IAAM,IAchB,YACL,EAAmB,EACJ,CACf,MAAO,IAAQ,EAAK,GACjB,KACC,EAAU,GAAO,EAAI,QACrB,EAAY,IAYX,YACL,EAAmB,EACG,CACtB,GAAM,GAAM,GAAI,WAChB,MAAO,IAAQ,EAAK,GACjB,KACC,EAAU,GAAO,EAAI,QACrB,EAAI,GAAO,EAAI,gBAAgB,EAAK,aACpC,EAAY,ICxCX,aAA6C,CAClD,MAAO,CACL,EAAG,KAAK,IAAI,EAAG,SACf,EAAG,KAAK,IAAI,EAAG,UAWZ,aAA2D,CAChE,MAAO,GACL,EAAU,OAAQ,SAAU,CAAE,QAAS,KACvC,EAAU,OAAQ,SAAU,CAAE,QAAS,MAEtC,KACC,EAAI,IACJ,EAAU,OCzBT,aAAyC,CAC9C,MAAO,CACL,MAAQ,WACR,OAAQ,aAWL,aAAuD,CAC5D,MAAO,GAAU,OAAQ,SAAU,CAAE,QAAS,KAC3C,KACC,EAAI,IACJ,EAAU,OCTT,aAA+C,CACpD,MAAO,GAAc,CACnB,KACA,OAEC,KACC,EAAI,CAAC,CAAC,EAAQ,KAAW,EAAE,SAAQ,UACnC,EAAY,ICRX,YACL,EAAiB,CAAE,YAAW,WACR,CACtB,GAAM,GAAQ,EACX,KACC,EAAwB,SAItB,EAAU,EAAc,CAAC,EAAO,IACnC,KACC,EAAI,IAAM,GAAiB,KAI/B,MAAO,GAAc,CAAC,EAAS,EAAW,IACvC,KACC,EAAI,CAAC,CAAC,CAAE,UAAU,CAAE,SAAQ,QAAQ,CAAE,IAAG,QAAU,EACjD,OAAQ,CACN,EAAG,EAAO,EAAI,EACd,EAAG,EAAO,EAAI,EAAI,GAEpB,WCOD,YACL,EAAgB,CAAE,OACH,CAGf,GAAM,GAAM,EAAwB,EAAQ,WACzC,KACC,EAAI,CAAC,CAAE,UAAW,IAItB,MAAO,GACJ,KACC,GAAS,IAAM,EAAK,CAAE,QAAS,GAAM,SAAU,KAC/C,EAAI,GAAW,EAAO,YAAY,IAClC,GAAY,GACZ,MCFN,GAAM,IAAS,EAAW,aACpB,GAAiB,KAAK,MAAM,GAAO,aACzC,GAAO,KAAO,GAAG,GAAI,KAAI,GAAO,KAAM,QAW/B,aAAiC,CACtC,MAAO,IAUF,YAAiB,EAAqB,CAC3C,MAAO,IAAO,SAAS,SAAS,GAW3B,WACL,EAAkB,EACV,CACR,MAAO,OAAO,IAAU,YACpB,GAAO,aAAa,GAAK,QAAQ,IAAK,EAAM,YAC5C,GAAO,aAAa,GC7BnB,YACL,EAAS,EAAmB,SACP,CACrB,MAAO,GAAW,sBAAsB,KAAS,GAa5C,YACL,EAAS,EAAmB,SACL,CACvB,MAAO,GAAY,sBAAsB,KAAS,GC9GpD,OAAwB,SCajB,YAA0B,EAAyB,CACxD,MACE,GAAC,QAAD,CAAO,MAAM,gBAAgB,SAAU,GACrC,EAAC,MAAD,CAAK,MAAM,mCACT,EAAC,MAAD,CAAK,MAAM,kCAEb,EAAC,OAAD,CAAM,MAAM,wBACV,EAAC,OAAD,CAAM,wBAAuB,MCN9B,YAA+B,EAAyB,CAC7D,MACE,GAAC,SAAD,CACE,MAAM,uBACN,MAAO,EAAY,kBACnB,wBAAuB,IAAI,aCejC,YACE,EAA2C,EAC9B,CACb,GAAM,GAAS,EAAO,EAChB,EAAS,EAAO,EAGhB,EAAU,OAAO,KAAK,EAAS,OAClC,OAAO,GAAO,CAAC,EAAS,MAAM,IAC9B,OAAyB,CAAC,EAAM,IAAQ,CACvC,GAAG,EAAM,EAAC,MAAD,KAAM,GAAY,KAC1B,IACF,MAAM,EAAG,IAGN,EAAM,GAAI,KAAI,EAAS,UAC7B,MAAI,IAAQ,qBACV,EAAI,aAAa,IAAI,IAAK,OAAO,QAAQ,EAAS,OAC/C,OAAO,CAAC,CAAC,CAAE,KAAW,GACtB,OAAO,CAAC,EAAW,CAAC,KAAW,GAAG,KAAa,IAAQ,OAAQ,KAKlE,EAAC,IAAD,CAAG,KAAM,GAAG,IAAO,MAAM,yBAAyB,SAAU,IAC1D,EAAC,UAAD,CACE,MAAO,CAAC,4BAA6B,GAAG,EACpC,CAAC,uCACD,IACF,KAAK,KACP,gBAAe,EAAS,MAAM,QAAQ,IAErC,EAAS,GAAK,EAAC,MAAD,CAAK,MAAM,mCAC1B,EAAC,KAAD,CAAI,MAAM,2BAA2B,EAAS,OAC7C,EAAS,GAAK,EAAS,KAAK,OAAS,GACpC,EAAC,IAAD,CAAG,MAAM,4BACN,GAAS,EAAS,KAAM,MAG5B,EAAS,GAAK,EAAQ,OAAS,GAC9B,EAAC,IAAD,CAAG,MAAM,2BACN,EAAY,8BAA8B,KAAM,KAmBtD,YACL,EACa,CACb,GAAM,GAAY,EAAO,GAAG,MACtB,EAAO,CAAC,GAAG,GAGX,EAAS,EAAK,UAAU,GAAO,CAAC,EAAI,SAAS,SAAS,MACtD,CAAC,GAAW,EAAK,OAAO,EAAQ,GAGlC,EAAQ,EAAK,UAAU,GAAO,EAAI,MAAQ,GAC9C,AAAI,IAAU,IACZ,GAAQ,EAAK,QAGf,GAAM,GAAO,EAAK,MAAM,EAAG,GACrB,EAAO,EAAK,MAAM,GAGlB,EAAW,CACf,GAAqB,EAAS,EAAc,CAAE,EAAC,GAAU,IAAU,IACnE,GAAG,EAAK,IAAI,GAAW,GAAqB,EAAS,IACrD,GAAG,EAAK,OAAS,CACf,EAAC,UAAD,CAAS,MAAM,0BACb,EAAC,UAAD,CAAS,SAAU,IAChB,EAAK,OAAS,GAAK,EAAK,SAAW,EAChC,EAAY,0BACZ,EAAY,2BAA4B,EAAK,SAG/C,EAAK,IAAI,GAAW,GAAqB,EAAS,MAEtD,IAIN,MACE,GAAC,KAAD,CAAI,MAAM,0BACP,GCvHA,YAA2B,EAAiC,CACjE,MACE,GAAC,KAAD,CAAI,MAAM,oBACP,OAAO,QAAQ,GAAO,IAAI,CAAC,CAAC,EAAK,KAChC,EAAC,KAAD,CAAI,MAAO,oCAAoC,KAC5C,MAAO,IAAU,SAAW,GAAM,GAAS,KCN/C,YAAqB,EAAiC,CAC3D,MACE,GAAC,MAAD,CAAK,MAAM,0BACT,EAAC,MAAD,CAAK,MAAM,qBACR,ICUT,YAAuB,EAA+B,CACpD,GAAM,GAAS,KAGT,EAAM,GAAI,KAAI,MAAM,EAAQ,WAAY,EAAO,MACrD,MACE,GAAC,KAAD,CAAI,MAAM,oBACR,EAAC,IAAD,CAAG,KAAM,EAAI,WAAY,MAAM,oBAC5B,EAAQ,QAkBV,YACL,EAAqB,EACR,CACb,MACE,GAAC,MAAD,CAAK,MAAM,cACT,EAAC,SAAD,CACE,MAAM,sBACN,aAAY,EAAY,yBAEvB,EAAO,OAEV,EAAC,KAAD,CAAI,MAAM,oBACP,EAAS,IAAI,MCdf,YACL,EAAiB,EACO,CACxB,GAAM,GAAU,EAAM,IAAM,EAAc,CACxC,GAAmB,GACnB,GAA0B,MAEzB,KACC,EAAI,CAAC,CAAC,CAAE,IAAG,KAAK,KAAY,CAC1B,GAAM,CAAE,SAAU,GAAe,GACjC,MAAQ,CACN,EAAG,EAAI,EAAO,EAAI,EAAQ,EAC1B,EAAG,EAAI,EAAO,MAMtB,MAAO,IAAkB,GACtB,KACC,EAAU,GAAU,EACjB,KACC,EAAI,GAAW,EAAE,SAAQ,YACzB,GAAK,CAAC,CAAC,GAAU,QAcpB,YACL,EAAiB,EACkB,CACnC,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,EAAM,UAAU,CAGd,KAAK,CAAE,UAAU,CACf,EAAG,MAAM,YAAY,iBAAkB,GAAG,EAAO,OACjD,EAAG,MAAM,YAAY,iBAAkB,GAAG,EAAO,QAInD,UAAW,CACT,EAAG,MAAM,eAAe,kBACxB,EAAG,MAAM,eAAe,qBAK5B,EACG,KACC,GAAa,IAAK,IAClB,EAAI,IAAM,EAAU,yBACpB,EAAI,CAAC,CAAE,OAAQ,IAEd,UAAU,CAGT,KAAK,EAAQ,CACX,AAAI,EACF,EAAG,MAAM,YAAY,iBAAkB,GAAG,CAAC,OAE3C,EAAG,MAAM,eAAe,mBAI5B,UAAW,CACT,EAAG,MAAM,eAAe,qBAKhC,GAAM,GAAQ,EAAW,uBAAwB,GAC3C,EAAQ,EAAU,EAAO,YAAa,CAAE,KAAM,KACpD,SACG,KACC,EAAU,CAAC,CAAE,YAAa,EAAS,EAAQ,GAC3C,EAAI,GAAM,EAAG,mBAEZ,UAAU,IAAM,EAAG,QAGjB,GAAgB,EAAI,GACxB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OCnGpC,YAA+B,EAAgC,CAC7D,GAAM,GAAkB,GACxB,OAAW,KAAW,GAAY,eAAgB,GAAY,CAC5D,GAAI,GACA,EAAO,EAAQ,WAGnB,KAAQ,EAAQ,YAAY,KAAK,EAAK,cAAgB,CACpD,GAAM,GAAS,EAAK,UAAU,EAAM,OACpC,EAAO,EAAO,UAAU,EAAM,GAAG,QACjC,EAAQ,KAAK,IAGjB,MAAO,GAST,YAAc,EAAqB,EAA2B,CAC5D,EAAO,OAAO,GAAG,MAAM,KAAK,EAAO,aAqB9B,YACL,EAAiB,EAAwB,CAAE,UACR,CAGnC,GAAM,GAAc,GAAI,KACxB,OAAW,KAAU,IAAsB,GAAY,CACrD,GAAM,CAAC,CAAE,GAAM,EAAO,YAAa,MAAM,aACzC,AAAI,GAAmB,gBAAgB,KAAO,IAC5C,GAAY,IAAI,CAAC,EAAI,GAAiB,CAAC,IACvC,EAAO,YAAY,EAAY,IAAI,CAAC,KAKxC,MAAI,GAAY,OAAS,EAChB,EAGF,EAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAGlB,SACG,KACC,GAAU,EAAM,KAAK,GAAS,MAE7B,UAAU,GAAU,CACnB,EAAG,OAAS,CAAC,EAGb,OAAW,CAAC,EAAI,IAAe,GAAa,CAC1C,GAAM,GAAQ,EAAW,cAAe,GAClC,EAAQ,EAAW,gBAAgB,KAAO,GAChD,AAAK,EAGH,GAAK,EAAO,GAFZ,GAAK,EAAO,MAOf,EAAM,GAAG,CAAC,GAAG,GACjB,IAAI,CAAC,CAAC,CAAE,KACP,GAAgB,EAAY,KAG7B,KACC,EAAS,IAAM,EAAM,YACrB,QRjFR,GAAI,IAAW,EAaf,YAA2B,EAA0C,CACnE,GAAI,EAAG,mBAAoB,CACzB,GAAM,GAAU,EAAG,mBACnB,GAAI,EAAQ,UAAY,KACtB,MAAO,GAGJ,GAAI,EAAQ,UAAY,KAAO,CAAC,EAAQ,SAAS,OACpD,MAAO,IAAkB,IAqBxB,YACL,EACuB,CACvB,MAAO,IAAiB,GACrB,KACC,EAAI,CAAC,CAAE,WAEE,EACL,WAAY,AAFE,GAAsB,GAEhB,MAAQ,KAGhC,EAAwB,eAiBvB,YACL,EAAiB,EAC8B,CAC/C,GAAM,CAAE,QAAS,GAAU,WAAW,WACtC,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GASlB,GARA,EAAM,UAAU,CAAC,CAAE,gBAAiB,CAClC,AAAI,GAAc,EAChB,EAAG,aAAa,WAAY,KAE5B,EAAG,gBAAgB,cAInB,WAAY,cAAe,CAC7B,GAAM,GAAS,EAAG,QAAQ,OAC1B,EAAO,GAAK,UAAU,EAAE,KACxB,EAAO,aACL,GAAsB,EAAO,IAC7B,GAKJ,GAAM,GAAY,EAAG,QAAQ,CAC3B,mCACA,mBACA,KAAK,OACP,GAAI,YAAqB,aAAa,CACpC,GAAM,GAAO,GAAkB,GAG/B,GAAI,MAAO,IAAS,aAClB,GAAU,UAAU,SAAS,aAC7B,GAAQ,0BACP,CACD,GAAM,GAAe,GAAoB,EAAM,EAAI,GAGnD,MAAO,IAAe,GACnB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,IAC5B,GAAU,GAAiB,GACxB,KACC,GAAU,EAAM,KAAK,GAAS,KAC9B,EAAI,CAAC,CAAE,QAAO,YAAa,GAAS,GACpC,IACA,EAAU,GAAU,EAAS,EAAe,OAQxD,MAAO,IAAe,GACnB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OSpI7B,YACL,EAAwB,CAAE,UAAS,UACd,CACrB,GAAI,GAAO,GACX,MAAO,GAGL,EACG,KACC,EAAI,GAAU,EAAO,QAAQ,wBAC7B,EAAO,GAAW,IAAO,GACzB,GAAe,CAAE,OAAQ,OAAQ,OAAQ,MAI7C,EACG,KACC,EAAO,GAAU,GAAU,CAAC,GAC5B,EAAI,IAAM,EAAO,EAAG,MACpB,EAAI,GAAW,EACb,OAAQ,EAAS,OAAS,aAiB7B,YACL,EAAwB,EACQ,CAChC,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SAAM,UAAU,CAAC,CAAE,SAAQ,YAAa,CACtC,AAAI,IAAW,OACb,EAAG,aAAa,OAAQ,IAExB,EAAG,gBAAgB,QACjB,GACF,EAAG,mBAIA,GAAa,EAAI,GACrB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OC3FpC,GAAM,IAAW,EAAE,SAgBZ,YACL,EACkC,CAClC,SAAG,YAAY,IACf,GAAS,YAAY,GAAY,IAG1B,EAAG,CAAE,IAAK,ICIZ,YACL,EACyB,CACzB,GAAM,GAAS,EAAY,iBAAkB,GAC7C,MAAO,GAAM,GAAG,EAAO,IAAI,GAAS,EAAU,EAAO,UAClD,KACC,GAAmB,CACjB,OAAQ,EAAW,aAAa,EAAM,YAIzC,KACC,EAAU,CACR,OAAQ,EAAW,aAAa,EAAO,GAAG,UAiB3C,YACL,EACoC,CACpC,GAAM,GAAY,EAAW,iBAAkB,GAC/C,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SAAc,CAAC,EAAO,GAAiB,KACpC,KACC,GAAU,EAAG,IACb,GAAU,EAAM,KAAK,GAAS,MAE7B,UAAU,CAGT,KAAK,CAAC,CAAE,WAAW,CACjB,GAAM,GAAS,GAAiB,GAC1B,CAAE,SAAU,GAAe,GAGjC,EAAG,MAAM,YAAY,mBAAoB,GAAG,EAAO,OACnD,EAAG,MAAM,YAAY,uBAAwB,GAAG,OAGhD,EAAU,SAAS,CACjB,SAAU,SACV,KAAM,EAAO,KAKjB,UAAW,CACT,EAAG,MAAM,eAAe,oBACxB,EAAG,MAAM,eAAe,2BAKzB,GAAiB,GACrB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OCrE7B,YACL,EAAiB,CAAE,UAAS,UACI,CAChC,MAAO,GAGL,GAAG,EAAY,aAAc,GAC1B,IAAI,GAAS,GAAe,EAAO,CAAE,YAGxC,GAAG,EAAY,qBAAsB,GAClC,IAAI,GAAS,GAAe,IAG/B,GAAG,EAAY,UAAW,GACvB,IAAI,GAAS,GAAa,EAAO,CAAE,UAAS,YAG/C,GAAG,EAAY,cAAe,GAC3B,IAAI,GAAS,GAAiB,KCZ9B,YACL,EAAkB,CAAE,UACA,CACpB,MAAO,GACJ,KACC,EAAU,GAAW,EACnB,EAAG,IACH,EAAG,IAAO,KAAK,GAAM,OAEpB,KACC,EAAI,GAAW,EAAE,UAAS,eAiB7B,YACL,EAAiB,EACc,CAC/B,GAAM,GAAQ,EAAW,cAAe,GACxC,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SAAM,UAAU,CAAC,CAAE,UAAS,YAAa,CACvC,EAAM,YAAc,EACpB,AAAI,EACF,EAAG,aAAa,gBAAiB,QAEjC,EAAG,gBAAgB,mBAIhB,GAAY,EAAI,GACpB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OC7BpC,YAAkB,CAAE,aAAgD,CAClE,GAAI,CAAC,GAAQ,mBACX,MAAO,GAAG,IAGZ,GAAM,GAAa,EAChB,KACC,EAAI,CAAC,CAAE,OAAQ,CAAE,QAAU,GAC3B,GAAY,EAAG,GACf,EAAI,CAAC,CAAC,EAAG,KAAO,CAAC,EAAI,EAAG,IACxB,EAAwB,IAItB,EAAU,EAAc,CAAC,EAAW,IACvC,KACC,EAAO,CAAC,CAAC,CAAE,UAAU,CAAC,CAAE,MAAQ,KAAK,IAAI,EAAI,EAAO,GAAK,KACzD,EAAI,CAAC,CAAC,CAAE,CAAC,MAAgB,GACzB,KAIE,EAAU,GAAY,UAC5B,MAAO,GAAc,CAAC,EAAW,IAC9B,KACC,EAAI,CAAC,CAAC,CAAE,UAAU,KAAY,EAAO,EAAI,KAAO,CAAC,GACjD,IACA,EAAU,GAAU,EAAS,EAAU,EAAG,KAC1C,EAAU,KAgBT,YACL,EAAiB,EACG,CACpB,MAAO,GAAM,IAAM,CACjB,GAAM,GAAS,iBAAiB,GAChC,MAAO,GACL,EAAO,WAAa,UACpB,EAAO,WAAa,oBAGrB,KACC,GAAkB,GAAiB,GAAK,GAAS,IACjD,EAAI,CAAC,CAAC,EAAQ,CAAE,UAAU,KAAa,EACrC,OAAQ,EAAS,EAAS,EAC1B,SACA,YAEF,EAAqB,CAAC,EAAG,IACvB,EAAE,SAAW,EAAE,QACf,EAAE,SAAW,EAAE,QACf,EAAE,SAAW,EAAE,QAEjB,EAAY,IAeX,YACL,EAAiB,CAAE,UAAS,SACG,CAC/B,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SACG,KACC,EAAwB,UACxB,GAAkB,IAEjB,UAAU,CAAC,CAAC,CAAE,UAAU,CAAE,aAAc,CACvC,AAAI,EACF,EAAG,aAAa,gBAAiB,EAAS,SAAW,UAErD,EAAG,gBAAgB,mBAI3B,EAAM,UAAU,GAGT,EACJ,KACC,GAAU,EAAM,KAAK,GAAS,KAC9B,EAAI,GAAU,GAAE,IAAK,GAAO,OCrH7B,YACL,EAAiB,CAAE,YAAW,WACL,CACzB,MAAO,IAAgB,EAAI,CAAE,YAAW,YACrC,KACC,EAAI,CAAC,CAAE,OAAQ,CAAE,QAAU,CACzB,GAAM,CAAE,UAAW,GAAe,GAClC,MAAO,CACL,OAAQ,GAAK,KAGjB,EAAwB,WAevB,YACL,EAAiB,EACmB,CACpC,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,EAAM,UAAU,CAAC,CAAE,YAAa,CAC9B,AAAI,EACF,EAAG,aAAa,gBAAiB,UAEjC,EAAG,gBAAgB,mBAIvB,GAAM,GAAU,GAAmB,cACnC,MAAI,OAAO,IAAY,YACd,EAGF,GAAiB,EAAS,GAC9B,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OCvD7B,YACL,EAAiB,CAAE,YAAW,WACZ,CAGlB,GAAM,GAAU,EACb,KACC,EAAI,CAAC,CAAE,YAAa,GACpB,KAIE,EAAU,EACb,KACC,EAAU,IAAM,GAAiB,GAC9B,KACC,EAAI,CAAC,CAAE,YAAc,EACnB,IAAQ,EAAG,UACX,OAAQ,EAAG,UAAY,KAEzB,EAAwB,aAMhC,MAAO,GAAc,CAAC,EAAS,EAAS,IACrC,KACC,EAAI,CAAC,CAAC,EAAQ,CAAE,MAAK,UAAU,CAAE,OAAQ,CAAE,KAAK,KAAM,CAAE,cACtD,GAAS,KAAK,IAAI,EAAG,EACjB,KAAK,IAAI,EAAG,EAAS,EAAI,GACzB,KAAK,IAAI,EAAG,EAAS,EAAI,IAEtB,CACL,OAAQ,EAAM,EACd,SACA,OAAQ,EAAM,GAAU,KAG5B,EAAqB,CAAC,EAAG,IACvB,EAAE,SAAW,EAAE,QACf,EAAE,SAAW,EAAE,QACf,EAAE,SAAW,EAAE,SChDhB,YACL,EACqB,CACrB,GAAM,GAAU,SAAkB,cAAgB,CAChD,MAAO,EAAO,UAAU,GAAS,WAC/B,EAAM,aAAa,wBACnB,UAIJ,MAAO,GAAG,GAAG,GACV,KACC,GAAS,GAAS,EAAU,EAAO,UAChC,KACC,GAAM,KAGV,EAAU,EAAO,KAAK,IAAI,EAAG,EAAQ,SACrC,EAAI,GAAU,EACZ,MAAO,EAAO,QAAQ,GACtB,MAAO,CACL,OAAS,EAAM,aAAa,wBAC5B,QAAS,EAAM,aAAa,yBAC5B,OAAS,EAAM,aAAa,4BAGhC,EAAY,IAWX,YACL,EACgC,CAChC,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,EAAM,UAAU,GAAW,CAGzB,OAAW,CAAC,EAAK,IAAU,QAAO,QAAQ,EAAQ,OAChD,SAAS,KAAK,aAAa,iBAAiB,IAAO,GAGrD,OAAS,GAAQ,EAAG,EAAQ,EAAO,OAAQ,IAAS,CAClD,GAAM,GAAQ,EAAO,GAAO,mBAC5B,AAAI,YAAiB,cACnB,GAAM,OAAS,EAAQ,QAAU,GAIrC,SAAS,YAAa,KAIxB,GAAM,GAAS,EAA8B,QAAS,GACtD,MAAO,IAAa,GACjB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OCpHpC,OAAwB,SAiCxB,YAAiB,EAAyB,CACxC,EAAG,aAAa,kBAAmB,IACnC,GAAM,GAAO,EAAG,UAChB,SAAG,gBAAgB,mBACZ,EAYF,YACL,CAAE,UACI,CACN,AAAI,WAAY,eACd,GAAI,GAA8B,GAAc,CAC9C,GAAI,YAAY,iDAAkD,CAChE,KAAM,GACJ,EAAG,aAAa,wBAChB,GAAQ,EACN,EAAG,aAAa,6BAInB,GAAG,UAAW,GAAM,EAAW,KAAK,MAEtC,KACC,EAAI,GAAM,CAER,AADgB,EAAG,QACX,UAEV,GAAM,EAAY,sBAEjB,UAAU,GCKnB,YAAoB,EAA0B,CAC5C,GAAI,EAAK,OAAS,EAChB,MAAO,GAGT,GAAM,CAAC,EAAM,GAAQ,EAClB,KAAK,CAAC,EAAG,IAAM,EAAE,OAAS,EAAE,QAC5B,IAAI,GAAO,EAAI,QAAQ,SAAU,KAGhC,EAAQ,EACZ,GAAI,IAAS,EACX,EAAQ,EAAK,WAEb,MAAO,EAAK,WAAW,KAAW,EAAK,WAAW,IAChD,IAGJ,GAAM,GAAS,KACf,MAAO,GAAK,IAAI,GACd,EAAI,QAAQ,EAAK,MAAM,EAAG,GAAQ,EAAO,OA6BtC,YACL,CAAE,YAAW,YAAW,aAClB,CACN,GAAM,GAAS,KACf,GAAI,SAAS,WAAa,QACxB,OAGF,AAAI,qBAAuB,UACzB,SAAQ,kBAAoB,SAG5B,EAAU,OAAQ,gBACf,UAAU,IAAM,CACf,QAAQ,kBAAoB,UAKlC,GAAM,GAAU,GAAoC,kBACpD,AAAI,MAAO,IAAY,aACrB,GAAQ,KAAO,EAAQ,MAGzB,GAAM,GAAQ,GAAW,GAAI,KAAI,cAAe,EAAO,OACpD,KACC,EAAI,GAAW,GAAW,EAAY,MAAO,GAC1C,IAAI,GAAQ,EAAK,eAEpB,EAAU,GAAQ,EAAsB,SAAS,KAAM,SACpD,KACC,EAAO,GAAM,CAAC,EAAG,SAAW,CAAC,EAAG,SAChC,EAAU,GAAM,CAGd,GAAI,EAAG,iBAAkB,SAAS,CAChC,GAAM,GAAK,EAAG,OAAO,QAAQ,KAC7B,GAAI,GAAM,CAAC,EAAG,OAAQ,CACpB,GAAM,GAAM,GAAI,KAAI,EAAG,MAOvB,GAJA,EAAI,OAAS,GACb,EAAI,KAAO,GAIT,EAAI,WAAa,SAAS,UAC1B,EAAK,SAAS,EAAI,YAElB,SAAG,iBACI,EAAG,CACR,IAAK,GAAI,KAAI,EAAG,SAKxB,MAAO,QAIb,MAIE,EAAO,EAAyB,OAAQ,YAC3C,KACC,EAAO,GAAM,EAAG,QAAU,MAC1B,EAAI,GAAO,EACT,IAAK,GAAI,KAAI,SAAS,MACtB,OAAQ,EAAG,SAEb,MAIJ,EAAM,EAAO,GACV,KACC,EAAqB,CAAC,EAAG,IAAM,EAAE,IAAI,OAAS,EAAE,IAAI,MACpD,EAAI,CAAC,CAAE,SAAU,IAEhB,UAAU,GAGf,GAAM,GAAY,EACf,KACC,EAAwB,YACxB,EAAU,GAAO,GAAQ,EAAI,MAC1B,KACC,GAAW,IACT,IAAY,GACL,OAIb,MAIJ,EACG,KACC,GAAO,IAEN,UAAU,CAAC,CAAE,SAAU,CACtB,QAAQ,UAAU,GAAI,GAAI,GAAG,OAInC,GAAM,GAAM,GAAI,WAChB,EACG,KACC,EAAU,GAAO,EAAI,QACrB,EAAI,GAAO,EAAI,gBAAgB,EAAK,eAEnC,UAAU,GAGf,EACG,KACC,GAAK,IAEJ,UAAU,GAAe,CACxB,OAAW,KAAY,CAGrB,QACA,sBACA,oBACA,yBAGA,+BACA,gCACA,mCACA,2BACA,2BACA,GAAG,GAAQ,0BACP,CAAC,4BACD,IACH,CACD,GAAM,GAAS,GAAmB,GAC5B,EAAS,GAAmB,EAAU,GAC5C,AACE,MAAO,IAAW,aAClB,MAAO,IAAW,aAElB,EAAO,YAAY,MAM7B,EACG,KACC,GAAK,GACL,EAAI,IAAM,GAAoB,cAC9B,EAAU,GAAM,EAAG,GAAG,EAAY,SAAU,KAC5C,GAAU,GAAM,CACd,GAAM,GAAS,EAAE,UACjB,GAAI,EAAG,IAAK,CACV,OAAW,KAAQ,GAAG,oBACpB,EAAO,aAAa,EAAM,EAAG,aAAa,IAC5C,SAAG,YAAY,GAGR,GAAI,GAAW,GAAY,CAChC,EAAO,OAAS,IAAM,EAAS,iBAKjC,UAAO,YAAc,EAAG,YACxB,EAAG,YAAY,GACR,KAIV,YAGL,EAAM,EAAO,GACV,KACC,GAAO,IAEN,UAAU,CAAC,CAAE,MAAK,YAAa,CAC9B,AAAI,EAAI,MAAQ,CAAC,EACf,GAAgB,EAAI,MAEpB,OAAO,SAAS,EAAG,kBAAQ,IAAK,KAKxC,EACG,KACC,GAAU,GACV,GAAa,KACb,EAAwB,WAEvB,UAAU,CAAC,CAAE,YAAa,CACzB,QAAQ,aAAa,EAAQ,MAInC,EAAM,EAAO,GACV,KACC,GAAY,EAAG,GACf,EAAO,CAAC,CAAC,EAAG,KAAO,EAAE,IAAI,WAAa,EAAE,IAAI,UAC5C,EAAI,CAAC,CAAC,CAAE,KAAW,IAElB,UAAU,CAAC,CAAE,YAAa,CACzB,OAAO,SAAS,EAAG,kBAAQ,IAAK,KC/UxC,OAAuB,SCAvB,OAAuB,SAsChB,YACL,EAA2B,EACD,CAC1B,GAAM,GAAY,GAAI,QAAO,EAAO,UAAW,OACzC,EAAY,CAAC,EAAY,EAAc,IACpC,GAAG,4BAA+B,WAI3C,MAAO,AAAC,IAAkB,CACxB,EAAQ,EACL,QAAQ,gBAAiB,KACzB,OAGH,GAAM,GAAQ,GAAI,QAAO,MAAM,EAAO,cACpC,EACG,QAAQ,uBAAwB,QAChC,QAAQ,EAAW,QACnB,OAGL,MAAO,IACL,GACI,eAAW,GACX,GAED,QAAQ,EAAO,GACf,QAAQ,8BAA+B,OC5BzC,YAA0B,EAAuB,CACtD,MAAO,GACJ,MAAM,cACJ,IAAI,CAAC,EAAO,IAAU,EAAQ,EAC3B,EAAM,QAAQ,+BAAgC,MAC9C,GAEH,KAAK,IACP,QAAQ,kCAAmC,IAC3C,OCqCE,YACL,EAC+B,CAC/B,MAAO,GAAQ,OAAS,EAUnB,YACL,EAC+B,CAC/B,MAAO,GAAQ,OAAS,EAUnB,YACL,EACgC,CAChC,MAAO,GAAQ,OAAS,ECtE1B,YAA0B,CAAE,SAAQ,QAAkC,CAGpE,AAAI,EAAO,KAAK,SAAW,GAAK,EAAO,KAAK,KAAO,MACjD,GAAO,KAAO,CACZ,EAAY,wBAIZ,EAAO,YAAc,aACvB,GAAO,UAAY,EAAY,4BAQjC,GAAM,GAAyB,CAC7B,SANe,EAAY,0BAC1B,MAAM,WACN,OAAO,SAKR,YAAa,GAAQ,mBAIvB,MAAO,CAAE,SAAQ,OAAM,WAmBlB,YACL,EAAa,EACC,CACd,GAAM,GAAS,KACT,EAAS,GAAI,QAAO,GAGpB,EAAM,GAAI,GACV,EAAM,GAAY,EAAQ,CAAE,QAC/B,KACC,EAAI,GAAW,CACb,GAAI,GAAsB,GACxB,OAAW,KAAU,GAAQ,KAAK,MAChC,OAAW,KAAY,GACrB,EAAS,SAAW,GAAG,GAAI,KAAI,EAAS,SAAU,EAAO,QAE/D,MAAO,KAET,MAIJ,UAAK,GACF,KACC,EAAI,GAAS,EACX,KAAM,EACN,KAAM,GAAiB,OAGxB,UAAU,EAAI,KAAK,KAAK,IAGtB,CAAE,MAAK,OClGT,aAAsC,CAC3C,GAAM,GAAS,KACT,EAAY,GAChB,GAAI,KAAI,mBAAoB,EAAO,OAI/B,EAAW,EACd,KACC,EAAI,GAAY,CACd,GAAM,CAAC,CAAE,GAAW,EAAO,KAAK,MAAM,eACtC,MAAO,GAAS,KAAK,CAAC,CAAE,UAAS,aAC/B,IAAY,GAAW,EAAQ,SAAS,KACpC,EAAS,MAKrB,EAAc,CAAC,EAAW,IACvB,UAAU,CAAC,CAAC,EAAU,KAAa,CA7DxC,MAkEM,GAHA,AADc,EAAW,qBACnB,YAAY,GAAsB,EAAU,IAG9C,SAAS,aAAc,kBAAoB,KAAM,CACnD,GAAM,GAAS,MAAO,UAAP,cAAgB,UAAW,SACpC,EAAW,CAAC,EAAQ,QAAQ,SAAS,GAI3C,GADA,SAAS,aAAc,EAAU,gBAC7B,EACF,OAAW,KAAW,IAAqB,YACzC,EAAQ,OAAS,MCWtB,YACL,EAAsB,CAAE,OACC,CACzB,GAAM,GAAK,gCAAU,YAAa,GAG5B,CAAE,gBAAiB,KACzB,AAAI,EAAa,IAAI,MACnB,GAAU,SAAU,IAGtB,GAAM,GAAS,EACZ,KACC,EAAO,IACP,GAAK,GACL,EAAI,IAAM,EAAa,IAAI,MAAQ,KAIvC,EAAO,UAAU,GAAS,CACxB,AAAI,GACF,GAAG,MAAQ,KAIf,GAAM,GAAS,GAAkB,GAC3B,EAAS,EACb,EAAU,EAAI,SACd,EAAU,EAAI,SAAS,KAAK,GAAM,IAClC,GAEC,KACC,EAAI,IAAM,EAAG,EAAG,QAChB,EAAU,IACV,KAIJ,MAAO,GAAc,CAAC,EAAQ,IAC3B,KACC,EAAI,CAAC,CAAC,EAAO,KAAY,EAAE,QAAO,WAClC,EAAY,IAYX,YACL,EAAsB,CAAE,MAAK,OACyB,CACtD,GAAM,GAAQ,GAAI,GAGlB,SACG,KACC,EAAwB,SACxB,EAAI,CAAC,CAAE,WAAiC,EACtC,KAAM,EACN,KAAM,MAGP,UAAU,EAAI,KAAK,KAAK,IAG7B,EACG,KACC,EAAwB,UAEvB,UAAU,CAAC,CAAE,WAAY,CACxB,AAAI,EACF,IAAU,SAAU,GACpB,EAAG,YAAc,IAEjB,EAAG,YAAc,EAAY,wBAKrC,EAAU,EAAG,KAAO,SACjB,KACC,GAAU,EAAM,KAAK,GAAS,MAE7B,UAAU,IAAM,EAAG,SAGjB,GAAiB,EAAI,CAAE,MAAK,QAChC,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,KCjG3B,YACL,EAAiB,CAAE,OAAqB,CAAE,UACL,CACrC,GAAM,GAAQ,GAAI,GACZ,EAAY,GAAqB,EAAG,eACvC,KACC,EAAO,UAIL,EAAO,EAAW,wBAAyB,GAC3C,EAAO,EAAW,uBAAwB,GAG1C,EAAS,EACZ,KACC,EAAO,IACP,GAAK,IAIT,SACG,KACC,GAAe,GACf,GAAU,IAET,UAAU,CAAC,CAAC,CAAE,SAAS,CAAE,YAAa,CACrC,GAAI,EACF,OAAQ,EAAM,YAGP,GACH,EAAK,YAAc,EAAY,sBAC/B,UAGG,GACH,EAAK,YAAc,EAAY,qBAC/B,cAIA,EAAK,YAAc,EACjB,sBACA,GAAM,EAAM,aAIlB,GAAK,YAAc,EAAY,+BAKvC,EACG,KACC,EAAI,IAAM,EAAK,UAAY,IAC3B,EAAU,CAAC,CAAE,WAAY,EACvB,EAAG,GAAG,EAAM,MAAM,EAAG,KACrB,EAAG,GAAG,EAAM,MAAM,KACf,KACC,GAAY,GACZ,GAAQ,GACR,EAAU,CAAC,CAAC,KAAW,EAAG,GAAG,QAIlC,UAAU,GAAU,EAAK,YACxB,GAAuB,KAWtB,AAPS,EACb,KACC,EAAO,IACP,EAAI,CAAC,CAAE,UAAW,IAKnB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,KCxF3B,YACL,EAAkB,CAAE,UACK,CACzB,MAAO,GACJ,KACC,EAAI,CAAC,CAAE,WAAY,CACjB,GAAM,GAAM,KACZ,SAAI,KAAO,GACX,EAAI,aAAa,OAAO,KACxB,EAAI,aAAa,IAAI,IAAK,GACnB,CAAE,UAaV,YACL,EAAuB,EACa,CACpC,GAAM,GAAQ,GAAI,GAClB,SAAM,UAAU,CAAC,CAAE,SAAU,CAC3B,EAAG,aAAa,sBAAuB,EAAG,MAC1C,EAAG,KAAO,GAAG,MAIf,EAAU,EAAI,SACX,UAAU,GAAM,EAAG,kBAGf,GAAiB,EAAI,GACzB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,KCpC3B,YACL,EAAiB,CAAE,OAAqB,CAAE,aACJ,CACtC,GAAM,GAAQ,GAAI,GAGZ,EAAS,GAAoB,gBAC7B,EAAS,EACb,EAAU,EAAO,WACjB,EAAU,EAAO,UAEhB,KACC,GAAU,IACV,EAAI,IAAM,EAAM,OAChB,KAIJ,SACG,KACC,GAAkB,GAClB,EAAI,CAAC,CAAC,CAAE,eAAe,KAAW,CAChC,GAAM,GAAQ,EAAM,MAAM,YAC1B,GAAI,kBAAa,SAAU,EAAM,EAAM,OAAS,GAAI,CAClD,GAAM,GAAO,EAAY,EAAY,OAAS,GAC9C,AAAI,EAAK,WAAW,EAAM,EAAM,OAAS,KACvC,GAAM,EAAM,OAAS,GAAK,OAE5B,GAAM,OAAS,EAEjB,MAAO,MAGR,UAAU,GAAS,EAAG,UAAY,EAChC,KAAK,IACL,QAAQ,MAAO,WAItB,EACG,KACC,EAAO,CAAC,CAAE,UAAW,IAAS,WAE7B,UAAU,GAAO,CAChB,OAAQ,EAAI,UAGL,aACH,AACE,EAAG,UAAU,QACb,EAAM,iBAAmB,EAAM,MAAM,QAErC,GAAM,MAAQ,EAAG,WACnB,SAYH,AAPS,EACb,KACC,EAAO,IACP,EAAI,CAAC,CAAE,UAAW,IAKnB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,IAAO,EAAE,IAAK,MC5CjB,YACL,EAAiB,CAAE,SAAQ,aACI,CAC/B,GAAM,GAAS,KACf,GAAI,CACF,GAAM,GAAM,gCAAU,SAAU,EAAO,OACjC,EAAS,GAAkB,EAAK,GAGhC,EAAS,GAAoB,eAAgB,GAC7C,EAAS,GAAoB,gBAAiB,GAG9C,CAAE,MAAK,OAAQ,EACrB,EACG,KACC,EAAO,IACP,GAAO,EAAI,KAAK,EAAO,MACvB,GAAK,IAEJ,UAAU,EAAI,KAAK,KAAK,IAG7B,EACG,KACC,EAAO,CAAC,CAAE,UAAW,IAAS,WAE7B,UAAU,GAAO,CAChB,GAAM,GAAS,KACf,OAAQ,EAAI,UAGL,QACH,GAAI,IAAW,EAAO,CACpB,GAAM,GAAU,GAAI,KACpB,OAAW,KAAU,GACnB,sBAAuB,GACtB,CACD,GAAM,GAAU,EAAO,kBACvB,EAAQ,IAAI,EAAQ,WAClB,EAAQ,aAAa,mBAKzB,GAAI,EAAQ,KAAM,CAChB,GAAM,CAAC,CAAC,IAAS,CAAC,GAAG,GAAS,KAAK,CAAC,CAAC,CAAE,GAAI,CAAC,CAAE,KAAO,EAAI,GACzD,EAAK,QAIP,EAAI,QAEN,UAGG,aACA,MACH,GAAU,SAAU,IACpB,EAAM,OACN,UAGG,cACA,YACH,GAAI,MAAO,IAAW,YACpB,EAAM,YACD,CACL,GAAM,GAAM,CAAC,EAAO,GAAG,EACrB,wDACA,IAEI,EAAI,KAAK,IAAI,EACjB,MAAK,IAAI,EAAG,EAAI,QAAQ,IAAW,EAAI,OACrC,GAAI,OAAS,UAAY,GAAK,IAE9B,EAAI,QACR,EAAI,GAAG,QAIT,EAAI,QACJ,cAIA,AAAI,IAAU,MACZ,EAAM,WAKlB,EACG,KACC,EAAO,CAAC,CAAE,UAAW,IAAS,WAE7B,UAAU,GAAO,CAChB,OAAQ,EAAI,UAGL,QACA,QACA,IACH,EAAM,QACN,EAAM,SAGN,EAAI,QACJ,SAKV,GAAM,GAAU,GAAiB,EAAO,GAClC,EAAU,GAAkB,EAAQ,EAAQ,CAAE,WACpD,MAAO,GAAM,EAAQ,GAClB,KACC,GAGE,GAAG,GAAqB,eAAgB,GACrC,IAAI,GAAS,GAAiB,EAAO,CAAE,YAG1C,GAAG,GAAqB,iBAAkB,GACvC,IAAI,GAAS,GAAmB,EAAO,EAAQ,CAAE,uBAKnD,EAAP,CACA,SAAG,OAAS,GACL,ICpKJ,YACL,EAAiB,CAAE,SAAQ,aACa,CACxC,MAAO,GAAc,CACnB,EACA,EACG,KACC,EAAU,MACV,EAAO,GAAO,CAAC,CAAC,EAAI,aAAa,IAAI,SAGxC,KACC,EAAI,CAAC,CAAC,EAAO,KAAS,GAAuB,EAAM,OAAQ,IACzD,EAAI,aAAa,IAAI,OAEvB,EAAI,GAAM,CA1FhB,MA2FQ,GAAM,GAAQ,GAAI,KAGZ,EAAK,SAAS,mBAAmB,EAAI,WAAW,WACtD,OAAS,GAAO,EAAG,WAAY,EAAM,EAAO,EAAG,WAC7C,GAAI,KAAK,gBAAL,cAAoB,aAAc,CACpC,GAAM,GAAW,EAAK,YAChB,EAAW,EAAG,GACpB,AAAI,EAAS,OAAS,EAAS,QAC7B,EAAM,IAAI,EAAmB,GAKnC,OAAW,CAAC,EAAM,IAAS,GAAO,CAChC,GAAM,CAAE,cAAe,EAAE,OAAQ,KAAM,GACvC,EAAK,YAAY,GAAG,MAAM,KAAK,IAIjC,MAAO,CAAE,IAAK,EAAI,YCfnB,YACL,EAAiB,CAAE,YAAW,SACT,CACrB,GAAM,GAAS,EAAG,cACZ,EACJ,EAAO,UACP,EAAO,cAAe,UAGxB,MAAO,GAAc,CAAC,EAAO,IAC1B,KACC,EAAI,CAAC,CAAC,CAAE,SAAQ,UAAU,CAAE,OAAQ,CAAE,SACpC,GAAS,EACL,KAAK,IAAI,EAAQ,KAAK,IAAI,EAAG,EAAI,IACjC,EACG,CACL,SACA,OAAQ,GAAK,EAAS,KAG1B,EAAqB,CAAC,EAAG,IACvB,EAAE,SAAW,EAAE,QACf,EAAE,SAAW,EAAE,SA0BhB,YACL,EAAiB,EACe,CADf,QAAE,YAAF,EAAc,KAAd,EAAc,CAAZ,YAEnB,GAAM,GAAQ,EAAW,0BAA2B,GAC9C,CAAE,KAAM,GAAiB,GAC/B,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SACG,KACC,GAAU,EAAG,IACb,GAAe,IAEd,UAAU,CAGT,KAAK,CAAC,CAAE,UAAU,CAAE,OAAQ,IAAW,CACrC,EAAM,MAAM,OAAS,GAAG,EAAS,EAAI,MACrC,EAAG,MAAM,IAAY,GAAG,OAI1B,UAAW,CACT,EAAM,MAAM,OAAS,GACrB,EAAG,MAAM,IAAY,MAKtB,GAAa,EAAI,GACrB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OCvH7B,YACL,EAAc,EACW,CACzB,GAAI,MAAO,IAAS,YAAa,CAC/B,GAAM,GAAM,gCAAgC,KAAQ,IACpD,MAAO,IAGL,GAAqB,GAAG,qBACrB,KACC,EAAI,GAAY,EACd,QAAS,EAAQ,YAEnB,GAAe,KAInB,GAAkB,GACf,KACC,EAAI,GAAS,EACX,MAAO,EAAK,iBACZ,MAAO,EAAK,eAEd,GAAe,MAGlB,KACC,EAAI,CAAC,CAAC,EAAS,KAAW,OAAK,GAAY,SAI1C,CACL,GAAM,GAAM,gCAAgC,IAC5C,MAAO,IAAkB,GACtB,KACC,EAAI,GAAS,EACX,aAAc,EAAK,gBAErB,GAAe,MClDhB,YACL,EAAc,EACW,CACzB,GAAM,GAAM,WAAW,qBAAwB,mBAAmB,KAClE,MAAO,IAA2B,GAC/B,KACC,EAAI,CAAC,CAAE,aAAY,iBAAmB,EACpC,MAAO,EACP,MAAO,KAET,GAAe,KCYd,YACL,EACyB,CACzB,GAAM,CAAC,GAAQ,EAAI,MAAM,sBAAwB,GACjD,OAAQ,EAAK,mBAGN,SACH,GAAM,CAAC,CAAE,EAAM,GAAQ,EAAI,MAAM,uCACjC,MAAO,IAA2B,EAAM,OAGrC,SACH,GAAM,CAAC,CAAE,EAAM,GAAQ,EAAI,MAAM,sCACjC,MAAO,IAA2B,EAAM,WAIxC,MAAO,ICtBb,GAAI,IAgBG,YACL,EACoB,CACpB,MAAO,SAAW,EAAM,IAAM,CAC5B,GAAM,GAAS,SAAsB,WAAY,gBACjD,MAAI,GACK,EAAG,GAEH,GAAiB,EAAG,MACxB,KACC,EAAI,GAAS,SAAS,WAAY,EAAO,oBAG9C,KACC,GAAW,IAAM,GACjB,EAAO,GAAS,OAAO,KAAK,GAAO,OAAS,GAC5C,EAAI,GAAU,EAAE,WAChB,EAAY,KAWX,YACL,EAC+B,CAC/B,GAAM,GAAQ,EAAW,uBAAwB,GACjD,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SAAM,UAAU,CAAC,CAAE,WAAY,CAC7B,EAAM,YAAY,GAAkB,IACpC,EAAM,aAAa,gBAAiB,UAI/B,GAAY,GAChB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OCpC7B,YACL,EAAiB,CAAE,YAAW,WACZ,CAClB,MAAO,IAAiB,SAAS,MAC9B,KACC,EAAU,IAAM,GAAgB,EAAI,CAAE,UAAS,eAC/C,EAAI,CAAC,CAAE,OAAQ,CAAE,QACR,EACL,OAAQ,GAAK,MAGjB,EAAwB,WAevB,YACL,EAAiB,EACY,CAC7B,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SAAM,UAAU,CAGd,KAAK,CAAE,UAAU,CACf,AAAI,EACF,EAAG,aAAa,gBAAiB,UAEjC,EAAG,gBAAgB,kBAIvB,UAAW,CACT,EAAG,gBAAgB,oBAMrB,IAAQ,0BACJ,EAAG,CAAE,OAAQ,KACb,GAAU,EAAI,IAEjB,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OChC7B,YACL,EAAiB,CAAE,YAAW,WACD,CAC7B,GAAM,GAAQ,GAAI,KAGZ,EAAU,EAA+B,cAAe,GAC9D,OAAW,KAAU,GAAS,CAC5B,GAAM,GAAK,mBAAmB,EAAO,KAAK,UAAU,IAC9C,EAAS,GAAmB,QAAQ,OAC1C,AAAI,MAAO,IAAW,aACpB,EAAM,IAAI,EAAQ,GAItB,GAAM,GAAU,EACb,KACC,EAAI,GAAU,GAAK,EAAO,SAgF9B,MAAO,AA5EY,IAAiB,SAAS,MAC1C,KACC,EAAwB,UAGxB,EAAU,GAAQ,EAAM,IAAM,CAC5B,GAAI,GAA4B,GAChC,MAAO,GAAG,CAAC,GAAG,GAAO,OAAO,CAAC,EAAO,CAAC,EAAQ,KAAY,CACvD,KAAO,EAAK,QAEN,AADS,EAAM,IAAI,EAAK,EAAK,OAAS,IACjC,SAAW,EAAO,SACzB,EAAK,MAOT,GAAI,GAAS,EAAO,UACpB,KAAO,CAAC,GAAU,EAAO,eACvB,EAAS,EAAO,cAChB,EAAS,EAAO,UAIlB,MAAO,GAAM,IACX,CAAC,GAAG,EAAO,CAAC,GAAG,EAAM,IAAS,UAC9B,IAED,GAAI,SAEN,KAGC,EAAI,GAAS,GAAI,KAAI,CAAC,GAAG,GAAO,KAAK,CAAC,CAAC,CAAE,GAAI,CAAC,CAAE,KAAO,EAAI,KAG3D,EAAU,GAAS,EAAc,CAAC,EAAW,IAC1C,KACC,GAAK,CAAC,CAAC,EAAM,GAAO,CAAC,CAAE,OAAQ,CAAE,KAAK,QAAQ,KAAY,CACxD,GAAM,GAAO,EAAI,EAAK,QAAU,KAAK,MAAM,EAAK,QAGhD,KAAO,EAAK,QAAQ,CAClB,GAAM,CAAC,CAAE,GAAU,EAAK,GACxB,GAAI,EAAS,EAAS,GAAK,EACzB,EAAO,CAAC,GAAG,EAAM,EAAK,aAEtB,OAKJ,KAAO,EAAK,QAAQ,CAClB,GAAM,CAAC,CAAE,GAAU,EAAK,EAAK,OAAS,GACtC,GAAI,EAAS,GAAU,GAAK,CAAC,EAC3B,EAAO,CAAC,EAAK,MAAQ,GAAG,OAExB,OAKJ,MAAO,CAAC,EAAM,IACb,CAAC,GAAI,CAAC,GAAG,KACZ,EAAqB,CAAC,EAAG,IACvB,EAAE,KAAO,EAAE,IACX,EAAE,KAAO,EAAE,SAUtB,KACC,EAAI,CAAC,CAAC,EAAM,KAAW,EACrB,KAAM,EAAK,IAAI,CAAC,CAAC,KAAU,GAC3B,KAAM,EAAK,IAAI,CAAC,CAAC,KAAU,MAI7B,EAAU,CAAE,KAAM,GAAI,KAAM,KAC5B,GAAY,EAAG,GACf,EAAI,CAAC,CAAC,EAAG,KAGH,EAAE,KAAK,OAAS,EAAE,KAAK,OAClB,CACL,KAAM,EAAE,KAAK,MAAM,KAAK,IAAI,EAAG,EAAE,KAAK,OAAS,GAAI,EAAE,KAAK,QAC1D,KAAM,IAKD,CACL,KAAM,EAAE,KAAK,MAAM,IACnB,KAAM,EAAE,KAAK,MAAM,EAAG,EAAE,KAAK,OAAS,EAAE,KAAK,WAiBlD,YACL,EAAiB,CAAE,YAAW,WACU,CACxC,MAAO,GAAM,IAAM,CACjB,GAAM,GAAQ,GAAI,GAClB,SAAM,UAAU,CAAC,CAAE,OAAM,UAAW,CAGlC,OAAW,CAAC,IAAW,GACrB,EAAO,gBAAgB,iBACvB,EAAO,UAAU,OACf,wBAKJ,OAAW,CAAC,EAAO,CAAC,KAAY,GAAK,UACnC,EAAO,aAAa,gBAAiB,QACrC,EAAO,UAAU,OACf,uBACA,IAAU,EAAK,OAAS,KAM1B,GAAQ,wBACV,EACG,KACC,GAAU,EAAM,KAAK,GAAS,KAC9B,EAAwB,UACxB,GAAa,KACb,GAAe,IAEd,UAAU,CAAC,CAAC,CAAE,CAAE,WAAY,CAC3B,GAAM,GAAM,KAGN,EAAS,EAAK,EAAK,OAAS,GAClC,GAAI,GAAU,EAAO,OAAQ,CAC3B,GAAM,CAAC,GAAU,EACX,CAAE,QAAS,GAAI,KAAI,EAAO,MAChC,AAAI,EAAI,OAAS,GACf,GAAI,KAAO,EACX,QAAQ,aAAa,GAAI,GAAI,GAAG,UAKlC,GAAI,KAAO,GACX,QAAQ,aAAa,GAAI,GAAI,GAAG,OAKnC,GAAqB,EAAI,CAAE,YAAW,YAC1C,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,OCxN7B,YACL,EAAkB,CAAE,YAAW,QAAO,WACf,CAGvB,GAAM,GAAa,EAChB,KACC,EAAI,CAAC,CAAE,OAAQ,CAAE,QAAU,GAC3B,GAAY,EAAG,GACf,EAAI,CAAC,CAAC,EAAG,KAAO,EAAI,GAAK,EAAI,GAC7B,KAIE,EAAU,EACb,KACC,EAAI,CAAC,CAAE,YAAa,IAIxB,MAAO,GAAc,CAAC,EAAS,IAC5B,KACC,EAAI,CAAC,CAAC,EAAQ,KAAe,CAAE,IAAU,IACzC,IACA,GAAU,EAAQ,KAAK,GAAK,KAC5B,GAAQ,IACR,GAAO,CAAE,MAAO,MAChB,EAAI,GAAW,EAAE,aAchB,YACL,EAAiB,CAAE,YAAW,UAAS,QAAO,WACZ,CAClC,GAAM,GAAQ,GAAI,GAClB,SAAM,UAAU,CAGd,KAAK,CAAE,UAAU,CACf,AAAI,EACF,GAAG,aAAa,gBAAiB,UACjC,EAAG,aAAa,WAAY,MAC5B,EAAG,QAEH,GAAG,gBAAgB,iBACnB,EAAG,gBAAgB,cAKvB,UAAW,CACT,EAAG,MAAM,IAAM,GACf,EAAG,aAAa,gBAAiB,UACjC,EAAG,gBAAgB,eAKvB,EACG,KACC,GAAU,EAAM,KAAK,GAAQ,GAAI,GAAS,KAC1C,EAAwB,WAEvB,UAAU,CAAC,CAAE,YAAa,CACzB,EAAG,MAAM,IAAM,GAAG,EAAS,SAI1B,GAAe,EAAI,CAAE,YAAW,QAAO,YAC3C,KACC,EAAI,GAAS,EAAM,KAAK,IACxB,EAAS,IAAM,EAAM,YACrB,EAAI,GAAU,GAAE,IAAK,GAAO,KCjH3B,YACL,CAAE,YAAW,WACP,CACN,EACG,KACC,EAAU,IAAM,EAAG,GAAG,EACpB,mCAEF,EAAI,GAAM,CACR,EAAG,cAAgB,GACnB,EAAG,QAAU,KAEf,GAAS,GAAM,EAAU,EAAI,UAC1B,KACC,GAAU,IAAM,EAAG,aAAa,kBAChC,GAAM,KAGV,GAAe,IAEd,UAAU,CAAC,CAAC,EAAI,KAAY,CAC3B,EAAG,gBAAgB,iBACf,GACF,GAAG,QAAU,MC5BvB,aAAkC,CAChC,MAAO,qBAAqB,KAAK,UAAU,WAkBtC,YACL,CAAE,aACI,CACN,EACG,KACC,EAAU,IAAM,EAAG,GAAG,EAAY,yBAClC,EAAI,GAAM,EAAG,gBAAgB,sBAC7B,EAAO,IACP,GAAS,GAAM,EAAU,EAAI,cAC1B,KACC,GAAM,MAIT,UAAU,GAAM,CACf,GAAM,GAAM,EAAG,UAGf,AAAI,IAAQ,EACV,EAAG,UAAY,EAGN,EAAM,EAAG,eAAiB,EAAG,cACtC,GAAG,UAAY,EAAM,KClCxB,YACL,CAAE,YAAW,WACP,CACN,EAAc,CAAC,GAAY,UAAW,IACnC,KACC,EAAI,CAAC,CAAC,EAAQ,KAAY,GAAU,CAAC,GACrC,EAAU,GAAU,EAAG,GACpB,KACC,GAAM,EAAS,IAAM,OAGzB,GAAe,IAEd,UAAU,CAAC,CAAC,EAAQ,CAAE,OAAQ,CAAE,SAAU,CACzC,GAAI,EACF,SAAS,KAAK,aAAa,gBAAiB,QAC5C,SAAS,KAAK,MAAM,IAAM,IAAI,UACzB,CACL,GAAM,GAAQ,GAAK,SAAS,SAAS,KAAK,MAAM,IAAK,IACrD,SAAS,KAAK,gBAAgB,iBAC9B,SAAS,KAAK,MAAM,IAAM,GACtB,GACF,OAAO,SAAS,EAAG,MC1D/B,AAAK,OAAO,SACV,QAAO,QAAU,SAAU,EAAa,CACtC,GAAM,GAA2B,GACjC,OAAW,KAAO,QAAO,KAAK,GAE5B,EAAK,KAAK,CAAC,EAAK,EAAI,KAGtB,MAAO,KAIX,AAAK,OAAO,QACV,QAAO,OAAS,SAAU,EAAa,CACrC,GAAM,GAAiB,GACvB,OAAW,KAAO,QAAO,KAAK,GAE5B,EAAK,KAAK,EAAI,IAGhB,MAAO,KAMX,AAAI,MAAO,UAAY,aAGhB,SAAQ,UAAU,UACrB,SAAQ,UAAU,SAAW,SAC3B,EAA8B,EACxB,CACN,AAAI,MAAO,IAAM,SACf,MAAK,WAAa,EAAE,KACpB,KAAK,UAAY,EAAE,KAEnB,MAAK,WAAa,EAClB,KAAK,UAAY,KAKlB,QAAQ,UAAU,aACrB,SAAQ,UAAU,YAAc,YAC3B,EACG,CACN,GAAM,GAAS,KAAK,WACpB,GAAI,EAAQ,CACV,AAAI,EAAM,SAAW,GACnB,EAAO,YAAY,MAGrB,OAAS,GAAI,EAAM,OAAS,EAAG,GAAK,EAAG,IAAK,CAC1C,GAAI,GAAO,EAAM,GACjB,AAAI,MAAO,IAAS,SAClB,EAAO,SAAS,eAAe,GACxB,EAAK,YACZ,EAAK,WAAW,YAAY,GAG9B,AAAK,EAGH,EAAO,aAAa,KAAK,gBAAkB,GAF3C,EAAO,aAAa,EAAM,W1LEtC,SAAS,gBAAgB,UAAU,OAAO,SAC1C,SAAS,gBAAgB,UAAU,IAAI,MAGvC,GAAM,IAAY,KACZ,GAAY,KACZ,GAAY,KACZ,GAAY,KAGZ,GAAY,KACZ,GAAY,GAAW,sBACvB,GAAY,GAAW,uBACvB,GAAY,KAGZ,GAAS,KACT,GAAS,SAAS,MAAM,UAAU,UACpC,gCAAU,QAAS,GACnB,GAAI,KAAI,2BAA4B,GAAO,OAE3C,GAGE,GAAS,GAAI,GACnB,GAAiB,CAAE,YAGnB,AAAI,GAAQ,uBACV,GAAoB,CAAE,aAAW,aAAW,eAxH9C,OA2HA,AAAI,QAAO,UAAP,eAAgB,YAAa,QAC/B,KAGF,EAAM,GAAW,IACd,KACC,GAAM,MAEL,UAAU,IAAM,CACf,GAAU,SAAU,IACpB,GAAU,SAAU,MAI1B,GACG,KACC,EAAO,CAAC,CAAE,UAAW,IAAS,WAE7B,UAAU,GAAO,CAChB,OAAQ,EAAI,UAGL,QACA,IACH,GAAM,GAAO,GAAmB,oBAChC,AAAI,MAAO,IAAS,aAClB,EAAK,QACP,UAGG,QACA,IACH,GAAM,GAAO,GAAmB,oBAChC,AAAI,MAAO,IAAS,aAClB,EAAK,QACP,SAKV,GAAmB,CAAE,aAAW,aAChC,GAAe,CAAE,eACjB,GAAgB,CAAE,aAAW,aAG7B,GAAM,IAAU,GAAY,GAAoB,UAAW,CAAE,eACvD,GAAQ,GACX,KACC,EAAI,IAAM,GAAoB,SAC9B,EAAU,GAAM,GAAU,EAAI,CAAE,aAAW,cAC3C,EAAY,IAIV,GAAW,EAGf,GAAG,GAAqB,UACrB,IAAI,GAAM,GAAY,EAAI,CAAE,aAG/B,GAAG,GAAqB,UACrB,IAAI,GAAM,GAAY,EAAI,CAAE,aAAW,WAAS,YAGnD,GAAG,GAAqB,WACrB,IAAI,GAAM,GAAa,IAG1B,GAAG,GAAqB,UACrB,IAAI,GAAM,GAAY,EAAI,CAAE,UAAQ,gBAGvC,GAAG,GAAqB,UACrB,IAAI,GAAM,GAAY,KAIrB,GAAW,EAAM,IAAM,EAG3B,GAAG,GAAqB,WACrB,IAAI,GAAM,GAAa,EAAI,CAAE,WAAS,aAGzC,GAAG,GAAqB,WACrB,IAAI,GAAM,GAAQ,oBACf,GAAoB,EAAI,CAAE,UAAQ,eAClC,GAIN,GAAG,GAAqB,gBACrB,IAAI,GAAM,GAAiB,EAAI,CAAE,aAAW,cAG/C,GAAG,GAAqB,WACrB,IAAI,GAAM,EAAG,aAAa,kBAAoB,aAC3C,GAAG,GAAS,IAAM,GAAa,EAAI,CAAE,aAAW,WAAS,YACzD,GAAG,GAAS,IAAM,GAAa,EAAI,CAAE,aAAW,WAAS,aAI/D,GAAG,GAAqB,QACrB,IAAI,GAAM,GAAU,EAAI,CAAE,aAAW,cAGxC,GAAG,GAAqB,OACrB,IAAI,GAAM,GAAqB,EAAI,CAAE,aAAW,cAGnD,GAAG,GAAqB,OACrB,IAAI,GAAM,GAAe,EAAI,CAAE,aAAW,WAAS,SAAO,gBAIzD,GAAa,GAChB,KACC,EAAU,IAAM,IAChB,GAAU,IACV,EAAY,IAIhB,GAAW,YAMX,OAAO,UAAa,GACpB,OAAO,UAAa,GACpB,OAAO,QAAa,GACpB,OAAO,UAAa,GACpB,OAAO,UAAa,GACpB,OAAO,QAAa,GACpB,OAAO,QAAa,GACpB,OAAO,OAAa,GACpB,OAAO,OAAa,GACpB,OAAO,WAAa", + "names": [] +} diff --git a/assets/javascripts/lunr/min/lunr.ar.min.js b/assets/javascripts/lunr/min/lunr.ar.min.js new file mode 100644 index 00000000..248ddc5d --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.ar.min.js @@ -0,0 +1 @@ +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.ar=function(){this.pipeline.reset(),this.pipeline.add(e.ar.trimmer,e.ar.stopWordFilter,e.ar.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.ar.stemmer))},e.ar.wordCharacters="ء-ٛٱـ",e.ar.trimmer=e.trimmerSupport.generateTrimmer(e.ar.wordCharacters),e.Pipeline.registerFunction(e.ar.trimmer,"trimmer-ar"),e.ar.stemmer=function(){var e=this;return e.result=!1,e.preRemoved=!1,e.sufRemoved=!1,e.pre={pre1:"ف ك ب و س ل ن ا ي ت",pre2:"ال لل",pre3:"بال وال فال تال كال ولل",pre4:"فبال كبال وبال وكال"},e.suf={suf1:"ه ك ت ن ا ي",suf2:"نك نه ها وك يا اه ون ين تن تم نا وا ان كم كن ني نن ما هم هن تك ته ات يه",suf3:"تين كهم نيه نهم ونه وها يهم ونا ونك وني وهم تكم تنا تها تني تهم كما كها ناه نكم هنا تان يها",suf4:"كموه ناها ونني ونهم تكما تموه تكاه كماه ناكم ناهم نيها وننا"},e.patterns=JSON.parse('{"pt43":[{"pt":[{"c":"ا","l":1}]},{"pt":[{"c":"ا,ت,ن,ي","l":0}],"mPt":[{"c":"ف","l":0,"m":1},{"c":"ع","l":1,"m":2},{"c":"ل","l":2,"m":3}]},{"pt":[{"c":"و","l":2}],"mPt":[{"c":"ف","l":0,"m":0},{"c":"ع","l":1,"m":1},{"c":"ل","l":2,"m":3}]},{"pt":[{"c":"ا","l":2}]},{"pt":[{"c":"ي","l":2}],"mPt":[{"c":"ف","l":0,"m":0},{"c":"ع","l":1,"m":1},{"c":"ا","l":2},{"c":"ل","l":3,"m":3}]},{"pt":[{"c":"م","l":0}]}],"pt53":[{"pt":[{"c":"ت","l":0},{"c":"ا","l":2}]},{"pt":[{"c":"ا,ن,ت,ي","l":0},{"c":"ت","l":2}],"mPt":[{"c":"ا","l":0},{"c":"ف","l":1,"m":1},{"c":"ت","l":2},{"c":"ع","l":3,"m":3},{"c":"ا","l":4},{"c":"ل","l":5,"m":4}]},{"pt":[{"c":"ا","l":0},{"c":"ا","l":2}],"mPt":[{"c":"ا","l":0},{"c":"ف","l":1,"m":1},{"c":"ع","l":2,"m":3},{"c":"ل","l":3,"m":4},{"c":"ا","l":4},{"c":"ل","l":5,"m":4}]},{"pt":[{"c":"ا","l":0},{"c":"ا","l":3}],"mPt":[{"c":"ف","l":0,"m":1},{"c":"ع","l":1,"m":2},{"c":"ل","l":2,"m":4}]},{"pt":[{"c":"ا","l":3},{"c":"ن","l":4}]},{"pt":[{"c":"ت","l":0},{"c":"ي","l":3}]},{"pt":[{"c":"م","l":0},{"c":"و","l":3}]},{"pt":[{"c":"ا","l":1},{"c":"و","l":3}]},{"pt":[{"c":"و","l":1},{"c":"ا","l":2}]},{"pt":[{"c":"م","l":0},{"c":"ا","l":3}]},{"pt":[{"c":"م","l":0},{"c":"ي","l":3}]},{"pt":[{"c":"ا","l":2},{"c":"ن","l":3}]},{"pt":[{"c":"م","l":0},{"c":"ن","l":1}],"mPt":[{"c":"ا","l":0},{"c":"ن","l":1},{"c":"ف","l":2,"m":2},{"c":"ع","l":3,"m":3},{"c":"ا","l":4},{"c":"ل","l":5,"m":4}]},{"pt":[{"c":"م","l":0},{"c":"ت","l":2}],"mPt":[{"c":"ا","l":0},{"c":"ف","l":1,"m":1},{"c":"ت","l":2},{"c":"ع","l":3,"m":3},{"c":"ا","l":4},{"c":"ل","l":5,"m":4}]},{"pt":[{"c":"م","l":0},{"c":"ا","l":2}]},{"pt":[{"c":"م","l":1},{"c":"ا","l":3}]},{"pt":[{"c":"ي,ت,ا,ن","l":0},{"c":"ت","l":1}],"mPt":[{"c":"ف","l":0,"m":2},{"c":"ع","l":1,"m":3},{"c":"ا","l":2},{"c":"ل","l":3,"m":4}]},{"pt":[{"c":"ت,ي,ا,ن","l":0},{"c":"ت","l":2}],"mPt":[{"c":"ا","l":0},{"c":"ف","l":1,"m":1},{"c":"ت","l":2},{"c":"ع","l":3,"m":3},{"c":"ا","l":4},{"c":"ل","l":5,"m":4}]},{"pt":[{"c":"ا","l":2},{"c":"ي","l":3}]},{"pt":[{"c":"ا,ي,ت,ن","l":0},{"c":"ن","l":1}],"mPt":[{"c":"ا","l":0},{"c":"ن","l":1},{"c":"ف","l":2,"m":2},{"c":"ع","l":3,"m":3},{"c":"ا","l":4},{"c":"ل","l":5,"m":4}]},{"pt":[{"c":"ا","l":3},{"c":"ء","l":4}]}],"pt63":[{"pt":[{"c":"ا","l":0},{"c":"ت","l":2},{"c":"ا","l":4}]},{"pt":[{"c":"ا,ت,ن,ي","l":0},{"c":"س","l":1},{"c":"ت","l":2}],"mPt":[{"c":"ا","l":0},{"c":"س","l":1},{"c":"ت","l":2},{"c":"ف","l":3,"m":3},{"c":"ع","l":4,"m":4},{"c":"ا","l":5},{"c":"ل","l":6,"m":5}]},{"pt":[{"c":"ا,ن,ت,ي","l":0},{"c":"و","l":3}]},{"pt":[{"c":"م","l":0},{"c":"س","l":1},{"c":"ت","l":2}],"mPt":[{"c":"ا","l":0},{"c":"س","l":1},{"c":"ت","l":2},{"c":"ف","l":3,"m":3},{"c":"ع","l":4,"m":4},{"c":"ا","l":5},{"c":"ل","l":6,"m":5}]},{"pt":[{"c":"ي","l":1},{"c":"ي","l":3},{"c":"ا","l":4},{"c":"ء","l":5}]},{"pt":[{"c":"ا","l":0},{"c":"ن","l":1},{"c":"ا","l":4}]}],"pt54":[{"pt":[{"c":"ت","l":0}]},{"pt":[{"c":"ا,ي,ت,ن","l":0}],"mPt":[{"c":"ا","l":0},{"c":"ف","l":1,"m":1},{"c":"ع","l":2,"m":2},{"c":"ل","l":3,"m":3},{"c":"ر","l":4,"m":4},{"c":"ا","l":5},{"c":"ر","l":6,"m":4}]},{"pt":[{"c":"م","l":0}],"mPt":[{"c":"ا","l":0},{"c":"ف","l":1,"m":1},{"c":"ع","l":2,"m":2},{"c":"ل","l":3,"m":3},{"c":"ر","l":4,"m":4},{"c":"ا","l":5},{"c":"ر","l":6,"m":4}]},{"pt":[{"c":"ا","l":2}]},{"pt":[{"c":"ا","l":0},{"c":"ن","l":2}]}],"pt64":[{"pt":[{"c":"ا","l":0},{"c":"ا","l":4}]},{"pt":[{"c":"م","l":0},{"c":"ت","l":1}]}],"pt73":[{"pt":[{"c":"ا","l":0},{"c":"س","l":1},{"c":"ت","l":2},{"c":"ا","l":5}]}],"pt75":[{"pt":[{"c":"ا","l":0},{"c":"ا","l":5}]}]}'),e.execArray=["cleanWord","removeDiacritics","cleanAlef","removeStopWords","normalizeHamzaAndAlef","removeStartWaw","removePre432","removeEndTaa","wordCheck"],e.stem=function(){var r=0;for(e.result=!1,e.preRemoved=!1,e.sufRemoved=!1;r=0)return!0},e.normalizeHamzaAndAlef=function(){return e.word=e.word.replace("ؤ","ء"),e.word=e.word.replace("ئ","ء"),e.word=e.word.replace(/([\u0627])\1+/gi,"ا"),!1},e.removeEndTaa=function(){return!(e.word.length>2)||(e.word=e.word.replace(/[\u0627]$/,""),e.word=e.word.replace("ة",""),!1)},e.removeStartWaw=function(){return e.word.length>3&&"و"==e.word[0]&&"و"==e.word[1]&&(e.word=e.word.slice(1)),!1},e.removePre432=function(){var r=e.word;if(e.word.length>=7){var t=new RegExp("^("+e.pre.pre4.split(" ").join("|")+")");e.word=e.word.replace(t,"")}if(e.word==r&&e.word.length>=6){var c=new RegExp("^("+e.pre.pre3.split(" ").join("|")+")");e.word=e.word.replace(c,"")}if(e.word==r&&e.word.length>=5){var l=new RegExp("^("+e.pre.pre2.split(" ").join("|")+")");e.word=e.word.replace(l,"")}return r!=e.word&&(e.preRemoved=!0),!1},e.patternCheck=function(r){for(var t=0;t3){var t=new RegExp("^("+e.pre.pre1.split(" ").join("|")+")");e.word=e.word.replace(t,"")}return r!=e.word&&(e.preRemoved=!0),!1},e.removeSuf1=function(){var r=e.word;if(0==e.sufRemoved&&e.word.length>3){var t=new RegExp("("+e.suf.suf1.split(" ").join("|")+")$");e.word=e.word.replace(t,"")}return r!=e.word&&(e.sufRemoved=!0),!1},e.removeSuf432=function(){var r=e.word;if(e.word.length>=6){var t=new RegExp("("+e.suf.suf4.split(" ").join("|")+")$");e.word=e.word.replace(t,"")}if(e.word==r&&e.word.length>=5){var c=new RegExp("("+e.suf.suf3.split(" ").join("|")+")$");e.word=e.word.replace(c,"")}if(e.word==r&&e.word.length>=4){var l=new RegExp("("+e.suf.suf2.split(" ").join("|")+")$");e.word=e.word.replace(l,"")}return r!=e.word&&(e.sufRemoved=!0),!1},e.wordCheck=function(){for(var r=(e.word,[e.removeSuf432,e.removeSuf1,e.removePre1]),t=0,c=!1;e.word.length>=7&&!e.result&&t=f.limit)return;f.cursor++}for(;!f.out_grouping(w,97,248);){if(f.cursor>=f.limit)return;f.cursor++}d=f.cursor,d=d&&(r=f.limit_backward,f.limit_backward=d,f.ket=f.cursor,e=f.find_among_b(c,32),f.limit_backward=r,e))switch(f.bra=f.cursor,e){case 1:f.slice_del();break;case 2:f.in_grouping_b(p,97,229)&&f.slice_del()}}function t(){var e,r=f.limit-f.cursor;f.cursor>=d&&(e=f.limit_backward,f.limit_backward=d,f.ket=f.cursor,f.find_among_b(l,4)?(f.bra=f.cursor,f.limit_backward=e,f.cursor=f.limit-r,f.cursor>f.limit_backward&&(f.cursor--,f.bra=f.cursor,f.slice_del())):f.limit_backward=e)}function s(){var e,r,i,n=f.limit-f.cursor;if(f.ket=f.cursor,f.eq_s_b(2,"st")&&(f.bra=f.cursor,f.eq_s_b(2,"ig")&&f.slice_del()),f.cursor=f.limit-n,f.cursor>=d&&(r=f.limit_backward,f.limit_backward=d,f.ket=f.cursor,e=f.find_among_b(m,5),f.limit_backward=r,e))switch(f.bra=f.cursor,e){case 1:f.slice_del(),i=f.limit-f.cursor,t(),f.cursor=f.limit-i;break;case 2:f.slice_from("løs")}}function o(){var e;f.cursor>=d&&(e=f.limit_backward,f.limit_backward=d,f.ket=f.cursor,f.out_grouping_b(w,97,248)?(f.bra=f.cursor,u=f.slice_to(u),f.limit_backward=e,f.eq_v_b(u)&&f.slice_del()):f.limit_backward=e)}var a,d,u,c=[new r("hed",-1,1),new r("ethed",0,1),new r("ered",-1,1),new r("e",-1,1),new r("erede",3,1),new r("ende",3,1),new r("erende",5,1),new r("ene",3,1),new r("erne",3,1),new r("ere",3,1),new r("en",-1,1),new r("heden",10,1),new r("eren",10,1),new r("er",-1,1),new r("heder",13,1),new r("erer",13,1),new r("s",-1,2),new r("heds",16,1),new r("es",16,1),new r("endes",18,1),new r("erendes",19,1),new r("enes",18,1),new r("ernes",18,1),new r("eres",18,1),new r("ens",16,1),new r("hedens",24,1),new r("erens",24,1),new r("ers",16,1),new r("ets",16,1),new r("erets",28,1),new r("et",-1,1),new r("eret",30,1)],l=[new r("gd",-1,-1),new r("dt",-1,-1),new r("gt",-1,-1),new r("kt",-1,-1)],m=[new r("ig",-1,1),new r("lig",0,1),new r("elig",1,1),new r("els",-1,1),new r("løst",-1,2)],w=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,48,0,128],p=[239,254,42,3,0,0,0,0,0,0,0,0,0,0,0,0,16],f=new i;this.setCurrent=function(e){f.setCurrent(e)},this.getCurrent=function(){return f.getCurrent()},this.stem=function(){var r=f.cursor;return e(),f.limit_backward=r,f.cursor=f.limit,n(),f.cursor=f.limit,t(),f.cursor=f.limit,s(),f.cursor=f.limit,o(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return n.setCurrent(e),n.stem(),n.getCurrent()}):(n.setCurrent(e),n.stem(),n.getCurrent())}}(),e.Pipeline.registerFunction(e.da.stemmer,"stemmer-da"),e.da.stopWordFilter=e.generateStopWordFilter("ad af alle alt anden at blev blive bliver da de dem den denne der deres det dette dig din disse dog du efter eller en end er et for fra ham han hans har havde have hende hendes her hos hun hvad hvis hvor i ikke ind jeg jer jo kunne man mange med meget men mig min mine mit mod ned noget nogle nu når og også om op os over på selv sig sin sine sit skal skulle som sådan thi til ud under var vi vil ville vor være været".split(" ")),e.Pipeline.registerFunction(e.da.stopWordFilter,"stopWordFilter-da")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.de.min.js b/assets/javascripts/lunr/min/lunr.de.min.js new file mode 100644 index 00000000..f3b5c108 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.de.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `German` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.de=function(){this.pipeline.reset(),this.pipeline.add(e.de.trimmer,e.de.stopWordFilter,e.de.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.de.stemmer))},e.de.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.de.trimmer=e.trimmerSupport.generateTrimmer(e.de.wordCharacters),e.Pipeline.registerFunction(e.de.trimmer,"trimmer-de"),e.de.stemmer=function(){var r=e.stemmerSupport.Among,n=e.stemmerSupport.SnowballProgram,i=new function(){function e(e,r,n){return!(!v.eq_s(1,e)||(v.ket=v.cursor,!v.in_grouping(p,97,252)))&&(v.slice_from(r),v.cursor=n,!0)}function i(){for(var r,n,i,s,t=v.cursor;;)if(r=v.cursor,v.bra=r,v.eq_s(1,"ß"))v.ket=v.cursor,v.slice_from("ss");else{if(r>=v.limit)break;v.cursor=r+1}for(v.cursor=t;;)for(n=v.cursor;;){if(i=v.cursor,v.in_grouping(p,97,252)){if(s=v.cursor,v.bra=s,e("u","U",i))break;if(v.cursor=s,e("y","Y",i))break}if(i>=v.limit)return void(v.cursor=n);v.cursor=i+1}}function s(){for(;!v.in_grouping(p,97,252);){if(v.cursor>=v.limit)return!0;v.cursor++}for(;!v.out_grouping(p,97,252);){if(v.cursor>=v.limit)return!0;v.cursor++}return!1}function t(){m=v.limit,l=m;var e=v.cursor+3;0<=e&&e<=v.limit&&(d=e,s()||(m=v.cursor,m=v.limit)return;v.cursor++}}}function c(){return m<=v.cursor}function u(){return l<=v.cursor}function a(){var e,r,n,i,s=v.limit-v.cursor;if(v.ket=v.cursor,(e=v.find_among_b(w,7))&&(v.bra=v.cursor,c()))switch(e){case 1:v.slice_del();break;case 2:v.slice_del(),v.ket=v.cursor,v.eq_s_b(1,"s")&&(v.bra=v.cursor,v.eq_s_b(3,"nis")&&v.slice_del());break;case 3:v.in_grouping_b(g,98,116)&&v.slice_del()}if(v.cursor=v.limit-s,v.ket=v.cursor,(e=v.find_among_b(f,4))&&(v.bra=v.cursor,c()))switch(e){case 1:v.slice_del();break;case 2:if(v.in_grouping_b(k,98,116)){var t=v.cursor-3;v.limit_backward<=t&&t<=v.limit&&(v.cursor=t,v.slice_del())}}if(v.cursor=v.limit-s,v.ket=v.cursor,(e=v.find_among_b(_,8))&&(v.bra=v.cursor,u()))switch(e){case 1:v.slice_del(),v.ket=v.cursor,v.eq_s_b(2,"ig")&&(v.bra=v.cursor,r=v.limit-v.cursor,v.eq_s_b(1,"e")||(v.cursor=v.limit-r,u()&&v.slice_del()));break;case 2:n=v.limit-v.cursor,v.eq_s_b(1,"e")||(v.cursor=v.limit-n,v.slice_del());break;case 3:if(v.slice_del(),v.ket=v.cursor,i=v.limit-v.cursor,!v.eq_s_b(2,"er")&&(v.cursor=v.limit-i,!v.eq_s_b(2,"en")))break;v.bra=v.cursor,c()&&v.slice_del();break;case 4:v.slice_del(),v.ket=v.cursor,e=v.find_among_b(b,2),e&&(v.bra=v.cursor,u()&&1==e&&v.slice_del())}}var d,l,m,h=[new r("",-1,6),new r("U",0,2),new r("Y",0,1),new r("ä",0,3),new r("ö",0,4),new r("ü",0,5)],w=[new r("e",-1,2),new r("em",-1,1),new r("en",-1,2),new r("ern",-1,1),new r("er",-1,1),new r("s",-1,3),new r("es",5,2)],f=[new r("en",-1,1),new r("er",-1,1),new r("st",-1,2),new r("est",2,1)],b=[new r("ig",-1,1),new r("lich",-1,1)],_=[new r("end",-1,1),new r("ig",-1,2),new r("ung",-1,1),new r("lich",-1,3),new r("isch",-1,2),new r("ik",-1,2),new r("heit",-1,3),new r("keit",-1,4)],p=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,8,0,32,8],g=[117,30,5],k=[117,30,4],v=new n;this.setCurrent=function(e){v.setCurrent(e)},this.getCurrent=function(){return v.getCurrent()},this.stem=function(){var e=v.cursor;return i(),v.cursor=e,t(),v.limit_backward=e,v.cursor=v.limit,a(),v.cursor=v.limit_backward,o(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return i.setCurrent(e),i.stem(),i.getCurrent()}):(i.setCurrent(e),i.stem(),i.getCurrent())}}(),e.Pipeline.registerFunction(e.de.stemmer,"stemmer-de"),e.de.stopWordFilter=e.generateStopWordFilter("aber alle allem allen aller alles als also am an ander andere anderem anderen anderer anderes anderm andern anderr anders auch auf aus bei bin bis bist da damit dann das dasselbe dazu daß dein deine deinem deinen deiner deines dem demselben den denn denselben der derer derselbe derselben des desselben dessen dich die dies diese dieselbe dieselben diesem diesen dieser dieses dir doch dort du durch ein eine einem einen einer eines einig einige einigem einigen einiger einiges einmal er es etwas euch euer eure eurem euren eurer eures für gegen gewesen hab habe haben hat hatte hatten hier hin hinter ich ihm ihn ihnen ihr ihre ihrem ihren ihrer ihres im in indem ins ist jede jedem jeden jeder jedes jene jenem jenen jener jenes jetzt kann kein keine keinem keinen keiner keines können könnte machen man manche manchem manchen mancher manches mein meine meinem meinen meiner meines mich mir mit muss musste nach nicht nichts noch nun nur ob oder ohne sehr sein seine seinem seinen seiner seines selbst sich sie sind so solche solchem solchen solcher solches soll sollte sondern sonst um und uns unse unsem unsen unser unses unter viel vom von vor war waren warst was weg weil weiter welche welchem welchen welcher welches wenn werde werden wie wieder will wir wird wirst wo wollen wollte während würde würden zu zum zur zwar zwischen über".split(" ")),e.Pipeline.registerFunction(e.de.stopWordFilter,"stopWordFilter-de")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.du.min.js b/assets/javascripts/lunr/min/lunr.du.min.js new file mode 100644 index 00000000..49a0f3f0 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.du.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Dutch` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");console.warn('[Lunr Languages] Please use the "nl" instead of the "du". The "nl" code is the standard code for Dutch language, and "du" will be removed in the next major versions.'),e.du=function(){this.pipeline.reset(),this.pipeline.add(e.du.trimmer,e.du.stopWordFilter,e.du.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.du.stemmer))},e.du.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.du.trimmer=e.trimmerSupport.generateTrimmer(e.du.wordCharacters),e.Pipeline.registerFunction(e.du.trimmer,"trimmer-du"),e.du.stemmer=function(){var r=e.stemmerSupport.Among,i=e.stemmerSupport.SnowballProgram,n=new function(){function e(){for(var e,r,i,o=C.cursor;;){if(C.bra=C.cursor,e=C.find_among(b,11))switch(C.ket=C.cursor,e){case 1:C.slice_from("a");continue;case 2:C.slice_from("e");continue;case 3:C.slice_from("i");continue;case 4:C.slice_from("o");continue;case 5:C.slice_from("u");continue;case 6:if(C.cursor>=C.limit)break;C.cursor++;continue}break}for(C.cursor=o,C.bra=o,C.eq_s(1,"y")?(C.ket=C.cursor,C.slice_from("Y")):C.cursor=o;;)if(r=C.cursor,C.in_grouping(q,97,232)){if(i=C.cursor,C.bra=i,C.eq_s(1,"i"))C.ket=C.cursor,C.in_grouping(q,97,232)&&(C.slice_from("I"),C.cursor=r);else if(C.cursor=i,C.eq_s(1,"y"))C.ket=C.cursor,C.slice_from("Y"),C.cursor=r;else if(n(r))break}else if(n(r))break}function n(e){return C.cursor=e,e>=C.limit||(C.cursor++,!1)}function o(){_=C.limit,f=_,t()||(_=C.cursor,_<3&&(_=3),t()||(f=C.cursor))}function t(){for(;!C.in_grouping(q,97,232);){if(C.cursor>=C.limit)return!0;C.cursor++}for(;!C.out_grouping(q,97,232);){if(C.cursor>=C.limit)return!0;C.cursor++}return!1}function s(){for(var e;;)if(C.bra=C.cursor,e=C.find_among(p,3))switch(C.ket=C.cursor,e){case 1:C.slice_from("y");break;case 2:C.slice_from("i");break;case 3:if(C.cursor>=C.limit)return;C.cursor++}}function u(){return _<=C.cursor}function c(){return f<=C.cursor}function a(){var e=C.limit-C.cursor;C.find_among_b(g,3)&&(C.cursor=C.limit-e,C.ket=C.cursor,C.cursor>C.limit_backward&&(C.cursor--,C.bra=C.cursor,C.slice_del()))}function l(){var e;w=!1,C.ket=C.cursor,C.eq_s_b(1,"e")&&(C.bra=C.cursor,u()&&(e=C.limit-C.cursor,C.out_grouping_b(q,97,232)&&(C.cursor=C.limit-e,C.slice_del(),w=!0,a())))}function m(){var e;u()&&(e=C.limit-C.cursor,C.out_grouping_b(q,97,232)&&(C.cursor=C.limit-e,C.eq_s_b(3,"gem")||(C.cursor=C.limit-e,C.slice_del(),a())))}function d(){var e,r,i,n,o,t,s=C.limit-C.cursor;if(C.ket=C.cursor,e=C.find_among_b(h,5))switch(C.bra=C.cursor,e){case 1:u()&&C.slice_from("heid");break;case 2:m();break;case 3:u()&&C.out_grouping_b(z,97,232)&&C.slice_del()}if(C.cursor=C.limit-s,l(),C.cursor=C.limit-s,C.ket=C.cursor,C.eq_s_b(4,"heid")&&(C.bra=C.cursor,c()&&(r=C.limit-C.cursor,C.eq_s_b(1,"c")||(C.cursor=C.limit-r,C.slice_del(),C.ket=C.cursor,C.eq_s_b(2,"en")&&(C.bra=C.cursor,m())))),C.cursor=C.limit-s,C.ket=C.cursor,e=C.find_among_b(k,6))switch(C.bra=C.cursor,e){case 1:if(c()){if(C.slice_del(),i=C.limit-C.cursor,C.ket=C.cursor,C.eq_s_b(2,"ig")&&(C.bra=C.cursor,c()&&(n=C.limit-C.cursor,!C.eq_s_b(1,"e")))){C.cursor=C.limit-n,C.slice_del();break}C.cursor=C.limit-i,a()}break;case 2:c()&&(o=C.limit-C.cursor,C.eq_s_b(1,"e")||(C.cursor=C.limit-o,C.slice_del()));break;case 3:c()&&(C.slice_del(),l());break;case 4:c()&&C.slice_del();break;case 5:c()&&w&&C.slice_del()}C.cursor=C.limit-s,C.out_grouping_b(j,73,232)&&(t=C.limit-C.cursor,C.find_among_b(v,4)&&C.out_grouping_b(q,97,232)&&(C.cursor=C.limit-t,C.ket=C.cursor,C.cursor>C.limit_backward&&(C.cursor--,C.bra=C.cursor,C.slice_del())))}var f,_,w,b=[new r("",-1,6),new r("á",0,1),new r("ä",0,1),new r("é",0,2),new r("ë",0,2),new r("í",0,3),new r("ï",0,3),new r("ó",0,4),new r("ö",0,4),new r("ú",0,5),new r("ü",0,5)],p=[new r("",-1,3),new r("I",0,2),new r("Y",0,1)],g=[new r("dd",-1,-1),new r("kk",-1,-1),new r("tt",-1,-1)],h=[new r("ene",-1,2),new r("se",-1,3),new r("en",-1,2),new r("heden",2,1),new r("s",-1,3)],k=[new r("end",-1,1),new r("ig",-1,2),new r("ing",-1,1),new r("lijk",-1,3),new r("baar",-1,4),new r("bar",-1,5)],v=[new r("aa",-1,-1),new r("ee",-1,-1),new r("oo",-1,-1),new r("uu",-1,-1)],q=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,128],j=[1,0,0,17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,128],z=[17,67,16,1,0,0,0,0,0,0,0,0,0,0,0,0,128],C=new i;this.setCurrent=function(e){C.setCurrent(e)},this.getCurrent=function(){return C.getCurrent()},this.stem=function(){var r=C.cursor;return e(),C.cursor=r,o(),C.limit_backward=r,C.cursor=C.limit,d(),C.cursor=C.limit_backward,s(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return n.setCurrent(e),n.stem(),n.getCurrent()}):(n.setCurrent(e),n.stem(),n.getCurrent())}}(),e.Pipeline.registerFunction(e.du.stemmer,"stemmer-du"),e.du.stopWordFilter=e.generateStopWordFilter(" aan al alles als altijd andere ben bij daar dan dat de der deze die dit doch doen door dus een eens en er ge geen geweest haar had heb hebben heeft hem het hier hij hoe hun iemand iets ik in is ja je kan kon kunnen maar me meer men met mij mijn moet na naar niet niets nog nu of om omdat onder ons ook op over reeds te tegen toch toen tot u uit uw van veel voor want waren was wat werd wezen wie wil worden wordt zal ze zelf zich zij zijn zo zonder zou".split(" ")),e.Pipeline.registerFunction(e.du.stopWordFilter,"stopWordFilter-du")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.es.min.js b/assets/javascripts/lunr/min/lunr.es.min.js new file mode 100644 index 00000000..2989d342 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.es.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Spanish` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,s){"function"==typeof define&&define.amd?define(s):"object"==typeof exports?module.exports=s():s()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.es=function(){this.pipeline.reset(),this.pipeline.add(e.es.trimmer,e.es.stopWordFilter,e.es.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.es.stemmer))},e.es.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.es.trimmer=e.trimmerSupport.generateTrimmer(e.es.wordCharacters),e.Pipeline.registerFunction(e.es.trimmer,"trimmer-es"),e.es.stemmer=function(){var s=e.stemmerSupport.Among,r=e.stemmerSupport.SnowballProgram,n=new function(){function e(){if(A.out_grouping(x,97,252)){for(;!A.in_grouping(x,97,252);){if(A.cursor>=A.limit)return!0;A.cursor++}return!1}return!0}function n(){if(A.in_grouping(x,97,252)){var s=A.cursor;if(e()){if(A.cursor=s,!A.in_grouping(x,97,252))return!0;for(;!A.out_grouping(x,97,252);){if(A.cursor>=A.limit)return!0;A.cursor++}}return!1}return!0}function i(){var s,r=A.cursor;if(n()){if(A.cursor=r,!A.out_grouping(x,97,252))return;if(s=A.cursor,e()){if(A.cursor=s,!A.in_grouping(x,97,252)||A.cursor>=A.limit)return;A.cursor++}}g=A.cursor}function a(){for(;!A.in_grouping(x,97,252);){if(A.cursor>=A.limit)return!1;A.cursor++}for(;!A.out_grouping(x,97,252);){if(A.cursor>=A.limit)return!1;A.cursor++}return!0}function t(){var e=A.cursor;g=A.limit,p=g,v=g,i(),A.cursor=e,a()&&(p=A.cursor,a()&&(v=A.cursor))}function o(){for(var e;;){if(A.bra=A.cursor,e=A.find_among(k,6))switch(A.ket=A.cursor,e){case 1:A.slice_from("a");continue;case 2:A.slice_from("e");continue;case 3:A.slice_from("i");continue;case 4:A.slice_from("o");continue;case 5:A.slice_from("u");continue;case 6:if(A.cursor>=A.limit)break;A.cursor++;continue}break}}function u(){return g<=A.cursor}function w(){return p<=A.cursor}function c(){return v<=A.cursor}function m(){var e;if(A.ket=A.cursor,A.find_among_b(y,13)&&(A.bra=A.cursor,(e=A.find_among_b(q,11))&&u()))switch(e){case 1:A.bra=A.cursor,A.slice_from("iendo");break;case 2:A.bra=A.cursor,A.slice_from("ando");break;case 3:A.bra=A.cursor,A.slice_from("ar");break;case 4:A.bra=A.cursor,A.slice_from("er");break;case 5:A.bra=A.cursor,A.slice_from("ir");break;case 6:A.slice_del();break;case 7:A.eq_s_b(1,"u")&&A.slice_del()}}function l(e,s){if(!c())return!0;A.slice_del(),A.ket=A.cursor;var r=A.find_among_b(e,s);return r&&(A.bra=A.cursor,1==r&&c()&&A.slice_del()),!1}function d(e){return!c()||(A.slice_del(),A.ket=A.cursor,A.eq_s_b(2,e)&&(A.bra=A.cursor,c()&&A.slice_del()),!1)}function b(){var e;if(A.ket=A.cursor,e=A.find_among_b(S,46)){switch(A.bra=A.cursor,e){case 1:if(!c())return!1;A.slice_del();break;case 2:if(d("ic"))return!1;break;case 3:if(!c())return!1;A.slice_from("log");break;case 4:if(!c())return!1;A.slice_from("u");break;case 5:if(!c())return!1;A.slice_from("ente");break;case 6:if(!w())return!1;A.slice_del(),A.ket=A.cursor,e=A.find_among_b(C,4),e&&(A.bra=A.cursor,c()&&(A.slice_del(),1==e&&(A.ket=A.cursor,A.eq_s_b(2,"at")&&(A.bra=A.cursor,c()&&A.slice_del()))));break;case 7:if(l(P,3))return!1;break;case 8:if(l(F,3))return!1;break;case 9:if(d("at"))return!1}return!0}return!1}function f(){var e,s;if(A.cursor>=g&&(s=A.limit_backward,A.limit_backward=g,A.ket=A.cursor,e=A.find_among_b(W,12),A.limit_backward=s,e)){if(A.bra=A.cursor,1==e){if(!A.eq_s_b(1,"u"))return!1;A.slice_del()}return!0}return!1}function _(){var e,s,r,n;if(A.cursor>=g&&(s=A.limit_backward,A.limit_backward=g,A.ket=A.cursor,e=A.find_among_b(L,96),A.limit_backward=s,e))switch(A.bra=A.cursor,e){case 1:r=A.limit-A.cursor,A.eq_s_b(1,"u")?(n=A.limit-A.cursor,A.eq_s_b(1,"g")?A.cursor=A.limit-n:A.cursor=A.limit-r):A.cursor=A.limit-r,A.bra=A.cursor;case 2:A.slice_del()}}function h(){var e,s;if(A.ket=A.cursor,e=A.find_among_b(z,8))switch(A.bra=A.cursor,e){case 1:u()&&A.slice_del();break;case 2:u()&&(A.slice_del(),A.ket=A.cursor,A.eq_s_b(1,"u")&&(A.bra=A.cursor,s=A.limit-A.cursor,A.eq_s_b(1,"g")&&(A.cursor=A.limit-s,u()&&A.slice_del())))}}var v,p,g,k=[new s("",-1,6),new s("á",0,1),new s("é",0,2),new s("í",0,3),new s("ó",0,4),new s("ú",0,5)],y=[new s("la",-1,-1),new s("sela",0,-1),new s("le",-1,-1),new s("me",-1,-1),new s("se",-1,-1),new s("lo",-1,-1),new s("selo",5,-1),new s("las",-1,-1),new s("selas",7,-1),new s("les",-1,-1),new s("los",-1,-1),new s("selos",10,-1),new s("nos",-1,-1)],q=[new s("ando",-1,6),new s("iendo",-1,6),new s("yendo",-1,7),new s("ándo",-1,2),new s("iéndo",-1,1),new s("ar",-1,6),new s("er",-1,6),new s("ir",-1,6),new s("ár",-1,3),new s("ér",-1,4),new s("ír",-1,5)],C=[new s("ic",-1,-1),new s("ad",-1,-1),new s("os",-1,-1),new s("iv",-1,1)],P=[new s("able",-1,1),new s("ible",-1,1),new s("ante",-1,1)],F=[new s("ic",-1,1),new s("abil",-1,1),new s("iv",-1,1)],S=[new s("ica",-1,1),new s("ancia",-1,2),new s("encia",-1,5),new s("adora",-1,2),new s("osa",-1,1),new s("ista",-1,1),new s("iva",-1,9),new s("anza",-1,1),new s("logía",-1,3),new s("idad",-1,8),new s("able",-1,1),new s("ible",-1,1),new s("ante",-1,2),new s("mente",-1,7),new s("amente",13,6),new s("ación",-1,2),new s("ución",-1,4),new s("ico",-1,1),new s("ismo",-1,1),new s("oso",-1,1),new s("amiento",-1,1),new s("imiento",-1,1),new s("ivo",-1,9),new s("ador",-1,2),new s("icas",-1,1),new s("ancias",-1,2),new s("encias",-1,5),new s("adoras",-1,2),new s("osas",-1,1),new s("istas",-1,1),new s("ivas",-1,9),new s("anzas",-1,1),new s("logías",-1,3),new s("idades",-1,8),new s("ables",-1,1),new s("ibles",-1,1),new s("aciones",-1,2),new s("uciones",-1,4),new s("adores",-1,2),new s("antes",-1,2),new s("icos",-1,1),new s("ismos",-1,1),new s("osos",-1,1),new s("amientos",-1,1),new s("imientos",-1,1),new s("ivos",-1,9)],W=[new s("ya",-1,1),new s("ye",-1,1),new s("yan",-1,1),new s("yen",-1,1),new s("yeron",-1,1),new s("yendo",-1,1),new s("yo",-1,1),new s("yas",-1,1),new s("yes",-1,1),new s("yais",-1,1),new s("yamos",-1,1),new s("yó",-1,1)],L=[new s("aba",-1,2),new s("ada",-1,2),new s("ida",-1,2),new s("ara",-1,2),new s("iera",-1,2),new s("ía",-1,2),new s("aría",5,2),new s("ería",5,2),new s("iría",5,2),new s("ad",-1,2),new s("ed",-1,2),new s("id",-1,2),new s("ase",-1,2),new s("iese",-1,2),new s("aste",-1,2),new s("iste",-1,2),new s("an",-1,2),new s("aban",16,2),new s("aran",16,2),new s("ieran",16,2),new s("ían",16,2),new s("arían",20,2),new s("erían",20,2),new s("irían",20,2),new s("en",-1,1),new s("asen",24,2),new s("iesen",24,2),new s("aron",-1,2),new s("ieron",-1,2),new s("arán",-1,2),new s("erán",-1,2),new s("irán",-1,2),new s("ado",-1,2),new s("ido",-1,2),new s("ando",-1,2),new s("iendo",-1,2),new s("ar",-1,2),new s("er",-1,2),new s("ir",-1,2),new s("as",-1,2),new s("abas",39,2),new s("adas",39,2),new s("idas",39,2),new s("aras",39,2),new s("ieras",39,2),new s("ías",39,2),new s("arías",45,2),new s("erías",45,2),new s("irías",45,2),new s("es",-1,1),new s("ases",49,2),new s("ieses",49,2),new s("abais",-1,2),new s("arais",-1,2),new s("ierais",-1,2),new s("íais",-1,2),new s("aríais",55,2),new s("eríais",55,2),new s("iríais",55,2),new s("aseis",-1,2),new s("ieseis",-1,2),new s("asteis",-1,2),new s("isteis",-1,2),new s("áis",-1,2),new s("éis",-1,1),new s("aréis",64,2),new s("eréis",64,2),new s("iréis",64,2),new s("ados",-1,2),new s("idos",-1,2),new s("amos",-1,2),new s("ábamos",70,2),new s("áramos",70,2),new s("iéramos",70,2),new s("íamos",70,2),new s("aríamos",74,2),new s("eríamos",74,2),new s("iríamos",74,2),new s("emos",-1,1),new s("aremos",78,2),new s("eremos",78,2),new s("iremos",78,2),new s("ásemos",78,2),new s("iésemos",78,2),new s("imos",-1,2),new s("arás",-1,2),new s("erás",-1,2),new s("irás",-1,2),new s("ís",-1,2),new s("ará",-1,2),new s("erá",-1,2),new s("irá",-1,2),new s("aré",-1,2),new s("eré",-1,2),new s("iré",-1,2),new s("ió",-1,2)],z=[new s("a",-1,1),new s("e",-1,2),new s("o",-1,1),new s("os",-1,1),new s("á",-1,1),new s("é",-1,2),new s("í",-1,1),new s("ó",-1,1)],x=[17,65,16,0,0,0,0,0,0,0,0,0,0,0,0,0,1,17,4,10],A=new r;this.setCurrent=function(e){A.setCurrent(e)},this.getCurrent=function(){return A.getCurrent()},this.stem=function(){var e=A.cursor;return t(),A.limit_backward=e,A.cursor=A.limit,m(),A.cursor=A.limit,b()||(A.cursor=A.limit,f()||(A.cursor=A.limit,_())),A.cursor=A.limit,h(),A.cursor=A.limit_backward,o(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return n.setCurrent(e),n.stem(),n.getCurrent()}):(n.setCurrent(e),n.stem(),n.getCurrent())}}(),e.Pipeline.registerFunction(e.es.stemmer,"stemmer-es"),e.es.stopWordFilter=e.generateStopWordFilter("a al algo algunas algunos ante antes como con contra cual cuando de del desde donde durante e el ella ellas ellos en entre era erais eran eras eres es esa esas ese eso esos esta estaba estabais estaban estabas estad estada estadas estado estados estamos estando estar estaremos estará estarán estarás estaré estaréis estaría estaríais estaríamos estarían estarías estas este estemos esto estos estoy estuve estuviera estuvierais estuvieran estuvieras estuvieron estuviese estuvieseis estuviesen estuvieses estuvimos estuviste estuvisteis estuviéramos estuviésemos estuvo está estábamos estáis están estás esté estéis estén estés fue fuera fuerais fueran fueras fueron fuese fueseis fuesen fueses fui fuimos fuiste fuisteis fuéramos fuésemos ha habida habidas habido habidos habiendo habremos habrá habrán habrás habré habréis habría habríais habríamos habrían habrías habéis había habíais habíamos habían habías han has hasta hay haya hayamos hayan hayas hayáis he hemos hube hubiera hubierais hubieran hubieras hubieron hubiese hubieseis hubiesen hubieses hubimos hubiste hubisteis hubiéramos hubiésemos hubo la las le les lo los me mi mis mucho muchos muy más mí mía mías mío míos nada ni no nos nosotras nosotros nuestra nuestras nuestro nuestros o os otra otras otro otros para pero poco por porque que quien quienes qué se sea seamos sean seas seremos será serán serás seré seréis sería seríais seríamos serían serías seáis sido siendo sin sobre sois somos son soy su sus suya suyas suyo suyos sí también tanto te tendremos tendrá tendrán tendrás tendré tendréis tendría tendríais tendríamos tendrían tendrías tened tenemos tenga tengamos tengan tengas tengo tengáis tenida tenidas tenido tenidos teniendo tenéis tenía teníais teníamos tenían tenías ti tiene tienen tienes todo todos tu tus tuve tuviera tuvierais tuvieran tuvieras tuvieron tuviese tuvieseis tuviesen tuvieses tuvimos tuviste tuvisteis tuviéramos tuviésemos tuvo tuya tuyas tuyo tuyos tú un una uno unos vosotras vosotros vuestra vuestras vuestro vuestros y ya yo él éramos".split(" ")),e.Pipeline.registerFunction(e.es.stopWordFilter,"stopWordFilter-es")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.fi.min.js b/assets/javascripts/lunr/min/lunr.fi.min.js new file mode 100644 index 00000000..29f5dfce --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.fi.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Finnish` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(i,e){"function"==typeof define&&define.amd?define(e):"object"==typeof exports?module.exports=e():e()(i.lunr)}(this,function(){return function(i){if(void 0===i)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===i.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");i.fi=function(){this.pipeline.reset(),this.pipeline.add(i.fi.trimmer,i.fi.stopWordFilter,i.fi.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(i.fi.stemmer))},i.fi.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",i.fi.trimmer=i.trimmerSupport.generateTrimmer(i.fi.wordCharacters),i.Pipeline.registerFunction(i.fi.trimmer,"trimmer-fi"),i.fi.stemmer=function(){var e=i.stemmerSupport.Among,r=i.stemmerSupport.SnowballProgram,n=new function(){function i(){f=A.limit,d=f,n()||(f=A.cursor,n()||(d=A.cursor))}function n(){for(var i;;){if(i=A.cursor,A.in_grouping(W,97,246))break;if(A.cursor=i,i>=A.limit)return!0;A.cursor++}for(A.cursor=i;!A.out_grouping(W,97,246);){if(A.cursor>=A.limit)return!0;A.cursor++}return!1}function t(){return d<=A.cursor}function s(){var i,e;if(A.cursor>=f)if(e=A.limit_backward,A.limit_backward=f,A.ket=A.cursor,i=A.find_among_b(h,10)){switch(A.bra=A.cursor,A.limit_backward=e,i){case 1:if(!A.in_grouping_b(x,97,246))return;break;case 2:if(!t())return}A.slice_del()}else A.limit_backward=e}function o(){var i,e,r;if(A.cursor>=f)if(e=A.limit_backward,A.limit_backward=f,A.ket=A.cursor,i=A.find_among_b(v,9))switch(A.bra=A.cursor,A.limit_backward=e,i){case 1:r=A.limit-A.cursor,A.eq_s_b(1,"k")||(A.cursor=A.limit-r,A.slice_del());break;case 2:A.slice_del(),A.ket=A.cursor,A.eq_s_b(3,"kse")&&(A.bra=A.cursor,A.slice_from("ksi"));break;case 3:A.slice_del();break;case 4:A.find_among_b(p,6)&&A.slice_del();break;case 5:A.find_among_b(g,6)&&A.slice_del();break;case 6:A.find_among_b(j,2)&&A.slice_del()}else A.limit_backward=e}function l(){return A.find_among_b(q,7)}function a(){return A.eq_s_b(1,"i")&&A.in_grouping_b(L,97,246)}function u(){var i,e,r;if(A.cursor>=f)if(e=A.limit_backward,A.limit_backward=f,A.ket=A.cursor,i=A.find_among_b(C,30)){switch(A.bra=A.cursor,A.limit_backward=e,i){case 1:if(!A.eq_s_b(1,"a"))return;break;case 2:case 9:if(!A.eq_s_b(1,"e"))return;break;case 3:if(!A.eq_s_b(1,"i"))return;break;case 4:if(!A.eq_s_b(1,"o"))return;break;case 5:if(!A.eq_s_b(1,"ä"))return;break;case 6:if(!A.eq_s_b(1,"ö"))return;break;case 7:if(r=A.limit-A.cursor,!l()&&(A.cursor=A.limit-r,!A.eq_s_b(2,"ie"))){A.cursor=A.limit-r;break}if(A.cursor=A.limit-r,A.cursor<=A.limit_backward){A.cursor=A.limit-r;break}A.cursor--,A.bra=A.cursor;break;case 8:if(!A.in_grouping_b(W,97,246)||!A.out_grouping_b(W,97,246))return}A.slice_del(),k=!0}else A.limit_backward=e}function c(){var i,e,r;if(A.cursor>=d)if(e=A.limit_backward,A.limit_backward=d,A.ket=A.cursor,i=A.find_among_b(P,14)){if(A.bra=A.cursor,A.limit_backward=e,1==i){if(r=A.limit-A.cursor,A.eq_s_b(2,"po"))return;A.cursor=A.limit-r}A.slice_del()}else A.limit_backward=e}function m(){var i;A.cursor>=f&&(i=A.limit_backward,A.limit_backward=f,A.ket=A.cursor,A.find_among_b(F,2)?(A.bra=A.cursor,A.limit_backward=i,A.slice_del()):A.limit_backward=i)}function w(){var i,e,r,n,t,s;if(A.cursor>=f){if(e=A.limit_backward,A.limit_backward=f,A.ket=A.cursor,A.eq_s_b(1,"t")&&(A.bra=A.cursor,r=A.limit-A.cursor,A.in_grouping_b(W,97,246)&&(A.cursor=A.limit-r,A.slice_del(),A.limit_backward=e,n=A.limit-A.cursor,A.cursor>=d&&(A.cursor=d,t=A.limit_backward,A.limit_backward=A.cursor,A.cursor=A.limit-n,A.ket=A.cursor,i=A.find_among_b(S,2))))){if(A.bra=A.cursor,A.limit_backward=t,1==i){if(s=A.limit-A.cursor,A.eq_s_b(2,"po"))return;A.cursor=A.limit-s}return void A.slice_del()}A.limit_backward=e}}function _(){var i,e,r,n;if(A.cursor>=f){for(i=A.limit_backward,A.limit_backward=f,e=A.limit-A.cursor,l()&&(A.cursor=A.limit-e,A.ket=A.cursor,A.cursor>A.limit_backward&&(A.cursor--,A.bra=A.cursor,A.slice_del())),A.cursor=A.limit-e,A.ket=A.cursor,A.in_grouping_b(y,97,228)&&(A.bra=A.cursor,A.out_grouping_b(W,97,246)&&A.slice_del()),A.cursor=A.limit-e,A.ket=A.cursor,A.eq_s_b(1,"j")&&(A.bra=A.cursor,r=A.limit-A.cursor,A.eq_s_b(1,"o")?A.slice_del():(A.cursor=A.limit-r,A.eq_s_b(1,"u")&&A.slice_del())),A.cursor=A.limit-e,A.ket=A.cursor,A.eq_s_b(1,"o")&&(A.bra=A.cursor,A.eq_s_b(1,"j")&&A.slice_del()),A.cursor=A.limit-e,A.limit_backward=i;;){if(n=A.limit-A.cursor,A.out_grouping_b(W,97,246)){A.cursor=A.limit-n;break}if(A.cursor=A.limit-n,A.cursor<=A.limit_backward)return;A.cursor--}A.ket=A.cursor,A.cursor>A.limit_backward&&(A.cursor--,A.bra=A.cursor,b=A.slice_to(),A.eq_v_b(b)&&A.slice_del())}}var k,b,d,f,h=[new e("pa",-1,1),new e("sti",-1,2),new e("kaan",-1,1),new e("han",-1,1),new e("kin",-1,1),new e("hän",-1,1),new e("kään",-1,1),new e("ko",-1,1),new e("pä",-1,1),new e("kö",-1,1)],p=[new e("lla",-1,-1),new e("na",-1,-1),new e("ssa",-1,-1),new e("ta",-1,-1),new e("lta",3,-1),new e("sta",3,-1)],g=[new e("llä",-1,-1),new e("nä",-1,-1),new e("ssä",-1,-1),new e("tä",-1,-1),new e("ltä",3,-1),new e("stä",3,-1)],j=[new e("lle",-1,-1),new e("ine",-1,-1)],v=[new e("nsa",-1,3),new e("mme",-1,3),new e("nne",-1,3),new e("ni",-1,2),new e("si",-1,1),new e("an",-1,4),new e("en",-1,6),new e("än",-1,5),new e("nsä",-1,3)],q=[new e("aa",-1,-1),new e("ee",-1,-1),new e("ii",-1,-1),new e("oo",-1,-1),new e("uu",-1,-1),new e("ää",-1,-1),new e("öö",-1,-1)],C=[new e("a",-1,8),new e("lla",0,-1),new e("na",0,-1),new e("ssa",0,-1),new e("ta",0,-1),new e("lta",4,-1),new e("sta",4,-1),new e("tta",4,9),new e("lle",-1,-1),new e("ine",-1,-1),new e("ksi",-1,-1),new e("n",-1,7),new e("han",11,1),new e("den",11,-1,a),new e("seen",11,-1,l),new e("hen",11,2),new e("tten",11,-1,a),new e("hin",11,3),new e("siin",11,-1,a),new e("hon",11,4),new e("hän",11,5),new e("hön",11,6),new e("ä",-1,8),new e("llä",22,-1),new e("nä",22,-1),new e("ssä",22,-1),new e("tä",22,-1),new e("ltä",26,-1),new e("stä",26,-1),new e("ttä",26,9)],P=[new e("eja",-1,-1),new e("mma",-1,1),new e("imma",1,-1),new e("mpa",-1,1),new e("impa",3,-1),new e("mmi",-1,1),new e("immi",5,-1),new e("mpi",-1,1),new e("impi",7,-1),new e("ejä",-1,-1),new e("mmä",-1,1),new e("immä",10,-1),new e("mpä",-1,1),new e("impä",12,-1)],F=[new e("i",-1,-1),new e("j",-1,-1)],S=[new e("mma",-1,1),new e("imma",0,-1)],y=[17,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8],W=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,8,0,32],L=[17,65,16,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,32],x=[17,97,24,1,0,0,0,0,0,0,0,0,0,0,0,0,8,0,32],A=new r;this.setCurrent=function(i){A.setCurrent(i)},this.getCurrent=function(){return A.getCurrent()},this.stem=function(){var e=A.cursor;return i(),k=!1,A.limit_backward=e,A.cursor=A.limit,s(),A.cursor=A.limit,o(),A.cursor=A.limit,u(),A.cursor=A.limit,c(),A.cursor=A.limit,k?(m(),A.cursor=A.limit):(A.cursor=A.limit,w(),A.cursor=A.limit),_(),!0}};return function(i){return"function"==typeof i.update?i.update(function(i){return n.setCurrent(i),n.stem(),n.getCurrent()}):(n.setCurrent(i),n.stem(),n.getCurrent())}}(),i.Pipeline.registerFunction(i.fi.stemmer,"stemmer-fi"),i.fi.stopWordFilter=i.generateStopWordFilter("ei eivät emme en et ette että he heidän heidät heihin heille heillä heiltä heissä heistä heitä hän häneen hänelle hänellä häneltä hänen hänessä hänestä hänet häntä itse ja johon joiden joihin joiksi joilla joille joilta joina joissa joista joita joka joksi jolla jolle jolta jona jonka jos jossa josta jota jotka kanssa keiden keihin keiksi keille keillä keiltä keinä keissä keistä keitä keneen keneksi kenelle kenellä keneltä kenen kenenä kenessä kenestä kenet ketkä ketkä ketä koska kuin kuka kun me meidän meidät meihin meille meillä meiltä meissä meistä meitä mihin miksi mikä mille millä miltä minkä minkä minua minulla minulle minulta minun minussa minusta minut minuun minä minä missä mistä mitkä mitä mukaan mutta ne niiden niihin niiksi niille niillä niiltä niin niin niinä niissä niistä niitä noiden noihin noiksi noilla noille noilta noin noina noissa noista noita nuo nyt näiden näihin näiksi näille näillä näiltä näinä näissä näistä näitä nämä ole olemme olen olet olette oli olimme olin olisi olisimme olisin olisit olisitte olisivat olit olitte olivat olla olleet ollut on ovat poikki se sekä sen siihen siinä siitä siksi sille sillä sillä siltä sinua sinulla sinulle sinulta sinun sinussa sinusta sinut sinuun sinä sinä sitä tai te teidän teidät teihin teille teillä teiltä teissä teistä teitä tuo tuohon tuoksi tuolla tuolle tuolta tuon tuona tuossa tuosta tuota tähän täksi tälle tällä tältä tämä tämän tänä tässä tästä tätä vaan vai vaikka yli".split(" ")),i.Pipeline.registerFunction(i.fi.stopWordFilter,"stopWordFilter-fi")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.fr.min.js b/assets/javascripts/lunr/min/lunr.fr.min.js new file mode 100644 index 00000000..68cd0094 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.fr.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `French` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.fr=function(){this.pipeline.reset(),this.pipeline.add(e.fr.trimmer,e.fr.stopWordFilter,e.fr.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.fr.stemmer))},e.fr.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.fr.trimmer=e.trimmerSupport.generateTrimmer(e.fr.wordCharacters),e.Pipeline.registerFunction(e.fr.trimmer,"trimmer-fr"),e.fr.stemmer=function(){var r=e.stemmerSupport.Among,s=e.stemmerSupport.SnowballProgram,i=new function(){function e(e,r,s){return!(!W.eq_s(1,e)||(W.ket=W.cursor,!W.in_grouping(F,97,251)))&&(W.slice_from(r),W.cursor=s,!0)}function i(e,r,s){return!!W.eq_s(1,e)&&(W.ket=W.cursor,W.slice_from(r),W.cursor=s,!0)}function n(){for(var r,s;;){if(r=W.cursor,W.in_grouping(F,97,251)){if(W.bra=W.cursor,s=W.cursor,e("u","U",r))continue;if(W.cursor=s,e("i","I",r))continue;if(W.cursor=s,i("y","Y",r))continue}if(W.cursor=r,W.bra=r,!e("y","Y",r)){if(W.cursor=r,W.eq_s(1,"q")&&(W.bra=W.cursor,i("u","U",r)))continue;if(W.cursor=r,r>=W.limit)return;W.cursor++}}}function t(){for(;!W.in_grouping(F,97,251);){if(W.cursor>=W.limit)return!0;W.cursor++}for(;!W.out_grouping(F,97,251);){if(W.cursor>=W.limit)return!0;W.cursor++}return!1}function u(){var e=W.cursor;if(q=W.limit,g=q,p=q,W.in_grouping(F,97,251)&&W.in_grouping(F,97,251)&&W.cursor=W.limit){W.cursor=q;break}W.cursor++}while(!W.in_grouping(F,97,251))}q=W.cursor,W.cursor=e,t()||(g=W.cursor,t()||(p=W.cursor))}function o(){for(var e,r;;){if(r=W.cursor,W.bra=r,!(e=W.find_among(h,4)))break;switch(W.ket=W.cursor,e){case 1:W.slice_from("i");break;case 2:W.slice_from("u");break;case 3:W.slice_from("y");break;case 4:if(W.cursor>=W.limit)return;W.cursor++}}}function c(){return q<=W.cursor}function a(){return g<=W.cursor}function l(){return p<=W.cursor}function w(){var e,r;if(W.ket=W.cursor,e=W.find_among_b(C,43)){switch(W.bra=W.cursor,e){case 1:if(!l())return!1;W.slice_del();break;case 2:if(!l())return!1;W.slice_del(),W.ket=W.cursor,W.eq_s_b(2,"ic")&&(W.bra=W.cursor,l()?W.slice_del():W.slice_from("iqU"));break;case 3:if(!l())return!1;W.slice_from("log");break;case 4:if(!l())return!1;W.slice_from("u");break;case 5:if(!l())return!1;W.slice_from("ent");break;case 6:if(!c())return!1;if(W.slice_del(),W.ket=W.cursor,e=W.find_among_b(z,6))switch(W.bra=W.cursor,e){case 1:l()&&(W.slice_del(),W.ket=W.cursor,W.eq_s_b(2,"at")&&(W.bra=W.cursor,l()&&W.slice_del()));break;case 2:l()?W.slice_del():a()&&W.slice_from("eux");break;case 3:l()&&W.slice_del();break;case 4:c()&&W.slice_from("i")}break;case 7:if(!l())return!1;if(W.slice_del(),W.ket=W.cursor,e=W.find_among_b(y,3))switch(W.bra=W.cursor,e){case 1:l()?W.slice_del():W.slice_from("abl");break;case 2:l()?W.slice_del():W.slice_from("iqU");break;case 3:l()&&W.slice_del()}break;case 8:if(!l())return!1;if(W.slice_del(),W.ket=W.cursor,W.eq_s_b(2,"at")&&(W.bra=W.cursor,l()&&(W.slice_del(),W.ket=W.cursor,W.eq_s_b(2,"ic")))){W.bra=W.cursor,l()?W.slice_del():W.slice_from("iqU");break}break;case 9:W.slice_from("eau");break;case 10:if(!a())return!1;W.slice_from("al");break;case 11:if(l())W.slice_del();else{if(!a())return!1;W.slice_from("eux")}break;case 12:if(!a()||!W.out_grouping_b(F,97,251))return!1;W.slice_del();break;case 13:return c()&&W.slice_from("ant"),!1;case 14:return c()&&W.slice_from("ent"),!1;case 15:return r=W.limit-W.cursor,W.in_grouping_b(F,97,251)&&c()&&(W.cursor=W.limit-r,W.slice_del()),!1}return!0}return!1}function f(){var e,r;if(W.cursor=q){if(s=W.limit_backward,W.limit_backward=q,W.ket=W.cursor,e=W.find_among_b(P,7))switch(W.bra=W.cursor,e){case 1:if(l()){if(i=W.limit-W.cursor,!W.eq_s_b(1,"s")&&(W.cursor=W.limit-i,!W.eq_s_b(1,"t")))break;W.slice_del()}break;case 2:W.slice_from("i");break;case 3:W.slice_del();break;case 4:W.eq_s_b(2,"gu")&&W.slice_del()}W.limit_backward=s}}function b(){var e=W.limit-W.cursor;W.find_among_b(U,5)&&(W.cursor=W.limit-e,W.ket=W.cursor,W.cursor>W.limit_backward&&(W.cursor--,W.bra=W.cursor,W.slice_del()))}function d(){for(var e,r=1;W.out_grouping_b(F,97,251);)r--;if(r<=0){if(W.ket=W.cursor,e=W.limit-W.cursor,!W.eq_s_b(1,"é")&&(W.cursor=W.limit-e,!W.eq_s_b(1,"è")))return;W.bra=W.cursor,W.slice_from("e")}}function k(){if(!w()&&(W.cursor=W.limit,!f()&&(W.cursor=W.limit,!m())))return W.cursor=W.limit,void _();W.cursor=W.limit,W.ket=W.cursor,W.eq_s_b(1,"Y")?(W.bra=W.cursor,W.slice_from("i")):(W.cursor=W.limit,W.eq_s_b(1,"ç")&&(W.bra=W.cursor,W.slice_from("c")))}var p,g,q,v=[new r("col",-1,-1),new r("par",-1,-1),new r("tap",-1,-1)],h=[new r("",-1,4),new r("I",0,1),new r("U",0,2),new r("Y",0,3)],z=[new r("iqU",-1,3),new r("abl",-1,3),new r("Ièr",-1,4),new r("ièr",-1,4),new r("eus",-1,2),new r("iv",-1,1)],y=[new r("ic",-1,2),new r("abil",-1,1),new r("iv",-1,3)],C=[new r("iqUe",-1,1),new r("atrice",-1,2),new r("ance",-1,1),new r("ence",-1,5),new r("logie",-1,3),new r("able",-1,1),new r("isme",-1,1),new r("euse",-1,11),new r("iste",-1,1),new r("ive",-1,8),new r("if",-1,8),new r("usion",-1,4),new r("ation",-1,2),new r("ution",-1,4),new r("ateur",-1,2),new r("iqUes",-1,1),new r("atrices",-1,2),new r("ances",-1,1),new r("ences",-1,5),new r("logies",-1,3),new r("ables",-1,1),new r("ismes",-1,1),new r("euses",-1,11),new r("istes",-1,1),new r("ives",-1,8),new r("ifs",-1,8),new r("usions",-1,4),new r("ations",-1,2),new r("utions",-1,4),new r("ateurs",-1,2),new r("ments",-1,15),new r("ements",30,6),new r("issements",31,12),new r("ités",-1,7),new r("ment",-1,15),new r("ement",34,6),new r("issement",35,12),new r("amment",34,13),new r("emment",34,14),new r("aux",-1,10),new r("eaux",39,9),new r("eux",-1,1),new r("ité",-1,7)],x=[new r("ira",-1,1),new r("ie",-1,1),new r("isse",-1,1),new r("issante",-1,1),new r("i",-1,1),new r("irai",4,1),new r("ir",-1,1),new r("iras",-1,1),new r("ies",-1,1),new r("îmes",-1,1),new r("isses",-1,1),new r("issantes",-1,1),new r("îtes",-1,1),new r("is",-1,1),new r("irais",13,1),new r("issais",13,1),new r("irions",-1,1),new r("issions",-1,1),new r("irons",-1,1),new r("issons",-1,1),new r("issants",-1,1),new r("it",-1,1),new r("irait",21,1),new r("issait",21,1),new r("issant",-1,1),new r("iraIent",-1,1),new r("issaIent",-1,1),new r("irent",-1,1),new r("issent",-1,1),new r("iront",-1,1),new r("ît",-1,1),new r("iriez",-1,1),new r("issiez",-1,1),new r("irez",-1,1),new r("issez",-1,1)],I=[new r("a",-1,3),new r("era",0,2),new r("asse",-1,3),new r("ante",-1,3),new r("ée",-1,2),new r("ai",-1,3),new r("erai",5,2),new r("er",-1,2),new r("as",-1,3),new r("eras",8,2),new r("âmes",-1,3),new r("asses",-1,3),new r("antes",-1,3),new r("âtes",-1,3),new r("ées",-1,2),new r("ais",-1,3),new r("erais",15,2),new r("ions",-1,1),new r("erions",17,2),new r("assions",17,3),new r("erons",-1,2),new r("ants",-1,3),new r("és",-1,2),new r("ait",-1,3),new r("erait",23,2),new r("ant",-1,3),new r("aIent",-1,3),new r("eraIent",26,2),new r("èrent",-1,2),new r("assent",-1,3),new r("eront",-1,2),new r("ât",-1,3),new r("ez",-1,2),new r("iez",32,2),new r("eriez",33,2),new r("assiez",33,3),new r("erez",32,2),new r("é",-1,2)],P=[new r("e",-1,3),new r("Ière",0,2),new r("ière",0,2),new r("ion",-1,1),new r("Ier",-1,2),new r("ier",-1,2),new r("ë",-1,4)],U=[new r("ell",-1,-1),new r("eill",-1,-1),new r("enn",-1,-1),new r("onn",-1,-1),new r("ett",-1,-1)],F=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,128,130,103,8,5],S=[1,65,20,0,0,0,0,0,0,0,0,0,0,0,0,0,128],W=new s;this.setCurrent=function(e){W.setCurrent(e)},this.getCurrent=function(){return W.getCurrent()},this.stem=function(){var e=W.cursor;return n(),W.cursor=e,u(),W.limit_backward=e,W.cursor=W.limit,k(),W.cursor=W.limit,b(),W.cursor=W.limit,d(),W.cursor=W.limit_backward,o(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return i.setCurrent(e),i.stem(),i.getCurrent()}):(i.setCurrent(e),i.stem(),i.getCurrent())}}(),e.Pipeline.registerFunction(e.fr.stemmer,"stemmer-fr"),e.fr.stopWordFilter=e.generateStopWordFilter("ai aie aient aies ait as au aura aurai auraient aurais aurait auras aurez auriez aurions aurons auront aux avaient avais avait avec avez aviez avions avons ayant ayez ayons c ce ceci celà ces cet cette d dans de des du elle en es est et eu eue eues eurent eus eusse eussent eusses eussiez eussions eut eux eûmes eût eûtes furent fus fusse fussent fusses fussiez fussions fut fûmes fût fûtes ici il ils j je l la le les leur leurs lui m ma mais me mes moi mon même n ne nos notre nous on ont ou par pas pour qu que quel quelle quelles quels qui s sa sans se sera serai seraient serais serait seras serez seriez serions serons seront ses soi soient sois soit sommes son sont soyez soyons suis sur t ta te tes toi ton tu un une vos votre vous y à étaient étais était étant étiez étions été étée étées étés êtes".split(" ")),e.Pipeline.registerFunction(e.fr.stopWordFilter,"stopWordFilter-fr")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.hi.min.js b/assets/javascripts/lunr/min/lunr.hi.min.js new file mode 100644 index 00000000..7dbc4140 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.hi.min.js @@ -0,0 +1 @@ +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.hi=function(){this.pipeline.reset(),this.pipeline.add(e.hi.trimmer,e.hi.stopWordFilter,e.hi.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.hi.stemmer))},e.hi.wordCharacters="ऀ-ःऄ-एऐ-टठ-यर-िी-ॏॐ-य़ॠ-९॰-ॿa-zA-Za-zA-Z0-90-9",e.hi.trimmer=e.trimmerSupport.generateTrimmer(e.hi.wordCharacters),e.Pipeline.registerFunction(e.hi.trimmer,"trimmer-hi"),e.hi.stopWordFilter=e.generateStopWordFilter("अत अपना अपनी अपने अभी अंदर आदि आप इत्यादि इन इनका इन्हीं इन्हें इन्हों इस इसका इसकी इसके इसमें इसी इसे उन उनका उनकी उनके उनको उन्हीं उन्हें उन्हों उस उसके उसी उसे एक एवं एस ऐसे और कई कर करता करते करना करने करें कहते कहा का काफ़ी कि कितना किन्हें किन्हों किया किर किस किसी किसे की कुछ कुल के को कोई कौन कौनसा गया घर जब जहाँ जा जितना जिन जिन्हें जिन्हों जिस जिसे जीधर जैसा जैसे जो तक तब तरह तिन तिन्हें तिन्हों तिस तिसे तो था थी थे दबारा दिया दुसरा दूसरे दो द्वारा न नके नहीं ना निहायत नीचे ने पर पहले पूरा पे फिर बनी बही बहुत बाद बाला बिलकुल भी भीतर मगर मानो मे में यदि यह यहाँ यही या यिह ये रखें रहा रहे ऱ्वासा लिए लिये लेकिन व वग़ैरह वर्ग वह वहाँ वहीं वाले वुह वे वो सकता सकते सबसे सभी साथ साबुत साभ सारा से सो संग ही हुआ हुई हुए है हैं हो होता होती होते होना होने".split(" ")),e.hi.stemmer=function(){return function(e){return"function"==typeof e.update?e.update(function(e){return e}):e}}();var r=e.wordcut;r.init(),e.hi.tokenizer=function(i){if(!arguments.length||null==i||void 0==i)return[];if(Array.isArray(i))return i.map(function(r){return isLunr2?new e.Token(r.toLowerCase()):r.toLowerCase()});var t=i.toString().toLowerCase().replace(/^\s+/,"");return r.cut(t).split("|")},e.Pipeline.registerFunction(e.hi.stemmer,"stemmer-hi"),e.Pipeline.registerFunction(e.hi.stopWordFilter,"stopWordFilter-hi")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.hu.min.js b/assets/javascripts/lunr/min/lunr.hu.min.js new file mode 100644 index 00000000..ed9d909f --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.hu.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Hungarian` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,n){"function"==typeof define&&define.amd?define(n):"object"==typeof exports?module.exports=n():n()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.hu=function(){this.pipeline.reset(),this.pipeline.add(e.hu.trimmer,e.hu.stopWordFilter,e.hu.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.hu.stemmer))},e.hu.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.hu.trimmer=e.trimmerSupport.generateTrimmer(e.hu.wordCharacters),e.Pipeline.registerFunction(e.hu.trimmer,"trimmer-hu"),e.hu.stemmer=function(){var n=e.stemmerSupport.Among,r=e.stemmerSupport.SnowballProgram,i=new function(){function e(){var e,n=L.cursor;if(d=L.limit,L.in_grouping(W,97,252))for(;;){if(e=L.cursor,L.out_grouping(W,97,252))return L.cursor=e,L.find_among(g,8)||(L.cursor=e,e=L.limit)return void(d=e);L.cursor++}if(L.cursor=n,L.out_grouping(W,97,252)){for(;!L.in_grouping(W,97,252);){if(L.cursor>=L.limit)return;L.cursor++}d=L.cursor}}function i(){return d<=L.cursor}function a(){var e;if(L.ket=L.cursor,(e=L.find_among_b(h,2))&&(L.bra=L.cursor,i()))switch(e){case 1:L.slice_from("a");break;case 2:L.slice_from("e")}}function t(){var e=L.limit-L.cursor;return!!L.find_among_b(p,23)&&(L.cursor=L.limit-e,!0)}function s(){if(L.cursor>L.limit_backward){L.cursor--,L.ket=L.cursor;var e=L.cursor-1;L.limit_backward<=e&&e<=L.limit&&(L.cursor=e,L.bra=e,L.slice_del())}}function c(){var e;if(L.ket=L.cursor,(e=L.find_among_b(_,2))&&(L.bra=L.cursor,i())){if((1==e||2==e)&&!t())return;L.slice_del(),s()}}function o(){L.ket=L.cursor,L.find_among_b(v,44)&&(L.bra=L.cursor,i()&&(L.slice_del(),a()))}function w(){var e;if(L.ket=L.cursor,(e=L.find_among_b(z,3))&&(L.bra=L.cursor,i()))switch(e){case 1:L.slice_from("e");break;case 2:case 3:L.slice_from("a")}}function l(){var e;if(L.ket=L.cursor,(e=L.find_among_b(y,6))&&(L.bra=L.cursor,i()))switch(e){case 1:case 2:L.slice_del();break;case 3:L.slice_from("a");break;case 4:L.slice_from("e")}}function u(){var e;if(L.ket=L.cursor,(e=L.find_among_b(j,2))&&(L.bra=L.cursor,i())){if((1==e||2==e)&&!t())return;L.slice_del(),s()}}function m(){var e;if(L.ket=L.cursor,(e=L.find_among_b(C,7))&&(L.bra=L.cursor,i()))switch(e){case 1:L.slice_from("a");break;case 2:L.slice_from("e");break;case 3:case 4:case 5:case 6:case 7:L.slice_del()}}function k(){var e;if(L.ket=L.cursor,(e=L.find_among_b(P,12))&&(L.bra=L.cursor,i()))switch(e){case 1:case 4:case 7:case 9:L.slice_del();break;case 2:case 5:case 8:L.slice_from("e");break;case 3:case 6:L.slice_from("a")}}function f(){var e;if(L.ket=L.cursor,(e=L.find_among_b(F,31))&&(L.bra=L.cursor,i()))switch(e){case 1:case 4:case 7:case 8:case 9:case 12:case 13:case 16:case 17:case 18:L.slice_del();break;case 2:case 5:case 10:case 14:case 19:L.slice_from("a");break;case 3:case 6:case 11:case 15:case 20:L.slice_from("e")}}function b(){var e;if(L.ket=L.cursor,(e=L.find_among_b(S,42))&&(L.bra=L.cursor,i()))switch(e){case 1:case 4:case 5:case 6:case 9:case 10:case 11:case 14:case 15:case 16:case 17:case 20:case 21:case 24:case 25:case 26:case 29:L.slice_del();break;case 2:case 7:case 12:case 18:case 22:case 27:L.slice_from("a");break;case 3:case 8:case 13:case 19:case 23:case 28:L.slice_from("e")}}var d,g=[new n("cs",-1,-1),new n("dzs",-1,-1),new n("gy",-1,-1),new n("ly",-1,-1),new n("ny",-1,-1),new n("sz",-1,-1),new n("ty",-1,-1),new n("zs",-1,-1)],h=[new n("á",-1,1),new n("é",-1,2)],p=[new n("bb",-1,-1),new n("cc",-1,-1),new n("dd",-1,-1),new n("ff",-1,-1),new n("gg",-1,-1),new n("jj",-1,-1),new n("kk",-1,-1),new n("ll",-1,-1),new n("mm",-1,-1),new n("nn",-1,-1),new n("pp",-1,-1),new n("rr",-1,-1),new n("ccs",-1,-1),new n("ss",-1,-1),new n("zzs",-1,-1),new n("tt",-1,-1),new n("vv",-1,-1),new n("ggy",-1,-1),new n("lly",-1,-1),new n("nny",-1,-1),new n("tty",-1,-1),new n("ssz",-1,-1),new n("zz",-1,-1)],_=[new n("al",-1,1),new n("el",-1,2)],v=[new n("ba",-1,-1),new n("ra",-1,-1),new n("be",-1,-1),new n("re",-1,-1),new n("ig",-1,-1),new n("nak",-1,-1),new n("nek",-1,-1),new n("val",-1,-1),new n("vel",-1,-1),new n("ul",-1,-1),new n("nál",-1,-1),new n("nél",-1,-1),new n("ból",-1,-1),new n("ról",-1,-1),new n("tól",-1,-1),new n("bõl",-1,-1),new n("rõl",-1,-1),new n("tõl",-1,-1),new n("ül",-1,-1),new n("n",-1,-1),new n("an",19,-1),new n("ban",20,-1),new n("en",19,-1),new n("ben",22,-1),new n("képpen",22,-1),new n("on",19,-1),new n("ön",19,-1),new n("képp",-1,-1),new n("kor",-1,-1),new n("t",-1,-1),new n("at",29,-1),new n("et",29,-1),new n("ként",29,-1),new n("anként",32,-1),new n("enként",32,-1),new n("onként",32,-1),new n("ot",29,-1),new n("ért",29,-1),new n("öt",29,-1),new n("hez",-1,-1),new n("hoz",-1,-1),new n("höz",-1,-1),new n("vá",-1,-1),new n("vé",-1,-1)],z=[new n("án",-1,2),new n("én",-1,1),new n("ánként",-1,3)],y=[new n("stul",-1,2),new n("astul",0,1),new n("ástul",0,3),new n("stül",-1,2),new n("estül",3,1),new n("éstül",3,4)],j=[new n("á",-1,1),new n("é",-1,2)],C=[new n("k",-1,7),new n("ak",0,4),new n("ek",0,6),new n("ok",0,5),new n("ák",0,1),new n("ék",0,2),new n("ök",0,3)],P=[new n("éi",-1,7),new n("áéi",0,6),new n("ééi",0,5),new n("é",-1,9),new n("ké",3,4),new n("aké",4,1),new n("eké",4,1),new n("oké",4,1),new n("áké",4,3),new n("éké",4,2),new n("öké",4,1),new n("éé",3,8)],F=[new n("a",-1,18),new n("ja",0,17),new n("d",-1,16),new n("ad",2,13),new n("ed",2,13),new n("od",2,13),new n("ád",2,14),new n("éd",2,15),new n("öd",2,13),new n("e",-1,18),new n("je",9,17),new n("nk",-1,4),new n("unk",11,1),new n("ánk",11,2),new n("énk",11,3),new n("ünk",11,1),new n("uk",-1,8),new n("juk",16,7),new n("ájuk",17,5),new n("ük",-1,8),new n("jük",19,7),new n("éjük",20,6),new n("m",-1,12),new n("am",22,9),new n("em",22,9),new n("om",22,9),new n("ám",22,10),new n("ém",22,11),new n("o",-1,18),new n("á",-1,19),new n("é",-1,20)],S=[new n("id",-1,10),new n("aid",0,9),new n("jaid",1,6),new n("eid",0,9),new n("jeid",3,6),new n("áid",0,7),new n("éid",0,8),new n("i",-1,15),new n("ai",7,14),new n("jai",8,11),new n("ei",7,14),new n("jei",10,11),new n("ái",7,12),new n("éi",7,13),new n("itek",-1,24),new n("eitek",14,21),new n("jeitek",15,20),new n("éitek",14,23),new n("ik",-1,29),new n("aik",18,26),new n("jaik",19,25),new n("eik",18,26),new n("jeik",21,25),new n("áik",18,27),new n("éik",18,28),new n("ink",-1,20),new n("aink",25,17),new n("jaink",26,16),new n("eink",25,17),new n("jeink",28,16),new n("áink",25,18),new n("éink",25,19),new n("aitok",-1,21),new n("jaitok",32,20),new n("áitok",-1,22),new n("im",-1,5),new n("aim",35,4),new n("jaim",36,1),new n("eim",35,4),new n("jeim",38,1),new n("áim",35,2),new n("éim",35,3)],W=[17,65,16,0,0,0,0,0,0,0,0,0,0,0,0,0,1,17,52,14],L=new r;this.setCurrent=function(e){L.setCurrent(e)},this.getCurrent=function(){return L.getCurrent()},this.stem=function(){var n=L.cursor;return e(),L.limit_backward=n,L.cursor=L.limit,c(),L.cursor=L.limit,o(),L.cursor=L.limit,w(),L.cursor=L.limit,l(),L.cursor=L.limit,u(),L.cursor=L.limit,k(),L.cursor=L.limit,f(),L.cursor=L.limit,b(),L.cursor=L.limit,m(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return i.setCurrent(e),i.stem(),i.getCurrent()}):(i.setCurrent(e),i.stem(),i.getCurrent())}}(),e.Pipeline.registerFunction(e.hu.stemmer,"stemmer-hu"),e.hu.stopWordFilter=e.generateStopWordFilter("a abban ahhoz ahogy ahol aki akik akkor alatt amely amelyek amelyekben amelyeket amelyet amelynek ami amikor amit amolyan amíg annak arra arról az azok azon azonban azt aztán azután azzal azért be belül benne bár cikk cikkek cikkeket csak de e ebben eddig egy egyes egyetlen egyik egyre egyéb egész ehhez ekkor el ellen elsõ elég elõ elõször elõtt emilyen ennek erre ez ezek ezen ezt ezzel ezért fel felé hanem hiszen hogy hogyan igen ill ill. illetve ilyen ilyenkor ismét ison itt jobban jó jól kell kellett keressünk keresztül ki kívül között közül legalább legyen lehet lehetett lenne lenni lesz lett maga magát majd majd meg mellett mely melyek mert mi mikor milyen minden mindenki mindent mindig mint mintha mit mivel miért most már más másik még míg nagy nagyobb nagyon ne nekem neki nem nincs néha néhány nélkül olyan ott pedig persze rá s saját sem semmi sok sokat sokkal szemben szerint szinte számára talán tehát teljes tovább továbbá több ugyanis utolsó után utána vagy vagyis vagyok valaki valami valamint való van vannak vele vissza viszont volna volt voltak voltam voltunk által általában át én éppen és így õ õk õket össze úgy új újabb újra".split(" ")),e.Pipeline.registerFunction(e.hu.stopWordFilter,"stopWordFilter-hu")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.it.min.js b/assets/javascripts/lunr/min/lunr.it.min.js new file mode 100644 index 00000000..344b6a3c --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.it.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Italian` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.it=function(){this.pipeline.reset(),this.pipeline.add(e.it.trimmer,e.it.stopWordFilter,e.it.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.it.stemmer))},e.it.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.it.trimmer=e.trimmerSupport.generateTrimmer(e.it.wordCharacters),e.Pipeline.registerFunction(e.it.trimmer,"trimmer-it"),e.it.stemmer=function(){var r=e.stemmerSupport.Among,n=e.stemmerSupport.SnowballProgram,i=new function(){function e(e,r,n){return!(!x.eq_s(1,e)||(x.ket=x.cursor,!x.in_grouping(L,97,249)))&&(x.slice_from(r),x.cursor=n,!0)}function i(){for(var r,n,i,o,t=x.cursor;;){if(x.bra=x.cursor,r=x.find_among(h,7))switch(x.ket=x.cursor,r){case 1:x.slice_from("à");continue;case 2:x.slice_from("è");continue;case 3:x.slice_from("ì");continue;case 4:x.slice_from("ò");continue;case 5:x.slice_from("ù");continue;case 6:x.slice_from("qU");continue;case 7:if(x.cursor>=x.limit)break;x.cursor++;continue}break}for(x.cursor=t;;)for(n=x.cursor;;){if(i=x.cursor,x.in_grouping(L,97,249)){if(x.bra=x.cursor,o=x.cursor,e("u","U",i))break;if(x.cursor=o,e("i","I",i))break}if(x.cursor=i,x.cursor>=x.limit)return void(x.cursor=n);x.cursor++}}function o(e){if(x.cursor=e,!x.in_grouping(L,97,249))return!1;for(;!x.out_grouping(L,97,249);){if(x.cursor>=x.limit)return!1;x.cursor++}return!0}function t(){if(x.in_grouping(L,97,249)){var e=x.cursor;if(x.out_grouping(L,97,249)){for(;!x.in_grouping(L,97,249);){if(x.cursor>=x.limit)return o(e);x.cursor++}return!0}return o(e)}return!1}function s(){var e,r=x.cursor;if(!t()){if(x.cursor=r,!x.out_grouping(L,97,249))return;if(e=x.cursor,x.out_grouping(L,97,249)){for(;!x.in_grouping(L,97,249);){if(x.cursor>=x.limit)return x.cursor=e,void(x.in_grouping(L,97,249)&&x.cursor=x.limit)return;x.cursor++}k=x.cursor}function a(){for(;!x.in_grouping(L,97,249);){if(x.cursor>=x.limit)return!1;x.cursor++}for(;!x.out_grouping(L,97,249);){if(x.cursor>=x.limit)return!1;x.cursor++}return!0}function u(){var e=x.cursor;k=x.limit,p=k,g=k,s(),x.cursor=e,a()&&(p=x.cursor,a()&&(g=x.cursor))}function c(){for(var e;;){if(x.bra=x.cursor,!(e=x.find_among(q,3)))break;switch(x.ket=x.cursor,e){case 1:x.slice_from("i");break;case 2:x.slice_from("u");break;case 3:if(x.cursor>=x.limit)return;x.cursor++}}}function w(){return k<=x.cursor}function l(){return p<=x.cursor}function m(){return g<=x.cursor}function f(){var e;if(x.ket=x.cursor,x.find_among_b(C,37)&&(x.bra=x.cursor,(e=x.find_among_b(z,5))&&w()))switch(e){case 1:x.slice_del();break;case 2:x.slice_from("e")}}function v(){var e;if(x.ket=x.cursor,!(e=x.find_among_b(S,51)))return!1;switch(x.bra=x.cursor,e){case 1:if(!m())return!1;x.slice_del();break;case 2:if(!m())return!1;x.slice_del(),x.ket=x.cursor,x.eq_s_b(2,"ic")&&(x.bra=x.cursor,m()&&x.slice_del());break;case 3:if(!m())return!1;x.slice_from("log");break;case 4:if(!m())return!1;x.slice_from("u");break;case 5:if(!m())return!1;x.slice_from("ente");break;case 6:if(!w())return!1;x.slice_del();break;case 7:if(!l())return!1;x.slice_del(),x.ket=x.cursor,e=x.find_among_b(P,4),e&&(x.bra=x.cursor,m()&&(x.slice_del(),1==e&&(x.ket=x.cursor,x.eq_s_b(2,"at")&&(x.bra=x.cursor,m()&&x.slice_del()))));break;case 8:if(!m())return!1;x.slice_del(),x.ket=x.cursor,e=x.find_among_b(F,3),e&&(x.bra=x.cursor,1==e&&m()&&x.slice_del());break;case 9:if(!m())return!1;x.slice_del(),x.ket=x.cursor,x.eq_s_b(2,"at")&&(x.bra=x.cursor,m()&&(x.slice_del(),x.ket=x.cursor,x.eq_s_b(2,"ic")&&(x.bra=x.cursor,m()&&x.slice_del())))}return!0}function b(){var e,r;x.cursor>=k&&(r=x.limit_backward,x.limit_backward=k,x.ket=x.cursor,e=x.find_among_b(W,87),e&&(x.bra=x.cursor,1==e&&x.slice_del()),x.limit_backward=r)}function d(){var e=x.limit-x.cursor;if(x.ket=x.cursor,x.in_grouping_b(y,97,242)&&(x.bra=x.cursor,w()&&(x.slice_del(),x.ket=x.cursor,x.eq_s_b(1,"i")&&(x.bra=x.cursor,w()))))return void x.slice_del();x.cursor=x.limit-e}function _(){d(),x.ket=x.cursor,x.eq_s_b(1,"h")&&(x.bra=x.cursor,x.in_grouping_b(U,99,103)&&w()&&x.slice_del())}var g,p,k,h=[new r("",-1,7),new r("qu",0,6),new r("á",0,1),new r("é",0,2),new r("í",0,3),new r("ó",0,4),new r("ú",0,5)],q=[new r("",-1,3),new r("I",0,1),new r("U",0,2)],C=[new r("la",-1,-1),new r("cela",0,-1),new r("gliela",0,-1),new r("mela",0,-1),new r("tela",0,-1),new r("vela",0,-1),new r("le",-1,-1),new r("cele",6,-1),new r("gliele",6,-1),new r("mele",6,-1),new r("tele",6,-1),new r("vele",6,-1),new r("ne",-1,-1),new r("cene",12,-1),new r("gliene",12,-1),new r("mene",12,-1),new r("sene",12,-1),new r("tene",12,-1),new r("vene",12,-1),new r("ci",-1,-1),new r("li",-1,-1),new r("celi",20,-1),new r("glieli",20,-1),new r("meli",20,-1),new r("teli",20,-1),new r("veli",20,-1),new r("gli",20,-1),new r("mi",-1,-1),new r("si",-1,-1),new r("ti",-1,-1),new r("vi",-1,-1),new r("lo",-1,-1),new r("celo",31,-1),new r("glielo",31,-1),new r("melo",31,-1),new r("telo",31,-1),new r("velo",31,-1)],z=[new r("ando",-1,1),new r("endo",-1,1),new r("ar",-1,2),new r("er",-1,2),new r("ir",-1,2)],P=[new r("ic",-1,-1),new r("abil",-1,-1),new r("os",-1,-1),new r("iv",-1,1)],F=[new r("ic",-1,1),new r("abil",-1,1),new r("iv",-1,1)],S=[new r("ica",-1,1),new r("logia",-1,3),new r("osa",-1,1),new r("ista",-1,1),new r("iva",-1,9),new r("anza",-1,1),new r("enza",-1,5),new r("ice",-1,1),new r("atrice",7,1),new r("iche",-1,1),new r("logie",-1,3),new r("abile",-1,1),new r("ibile",-1,1),new r("usione",-1,4),new r("azione",-1,2),new r("uzione",-1,4),new r("atore",-1,2),new r("ose",-1,1),new r("ante",-1,1),new r("mente",-1,1),new r("amente",19,7),new r("iste",-1,1),new r("ive",-1,9),new r("anze",-1,1),new r("enze",-1,5),new r("ici",-1,1),new r("atrici",25,1),new r("ichi",-1,1),new r("abili",-1,1),new r("ibili",-1,1),new r("ismi",-1,1),new r("usioni",-1,4),new r("azioni",-1,2),new r("uzioni",-1,4),new r("atori",-1,2),new r("osi",-1,1),new r("anti",-1,1),new r("amenti",-1,6),new r("imenti",-1,6),new r("isti",-1,1),new r("ivi",-1,9),new r("ico",-1,1),new r("ismo",-1,1),new r("oso",-1,1),new r("amento",-1,6),new r("imento",-1,6),new r("ivo",-1,9),new r("ità",-1,8),new r("istà",-1,1),new r("istè",-1,1),new r("istì",-1,1)],W=[new r("isca",-1,1),new r("enda",-1,1),new r("ata",-1,1),new r("ita",-1,1),new r("uta",-1,1),new r("ava",-1,1),new r("eva",-1,1),new r("iva",-1,1),new r("erebbe",-1,1),new r("irebbe",-1,1),new r("isce",-1,1),new r("ende",-1,1),new r("are",-1,1),new r("ere",-1,1),new r("ire",-1,1),new r("asse",-1,1),new r("ate",-1,1),new r("avate",16,1),new r("evate",16,1),new r("ivate",16,1),new r("ete",-1,1),new r("erete",20,1),new r("irete",20,1),new r("ite",-1,1),new r("ereste",-1,1),new r("ireste",-1,1),new r("ute",-1,1),new r("erai",-1,1),new r("irai",-1,1),new r("isci",-1,1),new r("endi",-1,1),new r("erei",-1,1),new r("irei",-1,1),new r("assi",-1,1),new r("ati",-1,1),new r("iti",-1,1),new r("eresti",-1,1),new r("iresti",-1,1),new r("uti",-1,1),new r("avi",-1,1),new r("evi",-1,1),new r("ivi",-1,1),new r("isco",-1,1),new r("ando",-1,1),new r("endo",-1,1),new r("Yamo",-1,1),new r("iamo",-1,1),new r("avamo",-1,1),new r("evamo",-1,1),new r("ivamo",-1,1),new r("eremo",-1,1),new r("iremo",-1,1),new r("assimo",-1,1),new r("ammo",-1,1),new r("emmo",-1,1),new r("eremmo",54,1),new r("iremmo",54,1),new r("immo",-1,1),new r("ano",-1,1),new r("iscano",58,1),new r("avano",58,1),new r("evano",58,1),new r("ivano",58,1),new r("eranno",-1,1),new r("iranno",-1,1),new r("ono",-1,1),new r("iscono",65,1),new r("arono",65,1),new r("erono",65,1),new r("irono",65,1),new r("erebbero",-1,1),new r("irebbero",-1,1),new r("assero",-1,1),new r("essero",-1,1),new r("issero",-1,1),new r("ato",-1,1),new r("ito",-1,1),new r("uto",-1,1),new r("avo",-1,1),new r("evo",-1,1),new r("ivo",-1,1),new r("ar",-1,1),new r("ir",-1,1),new r("erà",-1,1),new r("irà",-1,1),new r("erò",-1,1),new r("irò",-1,1)],L=[17,65,16,0,0,0,0,0,0,0,0,0,0,0,0,128,128,8,2,1],y=[17,65,0,0,0,0,0,0,0,0,0,0,0,0,0,128,128,8,2],U=[17],x=new n;this.setCurrent=function(e){x.setCurrent(e)},this.getCurrent=function(){return x.getCurrent()},this.stem=function(){var e=x.cursor;return i(),x.cursor=e,u(),x.limit_backward=e,x.cursor=x.limit,f(),x.cursor=x.limit,v()||(x.cursor=x.limit,b()),x.cursor=x.limit,_(),x.cursor=x.limit_backward,c(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return i.setCurrent(e),i.stem(),i.getCurrent()}):(i.setCurrent(e),i.stem(),i.getCurrent())}}(),e.Pipeline.registerFunction(e.it.stemmer,"stemmer-it"),e.it.stopWordFilter=e.generateStopWordFilter("a abbia abbiamo abbiano abbiate ad agl agli ai al all alla alle allo anche avemmo avendo avesse avessero avessi avessimo aveste avesti avete aveva avevamo avevano avevate avevi avevo avrai avranno avrebbe avrebbero avrei avremmo avremo avreste avresti avrete avrà avrò avuta avute avuti avuto c che chi ci coi col come con contro cui da dagl dagli dai dal dall dalla dalle dallo degl degli dei del dell della delle dello di dov dove e ebbe ebbero ebbi ed era erano eravamo eravate eri ero essendo faccia facciamo facciano facciate faccio facemmo facendo facesse facessero facessi facessimo faceste facesti faceva facevamo facevano facevate facevi facevo fai fanno farai faranno farebbe farebbero farei faremmo faremo fareste faresti farete farà farò fece fecero feci fosse fossero fossi fossimo foste fosti fu fui fummo furono gli ha hai hanno ho i il in io l la le lei li lo loro lui ma mi mia mie miei mio ne negl negli nei nel nell nella nelle nello noi non nostra nostre nostri nostro o per perché più quale quanta quante quanti quanto quella quelle quelli quello questa queste questi questo sarai saranno sarebbe sarebbero sarei saremmo saremo sareste saresti sarete sarà sarò se sei si sia siamo siano siate siete sono sta stai stando stanno starai staranno starebbe starebbero starei staremmo staremo stareste staresti starete starà starò stava stavamo stavano stavate stavi stavo stemmo stesse stessero stessi stessimo steste stesti stette stettero stetti stia stiamo stiano stiate sto su sua sue sugl sugli sui sul sull sulla sulle sullo suo suoi ti tra tu tua tue tuo tuoi tutti tutto un una uno vi voi vostra vostre vostri vostro è".split(" ")),e.Pipeline.registerFunction(e.it.stopWordFilter,"stopWordFilter-it")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.ja.min.js b/assets/javascripts/lunr/min/lunr.ja.min.js new file mode 100644 index 00000000..5f254ebe --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.ja.min.js @@ -0,0 +1 @@ +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");var r="2"==e.version[0];e.ja=function(){this.pipeline.reset(),this.pipeline.add(e.ja.trimmer,e.ja.stopWordFilter,e.ja.stemmer),r?this.tokenizer=e.ja.tokenizer:(e.tokenizer&&(e.tokenizer=e.ja.tokenizer),this.tokenizerFn&&(this.tokenizerFn=e.ja.tokenizer))};var t=new e.TinySegmenter;e.ja.tokenizer=function(i){var n,o,s,p,a,u,m,l,c,f;if(!arguments.length||null==i||void 0==i)return[];if(Array.isArray(i))return i.map(function(t){return r?new e.Token(t.toLowerCase()):t.toLowerCase()});for(o=i.toString().toLowerCase().replace(/^\s+/,""),n=o.length-1;n>=0;n--)if(/\S/.test(o.charAt(n))){o=o.substring(0,n+1);break}for(a=[],s=o.length,c=0,l=0;c<=s;c++)if(u=o.charAt(c),m=c-l,u.match(/\s/)||c==s){if(m>0)for(p=t.segment(o.slice(l,c)).filter(function(e){return!!e}),f=l,n=0;n=C.limit)break;C.cursor++;continue}break}for(C.cursor=o,C.bra=o,C.eq_s(1,"y")?(C.ket=C.cursor,C.slice_from("Y")):C.cursor=o;;)if(e=C.cursor,C.in_grouping(q,97,232)){if(i=C.cursor,C.bra=i,C.eq_s(1,"i"))C.ket=C.cursor,C.in_grouping(q,97,232)&&(C.slice_from("I"),C.cursor=e);else if(C.cursor=i,C.eq_s(1,"y"))C.ket=C.cursor,C.slice_from("Y"),C.cursor=e;else if(n(e))break}else if(n(e))break}function n(r){return C.cursor=r,r>=C.limit||(C.cursor++,!1)}function o(){_=C.limit,d=_,t()||(_=C.cursor,_<3&&(_=3),t()||(d=C.cursor))}function t(){for(;!C.in_grouping(q,97,232);){if(C.cursor>=C.limit)return!0;C.cursor++}for(;!C.out_grouping(q,97,232);){if(C.cursor>=C.limit)return!0;C.cursor++}return!1}function s(){for(var r;;)if(C.bra=C.cursor,r=C.find_among(p,3))switch(C.ket=C.cursor,r){case 1:C.slice_from("y");break;case 2:C.slice_from("i");break;case 3:if(C.cursor>=C.limit)return;C.cursor++}}function u(){return _<=C.cursor}function c(){return d<=C.cursor}function a(){var r=C.limit-C.cursor;C.find_among_b(g,3)&&(C.cursor=C.limit-r,C.ket=C.cursor,C.cursor>C.limit_backward&&(C.cursor--,C.bra=C.cursor,C.slice_del()))}function l(){var r;w=!1,C.ket=C.cursor,C.eq_s_b(1,"e")&&(C.bra=C.cursor,u()&&(r=C.limit-C.cursor,C.out_grouping_b(q,97,232)&&(C.cursor=C.limit-r,C.slice_del(),w=!0,a())))}function m(){var r;u()&&(r=C.limit-C.cursor,C.out_grouping_b(q,97,232)&&(C.cursor=C.limit-r,C.eq_s_b(3,"gem")||(C.cursor=C.limit-r,C.slice_del(),a())))}function f(){var r,e,i,n,o,t,s=C.limit-C.cursor;if(C.ket=C.cursor,r=C.find_among_b(h,5))switch(C.bra=C.cursor,r){case 1:u()&&C.slice_from("heid");break;case 2:m();break;case 3:u()&&C.out_grouping_b(j,97,232)&&C.slice_del()}if(C.cursor=C.limit-s,l(),C.cursor=C.limit-s,C.ket=C.cursor,C.eq_s_b(4,"heid")&&(C.bra=C.cursor,c()&&(e=C.limit-C.cursor,C.eq_s_b(1,"c")||(C.cursor=C.limit-e,C.slice_del(),C.ket=C.cursor,C.eq_s_b(2,"en")&&(C.bra=C.cursor,m())))),C.cursor=C.limit-s,C.ket=C.cursor,r=C.find_among_b(k,6))switch(C.bra=C.cursor,r){case 1:if(c()){if(C.slice_del(),i=C.limit-C.cursor,C.ket=C.cursor,C.eq_s_b(2,"ig")&&(C.bra=C.cursor,c()&&(n=C.limit-C.cursor,!C.eq_s_b(1,"e")))){C.cursor=C.limit-n,C.slice_del();break}C.cursor=C.limit-i,a()}break;case 2:c()&&(o=C.limit-C.cursor,C.eq_s_b(1,"e")||(C.cursor=C.limit-o,C.slice_del()));break;case 3:c()&&(C.slice_del(),l());break;case 4:c()&&C.slice_del();break;case 5:c()&&w&&C.slice_del()}C.cursor=C.limit-s,C.out_grouping_b(z,73,232)&&(t=C.limit-C.cursor,C.find_among_b(v,4)&&C.out_grouping_b(q,97,232)&&(C.cursor=C.limit-t,C.ket=C.cursor,C.cursor>C.limit_backward&&(C.cursor--,C.bra=C.cursor,C.slice_del())))}var d,_,w,b=[new e("",-1,6),new e("á",0,1),new e("ä",0,1),new e("é",0,2),new e("ë",0,2),new e("í",0,3),new e("ï",0,3),new e("ó",0,4),new e("ö",0,4),new e("ú",0,5),new e("ü",0,5)],p=[new e("",-1,3),new e("I",0,2),new e("Y",0,1)],g=[new e("dd",-1,-1),new e("kk",-1,-1),new e("tt",-1,-1)],h=[new e("ene",-1,2),new e("se",-1,3),new e("en",-1,2),new e("heden",2,1),new e("s",-1,3)],k=[new e("end",-1,1),new e("ig",-1,2),new e("ing",-1,1),new e("lijk",-1,3),new e("baar",-1,4),new e("bar",-1,5)],v=[new e("aa",-1,-1),new e("ee",-1,-1),new e("oo",-1,-1),new e("uu",-1,-1)],q=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,128],z=[1,0,0,17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,128],j=[17,67,16,1,0,0,0,0,0,0,0,0,0,0,0,0,128],C=new i;this.setCurrent=function(r){C.setCurrent(r)},this.getCurrent=function(){return C.getCurrent()},this.stem=function(){var e=C.cursor;return r(),C.cursor=e,o(),C.limit_backward=e,C.cursor=C.limit,f(),C.cursor=C.limit_backward,s(),!0}};return function(r){return"function"==typeof r.update?r.update(function(r){return n.setCurrent(r),n.stem(),n.getCurrent()}):(n.setCurrent(r),n.stem(),n.getCurrent())}}(),r.Pipeline.registerFunction(r.nl.stemmer,"stemmer-nl"),r.nl.stopWordFilter=r.generateStopWordFilter(" aan al alles als altijd andere ben bij daar dan dat de der deze die dit doch doen door dus een eens en er ge geen geweest haar had heb hebben heeft hem het hier hij hoe hun iemand iets ik in is ja je kan kon kunnen maar me meer men met mij mijn moet na naar niet niets nog nu of om omdat onder ons ook op over reeds te tegen toch toen tot u uit uw van veel voor want waren was wat werd wezen wie wil worden wordt zal ze zelf zich zij zijn zo zonder zou".split(" ")),r.Pipeline.registerFunction(r.nl.stopWordFilter,"stopWordFilter-nl")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.no.min.js b/assets/javascripts/lunr/min/lunr.no.min.js new file mode 100644 index 00000000..92bc7e4e --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.no.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Norwegian` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.no=function(){this.pipeline.reset(),this.pipeline.add(e.no.trimmer,e.no.stopWordFilter,e.no.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.no.stemmer))},e.no.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.no.trimmer=e.trimmerSupport.generateTrimmer(e.no.wordCharacters),e.Pipeline.registerFunction(e.no.trimmer,"trimmer-no"),e.no.stemmer=function(){var r=e.stemmerSupport.Among,n=e.stemmerSupport.SnowballProgram,i=new function(){function e(){var e,r=w.cursor+3;if(a=w.limit,0<=r||r<=w.limit){for(s=r;;){if(e=w.cursor,w.in_grouping(d,97,248)){w.cursor=e;break}if(e>=w.limit)return;w.cursor=e+1}for(;!w.out_grouping(d,97,248);){if(w.cursor>=w.limit)return;w.cursor++}a=w.cursor,a=a&&(r=w.limit_backward,w.limit_backward=a,w.ket=w.cursor,e=w.find_among_b(m,29),w.limit_backward=r,e))switch(w.bra=w.cursor,e){case 1:w.slice_del();break;case 2:n=w.limit-w.cursor,w.in_grouping_b(c,98,122)?w.slice_del():(w.cursor=w.limit-n,w.eq_s_b(1,"k")&&w.out_grouping_b(d,97,248)&&w.slice_del());break;case 3:w.slice_from("er")}}function t(){var e,r=w.limit-w.cursor;w.cursor>=a&&(e=w.limit_backward,w.limit_backward=a,w.ket=w.cursor,w.find_among_b(u,2)?(w.bra=w.cursor,w.limit_backward=e,w.cursor=w.limit-r,w.cursor>w.limit_backward&&(w.cursor--,w.bra=w.cursor,w.slice_del())):w.limit_backward=e)}function o(){var e,r;w.cursor>=a&&(r=w.limit_backward,w.limit_backward=a,w.ket=w.cursor,e=w.find_among_b(l,11),e?(w.bra=w.cursor,w.limit_backward=r,1==e&&w.slice_del()):w.limit_backward=r)}var s,a,m=[new r("a",-1,1),new r("e",-1,1),new r("ede",1,1),new r("ande",1,1),new r("ende",1,1),new r("ane",1,1),new r("ene",1,1),new r("hetene",6,1),new r("erte",1,3),new r("en",-1,1),new r("heten",9,1),new r("ar",-1,1),new r("er",-1,1),new r("heter",12,1),new r("s",-1,2),new r("as",14,1),new r("es",14,1),new r("edes",16,1),new r("endes",16,1),new r("enes",16,1),new r("hetenes",19,1),new r("ens",14,1),new r("hetens",21,1),new r("ers",14,1),new r("ets",14,1),new r("et",-1,1),new r("het",25,1),new r("ert",-1,3),new r("ast",-1,1)],u=[new r("dt",-1,-1),new r("vt",-1,-1)],l=[new r("leg",-1,1),new r("eleg",0,1),new r("ig",-1,1),new r("eig",2,1),new r("lig",2,1),new r("elig",4,1),new r("els",-1,1),new r("lov",-1,1),new r("elov",7,1),new r("slov",7,1),new r("hetslov",9,1)],d=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,48,0,128],c=[119,125,149,1],w=new n;this.setCurrent=function(e){w.setCurrent(e)},this.getCurrent=function(){return w.getCurrent()},this.stem=function(){var r=w.cursor;return e(),w.limit_backward=r,w.cursor=w.limit,i(),w.cursor=w.limit,t(),w.cursor=w.limit,o(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return i.setCurrent(e),i.stem(),i.getCurrent()}):(i.setCurrent(e),i.stem(),i.getCurrent())}}(),e.Pipeline.registerFunction(e.no.stemmer,"stemmer-no"),e.no.stopWordFilter=e.generateStopWordFilter("alle at av bare begge ble blei bli blir blitt både båe da de deg dei deim deira deires dem den denne der dere deres det dette di din disse ditt du dykk dykkar då eg ein eit eitt eller elles en enn er et ett etter for fordi fra før ha hadde han hans har hennar henne hennes her hjå ho hoe honom hoss hossen hun hva hvem hver hvilke hvilken hvis hvor hvordan hvorfor i ikke ikkje ikkje ingen ingi inkje inn inni ja jeg kan kom korleis korso kun kunne kva kvar kvarhelst kven kvi kvifor man mange me med medan meg meget mellom men mi min mine mitt mot mykje ned no noe noen noka noko nokon nokor nokre nå når og også om opp oss over på samme seg selv si si sia sidan siden sin sine sitt sjøl skal skulle slik so som som somme somt så sånn til um upp ut uten var vart varte ved vere verte vi vil ville vore vors vort vår være være vært å".split(" ")),e.Pipeline.registerFunction(e.no.stopWordFilter,"stopWordFilter-no")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.pt.min.js b/assets/javascripts/lunr/min/lunr.pt.min.js new file mode 100644 index 00000000..6c16996d --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.pt.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Portuguese` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.pt=function(){this.pipeline.reset(),this.pipeline.add(e.pt.trimmer,e.pt.stopWordFilter,e.pt.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.pt.stemmer))},e.pt.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.pt.trimmer=e.trimmerSupport.generateTrimmer(e.pt.wordCharacters),e.Pipeline.registerFunction(e.pt.trimmer,"trimmer-pt"),e.pt.stemmer=function(){var r=e.stemmerSupport.Among,s=e.stemmerSupport.SnowballProgram,n=new function(){function e(){for(var e;;){if(z.bra=z.cursor,e=z.find_among(k,3))switch(z.ket=z.cursor,e){case 1:z.slice_from("a~");continue;case 2:z.slice_from("o~");continue;case 3:if(z.cursor>=z.limit)break;z.cursor++;continue}break}}function n(){if(z.out_grouping(y,97,250)){for(;!z.in_grouping(y,97,250);){if(z.cursor>=z.limit)return!0;z.cursor++}return!1}return!0}function i(){if(z.in_grouping(y,97,250))for(;!z.out_grouping(y,97,250);){if(z.cursor>=z.limit)return!1;z.cursor++}return g=z.cursor,!0}function o(){var e,r,s=z.cursor;if(z.in_grouping(y,97,250))if(e=z.cursor,n()){if(z.cursor=e,i())return}else g=z.cursor;if(z.cursor=s,z.out_grouping(y,97,250)){if(r=z.cursor,n()){if(z.cursor=r,!z.in_grouping(y,97,250)||z.cursor>=z.limit)return;z.cursor++}g=z.cursor}}function t(){for(;!z.in_grouping(y,97,250);){if(z.cursor>=z.limit)return!1;z.cursor++}for(;!z.out_grouping(y,97,250);){if(z.cursor>=z.limit)return!1;z.cursor++}return!0}function a(){var e=z.cursor;g=z.limit,b=g,h=g,o(),z.cursor=e,t()&&(b=z.cursor,t()&&(h=z.cursor))}function u(){for(var e;;){if(z.bra=z.cursor,e=z.find_among(q,3))switch(z.ket=z.cursor,e){case 1:z.slice_from("ã");continue;case 2:z.slice_from("õ");continue;case 3:if(z.cursor>=z.limit)break;z.cursor++;continue}break}}function w(){return g<=z.cursor}function m(){return b<=z.cursor}function c(){return h<=z.cursor}function l(){var e;if(z.ket=z.cursor,!(e=z.find_among_b(F,45)))return!1;switch(z.bra=z.cursor,e){case 1:if(!c())return!1;z.slice_del();break;case 2:if(!c())return!1;z.slice_from("log");break;case 3:if(!c())return!1;z.slice_from("u");break;case 4:if(!c())return!1;z.slice_from("ente");break;case 5:if(!m())return!1;z.slice_del(),z.ket=z.cursor,e=z.find_among_b(j,4),e&&(z.bra=z.cursor,c()&&(z.slice_del(),1==e&&(z.ket=z.cursor,z.eq_s_b(2,"at")&&(z.bra=z.cursor,c()&&z.slice_del()))));break;case 6:if(!c())return!1;z.slice_del(),z.ket=z.cursor,e=z.find_among_b(C,3),e&&(z.bra=z.cursor,1==e&&c()&&z.slice_del());break;case 7:if(!c())return!1;z.slice_del(),z.ket=z.cursor,e=z.find_among_b(P,3),e&&(z.bra=z.cursor,1==e&&c()&&z.slice_del());break;case 8:if(!c())return!1;z.slice_del(),z.ket=z.cursor,z.eq_s_b(2,"at")&&(z.bra=z.cursor,c()&&z.slice_del());break;case 9:if(!w()||!z.eq_s_b(1,"e"))return!1;z.slice_from("ir")}return!0}function f(){var e,r;if(z.cursor>=g){if(r=z.limit_backward,z.limit_backward=g,z.ket=z.cursor,e=z.find_among_b(S,120))return z.bra=z.cursor,1==e&&z.slice_del(),z.limit_backward=r,!0;z.limit_backward=r}return!1}function d(){var e;z.ket=z.cursor,(e=z.find_among_b(W,7))&&(z.bra=z.cursor,1==e&&w()&&z.slice_del())}function v(e,r){if(z.eq_s_b(1,e)){z.bra=z.cursor;var s=z.limit-z.cursor;if(z.eq_s_b(1,r))return z.cursor=z.limit-s,w()&&z.slice_del(),!1}return!0}function p(){var e;if(z.ket=z.cursor,e=z.find_among_b(L,4))switch(z.bra=z.cursor,e){case 1:w()&&(z.slice_del(),z.ket=z.cursor,z.limit-z.cursor,v("u","g")&&v("i","c"));break;case 2:z.slice_from("c")}}function _(){if(!l()&&(z.cursor=z.limit,!f()))return z.cursor=z.limit,void d();z.cursor=z.limit,z.ket=z.cursor,z.eq_s_b(1,"i")&&(z.bra=z.cursor,z.eq_s_b(1,"c")&&(z.cursor=z.limit,w()&&z.slice_del()))}var h,b,g,k=[new r("",-1,3),new r("ã",0,1),new r("õ",0,2)],q=[new r("",-1,3),new r("a~",0,1),new r("o~",0,2)],j=[new r("ic",-1,-1),new r("ad",-1,-1),new r("os",-1,-1),new r("iv",-1,1)],C=[new r("ante",-1,1),new r("avel",-1,1),new r("ível",-1,1)],P=[new r("ic",-1,1),new r("abil",-1,1),new r("iv",-1,1)],F=[new r("ica",-1,1),new r("ância",-1,1),new r("ência",-1,4),new r("ira",-1,9),new r("adora",-1,1),new r("osa",-1,1),new r("ista",-1,1),new r("iva",-1,8),new r("eza",-1,1),new r("logía",-1,2),new r("idade",-1,7),new r("ante",-1,1),new r("mente",-1,6),new r("amente",12,5),new r("ável",-1,1),new r("ível",-1,1),new r("ución",-1,3),new r("ico",-1,1),new r("ismo",-1,1),new r("oso",-1,1),new r("amento",-1,1),new r("imento",-1,1),new r("ivo",-1,8),new r("aça~o",-1,1),new r("ador",-1,1),new r("icas",-1,1),new r("ências",-1,4),new r("iras",-1,9),new r("adoras",-1,1),new r("osas",-1,1),new r("istas",-1,1),new r("ivas",-1,8),new r("ezas",-1,1),new r("logías",-1,2),new r("idades",-1,7),new r("uciones",-1,3),new r("adores",-1,1),new r("antes",-1,1),new r("aço~es",-1,1),new r("icos",-1,1),new r("ismos",-1,1),new r("osos",-1,1),new r("amentos",-1,1),new r("imentos",-1,1),new r("ivos",-1,8)],S=[new r("ada",-1,1),new r("ida",-1,1),new r("ia",-1,1),new r("aria",2,1),new r("eria",2,1),new r("iria",2,1),new r("ara",-1,1),new r("era",-1,1),new r("ira",-1,1),new r("ava",-1,1),new r("asse",-1,1),new r("esse",-1,1),new r("isse",-1,1),new r("aste",-1,1),new r("este",-1,1),new r("iste",-1,1),new r("ei",-1,1),new r("arei",16,1),new r("erei",16,1),new r("irei",16,1),new r("am",-1,1),new r("iam",20,1),new r("ariam",21,1),new r("eriam",21,1),new r("iriam",21,1),new r("aram",20,1),new r("eram",20,1),new r("iram",20,1),new r("avam",20,1),new r("em",-1,1),new r("arem",29,1),new r("erem",29,1),new r("irem",29,1),new r("assem",29,1),new r("essem",29,1),new r("issem",29,1),new r("ado",-1,1),new r("ido",-1,1),new r("ando",-1,1),new r("endo",-1,1),new r("indo",-1,1),new r("ara~o",-1,1),new r("era~o",-1,1),new r("ira~o",-1,1),new r("ar",-1,1),new r("er",-1,1),new r("ir",-1,1),new r("as",-1,1),new r("adas",47,1),new r("idas",47,1),new r("ias",47,1),new r("arias",50,1),new r("erias",50,1),new r("irias",50,1),new r("aras",47,1),new r("eras",47,1),new r("iras",47,1),new r("avas",47,1),new r("es",-1,1),new r("ardes",58,1),new r("erdes",58,1),new r("irdes",58,1),new r("ares",58,1),new r("eres",58,1),new r("ires",58,1),new r("asses",58,1),new r("esses",58,1),new r("isses",58,1),new r("astes",58,1),new r("estes",58,1),new r("istes",58,1),new r("is",-1,1),new r("ais",71,1),new r("eis",71,1),new r("areis",73,1),new r("ereis",73,1),new r("ireis",73,1),new r("áreis",73,1),new r("éreis",73,1),new r("íreis",73,1),new r("ásseis",73,1),new r("ésseis",73,1),new r("ísseis",73,1),new r("áveis",73,1),new r("íeis",73,1),new r("aríeis",84,1),new r("eríeis",84,1),new r("iríeis",84,1),new r("ados",-1,1),new r("idos",-1,1),new r("amos",-1,1),new r("áramos",90,1),new r("éramos",90,1),new r("íramos",90,1),new r("ávamos",90,1),new r("íamos",90,1),new r("aríamos",95,1),new r("eríamos",95,1),new r("iríamos",95,1),new r("emos",-1,1),new r("aremos",99,1),new r("eremos",99,1),new r("iremos",99,1),new r("ássemos",99,1),new r("êssemos",99,1),new r("íssemos",99,1),new r("imos",-1,1),new r("armos",-1,1),new r("ermos",-1,1),new r("irmos",-1,1),new r("ámos",-1,1),new r("arás",-1,1),new r("erás",-1,1),new r("irás",-1,1),new r("eu",-1,1),new r("iu",-1,1),new r("ou",-1,1),new r("ará",-1,1),new r("erá",-1,1),new r("irá",-1,1)],W=[new r("a",-1,1),new r("i",-1,1),new r("o",-1,1),new r("os",-1,1),new r("á",-1,1),new r("í",-1,1),new r("ó",-1,1)],L=[new r("e",-1,1),new r("ç",-1,2),new r("é",-1,1),new r("ê",-1,1)],y=[17,65,16,0,0,0,0,0,0,0,0,0,0,0,0,0,3,19,12,2],z=new s;this.setCurrent=function(e){z.setCurrent(e)},this.getCurrent=function(){return z.getCurrent()},this.stem=function(){var r=z.cursor;return e(),z.cursor=r,a(),z.limit_backward=r,z.cursor=z.limit,_(),z.cursor=z.limit,p(),z.cursor=z.limit_backward,u(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return n.setCurrent(e),n.stem(),n.getCurrent()}):(n.setCurrent(e),n.stem(),n.getCurrent())}}(),e.Pipeline.registerFunction(e.pt.stemmer,"stemmer-pt"),e.pt.stopWordFilter=e.generateStopWordFilter("a ao aos aquela aquelas aquele aqueles aquilo as até com como da das de dela delas dele deles depois do dos e ela elas ele eles em entre era eram essa essas esse esses esta estamos estas estava estavam este esteja estejam estejamos estes esteve estive estivemos estiver estivera estiveram estiverem estivermos estivesse estivessem estivéramos estivéssemos estou está estávamos estão eu foi fomos for fora foram forem formos fosse fossem fui fôramos fôssemos haja hajam hajamos havemos hei houve houvemos houver houvera houveram houverei houverem houveremos houveria houveriam houvermos houverá houverão houveríamos houvesse houvessem houvéramos houvéssemos há hão isso isto já lhe lhes mais mas me mesmo meu meus minha minhas muito na nas nem no nos nossa nossas nosso nossos num numa não nós o os ou para pela pelas pelo pelos por qual quando que quem se seja sejam sejamos sem serei seremos seria seriam será serão seríamos seu seus somos sou sua suas são só também te tem temos tenha tenham tenhamos tenho terei teremos teria teriam terá terão teríamos teu teus teve tinha tinham tive tivemos tiver tivera tiveram tiverem tivermos tivesse tivessem tivéramos tivéssemos tu tua tuas tém tínhamos um uma você vocês vos à às éramos".split(" ")),e.Pipeline.registerFunction(e.pt.stopWordFilter,"stopWordFilter-pt")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.ro.min.js b/assets/javascripts/lunr/min/lunr.ro.min.js new file mode 100644 index 00000000..72771401 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.ro.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Romanian` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,i){"function"==typeof define&&define.amd?define(i):"object"==typeof exports?module.exports=i():i()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.ro=function(){this.pipeline.reset(),this.pipeline.add(e.ro.trimmer,e.ro.stopWordFilter,e.ro.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.ro.stemmer))},e.ro.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.ro.trimmer=e.trimmerSupport.generateTrimmer(e.ro.wordCharacters),e.Pipeline.registerFunction(e.ro.trimmer,"trimmer-ro"),e.ro.stemmer=function(){var i=e.stemmerSupport.Among,r=e.stemmerSupport.SnowballProgram,n=new function(){function e(e,i){L.eq_s(1,e)&&(L.ket=L.cursor,L.in_grouping(W,97,259)&&L.slice_from(i))}function n(){for(var i,r;;){if(i=L.cursor,L.in_grouping(W,97,259)&&(r=L.cursor,L.bra=r,e("u","U"),L.cursor=r,e("i","I")),L.cursor=i,L.cursor>=L.limit)break;L.cursor++}}function t(){if(L.out_grouping(W,97,259)){for(;!L.in_grouping(W,97,259);){if(L.cursor>=L.limit)return!0;L.cursor++}return!1}return!0}function a(){if(L.in_grouping(W,97,259))for(;!L.out_grouping(W,97,259);){if(L.cursor>=L.limit)return!0;L.cursor++}return!1}function o(){var e,i,r=L.cursor;if(L.in_grouping(W,97,259)){if(e=L.cursor,!t())return void(h=L.cursor);if(L.cursor=e,!a())return void(h=L.cursor)}L.cursor=r,L.out_grouping(W,97,259)&&(i=L.cursor,t()&&(L.cursor=i,L.in_grouping(W,97,259)&&L.cursor=L.limit)return!1;L.cursor++}for(;!L.out_grouping(W,97,259);){if(L.cursor>=L.limit)return!1;L.cursor++}return!0}function c(){var e=L.cursor;h=L.limit,k=h,g=h,o(),L.cursor=e,u()&&(k=L.cursor,u()&&(g=L.cursor))}function s(){for(var e;;){if(L.bra=L.cursor,e=L.find_among(z,3))switch(L.ket=L.cursor,e){case 1:L.slice_from("i");continue;case 2:L.slice_from("u");continue;case 3:if(L.cursor>=L.limit)break;L.cursor++;continue}break}}function w(){return h<=L.cursor}function m(){return k<=L.cursor}function l(){return g<=L.cursor}function f(){var e,i;if(L.ket=L.cursor,(e=L.find_among_b(C,16))&&(L.bra=L.cursor,m()))switch(e){case 1:L.slice_del();break;case 2:L.slice_from("a");break;case 3:L.slice_from("e");break;case 4:L.slice_from("i");break;case 5:i=L.limit-L.cursor,L.eq_s_b(2,"ab")||(L.cursor=L.limit-i,L.slice_from("i"));break;case 6:L.slice_from("at");break;case 7:L.slice_from("aţi")}}function p(){var e,i=L.limit-L.cursor;if(L.ket=L.cursor,(e=L.find_among_b(P,46))&&(L.bra=L.cursor,m())){switch(e){case 1:L.slice_from("abil");break;case 2:L.slice_from("ibil");break;case 3:L.slice_from("iv");break;case 4:L.slice_from("ic");break;case 5:L.slice_from("at");break;case 6:L.slice_from("it")}return _=!0,L.cursor=L.limit-i,!0}return!1}function d(){var e,i;for(_=!1;;)if(i=L.limit-L.cursor,!p()){L.cursor=L.limit-i;break}if(L.ket=L.cursor,(e=L.find_among_b(F,62))&&(L.bra=L.cursor,l())){switch(e){case 1:L.slice_del();break;case 2:L.eq_s_b(1,"ţ")&&(L.bra=L.cursor,L.slice_from("t"));break;case 3:L.slice_from("ist")}_=!0}}function b(){var e,i,r;if(L.cursor>=h){if(i=L.limit_backward,L.limit_backward=h,L.ket=L.cursor,e=L.find_among_b(q,94))switch(L.bra=L.cursor,e){case 1:if(r=L.limit-L.cursor,!L.out_grouping_b(W,97,259)&&(L.cursor=L.limit-r,!L.eq_s_b(1,"u")))break;case 2:L.slice_del()}L.limit_backward=i}}function v(){var e;L.ket=L.cursor,(e=L.find_among_b(S,5))&&(L.bra=L.cursor,w()&&1==e&&L.slice_del())}var _,g,k,h,z=[new i("",-1,3),new i("I",0,1),new i("U",0,2)],C=[new i("ea",-1,3),new i("aţia",-1,7),new i("aua",-1,2),new i("iua",-1,4),new i("aţie",-1,7),new i("ele",-1,3),new i("ile",-1,5),new i("iile",6,4),new i("iei",-1,4),new i("atei",-1,6),new i("ii",-1,4),new i("ului",-1,1),new i("ul",-1,1),new i("elor",-1,3),new i("ilor",-1,4),new i("iilor",14,4)],P=[new i("icala",-1,4),new i("iciva",-1,4),new i("ativa",-1,5),new i("itiva",-1,6),new i("icale",-1,4),new i("aţiune",-1,5),new i("iţiune",-1,6),new i("atoare",-1,5),new i("itoare",-1,6),new i("ătoare",-1,5),new i("icitate",-1,4),new i("abilitate",-1,1),new i("ibilitate",-1,2),new i("ivitate",-1,3),new i("icive",-1,4),new i("ative",-1,5),new i("itive",-1,6),new i("icali",-1,4),new i("atori",-1,5),new i("icatori",18,4),new i("itori",-1,6),new i("ători",-1,5),new i("icitati",-1,4),new i("abilitati",-1,1),new i("ivitati",-1,3),new i("icivi",-1,4),new i("ativi",-1,5),new i("itivi",-1,6),new i("icităi",-1,4),new i("abilităi",-1,1),new i("ivităi",-1,3),new i("icităţi",-1,4),new i("abilităţi",-1,1),new i("ivităţi",-1,3),new i("ical",-1,4),new i("ator",-1,5),new i("icator",35,4),new i("itor",-1,6),new i("ător",-1,5),new i("iciv",-1,4),new i("ativ",-1,5),new i("itiv",-1,6),new i("icală",-1,4),new i("icivă",-1,4),new i("ativă",-1,5),new i("itivă",-1,6)],F=[new i("ica",-1,1),new i("abila",-1,1),new i("ibila",-1,1),new i("oasa",-1,1),new i("ata",-1,1),new i("ita",-1,1),new i("anta",-1,1),new i("ista",-1,3),new i("uta",-1,1),new i("iva",-1,1),new i("ic",-1,1),new i("ice",-1,1),new i("abile",-1,1),new i("ibile",-1,1),new i("isme",-1,3),new i("iune",-1,2),new i("oase",-1,1),new i("ate",-1,1),new i("itate",17,1),new i("ite",-1,1),new i("ante",-1,1),new i("iste",-1,3),new i("ute",-1,1),new i("ive",-1,1),new i("ici",-1,1),new i("abili",-1,1),new i("ibili",-1,1),new i("iuni",-1,2),new i("atori",-1,1),new i("osi",-1,1),new i("ati",-1,1),new i("itati",30,1),new i("iti",-1,1),new i("anti",-1,1),new i("isti",-1,3),new i("uti",-1,1),new i("işti",-1,3),new i("ivi",-1,1),new i("ităi",-1,1),new i("oşi",-1,1),new i("ităţi",-1,1),new i("abil",-1,1),new i("ibil",-1,1),new i("ism",-1,3),new i("ator",-1,1),new i("os",-1,1),new i("at",-1,1),new i("it",-1,1),new i("ant",-1,1),new i("ist",-1,3),new i("ut",-1,1),new i("iv",-1,1),new i("ică",-1,1),new i("abilă",-1,1),new i("ibilă",-1,1),new i("oasă",-1,1),new i("ată",-1,1),new i("ită",-1,1),new i("antă",-1,1),new i("istă",-1,3),new i("ută",-1,1),new i("ivă",-1,1)],q=[new i("ea",-1,1),new i("ia",-1,1),new i("esc",-1,1),new i("ăsc",-1,1),new i("ind",-1,1),new i("ând",-1,1),new i("are",-1,1),new i("ere",-1,1),new i("ire",-1,1),new i("âre",-1,1),new i("se",-1,2),new i("ase",10,1),new i("sese",10,2),new i("ise",10,1),new i("use",10,1),new i("âse",10,1),new i("eşte",-1,1),new i("ăşte",-1,1),new i("eze",-1,1),new i("ai",-1,1),new i("eai",19,1),new i("iai",19,1),new i("sei",-1,2),new i("eşti",-1,1),new i("ăşti",-1,1),new i("ui",-1,1),new i("ezi",-1,1),new i("âi",-1,1),new i("aşi",-1,1),new i("seşi",-1,2),new i("aseşi",29,1),new i("seseşi",29,2),new i("iseşi",29,1),new i("useşi",29,1),new i("âseşi",29,1),new i("işi",-1,1),new i("uşi",-1,1),new i("âşi",-1,1),new i("aţi",-1,2),new i("eaţi",38,1),new i("iaţi",38,1),new i("eţi",-1,2),new i("iţi",-1,2),new i("âţi",-1,2),new i("arăţi",-1,1),new i("serăţi",-1,2),new i("aserăţi",45,1),new i("seserăţi",45,2),new i("iserăţi",45,1),new i("userăţi",45,1),new i("âserăţi",45,1),new i("irăţi",-1,1),new i("urăţi",-1,1),new i("ârăţi",-1,1),new i("am",-1,1),new i("eam",54,1),new i("iam",54,1),new i("em",-1,2),new i("asem",57,1),new i("sesem",57,2),new i("isem",57,1),new i("usem",57,1),new i("âsem",57,1),new i("im",-1,2),new i("âm",-1,2),new i("ăm",-1,2),new i("arăm",65,1),new i("serăm",65,2),new i("aserăm",67,1),new i("seserăm",67,2),new i("iserăm",67,1),new i("userăm",67,1),new i("âserăm",67,1),new i("irăm",65,1),new i("urăm",65,1),new i("ârăm",65,1),new i("au",-1,1),new i("eau",76,1),new i("iau",76,1),new i("indu",-1,1),new i("ându",-1,1),new i("ez",-1,1),new i("ească",-1,1),new i("ară",-1,1),new i("seră",-1,2),new i("aseră",84,1),new i("seseră",84,2),new i("iseră",84,1),new i("useră",84,1),new i("âseră",84,1),new i("iră",-1,1),new i("ură",-1,1),new i("âră",-1,1),new i("ează",-1,1)],S=[new i("a",-1,1),new i("e",-1,1),new i("ie",1,1),new i("i",-1,1),new i("ă",-1,1)],W=[17,65,16,0,0,0,0,0,0,0,0,0,0,0,0,0,2,32,0,0,4],L=new r;this.setCurrent=function(e){L.setCurrent(e)},this.getCurrent=function(){return L.getCurrent()},this.stem=function(){var e=L.cursor;return n(),L.cursor=e,c(),L.limit_backward=e,L.cursor=L.limit,f(),L.cursor=L.limit,d(),L.cursor=L.limit,_||(L.cursor=L.limit,b(),L.cursor=L.limit),v(),L.cursor=L.limit_backward,s(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return n.setCurrent(e),n.stem(),n.getCurrent()}):(n.setCurrent(e),n.stem(),n.getCurrent())}}(),e.Pipeline.registerFunction(e.ro.stemmer,"stemmer-ro"),e.ro.stopWordFilter=e.generateStopWordFilter("acea aceasta această aceea acei aceia acel acela acele acelea acest acesta aceste acestea aceşti aceştia acolo acord acum ai aia aibă aici al ale alea altceva altcineva am ar are asemenea asta astea astăzi asupra au avea avem aveţi azi aş aşadar aţi bine bucur bună ca care caut ce cel ceva chiar cinci cine cineva contra cu cum cumva curând curînd când cât câte câtva câţi cînd cît cîte cîtva cîţi că căci cărei căror cărui către da dacă dar datorită dată dau de deci deja deoarece departe deşi din dinaintea dintr- dintre doi doilea două drept după dă ea ei el ele eram este eu eşti face fata fi fie fiecare fii fim fiu fiţi frumos fără graţie halbă iar ieri la le li lor lui lângă lîngă mai mea mei mele mereu meu mi mie mine mult multă mulţi mulţumesc mâine mîine mă ne nevoie nici nicăieri nimeni nimeri nimic nişte noastre noastră noi noroc nostru nouă noştri nu opt ori oricare orice oricine oricum oricând oricât oricînd oricît oriunde patra patru patrulea pe pentru peste pic poate pot prea prima primul prin puţin puţina puţină până pînă rog sa sale sau se spate spre sub sunt suntem sunteţi sută sînt sîntem sînteţi să săi său ta tale te timp tine toate toată tot totuşi toţi trei treia treilea tu tăi tău un una unde undeva unei uneia unele uneori unii unor unora unu unui unuia unul vi voastre voastră voi vostru vouă voştri vreme vreo vreun vă zece zero zi zice îi îl îmi împotriva în înainte înaintea încotro încât încît între întrucât întrucît îţi ăla ălea ăsta ăstea ăştia şapte şase şi ştiu ţi ţie".split(" ")),e.Pipeline.registerFunction(e.ro.stopWordFilter,"stopWordFilter-ro")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.ru.min.js b/assets/javascripts/lunr/min/lunr.ru.min.js new file mode 100644 index 00000000..186cc485 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.ru.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Russian` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,n){"function"==typeof define&&define.amd?define(n):"object"==typeof exports?module.exports=n():n()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.ru=function(){this.pipeline.reset(),this.pipeline.add(e.ru.trimmer,e.ru.stopWordFilter,e.ru.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.ru.stemmer))},e.ru.wordCharacters="Ѐ-҄҇-ԯᴫᵸⷠ-ⷿꙀ-ꚟ︮︯",e.ru.trimmer=e.trimmerSupport.generateTrimmer(e.ru.wordCharacters),e.Pipeline.registerFunction(e.ru.trimmer,"trimmer-ru"),e.ru.stemmer=function(){var n=e.stemmerSupport.Among,r=e.stemmerSupport.SnowballProgram,t=new function(){function e(){for(;!W.in_grouping(S,1072,1103);){if(W.cursor>=W.limit)return!1;W.cursor++}return!0}function t(){for(;!W.out_grouping(S,1072,1103);){if(W.cursor>=W.limit)return!1;W.cursor++}return!0}function w(){b=W.limit,_=b,e()&&(b=W.cursor,t()&&e()&&t()&&(_=W.cursor))}function i(){return _<=W.cursor}function u(e,n){var r,t;if(W.ket=W.cursor,r=W.find_among_b(e,n)){switch(W.bra=W.cursor,r){case 1:if(t=W.limit-W.cursor,!W.eq_s_b(1,"а")&&(W.cursor=W.limit-t,!W.eq_s_b(1,"я")))return!1;case 2:W.slice_del()}return!0}return!1}function o(){return u(h,9)}function s(e,n){var r;return W.ket=W.cursor,!!(r=W.find_among_b(e,n))&&(W.bra=W.cursor,1==r&&W.slice_del(),!0)}function c(){return s(g,26)}function m(){return!!c()&&(u(C,8),!0)}function f(){return s(k,2)}function l(){return u(P,46)}function a(){s(v,36)}function p(){var e;W.ket=W.cursor,(e=W.find_among_b(F,2))&&(W.bra=W.cursor,i()&&1==e&&W.slice_del())}function d(){var e;if(W.ket=W.cursor,e=W.find_among_b(q,4))switch(W.bra=W.cursor,e){case 1:if(W.slice_del(),W.ket=W.cursor,!W.eq_s_b(1,"н"))break;W.bra=W.cursor;case 2:if(!W.eq_s_b(1,"н"))break;case 3:W.slice_del()}}var _,b,h=[new n("в",-1,1),new n("ив",0,2),new n("ыв",0,2),new n("вши",-1,1),new n("ивши",3,2),new n("ывши",3,2),new n("вшись",-1,1),new n("ившись",6,2),new n("ывшись",6,2)],g=[new n("ее",-1,1),new n("ие",-1,1),new n("ое",-1,1),new n("ые",-1,1),new n("ими",-1,1),new n("ыми",-1,1),new n("ей",-1,1),new n("ий",-1,1),new n("ой",-1,1),new n("ый",-1,1),new n("ем",-1,1),new n("им",-1,1),new n("ом",-1,1),new n("ым",-1,1),new n("его",-1,1),new n("ого",-1,1),new n("ему",-1,1),new n("ому",-1,1),new n("их",-1,1),new n("ых",-1,1),new n("ею",-1,1),new n("ою",-1,1),new n("ую",-1,1),new n("юю",-1,1),new n("ая",-1,1),new n("яя",-1,1)],C=[new n("ем",-1,1),new n("нн",-1,1),new n("вш",-1,1),new n("ивш",2,2),new n("ывш",2,2),new n("щ",-1,1),new n("ющ",5,1),new n("ующ",6,2)],k=[new n("сь",-1,1),new n("ся",-1,1)],P=[new n("ла",-1,1),new n("ила",0,2),new n("ыла",0,2),new n("на",-1,1),new n("ена",3,2),new n("ете",-1,1),new n("ите",-1,2),new n("йте",-1,1),new n("ейте",7,2),new n("уйте",7,2),new n("ли",-1,1),new n("или",10,2),new n("ыли",10,2),new n("й",-1,1),new n("ей",13,2),new n("уй",13,2),new n("л",-1,1),new n("ил",16,2),new n("ыл",16,2),new n("ем",-1,1),new n("им",-1,2),new n("ым",-1,2),new n("н",-1,1),new n("ен",22,2),new n("ло",-1,1),new n("ило",24,2),new n("ыло",24,2),new n("но",-1,1),new n("ено",27,2),new n("нно",27,1),new n("ет",-1,1),new n("ует",30,2),new n("ит",-1,2),new n("ыт",-1,2),new n("ют",-1,1),new n("уют",34,2),new n("ят",-1,2),new n("ны",-1,1),new n("ены",37,2),new n("ть",-1,1),new n("ить",39,2),new n("ыть",39,2),new n("ешь",-1,1),new n("ишь",-1,2),new n("ю",-1,2),new n("ую",44,2)],v=[new n("а",-1,1),new n("ев",-1,1),new n("ов",-1,1),new n("е",-1,1),new n("ие",3,1),new n("ье",3,1),new n("и",-1,1),new n("еи",6,1),new n("ии",6,1),new n("ами",6,1),new n("ями",6,1),new n("иями",10,1),new n("й",-1,1),new n("ей",12,1),new n("ией",13,1),new n("ий",12,1),new n("ой",12,1),new n("ам",-1,1),new n("ем",-1,1),new n("ием",18,1),new n("ом",-1,1),new n("ям",-1,1),new n("иям",21,1),new n("о",-1,1),new n("у",-1,1),new n("ах",-1,1),new n("ях",-1,1),new n("иях",26,1),new n("ы",-1,1),new n("ь",-1,1),new n("ю",-1,1),new n("ию",30,1),new n("ью",30,1),new n("я",-1,1),new n("ия",33,1),new n("ья",33,1)],F=[new n("ост",-1,1),new n("ость",-1,1)],q=[new n("ейше",-1,1),new n("н",-1,2),new n("ейш",-1,1),new n("ь",-1,3)],S=[33,65,8,232],W=new r;this.setCurrent=function(e){W.setCurrent(e)},this.getCurrent=function(){return W.getCurrent()},this.stem=function(){return w(),W.cursor=W.limit,!(W.cursor=i&&(e-=i,t[e>>3]&1<<(7&e)))return this.cursor++,!0}return!1},in_grouping_b:function(t,i,s){if(this.cursor>this.limit_backward){var e=r.charCodeAt(this.cursor-1);if(e<=s&&e>=i&&(e-=i,t[e>>3]&1<<(7&e)))return this.cursor--,!0}return!1},out_grouping:function(t,i,s){if(this.cursors||e>3]&1<<(7&e)))return this.cursor++,!0}return!1},out_grouping_b:function(t,i,s){if(this.cursor>this.limit_backward){var e=r.charCodeAt(this.cursor-1);if(e>s||e>3]&1<<(7&e)))return this.cursor--,!0}return!1},eq_s:function(t,i){if(this.limit-this.cursor>1),f=0,l=o0||e==s||c)break;c=!0}}for(;;){var _=t[s];if(o>=_.s_size){if(this.cursor=n+_.s_size,!_.method)return _.result;var b=_.method();if(this.cursor=n+_.s_size,b)return _.result}if((s=_.substring_i)<0)return 0}},find_among_b:function(t,i){for(var s=0,e=i,n=this.cursor,u=this.limit_backward,o=0,h=0,c=!1;;){for(var a=s+(e-s>>1),f=0,l=o=0;m--){if(n-l==u){f=-1;break}if(f=r.charCodeAt(n-1-l)-_.s[m])break;l++}if(f<0?(e=a,h=l):(s=a,o=l),e-s<=1){if(s>0||e==s||c)break;c=!0}}for(;;){var _=t[s];if(o>=_.s_size){if(this.cursor=n-_.s_size,!_.method)return _.result;var b=_.method();if(this.cursor=n-_.s_size,b)return _.result}if((s=_.substring_i)<0)return 0}},replace_s:function(t,i,s){var e=s.length-(i-t),n=r.substring(0,t),u=r.substring(i);return r=n+s+u,this.limit+=e,this.cursor>=i?this.cursor+=e:this.cursor>t&&(this.cursor=t),e},slice_check:function(){if(this.bra<0||this.bra>this.ket||this.ket>this.limit||this.limit>r.length)throw"faulty slice operation"},slice_from:function(r){this.slice_check(),this.replace_s(this.bra,this.ket,r)},slice_del:function(){this.slice_from("")},insert:function(r,t,i){var s=this.replace_s(r,t,i);r<=this.bra&&(this.bra+=s),r<=this.ket&&(this.ket+=s)},slice_to:function(){return this.slice_check(),r.substring(this.bra,this.ket)},eq_v_b:function(r){return this.eq_s_b(r.length,r)}}}},r.trimmerSupport={generateTrimmer:function(r){var t=new RegExp("^[^"+r+"]+"),i=new RegExp("[^"+r+"]+$");return function(r){return"function"==typeof r.update?r.update(function(r){return r.replace(t,"").replace(i,"")}):r.replace(t,"").replace(i,"")}}}}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.sv.min.js b/assets/javascripts/lunr/min/lunr.sv.min.js new file mode 100644 index 00000000..3e5eb640 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.sv.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Swedish` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.sv=function(){this.pipeline.reset(),this.pipeline.add(e.sv.trimmer,e.sv.stopWordFilter,e.sv.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(e.sv.stemmer))},e.sv.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",e.sv.trimmer=e.trimmerSupport.generateTrimmer(e.sv.wordCharacters),e.Pipeline.registerFunction(e.sv.trimmer,"trimmer-sv"),e.sv.stemmer=function(){var r=e.stemmerSupport.Among,n=e.stemmerSupport.SnowballProgram,t=new function(){function e(){var e,r=w.cursor+3;if(o=w.limit,0<=r||r<=w.limit){for(a=r;;){if(e=w.cursor,w.in_grouping(l,97,246)){w.cursor=e;break}if(w.cursor=e,w.cursor>=w.limit)return;w.cursor++}for(;!w.out_grouping(l,97,246);){if(w.cursor>=w.limit)return;w.cursor++}o=w.cursor,o=o&&(w.limit_backward=o,w.cursor=w.limit,w.ket=w.cursor,e=w.find_among_b(u,37),w.limit_backward=r,e))switch(w.bra=w.cursor,e){case 1:w.slice_del();break;case 2:w.in_grouping_b(d,98,121)&&w.slice_del()}}function i(){var e=w.limit_backward;w.cursor>=o&&(w.limit_backward=o,w.cursor=w.limit,w.find_among_b(c,7)&&(w.cursor=w.limit,w.ket=w.cursor,w.cursor>w.limit_backward&&(w.bra=--w.cursor,w.slice_del())),w.limit_backward=e)}function s(){var e,r;if(w.cursor>=o){if(r=w.limit_backward,w.limit_backward=o,w.cursor=w.limit,w.ket=w.cursor,e=w.find_among_b(m,5))switch(w.bra=w.cursor,e){case 1:w.slice_del();break;case 2:w.slice_from("lös");break;case 3:w.slice_from("full")}w.limit_backward=r}}var a,o,u=[new r("a",-1,1),new r("arna",0,1),new r("erna",0,1),new r("heterna",2,1),new r("orna",0,1),new r("ad",-1,1),new r("e",-1,1),new r("ade",6,1),new r("ande",6,1),new r("arne",6,1),new r("are",6,1),new r("aste",6,1),new r("en",-1,1),new r("anden",12,1),new r("aren",12,1),new r("heten",12,1),new r("ern",-1,1),new r("ar",-1,1),new r("er",-1,1),new r("heter",18,1),new r("or",-1,1),new r("s",-1,2),new r("as",21,1),new r("arnas",22,1),new r("ernas",22,1),new r("ornas",22,1),new r("es",21,1),new r("ades",26,1),new r("andes",26,1),new r("ens",21,1),new r("arens",29,1),new r("hetens",29,1),new r("erns",21,1),new r("at",-1,1),new r("andet",-1,1),new r("het",-1,1),new r("ast",-1,1)],c=[new r("dd",-1,-1),new r("gd",-1,-1),new r("nn",-1,-1),new r("dt",-1,-1),new r("gt",-1,-1),new r("kt",-1,-1),new r("tt",-1,-1)],m=[new r("ig",-1,1),new r("lig",0,1),new r("els",-1,1),new r("fullt",-1,3),new r("löst",-1,2)],l=[17,65,16,1,0,0,0,0,0,0,0,0,0,0,0,0,24,0,32],d=[119,127,149],w=new n;this.setCurrent=function(e){w.setCurrent(e)},this.getCurrent=function(){return w.getCurrent()},this.stem=function(){var r=w.cursor;return e(),w.limit_backward=r,w.cursor=w.limit,t(),w.cursor=w.limit,i(),w.cursor=w.limit,s(),!0}};return function(e){return"function"==typeof e.update?e.update(function(e){return t.setCurrent(e),t.stem(),t.getCurrent()}):(t.setCurrent(e),t.stem(),t.getCurrent())}}(),e.Pipeline.registerFunction(e.sv.stemmer,"stemmer-sv"),e.sv.stopWordFilter=e.generateStopWordFilter("alla allt att av blev bli blir blivit de dem den denna deras dess dessa det detta dig din dina ditt du där då efter ej eller en er era ert ett från för ha hade han hans har henne hennes hon honom hur här i icke ingen inom inte jag ju kan kunde man med mellan men mig min mina mitt mot mycket ni nu när någon något några och om oss på samma sedan sig sin sina sitta själv skulle som så sådan sådana sådant till under upp ut utan vad var vara varför varit varje vars vart vem vi vid vilka vilkas vilken vilket vår våra vårt än är åt över".split(" ")),e.Pipeline.registerFunction(e.sv.stopWordFilter,"stopWordFilter-sv")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.th.min.js b/assets/javascripts/lunr/min/lunr.th.min.js new file mode 100644 index 00000000..dee3aac6 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.th.min.js @@ -0,0 +1 @@ +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");var r="2"==e.version[0];e.th=function(){this.pipeline.reset(),this.pipeline.add(e.th.trimmer),r?this.tokenizer=e.th.tokenizer:(e.tokenizer&&(e.tokenizer=e.th.tokenizer),this.tokenizerFn&&(this.tokenizerFn=e.th.tokenizer))},e.th.wordCharacters="[฀-๿]",e.th.trimmer=e.trimmerSupport.generateTrimmer(e.th.wordCharacters),e.Pipeline.registerFunction(e.th.trimmer,"trimmer-th");var t=e.wordcut;t.init(),e.th.tokenizer=function(i){if(!arguments.length||null==i||void 0==i)return[];if(Array.isArray(i))return i.map(function(t){return r?new e.Token(t):t});var n=i.toString().replace(/^\s+/,"");return t.cut(n).split("|")}}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.tr.min.js b/assets/javascripts/lunr/min/lunr.tr.min.js new file mode 100644 index 00000000..563f6ec1 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.tr.min.js @@ -0,0 +1,18 @@ +/*! + * Lunr languages, `Turkish` language + * https://github.com/MihaiValentin/lunr-languages + * + * Copyright 2014, Mihai Valentin + * http://www.mozilla.org/MPL/ + */ +/*! + * based on + * Snowball JavaScript Library v0.3 + * http://code.google.com/p/urim/ + * http://snowball.tartarus.org/ + * + * Copyright 2010, Oleg Mazko + * http://www.mozilla.org/MPL/ + */ + +!function(r,i){"function"==typeof define&&define.amd?define(i):"object"==typeof exports?module.exports=i():i()(r.lunr)}(this,function(){return function(r){if(void 0===r)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===r.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");r.tr=function(){this.pipeline.reset(),this.pipeline.add(r.tr.trimmer,r.tr.stopWordFilter,r.tr.stemmer),this.searchPipeline&&(this.searchPipeline.reset(),this.searchPipeline.add(r.tr.stemmer))},r.tr.wordCharacters="A-Za-zªºÀ-ÖØ-öø-ʸˠ-ˤᴀ-ᴥᴬ-ᵜᵢ-ᵥᵫ-ᵷᵹ-ᶾḀ-ỿⁱⁿₐ-ₜKÅℲⅎⅠ-ↈⱠ-ⱿꜢ-ꞇꞋ-ꞭꞰ-ꞷꟷ-ꟿꬰ-ꭚꭜ-ꭤff-stA-Za-z",r.tr.trimmer=r.trimmerSupport.generateTrimmer(r.tr.wordCharacters),r.Pipeline.registerFunction(r.tr.trimmer,"trimmer-tr"),r.tr.stemmer=function(){var i=r.stemmerSupport.Among,e=r.stemmerSupport.SnowballProgram,n=new function(){function r(r,i,e){for(;;){var n=Dr.limit-Dr.cursor;if(Dr.in_grouping_b(r,i,e)){Dr.cursor=Dr.limit-n;break}if(Dr.cursor=Dr.limit-n,Dr.cursor<=Dr.limit_backward)return!1;Dr.cursor--}return!0}function n(){var i,e;i=Dr.limit-Dr.cursor,r(Wr,97,305);for(var n=0;nDr.limit_backward&&(Dr.cursor--,e=Dr.limit-Dr.cursor,i()))?(Dr.cursor=Dr.limit-e,!0):(Dr.cursor=Dr.limit-n,r()?(Dr.cursor=Dr.limit-n,!1):(Dr.cursor=Dr.limit-n,!(Dr.cursor<=Dr.limit_backward)&&(Dr.cursor--,!!i()&&(Dr.cursor=Dr.limit-n,!0))))}function u(r){return t(r,function(){return Dr.in_grouping_b(Wr,97,305)})}function o(){return u(function(){return Dr.eq_s_b(1,"n")})}function s(){return u(function(){return Dr.eq_s_b(1,"s")})}function c(){return u(function(){return Dr.eq_s_b(1,"y")})}function l(){return t(function(){return Dr.in_grouping_b(Lr,105,305)},function(){return Dr.out_grouping_b(Wr,97,305)})}function a(){return Dr.find_among_b(ur,10)&&l()}function m(){return n()&&Dr.in_grouping_b(Lr,105,305)&&s()}function d(){return Dr.find_among_b(or,2)}function f(){return n()&&Dr.in_grouping_b(Lr,105,305)&&c()}function b(){return n()&&Dr.find_among_b(sr,4)}function w(){return n()&&Dr.find_among_b(cr,4)&&o()}function _(){return n()&&Dr.find_among_b(lr,2)&&c()}function k(){return n()&&Dr.find_among_b(ar,2)}function p(){return n()&&Dr.find_among_b(mr,4)}function g(){return n()&&Dr.find_among_b(dr,2)}function y(){return n()&&Dr.find_among_b(fr,4)}function z(){return n()&&Dr.find_among_b(br,2)}function v(){return n()&&Dr.find_among_b(wr,2)&&c()}function h(){return Dr.eq_s_b(2,"ki")}function q(){return n()&&Dr.find_among_b(_r,2)&&o()}function C(){return n()&&Dr.find_among_b(kr,4)&&c()}function P(){return n()&&Dr.find_among_b(pr,4)}function F(){return n()&&Dr.find_among_b(gr,4)&&c()}function S(){return Dr.find_among_b(yr,4)}function W(){return n()&&Dr.find_among_b(zr,2)}function L(){return n()&&Dr.find_among_b(vr,4)}function x(){return n()&&Dr.find_among_b(hr,8)}function A(){return Dr.find_among_b(qr,2)}function E(){return n()&&Dr.find_among_b(Cr,32)&&c()}function j(){return Dr.find_among_b(Pr,8)&&c()}function T(){return n()&&Dr.find_among_b(Fr,4)&&c()}function Z(){return Dr.eq_s_b(3,"ken")&&c()}function B(){var r=Dr.limit-Dr.cursor;return!(T()||(Dr.cursor=Dr.limit-r,E()||(Dr.cursor=Dr.limit-r,j()||(Dr.cursor=Dr.limit-r,Z()))))}function D(){if(A()){var r=Dr.limit-Dr.cursor;if(S()||(Dr.cursor=Dr.limit-r,W()||(Dr.cursor=Dr.limit-r,C()||(Dr.cursor=Dr.limit-r,P()||(Dr.cursor=Dr.limit-r,F()||(Dr.cursor=Dr.limit-r))))),T())return!1}return!0}function G(){if(W()){Dr.bra=Dr.cursor,Dr.slice_del();var r=Dr.limit-Dr.cursor;return Dr.ket=Dr.cursor,x()||(Dr.cursor=Dr.limit-r,E()||(Dr.cursor=Dr.limit-r,j()||(Dr.cursor=Dr.limit-r,T()||(Dr.cursor=Dr.limit-r)))),nr=!1,!1}return!0}function H(){if(!L())return!0;var r=Dr.limit-Dr.cursor;return!E()&&(Dr.cursor=Dr.limit-r,!j())}function I(){var r,i=Dr.limit-Dr.cursor;return!(S()||(Dr.cursor=Dr.limit-i,F()||(Dr.cursor=Dr.limit-i,P()||(Dr.cursor=Dr.limit-i,C()))))||(Dr.bra=Dr.cursor,Dr.slice_del(),r=Dr.limit-Dr.cursor,Dr.ket=Dr.cursor,T()||(Dr.cursor=Dr.limit-r),!1)}function J(){var r,i=Dr.limit-Dr.cursor;if(Dr.ket=Dr.cursor,nr=!0,B()&&(Dr.cursor=Dr.limit-i,D()&&(Dr.cursor=Dr.limit-i,G()&&(Dr.cursor=Dr.limit-i,H()&&(Dr.cursor=Dr.limit-i,I()))))){if(Dr.cursor=Dr.limit-i,!x())return;Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,r=Dr.limit-Dr.cursor,S()||(Dr.cursor=Dr.limit-r,W()||(Dr.cursor=Dr.limit-r,C()||(Dr.cursor=Dr.limit-r,P()||(Dr.cursor=Dr.limit-r,F()||(Dr.cursor=Dr.limit-r))))),T()||(Dr.cursor=Dr.limit-r)}Dr.bra=Dr.cursor,Dr.slice_del()}function K(){var r,i,e,n;if(Dr.ket=Dr.cursor,h()){if(r=Dr.limit-Dr.cursor,p())return Dr.bra=Dr.cursor,Dr.slice_del(),i=Dr.limit-Dr.cursor,Dr.ket=Dr.cursor,W()?(Dr.bra=Dr.cursor,Dr.slice_del(),K()):(Dr.cursor=Dr.limit-i,a()&&(Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K()))),!0;if(Dr.cursor=Dr.limit-r,w()){if(Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,e=Dr.limit-Dr.cursor,d())Dr.bra=Dr.cursor,Dr.slice_del();else{if(Dr.cursor=Dr.limit-e,Dr.ket=Dr.cursor,!a()&&(Dr.cursor=Dr.limit-e,!m()&&(Dr.cursor=Dr.limit-e,!K())))return!0;Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K())}return!0}if(Dr.cursor=Dr.limit-r,g()){if(n=Dr.limit-Dr.cursor,d())Dr.bra=Dr.cursor,Dr.slice_del();else if(Dr.cursor=Dr.limit-n,m())Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K());else if(Dr.cursor=Dr.limit-n,!K())return!1;return!0}}return!1}function M(r){if(Dr.ket=Dr.cursor,!g()&&(Dr.cursor=Dr.limit-r,!k()))return!1;var i=Dr.limit-Dr.cursor;if(d())Dr.bra=Dr.cursor,Dr.slice_del();else if(Dr.cursor=Dr.limit-i,m())Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K());else if(Dr.cursor=Dr.limit-i,!K())return!1;return!0}function N(r){if(Dr.ket=Dr.cursor,!z()&&(Dr.cursor=Dr.limit-r,!b()))return!1;var i=Dr.limit-Dr.cursor;return!(!m()&&(Dr.cursor=Dr.limit-i,!d()))&&(Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K()),!0)}function O(){var r,i=Dr.limit-Dr.cursor;return Dr.ket=Dr.cursor,!(!w()&&(Dr.cursor=Dr.limit-i,!v()))&&(Dr.bra=Dr.cursor,Dr.slice_del(),r=Dr.limit-Dr.cursor,Dr.ket=Dr.cursor,!(!W()||(Dr.bra=Dr.cursor,Dr.slice_del(),!K()))||(Dr.cursor=Dr.limit-r,Dr.ket=Dr.cursor,!(a()||(Dr.cursor=Dr.limit-r,m()||(Dr.cursor=Dr.limit-r,K())))||(Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K()),!0)))}function Q(){var r,i,e=Dr.limit-Dr.cursor;if(Dr.ket=Dr.cursor,!p()&&(Dr.cursor=Dr.limit-e,!f()&&(Dr.cursor=Dr.limit-e,!_())))return!1;if(Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,r=Dr.limit-Dr.cursor,a())Dr.bra=Dr.cursor,Dr.slice_del(),i=Dr.limit-Dr.cursor,Dr.ket=Dr.cursor,W()||(Dr.cursor=Dr.limit-i);else if(Dr.cursor=Dr.limit-r,!W())return!0;return Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,K(),!0}function R(){var r,i,e=Dr.limit-Dr.cursor;if(Dr.ket=Dr.cursor,W())return Dr.bra=Dr.cursor,Dr.slice_del(),void K();if(Dr.cursor=Dr.limit-e,Dr.ket=Dr.cursor,q())if(Dr.bra=Dr.cursor,Dr.slice_del(),r=Dr.limit-Dr.cursor,Dr.ket=Dr.cursor,d())Dr.bra=Dr.cursor,Dr.slice_del();else{if(Dr.cursor=Dr.limit-r,Dr.ket=Dr.cursor,!a()&&(Dr.cursor=Dr.limit-r,!m())){if(Dr.cursor=Dr.limit-r,Dr.ket=Dr.cursor,!W())return;if(Dr.bra=Dr.cursor,Dr.slice_del(),!K())return}Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K())}else if(Dr.cursor=Dr.limit-e,!M(e)&&(Dr.cursor=Dr.limit-e,!N(e))){if(Dr.cursor=Dr.limit-e,Dr.ket=Dr.cursor,y())return Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,i=Dr.limit-Dr.cursor,void(a()?(Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K())):(Dr.cursor=Dr.limit-i,W()?(Dr.bra=Dr.cursor,Dr.slice_del(),K()):(Dr.cursor=Dr.limit-i,K())));if(Dr.cursor=Dr.limit-e,!O()){if(Dr.cursor=Dr.limit-e,d())return Dr.bra=Dr.cursor,void Dr.slice_del();Dr.cursor=Dr.limit-e,K()||(Dr.cursor=Dr.limit-e,Q()||(Dr.cursor=Dr.limit-e,Dr.ket=Dr.cursor,(a()||(Dr.cursor=Dr.limit-e,m()))&&(Dr.bra=Dr.cursor,Dr.slice_del(),Dr.ket=Dr.cursor,W()&&(Dr.bra=Dr.cursor,Dr.slice_del(),K()))))}}}function U(){var r;if(Dr.ket=Dr.cursor,r=Dr.find_among_b(Sr,4))switch(Dr.bra=Dr.cursor,r){case 1:Dr.slice_from("p");break;case 2:Dr.slice_from("ç");break;case 3:Dr.slice_from("t");break;case 4:Dr.slice_from("k")}}function V(){for(;;){var r=Dr.limit-Dr.cursor;if(Dr.in_grouping_b(Wr,97,305)){Dr.cursor=Dr.limit-r;break}if(Dr.cursor=Dr.limit-r,Dr.cursor<=Dr.limit_backward)return!1;Dr.cursor--}return!0}function X(r,i,e){if(Dr.cursor=Dr.limit-r,V()){var n=Dr.limit-Dr.cursor;if(!Dr.eq_s_b(1,i)&&(Dr.cursor=Dr.limit-n,!Dr.eq_s_b(1,e)))return!0;Dr.cursor=Dr.limit-r;var t=Dr.cursor;return Dr.insert(Dr.cursor,Dr.cursor,e),Dr.cursor=t,!1}return!0}function Y(){var r=Dr.limit-Dr.cursor;(Dr.eq_s_b(1,"d")||(Dr.cursor=Dr.limit-r,Dr.eq_s_b(1,"g")))&&X(r,"a","ı")&&X(r,"e","i")&&X(r,"o","u")&&X(r,"ö","ü")}function $(){for(var r,i=Dr.cursor,e=2;;){for(r=Dr.cursor;!Dr.in_grouping(Wr,97,305);){if(Dr.cursor>=Dr.limit)return Dr.cursor=r,!(e>0)&&(Dr.cursor=i,!0);Dr.cursor++}e--}}function rr(r,i,e){for(;!Dr.eq_s(i,e);){if(Dr.cursor>=Dr.limit)return!0;Dr.cursor++}return(tr=i)!=Dr.limit||(Dr.cursor=r,!1)}function ir(){var r=Dr.cursor;return!rr(r,2,"ad")||(Dr.cursor=r,!rr(r,5,"soyad"))}function er(){var r=Dr.cursor;return!ir()&&(Dr.limit_backward=r,Dr.cursor=Dr.limit,Y(),Dr.cursor=Dr.limit,U(),!0)}var nr,tr,ur=[new i("m",-1,-1),new i("n",-1,-1),new i("miz",-1,-1),new i("niz",-1,-1),new i("muz",-1,-1),new i("nuz",-1,-1),new i("müz",-1,-1),new i("nüz",-1,-1),new i("mız",-1,-1),new i("nız",-1,-1)],or=[new i("leri",-1,-1),new i("ları",-1,-1)],sr=[new i("ni",-1,-1),new i("nu",-1,-1),new i("nü",-1,-1),new i("nı",-1,-1)],cr=[new i("in",-1,-1),new i("un",-1,-1),new i("ün",-1,-1),new i("ın",-1,-1)],lr=[new i("a",-1,-1),new i("e",-1,-1)],ar=[new i("na",-1,-1),new i("ne",-1,-1)],mr=[new i("da",-1,-1),new i("ta",-1,-1),new i("de",-1,-1),new i("te",-1,-1)],dr=[new i("nda",-1,-1),new i("nde",-1,-1)],fr=[new i("dan",-1,-1),new i("tan",-1,-1),new i("den",-1,-1),new i("ten",-1,-1)],br=[new i("ndan",-1,-1),new i("nden",-1,-1)],wr=[new i("la",-1,-1),new i("le",-1,-1)],_r=[new i("ca",-1,-1),new i("ce",-1,-1)],kr=[new i("im",-1,-1),new i("um",-1,-1),new i("üm",-1,-1),new i("ım",-1,-1)],pr=[new i("sin",-1,-1),new i("sun",-1,-1),new i("sün",-1,-1),new i("sın",-1,-1)],gr=[new i("iz",-1,-1),new i("uz",-1,-1),new i("üz",-1,-1),new i("ız",-1,-1)],yr=[new i("siniz",-1,-1),new i("sunuz",-1,-1),new i("sünüz",-1,-1),new i("sınız",-1,-1)],zr=[new i("lar",-1,-1),new i("ler",-1,-1)],vr=[new i("niz",-1,-1),new i("nuz",-1,-1),new i("nüz",-1,-1),new i("nız",-1,-1)],hr=[new i("dir",-1,-1),new i("tir",-1,-1),new i("dur",-1,-1),new i("tur",-1,-1),new i("dür",-1,-1),new i("tür",-1,-1),new i("dır",-1,-1),new i("tır",-1,-1)],qr=[new i("casına",-1,-1),new i("cesine",-1,-1)],Cr=[new i("di",-1,-1),new i("ti",-1,-1),new i("dik",-1,-1),new i("tik",-1,-1),new i("duk",-1,-1),new i("tuk",-1,-1),new i("dük",-1,-1),new i("tük",-1,-1),new i("dık",-1,-1),new i("tık",-1,-1),new i("dim",-1,-1),new i("tim",-1,-1),new i("dum",-1,-1),new i("tum",-1,-1),new i("düm",-1,-1),new i("tüm",-1,-1),new i("dım",-1,-1),new i("tım",-1,-1),new i("din",-1,-1),new i("tin",-1,-1),new i("dun",-1,-1),new i("tun",-1,-1),new i("dün",-1,-1),new i("tün",-1,-1),new i("dın",-1,-1),new i("tın",-1,-1),new i("du",-1,-1),new i("tu",-1,-1),new i("dü",-1,-1),new i("tü",-1,-1),new i("dı",-1,-1),new i("tı",-1,-1)],Pr=[new i("sa",-1,-1),new i("se",-1,-1),new i("sak",-1,-1),new i("sek",-1,-1),new i("sam",-1,-1),new i("sem",-1,-1),new i("san",-1,-1),new i("sen",-1,-1)],Fr=[new i("miş",-1,-1),new i("muş",-1,-1),new i("müş",-1,-1),new i("mış",-1,-1)],Sr=[new i("b",-1,1),new i("c",-1,2),new i("d",-1,3),new i("ğ",-1,4)],Wr=[17,65,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,32,8,0,0,0,0,0,0,1],Lr=[1,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,8,0,0,0,0,0,0,1],xr=[1,64,16,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],Ar=[17,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,130],Er=[1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1],jr=[17],Tr=[65],Zr=[65],Br=[["a",xr,97,305],["e",Ar,101,252],["ı",Er,97,305],["i",jr,101,105],["o",Tr,111,117],["ö",Zr,246,252],["u",Tr,111,117]],Dr=new e;this.setCurrent=function(r){Dr.setCurrent(r)},this.getCurrent=function(){return Dr.getCurrent()},this.stem=function(){return!!($()&&(Dr.limit_backward=Dr.cursor,Dr.cursor=Dr.limit,J(),Dr.cursor=Dr.limit,nr&&(R(),Dr.cursor=Dr.limit_backward,er())))}};return function(r){return"function"==typeof r.update?r.update(function(r){return n.setCurrent(r),n.stem(),n.getCurrent()}):(n.setCurrent(r),n.stem(),n.getCurrent())}}(),r.Pipeline.registerFunction(r.tr.stemmer,"stemmer-tr"),r.tr.stopWordFilter=r.generateStopWordFilter("acaba altmış altı ama ancak arada aslında ayrıca bana bazı belki ben benden beni benim beri beş bile bin bir biri birkaç birkez birçok birşey birşeyi biz bizden bize bizi bizim bu buna bunda bundan bunlar bunları bunların bunu bunun burada böyle böylece da daha dahi de defa değil diye diğer doksan dokuz dolayı dolayısıyla dört edecek eden ederek edilecek ediliyor edilmesi ediyor elli en etmesi etti ettiği ettiğini eğer gibi göre halen hangi hatta hem henüz hep hepsi her herhangi herkesin hiç hiçbir iki ile ilgili ise itibaren itibariyle için işte kadar karşın katrilyon kendi kendilerine kendini kendisi kendisine kendisini kez ki kim kimden kime kimi kimse kırk milyar milyon mu mü mı nasıl ne neden nedenle nerde nerede nereye niye niçin o olan olarak oldu olduklarını olduğu olduğunu olmadı olmadığı olmak olması olmayan olmaz olsa olsun olup olur olursa oluyor on ona ondan onlar onlardan onları onların onu onun otuz oysa pek rağmen sadece sanki sekiz seksen sen senden seni senin siz sizden sizi sizin tarafından trilyon tüm var vardı ve veya ya yani yapacak yapmak yaptı yaptıkları yaptığı yaptığını yapılan yapılması yapıyor yedi yerine yetmiş yine yirmi yoksa yüz zaten çok çünkü öyle üzere üç şey şeyden şeyi şeyler şu şuna şunda şundan şunları şunu şöyle".split(" ")),r.Pipeline.registerFunction(r.tr.stopWordFilter,"stopWordFilter-tr")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.vi.min.js b/assets/javascripts/lunr/min/lunr.vi.min.js new file mode 100644 index 00000000..22aed28c --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.vi.min.js @@ -0,0 +1 @@ +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r():r()(e.lunr)}(this,function(){return function(e){if(void 0===e)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===e.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");e.vi=function(){this.pipeline.reset(),this.pipeline.add(e.vi.stopWordFilter,e.vi.trimmer)},e.vi.wordCharacters="[A-Za-ẓ̀͐́͑̉̃̓ÂâÊêÔôĂ-ăĐ-đƠ-ơƯ-ư]",e.vi.trimmer=e.trimmerSupport.generateTrimmer(e.vi.wordCharacters),e.Pipeline.registerFunction(e.vi.trimmer,"trimmer-vi"),e.vi.stopWordFilter=e.generateStopWordFilter("là cái nhưng mà".split(" "))}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/min/lunr.zh.min.js b/assets/javascripts/lunr/min/lunr.zh.min.js new file mode 100644 index 00000000..7727bbe2 --- /dev/null +++ b/assets/javascripts/lunr/min/lunr.zh.min.js @@ -0,0 +1 @@ +!function(e,r){"function"==typeof define&&define.amd?define(r):"object"==typeof exports?module.exports=r(require("nodejieba")):r()(e.lunr)}(this,function(e){return function(r,t){if(void 0===r)throw new Error("Lunr is not present. Please include / require Lunr before this script.");if(void 0===r.stemmerSupport)throw new Error("Lunr stemmer support is not present. Please include / require Lunr stemmer support before this script.");var i="2"==r.version[0];r.zh=function(){this.pipeline.reset(),this.pipeline.add(r.zh.trimmer,r.zh.stopWordFilter,r.zh.stemmer),i?this.tokenizer=r.zh.tokenizer:(r.tokenizer&&(r.tokenizer=r.zh.tokenizer),this.tokenizerFn&&(this.tokenizerFn=r.zh.tokenizer))},r.zh.tokenizer=function(n){if(!arguments.length||null==n||void 0==n)return[];if(Array.isArray(n))return n.map(function(e){return i?new r.Token(e.toLowerCase()):e.toLowerCase()});t&&e.load(t);var o=n.toString().trim().toLowerCase(),s=[];e.cut(o,!0).forEach(function(e){s=s.concat(e.split(" "))}),s=s.filter(function(e){return!!e});var u=0;return s.map(function(e,t){if(i){var n=o.indexOf(e,u),s={};return s.position=[n,e.length],s.index=t,u=n,new r.Token(e,s)}return e})},r.zh.wordCharacters="\\w一-龥",r.zh.trimmer=r.trimmerSupport.generateTrimmer(r.zh.wordCharacters),r.Pipeline.registerFunction(r.zh.trimmer,"trimmer-zh"),r.zh.stemmer=function(){return function(e){return e}}(),r.Pipeline.registerFunction(r.zh.stemmer,"stemmer-zh"),r.zh.stopWordFilter=r.generateStopWordFilter("的 一 不 在 人 有 是 为 以 于 上 他 而 后 之 来 及 了 因 下 可 到 由 这 与 也 此 但 并 个 其 已 无 小 我 们 起 最 再 今 去 好 只 又 或 很 亦 某 把 那 你 乃 它 吧 被 比 别 趁 当 从 到 得 打 凡 儿 尔 该 各 给 跟 和 何 还 即 几 既 看 据 距 靠 啦 了 另 么 每 们 嘛 拿 哪 那 您 凭 且 却 让 仍 啥 如 若 使 谁 虽 随 同 所 她 哇 嗡 往 哪 些 向 沿 哟 用 于 咱 则 怎 曾 至 致 着 诸 自".split(" ")),r.Pipeline.registerFunction(r.zh.stopWordFilter,"stopWordFilter-zh")}}); \ No newline at end of file diff --git a/assets/javascripts/lunr/tinyseg.js b/assets/javascripts/lunr/tinyseg.js new file mode 100644 index 00000000..167fa6dd --- /dev/null +++ b/assets/javascripts/lunr/tinyseg.js @@ -0,0 +1,206 @@ +/** + * export the module via AMD, CommonJS or as a browser global + * Export code from https://github.com/umdjs/umd/blob/master/returnExports.js + */ +;(function (root, factory) { + if (typeof define === 'function' && define.amd) { + // AMD. Register as an anonymous module. + define(factory) + } else if (typeof exports === 'object') { + /** + * Node. Does not work with strict CommonJS, but + * only CommonJS-like environments that support module.exports, + * like Node. + */ + module.exports = factory() + } else { + // Browser globals (root is window) + factory()(root.lunr); + } +}(this, function () { + /** + * Just return a value to define the module export. + * This example returns an object, but the module + * can return a function as the exported value. + */ + + return function(lunr) { + // TinySegmenter 0.1 -- Super compact Japanese tokenizer in Javascript + // (c) 2008 Taku Kudo + // TinySegmenter is freely distributable under the terms of a new BSD licence. + // For details, see http://chasen.org/~taku/software/TinySegmenter/LICENCE.txt + + function TinySegmenter() { + var patterns = { + "[一二三四五六七八九十百千万億兆]":"M", + "[一-龠々〆ヵヶ]":"H", + "[ぁ-ん]":"I", + "[ァ-ヴーア-ン゙ー]":"K", + "[a-zA-Za-zA-Z]":"A", + "[0-90-9]":"N" + } + this.chartype_ = []; + for (var i in patterns) { + var regexp = new RegExp(i); + this.chartype_.push([regexp, patterns[i]]); + } + + this.BIAS__ = -332 + this.BC1__ = {"HH":6,"II":2461,"KH":406,"OH":-1378}; + this.BC2__ = {"AA":-3267,"AI":2744,"AN":-878,"HH":-4070,"HM":-1711,"HN":4012,"HO":3761,"IA":1327,"IH":-1184,"II":-1332,"IK":1721,"IO":5492,"KI":3831,"KK":-8741,"MH":-3132,"MK":3334,"OO":-2920}; + this.BC3__ = {"HH":996,"HI":626,"HK":-721,"HN":-1307,"HO":-836,"IH":-301,"KK":2762,"MK":1079,"MM":4034,"OA":-1652,"OH":266}; + this.BP1__ = {"BB":295,"OB":304,"OO":-125,"UB":352}; + this.BP2__ = {"BO":60,"OO":-1762}; + this.BQ1__ = {"BHH":1150,"BHM":1521,"BII":-1158,"BIM":886,"BMH":1208,"BNH":449,"BOH":-91,"BOO":-2597,"OHI":451,"OIH":-296,"OKA":1851,"OKH":-1020,"OKK":904,"OOO":2965}; + this.BQ2__ = {"BHH":118,"BHI":-1159,"BHM":466,"BIH":-919,"BKK":-1720,"BKO":864,"OHH":-1139,"OHM":-181,"OIH":153,"UHI":-1146}; + this.BQ3__ = {"BHH":-792,"BHI":2664,"BII":-299,"BKI":419,"BMH":937,"BMM":8335,"BNN":998,"BOH":775,"OHH":2174,"OHM":439,"OII":280,"OKH":1798,"OKI":-793,"OKO":-2242,"OMH":-2402,"OOO":11699}; + this.BQ4__ = {"BHH":-3895,"BIH":3761,"BII":-4654,"BIK":1348,"BKK":-1806,"BMI":-3385,"BOO":-12396,"OAH":926,"OHH":266,"OHK":-2036,"ONN":-973}; + this.BW1__ = {",と":660,",同":727,"B1あ":1404,"B1同":542,"、と":660,"、同":727,"」と":1682,"あっ":1505,"いう":1743,"いっ":-2055,"いる":672,"うし":-4817,"うん":665,"から":3472,"がら":600,"こう":-790,"こと":2083,"こん":-1262,"さら":-4143,"さん":4573,"した":2641,"して":1104,"すで":-3399,"そこ":1977,"それ":-871,"たち":1122,"ため":601,"った":3463,"つい":-802,"てい":805,"てき":1249,"でき":1127,"です":3445,"では":844,"とい":-4915,"とみ":1922,"どこ":3887,"ない":5713,"なっ":3015,"など":7379,"なん":-1113,"にし":2468,"には":1498,"にも":1671,"に対":-912,"の一":-501,"の中":741,"ませ":2448,"まで":1711,"まま":2600,"まる":-2155,"やむ":-1947,"よっ":-2565,"れた":2369,"れで":-913,"をし":1860,"を見":731,"亡く":-1886,"京都":2558,"取り":-2784,"大き":-2604,"大阪":1497,"平方":-2314,"引き":-1336,"日本":-195,"本当":-2423,"毎日":-2113,"目指":-724,"B1あ":1404,"B1同":542,"」と":1682}; + this.BW2__ = {"..":-11822,"11":-669,"――":-5730,"−−":-13175,"いう":-1609,"うか":2490,"かし":-1350,"かも":-602,"から":-7194,"かれ":4612,"がい":853,"がら":-3198,"きた":1941,"くな":-1597,"こと":-8392,"この":-4193,"させ":4533,"され":13168,"さん":-3977,"しい":-1819,"しか":-545,"した":5078,"して":972,"しな":939,"その":-3744,"たい":-1253,"たた":-662,"ただ":-3857,"たち":-786,"たと":1224,"たは":-939,"った":4589,"って":1647,"っと":-2094,"てい":6144,"てき":3640,"てく":2551,"ては":-3110,"ても":-3065,"でい":2666,"でき":-1528,"でし":-3828,"です":-4761,"でも":-4203,"とい":1890,"とこ":-1746,"とと":-2279,"との":720,"とみ":5168,"とも":-3941,"ない":-2488,"なが":-1313,"など":-6509,"なの":2614,"なん":3099,"にお":-1615,"にし":2748,"にな":2454,"によ":-7236,"に対":-14943,"に従":-4688,"に関":-11388,"のか":2093,"ので":-7059,"のに":-6041,"のの":-6125,"はい":1073,"はが":-1033,"はず":-2532,"ばれ":1813,"まし":-1316,"まで":-6621,"まれ":5409,"めて":-3153,"もい":2230,"もの":-10713,"らか":-944,"らし":-1611,"らに":-1897,"りし":651,"りま":1620,"れた":4270,"れて":849,"れば":4114,"ろう":6067,"われ":7901,"を通":-11877,"んだ":728,"んな":-4115,"一人":602,"一方":-1375,"一日":970,"一部":-1051,"上が":-4479,"会社":-1116,"出て":2163,"分の":-7758,"同党":970,"同日":-913,"大阪":-2471,"委員":-1250,"少な":-1050,"年度":-8669,"年間":-1626,"府県":-2363,"手権":-1982,"新聞":-4066,"日新":-722,"日本":-7068,"日米":3372,"曜日":-601,"朝鮮":-2355,"本人":-2697,"東京":-1543,"然と":-1384,"社会":-1276,"立て":-990,"第に":-1612,"米国":-4268,"11":-669}; + this.BW3__ = {"あた":-2194,"あり":719,"ある":3846,"い.":-1185,"い。":-1185,"いい":5308,"いえ":2079,"いく":3029,"いた":2056,"いっ":1883,"いる":5600,"いわ":1527,"うち":1117,"うと":4798,"えと":1454,"か.":2857,"か。":2857,"かけ":-743,"かっ":-4098,"かに":-669,"から":6520,"かり":-2670,"が,":1816,"が、":1816,"がき":-4855,"がけ":-1127,"がっ":-913,"がら":-4977,"がり":-2064,"きた":1645,"けど":1374,"こと":7397,"この":1542,"ころ":-2757,"さい":-714,"さを":976,"し,":1557,"し、":1557,"しい":-3714,"した":3562,"して":1449,"しな":2608,"しま":1200,"す.":-1310,"す。":-1310,"する":6521,"ず,":3426,"ず、":3426,"ずに":841,"そう":428,"た.":8875,"た。":8875,"たい":-594,"たの":812,"たり":-1183,"たる":-853,"だ.":4098,"だ。":4098,"だっ":1004,"った":-4748,"って":300,"てい":6240,"てお":855,"ても":302,"です":1437,"でに":-1482,"では":2295,"とう":-1387,"とし":2266,"との":541,"とも":-3543,"どう":4664,"ない":1796,"なく":-903,"など":2135,"に,":-1021,"に、":-1021,"にし":1771,"にな":1906,"には":2644,"の,":-724,"の、":-724,"の子":-1000,"は,":1337,"は、":1337,"べき":2181,"まし":1113,"ます":6943,"まっ":-1549,"まで":6154,"まれ":-793,"らし":1479,"られ":6820,"るる":3818,"れ,":854,"れ、":854,"れた":1850,"れて":1375,"れば":-3246,"れる":1091,"われ":-605,"んだ":606,"んで":798,"カ月":990,"会議":860,"入り":1232,"大会":2217,"始め":1681,"市":965,"新聞":-5055,"日,":974,"日、":974,"社会":2024,"カ月":990}; + this.TC1__ = {"AAA":1093,"HHH":1029,"HHM":580,"HII":998,"HOH":-390,"HOM":-331,"IHI":1169,"IOH":-142,"IOI":-1015,"IOM":467,"MMH":187,"OOI":-1832}; + this.TC2__ = {"HHO":2088,"HII":-1023,"HMM":-1154,"IHI":-1965,"KKH":703,"OII":-2649}; + this.TC3__ = {"AAA":-294,"HHH":346,"HHI":-341,"HII":-1088,"HIK":731,"HOH":-1486,"IHH":128,"IHI":-3041,"IHO":-1935,"IIH":-825,"IIM":-1035,"IOI":-542,"KHH":-1216,"KKA":491,"KKH":-1217,"KOK":-1009,"MHH":-2694,"MHM":-457,"MHO":123,"MMH":-471,"NNH":-1689,"NNO":662,"OHO":-3393}; + this.TC4__ = {"HHH":-203,"HHI":1344,"HHK":365,"HHM":-122,"HHN":182,"HHO":669,"HIH":804,"HII":679,"HOH":446,"IHH":695,"IHO":-2324,"IIH":321,"III":1497,"IIO":656,"IOO":54,"KAK":4845,"KKA":3386,"KKK":3065,"MHH":-405,"MHI":201,"MMH":-241,"MMM":661,"MOM":841}; + this.TQ1__ = {"BHHH":-227,"BHHI":316,"BHIH":-132,"BIHH":60,"BIII":1595,"BNHH":-744,"BOHH":225,"BOOO":-908,"OAKK":482,"OHHH":281,"OHIH":249,"OIHI":200,"OIIH":-68}; + this.TQ2__ = {"BIHH":-1401,"BIII":-1033,"BKAK":-543,"BOOO":-5591}; + this.TQ3__ = {"BHHH":478,"BHHM":-1073,"BHIH":222,"BHII":-504,"BIIH":-116,"BIII":-105,"BMHI":-863,"BMHM":-464,"BOMH":620,"OHHH":346,"OHHI":1729,"OHII":997,"OHMH":481,"OIHH":623,"OIIH":1344,"OKAK":2792,"OKHH":587,"OKKA":679,"OOHH":110,"OOII":-685}; + this.TQ4__ = {"BHHH":-721,"BHHM":-3604,"BHII":-966,"BIIH":-607,"BIII":-2181,"OAAA":-2763,"OAKK":180,"OHHH":-294,"OHHI":2446,"OHHO":480,"OHIH":-1573,"OIHH":1935,"OIHI":-493,"OIIH":626,"OIII":-4007,"OKAK":-8156}; + this.TW1__ = {"につい":-4681,"東京都":2026}; + this.TW2__ = {"ある程":-2049,"いった":-1256,"ころが":-2434,"しょう":3873,"その後":-4430,"だって":-1049,"ていた":1833,"として":-4657,"ともに":-4517,"もので":1882,"一気に":-792,"初めて":-1512,"同時に":-8097,"大きな":-1255,"対して":-2721,"社会党":-3216}; + this.TW3__ = {"いただ":-1734,"してい":1314,"として":-4314,"につい":-5483,"にとっ":-5989,"に当た":-6247,"ので,":-727,"ので、":-727,"のもの":-600,"れから":-3752,"十二月":-2287}; + this.TW4__ = {"いう.":8576,"いう。":8576,"からな":-2348,"してい":2958,"たが,":1516,"たが、":1516,"ている":1538,"という":1349,"ました":5543,"ません":1097,"ようと":-4258,"よると":5865}; + this.UC1__ = {"A":484,"K":93,"M":645,"O":-505}; + this.UC2__ = {"A":819,"H":1059,"I":409,"M":3987,"N":5775,"O":646}; + this.UC3__ = {"A":-1370,"I":2311}; + this.UC4__ = {"A":-2643,"H":1809,"I":-1032,"K":-3450,"M":3565,"N":3876,"O":6646}; + this.UC5__ = {"H":313,"I":-1238,"K":-799,"M":539,"O":-831}; + this.UC6__ = {"H":-506,"I":-253,"K":87,"M":247,"O":-387}; + this.UP1__ = {"O":-214}; + this.UP2__ = {"B":69,"O":935}; + this.UP3__ = {"B":189}; + this.UQ1__ = {"BH":21,"BI":-12,"BK":-99,"BN":142,"BO":-56,"OH":-95,"OI":477,"OK":410,"OO":-2422}; + this.UQ2__ = {"BH":216,"BI":113,"OK":1759}; + this.UQ3__ = {"BA":-479,"BH":42,"BI":1913,"BK":-7198,"BM":3160,"BN":6427,"BO":14761,"OI":-827,"ON":-3212}; + this.UW1__ = {",":156,"、":156,"「":-463,"あ":-941,"う":-127,"が":-553,"き":121,"こ":505,"で":-201,"と":-547,"ど":-123,"に":-789,"の":-185,"は":-847,"も":-466,"や":-470,"よ":182,"ら":-292,"り":208,"れ":169,"を":-446,"ん":-137,"・":-135,"主":-402,"京":-268,"区":-912,"午":871,"国":-460,"大":561,"委":729,"市":-411,"日":-141,"理":361,"生":-408,"県":-386,"都":-718,"「":-463,"・":-135}; + this.UW2__ = {",":-829,"、":-829,"〇":892,"「":-645,"」":3145,"あ":-538,"い":505,"う":134,"お":-502,"か":1454,"が":-856,"く":-412,"こ":1141,"さ":878,"ざ":540,"し":1529,"す":-675,"せ":300,"そ":-1011,"た":188,"だ":1837,"つ":-949,"て":-291,"で":-268,"と":-981,"ど":1273,"な":1063,"に":-1764,"の":130,"は":-409,"ひ":-1273,"べ":1261,"ま":600,"も":-1263,"や":-402,"よ":1639,"り":-579,"る":-694,"れ":571,"を":-2516,"ん":2095,"ア":-587,"カ":306,"キ":568,"ッ":831,"三":-758,"不":-2150,"世":-302,"中":-968,"主":-861,"事":492,"人":-123,"会":978,"保":362,"入":548,"初":-3025,"副":-1566,"北":-3414,"区":-422,"大":-1769,"天":-865,"太":-483,"子":-1519,"学":760,"実":1023,"小":-2009,"市":-813,"年":-1060,"強":1067,"手":-1519,"揺":-1033,"政":1522,"文":-1355,"新":-1682,"日":-1815,"明":-1462,"最":-630,"朝":-1843,"本":-1650,"東":-931,"果":-665,"次":-2378,"民":-180,"気":-1740,"理":752,"発":529,"目":-1584,"相":-242,"県":-1165,"立":-763,"第":810,"米":509,"自":-1353,"行":838,"西":-744,"見":-3874,"調":1010,"議":1198,"込":3041,"開":1758,"間":-1257,"「":-645,"」":3145,"ッ":831,"ア":-587,"カ":306,"キ":568}; + this.UW3__ = {",":4889,"1":-800,"−":-1723,"、":4889,"々":-2311,"〇":5827,"」":2670,"〓":-3573,"あ":-2696,"い":1006,"う":2342,"え":1983,"お":-4864,"か":-1163,"が":3271,"く":1004,"け":388,"げ":401,"こ":-3552,"ご":-3116,"さ":-1058,"し":-395,"す":584,"せ":3685,"そ":-5228,"た":842,"ち":-521,"っ":-1444,"つ":-1081,"て":6167,"で":2318,"と":1691,"ど":-899,"な":-2788,"に":2745,"の":4056,"は":4555,"ひ":-2171,"ふ":-1798,"へ":1199,"ほ":-5516,"ま":-4384,"み":-120,"め":1205,"も":2323,"や":-788,"よ":-202,"ら":727,"り":649,"る":5905,"れ":2773,"わ":-1207,"を":6620,"ん":-518,"ア":551,"グ":1319,"ス":874,"ッ":-1350,"ト":521,"ム":1109,"ル":1591,"ロ":2201,"ン":278,"・":-3794,"一":-1619,"下":-1759,"世":-2087,"両":3815,"中":653,"主":-758,"予":-1193,"二":974,"人":2742,"今":792,"他":1889,"以":-1368,"低":811,"何":4265,"作":-361,"保":-2439,"元":4858,"党":3593,"全":1574,"公":-3030,"六":755,"共":-1880,"円":5807,"再":3095,"分":457,"初":2475,"別":1129,"前":2286,"副":4437,"力":365,"動":-949,"務":-1872,"化":1327,"北":-1038,"区":4646,"千":-2309,"午":-783,"協":-1006,"口":483,"右":1233,"各":3588,"合":-241,"同":3906,"和":-837,"員":4513,"国":642,"型":1389,"場":1219,"外":-241,"妻":2016,"学":-1356,"安":-423,"実":-1008,"家":1078,"小":-513,"少":-3102,"州":1155,"市":3197,"平":-1804,"年":2416,"広":-1030,"府":1605,"度":1452,"建":-2352,"当":-3885,"得":1905,"思":-1291,"性":1822,"戸":-488,"指":-3973,"政":-2013,"教":-1479,"数":3222,"文":-1489,"新":1764,"日":2099,"旧":5792,"昨":-661,"時":-1248,"曜":-951,"最":-937,"月":4125,"期":360,"李":3094,"村":364,"東":-805,"核":5156,"森":2438,"業":484,"氏":2613,"民":-1694,"決":-1073,"法":1868,"海":-495,"無":979,"物":461,"特":-3850,"生":-273,"用":914,"町":1215,"的":7313,"直":-1835,"省":792,"県":6293,"知":-1528,"私":4231,"税":401,"立":-960,"第":1201,"米":7767,"系":3066,"約":3663,"級":1384,"統":-4229,"総":1163,"線":1255,"者":6457,"能":725,"自":-2869,"英":785,"見":1044,"調":-562,"財":-733,"費":1777,"車":1835,"軍":1375,"込":-1504,"通":-1136,"選":-681,"郎":1026,"郡":4404,"部":1200,"金":2163,"長":421,"開":-1432,"間":1302,"関":-1282,"雨":2009,"電":-1045,"非":2066,"駅":1620,"1":-800,"」":2670,"・":-3794,"ッ":-1350,"ア":551,"グ":1319,"ス":874,"ト":521,"ム":1109,"ル":1591,"ロ":2201,"ン":278}; + this.UW4__ = {",":3930,".":3508,"―":-4841,"、":3930,"。":3508,"〇":4999,"「":1895,"」":3798,"〓":-5156,"あ":4752,"い":-3435,"う":-640,"え":-2514,"お":2405,"か":530,"が":6006,"き":-4482,"ぎ":-3821,"く":-3788,"け":-4376,"げ":-4734,"こ":2255,"ご":1979,"さ":2864,"し":-843,"じ":-2506,"す":-731,"ず":1251,"せ":181,"そ":4091,"た":5034,"だ":5408,"ち":-3654,"っ":-5882,"つ":-1659,"て":3994,"で":7410,"と":4547,"な":5433,"に":6499,"ぬ":1853,"ね":1413,"の":7396,"は":8578,"ば":1940,"ひ":4249,"び":-4134,"ふ":1345,"へ":6665,"べ":-744,"ほ":1464,"ま":1051,"み":-2082,"む":-882,"め":-5046,"も":4169,"ゃ":-2666,"や":2795,"ょ":-1544,"よ":3351,"ら":-2922,"り":-9726,"る":-14896,"れ":-2613,"ろ":-4570,"わ":-1783,"を":13150,"ん":-2352,"カ":2145,"コ":1789,"セ":1287,"ッ":-724,"ト":-403,"メ":-1635,"ラ":-881,"リ":-541,"ル":-856,"ン":-3637,"・":-4371,"ー":-11870,"一":-2069,"中":2210,"予":782,"事":-190,"井":-1768,"人":1036,"以":544,"会":950,"体":-1286,"作":530,"側":4292,"先":601,"党":-2006,"共":-1212,"内":584,"円":788,"初":1347,"前":1623,"副":3879,"力":-302,"動":-740,"務":-2715,"化":776,"区":4517,"協":1013,"参":1555,"合":-1834,"和":-681,"員":-910,"器":-851,"回":1500,"国":-619,"園":-1200,"地":866,"場":-1410,"塁":-2094,"士":-1413,"多":1067,"大":571,"子":-4802,"学":-1397,"定":-1057,"寺":-809,"小":1910,"屋":-1328,"山":-1500,"島":-2056,"川":-2667,"市":2771,"年":374,"庁":-4556,"後":456,"性":553,"感":916,"所":-1566,"支":856,"改":787,"政":2182,"教":704,"文":522,"方":-856,"日":1798,"時":1829,"最":845,"月":-9066,"木":-485,"来":-442,"校":-360,"業":-1043,"氏":5388,"民":-2716,"気":-910,"沢":-939,"済":-543,"物":-735,"率":672,"球":-1267,"生":-1286,"産":-1101,"田":-2900,"町":1826,"的":2586,"目":922,"省":-3485,"県":2997,"空":-867,"立":-2112,"第":788,"米":2937,"系":786,"約":2171,"経":1146,"統":-1169,"総":940,"線":-994,"署":749,"者":2145,"能":-730,"般":-852,"行":-792,"規":792,"警":-1184,"議":-244,"谷":-1000,"賞":730,"車":-1481,"軍":1158,"輪":-1433,"込":-3370,"近":929,"道":-1291,"選":2596,"郎":-4866,"都":1192,"野":-1100,"銀":-2213,"長":357,"間":-2344,"院":-2297,"際":-2604,"電":-878,"領":-1659,"題":-792,"館":-1984,"首":1749,"高":2120,"「":1895,"」":3798,"・":-4371,"ッ":-724,"ー":-11870,"カ":2145,"コ":1789,"セ":1287,"ト":-403,"メ":-1635,"ラ":-881,"リ":-541,"ル":-856,"ン":-3637}; + this.UW5__ = {",":465,".":-299,"1":-514,"E2":-32768,"]":-2762,"、":465,"。":-299,"「":363,"あ":1655,"い":331,"う":-503,"え":1199,"お":527,"か":647,"が":-421,"き":1624,"ぎ":1971,"く":312,"げ":-983,"さ":-1537,"し":-1371,"す":-852,"だ":-1186,"ち":1093,"っ":52,"つ":921,"て":-18,"で":-850,"と":-127,"ど":1682,"な":-787,"に":-1224,"の":-635,"は":-578,"べ":1001,"み":502,"め":865,"ゃ":3350,"ょ":854,"り":-208,"る":429,"れ":504,"わ":419,"を":-1264,"ん":327,"イ":241,"ル":451,"ン":-343,"中":-871,"京":722,"会":-1153,"党":-654,"務":3519,"区":-901,"告":848,"員":2104,"大":-1296,"学":-548,"定":1785,"嵐":-1304,"市":-2991,"席":921,"年":1763,"思":872,"所":-814,"挙":1618,"新":-1682,"日":218,"月":-4353,"査":932,"格":1356,"機":-1508,"氏":-1347,"田":240,"町":-3912,"的":-3149,"相":1319,"省":-1052,"県":-4003,"研":-997,"社":-278,"空":-813,"統":1955,"者":-2233,"表":663,"語":-1073,"議":1219,"選":-1018,"郎":-368,"長":786,"間":1191,"題":2368,"館":-689,"1":-514,"E2":-32768,"「":363,"イ":241,"ル":451,"ン":-343}; + this.UW6__ = {",":227,".":808,"1":-270,"E1":306,"、":227,"。":808,"あ":-307,"う":189,"か":241,"が":-73,"く":-121,"こ":-200,"じ":1782,"す":383,"た":-428,"っ":573,"て":-1014,"で":101,"と":-105,"な":-253,"に":-149,"の":-417,"は":-236,"も":-206,"り":187,"る":-135,"を":195,"ル":-673,"ン":-496,"一":-277,"中":201,"件":-800,"会":624,"前":302,"区":1792,"員":-1212,"委":798,"学":-960,"市":887,"広":-695,"後":535,"業":-697,"相":753,"社":-507,"福":974,"空":-822,"者":1811,"連":463,"郎":1082,"1":-270,"E1":306,"ル":-673,"ン":-496}; + + return this; + } + TinySegmenter.prototype.ctype_ = function(str) { + for (var i in this.chartype_) { + if (str.match(this.chartype_[i][0])) { + return this.chartype_[i][1]; + } + } + return "O"; + } + + TinySegmenter.prototype.ts_ = function(v) { + if (v) { return v; } + return 0; + } + + TinySegmenter.prototype.segment = function(input) { + if (input == null || input == undefined || input == "") { + return []; + } + var result = []; + var seg = ["B3","B2","B1"]; + var ctype = ["O","O","O"]; + var o = input.split(""); + for (i = 0; i < o.length; ++i) { + seg.push(o[i]); + ctype.push(this.ctype_(o[i])) + } + seg.push("E1"); + seg.push("E2"); + seg.push("E3"); + ctype.push("O"); + ctype.push("O"); + ctype.push("O"); + var word = seg[3]; + var p1 = "U"; + var p2 = "U"; + var p3 = "U"; + for (var i = 4; i < seg.length - 3; ++i) { + var score = this.BIAS__; + var w1 = seg[i-3]; + var w2 = seg[i-2]; + var w3 = seg[i-1]; + var w4 = seg[i]; + var w5 = seg[i+1]; + var w6 = seg[i+2]; + var c1 = ctype[i-3]; + var c2 = ctype[i-2]; + var c3 = ctype[i-1]; + var c4 = ctype[i]; + var c5 = ctype[i+1]; + var c6 = ctype[i+2]; + score += this.ts_(this.UP1__[p1]); + score += this.ts_(this.UP2__[p2]); + score += this.ts_(this.UP3__[p3]); + score += this.ts_(this.BP1__[p1 + p2]); + score += this.ts_(this.BP2__[p2 + p3]); + score += this.ts_(this.UW1__[w1]); + score += this.ts_(this.UW2__[w2]); + score += this.ts_(this.UW3__[w3]); + score += this.ts_(this.UW4__[w4]); + score += this.ts_(this.UW5__[w5]); + score += this.ts_(this.UW6__[w6]); + score += this.ts_(this.BW1__[w2 + w3]); + score += this.ts_(this.BW2__[w3 + w4]); + score += this.ts_(this.BW3__[w4 + w5]); + score += this.ts_(this.TW1__[w1 + w2 + w3]); + score += this.ts_(this.TW2__[w2 + w3 + w4]); + score += this.ts_(this.TW3__[w3 + w4 + w5]); + score += this.ts_(this.TW4__[w4 + w5 + w6]); + score += this.ts_(this.UC1__[c1]); + score += this.ts_(this.UC2__[c2]); + score += this.ts_(this.UC3__[c3]); + score += this.ts_(this.UC4__[c4]); + score += this.ts_(this.UC5__[c5]); + score += this.ts_(this.UC6__[c6]); + score += this.ts_(this.BC1__[c2 + c3]); + score += this.ts_(this.BC2__[c3 + c4]); + score += this.ts_(this.BC3__[c4 + c5]); + score += this.ts_(this.TC1__[c1 + c2 + c3]); + score += this.ts_(this.TC2__[c2 + c3 + c4]); + score += this.ts_(this.TC3__[c3 + c4 + c5]); + score += this.ts_(this.TC4__[c4 + c5 + c6]); + // score += this.ts_(this.TC5__[c4 + c5 + c6]); + score += this.ts_(this.UQ1__[p1 + c1]); + score += this.ts_(this.UQ2__[p2 + c2]); + score += this.ts_(this.UQ3__[p3 + c3]); + score += this.ts_(this.BQ1__[p2 + c2 + c3]); + score += this.ts_(this.BQ2__[p2 + c3 + c4]); + score += this.ts_(this.BQ3__[p3 + c2 + c3]); + score += this.ts_(this.BQ4__[p3 + c3 + c4]); + score += this.ts_(this.TQ1__[p2 + c1 + c2 + c3]); + score += this.ts_(this.TQ2__[p2 + c2 + c3 + c4]); + score += this.ts_(this.TQ3__[p3 + c1 + c2 + c3]); + score += this.ts_(this.TQ4__[p3 + c2 + c3 + c4]); + var p = "O"; + if (score > 0) { + result.push(word); + word = ""; + p = "B"; + } + p1 = p2; + p2 = p3; + p3 = p; + word += seg[i]; + } + result.push(word); + + return result; + } + + lunr.TinySegmenter = TinySegmenter; + }; + +})); \ No newline at end of file diff --git a/assets/javascripts/lunr/wordcut.js b/assets/javascripts/lunr/wordcut.js new file mode 100644 index 00000000..146f4b44 --- /dev/null +++ b/assets/javascripts/lunr/wordcut.js @@ -0,0 +1,6708 @@ +(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}(g.lunr || (g.lunr = {})).wordcut = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o 1; + }) + this.addWords(words, false) + } + if(finalize){ + this.finalizeDict(); + } + }, + + dictSeek: function (l, r, ch, strOffset, pos) { + var ans = null; + while (l <= r) { + var m = Math.floor((l + r) / 2), + dict_item = this.dict[m], + len = dict_item.length; + if (len <= strOffset) { + l = m + 1; + } else { + var ch_ = dict_item[strOffset]; + if (ch_ < ch) { + l = m + 1; + } else if (ch_ > ch) { + r = m - 1; + } else { + ans = m; + if (pos == LEFT) { + r = m - 1; + } else { + l = m + 1; + } + } + } + } + return ans; + }, + + isFinal: function (acceptor) { + return this.dict[acceptor.l].length == acceptor.strOffset; + }, + + createAcceptor: function () { + return { + l: 0, + r: this.dict.length - 1, + strOffset: 0, + isFinal: false, + dict: this, + transit: function (ch) { + return this.dict.transit(this, ch); + }, + isError: false, + tag: "DICT", + w: 1, + type: "DICT" + }; + }, + + transit: function (acceptor, ch) { + var l = this.dictSeek(acceptor.l, + acceptor.r, + ch, + acceptor.strOffset, + LEFT); + if (l !== null) { + var r = this.dictSeek(l, + acceptor.r, + ch, + acceptor.strOffset, + RIGHT); + acceptor.l = l; + acceptor.r = r; + acceptor.strOffset++; + acceptor.isFinal = this.isFinal(acceptor); + } else { + acceptor.isError = true; + } + return acceptor; + }, + + sortuniq: function(a){ + return a.sort().filter(function(item, pos, arr){ + return !pos || item != arr[pos - 1]; + }) + }, + + flatten: function(a){ + //[[1,2],[3]] -> [1,2,3] + return [].concat.apply([], a); + } +}; +module.exports = WordcutDict; + +}).call(this,"/dist/tmp") +},{"glob":16,"path":22}],3:[function(require,module,exports){ +var WordRule = { + createAcceptor: function(tag) { + if (tag["WORD_RULE"]) + return null; + + return {strOffset: 0, + isFinal: false, + transit: function(ch) { + var lch = ch.toLowerCase(); + if (lch >= "a" && lch <= "z") { + this.isFinal = true; + this.strOffset++; + } else { + this.isError = true; + } + return this; + }, + isError: false, + tag: "WORD_RULE", + type: "WORD_RULE", + w: 1}; + } +}; + +var NumberRule = { + createAcceptor: function(tag) { + if (tag["NUMBER_RULE"]) + return null; + + return {strOffset: 0, + isFinal: false, + transit: function(ch) { + if (ch >= "0" && ch <= "9") { + this.isFinal = true; + this.strOffset++; + } else { + this.isError = true; + } + return this; + }, + isError: false, + tag: "NUMBER_RULE", + type: "NUMBER_RULE", + w: 1}; + } +}; + +var SpaceRule = { + tag: "SPACE_RULE", + createAcceptor: function(tag) { + + if (tag["SPACE_RULE"]) + return null; + + return {strOffset: 0, + isFinal: false, + transit: function(ch) { + if (ch == " " || ch == "\t" || ch == "\r" || ch == "\n" || + ch == "\u00A0" || ch=="\u2003"//nbsp and emsp + ) { + this.isFinal = true; + this.strOffset++; + } else { + this.isError = true; + } + return this; + }, + isError: false, + tag: SpaceRule.tag, + w: 1, + type: "SPACE_RULE"}; + } +} + +var SingleSymbolRule = { + tag: "SINSYM", + createAcceptor: function(tag) { + return {strOffset: 0, + isFinal: false, + transit: function(ch) { + if (this.strOffset == 0 && ch.match(/^[\@\(\)\/\,\-\."`]$/)) { + this.isFinal = true; + this.strOffset++; + } else { + this.isError = true; + } + return this; + }, + isError: false, + tag: "SINSYM", + w: 1, + type: "SINSYM"}; + } +} + + +var LatinRules = [WordRule, SpaceRule, SingleSymbolRule, NumberRule]; + +module.exports = LatinRules; + +},{}],4:[function(require,module,exports){ +var _ = require("underscore") + , WordcutCore = require("./wordcut_core"); +var PathInfoBuilder = { + + /* + buildByPartAcceptors: function(path, acceptors, i) { + var + var genInfos = partAcceptors.reduce(function(genInfos, acceptor) { + + }, []); + + return genInfos; + } + */ + + buildByAcceptors: function(path, finalAcceptors, i) { + var self = this; + var infos = finalAcceptors.map(function(acceptor) { + var p = i - acceptor.strOffset + 1 + , _info = path[p]; + + var info = {p: p, + mw: _info.mw + (acceptor.mw === undefined ? 0 : acceptor.mw), + w: acceptor.w + _info.w, + unk: (acceptor.unk ? acceptor.unk : 0) + _info.unk, + type: acceptor.type}; + + if (acceptor.type == "PART") { + for(var j = p + 1; j <= i; j++) { + path[j].merge = p; + } + info.merge = p; + } + + return info; + }); + return infos.filter(function(info) { return info; }); + }, + + fallback: function(path, leftBoundary, text, i) { + var _info = path[leftBoundary]; + if (text[i].match(/[\u0E48-\u0E4E]/)) { + if (leftBoundary != 0) + leftBoundary = path[leftBoundary].p; + return {p: leftBoundary, + mw: 0, + w: 1 + _info.w, + unk: 1 + _info.unk, + type: "UNK"}; +/* } else if(leftBoundary > 0 && path[leftBoundary].type !== "UNK") { + leftBoundary = path[leftBoundary].p; + return {p: leftBoundary, + w: 1 + _info.w, + unk: 1 + _info.unk, + type: "UNK"}; */ + } else { + return {p: leftBoundary, + mw: _info.mw, + w: 1 + _info.w, + unk: 1 + _info.unk, + type: "UNK"}; + } + }, + + build: function(path, finalAcceptors, i, leftBoundary, text) { + var basicPathInfos = this.buildByAcceptors(path, finalAcceptors, i); + if (basicPathInfos.length > 0) { + return basicPathInfos; + } else { + return [this.fallback(path, leftBoundary, text, i)]; + } + } +}; + +module.exports = function() { + return _.clone(PathInfoBuilder); +} + +},{"./wordcut_core":8,"underscore":25}],5:[function(require,module,exports){ +var _ = require("underscore"); + + +var PathSelector = { + selectPath: function(paths) { + var path = paths.reduce(function(selectedPath, path) { + if (selectedPath == null) { + return path; + } else { + if (path.unk < selectedPath.unk) + return path; + if (path.unk == selectedPath.unk) { + if (path.mw < selectedPath.mw) + return path + if (path.mw == selectedPath.mw) { + if (path.w < selectedPath.w) + return path; + } + } + return selectedPath; + } + }, null); + return path; + }, + + createPath: function() { + return [{p:null, w:0, unk:0, type: "INIT", mw:0}]; + } +}; + +module.exports = function() { + return _.clone(PathSelector); +}; + +},{"underscore":25}],6:[function(require,module,exports){ +function isMatch(pat, offset, ch) { + if (pat.length <= offset) + return false; + var _ch = pat[offset]; + return _ch == ch || + (_ch.match(/[กข]/) && ch.match(/[ก-ฮ]/)) || + (_ch.match(/[มบ]/) && ch.match(/[ก-ฮ]/)) || + (_ch.match(/\u0E49/) && ch.match(/[\u0E48-\u0E4B]/)); +} + +var Rule0 = { + pat: "เหก็ม", + createAcceptor: function(tag) { + return {strOffset: 0, + isFinal: false, + transit: function(ch) { + if (isMatch(Rule0.pat, this.strOffset,ch)) { + this.isFinal = (this.strOffset + 1 == Rule0.pat.length); + this.strOffset++; + } else { + this.isError = true; + } + return this; + }, + isError: false, + tag: "THAI_RULE", + type: "THAI_RULE", + w: 1}; + } +}; + +var PartRule = { + createAcceptor: function(tag) { + return {strOffset: 0, + patterns: [ + "แก", "เก", "ก้", "กก์", "กา", "กี", "กิ", "กืก" + ], + isFinal: false, + transit: function(ch) { + var offset = this.strOffset; + this.patterns = this.patterns.filter(function(pat) { + return isMatch(pat, offset, ch); + }); + + if (this.patterns.length > 0) { + var len = 1 + offset; + this.isFinal = this.patterns.some(function(pat) { + return pat.length == len; + }); + this.strOffset++; + } else { + this.isError = true; + } + return this; + }, + isError: false, + tag: "PART", + type: "PART", + unk: 1, + w: 1}; + } +}; + +var ThaiRules = [Rule0, PartRule]; + +module.exports = ThaiRules; + +},{}],7:[function(require,module,exports){ +var sys = require("sys") + , WordcutDict = require("./dict") + , WordcutCore = require("./wordcut_core") + , PathInfoBuilder = require("./path_info_builder") + , PathSelector = require("./path_selector") + , Acceptors = require("./acceptors") + , latinRules = require("./latin_rules") + , thaiRules = require("./thai_rules") + , _ = require("underscore"); + + +var Wordcut = Object.create(WordcutCore); +Wordcut.defaultPathInfoBuilder = PathInfoBuilder; +Wordcut.defaultPathSelector = PathSelector; +Wordcut.defaultAcceptors = Acceptors; +Wordcut.defaultLatinRules = latinRules; +Wordcut.defaultThaiRules = thaiRules; +Wordcut.defaultDict = WordcutDict; + + +Wordcut.initNoDict = function(dict_path) { + var self = this; + self.pathInfoBuilder = new self.defaultPathInfoBuilder; + self.pathSelector = new self.defaultPathSelector; + self.acceptors = new self.defaultAcceptors; + self.defaultLatinRules.forEach(function(rule) { + self.acceptors.creators.push(rule); + }); + self.defaultThaiRules.forEach(function(rule) { + self.acceptors.creators.push(rule); + }); +}; + +Wordcut.init = function(dict_path, withDefault, additionalWords) { + withDefault = withDefault || false; + this.initNoDict(); + var dict = _.clone(this.defaultDict); + dict.init(dict_path, withDefault, additionalWords); + this.acceptors.creators.push(dict); +}; + +module.exports = Wordcut; + +},{"./acceptors":1,"./dict":2,"./latin_rules":3,"./path_info_builder":4,"./path_selector":5,"./thai_rules":6,"./wordcut_core":8,"sys":28,"underscore":25}],8:[function(require,module,exports){ +var WordcutCore = { + + buildPath: function(text) { + var self = this + , path = self.pathSelector.createPath() + , leftBoundary = 0; + self.acceptors.reset(); + for (var i = 0; i < text.length; i++) { + var ch = text[i]; + self.acceptors.transit(ch); + + var possiblePathInfos = self + .pathInfoBuilder + .build(path, + self.acceptors.getFinalAcceptors(), + i, + leftBoundary, + text); + var selectedPath = self.pathSelector.selectPath(possiblePathInfos) + + path.push(selectedPath); + if (selectedPath.type !== "UNK") { + leftBoundary = i; + } + } + return path; + }, + + pathToRanges: function(path) { + var e = path.length - 1 + , ranges = []; + + while (e > 0) { + var info = path[e] + , s = info.p; + + if (info.merge !== undefined && ranges.length > 0) { + var r = ranges[ranges.length - 1]; + r.s = info.merge; + s = r.s; + } else { + ranges.push({s:s, e:e}); + } + e = s; + } + return ranges.reverse(); + }, + + rangesToText: function(text, ranges, delimiter) { + return ranges.map(function(r) { + return text.substring(r.s, r.e); + }).join(delimiter); + }, + + cut: function(text, delimiter) { + var path = this.buildPath(text) + , ranges = this.pathToRanges(path); + return this + .rangesToText(text, ranges, + (delimiter === undefined ? "|" : delimiter)); + }, + + cutIntoRanges: function(text, noText) { + var path = this.buildPath(text) + , ranges = this.pathToRanges(path); + + if (!noText) { + ranges.forEach(function(r) { + r.text = text.substring(r.s, r.e); + }); + } + return ranges; + }, + + cutIntoArray: function(text) { + var path = this.buildPath(text) + , ranges = this.pathToRanges(path); + + return ranges.map(function(r) { + return text.substring(r.s, r.e) + }); + } +}; + +module.exports = WordcutCore; + +},{}],9:[function(require,module,exports){ +// http://wiki.commonjs.org/wiki/Unit_Testing/1.0 +// +// THIS IS NOT TESTED NOR LIKELY TO WORK OUTSIDE V8! +// +// Originally from narwhal.js (http://narwhaljs.org) +// Copyright (c) 2009 Thomas Robinson <280north.com> +// +// Permission is hereby granted, free of charge, to any person obtaining a copy +// of this software and associated documentation files (the 'Software'), to +// deal in the Software without restriction, including without limitation the +// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or +// sell copies of the Software, and to permit persons to whom the Software is +// furnished to do so, subject to the following conditions: +// +// The above copyright notice and this permission notice shall be included in +// all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR +// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, +// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE +// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN +// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION +// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. + +// when used in node, this will actually load the util module we depend on +// versus loading the builtin util module as happens otherwise +// this is a bug in node module loading as far as I am concerned +var util = require('util/'); + +var pSlice = Array.prototype.slice; +var hasOwn = Object.prototype.hasOwnProperty; + +// 1. The assert module provides functions that throw +// AssertionError's when particular conditions are not met. The +// assert module must conform to the following interface. + +var assert = module.exports = ok; + +// 2. The AssertionError is defined in assert. +// new assert.AssertionError({ message: message, +// actual: actual, +// expected: expected }) + +assert.AssertionError = function AssertionError(options) { + this.name = 'AssertionError'; + this.actual = options.actual; + this.expected = options.expected; + this.operator = options.operator; + if (options.message) { + this.message = options.message; + this.generatedMessage = false; + } else { + this.message = getMessage(this); + this.generatedMessage = true; + } + var stackStartFunction = options.stackStartFunction || fail; + + if (Error.captureStackTrace) { + Error.captureStackTrace(this, stackStartFunction); + } + else { + // non v8 browsers so we can have a stacktrace + var err = new Error(); + if (err.stack) { + var out = err.stack; + + // try to strip useless frames + var fn_name = stackStartFunction.name; + var idx = out.indexOf('\n' + fn_name); + if (idx >= 0) { + // once we have located the function frame + // we need to strip out everything before it (and its line) + var next_line = out.indexOf('\n', idx + 1); + out = out.substring(next_line + 1); + } + + this.stack = out; + } + } +}; + +// assert.AssertionError instanceof Error +util.inherits(assert.AssertionError, Error); + +function replacer(key, value) { + if (util.isUndefined(value)) { + return '' + value; + } + if (util.isNumber(value) && !isFinite(value)) { + return value.toString(); + } + if (util.isFunction(value) || util.isRegExp(value)) { + return value.toString(); + } + return value; +} + +function truncate(s, n) { + if (util.isString(s)) { + return s.length < n ? s : s.slice(0, n); + } else { + return s; + } +} + +function getMessage(self) { + return truncate(JSON.stringify(self.actual, replacer), 128) + ' ' + + self.operator + ' ' + + truncate(JSON.stringify(self.expected, replacer), 128); +} + +// At present only the three keys mentioned above are used and +// understood by the spec. Implementations or sub modules can pass +// other keys to the AssertionError's constructor - they will be +// ignored. + +// 3. All of the following functions must throw an AssertionError +// when a corresponding condition is not met, with a message that +// may be undefined if not provided. All assertion methods provide +// both the actual and expected values to the assertion error for +// display purposes. + +function fail(actual, expected, message, operator, stackStartFunction) { + throw new assert.AssertionError({ + message: message, + actual: actual, + expected: expected, + operator: operator, + stackStartFunction: stackStartFunction + }); +} + +// EXTENSION! allows for well behaved errors defined elsewhere. +assert.fail = fail; + +// 4. Pure assertion tests whether a value is truthy, as determined +// by !!guard. +// assert.ok(guard, message_opt); +// This statement is equivalent to assert.equal(true, !!guard, +// message_opt);. To test strictly for the value true, use +// assert.strictEqual(true, guard, message_opt);. + +function ok(value, message) { + if (!value) fail(value, true, message, '==', assert.ok); +} +assert.ok = ok; + +// 5. The equality assertion tests shallow, coercive equality with +// ==. +// assert.equal(actual, expected, message_opt); + +assert.equal = function equal(actual, expected, message) { + if (actual != expected) fail(actual, expected, message, '==', assert.equal); +}; + +// 6. The non-equality assertion tests for whether two objects are not equal +// with != assert.notEqual(actual, expected, message_opt); + +assert.notEqual = function notEqual(actual, expected, message) { + if (actual == expected) { + fail(actual, expected, message, '!=', assert.notEqual); + } +}; + +// 7. The equivalence assertion tests a deep equality relation. +// assert.deepEqual(actual, expected, message_opt); + +assert.deepEqual = function deepEqual(actual, expected, message) { + if (!_deepEqual(actual, expected)) { + fail(actual, expected, message, 'deepEqual', assert.deepEqual); + } +}; + +function _deepEqual(actual, expected) { + // 7.1. All identical values are equivalent, as determined by ===. + if (actual === expected) { + return true; + + } else if (util.isBuffer(actual) && util.isBuffer(expected)) { + if (actual.length != expected.length) return false; + + for (var i = 0; i < actual.length; i++) { + if (actual[i] !== expected[i]) return false; + } + + return true; + + // 7.2. If the expected value is a Date object, the actual value is + // equivalent if it is also a Date object that refers to the same time. + } else if (util.isDate(actual) && util.isDate(expected)) { + return actual.getTime() === expected.getTime(); + + // 7.3 If the expected value is a RegExp object, the actual value is + // equivalent if it is also a RegExp object with the same source and + // properties (`global`, `multiline`, `lastIndex`, `ignoreCase`). + } else if (util.isRegExp(actual) && util.isRegExp(expected)) { + return actual.source === expected.source && + actual.global === expected.global && + actual.multiline === expected.multiline && + actual.lastIndex === expected.lastIndex && + actual.ignoreCase === expected.ignoreCase; + + // 7.4. Other pairs that do not both pass typeof value == 'object', + // equivalence is determined by ==. + } else if (!util.isObject(actual) && !util.isObject(expected)) { + return actual == expected; + + // 7.5 For all other Object pairs, including Array objects, equivalence is + // determined by having the same number of owned properties (as verified + // with Object.prototype.hasOwnProperty.call), the same set of keys + // (although not necessarily the same order), equivalent values for every + // corresponding key, and an identical 'prototype' property. Note: this + // accounts for both named and indexed properties on Arrays. + } else { + return objEquiv(actual, expected); + } +} + +function isArguments(object) { + return Object.prototype.toString.call(object) == '[object Arguments]'; +} + +function objEquiv(a, b) { + if (util.isNullOrUndefined(a) || util.isNullOrUndefined(b)) + return false; + // an identical 'prototype' property. + if (a.prototype !== b.prototype) return false; + // if one is a primitive, the other must be same + if (util.isPrimitive(a) || util.isPrimitive(b)) { + return a === b; + } + var aIsArgs = isArguments(a), + bIsArgs = isArguments(b); + if ((aIsArgs && !bIsArgs) || (!aIsArgs && bIsArgs)) + return false; + if (aIsArgs) { + a = pSlice.call(a); + b = pSlice.call(b); + return _deepEqual(a, b); + } + var ka = objectKeys(a), + kb = objectKeys(b), + key, i; + // having the same number of owned properties (keys incorporates + // hasOwnProperty) + if (ka.length != kb.length) + return false; + //the same set of keys (although not necessarily the same order), + ka.sort(); + kb.sort(); + //~~~cheap key test + for (i = ka.length - 1; i >= 0; i--) { + if (ka[i] != kb[i]) + return false; + } + //equivalent values for every corresponding key, and + //~~~possibly expensive deep test + for (i = ka.length - 1; i >= 0; i--) { + key = ka[i]; + if (!_deepEqual(a[key], b[key])) return false; + } + return true; +} + +// 8. The non-equivalence assertion tests for any deep inequality. +// assert.notDeepEqual(actual, expected, message_opt); + +assert.notDeepEqual = function notDeepEqual(actual, expected, message) { + if (_deepEqual(actual, expected)) { + fail(actual, expected, message, 'notDeepEqual', assert.notDeepEqual); + } +}; + +// 9. The strict equality assertion tests strict equality, as determined by ===. +// assert.strictEqual(actual, expected, message_opt); + +assert.strictEqual = function strictEqual(actual, expected, message) { + if (actual !== expected) { + fail(actual, expected, message, '===', assert.strictEqual); + } +}; + +// 10. The strict non-equality assertion tests for strict inequality, as +// determined by !==. assert.notStrictEqual(actual, expected, message_opt); + +assert.notStrictEqual = function notStrictEqual(actual, expected, message) { + if (actual === expected) { + fail(actual, expected, message, '!==', assert.notStrictEqual); + } +}; + +function expectedException(actual, expected) { + if (!actual || !expected) { + return false; + } + + if (Object.prototype.toString.call(expected) == '[object RegExp]') { + return expected.test(actual); + } else if (actual instanceof expected) { + return true; + } else if (expected.call({}, actual) === true) { + return true; + } + + return false; +} + +function _throws(shouldThrow, block, expected, message) { + var actual; + + if (util.isString(expected)) { + message = expected; + expected = null; + } + + try { + block(); + } catch (e) { + actual = e; + } + + message = (expected && expected.name ? ' (' + expected.name + ').' : '.') + + (message ? ' ' + message : '.'); + + if (shouldThrow && !actual) { + fail(actual, expected, 'Missing expected exception' + message); + } + + if (!shouldThrow && expectedException(actual, expected)) { + fail(actual, expected, 'Got unwanted exception' + message); + } + + if ((shouldThrow && actual && expected && + !expectedException(actual, expected)) || (!shouldThrow && actual)) { + throw actual; + } +} + +// 11. Expected to throw an error: +// assert.throws(block, Error_opt, message_opt); + +assert.throws = function(block, /*optional*/error, /*optional*/message) { + _throws.apply(this, [true].concat(pSlice.call(arguments))); +}; + +// EXTENSION! This is annoying to write outside this module. +assert.doesNotThrow = function(block, /*optional*/message) { + _throws.apply(this, [false].concat(pSlice.call(arguments))); +}; + +assert.ifError = function(err) { if (err) {throw err;}}; + +var objectKeys = Object.keys || function (obj) { + var keys = []; + for (var key in obj) { + if (hasOwn.call(obj, key)) keys.push(key); + } + return keys; +}; + +},{"util/":28}],10:[function(require,module,exports){ +'use strict'; +module.exports = balanced; +function balanced(a, b, str) { + if (a instanceof RegExp) a = maybeMatch(a, str); + if (b instanceof RegExp) b = maybeMatch(b, str); + + var r = range(a, b, str); + + return r && { + start: r[0], + end: r[1], + pre: str.slice(0, r[0]), + body: str.slice(r[0] + a.length, r[1]), + post: str.slice(r[1] + b.length) + }; +} + +function maybeMatch(reg, str) { + var m = str.match(reg); + return m ? m[0] : null; +} + +balanced.range = range; +function range(a, b, str) { + var begs, beg, left, right, result; + var ai = str.indexOf(a); + var bi = str.indexOf(b, ai + 1); + var i = ai; + + if (ai >= 0 && bi > 0) { + begs = []; + left = str.length; + + while (i >= 0 && !result) { + if (i == ai) { + begs.push(i); + ai = str.indexOf(a, i + 1); + } else if (begs.length == 1) { + result = [ begs.pop(), bi ]; + } else { + beg = begs.pop(); + if (beg < left) { + left = beg; + right = bi; + } + + bi = str.indexOf(b, i + 1); + } + + i = ai < bi && ai >= 0 ? ai : bi; + } + + if (begs.length) { + result = [ left, right ]; + } + } + + return result; +} + +},{}],11:[function(require,module,exports){ +var concatMap = require('concat-map'); +var balanced = require('balanced-match'); + +module.exports = expandTop; + +var escSlash = '\0SLASH'+Math.random()+'\0'; +var escOpen = '\0OPEN'+Math.random()+'\0'; +var escClose = '\0CLOSE'+Math.random()+'\0'; +var escComma = '\0COMMA'+Math.random()+'\0'; +var escPeriod = '\0PERIOD'+Math.random()+'\0'; + +function numeric(str) { + return parseInt(str, 10) == str + ? parseInt(str, 10) + : str.charCodeAt(0); +} + +function escapeBraces(str) { + return str.split('\\\\').join(escSlash) + .split('\\{').join(escOpen) + .split('\\}').join(escClose) + .split('\\,').join(escComma) + .split('\\.').join(escPeriod); +} + +function unescapeBraces(str) { + return str.split(escSlash).join('\\') + .split(escOpen).join('{') + .split(escClose).join('}') + .split(escComma).join(',') + .split(escPeriod).join('.'); +} + + +// Basically just str.split(","), but handling cases +// where we have nested braced sections, which should be +// treated as individual members, like {a,{b,c},d} +function parseCommaParts(str) { + if (!str) + return ['']; + + var parts = []; + var m = balanced('{', '}', str); + + if (!m) + return str.split(','); + + var pre = m.pre; + var body = m.body; + var post = m.post; + var p = pre.split(','); + + p[p.length-1] += '{' + body + '}'; + var postParts = parseCommaParts(post); + if (post.length) { + p[p.length-1] += postParts.shift(); + p.push.apply(p, postParts); + } + + parts.push.apply(parts, p); + + return parts; +} + +function expandTop(str) { + if (!str) + return []; + + // I don't know why Bash 4.3 does this, but it does. + // Anything starting with {} will have the first two bytes preserved + // but *only* at the top level, so {},a}b will not expand to anything, + // but a{},b}c will be expanded to [a}c,abc]. + // One could argue that this is a bug in Bash, but since the goal of + // this module is to match Bash's rules, we escape a leading {} + if (str.substr(0, 2) === '{}') { + str = '\\{\\}' + str.substr(2); + } + + return expand(escapeBraces(str), true).map(unescapeBraces); +} + +function identity(e) { + return e; +} + +function embrace(str) { + return '{' + str + '}'; +} +function isPadded(el) { + return /^-?0\d/.test(el); +} + +function lte(i, y) { + return i <= y; +} +function gte(i, y) { + return i >= y; +} + +function expand(str, isTop) { + var expansions = []; + + var m = balanced('{', '}', str); + if (!m || /\$$/.test(m.pre)) return [str]; + + var isNumericSequence = /^-?\d+\.\.-?\d+(?:\.\.-?\d+)?$/.test(m.body); + var isAlphaSequence = /^[a-zA-Z]\.\.[a-zA-Z](?:\.\.-?\d+)?$/.test(m.body); + var isSequence = isNumericSequence || isAlphaSequence; + var isOptions = m.body.indexOf(',') >= 0; + if (!isSequence && !isOptions) { + // {a},b} + if (m.post.match(/,.*\}/)) { + str = m.pre + '{' + m.body + escClose + m.post; + return expand(str); + } + return [str]; + } + + var n; + if (isSequence) { + n = m.body.split(/\.\./); + } else { + n = parseCommaParts(m.body); + if (n.length === 1) { + // x{{a,b}}y ==> x{a}y x{b}y + n = expand(n[0], false).map(embrace); + if (n.length === 1) { + var post = m.post.length + ? expand(m.post, false) + : ['']; + return post.map(function(p) { + return m.pre + n[0] + p; + }); + } + } + } + + // at this point, n is the parts, and we know it's not a comma set + // with a single entry. + + // no need to expand pre, since it is guaranteed to be free of brace-sets + var pre = m.pre; + var post = m.post.length + ? expand(m.post, false) + : ['']; + + var N; + + if (isSequence) { + var x = numeric(n[0]); + var y = numeric(n[1]); + var width = Math.max(n[0].length, n[1].length) + var incr = n.length == 3 + ? Math.abs(numeric(n[2])) + : 1; + var test = lte; + var reverse = y < x; + if (reverse) { + incr *= -1; + test = gte; + } + var pad = n.some(isPadded); + + N = []; + + for (var i = x; test(i, y); i += incr) { + var c; + if (isAlphaSequence) { + c = String.fromCharCode(i); + if (c === '\\') + c = ''; + } else { + c = String(i); + if (pad) { + var need = width - c.length; + if (need > 0) { + var z = new Array(need + 1).join('0'); + if (i < 0) + c = '-' + z + c.slice(1); + else + c = z + c; + } + } + } + N.push(c); + } + } else { + N = concatMap(n, function(el) { return expand(el, false) }); + } + + for (var j = 0; j < N.length; j++) { + for (var k = 0; k < post.length; k++) { + var expansion = pre + N[j] + post[k]; + if (!isTop || isSequence || expansion) + expansions.push(expansion); + } + } + + return expansions; +} + + +},{"balanced-match":10,"concat-map":13}],12:[function(require,module,exports){ + +},{}],13:[function(require,module,exports){ +module.exports = function (xs, fn) { + var res = []; + for (var i = 0; i < xs.length; i++) { + var x = fn(xs[i], i); + if (isArray(x)) res.push.apply(res, x); + else res.push(x); + } + return res; +}; + +var isArray = Array.isArray || function (xs) { + return Object.prototype.toString.call(xs) === '[object Array]'; +}; + +},{}],14:[function(require,module,exports){ +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. + +function EventEmitter() { + this._events = this._events || {}; + this._maxListeners = this._maxListeners || undefined; +} +module.exports = EventEmitter; + +// Backwards-compat with node 0.10.x +EventEmitter.EventEmitter = EventEmitter; + +EventEmitter.prototype._events = undefined; +EventEmitter.prototype._maxListeners = undefined; + +// By default EventEmitters will print a warning if more than 10 listeners are +// added to it. This is a useful default which helps finding memory leaks. +EventEmitter.defaultMaxListeners = 10; + +// Obviously not all Emitters should be limited to 10. This function allows +// that to be increased. Set to zero for unlimited. +EventEmitter.prototype.setMaxListeners = function(n) { + if (!isNumber(n) || n < 0 || isNaN(n)) + throw TypeError('n must be a positive number'); + this._maxListeners = n; + return this; +}; + +EventEmitter.prototype.emit = function(type) { + var er, handler, len, args, i, listeners; + + if (!this._events) + this._events = {}; + + // If there is no 'error' event listener then throw. + if (type === 'error') { + if (!this._events.error || + (isObject(this._events.error) && !this._events.error.length)) { + er = arguments[1]; + if (er instanceof Error) { + throw er; // Unhandled 'error' event + } + throw TypeError('Uncaught, unspecified "error" event.'); + } + } + + handler = this._events[type]; + + if (isUndefined(handler)) + return false; + + if (isFunction(handler)) { + switch (arguments.length) { + // fast cases + case 1: + handler.call(this); + break; + case 2: + handler.call(this, arguments[1]); + break; + case 3: + handler.call(this, arguments[1], arguments[2]); + break; + // slower + default: + len = arguments.length; + args = new Array(len - 1); + for (i = 1; i < len; i++) + args[i - 1] = arguments[i]; + handler.apply(this, args); + } + } else if (isObject(handler)) { + len = arguments.length; + args = new Array(len - 1); + for (i = 1; i < len; i++) + args[i - 1] = arguments[i]; + + listeners = handler.slice(); + len = listeners.length; + for (i = 0; i < len; i++) + listeners[i].apply(this, args); + } + + return true; +}; + +EventEmitter.prototype.addListener = function(type, listener) { + var m; + + if (!isFunction(listener)) + throw TypeError('listener must be a function'); + + if (!this._events) + this._events = {}; + + // To avoid recursion in the case that type === "newListener"! Before + // adding it to the listeners, first emit "newListener". + if (this._events.newListener) + this.emit('newListener', type, + isFunction(listener.listener) ? + listener.listener : listener); + + if (!this._events[type]) + // Optimize the case of one listener. Don't need the extra array object. + this._events[type] = listener; + else if (isObject(this._events[type])) + // If we've already got an array, just append. + this._events[type].push(listener); + else + // Adding the second element, need to change to array. + this._events[type] = [this._events[type], listener]; + + // Check for listener leak + if (isObject(this._events[type]) && !this._events[type].warned) { + var m; + if (!isUndefined(this._maxListeners)) { + m = this._maxListeners; + } else { + m = EventEmitter.defaultMaxListeners; + } + + if (m && m > 0 && this._events[type].length > m) { + this._events[type].warned = true; + console.error('(node) warning: possible EventEmitter memory ' + + 'leak detected. %d listeners added. ' + + 'Use emitter.setMaxListeners() to increase limit.', + this._events[type].length); + if (typeof console.trace === 'function') { + // not supported in IE 10 + console.trace(); + } + } + } + + return this; +}; + +EventEmitter.prototype.on = EventEmitter.prototype.addListener; + +EventEmitter.prototype.once = function(type, listener) { + if (!isFunction(listener)) + throw TypeError('listener must be a function'); + + var fired = false; + + function g() { + this.removeListener(type, g); + + if (!fired) { + fired = true; + listener.apply(this, arguments); + } + } + + g.listener = listener; + this.on(type, g); + + return this; +}; + +// emits a 'removeListener' event iff the listener was removed +EventEmitter.prototype.removeListener = function(type, listener) { + var list, position, length, i; + + if (!isFunction(listener)) + throw TypeError('listener must be a function'); + + if (!this._events || !this._events[type]) + return this; + + list = this._events[type]; + length = list.length; + position = -1; + + if (list === listener || + (isFunction(list.listener) && list.listener === listener)) { + delete this._events[type]; + if (this._events.removeListener) + this.emit('removeListener', type, listener); + + } else if (isObject(list)) { + for (i = length; i-- > 0;) { + if (list[i] === listener || + (list[i].listener && list[i].listener === listener)) { + position = i; + break; + } + } + + if (position < 0) + return this; + + if (list.length === 1) { + list.length = 0; + delete this._events[type]; + } else { + list.splice(position, 1); + } + + if (this._events.removeListener) + this.emit('removeListener', type, listener); + } + + return this; +}; + +EventEmitter.prototype.removeAllListeners = function(type) { + var key, listeners; + + if (!this._events) + return this; + + // not listening for removeListener, no need to emit + if (!this._events.removeListener) { + if (arguments.length === 0) + this._events = {}; + else if (this._events[type]) + delete this._events[type]; + return this; + } + + // emit removeListener for all listeners on all events + if (arguments.length === 0) { + for (key in this._events) { + if (key === 'removeListener') continue; + this.removeAllListeners(key); + } + this.removeAllListeners('removeListener'); + this._events = {}; + return this; + } + + listeners = this._events[type]; + + if (isFunction(listeners)) { + this.removeListener(type, listeners); + } else { + // LIFO order + while (listeners.length) + this.removeListener(type, listeners[listeners.length - 1]); + } + delete this._events[type]; + + return this; +}; + +EventEmitter.prototype.listeners = function(type) { + var ret; + if (!this._events || !this._events[type]) + ret = []; + else if (isFunction(this._events[type])) + ret = [this._events[type]]; + else + ret = this._events[type].slice(); + return ret; +}; + +EventEmitter.listenerCount = function(emitter, type) { + var ret; + if (!emitter._events || !emitter._events[type]) + ret = 0; + else if (isFunction(emitter._events[type])) + ret = 1; + else + ret = emitter._events[type].length; + return ret; +}; + +function isFunction(arg) { + return typeof arg === 'function'; +} + +function isNumber(arg) { + return typeof arg === 'number'; +} + +function isObject(arg) { + return typeof arg === 'object' && arg !== null; +} + +function isUndefined(arg) { + return arg === void 0; +} + +},{}],15:[function(require,module,exports){ +(function (process){ +exports.alphasort = alphasort +exports.alphasorti = alphasorti +exports.setopts = setopts +exports.ownProp = ownProp +exports.makeAbs = makeAbs +exports.finish = finish +exports.mark = mark +exports.isIgnored = isIgnored +exports.childrenIgnored = childrenIgnored + +function ownProp (obj, field) { + return Object.prototype.hasOwnProperty.call(obj, field) +} + +var path = require("path") +var minimatch = require("minimatch") +var isAbsolute = require("path-is-absolute") +var Minimatch = minimatch.Minimatch + +function alphasorti (a, b) { + return a.toLowerCase().localeCompare(b.toLowerCase()) +} + +function alphasort (a, b) { + return a.localeCompare(b) +} + +function setupIgnores (self, options) { + self.ignore = options.ignore || [] + + if (!Array.isArray(self.ignore)) + self.ignore = [self.ignore] + + if (self.ignore.length) { + self.ignore = self.ignore.map(ignoreMap) + } +} + +function ignoreMap (pattern) { + var gmatcher = null + if (pattern.slice(-3) === '/**') { + var gpattern = pattern.replace(/(\/\*\*)+$/, '') + gmatcher = new Minimatch(gpattern) + } + + return { + matcher: new Minimatch(pattern), + gmatcher: gmatcher + } +} + +function setopts (self, pattern, options) { + if (!options) + options = {} + + // base-matching: just use globstar for that. + if (options.matchBase && -1 === pattern.indexOf("/")) { + if (options.noglobstar) { + throw new Error("base matching requires globstar") + } + pattern = "**/" + pattern + } + + self.silent = !!options.silent + self.pattern = pattern + self.strict = options.strict !== false + self.realpath = !!options.realpath + self.realpathCache = options.realpathCache || Object.create(null) + self.follow = !!options.follow + self.dot = !!options.dot + self.mark = !!options.mark + self.nodir = !!options.nodir + if (self.nodir) + self.mark = true + self.sync = !!options.sync + self.nounique = !!options.nounique + self.nonull = !!options.nonull + self.nosort = !!options.nosort + self.nocase = !!options.nocase + self.stat = !!options.stat + self.noprocess = !!options.noprocess + + self.maxLength = options.maxLength || Infinity + self.cache = options.cache || Object.create(null) + self.statCache = options.statCache || Object.create(null) + self.symlinks = options.symlinks || Object.create(null) + + setupIgnores(self, options) + + self.changedCwd = false + var cwd = process.cwd() + if (!ownProp(options, "cwd")) + self.cwd = cwd + else { + self.cwd = options.cwd + self.changedCwd = path.resolve(options.cwd) !== cwd + } + + self.root = options.root || path.resolve(self.cwd, "/") + self.root = path.resolve(self.root) + if (process.platform === "win32") + self.root = self.root.replace(/\\/g, "/") + + self.nomount = !!options.nomount + + // disable comments and negation unless the user explicitly + // passes in false as the option. + options.nonegate = options.nonegate === false ? false : true + options.nocomment = options.nocomment === false ? false : true + deprecationWarning(options) + + self.minimatch = new Minimatch(pattern, options) + self.options = self.minimatch.options +} + +// TODO(isaacs): remove entirely in v6 +// exported to reset in tests +exports.deprecationWarned +function deprecationWarning(options) { + if (!options.nonegate || !options.nocomment) { + if (process.noDeprecation !== true && !exports.deprecationWarned) { + var msg = 'glob WARNING: comments and negation will be disabled in v6' + if (process.throwDeprecation) + throw new Error(msg) + else if (process.traceDeprecation) + console.trace(msg) + else + console.error(msg) + + exports.deprecationWarned = true + } + } +} + +function finish (self) { + var nou = self.nounique + var all = nou ? [] : Object.create(null) + + for (var i = 0, l = self.matches.length; i < l; i ++) { + var matches = self.matches[i] + if (!matches || Object.keys(matches).length === 0) { + if (self.nonull) { + // do like the shell, and spit out the literal glob + var literal = self.minimatch.globSet[i] + if (nou) + all.push(literal) + else + all[literal] = true + } + } else { + // had matches + var m = Object.keys(matches) + if (nou) + all.push.apply(all, m) + else + m.forEach(function (m) { + all[m] = true + }) + } + } + + if (!nou) + all = Object.keys(all) + + if (!self.nosort) + all = all.sort(self.nocase ? alphasorti : alphasort) + + // at *some* point we statted all of these + if (self.mark) { + for (var i = 0; i < all.length; i++) { + all[i] = self._mark(all[i]) + } + if (self.nodir) { + all = all.filter(function (e) { + return !(/\/$/.test(e)) + }) + } + } + + if (self.ignore.length) + all = all.filter(function(m) { + return !isIgnored(self, m) + }) + + self.found = all +} + +function mark (self, p) { + var abs = makeAbs(self, p) + var c = self.cache[abs] + var m = p + if (c) { + var isDir = c === 'DIR' || Array.isArray(c) + var slash = p.slice(-1) === '/' + + if (isDir && !slash) + m += '/' + else if (!isDir && slash) + m = m.slice(0, -1) + + if (m !== p) { + var mabs = makeAbs(self, m) + self.statCache[mabs] = self.statCache[abs] + self.cache[mabs] = self.cache[abs] + } + } + + return m +} + +// lotta situps... +function makeAbs (self, f) { + var abs = f + if (f.charAt(0) === '/') { + abs = path.join(self.root, f) + } else if (isAbsolute(f) || f === '') { + abs = f + } else if (self.changedCwd) { + abs = path.resolve(self.cwd, f) + } else { + abs = path.resolve(f) + } + return abs +} + + +// Return true, if pattern ends with globstar '**', for the accompanying parent directory. +// Ex:- If node_modules/** is the pattern, add 'node_modules' to ignore list along with it's contents +function isIgnored (self, path) { + if (!self.ignore.length) + return false + + return self.ignore.some(function(item) { + return item.matcher.match(path) || !!(item.gmatcher && item.gmatcher.match(path)) + }) +} + +function childrenIgnored (self, path) { + if (!self.ignore.length) + return false + + return self.ignore.some(function(item) { + return !!(item.gmatcher && item.gmatcher.match(path)) + }) +} + +}).call(this,require('_process')) +},{"_process":24,"minimatch":20,"path":22,"path-is-absolute":23}],16:[function(require,module,exports){ +(function (process){ +// Approach: +// +// 1. Get the minimatch set +// 2. For each pattern in the set, PROCESS(pattern, false) +// 3. Store matches per-set, then uniq them +// +// PROCESS(pattern, inGlobStar) +// Get the first [n] items from pattern that are all strings +// Join these together. This is PREFIX. +// If there is no more remaining, then stat(PREFIX) and +// add to matches if it succeeds. END. +// +// If inGlobStar and PREFIX is symlink and points to dir +// set ENTRIES = [] +// else readdir(PREFIX) as ENTRIES +// If fail, END +// +// with ENTRIES +// If pattern[n] is GLOBSTAR +// // handle the case where the globstar match is empty +// // by pruning it out, and testing the resulting pattern +// PROCESS(pattern[0..n] + pattern[n+1 .. $], false) +// // handle other cases. +// for ENTRY in ENTRIES (not dotfiles) +// // attach globstar + tail onto the entry +// // Mark that this entry is a globstar match +// PROCESS(pattern[0..n] + ENTRY + pattern[n .. $], true) +// +// else // not globstar +// for ENTRY in ENTRIES (not dotfiles, unless pattern[n] is dot) +// Test ENTRY against pattern[n] +// If fails, continue +// If passes, PROCESS(pattern[0..n] + item + pattern[n+1 .. $]) +// +// Caveat: +// Cache all stats and readdirs results to minimize syscall. Since all +// we ever care about is existence and directory-ness, we can just keep +// `true` for files, and [children,...] for directories, or `false` for +// things that don't exist. + +module.exports = glob + +var fs = require('fs') +var minimatch = require('minimatch') +var Minimatch = minimatch.Minimatch +var inherits = require('inherits') +var EE = require('events').EventEmitter +var path = require('path') +var assert = require('assert') +var isAbsolute = require('path-is-absolute') +var globSync = require('./sync.js') +var common = require('./common.js') +var alphasort = common.alphasort +var alphasorti = common.alphasorti +var setopts = common.setopts +var ownProp = common.ownProp +var inflight = require('inflight') +var util = require('util') +var childrenIgnored = common.childrenIgnored +var isIgnored = common.isIgnored + +var once = require('once') + +function glob (pattern, options, cb) { + if (typeof options === 'function') cb = options, options = {} + if (!options) options = {} + + if (options.sync) { + if (cb) + throw new TypeError('callback provided to sync glob') + return globSync(pattern, options) + } + + return new Glob(pattern, options, cb) +} + +glob.sync = globSync +var GlobSync = glob.GlobSync = globSync.GlobSync + +// old api surface +glob.glob = glob + +glob.hasMagic = function (pattern, options_) { + var options = util._extend({}, options_) + options.noprocess = true + + var g = new Glob(pattern, options) + var set = g.minimatch.set + if (set.length > 1) + return true + + for (var j = 0; j < set[0].length; j++) { + if (typeof set[0][j] !== 'string') + return true + } + + return false +} + +glob.Glob = Glob +inherits(Glob, EE) +function Glob (pattern, options, cb) { + if (typeof options === 'function') { + cb = options + options = null + } + + if (options && options.sync) { + if (cb) + throw new TypeError('callback provided to sync glob') + return new GlobSync(pattern, options) + } + + if (!(this instanceof Glob)) + return new Glob(pattern, options, cb) + + setopts(this, pattern, options) + this._didRealPath = false + + // process each pattern in the minimatch set + var n = this.minimatch.set.length + + // The matches are stored as {: true,...} so that + // duplicates are automagically pruned. + // Later, we do an Object.keys() on these. + // Keep them as a list so we can fill in when nonull is set. + this.matches = new Array(n) + + if (typeof cb === 'function') { + cb = once(cb) + this.on('error', cb) + this.on('end', function (matches) { + cb(null, matches) + }) + } + + var self = this + var n = this.minimatch.set.length + this._processing = 0 + this.matches = new Array(n) + + this._emitQueue = [] + this._processQueue = [] + this.paused = false + + if (this.noprocess) + return this + + if (n === 0) + return done() + + for (var i = 0; i < n; i ++) { + this._process(this.minimatch.set[i], i, false, done) + } + + function done () { + --self._processing + if (self._processing <= 0) + self._finish() + } +} + +Glob.prototype._finish = function () { + assert(this instanceof Glob) + if (this.aborted) + return + + if (this.realpath && !this._didRealpath) + return this._realpath() + + common.finish(this) + this.emit('end', this.found) +} + +Glob.prototype._realpath = function () { + if (this._didRealpath) + return + + this._didRealpath = true + + var n = this.matches.length + if (n === 0) + return this._finish() + + var self = this + for (var i = 0; i < this.matches.length; i++) + this._realpathSet(i, next) + + function next () { + if (--n === 0) + self._finish() + } +} + +Glob.prototype._realpathSet = function (index, cb) { + var matchset = this.matches[index] + if (!matchset) + return cb() + + var found = Object.keys(matchset) + var self = this + var n = found.length + + if (n === 0) + return cb() + + var set = this.matches[index] = Object.create(null) + found.forEach(function (p, i) { + // If there's a problem with the stat, then it means that + // one or more of the links in the realpath couldn't be + // resolved. just return the abs value in that case. + p = self._makeAbs(p) + fs.realpath(p, self.realpathCache, function (er, real) { + if (!er) + set[real] = true + else if (er.syscall === 'stat') + set[p] = true + else + self.emit('error', er) // srsly wtf right here + + if (--n === 0) { + self.matches[index] = set + cb() + } + }) + }) +} + +Glob.prototype._mark = function (p) { + return common.mark(this, p) +} + +Glob.prototype._makeAbs = function (f) { + return common.makeAbs(this, f) +} + +Glob.prototype.abort = function () { + this.aborted = true + this.emit('abort') +} + +Glob.prototype.pause = function () { + if (!this.paused) { + this.paused = true + this.emit('pause') + } +} + +Glob.prototype.resume = function () { + if (this.paused) { + this.emit('resume') + this.paused = false + if (this._emitQueue.length) { + var eq = this._emitQueue.slice(0) + this._emitQueue.length = 0 + for (var i = 0; i < eq.length; i ++) { + var e = eq[i] + this._emitMatch(e[0], e[1]) + } + } + if (this._processQueue.length) { + var pq = this._processQueue.slice(0) + this._processQueue.length = 0 + for (var i = 0; i < pq.length; i ++) { + var p = pq[i] + this._processing-- + this._process(p[0], p[1], p[2], p[3]) + } + } + } +} + +Glob.prototype._process = function (pattern, index, inGlobStar, cb) { + assert(this instanceof Glob) + assert(typeof cb === 'function') + + if (this.aborted) + return + + this._processing++ + if (this.paused) { + this._processQueue.push([pattern, index, inGlobStar, cb]) + return + } + + //console.error('PROCESS %d', this._processing, pattern) + + // Get the first [n] parts of pattern that are all strings. + var n = 0 + while (typeof pattern[n] === 'string') { + n ++ + } + // now n is the index of the first one that is *not* a string. + + // see if there's anything else + var prefix + switch (n) { + // if not, then this is rather simple + case pattern.length: + this._processSimple(pattern.join('/'), index, cb) + return + + case 0: + // pattern *starts* with some non-trivial item. + // going to readdir(cwd), but not include the prefix in matches. + prefix = null + break + + default: + // pattern has some string bits in the front. + // whatever it starts with, whether that's 'absolute' like /foo/bar, + // or 'relative' like '../baz' + prefix = pattern.slice(0, n).join('/') + break + } + + var remain = pattern.slice(n) + + // get the list of entries. + var read + if (prefix === null) + read = '.' + else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) { + if (!prefix || !isAbsolute(prefix)) + prefix = '/' + prefix + read = prefix + } else + read = prefix + + var abs = this._makeAbs(read) + + //if ignored, skip _processing + if (childrenIgnored(this, read)) + return cb() + + var isGlobStar = remain[0] === minimatch.GLOBSTAR + if (isGlobStar) + this._processGlobStar(prefix, read, abs, remain, index, inGlobStar, cb) + else + this._processReaddir(prefix, read, abs, remain, index, inGlobStar, cb) +} + +Glob.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar, cb) { + var self = this + this._readdir(abs, inGlobStar, function (er, entries) { + return self._processReaddir2(prefix, read, abs, remain, index, inGlobStar, entries, cb) + }) +} + +Glob.prototype._processReaddir2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) { + + // if the abs isn't a dir, then nothing can match! + if (!entries) + return cb() + + // It will only match dot entries if it starts with a dot, or if + // dot is set. Stuff like @(.foo|.bar) isn't allowed. + var pn = remain[0] + var negate = !!this.minimatch.negate + var rawGlob = pn._glob + var dotOk = this.dot || rawGlob.charAt(0) === '.' + + var matchedEntries = [] + for (var i = 0; i < entries.length; i++) { + var e = entries[i] + if (e.charAt(0) !== '.' || dotOk) { + var m + if (negate && !prefix) { + m = !e.match(pn) + } else { + m = e.match(pn) + } + if (m) + matchedEntries.push(e) + } + } + + //console.error('prd2', prefix, entries, remain[0]._glob, matchedEntries) + + var len = matchedEntries.length + // If there are no matched entries, then nothing matches. + if (len === 0) + return cb() + + // if this is the last remaining pattern bit, then no need for + // an additional stat *unless* the user has specified mark or + // stat explicitly. We know they exist, since readdir returned + // them. + + if (remain.length === 1 && !this.mark && !this.stat) { + if (!this.matches[index]) + this.matches[index] = Object.create(null) + + for (var i = 0; i < len; i ++) { + var e = matchedEntries[i] + if (prefix) { + if (prefix !== '/') + e = prefix + '/' + e + else + e = prefix + e + } + + if (e.charAt(0) === '/' && !this.nomount) { + e = path.join(this.root, e) + } + this._emitMatch(index, e) + } + // This was the last one, and no stats were needed + return cb() + } + + // now test all matched entries as stand-ins for that part + // of the pattern. + remain.shift() + for (var i = 0; i < len; i ++) { + var e = matchedEntries[i] + var newPattern + if (prefix) { + if (prefix !== '/') + e = prefix + '/' + e + else + e = prefix + e + } + this._process([e].concat(remain), index, inGlobStar, cb) + } + cb() +} + +Glob.prototype._emitMatch = function (index, e) { + if (this.aborted) + return + + if (this.matches[index][e]) + return + + if (isIgnored(this, e)) + return + + if (this.paused) { + this._emitQueue.push([index, e]) + return + } + + var abs = this._makeAbs(e) + + if (this.nodir) { + var c = this.cache[abs] + if (c === 'DIR' || Array.isArray(c)) + return + } + + if (this.mark) + e = this._mark(e) + + this.matches[index][e] = true + + var st = this.statCache[abs] + if (st) + this.emit('stat', e, st) + + this.emit('match', e) +} + +Glob.prototype._readdirInGlobStar = function (abs, cb) { + if (this.aborted) + return + + // follow all symlinked directories forever + // just proceed as if this is a non-globstar situation + if (this.follow) + return this._readdir(abs, false, cb) + + var lstatkey = 'lstat\0' + abs + var self = this + var lstatcb = inflight(lstatkey, lstatcb_) + + if (lstatcb) + fs.lstat(abs, lstatcb) + + function lstatcb_ (er, lstat) { + if (er) + return cb() + + var isSym = lstat.isSymbolicLink() + self.symlinks[abs] = isSym + + // If it's not a symlink or a dir, then it's definitely a regular file. + // don't bother doing a readdir in that case. + if (!isSym && !lstat.isDirectory()) { + self.cache[abs] = 'FILE' + cb() + } else + self._readdir(abs, false, cb) + } +} + +Glob.prototype._readdir = function (abs, inGlobStar, cb) { + if (this.aborted) + return + + cb = inflight('readdir\0'+abs+'\0'+inGlobStar, cb) + if (!cb) + return + + //console.error('RD %j %j', +inGlobStar, abs) + if (inGlobStar && !ownProp(this.symlinks, abs)) + return this._readdirInGlobStar(abs, cb) + + if (ownProp(this.cache, abs)) { + var c = this.cache[abs] + if (!c || c === 'FILE') + return cb() + + if (Array.isArray(c)) + return cb(null, c) + } + + var self = this + fs.readdir(abs, readdirCb(this, abs, cb)) +} + +function readdirCb (self, abs, cb) { + return function (er, entries) { + if (er) + self._readdirError(abs, er, cb) + else + self._readdirEntries(abs, entries, cb) + } +} + +Glob.prototype._readdirEntries = function (abs, entries, cb) { + if (this.aborted) + return + + // if we haven't asked to stat everything, then just + // assume that everything in there exists, so we can avoid + // having to stat it a second time. + if (!this.mark && !this.stat) { + for (var i = 0; i < entries.length; i ++) { + var e = entries[i] + if (abs === '/') + e = abs + e + else + e = abs + '/' + e + this.cache[e] = true + } + } + + this.cache[abs] = entries + return cb(null, entries) +} + +Glob.prototype._readdirError = function (f, er, cb) { + if (this.aborted) + return + + // handle errors, and cache the information + switch (er.code) { + case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205 + case 'ENOTDIR': // totally normal. means it *does* exist. + this.cache[this._makeAbs(f)] = 'FILE' + break + + case 'ENOENT': // not terribly unusual + case 'ELOOP': + case 'ENAMETOOLONG': + case 'UNKNOWN': + this.cache[this._makeAbs(f)] = false + break + + default: // some unusual error. Treat as failure. + this.cache[this._makeAbs(f)] = false + if (this.strict) { + this.emit('error', er) + // If the error is handled, then we abort + // if not, we threw out of here + this.abort() + } + if (!this.silent) + console.error('glob error', er) + break + } + + return cb() +} + +Glob.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar, cb) { + var self = this + this._readdir(abs, inGlobStar, function (er, entries) { + self._processGlobStar2(prefix, read, abs, remain, index, inGlobStar, entries, cb) + }) +} + + +Glob.prototype._processGlobStar2 = function (prefix, read, abs, remain, index, inGlobStar, entries, cb) { + //console.error('pgs2', prefix, remain[0], entries) + + // no entries means not a dir, so it can never have matches + // foo.txt/** doesn't match foo.txt + if (!entries) + return cb() + + // test without the globstar, and with every child both below + // and replacing the globstar. + var remainWithoutGlobStar = remain.slice(1) + var gspref = prefix ? [ prefix ] : [] + var noGlobStar = gspref.concat(remainWithoutGlobStar) + + // the noGlobStar pattern exits the inGlobStar state + this._process(noGlobStar, index, false, cb) + + var isSym = this.symlinks[abs] + var len = entries.length + + // If it's a symlink, and we're in a globstar, then stop + if (isSym && inGlobStar) + return cb() + + for (var i = 0; i < len; i++) { + var e = entries[i] + if (e.charAt(0) === '.' && !this.dot) + continue + + // these two cases enter the inGlobStar state + var instead = gspref.concat(entries[i], remainWithoutGlobStar) + this._process(instead, index, true, cb) + + var below = gspref.concat(entries[i], remain) + this._process(below, index, true, cb) + } + + cb() +} + +Glob.prototype._processSimple = function (prefix, index, cb) { + // XXX review this. Shouldn't it be doing the mounting etc + // before doing stat? kinda weird? + var self = this + this._stat(prefix, function (er, exists) { + self._processSimple2(prefix, index, er, exists, cb) + }) +} +Glob.prototype._processSimple2 = function (prefix, index, er, exists, cb) { + + //console.error('ps2', prefix, exists) + + if (!this.matches[index]) + this.matches[index] = Object.create(null) + + // If it doesn't exist, then just mark the lack of results + if (!exists) + return cb() + + if (prefix && isAbsolute(prefix) && !this.nomount) { + var trail = /[\/\\]$/.test(prefix) + if (prefix.charAt(0) === '/') { + prefix = path.join(this.root, prefix) + } else { + prefix = path.resolve(this.root, prefix) + if (trail) + prefix += '/' + } + } + + if (process.platform === 'win32') + prefix = prefix.replace(/\\/g, '/') + + // Mark this as a match + this._emitMatch(index, prefix) + cb() +} + +// Returns either 'DIR', 'FILE', or false +Glob.prototype._stat = function (f, cb) { + var abs = this._makeAbs(f) + var needDir = f.slice(-1) === '/' + + if (f.length > this.maxLength) + return cb() + + if (!this.stat && ownProp(this.cache, abs)) { + var c = this.cache[abs] + + if (Array.isArray(c)) + c = 'DIR' + + // It exists, but maybe not how we need it + if (!needDir || c === 'DIR') + return cb(null, c) + + if (needDir && c === 'FILE') + return cb() + + // otherwise we have to stat, because maybe c=true + // if we know it exists, but not what it is. + } + + var exists + var stat = this.statCache[abs] + if (stat !== undefined) { + if (stat === false) + return cb(null, stat) + else { + var type = stat.isDirectory() ? 'DIR' : 'FILE' + if (needDir && type === 'FILE') + return cb() + else + return cb(null, type, stat) + } + } + + var self = this + var statcb = inflight('stat\0' + abs, lstatcb_) + if (statcb) + fs.lstat(abs, statcb) + + function lstatcb_ (er, lstat) { + if (lstat && lstat.isSymbolicLink()) { + // If it's a symlink, then treat it as the target, unless + // the target does not exist, then treat it as a file. + return fs.stat(abs, function (er, stat) { + if (er) + self._stat2(f, abs, null, lstat, cb) + else + self._stat2(f, abs, er, stat, cb) + }) + } else { + self._stat2(f, abs, er, lstat, cb) + } + } +} + +Glob.prototype._stat2 = function (f, abs, er, stat, cb) { + if (er) { + this.statCache[abs] = false + return cb() + } + + var needDir = f.slice(-1) === '/' + this.statCache[abs] = stat + + if (abs.slice(-1) === '/' && !stat.isDirectory()) + return cb(null, false, stat) + + var c = stat.isDirectory() ? 'DIR' : 'FILE' + this.cache[abs] = this.cache[abs] || c + + if (needDir && c !== 'DIR') + return cb() + + return cb(null, c, stat) +} + +}).call(this,require('_process')) +},{"./common.js":15,"./sync.js":17,"_process":24,"assert":9,"events":14,"fs":12,"inflight":18,"inherits":19,"minimatch":20,"once":21,"path":22,"path-is-absolute":23,"util":28}],17:[function(require,module,exports){ +(function (process){ +module.exports = globSync +globSync.GlobSync = GlobSync + +var fs = require('fs') +var minimatch = require('minimatch') +var Minimatch = minimatch.Minimatch +var Glob = require('./glob.js').Glob +var util = require('util') +var path = require('path') +var assert = require('assert') +var isAbsolute = require('path-is-absolute') +var common = require('./common.js') +var alphasort = common.alphasort +var alphasorti = common.alphasorti +var setopts = common.setopts +var ownProp = common.ownProp +var childrenIgnored = common.childrenIgnored + +function globSync (pattern, options) { + if (typeof options === 'function' || arguments.length === 3) + throw new TypeError('callback provided to sync glob\n'+ + 'See: https://github.com/isaacs/node-glob/issues/167') + + return new GlobSync(pattern, options).found +} + +function GlobSync (pattern, options) { + if (!pattern) + throw new Error('must provide pattern') + + if (typeof options === 'function' || arguments.length === 3) + throw new TypeError('callback provided to sync glob\n'+ + 'See: https://github.com/isaacs/node-glob/issues/167') + + if (!(this instanceof GlobSync)) + return new GlobSync(pattern, options) + + setopts(this, pattern, options) + + if (this.noprocess) + return this + + var n = this.minimatch.set.length + this.matches = new Array(n) + for (var i = 0; i < n; i ++) { + this._process(this.minimatch.set[i], i, false) + } + this._finish() +} + +GlobSync.prototype._finish = function () { + assert(this instanceof GlobSync) + if (this.realpath) { + var self = this + this.matches.forEach(function (matchset, index) { + var set = self.matches[index] = Object.create(null) + for (var p in matchset) { + try { + p = self._makeAbs(p) + var real = fs.realpathSync(p, self.realpathCache) + set[real] = true + } catch (er) { + if (er.syscall === 'stat') + set[self._makeAbs(p)] = true + else + throw er + } + } + }) + } + common.finish(this) +} + + +GlobSync.prototype._process = function (pattern, index, inGlobStar) { + assert(this instanceof GlobSync) + + // Get the first [n] parts of pattern that are all strings. + var n = 0 + while (typeof pattern[n] === 'string') { + n ++ + } + // now n is the index of the first one that is *not* a string. + + // See if there's anything else + var prefix + switch (n) { + // if not, then this is rather simple + case pattern.length: + this._processSimple(pattern.join('/'), index) + return + + case 0: + // pattern *starts* with some non-trivial item. + // going to readdir(cwd), but not include the prefix in matches. + prefix = null + break + + default: + // pattern has some string bits in the front. + // whatever it starts with, whether that's 'absolute' like /foo/bar, + // or 'relative' like '../baz' + prefix = pattern.slice(0, n).join('/') + break + } + + var remain = pattern.slice(n) + + // get the list of entries. + var read + if (prefix === null) + read = '.' + else if (isAbsolute(prefix) || isAbsolute(pattern.join('/'))) { + if (!prefix || !isAbsolute(prefix)) + prefix = '/' + prefix + read = prefix + } else + read = prefix + + var abs = this._makeAbs(read) + + //if ignored, skip processing + if (childrenIgnored(this, read)) + return + + var isGlobStar = remain[0] === minimatch.GLOBSTAR + if (isGlobStar) + this._processGlobStar(prefix, read, abs, remain, index, inGlobStar) + else + this._processReaddir(prefix, read, abs, remain, index, inGlobStar) +} + + +GlobSync.prototype._processReaddir = function (prefix, read, abs, remain, index, inGlobStar) { + var entries = this._readdir(abs, inGlobStar) + + // if the abs isn't a dir, then nothing can match! + if (!entries) + return + + // It will only match dot entries if it starts with a dot, or if + // dot is set. Stuff like @(.foo|.bar) isn't allowed. + var pn = remain[0] + var negate = !!this.minimatch.negate + var rawGlob = pn._glob + var dotOk = this.dot || rawGlob.charAt(0) === '.' + + var matchedEntries = [] + for (var i = 0; i < entries.length; i++) { + var e = entries[i] + if (e.charAt(0) !== '.' || dotOk) { + var m + if (negate && !prefix) { + m = !e.match(pn) + } else { + m = e.match(pn) + } + if (m) + matchedEntries.push(e) + } + } + + var len = matchedEntries.length + // If there are no matched entries, then nothing matches. + if (len === 0) + return + + // if this is the last remaining pattern bit, then no need for + // an additional stat *unless* the user has specified mark or + // stat explicitly. We know they exist, since readdir returned + // them. + + if (remain.length === 1 && !this.mark && !this.stat) { + if (!this.matches[index]) + this.matches[index] = Object.create(null) + + for (var i = 0; i < len; i ++) { + var e = matchedEntries[i] + if (prefix) { + if (prefix.slice(-1) !== '/') + e = prefix + '/' + e + else + e = prefix + e + } + + if (e.charAt(0) === '/' && !this.nomount) { + e = path.join(this.root, e) + } + this.matches[index][e] = true + } + // This was the last one, and no stats were needed + return + } + + // now test all matched entries as stand-ins for that part + // of the pattern. + remain.shift() + for (var i = 0; i < len; i ++) { + var e = matchedEntries[i] + var newPattern + if (prefix) + newPattern = [prefix, e] + else + newPattern = [e] + this._process(newPattern.concat(remain), index, inGlobStar) + } +} + + +GlobSync.prototype._emitMatch = function (index, e) { + var abs = this._makeAbs(e) + if (this.mark) + e = this._mark(e) + + if (this.matches[index][e]) + return + + if (this.nodir) { + var c = this.cache[this._makeAbs(e)] + if (c === 'DIR' || Array.isArray(c)) + return + } + + this.matches[index][e] = true + if (this.stat) + this._stat(e) +} + + +GlobSync.prototype._readdirInGlobStar = function (abs) { + // follow all symlinked directories forever + // just proceed as if this is a non-globstar situation + if (this.follow) + return this._readdir(abs, false) + + var entries + var lstat + var stat + try { + lstat = fs.lstatSync(abs) + } catch (er) { + // lstat failed, doesn't exist + return null + } + + var isSym = lstat.isSymbolicLink() + this.symlinks[abs] = isSym + + // If it's not a symlink or a dir, then it's definitely a regular file. + // don't bother doing a readdir in that case. + if (!isSym && !lstat.isDirectory()) + this.cache[abs] = 'FILE' + else + entries = this._readdir(abs, false) + + return entries +} + +GlobSync.prototype._readdir = function (abs, inGlobStar) { + var entries + + if (inGlobStar && !ownProp(this.symlinks, abs)) + return this._readdirInGlobStar(abs) + + if (ownProp(this.cache, abs)) { + var c = this.cache[abs] + if (!c || c === 'FILE') + return null + + if (Array.isArray(c)) + return c + } + + try { + return this._readdirEntries(abs, fs.readdirSync(abs)) + } catch (er) { + this._readdirError(abs, er) + return null + } +} + +GlobSync.prototype._readdirEntries = function (abs, entries) { + // if we haven't asked to stat everything, then just + // assume that everything in there exists, so we can avoid + // having to stat it a second time. + if (!this.mark && !this.stat) { + for (var i = 0; i < entries.length; i ++) { + var e = entries[i] + if (abs === '/') + e = abs + e + else + e = abs + '/' + e + this.cache[e] = true + } + } + + this.cache[abs] = entries + + // mark and cache dir-ness + return entries +} + +GlobSync.prototype._readdirError = function (f, er) { + // handle errors, and cache the information + switch (er.code) { + case 'ENOTSUP': // https://github.com/isaacs/node-glob/issues/205 + case 'ENOTDIR': // totally normal. means it *does* exist. + this.cache[this._makeAbs(f)] = 'FILE' + break + + case 'ENOENT': // not terribly unusual + case 'ELOOP': + case 'ENAMETOOLONG': + case 'UNKNOWN': + this.cache[this._makeAbs(f)] = false + break + + default: // some unusual error. Treat as failure. + this.cache[this._makeAbs(f)] = false + if (this.strict) + throw er + if (!this.silent) + console.error('glob error', er) + break + } +} + +GlobSync.prototype._processGlobStar = function (prefix, read, abs, remain, index, inGlobStar) { + + var entries = this._readdir(abs, inGlobStar) + + // no entries means not a dir, so it can never have matches + // foo.txt/** doesn't match foo.txt + if (!entries) + return + + // test without the globstar, and with every child both below + // and replacing the globstar. + var remainWithoutGlobStar = remain.slice(1) + var gspref = prefix ? [ prefix ] : [] + var noGlobStar = gspref.concat(remainWithoutGlobStar) + + // the noGlobStar pattern exits the inGlobStar state + this._process(noGlobStar, index, false) + + var len = entries.length + var isSym = this.symlinks[abs] + + // If it's a symlink, and we're in a globstar, then stop + if (isSym && inGlobStar) + return + + for (var i = 0; i < len; i++) { + var e = entries[i] + if (e.charAt(0) === '.' && !this.dot) + continue + + // these two cases enter the inGlobStar state + var instead = gspref.concat(entries[i], remainWithoutGlobStar) + this._process(instead, index, true) + + var below = gspref.concat(entries[i], remain) + this._process(below, index, true) + } +} + +GlobSync.prototype._processSimple = function (prefix, index) { + // XXX review this. Shouldn't it be doing the mounting etc + // before doing stat? kinda weird? + var exists = this._stat(prefix) + + if (!this.matches[index]) + this.matches[index] = Object.create(null) + + // If it doesn't exist, then just mark the lack of results + if (!exists) + return + + if (prefix && isAbsolute(prefix) && !this.nomount) { + var trail = /[\/\\]$/.test(prefix) + if (prefix.charAt(0) === '/') { + prefix = path.join(this.root, prefix) + } else { + prefix = path.resolve(this.root, prefix) + if (trail) + prefix += '/' + } + } + + if (process.platform === 'win32') + prefix = prefix.replace(/\\/g, '/') + + // Mark this as a match + this.matches[index][prefix] = true +} + +// Returns either 'DIR', 'FILE', or false +GlobSync.prototype._stat = function (f) { + var abs = this._makeAbs(f) + var needDir = f.slice(-1) === '/' + + if (f.length > this.maxLength) + return false + + if (!this.stat && ownProp(this.cache, abs)) { + var c = this.cache[abs] + + if (Array.isArray(c)) + c = 'DIR' + + // It exists, but maybe not how we need it + if (!needDir || c === 'DIR') + return c + + if (needDir && c === 'FILE') + return false + + // otherwise we have to stat, because maybe c=true + // if we know it exists, but not what it is. + } + + var exists + var stat = this.statCache[abs] + if (!stat) { + var lstat + try { + lstat = fs.lstatSync(abs) + } catch (er) { + return false + } + + if (lstat.isSymbolicLink()) { + try { + stat = fs.statSync(abs) + } catch (er) { + stat = lstat + } + } else { + stat = lstat + } + } + + this.statCache[abs] = stat + + var c = stat.isDirectory() ? 'DIR' : 'FILE' + this.cache[abs] = this.cache[abs] || c + + if (needDir && c !== 'DIR') + return false + + return c +} + +GlobSync.prototype._mark = function (p) { + return common.mark(this, p) +} + +GlobSync.prototype._makeAbs = function (f) { + return common.makeAbs(this, f) +} + +}).call(this,require('_process')) +},{"./common.js":15,"./glob.js":16,"_process":24,"assert":9,"fs":12,"minimatch":20,"path":22,"path-is-absolute":23,"util":28}],18:[function(require,module,exports){ +(function (process){ +var wrappy = require('wrappy') +var reqs = Object.create(null) +var once = require('once') + +module.exports = wrappy(inflight) + +function inflight (key, cb) { + if (reqs[key]) { + reqs[key].push(cb) + return null + } else { + reqs[key] = [cb] + return makeres(key) + } +} + +function makeres (key) { + return once(function RES () { + var cbs = reqs[key] + var len = cbs.length + var args = slice(arguments) + + // XXX It's somewhat ambiguous whether a new callback added in this + // pass should be queued for later execution if something in the + // list of callbacks throws, or if it should just be discarded. + // However, it's such an edge case that it hardly matters, and either + // choice is likely as surprising as the other. + // As it happens, we do go ahead and schedule it for later execution. + try { + for (var i = 0; i < len; i++) { + cbs[i].apply(null, args) + } + } finally { + if (cbs.length > len) { + // added more in the interim. + // de-zalgo, just in case, but don't call again. + cbs.splice(0, len) + process.nextTick(function () { + RES.apply(null, args) + }) + } else { + delete reqs[key] + } + } + }) +} + +function slice (args) { + var length = args.length + var array = [] + + for (var i = 0; i < length; i++) array[i] = args[i] + return array +} + +}).call(this,require('_process')) +},{"_process":24,"once":21,"wrappy":29}],19:[function(require,module,exports){ +if (typeof Object.create === 'function') { + // implementation from standard node.js 'util' module + module.exports = function inherits(ctor, superCtor) { + ctor.super_ = superCtor + ctor.prototype = Object.create(superCtor.prototype, { + constructor: { + value: ctor, + enumerable: false, + writable: true, + configurable: true + } + }); + }; +} else { + // old school shim for old browsers + module.exports = function inherits(ctor, superCtor) { + ctor.super_ = superCtor + var TempCtor = function () {} + TempCtor.prototype = superCtor.prototype + ctor.prototype = new TempCtor() + ctor.prototype.constructor = ctor + } +} + +},{}],20:[function(require,module,exports){ +module.exports = minimatch +minimatch.Minimatch = Minimatch + +var path = { sep: '/' } +try { + path = require('path') +} catch (er) {} + +var GLOBSTAR = minimatch.GLOBSTAR = Minimatch.GLOBSTAR = {} +var expand = require('brace-expansion') + +var plTypes = { + '!': { open: '(?:(?!(?:', close: '))[^/]*?)'}, + '?': { open: '(?:', close: ')?' }, + '+': { open: '(?:', close: ')+' }, + '*': { open: '(?:', close: ')*' }, + '@': { open: '(?:', close: ')' } +} + +// any single thing other than / +// don't need to escape / when using new RegExp() +var qmark = '[^/]' + +// * => any number of characters +var star = qmark + '*?' + +// ** when dots are allowed. Anything goes, except .. and . +// not (^ or / followed by one or two dots followed by $ or /), +// followed by anything, any number of times. +var twoStarDot = '(?:(?!(?:\\\/|^)(?:\\.{1,2})($|\\\/)).)*?' + +// not a ^ or / followed by a dot, +// followed by anything, any number of times. +var twoStarNoDot = '(?:(?!(?:\\\/|^)\\.).)*?' + +// characters that need to be escaped in RegExp. +var reSpecials = charSet('().*{}+?[]^$\\!') + +// "abc" -> { a:true, b:true, c:true } +function charSet (s) { + return s.split('').reduce(function (set, c) { + set[c] = true + return set + }, {}) +} + +// normalizes slashes. +var slashSplit = /\/+/ + +minimatch.filter = filter +function filter (pattern, options) { + options = options || {} + return function (p, i, list) { + return minimatch(p, pattern, options) + } +} + +function ext (a, b) { + a = a || {} + b = b || {} + var t = {} + Object.keys(b).forEach(function (k) { + t[k] = b[k] + }) + Object.keys(a).forEach(function (k) { + t[k] = a[k] + }) + return t +} + +minimatch.defaults = function (def) { + if (!def || !Object.keys(def).length) return minimatch + + var orig = minimatch + + var m = function minimatch (p, pattern, options) { + return orig.minimatch(p, pattern, ext(def, options)) + } + + m.Minimatch = function Minimatch (pattern, options) { + return new orig.Minimatch(pattern, ext(def, options)) + } + + return m +} + +Minimatch.defaults = function (def) { + if (!def || !Object.keys(def).length) return Minimatch + return minimatch.defaults(def).Minimatch +} + +function minimatch (p, pattern, options) { + if (typeof pattern !== 'string') { + throw new TypeError('glob pattern string required') + } + + if (!options) options = {} + + // shortcut: comments match nothing. + if (!options.nocomment && pattern.charAt(0) === '#') { + return false + } + + // "" only matches "" + if (pattern.trim() === '') return p === '' + + return new Minimatch(pattern, options).match(p) +} + +function Minimatch (pattern, options) { + if (!(this instanceof Minimatch)) { + return new Minimatch(pattern, options) + } + + if (typeof pattern !== 'string') { + throw new TypeError('glob pattern string required') + } + + if (!options) options = {} + pattern = pattern.trim() + + // windows support: need to use /, not \ + if (path.sep !== '/') { + pattern = pattern.split(path.sep).join('/') + } + + this.options = options + this.set = [] + this.pattern = pattern + this.regexp = null + this.negate = false + this.comment = false + this.empty = false + + // make the set of regexps etc. + this.make() +} + +Minimatch.prototype.debug = function () {} + +Minimatch.prototype.make = make +function make () { + // don't do it more than once. + if (this._made) return + + var pattern = this.pattern + var options = this.options + + // empty patterns and comments match nothing. + if (!options.nocomment && pattern.charAt(0) === '#') { + this.comment = true + return + } + if (!pattern) { + this.empty = true + return + } + + // step 1: figure out negation, etc. + this.parseNegate() + + // step 2: expand braces + var set = this.globSet = this.braceExpand() + + if (options.debug) this.debug = console.error + + this.debug(this.pattern, set) + + // step 3: now we have a set, so turn each one into a series of path-portion + // matching patterns. + // These will be regexps, except in the case of "**", which is + // set to the GLOBSTAR object for globstar behavior, + // and will not contain any / characters + set = this.globParts = set.map(function (s) { + return s.split(slashSplit) + }) + + this.debug(this.pattern, set) + + // glob --> regexps + set = set.map(function (s, si, set) { + return s.map(this.parse, this) + }, this) + + this.debug(this.pattern, set) + + // filter out everything that didn't compile properly. + set = set.filter(function (s) { + return s.indexOf(false) === -1 + }) + + this.debug(this.pattern, set) + + this.set = set +} + +Minimatch.prototype.parseNegate = parseNegate +function parseNegate () { + var pattern = this.pattern + var negate = false + var options = this.options + var negateOffset = 0 + + if (options.nonegate) return + + for (var i = 0, l = pattern.length + ; i < l && pattern.charAt(i) === '!' + ; i++) { + negate = !negate + negateOffset++ + } + + if (negateOffset) this.pattern = pattern.substr(negateOffset) + this.negate = negate +} + +// Brace expansion: +// a{b,c}d -> abd acd +// a{b,}c -> abc ac +// a{0..3}d -> a0d a1d a2d a3d +// a{b,c{d,e}f}g -> abg acdfg acefg +// a{b,c}d{e,f}g -> abdeg acdeg abdeg abdfg +// +// Invalid sets are not expanded. +// a{2..}b -> a{2..}b +// a{b}c -> a{b}c +minimatch.braceExpand = function (pattern, options) { + return braceExpand(pattern, options) +} + +Minimatch.prototype.braceExpand = braceExpand + +function braceExpand (pattern, options) { + if (!options) { + if (this instanceof Minimatch) { + options = this.options + } else { + options = {} + } + } + + pattern = typeof pattern === 'undefined' + ? this.pattern : pattern + + if (typeof pattern === 'undefined') { + throw new TypeError('undefined pattern') + } + + if (options.nobrace || + !pattern.match(/\{.*\}/)) { + // shortcut. no need to expand. + return [pattern] + } + + return expand(pattern) +} + +// parse a component of the expanded set. +// At this point, no pattern may contain "/" in it +// so we're going to return a 2d array, where each entry is the full +// pattern, split on '/', and then turned into a regular expression. +// A regexp is made at the end which joins each array with an +// escaped /, and another full one which joins each regexp with |. +// +// Following the lead of Bash 4.1, note that "**" only has special meaning +// when it is the *only* thing in a path portion. Otherwise, any series +// of * is equivalent to a single *. Globstar behavior is enabled by +// default, and can be disabled by setting options.noglobstar. +Minimatch.prototype.parse = parse +var SUBPARSE = {} +function parse (pattern, isSub) { + if (pattern.length > 1024 * 64) { + throw new TypeError('pattern is too long') + } + + var options = this.options + + // shortcuts + if (!options.noglobstar && pattern === '**') return GLOBSTAR + if (pattern === '') return '' + + var re = '' + var hasMagic = !!options.nocase + var escaping = false + // ? => one single character + var patternListStack = [] + var negativeLists = [] + var stateChar + var inClass = false + var reClassStart = -1 + var classStart = -1 + // . and .. never match anything that doesn't start with ., + // even when options.dot is set. + var patternStart = pattern.charAt(0) === '.' ? '' // anything + // not (start or / followed by . or .. followed by / or end) + : options.dot ? '(?!(?:^|\\\/)\\.{1,2}(?:$|\\\/))' + : '(?!\\.)' + var self = this + + function clearStateChar () { + if (stateChar) { + // we had some state-tracking character + // that wasn't consumed by this pass. + switch (stateChar) { + case '*': + re += star + hasMagic = true + break + case '?': + re += qmark + hasMagic = true + break + default: + re += '\\' + stateChar + break + } + self.debug('clearStateChar %j %j', stateChar, re) + stateChar = false + } + } + + for (var i = 0, len = pattern.length, c + ; (i < len) && (c = pattern.charAt(i)) + ; i++) { + this.debug('%s\t%s %s %j', pattern, i, re, c) + + // skip over any that are escaped. + if (escaping && reSpecials[c]) { + re += '\\' + c + escaping = false + continue + } + + switch (c) { + case '/': + // completely not allowed, even escaped. + // Should already be path-split by now. + return false + + case '\\': + clearStateChar() + escaping = true + continue + + // the various stateChar values + // for the "extglob" stuff. + case '?': + case '*': + case '+': + case '@': + case '!': + this.debug('%s\t%s %s %j <-- stateChar', pattern, i, re, c) + + // all of those are literals inside a class, except that + // the glob [!a] means [^a] in regexp + if (inClass) { + this.debug(' in class') + if (c === '!' && i === classStart + 1) c = '^' + re += c + continue + } + + // if we already have a stateChar, then it means + // that there was something like ** or +? in there. + // Handle the stateChar, then proceed with this one. + self.debug('call clearStateChar %j', stateChar) + clearStateChar() + stateChar = c + // if extglob is disabled, then +(asdf|foo) isn't a thing. + // just clear the statechar *now*, rather than even diving into + // the patternList stuff. + if (options.noext) clearStateChar() + continue + + case '(': + if (inClass) { + re += '(' + continue + } + + if (!stateChar) { + re += '\\(' + continue + } + + patternListStack.push({ + type: stateChar, + start: i - 1, + reStart: re.length, + open: plTypes[stateChar].open, + close: plTypes[stateChar].close + }) + // negation is (?:(?!js)[^/]*) + re += stateChar === '!' ? '(?:(?!(?:' : '(?:' + this.debug('plType %j %j', stateChar, re) + stateChar = false + continue + + case ')': + if (inClass || !patternListStack.length) { + re += '\\)' + continue + } + + clearStateChar() + hasMagic = true + var pl = patternListStack.pop() + // negation is (?:(?!js)[^/]*) + // The others are (?:) + re += pl.close + if (pl.type === '!') { + negativeLists.push(pl) + } + pl.reEnd = re.length + continue + + case '|': + if (inClass || !patternListStack.length || escaping) { + re += '\\|' + escaping = false + continue + } + + clearStateChar() + re += '|' + continue + + // these are mostly the same in regexp and glob + case '[': + // swallow any state-tracking char before the [ + clearStateChar() + + if (inClass) { + re += '\\' + c + continue + } + + inClass = true + classStart = i + reClassStart = re.length + re += c + continue + + case ']': + // a right bracket shall lose its special + // meaning and represent itself in + // a bracket expression if it occurs + // first in the list. -- POSIX.2 2.8.3.2 + if (i === classStart + 1 || !inClass) { + re += '\\' + c + escaping = false + continue + } + + // handle the case where we left a class open. + // "[z-a]" is valid, equivalent to "\[z-a\]" + if (inClass) { + // split where the last [ was, make sure we don't have + // an invalid re. if so, re-walk the contents of the + // would-be class to re-translate any characters that + // were passed through as-is + // TODO: It would probably be faster to determine this + // without a try/catch and a new RegExp, but it's tricky + // to do safely. For now, this is safe and works. + var cs = pattern.substring(classStart + 1, i) + try { + RegExp('[' + cs + ']') + } catch (er) { + // not a valid class! + var sp = this.parse(cs, SUBPARSE) + re = re.substr(0, reClassStart) + '\\[' + sp[0] + '\\]' + hasMagic = hasMagic || sp[1] + inClass = false + continue + } + } + + // finish up the class. + hasMagic = true + inClass = false + re += c + continue + + default: + // swallow any state char that wasn't consumed + clearStateChar() + + if (escaping) { + // no need + escaping = false + } else if (reSpecials[c] + && !(c === '^' && inClass)) { + re += '\\' + } + + re += c + + } // switch + } // for + + // handle the case where we left a class open. + // "[abc" is valid, equivalent to "\[abc" + if (inClass) { + // split where the last [ was, and escape it + // this is a huge pita. We now have to re-walk + // the contents of the would-be class to re-translate + // any characters that were passed through as-is + cs = pattern.substr(classStart + 1) + sp = this.parse(cs, SUBPARSE) + re = re.substr(0, reClassStart) + '\\[' + sp[0] + hasMagic = hasMagic || sp[1] + } + + // handle the case where we had a +( thing at the *end* + // of the pattern. + // each pattern list stack adds 3 chars, and we need to go through + // and escape any | chars that were passed through as-is for the regexp. + // Go through and escape them, taking care not to double-escape any + // | chars that were already escaped. + for (pl = patternListStack.pop(); pl; pl = patternListStack.pop()) { + var tail = re.slice(pl.reStart + pl.open.length) + this.debug('setting tail', re, pl) + // maybe some even number of \, then maybe 1 \, followed by a | + tail = tail.replace(/((?:\\{2}){0,64})(\\?)\|/g, function (_, $1, $2) { + if (!$2) { + // the | isn't already escaped, so escape it. + $2 = '\\' + } + + // need to escape all those slashes *again*, without escaping the + // one that we need for escaping the | character. As it works out, + // escaping an even number of slashes can be done by simply repeating + // it exactly after itself. That's why this trick works. + // + // I am sorry that you have to see this. + return $1 + $1 + $2 + '|' + }) + + this.debug('tail=%j\n %s', tail, tail, pl, re) + var t = pl.type === '*' ? star + : pl.type === '?' ? qmark + : '\\' + pl.type + + hasMagic = true + re = re.slice(0, pl.reStart) + t + '\\(' + tail + } + + // handle trailing things that only matter at the very end. + clearStateChar() + if (escaping) { + // trailing \\ + re += '\\\\' + } + + // only need to apply the nodot start if the re starts with + // something that could conceivably capture a dot + var addPatternStart = false + switch (re.charAt(0)) { + case '.': + case '[': + case '(': addPatternStart = true + } + + // Hack to work around lack of negative lookbehind in JS + // A pattern like: *.!(x).!(y|z) needs to ensure that a name + // like 'a.xyz.yz' doesn't match. So, the first negative + // lookahead, has to look ALL the way ahead, to the end of + // the pattern. + for (var n = negativeLists.length - 1; n > -1; n--) { + var nl = negativeLists[n] + + var nlBefore = re.slice(0, nl.reStart) + var nlFirst = re.slice(nl.reStart, nl.reEnd - 8) + var nlLast = re.slice(nl.reEnd - 8, nl.reEnd) + var nlAfter = re.slice(nl.reEnd) + + nlLast += nlAfter + + // Handle nested stuff like *(*.js|!(*.json)), where open parens + // mean that we should *not* include the ) in the bit that is considered + // "after" the negated section. + var openParensBefore = nlBefore.split('(').length - 1 + var cleanAfter = nlAfter + for (i = 0; i < openParensBefore; i++) { + cleanAfter = cleanAfter.replace(/\)[+*?]?/, '') + } + nlAfter = cleanAfter + + var dollar = '' + if (nlAfter === '' && isSub !== SUBPARSE) { + dollar = '$' + } + var newRe = nlBefore + nlFirst + nlAfter + dollar + nlLast + re = newRe + } + + // if the re is not "" at this point, then we need to make sure + // it doesn't match against an empty path part. + // Otherwise a/* will match a/, which it should not. + if (re !== '' && hasMagic) { + re = '(?=.)' + re + } + + if (addPatternStart) { + re = patternStart + re + } + + // parsing just a piece of a larger pattern. + if (isSub === SUBPARSE) { + return [re, hasMagic] + } + + // skip the regexp for non-magical patterns + // unescape anything in it, though, so that it'll be + // an exact match against a file etc. + if (!hasMagic) { + return globUnescape(pattern) + } + + var flags = options.nocase ? 'i' : '' + try { + var regExp = new RegExp('^' + re + '$', flags) + } catch (er) { + // If it was an invalid regular expression, then it can't match + // anything. This trick looks for a character after the end of + // the string, which is of course impossible, except in multi-line + // mode, but it's not a /m regex. + return new RegExp('$.') + } + + regExp._glob = pattern + regExp._src = re + + return regExp +} + +minimatch.makeRe = function (pattern, options) { + return new Minimatch(pattern, options || {}).makeRe() +} + +Minimatch.prototype.makeRe = makeRe +function makeRe () { + if (this.regexp || this.regexp === false) return this.regexp + + // at this point, this.set is a 2d array of partial + // pattern strings, or "**". + // + // It's better to use .match(). This function shouldn't + // be used, really, but it's pretty convenient sometimes, + // when you just want to work with a regex. + var set = this.set + + if (!set.length) { + this.regexp = false + return this.regexp + } + var options = this.options + + var twoStar = options.noglobstar ? star + : options.dot ? twoStarDot + : twoStarNoDot + var flags = options.nocase ? 'i' : '' + + var re = set.map(function (pattern) { + return pattern.map(function (p) { + return (p === GLOBSTAR) ? twoStar + : (typeof p === 'string') ? regExpEscape(p) + : p._src + }).join('\\\/') + }).join('|') + + // must match entire pattern + // ending in a * or ** will make it less strict. + re = '^(?:' + re + ')$' + + // can match anything, as long as it's not this. + if (this.negate) re = '^(?!' + re + ').*$' + + try { + this.regexp = new RegExp(re, flags) + } catch (ex) { + this.regexp = false + } + return this.regexp +} + +minimatch.match = function (list, pattern, options) { + options = options || {} + var mm = new Minimatch(pattern, options) + list = list.filter(function (f) { + return mm.match(f) + }) + if (mm.options.nonull && !list.length) { + list.push(pattern) + } + return list +} + +Minimatch.prototype.match = match +function match (f, partial) { + this.debug('match', f, this.pattern) + // short-circuit in the case of busted things. + // comments, etc. + if (this.comment) return false + if (this.empty) return f === '' + + if (f === '/' && partial) return true + + var options = this.options + + // windows: need to use /, not \ + if (path.sep !== '/') { + f = f.split(path.sep).join('/') + } + + // treat the test path as a set of pathparts. + f = f.split(slashSplit) + this.debug(this.pattern, 'split', f) + + // just ONE of the pattern sets in this.set needs to match + // in order for it to be valid. If negating, then just one + // match means that we have failed. + // Either way, return on the first hit. + + var set = this.set + this.debug(this.pattern, 'set', set) + + // Find the basename of the path by looking for the last non-empty segment + var filename + var i + for (i = f.length - 1; i >= 0; i--) { + filename = f[i] + if (filename) break + } + + for (i = 0; i < set.length; i++) { + var pattern = set[i] + var file = f + if (options.matchBase && pattern.length === 1) { + file = [filename] + } + var hit = this.matchOne(file, pattern, partial) + if (hit) { + if (options.flipNegate) return true + return !this.negate + } + } + + // didn't get any hits. this is success if it's a negative + // pattern, failure otherwise. + if (options.flipNegate) return false + return this.negate +} + +// set partial to true to test if, for example, +// "/a/b" matches the start of "/*/b/*/d" +// Partial means, if you run out of file before you run +// out of pattern, then that's fine, as long as all +// the parts match. +Minimatch.prototype.matchOne = function (file, pattern, partial) { + var options = this.options + + this.debug('matchOne', + { 'this': this, file: file, pattern: pattern }) + + this.debug('matchOne', file.length, pattern.length) + + for (var fi = 0, + pi = 0, + fl = file.length, + pl = pattern.length + ; (fi < fl) && (pi < pl) + ; fi++, pi++) { + this.debug('matchOne loop') + var p = pattern[pi] + var f = file[fi] + + this.debug(pattern, p, f) + + // should be impossible. + // some invalid regexp stuff in the set. + if (p === false) return false + + if (p === GLOBSTAR) { + this.debug('GLOBSTAR', [pattern, p, f]) + + // "**" + // a/**/b/**/c would match the following: + // a/b/x/y/z/c + // a/x/y/z/b/c + // a/b/x/b/x/c + // a/b/c + // To do this, take the rest of the pattern after + // the **, and see if it would match the file remainder. + // If so, return success. + // If not, the ** "swallows" a segment, and try again. + // This is recursively awful. + // + // a/**/b/**/c matching a/b/x/y/z/c + // - a matches a + // - doublestar + // - matchOne(b/x/y/z/c, b/**/c) + // - b matches b + // - doublestar + // - matchOne(x/y/z/c, c) -> no + // - matchOne(y/z/c, c) -> no + // - matchOne(z/c, c) -> no + // - matchOne(c, c) yes, hit + var fr = fi + var pr = pi + 1 + if (pr === pl) { + this.debug('** at the end') + // a ** at the end will just swallow the rest. + // We have found a match. + // however, it will not swallow /.x, unless + // options.dot is set. + // . and .. are *never* matched by **, for explosively + // exponential reasons. + for (; fi < fl; fi++) { + if (file[fi] === '.' || file[fi] === '..' || + (!options.dot && file[fi].charAt(0) === '.')) return false + } + return true + } + + // ok, let's see if we can swallow whatever we can. + while (fr < fl) { + var swallowee = file[fr] + + this.debug('\nglobstar while', file, fr, pattern, pr, swallowee) + + // XXX remove this slice. Just pass the start index. + if (this.matchOne(file.slice(fr), pattern.slice(pr), partial)) { + this.debug('globstar found match!', fr, fl, swallowee) + // found a match. + return true + } else { + // can't swallow "." or ".." ever. + // can only swallow ".foo" when explicitly asked. + if (swallowee === '.' || swallowee === '..' || + (!options.dot && swallowee.charAt(0) === '.')) { + this.debug('dot detected!', file, fr, pattern, pr) + break + } + + // ** swallows a segment, and continue. + this.debug('globstar swallow a segment, and continue') + fr++ + } + } + + // no match was found. + // However, in partial mode, we can't say this is necessarily over. + // If there's more *pattern* left, then + if (partial) { + // ran out of file + this.debug('\n>>> no match, partial?', file, fr, pattern, pr) + if (fr === fl) return true + } + return false + } + + // something other than ** + // non-magic patterns just have to match exactly + // patterns with magic have been turned into regexps. + var hit + if (typeof p === 'string') { + if (options.nocase) { + hit = f.toLowerCase() === p.toLowerCase() + } else { + hit = f === p + } + this.debug('string match', p, f, hit) + } else { + hit = f.match(p) + this.debug('pattern match', p, f, hit) + } + + if (!hit) return false + } + + // Note: ending in / means that we'll get a final "" + // at the end of the pattern. This can only match a + // corresponding "" at the end of the file. + // If the file ends in /, then it can only match a + // a pattern that ends in /, unless the pattern just + // doesn't have any more for it. But, a/b/ should *not* + // match "a/b/*", even though "" matches against the + // [^/]*? pattern, except in partial mode, where it might + // simply not be reached yet. + // However, a/b/ should still satisfy a/* + + // now either we fell off the end of the pattern, or we're done. + if (fi === fl && pi === pl) { + // ran out of pattern and filename at the same time. + // an exact hit! + return true + } else if (fi === fl) { + // ran out of file, but still had pattern left. + // this is ok if we're doing the match as part of + // a glob fs traversal. + return partial + } else if (pi === pl) { + // ran out of pattern, still have file left. + // this is only acceptable if we're on the very last + // empty segment of a file with a trailing slash. + // a/* should match a/b/ + var emptyFileEnd = (fi === fl - 1) && (file[fi] === '') + return emptyFileEnd + } + + // should be unreachable. + throw new Error('wtf?') +} + +// replace stuff like \* with * +function globUnescape (s) { + return s.replace(/\\(.)/g, '$1') +} + +function regExpEscape (s) { + return s.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, '\\$&') +} + +},{"brace-expansion":11,"path":22}],21:[function(require,module,exports){ +var wrappy = require('wrappy') +module.exports = wrappy(once) +module.exports.strict = wrappy(onceStrict) + +once.proto = once(function () { + Object.defineProperty(Function.prototype, 'once', { + value: function () { + return once(this) + }, + configurable: true + }) + + Object.defineProperty(Function.prototype, 'onceStrict', { + value: function () { + return onceStrict(this) + }, + configurable: true + }) +}) + +function once (fn) { + var f = function () { + if (f.called) return f.value + f.called = true + return f.value = fn.apply(this, arguments) + } + f.called = false + return f +} + +function onceStrict (fn) { + var f = function () { + if (f.called) + throw new Error(f.onceError) + f.called = true + return f.value = fn.apply(this, arguments) + } + var name = fn.name || 'Function wrapped with `once`' + f.onceError = name + " shouldn't be called more than once" + f.called = false + return f +} + +},{"wrappy":29}],22:[function(require,module,exports){ +(function (process){ +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. + +// resolves . and .. elements in a path array with directory names there +// must be no slashes, empty elements, or device names (c:\) in the array +// (so also no leading and trailing slashes - it does not distinguish +// relative and absolute paths) +function normalizeArray(parts, allowAboveRoot) { + // if the path tries to go above the root, `up` ends up > 0 + var up = 0; + for (var i = parts.length - 1; i >= 0; i--) { + var last = parts[i]; + if (last === '.') { + parts.splice(i, 1); + } else if (last === '..') { + parts.splice(i, 1); + up++; + } else if (up) { + parts.splice(i, 1); + up--; + } + } + + // if the path is allowed to go above the root, restore leading ..s + if (allowAboveRoot) { + for (; up--; up) { + parts.unshift('..'); + } + } + + return parts; +} + +// Split a filename into [root, dir, basename, ext], unix version +// 'root' is just a slash, or nothing. +var splitPathRe = + /^(\/?|)([\s\S]*?)((?:\.{1,2}|[^\/]+?|)(\.[^.\/]*|))(?:[\/]*)$/; +var splitPath = function(filename) { + return splitPathRe.exec(filename).slice(1); +}; + +// path.resolve([from ...], to) +// posix version +exports.resolve = function() { + var resolvedPath = '', + resolvedAbsolute = false; + + for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) { + var path = (i >= 0) ? arguments[i] : process.cwd(); + + // Skip empty and invalid entries + if (typeof path !== 'string') { + throw new TypeError('Arguments to path.resolve must be strings'); + } else if (!path) { + continue; + } + + resolvedPath = path + '/' + resolvedPath; + resolvedAbsolute = path.charAt(0) === '/'; + } + + // At this point the path should be resolved to a full absolute path, but + // handle relative paths to be safe (might happen when process.cwd() fails) + + // Normalize the path + resolvedPath = normalizeArray(filter(resolvedPath.split('/'), function(p) { + return !!p; + }), !resolvedAbsolute).join('/'); + + return ((resolvedAbsolute ? '/' : '') + resolvedPath) || '.'; +}; + +// path.normalize(path) +// posix version +exports.normalize = function(path) { + var isAbsolute = exports.isAbsolute(path), + trailingSlash = substr(path, -1) === '/'; + + // Normalize the path + path = normalizeArray(filter(path.split('/'), function(p) { + return !!p; + }), !isAbsolute).join('/'); + + if (!path && !isAbsolute) { + path = '.'; + } + if (path && trailingSlash) { + path += '/'; + } + + return (isAbsolute ? '/' : '') + path; +}; + +// posix version +exports.isAbsolute = function(path) { + return path.charAt(0) === '/'; +}; + +// posix version +exports.join = function() { + var paths = Array.prototype.slice.call(arguments, 0); + return exports.normalize(filter(paths, function(p, index) { + if (typeof p !== 'string') { + throw new TypeError('Arguments to path.join must be strings'); + } + return p; + }).join('/')); +}; + + +// path.relative(from, to) +// posix version +exports.relative = function(from, to) { + from = exports.resolve(from).substr(1); + to = exports.resolve(to).substr(1); + + function trim(arr) { + var start = 0; + for (; start < arr.length; start++) { + if (arr[start] !== '') break; + } + + var end = arr.length - 1; + for (; end >= 0; end--) { + if (arr[end] !== '') break; + } + + if (start > end) return []; + return arr.slice(start, end - start + 1); + } + + var fromParts = trim(from.split('/')); + var toParts = trim(to.split('/')); + + var length = Math.min(fromParts.length, toParts.length); + var samePartsLength = length; + for (var i = 0; i < length; i++) { + if (fromParts[i] !== toParts[i]) { + samePartsLength = i; + break; + } + } + + var outputParts = []; + for (var i = samePartsLength; i < fromParts.length; i++) { + outputParts.push('..'); + } + + outputParts = outputParts.concat(toParts.slice(samePartsLength)); + + return outputParts.join('/'); +}; + +exports.sep = '/'; +exports.delimiter = ':'; + +exports.dirname = function(path) { + var result = splitPath(path), + root = result[0], + dir = result[1]; + + if (!root && !dir) { + // No dirname whatsoever + return '.'; + } + + if (dir) { + // It has a dirname, strip trailing slash + dir = dir.substr(0, dir.length - 1); + } + + return root + dir; +}; + + +exports.basename = function(path, ext) { + var f = splitPath(path)[2]; + // TODO: make this comparison case-insensitive on windows? + if (ext && f.substr(-1 * ext.length) === ext) { + f = f.substr(0, f.length - ext.length); + } + return f; +}; + + +exports.extname = function(path) { + return splitPath(path)[3]; +}; + +function filter (xs, f) { + if (xs.filter) return xs.filter(f); + var res = []; + for (var i = 0; i < xs.length; i++) { + if (f(xs[i], i, xs)) res.push(xs[i]); + } + return res; +} + +// String.prototype.substr - negative index don't work in IE8 +var substr = 'ab'.substr(-1) === 'b' + ? function (str, start, len) { return str.substr(start, len) } + : function (str, start, len) { + if (start < 0) start = str.length + start; + return str.substr(start, len); + } +; + +}).call(this,require('_process')) +},{"_process":24}],23:[function(require,module,exports){ +(function (process){ +'use strict'; + +function posix(path) { + return path.charAt(0) === '/'; +} + +function win32(path) { + // https://github.com/nodejs/node/blob/b3fcc245fb25539909ef1d5eaa01dbf92e168633/lib/path.js#L56 + var splitDeviceRe = /^([a-zA-Z]:|[\\\/]{2}[^\\\/]+[\\\/]+[^\\\/]+)?([\\\/])?([\s\S]*?)$/; + var result = splitDeviceRe.exec(path); + var device = result[1] || ''; + var isUnc = Boolean(device && device.charAt(1) !== ':'); + + // UNC paths are always absolute + return Boolean(result[2] || isUnc); +} + +module.exports = process.platform === 'win32' ? win32 : posix; +module.exports.posix = posix; +module.exports.win32 = win32; + +}).call(this,require('_process')) +},{"_process":24}],24:[function(require,module,exports){ +// shim for using process in browser +var process = module.exports = {}; + +// cached from whatever global is present so that test runners that stub it +// don't break things. But we need to wrap it in a try catch in case it is +// wrapped in strict mode code which doesn't define any globals. It's inside a +// function because try/catches deoptimize in certain engines. + +var cachedSetTimeout; +var cachedClearTimeout; + +function defaultSetTimout() { + throw new Error('setTimeout has not been defined'); +} +function defaultClearTimeout () { + throw new Error('clearTimeout has not been defined'); +} +(function () { + try { + if (typeof setTimeout === 'function') { + cachedSetTimeout = setTimeout; + } else { + cachedSetTimeout = defaultSetTimout; + } + } catch (e) { + cachedSetTimeout = defaultSetTimout; + } + try { + if (typeof clearTimeout === 'function') { + cachedClearTimeout = clearTimeout; + } else { + cachedClearTimeout = defaultClearTimeout; + } + } catch (e) { + cachedClearTimeout = defaultClearTimeout; + } +} ()) +function runTimeout(fun) { + if (cachedSetTimeout === setTimeout) { + //normal enviroments in sane situations + return setTimeout(fun, 0); + } + // if setTimeout wasn't available but was latter defined + if ((cachedSetTimeout === defaultSetTimout || !cachedSetTimeout) && setTimeout) { + cachedSetTimeout = setTimeout; + return setTimeout(fun, 0); + } + try { + // when when somebody has screwed with setTimeout but no I.E. maddness + return cachedSetTimeout(fun, 0); + } catch(e){ + try { + // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally + return cachedSetTimeout.call(null, fun, 0); + } catch(e){ + // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error + return cachedSetTimeout.call(this, fun, 0); + } + } + + +} +function runClearTimeout(marker) { + if (cachedClearTimeout === clearTimeout) { + //normal enviroments in sane situations + return clearTimeout(marker); + } + // if clearTimeout wasn't available but was latter defined + if ((cachedClearTimeout === defaultClearTimeout || !cachedClearTimeout) && clearTimeout) { + cachedClearTimeout = clearTimeout; + return clearTimeout(marker); + } + try { + // when when somebody has screwed with setTimeout but no I.E. maddness + return cachedClearTimeout(marker); + } catch (e){ + try { + // When we are in I.E. but the script has been evaled so I.E. doesn't trust the global object when called normally + return cachedClearTimeout.call(null, marker); + } catch (e){ + // same as above but when it's a version of I.E. that must have the global object for 'this', hopfully our context correct otherwise it will throw a global error. + // Some versions of I.E. have different rules for clearTimeout vs setTimeout + return cachedClearTimeout.call(this, marker); + } + } + + + +} +var queue = []; +var draining = false; +var currentQueue; +var queueIndex = -1; + +function cleanUpNextTick() { + if (!draining || !currentQueue) { + return; + } + draining = false; + if (currentQueue.length) { + queue = currentQueue.concat(queue); + } else { + queueIndex = -1; + } + if (queue.length) { + drainQueue(); + } +} + +function drainQueue() { + if (draining) { + return; + } + var timeout = runTimeout(cleanUpNextTick); + draining = true; + + var len = queue.length; + while(len) { + currentQueue = queue; + queue = []; + while (++queueIndex < len) { + if (currentQueue) { + currentQueue[queueIndex].run(); + } + } + queueIndex = -1; + len = queue.length; + } + currentQueue = null; + draining = false; + runClearTimeout(timeout); +} + +process.nextTick = function (fun) { + var args = new Array(arguments.length - 1); + if (arguments.length > 1) { + for (var i = 1; i < arguments.length; i++) { + args[i - 1] = arguments[i]; + } + } + queue.push(new Item(fun, args)); + if (queue.length === 1 && !draining) { + runTimeout(drainQueue); + } +}; + +// v8 likes predictible objects +function Item(fun, array) { + this.fun = fun; + this.array = array; +} +Item.prototype.run = function () { + this.fun.apply(null, this.array); +}; +process.title = 'browser'; +process.browser = true; +process.env = {}; +process.argv = []; +process.version = ''; // empty string to avoid regexp issues +process.versions = {}; + +function noop() {} + +process.on = noop; +process.addListener = noop; +process.once = noop; +process.off = noop; +process.removeListener = noop; +process.removeAllListeners = noop; +process.emit = noop; +process.prependListener = noop; +process.prependOnceListener = noop; + +process.listeners = function (name) { return [] } + +process.binding = function (name) { + throw new Error('process.binding is not supported'); +}; + +process.cwd = function () { return '/' }; +process.chdir = function (dir) { + throw new Error('process.chdir is not supported'); +}; +process.umask = function() { return 0; }; + +},{}],25:[function(require,module,exports){ +// Underscore.js 1.8.3 +// http://underscorejs.org +// (c) 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors +// Underscore may be freely distributed under the MIT license. + +(function() { + + // Baseline setup + // -------------- + + // Establish the root object, `window` in the browser, or `exports` on the server. + var root = this; + + // Save the previous value of the `_` variable. + var previousUnderscore = root._; + + // Save bytes in the minified (but not gzipped) version: + var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype; + + // Create quick reference variables for speed access to core prototypes. + var + push = ArrayProto.push, + slice = ArrayProto.slice, + toString = ObjProto.toString, + hasOwnProperty = ObjProto.hasOwnProperty; + + // All **ECMAScript 5** native function implementations that we hope to use + // are declared here. + var + nativeIsArray = Array.isArray, + nativeKeys = Object.keys, + nativeBind = FuncProto.bind, + nativeCreate = Object.create; + + // Naked function reference for surrogate-prototype-swapping. + var Ctor = function(){}; + + // Create a safe reference to the Underscore object for use below. + var _ = function(obj) { + if (obj instanceof _) return obj; + if (!(this instanceof _)) return new _(obj); + this._wrapped = obj; + }; + + // Export the Underscore object for **Node.js**, with + // backwards-compatibility for the old `require()` API. If we're in + // the browser, add `_` as a global object. + if (typeof exports !== 'undefined') { + if (typeof module !== 'undefined' && module.exports) { + exports = module.exports = _; + } + exports._ = _; + } else { + root._ = _; + } + + // Current version. + _.VERSION = '1.8.3'; + + // Internal function that returns an efficient (for current engines) version + // of the passed-in callback, to be repeatedly applied in other Underscore + // functions. + var optimizeCb = function(func, context, argCount) { + if (context === void 0) return func; + switch (argCount == null ? 3 : argCount) { + case 1: return function(value) { + return func.call(context, value); + }; + case 2: return function(value, other) { + return func.call(context, value, other); + }; + case 3: return function(value, index, collection) { + return func.call(context, value, index, collection); + }; + case 4: return function(accumulator, value, index, collection) { + return func.call(context, accumulator, value, index, collection); + }; + } + return function() { + return func.apply(context, arguments); + }; + }; + + // A mostly-internal function to generate callbacks that can be applied + // to each element in a collection, returning the desired result — either + // identity, an arbitrary callback, a property matcher, or a property accessor. + var cb = function(value, context, argCount) { + if (value == null) return _.identity; + if (_.isFunction(value)) return optimizeCb(value, context, argCount); + if (_.isObject(value)) return _.matcher(value); + return _.property(value); + }; + _.iteratee = function(value, context) { + return cb(value, context, Infinity); + }; + + // An internal function for creating assigner functions. + var createAssigner = function(keysFunc, undefinedOnly) { + return function(obj) { + var length = arguments.length; + if (length < 2 || obj == null) return obj; + for (var index = 1; index < length; index++) { + var source = arguments[index], + keys = keysFunc(source), + l = keys.length; + for (var i = 0; i < l; i++) { + var key = keys[i]; + if (!undefinedOnly || obj[key] === void 0) obj[key] = source[key]; + } + } + return obj; + }; + }; + + // An internal function for creating a new object that inherits from another. + var baseCreate = function(prototype) { + if (!_.isObject(prototype)) return {}; + if (nativeCreate) return nativeCreate(prototype); + Ctor.prototype = prototype; + var result = new Ctor; + Ctor.prototype = null; + return result; + }; + + var property = function(key) { + return function(obj) { + return obj == null ? void 0 : obj[key]; + }; + }; + + // Helper for collection methods to determine whether a collection + // should be iterated as an array or as an object + // Related: http://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength + // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094 + var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1; + var getLength = property('length'); + var isArrayLike = function(collection) { + var length = getLength(collection); + return typeof length == 'number' && length >= 0 && length <= MAX_ARRAY_INDEX; + }; + + // Collection Functions + // -------------------- + + // The cornerstone, an `each` implementation, aka `forEach`. + // Handles raw objects in addition to array-likes. Treats all + // sparse array-likes as if they were dense. + _.each = _.forEach = function(obj, iteratee, context) { + iteratee = optimizeCb(iteratee, context); + var i, length; + if (isArrayLike(obj)) { + for (i = 0, length = obj.length; i < length; i++) { + iteratee(obj[i], i, obj); + } + } else { + var keys = _.keys(obj); + for (i = 0, length = keys.length; i < length; i++) { + iteratee(obj[keys[i]], keys[i], obj); + } + } + return obj; + }; + + // Return the results of applying the iteratee to each element. + _.map = _.collect = function(obj, iteratee, context) { + iteratee = cb(iteratee, context); + var keys = !isArrayLike(obj) && _.keys(obj), + length = (keys || obj).length, + results = Array(length); + for (var index = 0; index < length; index++) { + var currentKey = keys ? keys[index] : index; + results[index] = iteratee(obj[currentKey], currentKey, obj); + } + return results; + }; + + // Create a reducing function iterating left or right. + function createReduce(dir) { + // Optimized iterator function as using arguments.length + // in the main function will deoptimize the, see #1991. + function iterator(obj, iteratee, memo, keys, index, length) { + for (; index >= 0 && index < length; index += dir) { + var currentKey = keys ? keys[index] : index; + memo = iteratee(memo, obj[currentKey], currentKey, obj); + } + return memo; + } + + return function(obj, iteratee, memo, context) { + iteratee = optimizeCb(iteratee, context, 4); + var keys = !isArrayLike(obj) && _.keys(obj), + length = (keys || obj).length, + index = dir > 0 ? 0 : length - 1; + // Determine the initial value if none is provided. + if (arguments.length < 3) { + memo = obj[keys ? keys[index] : index]; + index += dir; + } + return iterator(obj, iteratee, memo, keys, index, length); + }; + } + + // **Reduce** builds up a single result from a list of values, aka `inject`, + // or `foldl`. + _.reduce = _.foldl = _.inject = createReduce(1); + + // The right-associative version of reduce, also known as `foldr`. + _.reduceRight = _.foldr = createReduce(-1); + + // Return the first value which passes a truth test. Aliased as `detect`. + _.find = _.detect = function(obj, predicate, context) { + var key; + if (isArrayLike(obj)) { + key = _.findIndex(obj, predicate, context); + } else { + key = _.findKey(obj, predicate, context); + } + if (key !== void 0 && key !== -1) return obj[key]; + }; + + // Return all the elements that pass a truth test. + // Aliased as `select`. + _.filter = _.select = function(obj, predicate, context) { + var results = []; + predicate = cb(predicate, context); + _.each(obj, function(value, index, list) { + if (predicate(value, index, list)) results.push(value); + }); + return results; + }; + + // Return all the elements for which a truth test fails. + _.reject = function(obj, predicate, context) { + return _.filter(obj, _.negate(cb(predicate)), context); + }; + + // Determine whether all of the elements match a truth test. + // Aliased as `all`. + _.every = _.all = function(obj, predicate, context) { + predicate = cb(predicate, context); + var keys = !isArrayLike(obj) && _.keys(obj), + length = (keys || obj).length; + for (var index = 0; index < length; index++) { + var currentKey = keys ? keys[index] : index; + if (!predicate(obj[currentKey], currentKey, obj)) return false; + } + return true; + }; + + // Determine if at least one element in the object matches a truth test. + // Aliased as `any`. + _.some = _.any = function(obj, predicate, context) { + predicate = cb(predicate, context); + var keys = !isArrayLike(obj) && _.keys(obj), + length = (keys || obj).length; + for (var index = 0; index < length; index++) { + var currentKey = keys ? keys[index] : index; + if (predicate(obj[currentKey], currentKey, obj)) return true; + } + return false; + }; + + // Determine if the array or object contains a given item (using `===`). + // Aliased as `includes` and `include`. + _.contains = _.includes = _.include = function(obj, item, fromIndex, guard) { + if (!isArrayLike(obj)) obj = _.values(obj); + if (typeof fromIndex != 'number' || guard) fromIndex = 0; + return _.indexOf(obj, item, fromIndex) >= 0; + }; + + // Invoke a method (with arguments) on every item in a collection. + _.invoke = function(obj, method) { + var args = slice.call(arguments, 2); + var isFunc = _.isFunction(method); + return _.map(obj, function(value) { + var func = isFunc ? method : value[method]; + return func == null ? func : func.apply(value, args); + }); + }; + + // Convenience version of a common use case of `map`: fetching a property. + _.pluck = function(obj, key) { + return _.map(obj, _.property(key)); + }; + + // Convenience version of a common use case of `filter`: selecting only objects + // containing specific `key:value` pairs. + _.where = function(obj, attrs) { + return _.filter(obj, _.matcher(attrs)); + }; + + // Convenience version of a common use case of `find`: getting the first object + // containing specific `key:value` pairs. + _.findWhere = function(obj, attrs) { + return _.find(obj, _.matcher(attrs)); + }; + + // Return the maximum element (or element-based computation). + _.max = function(obj, iteratee, context) { + var result = -Infinity, lastComputed = -Infinity, + value, computed; + if (iteratee == null && obj != null) { + obj = isArrayLike(obj) ? obj : _.values(obj); + for (var i = 0, length = obj.length; i < length; i++) { + value = obj[i]; + if (value > result) { + result = value; + } + } + } else { + iteratee = cb(iteratee, context); + _.each(obj, function(value, index, list) { + computed = iteratee(value, index, list); + if (computed > lastComputed || computed === -Infinity && result === -Infinity) { + result = value; + lastComputed = computed; + } + }); + } + return result; + }; + + // Return the minimum element (or element-based computation). + _.min = function(obj, iteratee, context) { + var result = Infinity, lastComputed = Infinity, + value, computed; + if (iteratee == null && obj != null) { + obj = isArrayLike(obj) ? obj : _.values(obj); + for (var i = 0, length = obj.length; i < length; i++) { + value = obj[i]; + if (value < result) { + result = value; + } + } + } else { + iteratee = cb(iteratee, context); + _.each(obj, function(value, index, list) { + computed = iteratee(value, index, list); + if (computed < lastComputed || computed === Infinity && result === Infinity) { + result = value; + lastComputed = computed; + } + }); + } + return result; + }; + + // Shuffle a collection, using the modern version of the + // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle). + _.shuffle = function(obj) { + var set = isArrayLike(obj) ? obj : _.values(obj); + var length = set.length; + var shuffled = Array(length); + for (var index = 0, rand; index < length; index++) { + rand = _.random(0, index); + if (rand !== index) shuffled[index] = shuffled[rand]; + shuffled[rand] = set[index]; + } + return shuffled; + }; + + // Sample **n** random values from a collection. + // If **n** is not specified, returns a single random element. + // The internal `guard` argument allows it to work with `map`. + _.sample = function(obj, n, guard) { + if (n == null || guard) { + if (!isArrayLike(obj)) obj = _.values(obj); + return obj[_.random(obj.length - 1)]; + } + return _.shuffle(obj).slice(0, Math.max(0, n)); + }; + + // Sort the object's values by a criterion produced by an iteratee. + _.sortBy = function(obj, iteratee, context) { + iteratee = cb(iteratee, context); + return _.pluck(_.map(obj, function(value, index, list) { + return { + value: value, + index: index, + criteria: iteratee(value, index, list) + }; + }).sort(function(left, right) { + var a = left.criteria; + var b = right.criteria; + if (a !== b) { + if (a > b || a === void 0) return 1; + if (a < b || b === void 0) return -1; + } + return left.index - right.index; + }), 'value'); + }; + + // An internal function used for aggregate "group by" operations. + var group = function(behavior) { + return function(obj, iteratee, context) { + var result = {}; + iteratee = cb(iteratee, context); + _.each(obj, function(value, index) { + var key = iteratee(value, index, obj); + behavior(result, value, key); + }); + return result; + }; + }; + + // Groups the object's values by a criterion. Pass either a string attribute + // to group by, or a function that returns the criterion. + _.groupBy = group(function(result, value, key) { + if (_.has(result, key)) result[key].push(value); else result[key] = [value]; + }); + + // Indexes the object's values by a criterion, similar to `groupBy`, but for + // when you know that your index values will be unique. + _.indexBy = group(function(result, value, key) { + result[key] = value; + }); + + // Counts instances of an object that group by a certain criterion. Pass + // either a string attribute to count by, or a function that returns the + // criterion. + _.countBy = group(function(result, value, key) { + if (_.has(result, key)) result[key]++; else result[key] = 1; + }); + + // Safely create a real, live array from anything iterable. + _.toArray = function(obj) { + if (!obj) return []; + if (_.isArray(obj)) return slice.call(obj); + if (isArrayLike(obj)) return _.map(obj, _.identity); + return _.values(obj); + }; + + // Return the number of elements in an object. + _.size = function(obj) { + if (obj == null) return 0; + return isArrayLike(obj) ? obj.length : _.keys(obj).length; + }; + + // Split a collection into two arrays: one whose elements all satisfy the given + // predicate, and one whose elements all do not satisfy the predicate. + _.partition = function(obj, predicate, context) { + predicate = cb(predicate, context); + var pass = [], fail = []; + _.each(obj, function(value, key, obj) { + (predicate(value, key, obj) ? pass : fail).push(value); + }); + return [pass, fail]; + }; + + // Array Functions + // --------------- + + // Get the first element of an array. Passing **n** will return the first N + // values in the array. Aliased as `head` and `take`. The **guard** check + // allows it to work with `_.map`. + _.first = _.head = _.take = function(array, n, guard) { + if (array == null) return void 0; + if (n == null || guard) return array[0]; + return _.initial(array, array.length - n); + }; + + // Returns everything but the last entry of the array. Especially useful on + // the arguments object. Passing **n** will return all the values in + // the array, excluding the last N. + _.initial = function(array, n, guard) { + return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n))); + }; + + // Get the last element of an array. Passing **n** will return the last N + // values in the array. + _.last = function(array, n, guard) { + if (array == null) return void 0; + if (n == null || guard) return array[array.length - 1]; + return _.rest(array, Math.max(0, array.length - n)); + }; + + // Returns everything but the first entry of the array. Aliased as `tail` and `drop`. + // Especially useful on the arguments object. Passing an **n** will return + // the rest N values in the array. + _.rest = _.tail = _.drop = function(array, n, guard) { + return slice.call(array, n == null || guard ? 1 : n); + }; + + // Trim out all falsy values from an array. + _.compact = function(array) { + return _.filter(array, _.identity); + }; + + // Internal implementation of a recursive `flatten` function. + var flatten = function(input, shallow, strict, startIndex) { + var output = [], idx = 0; + for (var i = startIndex || 0, length = getLength(input); i < length; i++) { + var value = input[i]; + if (isArrayLike(value) && (_.isArray(value) || _.isArguments(value))) { + //flatten current level of array or arguments object + if (!shallow) value = flatten(value, shallow, strict); + var j = 0, len = value.length; + output.length += len; + while (j < len) { + output[idx++] = value[j++]; + } + } else if (!strict) { + output[idx++] = value; + } + } + return output; + }; + + // Flatten out an array, either recursively (by default), or just one level. + _.flatten = function(array, shallow) { + return flatten(array, shallow, false); + }; + + // Return a version of the array that does not contain the specified value(s). + _.without = function(array) { + return _.difference(array, slice.call(arguments, 1)); + }; + + // Produce a duplicate-free version of the array. If the array has already + // been sorted, you have the option of using a faster algorithm. + // Aliased as `unique`. + _.uniq = _.unique = function(array, isSorted, iteratee, context) { + if (!_.isBoolean(isSorted)) { + context = iteratee; + iteratee = isSorted; + isSorted = false; + } + if (iteratee != null) iteratee = cb(iteratee, context); + var result = []; + var seen = []; + for (var i = 0, length = getLength(array); i < length; i++) { + var value = array[i], + computed = iteratee ? iteratee(value, i, array) : value; + if (isSorted) { + if (!i || seen !== computed) result.push(value); + seen = computed; + } else if (iteratee) { + if (!_.contains(seen, computed)) { + seen.push(computed); + result.push(value); + } + } else if (!_.contains(result, value)) { + result.push(value); + } + } + return result; + }; + + // Produce an array that contains the union: each distinct element from all of + // the passed-in arrays. + _.union = function() { + return _.uniq(flatten(arguments, true, true)); + }; + + // Produce an array that contains every item shared between all the + // passed-in arrays. + _.intersection = function(array) { + var result = []; + var argsLength = arguments.length; + for (var i = 0, length = getLength(array); i < length; i++) { + var item = array[i]; + if (_.contains(result, item)) continue; + for (var j = 1; j < argsLength; j++) { + if (!_.contains(arguments[j], item)) break; + } + if (j === argsLength) result.push(item); + } + return result; + }; + + // Take the difference between one array and a number of other arrays. + // Only the elements present in just the first array will remain. + _.difference = function(array) { + var rest = flatten(arguments, true, true, 1); + return _.filter(array, function(value){ + return !_.contains(rest, value); + }); + }; + + // Zip together multiple lists into a single array -- elements that share + // an index go together. + _.zip = function() { + return _.unzip(arguments); + }; + + // Complement of _.zip. Unzip accepts an array of arrays and groups + // each array's elements on shared indices + _.unzip = function(array) { + var length = array && _.max(array, getLength).length || 0; + var result = Array(length); + + for (var index = 0; index < length; index++) { + result[index] = _.pluck(array, index); + } + return result; + }; + + // Converts lists into objects. Pass either a single array of `[key, value]` + // pairs, or two parallel arrays of the same length -- one of keys, and one of + // the corresponding values. + _.object = function(list, values) { + var result = {}; + for (var i = 0, length = getLength(list); i < length; i++) { + if (values) { + result[list[i]] = values[i]; + } else { + result[list[i][0]] = list[i][1]; + } + } + return result; + }; + + // Generator function to create the findIndex and findLastIndex functions + function createPredicateIndexFinder(dir) { + return function(array, predicate, context) { + predicate = cb(predicate, context); + var length = getLength(array); + var index = dir > 0 ? 0 : length - 1; + for (; index >= 0 && index < length; index += dir) { + if (predicate(array[index], index, array)) return index; + } + return -1; + }; + } + + // Returns the first index on an array-like that passes a predicate test + _.findIndex = createPredicateIndexFinder(1); + _.findLastIndex = createPredicateIndexFinder(-1); + + // Use a comparator function to figure out the smallest index at which + // an object should be inserted so as to maintain order. Uses binary search. + _.sortedIndex = function(array, obj, iteratee, context) { + iteratee = cb(iteratee, context, 1); + var value = iteratee(obj); + var low = 0, high = getLength(array); + while (low < high) { + var mid = Math.floor((low + high) / 2); + if (iteratee(array[mid]) < value) low = mid + 1; else high = mid; + } + return low; + }; + + // Generator function to create the indexOf and lastIndexOf functions + function createIndexFinder(dir, predicateFind, sortedIndex) { + return function(array, item, idx) { + var i = 0, length = getLength(array); + if (typeof idx == 'number') { + if (dir > 0) { + i = idx >= 0 ? idx : Math.max(idx + length, i); + } else { + length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1; + } + } else if (sortedIndex && idx && length) { + idx = sortedIndex(array, item); + return array[idx] === item ? idx : -1; + } + if (item !== item) { + idx = predicateFind(slice.call(array, i, length), _.isNaN); + return idx >= 0 ? idx + i : -1; + } + for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) { + if (array[idx] === item) return idx; + } + return -1; + }; + } + + // Return the position of the first occurrence of an item in an array, + // or -1 if the item is not included in the array. + // If the array is large and already in sort order, pass `true` + // for **isSorted** to use binary search. + _.indexOf = createIndexFinder(1, _.findIndex, _.sortedIndex); + _.lastIndexOf = createIndexFinder(-1, _.findLastIndex); + + // Generate an integer Array containing an arithmetic progression. A port of + // the native Python `range()` function. See + // [the Python documentation](http://docs.python.org/library/functions.html#range). + _.range = function(start, stop, step) { + if (stop == null) { + stop = start || 0; + start = 0; + } + step = step || 1; + + var length = Math.max(Math.ceil((stop - start) / step), 0); + var range = Array(length); + + for (var idx = 0; idx < length; idx++, start += step) { + range[idx] = start; + } + + return range; + }; + + // Function (ahem) Functions + // ------------------ + + // Determines whether to execute a function as a constructor + // or a normal function with the provided arguments + var executeBound = function(sourceFunc, boundFunc, context, callingContext, args) { + if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args); + var self = baseCreate(sourceFunc.prototype); + var result = sourceFunc.apply(self, args); + if (_.isObject(result)) return result; + return self; + }; + + // Create a function bound to a given object (assigning `this`, and arguments, + // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if + // available. + _.bind = function(func, context) { + if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1)); + if (!_.isFunction(func)) throw new TypeError('Bind must be called on a function'); + var args = slice.call(arguments, 2); + var bound = function() { + return executeBound(func, bound, context, this, args.concat(slice.call(arguments))); + }; + return bound; + }; + + // Partially apply a function by creating a version that has had some of its + // arguments pre-filled, without changing its dynamic `this` context. _ acts + // as a placeholder, allowing any combination of arguments to be pre-filled. + _.partial = function(func) { + var boundArgs = slice.call(arguments, 1); + var bound = function() { + var position = 0, length = boundArgs.length; + var args = Array(length); + for (var i = 0; i < length; i++) { + args[i] = boundArgs[i] === _ ? arguments[position++] : boundArgs[i]; + } + while (position < arguments.length) args.push(arguments[position++]); + return executeBound(func, bound, this, this, args); + }; + return bound; + }; + + // Bind a number of an object's methods to that object. Remaining arguments + // are the method names to be bound. Useful for ensuring that all callbacks + // defined on an object belong to it. + _.bindAll = function(obj) { + var i, length = arguments.length, key; + if (length <= 1) throw new Error('bindAll must be passed function names'); + for (i = 1; i < length; i++) { + key = arguments[i]; + obj[key] = _.bind(obj[key], obj); + } + return obj; + }; + + // Memoize an expensive function by storing its results. + _.memoize = function(func, hasher) { + var memoize = function(key) { + var cache = memoize.cache; + var address = '' + (hasher ? hasher.apply(this, arguments) : key); + if (!_.has(cache, address)) cache[address] = func.apply(this, arguments); + return cache[address]; + }; + memoize.cache = {}; + return memoize; + }; + + // Delays a function for the given number of milliseconds, and then calls + // it with the arguments supplied. + _.delay = function(func, wait) { + var args = slice.call(arguments, 2); + return setTimeout(function(){ + return func.apply(null, args); + }, wait); + }; + + // Defers a function, scheduling it to run after the current call stack has + // cleared. + _.defer = _.partial(_.delay, _, 1); + + // Returns a function, that, when invoked, will only be triggered at most once + // during a given window of time. Normally, the throttled function will run + // as much as it can, without ever going more than once per `wait` duration; + // but if you'd like to disable the execution on the leading edge, pass + // `{leading: false}`. To disable execution on the trailing edge, ditto. + _.throttle = function(func, wait, options) { + var context, args, result; + var timeout = null; + var previous = 0; + if (!options) options = {}; + var later = function() { + previous = options.leading === false ? 0 : _.now(); + timeout = null; + result = func.apply(context, args); + if (!timeout) context = args = null; + }; + return function() { + var now = _.now(); + if (!previous && options.leading === false) previous = now; + var remaining = wait - (now - previous); + context = this; + args = arguments; + if (remaining <= 0 || remaining > wait) { + if (timeout) { + clearTimeout(timeout); + timeout = null; + } + previous = now; + result = func.apply(context, args); + if (!timeout) context = args = null; + } else if (!timeout && options.trailing !== false) { + timeout = setTimeout(later, remaining); + } + return result; + }; + }; + + // Returns a function, that, as long as it continues to be invoked, will not + // be triggered. The function will be called after it stops being called for + // N milliseconds. If `immediate` is passed, trigger the function on the + // leading edge, instead of the trailing. + _.debounce = function(func, wait, immediate) { + var timeout, args, context, timestamp, result; + + var later = function() { + var last = _.now() - timestamp; + + if (last < wait && last >= 0) { + timeout = setTimeout(later, wait - last); + } else { + timeout = null; + if (!immediate) { + result = func.apply(context, args); + if (!timeout) context = args = null; + } + } + }; + + return function() { + context = this; + args = arguments; + timestamp = _.now(); + var callNow = immediate && !timeout; + if (!timeout) timeout = setTimeout(later, wait); + if (callNow) { + result = func.apply(context, args); + context = args = null; + } + + return result; + }; + }; + + // Returns the first function passed as an argument to the second, + // allowing you to adjust arguments, run code before and after, and + // conditionally execute the original function. + _.wrap = function(func, wrapper) { + return _.partial(wrapper, func); + }; + + // Returns a negated version of the passed-in predicate. + _.negate = function(predicate) { + return function() { + return !predicate.apply(this, arguments); + }; + }; + + // Returns a function that is the composition of a list of functions, each + // consuming the return value of the function that follows. + _.compose = function() { + var args = arguments; + var start = args.length - 1; + return function() { + var i = start; + var result = args[start].apply(this, arguments); + while (i--) result = args[i].call(this, result); + return result; + }; + }; + + // Returns a function that will only be executed on and after the Nth call. + _.after = function(times, func) { + return function() { + if (--times < 1) { + return func.apply(this, arguments); + } + }; + }; + + // Returns a function that will only be executed up to (but not including) the Nth call. + _.before = function(times, func) { + var memo; + return function() { + if (--times > 0) { + memo = func.apply(this, arguments); + } + if (times <= 1) func = null; + return memo; + }; + }; + + // Returns a function that will be executed at most one time, no matter how + // often you call it. Useful for lazy initialization. + _.once = _.partial(_.before, 2); + + // Object Functions + // ---------------- + + // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed. + var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString'); + var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString', + 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString']; + + function collectNonEnumProps(obj, keys) { + var nonEnumIdx = nonEnumerableProps.length; + var constructor = obj.constructor; + var proto = (_.isFunction(constructor) && constructor.prototype) || ObjProto; + + // Constructor is a special case. + var prop = 'constructor'; + if (_.has(obj, prop) && !_.contains(keys, prop)) keys.push(prop); + + while (nonEnumIdx--) { + prop = nonEnumerableProps[nonEnumIdx]; + if (prop in obj && obj[prop] !== proto[prop] && !_.contains(keys, prop)) { + keys.push(prop); + } + } + } + + // Retrieve the names of an object's own properties. + // Delegates to **ECMAScript 5**'s native `Object.keys` + _.keys = function(obj) { + if (!_.isObject(obj)) return []; + if (nativeKeys) return nativeKeys(obj); + var keys = []; + for (var key in obj) if (_.has(obj, key)) keys.push(key); + // Ahem, IE < 9. + if (hasEnumBug) collectNonEnumProps(obj, keys); + return keys; + }; + + // Retrieve all the property names of an object. + _.allKeys = function(obj) { + if (!_.isObject(obj)) return []; + var keys = []; + for (var key in obj) keys.push(key); + // Ahem, IE < 9. + if (hasEnumBug) collectNonEnumProps(obj, keys); + return keys; + }; + + // Retrieve the values of an object's properties. + _.values = function(obj) { + var keys = _.keys(obj); + var length = keys.length; + var values = Array(length); + for (var i = 0; i < length; i++) { + values[i] = obj[keys[i]]; + } + return values; + }; + + // Returns the results of applying the iteratee to each element of the object + // In contrast to _.map it returns an object + _.mapObject = function(obj, iteratee, context) { + iteratee = cb(iteratee, context); + var keys = _.keys(obj), + length = keys.length, + results = {}, + currentKey; + for (var index = 0; index < length; index++) { + currentKey = keys[index]; + results[currentKey] = iteratee(obj[currentKey], currentKey, obj); + } + return results; + }; + + // Convert an object into a list of `[key, value]` pairs. + _.pairs = function(obj) { + var keys = _.keys(obj); + var length = keys.length; + var pairs = Array(length); + for (var i = 0; i < length; i++) { + pairs[i] = [keys[i], obj[keys[i]]]; + } + return pairs; + }; + + // Invert the keys and values of an object. The values must be serializable. + _.invert = function(obj) { + var result = {}; + var keys = _.keys(obj); + for (var i = 0, length = keys.length; i < length; i++) { + result[obj[keys[i]]] = keys[i]; + } + return result; + }; + + // Return a sorted list of the function names available on the object. + // Aliased as `methods` + _.functions = _.methods = function(obj) { + var names = []; + for (var key in obj) { + if (_.isFunction(obj[key])) names.push(key); + } + return names.sort(); + }; + + // Extend a given object with all the properties in passed-in object(s). + _.extend = createAssigner(_.allKeys); + + // Assigns a given object with all the own properties in the passed-in object(s) + // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign) + _.extendOwn = _.assign = createAssigner(_.keys); + + // Returns the first key on an object that passes a predicate test + _.findKey = function(obj, predicate, context) { + predicate = cb(predicate, context); + var keys = _.keys(obj), key; + for (var i = 0, length = keys.length; i < length; i++) { + key = keys[i]; + if (predicate(obj[key], key, obj)) return key; + } + }; + + // Return a copy of the object only containing the whitelisted properties. + _.pick = function(object, oiteratee, context) { + var result = {}, obj = object, iteratee, keys; + if (obj == null) return result; + if (_.isFunction(oiteratee)) { + keys = _.allKeys(obj); + iteratee = optimizeCb(oiteratee, context); + } else { + keys = flatten(arguments, false, false, 1); + iteratee = function(value, key, obj) { return key in obj; }; + obj = Object(obj); + } + for (var i = 0, length = keys.length; i < length; i++) { + var key = keys[i]; + var value = obj[key]; + if (iteratee(value, key, obj)) result[key] = value; + } + return result; + }; + + // Return a copy of the object without the blacklisted properties. + _.omit = function(obj, iteratee, context) { + if (_.isFunction(iteratee)) { + iteratee = _.negate(iteratee); + } else { + var keys = _.map(flatten(arguments, false, false, 1), String); + iteratee = function(value, key) { + return !_.contains(keys, key); + }; + } + return _.pick(obj, iteratee, context); + }; + + // Fill in a given object with default properties. + _.defaults = createAssigner(_.allKeys, true); + + // Creates an object that inherits from the given prototype object. + // If additional properties are provided then they will be added to the + // created object. + _.create = function(prototype, props) { + var result = baseCreate(prototype); + if (props) _.extendOwn(result, props); + return result; + }; + + // Create a (shallow-cloned) duplicate of an object. + _.clone = function(obj) { + if (!_.isObject(obj)) return obj; + return _.isArray(obj) ? obj.slice() : _.extend({}, obj); + }; + + // Invokes interceptor with the obj, and then returns obj. + // The primary purpose of this method is to "tap into" a method chain, in + // order to perform operations on intermediate results within the chain. + _.tap = function(obj, interceptor) { + interceptor(obj); + return obj; + }; + + // Returns whether an object has a given set of `key:value` pairs. + _.isMatch = function(object, attrs) { + var keys = _.keys(attrs), length = keys.length; + if (object == null) return !length; + var obj = Object(object); + for (var i = 0; i < length; i++) { + var key = keys[i]; + if (attrs[key] !== obj[key] || !(key in obj)) return false; + } + return true; + }; + + + // Internal recursive comparison function for `isEqual`. + var eq = function(a, b, aStack, bStack) { + // Identical objects are equal. `0 === -0`, but they aren't identical. + // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal). + if (a === b) return a !== 0 || 1 / a === 1 / b; + // A strict comparison is necessary because `null == undefined`. + if (a == null || b == null) return a === b; + // Unwrap any wrapped objects. + if (a instanceof _) a = a._wrapped; + if (b instanceof _) b = b._wrapped; + // Compare `[[Class]]` names. + var className = toString.call(a); + if (className !== toString.call(b)) return false; + switch (className) { + // Strings, numbers, regular expressions, dates, and booleans are compared by value. + case '[object RegExp]': + // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i') + case '[object String]': + // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is + // equivalent to `new String("5")`. + return '' + a === '' + b; + case '[object Number]': + // `NaN`s are equivalent, but non-reflexive. + // Object(NaN) is equivalent to NaN + if (+a !== +a) return +b !== +b; + // An `egal` comparison is performed for other numeric values. + return +a === 0 ? 1 / +a === 1 / b : +a === +b; + case '[object Date]': + case '[object Boolean]': + // Coerce dates and booleans to numeric primitive values. Dates are compared by their + // millisecond representations. Note that invalid dates with millisecond representations + // of `NaN` are not equivalent. + return +a === +b; + } + + var areArrays = className === '[object Array]'; + if (!areArrays) { + if (typeof a != 'object' || typeof b != 'object') return false; + + // Objects with different constructors are not equivalent, but `Object`s or `Array`s + // from different frames are. + var aCtor = a.constructor, bCtor = b.constructor; + if (aCtor !== bCtor && !(_.isFunction(aCtor) && aCtor instanceof aCtor && + _.isFunction(bCtor) && bCtor instanceof bCtor) + && ('constructor' in a && 'constructor' in b)) { + return false; + } + } + // Assume equality for cyclic structures. The algorithm for detecting cyclic + // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`. + + // Initializing stack of traversed objects. + // It's done here since we only need them for objects and arrays comparison. + aStack = aStack || []; + bStack = bStack || []; + var length = aStack.length; + while (length--) { + // Linear search. Performance is inversely proportional to the number of + // unique nested structures. + if (aStack[length] === a) return bStack[length] === b; + } + + // Add the first object to the stack of traversed objects. + aStack.push(a); + bStack.push(b); + + // Recursively compare objects and arrays. + if (areArrays) { + // Compare array lengths to determine if a deep comparison is necessary. + length = a.length; + if (length !== b.length) return false; + // Deep compare the contents, ignoring non-numeric properties. + while (length--) { + if (!eq(a[length], b[length], aStack, bStack)) return false; + } + } else { + // Deep compare objects. + var keys = _.keys(a), key; + length = keys.length; + // Ensure that both objects contain the same number of properties before comparing deep equality. + if (_.keys(b).length !== length) return false; + while (length--) { + // Deep compare each member + key = keys[length]; + if (!(_.has(b, key) && eq(a[key], b[key], aStack, bStack))) return false; + } + } + // Remove the first object from the stack of traversed objects. + aStack.pop(); + bStack.pop(); + return true; + }; + + // Perform a deep comparison to check if two objects are equal. + _.isEqual = function(a, b) { + return eq(a, b); + }; + + // Is a given array, string, or object empty? + // An "empty" object has no enumerable own-properties. + _.isEmpty = function(obj) { + if (obj == null) return true; + if (isArrayLike(obj) && (_.isArray(obj) || _.isString(obj) || _.isArguments(obj))) return obj.length === 0; + return _.keys(obj).length === 0; + }; + + // Is a given value a DOM element? + _.isElement = function(obj) { + return !!(obj && obj.nodeType === 1); + }; + + // Is a given value an array? + // Delegates to ECMA5's native Array.isArray + _.isArray = nativeIsArray || function(obj) { + return toString.call(obj) === '[object Array]'; + }; + + // Is a given variable an object? + _.isObject = function(obj) { + var type = typeof obj; + return type === 'function' || type === 'object' && !!obj; + }; + + // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError. + _.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error'], function(name) { + _['is' + name] = function(obj) { + return toString.call(obj) === '[object ' + name + ']'; + }; + }); + + // Define a fallback version of the method in browsers (ahem, IE < 9), where + // there isn't any inspectable "Arguments" type. + if (!_.isArguments(arguments)) { + _.isArguments = function(obj) { + return _.has(obj, 'callee'); + }; + } + + // Optimize `isFunction` if appropriate. Work around some typeof bugs in old v8, + // IE 11 (#1621), and in Safari 8 (#1929). + if (typeof /./ != 'function' && typeof Int8Array != 'object') { + _.isFunction = function(obj) { + return typeof obj == 'function' || false; + }; + } + + // Is a given object a finite number? + _.isFinite = function(obj) { + return isFinite(obj) && !isNaN(parseFloat(obj)); + }; + + // Is the given value `NaN`? (NaN is the only number which does not equal itself). + _.isNaN = function(obj) { + return _.isNumber(obj) && obj !== +obj; + }; + + // Is a given value a boolean? + _.isBoolean = function(obj) { + return obj === true || obj === false || toString.call(obj) === '[object Boolean]'; + }; + + // Is a given value equal to null? + _.isNull = function(obj) { + return obj === null; + }; + + // Is a given variable undefined? + _.isUndefined = function(obj) { + return obj === void 0; + }; + + // Shortcut function for checking if an object has a given property directly + // on itself (in other words, not on a prototype). + _.has = function(obj, key) { + return obj != null && hasOwnProperty.call(obj, key); + }; + + // Utility Functions + // ----------------- + + // Run Underscore.js in *noConflict* mode, returning the `_` variable to its + // previous owner. Returns a reference to the Underscore object. + _.noConflict = function() { + root._ = previousUnderscore; + return this; + }; + + // Keep the identity function around for default iteratees. + _.identity = function(value) { + return value; + }; + + // Predicate-generating functions. Often useful outside of Underscore. + _.constant = function(value) { + return function() { + return value; + }; + }; + + _.noop = function(){}; + + _.property = property; + + // Generates a function for a given object that returns a given property. + _.propertyOf = function(obj) { + return obj == null ? function(){} : function(key) { + return obj[key]; + }; + }; + + // Returns a predicate for checking whether an object has a given set of + // `key:value` pairs. + _.matcher = _.matches = function(attrs) { + attrs = _.extendOwn({}, attrs); + return function(obj) { + return _.isMatch(obj, attrs); + }; + }; + + // Run a function **n** times. + _.times = function(n, iteratee, context) { + var accum = Array(Math.max(0, n)); + iteratee = optimizeCb(iteratee, context, 1); + for (var i = 0; i < n; i++) accum[i] = iteratee(i); + return accum; + }; + + // Return a random integer between min and max (inclusive). + _.random = function(min, max) { + if (max == null) { + max = min; + min = 0; + } + return min + Math.floor(Math.random() * (max - min + 1)); + }; + + // A (possibly faster) way to get the current timestamp as an integer. + _.now = Date.now || function() { + return new Date().getTime(); + }; + + // List of HTML entities for escaping. + var escapeMap = { + '&': '&', + '<': '<', + '>': '>', + '"': '"', + "'": ''', + '`': '`' + }; + var unescapeMap = _.invert(escapeMap); + + // Functions for escaping and unescaping strings to/from HTML interpolation. + var createEscaper = function(map) { + var escaper = function(match) { + return map[match]; + }; + // Regexes for identifying a key that needs to be escaped + var source = '(?:' + _.keys(map).join('|') + ')'; + var testRegexp = RegExp(source); + var replaceRegexp = RegExp(source, 'g'); + return function(string) { + string = string == null ? '' : '' + string; + return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string; + }; + }; + _.escape = createEscaper(escapeMap); + _.unescape = createEscaper(unescapeMap); + + // If the value of the named `property` is a function then invoke it with the + // `object` as context; otherwise, return it. + _.result = function(object, property, fallback) { + var value = object == null ? void 0 : object[property]; + if (value === void 0) { + value = fallback; + } + return _.isFunction(value) ? value.call(object) : value; + }; + + // Generate a unique integer id (unique within the entire client session). + // Useful for temporary DOM ids. + var idCounter = 0; + _.uniqueId = function(prefix) { + var id = ++idCounter + ''; + return prefix ? prefix + id : id; + }; + + // By default, Underscore uses ERB-style template delimiters, change the + // following template settings to use alternative delimiters. + _.templateSettings = { + evaluate : /<%([\s\S]+?)%>/g, + interpolate : /<%=([\s\S]+?)%>/g, + escape : /<%-([\s\S]+?)%>/g + }; + + // When customizing `templateSettings`, if you don't want to define an + // interpolation, evaluation or escaping regex, we need one that is + // guaranteed not to match. + var noMatch = /(.)^/; + + // Certain characters need to be escaped so that they can be put into a + // string literal. + var escapes = { + "'": "'", + '\\': '\\', + '\r': 'r', + '\n': 'n', + '\u2028': 'u2028', + '\u2029': 'u2029' + }; + + var escaper = /\\|'|\r|\n|\u2028|\u2029/g; + + var escapeChar = function(match) { + return '\\' + escapes[match]; + }; + + // JavaScript micro-templating, similar to John Resig's implementation. + // Underscore templating handles arbitrary delimiters, preserves whitespace, + // and correctly escapes quotes within interpolated code. + // NB: `oldSettings` only exists for backwards compatibility. + _.template = function(text, settings, oldSettings) { + if (!settings && oldSettings) settings = oldSettings; + settings = _.defaults({}, settings, _.templateSettings); + + // Combine delimiters into one regular expression via alternation. + var matcher = RegExp([ + (settings.escape || noMatch).source, + (settings.interpolate || noMatch).source, + (settings.evaluate || noMatch).source + ].join('|') + '|$', 'g'); + + // Compile the template source, escaping string literals appropriately. + var index = 0; + var source = "__p+='"; + text.replace(matcher, function(match, escape, interpolate, evaluate, offset) { + source += text.slice(index, offset).replace(escaper, escapeChar); + index = offset + match.length; + + if (escape) { + source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'"; + } else if (interpolate) { + source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'"; + } else if (evaluate) { + source += "';\n" + evaluate + "\n__p+='"; + } + + // Adobe VMs need the match returned to produce the correct offest. + return match; + }); + source += "';\n"; + + // If a variable is not specified, place data values in local scope. + if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n'; + + source = "var __t,__p='',__j=Array.prototype.join," + + "print=function(){__p+=__j.call(arguments,'');};\n" + + source + 'return __p;\n'; + + try { + var render = new Function(settings.variable || 'obj', '_', source); + } catch (e) { + e.source = source; + throw e; + } + + var template = function(data) { + return render.call(this, data, _); + }; + + // Provide the compiled source as a convenience for precompilation. + var argument = settings.variable || 'obj'; + template.source = 'function(' + argument + '){\n' + source + '}'; + + return template; + }; + + // Add a "chain" function. Start chaining a wrapped Underscore object. + _.chain = function(obj) { + var instance = _(obj); + instance._chain = true; + return instance; + }; + + // OOP + // --------------- + // If Underscore is called as a function, it returns a wrapped object that + // can be used OO-style. This wrapper holds altered versions of all the + // underscore functions. Wrapped objects may be chained. + + // Helper function to continue chaining intermediate results. + var result = function(instance, obj) { + return instance._chain ? _(obj).chain() : obj; + }; + + // Add your own custom functions to the Underscore object. + _.mixin = function(obj) { + _.each(_.functions(obj), function(name) { + var func = _[name] = obj[name]; + _.prototype[name] = function() { + var args = [this._wrapped]; + push.apply(args, arguments); + return result(this, func.apply(_, args)); + }; + }); + }; + + // Add all of the Underscore functions to the wrapper object. + _.mixin(_); + + // Add all mutator Array functions to the wrapper. + _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) { + var method = ArrayProto[name]; + _.prototype[name] = function() { + var obj = this._wrapped; + method.apply(obj, arguments); + if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0]; + return result(this, obj); + }; + }); + + // Add all accessor Array functions to the wrapper. + _.each(['concat', 'join', 'slice'], function(name) { + var method = ArrayProto[name]; + _.prototype[name] = function() { + return result(this, method.apply(this._wrapped, arguments)); + }; + }); + + // Extracts the result from a wrapped and chained object. + _.prototype.value = function() { + return this._wrapped; + }; + + // Provide unwrapping proxy for some methods used in engine operations + // such as arithmetic and JSON stringification. + _.prototype.valueOf = _.prototype.toJSON = _.prototype.value; + + _.prototype.toString = function() { + return '' + this._wrapped; + }; + + // AMD registration happens at the end for compatibility with AMD loaders + // that may not enforce next-turn semantics on modules. Even though general + // practice for AMD registration is to be anonymous, underscore registers + // as a named module because, like jQuery, it is a base library that is + // popular enough to be bundled in a third party lib, but not be part of + // an AMD load request. Those cases could generate an error when an + // anonymous define() is called outside of a loader request. + if (typeof define === 'function' && define.amd) { + define('underscore', [], function() { + return _; + }); + } +}.call(this)); + +},{}],26:[function(require,module,exports){ +arguments[4][19][0].apply(exports,arguments) +},{"dup":19}],27:[function(require,module,exports){ +module.exports = function isBuffer(arg) { + return arg && typeof arg === 'object' + && typeof arg.copy === 'function' + && typeof arg.fill === 'function' + && typeof arg.readUInt8 === 'function'; +} +},{}],28:[function(require,module,exports){ +(function (process,global){ +// Copyright Joyent, Inc. and other Node contributors. +// +// Permission is hereby granted, free of charge, to any person obtaining a +// copy of this software and associated documentation files (the +// "Software"), to deal in the Software without restriction, including +// without limitation the rights to use, copy, modify, merge, publish, +// distribute, sublicense, and/or sell copies of the Software, and to permit +// persons to whom the Software is furnished to do so, subject to the +// following conditions: +// +// The above copyright notice and this permission notice shall be included +// in all copies or substantial portions of the Software. +// +// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS +// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF +// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN +// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, +// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR +// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE +// USE OR OTHER DEALINGS IN THE SOFTWARE. + +var formatRegExp = /%[sdj%]/g; +exports.format = function(f) { + if (!isString(f)) { + var objects = []; + for (var i = 0; i < arguments.length; i++) { + objects.push(inspect(arguments[i])); + } + return objects.join(' '); + } + + var i = 1; + var args = arguments; + var len = args.length; + var str = String(f).replace(formatRegExp, function(x) { + if (x === '%%') return '%'; + if (i >= len) return x; + switch (x) { + case '%s': return String(args[i++]); + case '%d': return Number(args[i++]); + case '%j': + try { + return JSON.stringify(args[i++]); + } catch (_) { + return '[Circular]'; + } + default: + return x; + } + }); + for (var x = args[i]; i < len; x = args[++i]) { + if (isNull(x) || !isObject(x)) { + str += ' ' + x; + } else { + str += ' ' + inspect(x); + } + } + return str; +}; + + +// Mark that a method should not be used. +// Returns a modified function which warns once by default. +// If --no-deprecation is set, then it is a no-op. +exports.deprecate = function(fn, msg) { + // Allow for deprecating things in the process of starting up. + if (isUndefined(global.process)) { + return function() { + return exports.deprecate(fn, msg).apply(this, arguments); + }; + } + + if (process.noDeprecation === true) { + return fn; + } + + var warned = false; + function deprecated() { + if (!warned) { + if (process.throwDeprecation) { + throw new Error(msg); + } else if (process.traceDeprecation) { + console.trace(msg); + } else { + console.error(msg); + } + warned = true; + } + return fn.apply(this, arguments); + } + + return deprecated; +}; + + +var debugs = {}; +var debugEnviron; +exports.debuglog = function(set) { + if (isUndefined(debugEnviron)) + debugEnviron = process.env.NODE_DEBUG || ''; + set = set.toUpperCase(); + if (!debugs[set]) { + if (new RegExp('\\b' + set + '\\b', 'i').test(debugEnviron)) { + var pid = process.pid; + debugs[set] = function() { + var msg = exports.format.apply(exports, arguments); + console.error('%s %d: %s', set, pid, msg); + }; + } else { + debugs[set] = function() {}; + } + } + return debugs[set]; +}; + + +/** + * Echos the value of a value. Trys to print the value out + * in the best way possible given the different types. + * + * @param {Object} obj The object to print out. + * @param {Object} opts Optional options object that alters the output. + */ +/* legacy: obj, showHidden, depth, colors*/ +function inspect(obj, opts) { + // default options + var ctx = { + seen: [], + stylize: stylizeNoColor + }; + // legacy... + if (arguments.length >= 3) ctx.depth = arguments[2]; + if (arguments.length >= 4) ctx.colors = arguments[3]; + if (isBoolean(opts)) { + // legacy... + ctx.showHidden = opts; + } else if (opts) { + // got an "options" object + exports._extend(ctx, opts); + } + // set default options + if (isUndefined(ctx.showHidden)) ctx.showHidden = false; + if (isUndefined(ctx.depth)) ctx.depth = 2; + if (isUndefined(ctx.colors)) ctx.colors = false; + if (isUndefined(ctx.customInspect)) ctx.customInspect = true; + if (ctx.colors) ctx.stylize = stylizeWithColor; + return formatValue(ctx, obj, ctx.depth); +} +exports.inspect = inspect; + + +// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics +inspect.colors = { + 'bold' : [1, 22], + 'italic' : [3, 23], + 'underline' : [4, 24], + 'inverse' : [7, 27], + 'white' : [37, 39], + 'grey' : [90, 39], + 'black' : [30, 39], + 'blue' : [34, 39], + 'cyan' : [36, 39], + 'green' : [32, 39], + 'magenta' : [35, 39], + 'red' : [31, 39], + 'yellow' : [33, 39] +}; + +// Don't use 'blue' not visible on cmd.exe +inspect.styles = { + 'special': 'cyan', + 'number': 'yellow', + 'boolean': 'yellow', + 'undefined': 'grey', + 'null': 'bold', + 'string': 'green', + 'date': 'magenta', + // "name": intentionally not styling + 'regexp': 'red' +}; + + +function stylizeWithColor(str, styleType) { + var style = inspect.styles[styleType]; + + if (style) { + return '\u001b[' + inspect.colors[style][0] + 'm' + str + + '\u001b[' + inspect.colors[style][1] + 'm'; + } else { + return str; + } +} + + +function stylizeNoColor(str, styleType) { + return str; +} + + +function arrayToHash(array) { + var hash = {}; + + array.forEach(function(val, idx) { + hash[val] = true; + }); + + return hash; +} + + +function formatValue(ctx, value, recurseTimes) { + // Provide a hook for user-specified inspect functions. + // Check that value is an object with an inspect function on it + if (ctx.customInspect && + value && + isFunction(value.inspect) && + // Filter out the util module, it's inspect function is special + value.inspect !== exports.inspect && + // Also filter out any prototype objects using the circular check. + !(value.constructor && value.constructor.prototype === value)) { + var ret = value.inspect(recurseTimes, ctx); + if (!isString(ret)) { + ret = formatValue(ctx, ret, recurseTimes); + } + return ret; + } + + // Primitive types cannot have properties + var primitive = formatPrimitive(ctx, value); + if (primitive) { + return primitive; + } + + // Look up the keys of the object. + var keys = Object.keys(value); + var visibleKeys = arrayToHash(keys); + + if (ctx.showHidden) { + keys = Object.getOwnPropertyNames(value); + } + + // IE doesn't make error fields non-enumerable + // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx + if (isError(value) + && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) { + return formatError(value); + } + + // Some type of object without properties can be shortcutted. + if (keys.length === 0) { + if (isFunction(value)) { + var name = value.name ? ': ' + value.name : ''; + return ctx.stylize('[Function' + name + ']', 'special'); + } + if (isRegExp(value)) { + return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); + } + if (isDate(value)) { + return ctx.stylize(Date.prototype.toString.call(value), 'date'); + } + if (isError(value)) { + return formatError(value); + } + } + + var base = '', array = false, braces = ['{', '}']; + + // Make Array say that they are Array + if (isArray(value)) { + array = true; + braces = ['[', ']']; + } + + // Make functions say that they are functions + if (isFunction(value)) { + var n = value.name ? ': ' + value.name : ''; + base = ' [Function' + n + ']'; + } + + // Make RegExps say that they are RegExps + if (isRegExp(value)) { + base = ' ' + RegExp.prototype.toString.call(value); + } + + // Make dates with properties first say the date + if (isDate(value)) { + base = ' ' + Date.prototype.toUTCString.call(value); + } + + // Make error with message first say the error + if (isError(value)) { + base = ' ' + formatError(value); + } + + if (keys.length === 0 && (!array || value.length == 0)) { + return braces[0] + base + braces[1]; + } + + if (recurseTimes < 0) { + if (isRegExp(value)) { + return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); + } else { + return ctx.stylize('[Object]', 'special'); + } + } + + ctx.seen.push(value); + + var output; + if (array) { + output = formatArray(ctx, value, recurseTimes, visibleKeys, keys); + } else { + output = keys.map(function(key) { + return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array); + }); + } + + ctx.seen.pop(); + + return reduceToSingleString(output, base, braces); +} + + +function formatPrimitive(ctx, value) { + if (isUndefined(value)) + return ctx.stylize('undefined', 'undefined'); + if (isString(value)) { + var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '') + .replace(/'/g, "\\'") + .replace(/\\"/g, '"') + '\''; + return ctx.stylize(simple, 'string'); + } + if (isNumber(value)) + return ctx.stylize('' + value, 'number'); + if (isBoolean(value)) + return ctx.stylize('' + value, 'boolean'); + // For some reason typeof null is "object", so special case here. + if (isNull(value)) + return ctx.stylize('null', 'null'); +} + + +function formatError(value) { + return '[' + Error.prototype.toString.call(value) + ']'; +} + + +function formatArray(ctx, value, recurseTimes, visibleKeys, keys) { + var output = []; + for (var i = 0, l = value.length; i < l; ++i) { + if (hasOwnProperty(value, String(i))) { + output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, + String(i), true)); + } else { + output.push(''); + } + } + keys.forEach(function(key) { + if (!key.match(/^\d+$/)) { + output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, + key, true)); + } + }); + return output; +} + + +function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) { + var name, str, desc; + desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] }; + if (desc.get) { + if (desc.set) { + str = ctx.stylize('[Getter/Setter]', 'special'); + } else { + str = ctx.stylize('[Getter]', 'special'); + } + } else { + if (desc.set) { + str = ctx.stylize('[Setter]', 'special'); + } + } + if (!hasOwnProperty(visibleKeys, key)) { + name = '[' + key + ']'; + } + if (!str) { + if (ctx.seen.indexOf(desc.value) < 0) { + if (isNull(recurseTimes)) { + str = formatValue(ctx, desc.value, null); + } else { + str = formatValue(ctx, desc.value, recurseTimes - 1); + } + if (str.indexOf('\n') > -1) { + if (array) { + str = str.split('\n').map(function(line) { + return ' ' + line; + }).join('\n').substr(2); + } else { + str = '\n' + str.split('\n').map(function(line) { + return ' ' + line; + }).join('\n'); + } + } + } else { + str = ctx.stylize('[Circular]', 'special'); + } + } + if (isUndefined(name)) { + if (array && key.match(/^\d+$/)) { + return str; + } + name = JSON.stringify('' + key); + if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) { + name = name.substr(1, name.length - 2); + name = ctx.stylize(name, 'name'); + } else { + name = name.replace(/'/g, "\\'") + .replace(/\\"/g, '"') + .replace(/(^"|"$)/g, "'"); + name = ctx.stylize(name, 'string'); + } + } + + return name + ': ' + str; +} + + +function reduceToSingleString(output, base, braces) { + var numLinesEst = 0; + var length = output.reduce(function(prev, cur) { + numLinesEst++; + if (cur.indexOf('\n') >= 0) numLinesEst++; + return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1; + }, 0); + + if (length > 60) { + return braces[0] + + (base === '' ? '' : base + '\n ') + + ' ' + + output.join(',\n ') + + ' ' + + braces[1]; + } + + return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1]; +} + + +// NOTE: These type checking functions intentionally don't use `instanceof` +// because it is fragile and can be easily faked with `Object.create()`. +function isArray(ar) { + return Array.isArray(ar); +} +exports.isArray = isArray; + +function isBoolean(arg) { + return typeof arg === 'boolean'; +} +exports.isBoolean = isBoolean; + +function isNull(arg) { + return arg === null; +} +exports.isNull = isNull; + +function isNullOrUndefined(arg) { + return arg == null; +} +exports.isNullOrUndefined = isNullOrUndefined; + +function isNumber(arg) { + return typeof arg === 'number'; +} +exports.isNumber = isNumber; + +function isString(arg) { + return typeof arg === 'string'; +} +exports.isString = isString; + +function isSymbol(arg) { + return typeof arg === 'symbol'; +} +exports.isSymbol = isSymbol; + +function isUndefined(arg) { + return arg === void 0; +} +exports.isUndefined = isUndefined; + +function isRegExp(re) { + return isObject(re) && objectToString(re) === '[object RegExp]'; +} +exports.isRegExp = isRegExp; + +function isObject(arg) { + return typeof arg === 'object' && arg !== null; +} +exports.isObject = isObject; + +function isDate(d) { + return isObject(d) && objectToString(d) === '[object Date]'; +} +exports.isDate = isDate; + +function isError(e) { + return isObject(e) && + (objectToString(e) === '[object Error]' || e instanceof Error); +} +exports.isError = isError; + +function isFunction(arg) { + return typeof arg === 'function'; +} +exports.isFunction = isFunction; + +function isPrimitive(arg) { + return arg === null || + typeof arg === 'boolean' || + typeof arg === 'number' || + typeof arg === 'string' || + typeof arg === 'symbol' || // ES6 symbol + typeof arg === 'undefined'; +} +exports.isPrimitive = isPrimitive; + +exports.isBuffer = require('./support/isBuffer'); + +function objectToString(o) { + return Object.prototype.toString.call(o); +} + + +function pad(n) { + return n < 10 ? '0' + n.toString(10) : n.toString(10); +} + + +var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', + 'Oct', 'Nov', 'Dec']; + +// 26 Feb 16:19:34 +function timestamp() { + var d = new Date(); + var time = [pad(d.getHours()), + pad(d.getMinutes()), + pad(d.getSeconds())].join(':'); + return [d.getDate(), months[d.getMonth()], time].join(' '); +} + + +// log is just a thin wrapper to console.log that prepends a timestamp +exports.log = function() { + console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments)); +}; + + +/** + * Inherit the prototype methods from one constructor into another. + * + * The Function.prototype.inherits from lang.js rewritten as a standalone + * function (not on Function.prototype). NOTE: If this file is to be loaded + * during bootstrapping this function needs to be rewritten using some native + * functions as prototype setup using normal JavaScript does not work as + * expected during bootstrapping (see mirror.js in r114903). + * + * @param {function} ctor Constructor function which needs to inherit the + * prototype. + * @param {function} superCtor Constructor function to inherit prototype from. + */ +exports.inherits = require('inherits'); + +exports._extend = function(origin, add) { + // Don't do anything if add isn't an object + if (!add || !isObject(add)) return origin; + + var keys = Object.keys(add); + var i = keys.length; + while (i--) { + origin[keys[i]] = add[keys[i]]; + } + return origin; +}; + +function hasOwnProperty(obj, prop) { + return Object.prototype.hasOwnProperty.call(obj, prop); +} + +}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) +},{"./support/isBuffer":27,"_process":24,"inherits":26}],29:[function(require,module,exports){ +// Returns a wrapper function that returns a wrapped callback +// The wrapper function should do some stuff, and return a +// presumably different callback function. +// This makes sure that own properties are retained, so that +// decorations and such are not lost along the way. +module.exports = wrappy +function wrappy (fn, cb) { + if (fn && cb) return wrappy(fn)(cb) + + if (typeof fn !== 'function') + throw new TypeError('need wrapper function') + + Object.keys(fn).forEach(function (k) { + wrapper[k] = fn[k] + }) + + return wrapper + + function wrapper() { + var args = new Array(arguments.length) + for (var i = 0; i < args.length; i++) { + args[i] = arguments[i] + } + var ret = fn.apply(this, args) + var cb = args[args.length-1] + if (typeof ret === 'function' && ret !== cb) { + Object.keys(cb).forEach(function (k) { + ret[k] = cb[k] + }) + } + return ret + } +} + +},{}]},{},[7])(7) +}); \ No newline at end of file diff --git a/assets/javascripts/workers/search.092fa1f6.min.js b/assets/javascripts/workers/search.092fa1f6.min.js new file mode 100644 index 00000000..81c61a09 --- /dev/null +++ b/assets/javascripts/workers/search.092fa1f6.min.js @@ -0,0 +1,48 @@ +(()=>{var de=Object.create;var B=Object.defineProperty;var ge=Object.getOwnPropertyDescriptor;var ye=Object.getOwnPropertyNames,Y=Object.getOwnPropertySymbols,me=Object.getPrototypeOf,J=Object.prototype.hasOwnProperty,ve=Object.prototype.propertyIsEnumerable;var G=(t,e,r)=>e in t?B(t,e,{enumerable:!0,configurable:!0,writable:!0,value:r}):t[e]=r,X=(t,e)=>{for(var r in e||(e={}))J.call(e,r)&&G(t,r,e[r]);if(Y)for(var r of Y(e))ve.call(e,r)&&G(t,r,e[r]);return t};var xe=t=>B(t,"__esModule",{value:!0});var Z=(t,e)=>()=>(e||t((e={exports:{}}).exports,e),e.exports);var Se=(t,e,r,n)=>{if(e&&typeof e=="object"||typeof e=="function")for(let i of ye(e))!J.call(t,i)&&(r||i!=="default")&&B(t,i,{get:()=>e[i],enumerable:!(n=ge(e,i))||n.enumerable});return t},U=(t,e)=>Se(xe(B(t!=null?de(me(t)):{},"default",!e&&t&&t.__esModule?{get:()=>t.default,enumerable:!0}:{value:t,enumerable:!0})),t);var z=(t,e,r)=>new Promise((n,i)=>{var s=u=>{try{a(r.next(u))}catch(c){i(c)}},o=u=>{try{a(r.throw(u))}catch(c){i(c)}},a=u=>u.done?n(u.value):Promise.resolve(u.value).then(s,o);a((r=r.apply(t,e)).next())});var te=Z((K,ee)=>{/** + * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.9 + * Copyright (C) 2020 Oliver Nightingale + * @license MIT + */(function(){var t=function(e){var r=new t.Builder;return r.pipeline.add(t.trimmer,t.stopWordFilter,t.stemmer),r.searchPipeline.add(t.stemmer),e.call(r,r),r.build()};t.version="2.3.9";/*! + * lunr.utils + * Copyright (C) 2020 Oliver Nightingale + */t.utils={},t.utils.warn=function(e){return function(r){e.console&&console.warn&&console.warn(r)}}(this),t.utils.asString=function(e){return e==null?"":e.toString()},t.utils.clone=function(e){if(e==null)return e;for(var r=Object.create(null),n=Object.keys(e),i=0;i0){var h=t.utils.clone(r)||{};h.position=[a,c],h.index=s.length,s.push(new t.Token(n.slice(a,o),h))}a=o+1}}return s},t.tokenizer.separator=/[\s\-]+/;/*! + * lunr.Pipeline + * Copyright (C) 2020 Oliver Nightingale + */t.Pipeline=function(){this._stack=[]},t.Pipeline.registeredFunctions=Object.create(null),t.Pipeline.registerFunction=function(e,r){r in this.registeredFunctions&&t.utils.warn("Overwriting existing registered function: "+r),e.label=r,t.Pipeline.registeredFunctions[e.label]=e},t.Pipeline.warnIfFunctionNotRegistered=function(e){var r=e.label&&e.label in this.registeredFunctions;r||t.utils.warn(`Function is not registered with pipeline. This may cause problems when serialising the index. +`,e)},t.Pipeline.load=function(e){var r=new t.Pipeline;return e.forEach(function(n){var i=t.Pipeline.registeredFunctions[n];if(i)r.add(i);else throw new Error("Cannot load unregistered function: "+n)}),r},t.Pipeline.prototype.add=function(){var e=Array.prototype.slice.call(arguments);e.forEach(function(r){t.Pipeline.warnIfFunctionNotRegistered(r),this._stack.push(r)},this)},t.Pipeline.prototype.after=function(e,r){t.Pipeline.warnIfFunctionNotRegistered(r);var n=this._stack.indexOf(e);if(n==-1)throw new Error("Cannot find existingFn");n=n+1,this._stack.splice(n,0,r)},t.Pipeline.prototype.before=function(e,r){t.Pipeline.warnIfFunctionNotRegistered(r);var n=this._stack.indexOf(e);if(n==-1)throw new Error("Cannot find existingFn");this._stack.splice(n,0,r)},t.Pipeline.prototype.remove=function(e){var r=this._stack.indexOf(e);r!=-1&&this._stack.splice(r,1)},t.Pipeline.prototype.run=function(e){for(var r=this._stack.length,n=0;n1&&(oe&&(n=s),o!=e);)i=n-r,s=r+Math.floor(i/2),o=this.elements[s*2];if(o==e||o>e)return s*2;if(ou?h+=2:a==u&&(r+=n[c+1]*i[h+1],c+=2,h+=2);return r},t.Vector.prototype.similarity=function(e){return this.dot(e)/this.magnitude()||0},t.Vector.prototype.toArray=function(){for(var e=new Array(this.elements.length/2),r=1,n=0;r0){var o=s.str.charAt(0),a;o in s.node.edges?a=s.node.edges[o]:(a=new t.TokenSet,s.node.edges[o]=a),s.str.length==1&&(a.final=!0),i.push({node:a,editsRemaining:s.editsRemaining,str:s.str.slice(1)})}if(s.editsRemaining!=0){if("*"in s.node.edges)var u=s.node.edges["*"];else{var u=new t.TokenSet;s.node.edges["*"]=u}if(s.str.length==0&&(u.final=!0),i.push({node:u,editsRemaining:s.editsRemaining-1,str:s.str}),s.str.length>1&&i.push({node:s.node,editsRemaining:s.editsRemaining-1,str:s.str.slice(1)}),s.str.length==1&&(s.node.final=!0),s.str.length>=1){if("*"in s.node.edges)var c=s.node.edges["*"];else{var c=new t.TokenSet;s.node.edges["*"]=c}s.str.length==1&&(c.final=!0),i.push({node:c,editsRemaining:s.editsRemaining-1,str:s.str.slice(1)})}if(s.str.length>1){var h=s.str.charAt(0),y=s.str.charAt(1),g;y in s.node.edges?g=s.node.edges[y]:(g=new t.TokenSet,s.node.edges[y]=g),s.str.length==1&&(g.final=!0),i.push({node:g,editsRemaining:s.editsRemaining-1,str:h+s.str.slice(2)})}}}return n},t.TokenSet.fromString=function(e){for(var r=new t.TokenSet,n=r,i=0,s=e.length;i=e;r--){var n=this.uncheckedNodes[r],i=n.child.toString();i in this.minimizedNodes?n.parent.edges[n.char]=this.minimizedNodes[i]:(n.child._str=i,this.minimizedNodes[i]=n.child),this.uncheckedNodes.pop()}};/*! + * lunr.Index + * Copyright (C) 2020 Oliver Nightingale + */t.Index=function(e){this.invertedIndex=e.invertedIndex,this.fieldVectors=e.fieldVectors,this.tokenSet=e.tokenSet,this.fields=e.fields,this.pipeline=e.pipeline},t.Index.prototype.search=function(e){return this.query(function(r){var n=new t.QueryParser(e,r);n.parse()})},t.Index.prototype.query=function(e){for(var r=new t.Query(this.fields),n=Object.create(null),i=Object.create(null),s=Object.create(null),o=Object.create(null),a=Object.create(null),u=0;u1?this._b=1:this._b=e},t.Builder.prototype.k1=function(e){this._k1=e},t.Builder.prototype.add=function(e,r){var n=e[this._ref],i=Object.keys(this._fields);this._documents[n]=r||{},this.documentCount+=1;for(var s=0;s=this.length)return t.QueryLexer.EOS;var e=this.str.charAt(this.pos);return this.pos+=1,e},t.QueryLexer.prototype.width=function(){return this.pos-this.start},t.QueryLexer.prototype.ignore=function(){this.start==this.pos&&(this.pos+=1),this.start=this.pos},t.QueryLexer.prototype.backup=function(){this.pos-=1},t.QueryLexer.prototype.acceptDigitRun=function(){var e,r;do e=this.next(),r=e.charCodeAt(0);while(r>47&&r<58);e!=t.QueryLexer.EOS&&this.backup()},t.QueryLexer.prototype.more=function(){return this.pos1&&(e.backup(),e.emit(t.QueryLexer.TERM)),e.ignore(),e.more())return t.QueryLexer.lexText},t.QueryLexer.lexEditDistance=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(t.QueryLexer.EDIT_DISTANCE),t.QueryLexer.lexText},t.QueryLexer.lexBoost=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(t.QueryLexer.BOOST),t.QueryLexer.lexText},t.QueryLexer.lexEOS=function(e){e.width()>0&&e.emit(t.QueryLexer.TERM)},t.QueryLexer.termSeparator=t.tokenizer.separator,t.QueryLexer.lexText=function(e){for(;;){var r=e.next();if(r==t.QueryLexer.EOS)return t.QueryLexer.lexEOS;if(r.charCodeAt(0)==92){e.escapeCharacter();continue}if(r==":")return t.QueryLexer.lexField;if(r=="~")return e.backup(),e.width()>0&&e.emit(t.QueryLexer.TERM),t.QueryLexer.lexEditDistance;if(r=="^")return e.backup(),e.width()>0&&e.emit(t.QueryLexer.TERM),t.QueryLexer.lexBoost;if(r=="+"&&e.width()===1||r=="-"&&e.width()===1)return e.emit(t.QueryLexer.PRESENCE),t.QueryLexer.lexText;if(r.match(t.QueryLexer.termSeparator))return t.QueryLexer.lexTerm}},t.QueryParser=function(e,r){this.lexer=new t.QueryLexer(e),this.query=r,this.currentClause={},this.lexemeIdx=0},t.QueryParser.prototype.parse=function(){this.lexer.run(),this.lexemes=this.lexer.lexemes;for(var e=t.QueryParser.parseClause;e;)e=e(this);return this.query},t.QueryParser.prototype.peekLexeme=function(){return this.lexemes[this.lexemeIdx]},t.QueryParser.prototype.consumeLexeme=function(){var e=this.peekLexeme();return this.lexemeIdx+=1,e},t.QueryParser.prototype.nextClause=function(){var e=this.currentClause;this.query.clause(e),this.currentClause={}},t.QueryParser.parseClause=function(e){var r=e.peekLexeme();if(r!=null)switch(r.type){case t.QueryLexer.PRESENCE:return t.QueryParser.parsePresence;case t.QueryLexer.FIELD:return t.QueryParser.parseField;case t.QueryLexer.TERM:return t.QueryParser.parseTerm;default:var n="expected either a field or a term, found "+r.type;throw r.str.length>=1&&(n+=" with value '"+r.str+"'"),new t.QueryParseError(n,r.start,r.end)}},t.QueryParser.parsePresence=function(e){var r=e.consumeLexeme();if(r!=null){switch(r.str){case"-":e.currentClause.presence=t.Query.presence.PROHIBITED;break;case"+":e.currentClause.presence=t.Query.presence.REQUIRED;break;default:var n="unrecognised presence operator'"+r.str+"'";throw new t.QueryParseError(n,r.start,r.end)}var i=e.peekLexeme();if(i==null){var n="expecting term or field, found nothing";throw new t.QueryParseError(n,r.start,r.end)}switch(i.type){case t.QueryLexer.FIELD:return t.QueryParser.parseField;case t.QueryLexer.TERM:return t.QueryParser.parseTerm;default:var n="expecting term or field, found '"+i.type+"'";throw new t.QueryParseError(n,i.start,i.end)}}},t.QueryParser.parseField=function(e){var r=e.consumeLexeme();if(r!=null){if(e.query.allFields.indexOf(r.str)==-1){var n=e.query.allFields.map(function(o){return"'"+o+"'"}).join(", "),i="unrecognised field '"+r.str+"', possible fields: "+n;throw new t.QueryParseError(i,r.start,r.end)}e.currentClause.fields=[r.str];var s=e.peekLexeme();if(s==null){var i="expecting term, found nothing";throw new t.QueryParseError(i,r.start,r.end)}switch(s.type){case t.QueryLexer.TERM:return t.QueryParser.parseTerm;default:var i="expecting term, found '"+s.type+"'";throw new t.QueryParseError(i,s.start,s.end)}}},t.QueryParser.parseTerm=function(e){var r=e.consumeLexeme();if(r!=null){e.currentClause.term=r.str.toLowerCase(),r.str.indexOf("*")!=-1&&(e.currentClause.usePipeline=!1);var n=e.peekLexeme();if(n==null){e.nextClause();return}switch(n.type){case t.QueryLexer.TERM:return e.nextClause(),t.QueryParser.parseTerm;case t.QueryLexer.FIELD:return e.nextClause(),t.QueryParser.parseField;case t.QueryLexer.EDIT_DISTANCE:return t.QueryParser.parseEditDistance;case t.QueryLexer.BOOST:return t.QueryParser.parseBoost;case t.QueryLexer.PRESENCE:return e.nextClause(),t.QueryParser.parsePresence;default:var i="Unexpected lexeme type '"+n.type+"'";throw new t.QueryParseError(i,n.start,n.end)}}},t.QueryParser.parseEditDistance=function(e){var r=e.consumeLexeme();if(r!=null){var n=parseInt(r.str,10);if(isNaN(n)){var i="edit distance must be numeric";throw new t.QueryParseError(i,r.start,r.end)}e.currentClause.editDistance=n;var s=e.peekLexeme();if(s==null){e.nextClause();return}switch(s.type){case t.QueryLexer.TERM:return e.nextClause(),t.QueryParser.parseTerm;case t.QueryLexer.FIELD:return e.nextClause(),t.QueryParser.parseField;case t.QueryLexer.EDIT_DISTANCE:return t.QueryParser.parseEditDistance;case t.QueryLexer.BOOST:return t.QueryParser.parseBoost;case t.QueryLexer.PRESENCE:return e.nextClause(),t.QueryParser.parsePresence;default:var i="Unexpected lexeme type '"+s.type+"'";throw new t.QueryParseError(i,s.start,s.end)}}},t.QueryParser.parseBoost=function(e){var r=e.consumeLexeme();if(r!=null){var n=parseInt(r.str,10);if(isNaN(n)){var i="boost must be numeric";throw new t.QueryParseError(i,r.start,r.end)}e.currentClause.boost=n;var s=e.peekLexeme();if(s==null){e.nextClause();return}switch(s.type){case t.QueryLexer.TERM:return e.nextClause(),t.QueryParser.parseTerm;case t.QueryLexer.FIELD:return e.nextClause(),t.QueryParser.parseField;case t.QueryLexer.EDIT_DISTANCE:return t.QueryParser.parseEditDistance;case t.QueryLexer.BOOST:return t.QueryParser.parseBoost;case t.QueryLexer.PRESENCE:return e.nextClause(),t.QueryParser.parsePresence;default:var i="Unexpected lexeme type '"+s.type+"'";throw new t.QueryParseError(i,s.start,s.end)}}},function(e,r){typeof define=="function"&&define.amd?define(r):typeof K=="object"?ee.exports=r():e.lunr=r()}(this,function(){return t})})()});var W=Z((Te,re)=>{"use strict";/*! + * escape-html + * Copyright(c) 2012-2013 TJ Holowaychuk + * Copyright(c) 2015 Andreas Lubbe + * Copyright(c) 2015 Tiancheng "Timothy" Gu + * MIT Licensed + */var Qe=/["'&<>]/;re.exports=be;function be(t){var e=""+t,r=Qe.exec(e);if(!r)return e;var n,i="",s=0,o=0;for(s=r.index;s=0;r--){let n=t[r];typeof n!="object"?n=document.createTextNode(n):n.parentNode&&n.parentNode.removeChild(n),r?e.insertBefore(this.previousSibling,n):e.replaceChild(n,this)}}}));var ne=U(W());function ie(t){let e=new Map,r=new Set;for(let n of t){let[i,s]=n.location.split("#"),o=n.location,a=n.title,u=(0,ne.default)(n.text).replace(/\s+(?=[,.:;!?])/g,"").replace(/\s+/g," ");if(s){let c=e.get(i);r.has(c)?e.set(o,{location:o,title:a,text:u,parent:c}):(c.title=n.title,c.text=u,r.add(c))}else e.set(o,{location:o,title:a,text:u})}return e}var se=U(W());function oe(t,e){let r=new RegExp(t.separator,"img"),n=(i,s,o)=>`${s}${o}`;return i=>{i=i.replace(/[\s*+\-:~^]+/g," ").trim();let s=new RegExp(`(^|${t.separator})(${i.replace(/[|\\{}()[\]^$+*?.-]/g,"\\$&").replace(r,"|")})`,"img");return o=>(e?(0,se.default)(o):o).replace(s,n).replace(/<\/mark>(\s+)]*>/img,"$1")}}function ae(t){let e=new lunr.Query(["title","text"]);return new lunr.QueryParser(t,e).parse(),e.clauses}function ue(t,e){var i;let r=new Set(t),n={};for(let s=0;s!n.has(i)))]}var H=class{constructor({config:e,docs:r,options:n}){this.options=n,this.documents=ie(r),this.highlight=oe(e,!1),lunr.tokenizer.separator=new RegExp(e.separator),this.index=lunr(function(){e.lang.length===1&&e.lang[0]!=="en"?this.use(lunr[e.lang[0]]):e.lang.length>1&&this.use(lunr.multiLanguage(...e.lang));let i=Le(["trimmer","stopWordFilter","stemmer"],n.pipeline);for(let s of e.lang.map(o=>o==="en"?lunr:lunr[o]))for(let o of i)this.pipeline.remove(s[o]),this.searchPipeline.remove(s[o]);this.ref("location"),this.field("title",{boost:1e3}),this.field("text");for(let s of r)this.add(s)})}search(e){if(e)try{let r=this.highlight(e),n=ae(e).filter(o=>o.presence!==lunr.Query.presence.PROHIBITED),i=this.index.search(`${e}*`).reduce((o,{ref:a,score:u,matchData:c})=>{let h=this.documents.get(a);if(typeof h!="undefined"){let{location:y,title:g,text:b,parent:v}=h,Q=ue(n,Object.keys(c.metadata)),p=+!v+ +Object.values(Q).every(d=>d);o.push({location:y,title:r(g),text:r(b),score:u*(1+p),terms:Q})}return o},[]).sort((o,a)=>a.score-o.score).reduce((o,a)=>{let u=this.documents.get(a.location);if(typeof u!="undefined"){let c="parent"in u?u.parent.location:u.location;o.set(c,[...o.get(c)||[],a])}return o},new Map),s;if(this.options.suggestions){let o=this.index.query(a=>{for(let u of n)a.term(u.term,{fields:["title"],presence:lunr.Query.presence.REQUIRED,wildcard:lunr.Query.wildcard.TRAILING})});s=o.length?Object.keys(o[0].matchData.metadata):[]}return X({items:[...i.values()]},typeof s!="undefined"&&{suggestions:s})}catch(r){console.warn(`Invalid query: ${e} \u2013 see https://bit.ly/2s3ChXG`)}return{items:[]}}};var q;function we(t){return z(this,null,function*(){let e="../lunr";if(typeof parent!="undefined"&&"IFrameWorker"in parent){let n=document.querySelector("script[src]"),[i]=n.src.split("/worker");e=e.replace("..",i)}let r=[];for(let n of t.lang){switch(n){case"ja":r.push(`${e}/tinyseg.js`);break;case"hi":case"th":r.push(`${e}/wordcut.js`);break}n!=="en"&&r.push(`${e}/min/lunr.${n}.min.js`)}t.lang.length>1&&r.push(`${e}/min/lunr.multi.min.js`),r.length&&(yield importScripts(`${e}/min/lunr.stemmer.support.min.js`,...r))})}function Ee(t){return z(this,null,function*(){switch(t.type){case 0:return yield we(t.data.config),q=new H(t.data),{type:1};case 2:return{type:3,data:q?q.search(t.data):{items:[]}};default:throw new TypeError("Invalid message type")}})}self.lunr=ce.default;addEventListener("message",t=>z(void 0,null,function*(){postMessage(yield Ee(t.data))}));})(); +//# sourceMappingURL=search.092fa1f6.min.js.map + diff --git a/assets/javascripts/workers/search.092fa1f6.min.js.map b/assets/javascripts/workers/search.092fa1f6.min.js.map new file mode 100644 index 00000000..0c9df50f --- /dev/null +++ b/assets/javascripts/workers/search.092fa1f6.min.js.map @@ -0,0 +1,8 @@ +{ + "version": 3, + "sources": ["node_modules/lunr/lunr.js", "node_modules/escape-html/index.js", "src/assets/javascripts/integrations/search/worker/main/index.ts", "src/assets/javascripts/polyfills/index.ts", "src/assets/javascripts/integrations/search/document/index.ts", "src/assets/javascripts/integrations/search/highlighter/index.ts", "src/assets/javascripts/integrations/search/query/_/index.ts", "src/assets/javascripts/integrations/search/_/index.ts"], + "sourceRoot": "../../../..", + "sourcesContent": ["/**\n * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.9\n * Copyright (C) 2020 Oliver Nightingale\n * @license MIT\n */\n\n;(function(){\n\n/**\n * A convenience function for configuring and constructing\n * a new lunr Index.\n *\n * A lunr.Builder instance is created and the pipeline setup\n * with a trimmer, stop word filter and stemmer.\n *\n * This builder object is yielded to the configuration function\n * that is passed as a parameter, allowing the list of fields\n * and other builder parameters to be customised.\n *\n * All documents _must_ be added within the passed config function.\n *\n * @example\n * var idx = lunr(function () {\n * this.field('title')\n * this.field('body')\n * this.ref('id')\n *\n * documents.forEach(function (doc) {\n * this.add(doc)\n * }, this)\n * })\n *\n * @see {@link lunr.Builder}\n * @see {@link lunr.Pipeline}\n * @see {@link lunr.trimmer}\n * @see {@link lunr.stopWordFilter}\n * @see {@link lunr.stemmer}\n * @namespace {function} lunr\n */\nvar lunr = function (config) {\n var builder = new lunr.Builder\n\n builder.pipeline.add(\n lunr.trimmer,\n lunr.stopWordFilter,\n lunr.stemmer\n )\n\n builder.searchPipeline.add(\n lunr.stemmer\n )\n\n config.call(builder, builder)\n return builder.build()\n}\n\nlunr.version = \"2.3.9\"\n/*!\n * lunr.utils\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A namespace containing utils for the rest of the lunr library\n * @namespace lunr.utils\n */\nlunr.utils = {}\n\n/**\n * Print a warning message to the console.\n *\n * @param {String} message The message to be printed.\n * @memberOf lunr.utils\n * @function\n */\nlunr.utils.warn = (function (global) {\n /* eslint-disable no-console */\n return function (message) {\n if (global.console && console.warn) {\n console.warn(message)\n }\n }\n /* eslint-enable no-console */\n})(this)\n\n/**\n * Convert an object to a string.\n *\n * In the case of `null` and `undefined` the function returns\n * the empty string, in all other cases the result of calling\n * `toString` on the passed object is returned.\n *\n * @param {Any} obj The object to convert to a string.\n * @return {String} string representation of the passed object.\n * @memberOf lunr.utils\n */\nlunr.utils.asString = function (obj) {\n if (obj === void 0 || obj === null) {\n return \"\"\n } else {\n return obj.toString()\n }\n}\n\n/**\n * Clones an object.\n *\n * Will create a copy of an existing object such that any mutations\n * on the copy cannot affect the original.\n *\n * Only shallow objects are supported, passing a nested object to this\n * function will cause a TypeError.\n *\n * Objects with primitives, and arrays of primitives are supported.\n *\n * @param {Object} obj The object to clone.\n * @return {Object} a clone of the passed object.\n * @throws {TypeError} when a nested object is passed.\n * @memberOf Utils\n */\nlunr.utils.clone = function (obj) {\n if (obj === null || obj === undefined) {\n return obj\n }\n\n var clone = Object.create(null),\n keys = Object.keys(obj)\n\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i],\n val = obj[key]\n\n if (Array.isArray(val)) {\n clone[key] = val.slice()\n continue\n }\n\n if (typeof val === 'string' ||\n typeof val === 'number' ||\n typeof val === 'boolean') {\n clone[key] = val\n continue\n }\n\n throw new TypeError(\"clone is not deep and does not support nested objects\")\n }\n\n return clone\n}\nlunr.FieldRef = function (docRef, fieldName, stringValue) {\n this.docRef = docRef\n this.fieldName = fieldName\n this._stringValue = stringValue\n}\n\nlunr.FieldRef.joiner = \"/\"\n\nlunr.FieldRef.fromString = function (s) {\n var n = s.indexOf(lunr.FieldRef.joiner)\n\n if (n === -1) {\n throw \"malformed field ref string\"\n }\n\n var fieldRef = s.slice(0, n),\n docRef = s.slice(n + 1)\n\n return new lunr.FieldRef (docRef, fieldRef, s)\n}\n\nlunr.FieldRef.prototype.toString = function () {\n if (this._stringValue == undefined) {\n this._stringValue = this.fieldName + lunr.FieldRef.joiner + this.docRef\n }\n\n return this._stringValue\n}\n/*!\n * lunr.Set\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A lunr set.\n *\n * @constructor\n */\nlunr.Set = function (elements) {\n this.elements = Object.create(null)\n\n if (elements) {\n this.length = elements.length\n\n for (var i = 0; i < this.length; i++) {\n this.elements[elements[i]] = true\n }\n } else {\n this.length = 0\n }\n}\n\n/**\n * A complete set that contains all elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.complete = {\n intersect: function (other) {\n return other\n },\n\n union: function () {\n return this\n },\n\n contains: function () {\n return true\n }\n}\n\n/**\n * An empty set that contains no elements.\n *\n * @static\n * @readonly\n * @type {lunr.Set}\n */\nlunr.Set.empty = {\n intersect: function () {\n return this\n },\n\n union: function (other) {\n return other\n },\n\n contains: function () {\n return false\n }\n}\n\n/**\n * Returns true if this set contains the specified object.\n *\n * @param {object} object - Object whose presence in this set is to be tested.\n * @returns {boolean} - True if this set contains the specified object.\n */\nlunr.Set.prototype.contains = function (object) {\n return !!this.elements[object]\n}\n\n/**\n * Returns a new set containing only the elements that are present in both\n * this set and the specified set.\n *\n * @param {lunr.Set} other - set to intersect with this set.\n * @returns {lunr.Set} a new set that is the intersection of this and the specified set.\n */\n\nlunr.Set.prototype.intersect = function (other) {\n var a, b, elements, intersection = []\n\n if (other === lunr.Set.complete) {\n return this\n }\n\n if (other === lunr.Set.empty) {\n return other\n }\n\n if (this.length < other.length) {\n a = this\n b = other\n } else {\n a = other\n b = this\n }\n\n elements = Object.keys(a.elements)\n\n for (var i = 0; i < elements.length; i++) {\n var element = elements[i]\n if (element in b.elements) {\n intersection.push(element)\n }\n }\n\n return new lunr.Set (intersection)\n}\n\n/**\n * Returns a new set combining the elements of this and the specified set.\n *\n * @param {lunr.Set} other - set to union with this set.\n * @return {lunr.Set} a new set that is the union of this and the specified set.\n */\n\nlunr.Set.prototype.union = function (other) {\n if (other === lunr.Set.complete) {\n return lunr.Set.complete\n }\n\n if (other === lunr.Set.empty) {\n return this\n }\n\n return new lunr.Set(Object.keys(this.elements).concat(Object.keys(other.elements)))\n}\n/**\n * A function to calculate the inverse document frequency for\n * a posting. This is shared between the builder and the index\n *\n * @private\n * @param {object} posting - The posting for a given term\n * @param {number} documentCount - The total number of documents.\n */\nlunr.idf = function (posting, documentCount) {\n var documentsWithTerm = 0\n\n for (var fieldName in posting) {\n if (fieldName == '_index') continue // Ignore the term index, its not a field\n documentsWithTerm += Object.keys(posting[fieldName]).length\n }\n\n var x = (documentCount - documentsWithTerm + 0.5) / (documentsWithTerm + 0.5)\n\n return Math.log(1 + Math.abs(x))\n}\n\n/**\n * A token wraps a string representation of a token\n * as it is passed through the text processing pipeline.\n *\n * @constructor\n * @param {string} [str=''] - The string token being wrapped.\n * @param {object} [metadata={}] - Metadata associated with this token.\n */\nlunr.Token = function (str, metadata) {\n this.str = str || \"\"\n this.metadata = metadata || {}\n}\n\n/**\n * Returns the token string that is being wrapped by this object.\n *\n * @returns {string}\n */\nlunr.Token.prototype.toString = function () {\n return this.str\n}\n\n/**\n * A token update function is used when updating or optionally\n * when cloning a token.\n *\n * @callback lunr.Token~updateFunction\n * @param {string} str - The string representation of the token.\n * @param {Object} metadata - All metadata associated with this token.\n */\n\n/**\n * Applies the given function to the wrapped string token.\n *\n * @example\n * token.update(function (str, metadata) {\n * return str.toUpperCase()\n * })\n *\n * @param {lunr.Token~updateFunction} fn - A function to apply to the token string.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.update = function (fn) {\n this.str = fn(this.str, this.metadata)\n return this\n}\n\n/**\n * Creates a clone of this token. Optionally a function can be\n * applied to the cloned token.\n *\n * @param {lunr.Token~updateFunction} [fn] - An optional function to apply to the cloned token.\n * @returns {lunr.Token}\n */\nlunr.Token.prototype.clone = function (fn) {\n fn = fn || function (s) { return s }\n return new lunr.Token (fn(this.str, this.metadata), this.metadata)\n}\n/*!\n * lunr.tokenizer\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A function for splitting a string into tokens ready to be inserted into\n * the search index. Uses `lunr.tokenizer.separator` to split strings, change\n * the value of this property to change how strings are split into tokens.\n *\n * This tokenizer will convert its parameter to a string by calling `toString` and\n * then will split this string on the character in `lunr.tokenizer.separator`.\n * Arrays will have their elements converted to strings and wrapped in a lunr.Token.\n *\n * Optional metadata can be passed to the tokenizer, this metadata will be cloned and\n * added as metadata to every token that is created from the object to be tokenized.\n *\n * @static\n * @param {?(string|object|object[])} obj - The object to convert into tokens\n * @param {?object} metadata - Optional metadata to associate with every token\n * @returns {lunr.Token[]}\n * @see {@link lunr.Pipeline}\n */\nlunr.tokenizer = function (obj, metadata) {\n if (obj == null || obj == undefined) {\n return []\n }\n\n if (Array.isArray(obj)) {\n return obj.map(function (t) {\n return new lunr.Token(\n lunr.utils.asString(t).toLowerCase(),\n lunr.utils.clone(metadata)\n )\n })\n }\n\n var str = obj.toString().toLowerCase(),\n len = str.length,\n tokens = []\n\n for (var sliceEnd = 0, sliceStart = 0; sliceEnd <= len; sliceEnd++) {\n var char = str.charAt(sliceEnd),\n sliceLength = sliceEnd - sliceStart\n\n if ((char.match(lunr.tokenizer.separator) || sliceEnd == len)) {\n\n if (sliceLength > 0) {\n var tokenMetadata = lunr.utils.clone(metadata) || {}\n tokenMetadata[\"position\"] = [sliceStart, sliceLength]\n tokenMetadata[\"index\"] = tokens.length\n\n tokens.push(\n new lunr.Token (\n str.slice(sliceStart, sliceEnd),\n tokenMetadata\n )\n )\n }\n\n sliceStart = sliceEnd + 1\n }\n\n }\n\n return tokens\n}\n\n/**\n * The separator used to split a string into tokens. Override this property to change the behaviour of\n * `lunr.tokenizer` behaviour when tokenizing strings. By default this splits on whitespace and hyphens.\n *\n * @static\n * @see lunr.tokenizer\n */\nlunr.tokenizer.separator = /[\\s\\-]+/\n/*!\n * lunr.Pipeline\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.Pipelines maintain an ordered list of functions to be applied to all\n * tokens in documents entering the search index and queries being ran against\n * the index.\n *\n * An instance of lunr.Index created with the lunr shortcut will contain a\n * pipeline with a stop word filter and an English language stemmer. Extra\n * functions can be added before or after either of these functions or these\n * default functions can be removed.\n *\n * When run the pipeline will call each function in turn, passing a token, the\n * index of that token in the original list of all tokens and finally a list of\n * all the original tokens.\n *\n * The output of functions in the pipeline will be passed to the next function\n * in the pipeline. To exclude a token from entering the index the function\n * should return undefined, the rest of the pipeline will not be called with\n * this token.\n *\n * For serialisation of pipelines to work, all functions used in an instance of\n * a pipeline should be registered with lunr.Pipeline. Registered functions can\n * then be loaded. If trying to load a serialised pipeline that uses functions\n * that are not registered an error will be thrown.\n *\n * If not planning on serialising the pipeline then registering pipeline functions\n * is not necessary.\n *\n * @constructor\n */\nlunr.Pipeline = function () {\n this._stack = []\n}\n\nlunr.Pipeline.registeredFunctions = Object.create(null)\n\n/**\n * A pipeline function maps lunr.Token to lunr.Token. A lunr.Token contains the token\n * string as well as all known metadata. A pipeline function can mutate the token string\n * or mutate (or add) metadata for a given token.\n *\n * A pipeline function can indicate that the passed token should be discarded by returning\n * null, undefined or an empty string. This token will not be passed to any downstream pipeline\n * functions and will not be added to the index.\n *\n * Multiple tokens can be returned by returning an array of tokens. Each token will be passed\n * to any downstream pipeline functions and all will returned tokens will be added to the index.\n *\n * Any number of pipeline functions may be chained together using a lunr.Pipeline.\n *\n * @interface lunr.PipelineFunction\n * @param {lunr.Token} token - A token from the document being processed.\n * @param {number} i - The index of this token in the complete list of tokens for this document/field.\n * @param {lunr.Token[]} tokens - All tokens for this document/field.\n * @returns {(?lunr.Token|lunr.Token[])}\n */\n\n/**\n * Register a function with the pipeline.\n *\n * Functions that are used in the pipeline should be registered if the pipeline\n * needs to be serialised, or a serialised pipeline needs to be loaded.\n *\n * Registering a function does not add it to a pipeline, functions must still be\n * added to instances of the pipeline for them to be used when running a pipeline.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @param {String} label - The label to register this function with\n */\nlunr.Pipeline.registerFunction = function (fn, label) {\n if (label in this.registeredFunctions) {\n lunr.utils.warn('Overwriting existing registered function: ' + label)\n }\n\n fn.label = label\n lunr.Pipeline.registeredFunctions[fn.label] = fn\n}\n\n/**\n * Warns if the function is not registered as a Pipeline function.\n *\n * @param {lunr.PipelineFunction} fn - The function to check for.\n * @private\n */\nlunr.Pipeline.warnIfFunctionNotRegistered = function (fn) {\n var isRegistered = fn.label && (fn.label in this.registeredFunctions)\n\n if (!isRegistered) {\n lunr.utils.warn('Function is not registered with pipeline. This may cause problems when serialising the index.\\n', fn)\n }\n}\n\n/**\n * Loads a previously serialised pipeline.\n *\n * All functions to be loaded must already be registered with lunr.Pipeline.\n * If any function from the serialised data has not been registered then an\n * error will be thrown.\n *\n * @param {Object} serialised - The serialised pipeline to load.\n * @returns {lunr.Pipeline}\n */\nlunr.Pipeline.load = function (serialised) {\n var pipeline = new lunr.Pipeline\n\n serialised.forEach(function (fnName) {\n var fn = lunr.Pipeline.registeredFunctions[fnName]\n\n if (fn) {\n pipeline.add(fn)\n } else {\n throw new Error('Cannot load unregistered function: ' + fnName)\n }\n })\n\n return pipeline\n}\n\n/**\n * Adds new functions to the end of the pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction[]} functions - Any number of functions to add to the pipeline.\n */\nlunr.Pipeline.prototype.add = function () {\n var fns = Array.prototype.slice.call(arguments)\n\n fns.forEach(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n this._stack.push(fn)\n }, this)\n}\n\n/**\n * Adds a single function after a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.after = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n pos = pos + 1\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Adds a single function before a function that already exists in the\n * pipeline.\n *\n * Logs a warning if the function has not been registered.\n *\n * @param {lunr.PipelineFunction} existingFn - A function that already exists in the pipeline.\n * @param {lunr.PipelineFunction} newFn - The new function to add to the pipeline.\n */\nlunr.Pipeline.prototype.before = function (existingFn, newFn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(newFn)\n\n var pos = this._stack.indexOf(existingFn)\n if (pos == -1) {\n throw new Error('Cannot find existingFn')\n }\n\n this._stack.splice(pos, 0, newFn)\n}\n\n/**\n * Removes a function from the pipeline.\n *\n * @param {lunr.PipelineFunction} fn The function to remove from the pipeline.\n */\nlunr.Pipeline.prototype.remove = function (fn) {\n var pos = this._stack.indexOf(fn)\n if (pos == -1) {\n return\n }\n\n this._stack.splice(pos, 1)\n}\n\n/**\n * Runs the current list of functions that make up the pipeline against the\n * passed tokens.\n *\n * @param {Array} tokens The tokens to run through the pipeline.\n * @returns {Array}\n */\nlunr.Pipeline.prototype.run = function (tokens) {\n var stackLength = this._stack.length\n\n for (var i = 0; i < stackLength; i++) {\n var fn = this._stack[i]\n var memo = []\n\n for (var j = 0; j < tokens.length; j++) {\n var result = fn(tokens[j], j, tokens)\n\n if (result === null || result === void 0 || result === '') continue\n\n if (Array.isArray(result)) {\n for (var k = 0; k < result.length; k++) {\n memo.push(result[k])\n }\n } else {\n memo.push(result)\n }\n }\n\n tokens = memo\n }\n\n return tokens\n}\n\n/**\n * Convenience method for passing a string through a pipeline and getting\n * strings out. This method takes care of wrapping the passed string in a\n * token and mapping the resulting tokens back to strings.\n *\n * @param {string} str - The string to pass through the pipeline.\n * @param {?object} metadata - Optional metadata to associate with the token\n * passed to the pipeline.\n * @returns {string[]}\n */\nlunr.Pipeline.prototype.runString = function (str, metadata) {\n var token = new lunr.Token (str, metadata)\n\n return this.run([token]).map(function (t) {\n return t.toString()\n })\n}\n\n/**\n * Resets the pipeline by removing any existing processors.\n *\n */\nlunr.Pipeline.prototype.reset = function () {\n this._stack = []\n}\n\n/**\n * Returns a representation of the pipeline ready for serialisation.\n *\n * Logs a warning if the function has not been registered.\n *\n * @returns {Array}\n */\nlunr.Pipeline.prototype.toJSON = function () {\n return this._stack.map(function (fn) {\n lunr.Pipeline.warnIfFunctionNotRegistered(fn)\n\n return fn.label\n })\n}\n/*!\n * lunr.Vector\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A vector is used to construct the vector space of documents and queries. These\n * vectors support operations to determine the similarity between two documents or\n * a document and a query.\n *\n * Normally no parameters are required for initializing a vector, but in the case of\n * loading a previously dumped vector the raw elements can be provided to the constructor.\n *\n * For performance reasons vectors are implemented with a flat array, where an elements\n * index is immediately followed by its value. E.g. [index, value, index, value]. This\n * allows the underlying array to be as sparse as possible and still offer decent\n * performance when being used for vector calculations.\n *\n * @constructor\n * @param {Number[]} [elements] - The flat list of element index and element value pairs.\n */\nlunr.Vector = function (elements) {\n this._magnitude = 0\n this.elements = elements || []\n}\n\n\n/**\n * Calculates the position within the vector to insert a given index.\n *\n * This is used internally by insert and upsert. If there are duplicate indexes then\n * the position is returned as if the value for that index were to be updated, but it\n * is the callers responsibility to check whether there is a duplicate at that index\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @returns {Number}\n */\nlunr.Vector.prototype.positionForIndex = function (index) {\n // For an empty vector the tuple can be inserted at the beginning\n if (this.elements.length == 0) {\n return 0\n }\n\n var start = 0,\n end = this.elements.length / 2,\n sliceLength = end - start,\n pivotPoint = Math.floor(sliceLength / 2),\n pivotIndex = this.elements[pivotPoint * 2]\n\n while (sliceLength > 1) {\n if (pivotIndex < index) {\n start = pivotPoint\n }\n\n if (pivotIndex > index) {\n end = pivotPoint\n }\n\n if (pivotIndex == index) {\n break\n }\n\n sliceLength = end - start\n pivotPoint = start + Math.floor(sliceLength / 2)\n pivotIndex = this.elements[pivotPoint * 2]\n }\n\n if (pivotIndex == index) {\n return pivotPoint * 2\n }\n\n if (pivotIndex > index) {\n return pivotPoint * 2\n }\n\n if (pivotIndex < index) {\n return (pivotPoint + 1) * 2\n }\n}\n\n/**\n * Inserts an element at an index within the vector.\n *\n * Does not allow duplicates, will throw an error if there is already an entry\n * for this index.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n */\nlunr.Vector.prototype.insert = function (insertIdx, val) {\n this.upsert(insertIdx, val, function () {\n throw \"duplicate index\"\n })\n}\n\n/**\n * Inserts or updates an existing index within the vector.\n *\n * @param {Number} insertIdx - The index at which the element should be inserted.\n * @param {Number} val - The value to be inserted into the vector.\n * @param {function} fn - A function that is called for updates, the existing value and the\n * requested value are passed as arguments\n */\nlunr.Vector.prototype.upsert = function (insertIdx, val, fn) {\n this._magnitude = 0\n var position = this.positionForIndex(insertIdx)\n\n if (this.elements[position] == insertIdx) {\n this.elements[position + 1] = fn(this.elements[position + 1], val)\n } else {\n this.elements.splice(position, 0, insertIdx, val)\n }\n}\n\n/**\n * Calculates the magnitude of this vector.\n *\n * @returns {Number}\n */\nlunr.Vector.prototype.magnitude = function () {\n if (this._magnitude) return this._magnitude\n\n var sumOfSquares = 0,\n elementsLength = this.elements.length\n\n for (var i = 1; i < elementsLength; i += 2) {\n var val = this.elements[i]\n sumOfSquares += val * val\n }\n\n return this._magnitude = Math.sqrt(sumOfSquares)\n}\n\n/**\n * Calculates the dot product of this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The vector to compute the dot product with.\n * @returns {Number}\n */\nlunr.Vector.prototype.dot = function (otherVector) {\n var dotProduct = 0,\n a = this.elements, b = otherVector.elements,\n aLen = a.length, bLen = b.length,\n aVal = 0, bVal = 0,\n i = 0, j = 0\n\n while (i < aLen && j < bLen) {\n aVal = a[i], bVal = b[j]\n if (aVal < bVal) {\n i += 2\n } else if (aVal > bVal) {\n j += 2\n } else if (aVal == bVal) {\n dotProduct += a[i + 1] * b[j + 1]\n i += 2\n j += 2\n }\n }\n\n return dotProduct\n}\n\n/**\n * Calculates the similarity between this vector and another vector.\n *\n * @param {lunr.Vector} otherVector - The other vector to calculate the\n * similarity with.\n * @returns {Number}\n */\nlunr.Vector.prototype.similarity = function (otherVector) {\n return this.dot(otherVector) / this.magnitude() || 0\n}\n\n/**\n * Converts the vector to an array of the elements within the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toArray = function () {\n var output = new Array (this.elements.length / 2)\n\n for (var i = 1, j = 0; i < this.elements.length; i += 2, j++) {\n output[j] = this.elements[i]\n }\n\n return output\n}\n\n/**\n * A JSON serializable representation of the vector.\n *\n * @returns {Number[]}\n */\nlunr.Vector.prototype.toJSON = function () {\n return this.elements\n}\n/* eslint-disable */\n/*!\n * lunr.stemmer\n * Copyright (C) 2020 Oliver Nightingale\n * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt\n */\n\n/**\n * lunr.stemmer is an english language stemmer, this is a JavaScript\n * implementation of the PorterStemmer taken from http://tartarus.org/~martin\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token - The string to stem\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n * @function\n */\nlunr.stemmer = (function(){\n var step2list = {\n \"ational\" : \"ate\",\n \"tional\" : \"tion\",\n \"enci\" : \"ence\",\n \"anci\" : \"ance\",\n \"izer\" : \"ize\",\n \"bli\" : \"ble\",\n \"alli\" : \"al\",\n \"entli\" : \"ent\",\n \"eli\" : \"e\",\n \"ousli\" : \"ous\",\n \"ization\" : \"ize\",\n \"ation\" : \"ate\",\n \"ator\" : \"ate\",\n \"alism\" : \"al\",\n \"iveness\" : \"ive\",\n \"fulness\" : \"ful\",\n \"ousness\" : \"ous\",\n \"aliti\" : \"al\",\n \"iviti\" : \"ive\",\n \"biliti\" : \"ble\",\n \"logi\" : \"log\"\n },\n\n step3list = {\n \"icate\" : \"ic\",\n \"ative\" : \"\",\n \"alize\" : \"al\",\n \"iciti\" : \"ic\",\n \"ical\" : \"ic\",\n \"ful\" : \"\",\n \"ness\" : \"\"\n },\n\n c = \"[^aeiou]\", // consonant\n v = \"[aeiouy]\", // vowel\n C = c + \"[^aeiouy]*\", // consonant sequence\n V = v + \"[aeiou]*\", // vowel sequence\n\n mgr0 = \"^(\" + C + \")?\" + V + C, // [C]VC... is m>0\n meq1 = \"^(\" + C + \")?\" + V + C + \"(\" + V + \")?$\", // [C]VC[V] is m=1\n mgr1 = \"^(\" + C + \")?\" + V + C + V + C, // [C]VCVC... is m>1\n s_v = \"^(\" + C + \")?\" + v; // vowel in stem\n\n var re_mgr0 = new RegExp(mgr0);\n var re_mgr1 = new RegExp(mgr1);\n var re_meq1 = new RegExp(meq1);\n var re_s_v = new RegExp(s_v);\n\n var re_1a = /^(.+?)(ss|i)es$/;\n var re2_1a = /^(.+?)([^s])s$/;\n var re_1b = /^(.+?)eed$/;\n var re2_1b = /^(.+?)(ed|ing)$/;\n var re_1b_2 = /.$/;\n var re2_1b_2 = /(at|bl|iz)$/;\n var re3_1b_2 = new RegExp(\"([^aeiouylsz])\\\\1$\");\n var re4_1b_2 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var re_1c = /^(.+?[^aeiou])y$/;\n var re_2 = /^(.+?)(ational|tional|enci|anci|izer|bli|alli|entli|eli|ousli|ization|ation|ator|alism|iveness|fulness|ousness|aliti|iviti|biliti|logi)$/;\n\n var re_3 = /^(.+?)(icate|ative|alize|iciti|ical|ful|ness)$/;\n\n var re_4 = /^(.+?)(al|ance|ence|er|ic|able|ible|ant|ement|ment|ent|ou|ism|ate|iti|ous|ive|ize)$/;\n var re2_4 = /^(.+?)(s|t)(ion)$/;\n\n var re_5 = /^(.+?)e$/;\n var re_5_1 = /ll$/;\n var re3_5 = new RegExp(\"^\" + C + v + \"[^aeiouwxy]$\");\n\n var porterStemmer = function porterStemmer(w) {\n var stem,\n suffix,\n firstch,\n re,\n re2,\n re3,\n re4;\n\n if (w.length < 3) { return w; }\n\n firstch = w.substr(0,1);\n if (firstch == \"y\") {\n w = firstch.toUpperCase() + w.substr(1);\n }\n\n // Step 1a\n re = re_1a\n re2 = re2_1a;\n\n if (re.test(w)) { w = w.replace(re,\"$1$2\"); }\n else if (re2.test(w)) { w = w.replace(re2,\"$1$2\"); }\n\n // Step 1b\n re = re_1b;\n re2 = re2_1b;\n if (re.test(w)) {\n var fp = re.exec(w);\n re = re_mgr0;\n if (re.test(fp[1])) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1];\n re2 = re_s_v;\n if (re2.test(stem)) {\n w = stem;\n re2 = re2_1b_2;\n re3 = re3_1b_2;\n re4 = re4_1b_2;\n if (re2.test(w)) { w = w + \"e\"; }\n else if (re3.test(w)) { re = re_1b_2; w = w.replace(re,\"\"); }\n else if (re4.test(w)) { w = w + \"e\"; }\n }\n }\n\n // Step 1c - replace suffix y or Y by i if preceded by a non-vowel which is not the first letter of the word (so cry -> cri, by -> by, say -> say)\n re = re_1c;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n w = stem + \"i\";\n }\n\n // Step 2\n re = re_2;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step2list[suffix];\n }\n }\n\n // Step 3\n re = re_3;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n suffix = fp[2];\n re = re_mgr0;\n if (re.test(stem)) {\n w = stem + step3list[suffix];\n }\n }\n\n // Step 4\n re = re_4;\n re2 = re2_4;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n if (re.test(stem)) {\n w = stem;\n }\n } else if (re2.test(w)) {\n var fp = re2.exec(w);\n stem = fp[1] + fp[2];\n re2 = re_mgr1;\n if (re2.test(stem)) {\n w = stem;\n }\n }\n\n // Step 5\n re = re_5;\n if (re.test(w)) {\n var fp = re.exec(w);\n stem = fp[1];\n re = re_mgr1;\n re2 = re_meq1;\n re3 = re3_5;\n if (re.test(stem) || (re2.test(stem) && !(re3.test(stem)))) {\n w = stem;\n }\n }\n\n re = re_5_1;\n re2 = re_mgr1;\n if (re.test(w) && re2.test(w)) {\n re = re_1b_2;\n w = w.replace(re,\"\");\n }\n\n // and turn initial Y back to y\n\n if (firstch == \"y\") {\n w = firstch.toLowerCase() + w.substr(1);\n }\n\n return w;\n };\n\n return function (token) {\n return token.update(porterStemmer);\n }\n})();\n\nlunr.Pipeline.registerFunction(lunr.stemmer, 'stemmer')\n/*!\n * lunr.stopWordFilter\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.generateStopWordFilter builds a stopWordFilter function from the provided\n * list of stop words.\n *\n * The built in lunr.stopWordFilter is built using this generator and can be used\n * to generate custom stopWordFilters for applications or non English languages.\n *\n * @function\n * @param {Array} token The token to pass through the filter\n * @returns {lunr.PipelineFunction}\n * @see lunr.Pipeline\n * @see lunr.stopWordFilter\n */\nlunr.generateStopWordFilter = function (stopWords) {\n var words = stopWords.reduce(function (memo, stopWord) {\n memo[stopWord] = stopWord\n return memo\n }, {})\n\n return function (token) {\n if (token && words[token.toString()] !== token.toString()) return token\n }\n}\n\n/**\n * lunr.stopWordFilter is an English language stop word list filter, any words\n * contained in the list will not be passed through the filter.\n *\n * This is intended to be used in the Pipeline. If the token does not pass the\n * filter then undefined will be returned.\n *\n * @function\n * @implements {lunr.PipelineFunction}\n * @params {lunr.Token} token - A token to check for being a stop word.\n * @returns {lunr.Token}\n * @see {@link lunr.Pipeline}\n */\nlunr.stopWordFilter = lunr.generateStopWordFilter([\n 'a',\n 'able',\n 'about',\n 'across',\n 'after',\n 'all',\n 'almost',\n 'also',\n 'am',\n 'among',\n 'an',\n 'and',\n 'any',\n 'are',\n 'as',\n 'at',\n 'be',\n 'because',\n 'been',\n 'but',\n 'by',\n 'can',\n 'cannot',\n 'could',\n 'dear',\n 'did',\n 'do',\n 'does',\n 'either',\n 'else',\n 'ever',\n 'every',\n 'for',\n 'from',\n 'get',\n 'got',\n 'had',\n 'has',\n 'have',\n 'he',\n 'her',\n 'hers',\n 'him',\n 'his',\n 'how',\n 'however',\n 'i',\n 'if',\n 'in',\n 'into',\n 'is',\n 'it',\n 'its',\n 'just',\n 'least',\n 'let',\n 'like',\n 'likely',\n 'may',\n 'me',\n 'might',\n 'most',\n 'must',\n 'my',\n 'neither',\n 'no',\n 'nor',\n 'not',\n 'of',\n 'off',\n 'often',\n 'on',\n 'only',\n 'or',\n 'other',\n 'our',\n 'own',\n 'rather',\n 'said',\n 'say',\n 'says',\n 'she',\n 'should',\n 'since',\n 'so',\n 'some',\n 'than',\n 'that',\n 'the',\n 'their',\n 'them',\n 'then',\n 'there',\n 'these',\n 'they',\n 'this',\n 'tis',\n 'to',\n 'too',\n 'twas',\n 'us',\n 'wants',\n 'was',\n 'we',\n 'were',\n 'what',\n 'when',\n 'where',\n 'which',\n 'while',\n 'who',\n 'whom',\n 'why',\n 'will',\n 'with',\n 'would',\n 'yet',\n 'you',\n 'your'\n])\n\nlunr.Pipeline.registerFunction(lunr.stopWordFilter, 'stopWordFilter')\n/*!\n * lunr.trimmer\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.trimmer is a pipeline function for trimming non word\n * characters from the beginning and end of tokens before they\n * enter the index.\n *\n * This implementation may not work correctly for non latin\n * characters and should either be removed or adapted for use\n * with languages with non-latin characters.\n *\n * @static\n * @implements {lunr.PipelineFunction}\n * @param {lunr.Token} token The token to pass through the filter\n * @returns {lunr.Token}\n * @see lunr.Pipeline\n */\nlunr.trimmer = function (token) {\n return token.update(function (s) {\n return s.replace(/^\\W+/, '').replace(/\\W+$/, '')\n })\n}\n\nlunr.Pipeline.registerFunction(lunr.trimmer, 'trimmer')\n/*!\n * lunr.TokenSet\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * A token set is used to store the unique list of all tokens\n * within an index. Token sets are also used to represent an\n * incoming query to the index, this query token set and index\n * token set are then intersected to find which tokens to look\n * up in the inverted index.\n *\n * A token set can hold multiple tokens, as in the case of the\n * index token set, or it can hold a single token as in the\n * case of a simple query token set.\n *\n * Additionally token sets are used to perform wildcard matching.\n * Leading, contained and trailing wildcards are supported, and\n * from this edit distance matching can also be provided.\n *\n * Token sets are implemented as a minimal finite state automata,\n * where both common prefixes and suffixes are shared between tokens.\n * This helps to reduce the space used for storing the token set.\n *\n * @constructor\n */\nlunr.TokenSet = function () {\n this.final = false\n this.edges = {}\n this.id = lunr.TokenSet._nextId\n lunr.TokenSet._nextId += 1\n}\n\n/**\n * Keeps track of the next, auto increment, identifier to assign\n * to a new tokenSet.\n *\n * TokenSets require a unique identifier to be correctly minimised.\n *\n * @private\n */\nlunr.TokenSet._nextId = 1\n\n/**\n * Creates a TokenSet instance from the given sorted array of words.\n *\n * @param {String[]} arr - A sorted array of strings to create the set from.\n * @returns {lunr.TokenSet}\n * @throws Will throw an error if the input array is not sorted.\n */\nlunr.TokenSet.fromArray = function (arr) {\n var builder = new lunr.TokenSet.Builder\n\n for (var i = 0, len = arr.length; i < len; i++) {\n builder.insert(arr[i])\n }\n\n builder.finish()\n return builder.root\n}\n\n/**\n * Creates a token set from a query clause.\n *\n * @private\n * @param {Object} clause - A single clause from lunr.Query.\n * @param {string} clause.term - The query clause term.\n * @param {number} [clause.editDistance] - The optional edit distance for the term.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromClause = function (clause) {\n if ('editDistance' in clause) {\n return lunr.TokenSet.fromFuzzyString(clause.term, clause.editDistance)\n } else {\n return lunr.TokenSet.fromString(clause.term)\n }\n}\n\n/**\n * Creates a token set representing a single string with a specified\n * edit distance.\n *\n * Insertions, deletions, substitutions and transpositions are each\n * treated as an edit distance of 1.\n *\n * Increasing the allowed edit distance will have a dramatic impact\n * on the performance of both creating and intersecting these TokenSets.\n * It is advised to keep the edit distance less than 3.\n *\n * @param {string} str - The string to create the token set from.\n * @param {number} editDistance - The allowed edit distance to match.\n * @returns {lunr.Vector}\n */\nlunr.TokenSet.fromFuzzyString = function (str, editDistance) {\n var root = new lunr.TokenSet\n\n var stack = [{\n node: root,\n editsRemaining: editDistance,\n str: str\n }]\n\n while (stack.length) {\n var frame = stack.pop()\n\n // no edit\n if (frame.str.length > 0) {\n var char = frame.str.charAt(0),\n noEditNode\n\n if (char in frame.node.edges) {\n noEditNode = frame.node.edges[char]\n } else {\n noEditNode = new lunr.TokenSet\n frame.node.edges[char] = noEditNode\n }\n\n if (frame.str.length == 1) {\n noEditNode.final = true\n }\n\n stack.push({\n node: noEditNode,\n editsRemaining: frame.editsRemaining,\n str: frame.str.slice(1)\n })\n }\n\n if (frame.editsRemaining == 0) {\n continue\n }\n\n // insertion\n if (\"*\" in frame.node.edges) {\n var insertionNode = frame.node.edges[\"*\"]\n } else {\n var insertionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = insertionNode\n }\n\n if (frame.str.length == 0) {\n insertionNode.final = true\n }\n\n stack.push({\n node: insertionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str\n })\n\n // deletion\n // can only do a deletion if we have enough edits remaining\n // and if there are characters left to delete in the string\n if (frame.str.length > 1) {\n stack.push({\n node: frame.node,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // deletion\n // just removing the last character from the str\n if (frame.str.length == 1) {\n frame.node.final = true\n }\n\n // substitution\n // can only do a substitution if we have enough edits remaining\n // and if there are characters left to substitute\n if (frame.str.length >= 1) {\n if (\"*\" in frame.node.edges) {\n var substitutionNode = frame.node.edges[\"*\"]\n } else {\n var substitutionNode = new lunr.TokenSet\n frame.node.edges[\"*\"] = substitutionNode\n }\n\n if (frame.str.length == 1) {\n substitutionNode.final = true\n }\n\n stack.push({\n node: substitutionNode,\n editsRemaining: frame.editsRemaining - 1,\n str: frame.str.slice(1)\n })\n }\n\n // transposition\n // can only do a transposition if there are edits remaining\n // and there are enough characters to transpose\n if (frame.str.length > 1) {\n var charA = frame.str.charAt(0),\n charB = frame.str.charAt(1),\n transposeNode\n\n if (charB in frame.node.edges) {\n transposeNode = frame.node.edges[charB]\n } else {\n transposeNode = new lunr.TokenSet\n frame.node.edges[charB] = transposeNode\n }\n\n if (frame.str.length == 1) {\n transposeNode.final = true\n }\n\n stack.push({\n node: transposeNode,\n editsRemaining: frame.editsRemaining - 1,\n str: charA + frame.str.slice(2)\n })\n }\n }\n\n return root\n}\n\n/**\n * Creates a TokenSet from a string.\n *\n * The string may contain one or more wildcard characters (*)\n * that will allow wildcard matching when intersecting with\n * another TokenSet.\n *\n * @param {string} str - The string to create a TokenSet from.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.fromString = function (str) {\n var node = new lunr.TokenSet,\n root = node\n\n /*\n * Iterates through all characters within the passed string\n * appending a node for each character.\n *\n * When a wildcard character is found then a self\n * referencing edge is introduced to continually match\n * any number of any characters.\n */\n for (var i = 0, len = str.length; i < len; i++) {\n var char = str[i],\n final = (i == len - 1)\n\n if (char == \"*\") {\n node.edges[char] = node\n node.final = final\n\n } else {\n var next = new lunr.TokenSet\n next.final = final\n\n node.edges[char] = next\n node = next\n }\n }\n\n return root\n}\n\n/**\n * Converts this TokenSet into an array of strings\n * contained within the TokenSet.\n *\n * This is not intended to be used on a TokenSet that\n * contains wildcards, in these cases the results are\n * undefined and are likely to cause an infinite loop.\n *\n * @returns {string[]}\n */\nlunr.TokenSet.prototype.toArray = function () {\n var words = []\n\n var stack = [{\n prefix: \"\",\n node: this\n }]\n\n while (stack.length) {\n var frame = stack.pop(),\n edges = Object.keys(frame.node.edges),\n len = edges.length\n\n if (frame.node.final) {\n /* In Safari, at this point the prefix is sometimes corrupted, see:\n * https://github.com/olivernn/lunr.js/issues/279 Calling any\n * String.prototype method forces Safari to \"cast\" this string to what\n * it's supposed to be, fixing the bug. */\n frame.prefix.charAt(0)\n words.push(frame.prefix)\n }\n\n for (var i = 0; i < len; i++) {\n var edge = edges[i]\n\n stack.push({\n prefix: frame.prefix.concat(edge),\n node: frame.node.edges[edge]\n })\n }\n }\n\n return words\n}\n\n/**\n * Generates a string representation of a TokenSet.\n *\n * This is intended to allow TokenSets to be used as keys\n * in objects, largely to aid the construction and minimisation\n * of a TokenSet. As such it is not designed to be a human\n * friendly representation of the TokenSet.\n *\n * @returns {string}\n */\nlunr.TokenSet.prototype.toString = function () {\n // NOTE: Using Object.keys here as this.edges is very likely\n // to enter 'hash-mode' with many keys being added\n //\n // avoiding a for-in loop here as it leads to the function\n // being de-optimised (at least in V8). From some simple\n // benchmarks the performance is comparable, but allowing\n // V8 to optimize may mean easy performance wins in the future.\n\n if (this._str) {\n return this._str\n }\n\n var str = this.final ? '1' : '0',\n labels = Object.keys(this.edges).sort(),\n len = labels.length\n\n for (var i = 0; i < len; i++) {\n var label = labels[i],\n node = this.edges[label]\n\n str = str + label + node.id\n }\n\n return str\n}\n\n/**\n * Returns a new TokenSet that is the intersection of\n * this TokenSet and the passed TokenSet.\n *\n * This intersection will take into account any wildcards\n * contained within the TokenSet.\n *\n * @param {lunr.TokenSet} b - An other TokenSet to intersect with.\n * @returns {lunr.TokenSet}\n */\nlunr.TokenSet.prototype.intersect = function (b) {\n var output = new lunr.TokenSet,\n frame = undefined\n\n var stack = [{\n qNode: b,\n output: output,\n node: this\n }]\n\n while (stack.length) {\n frame = stack.pop()\n\n // NOTE: As with the #toString method, we are using\n // Object.keys and a for loop instead of a for-in loop\n // as both of these objects enter 'hash' mode, causing\n // the function to be de-optimised in V8\n var qEdges = Object.keys(frame.qNode.edges),\n qLen = qEdges.length,\n nEdges = Object.keys(frame.node.edges),\n nLen = nEdges.length\n\n for (var q = 0; q < qLen; q++) {\n var qEdge = qEdges[q]\n\n for (var n = 0; n < nLen; n++) {\n var nEdge = nEdges[n]\n\n if (nEdge == qEdge || qEdge == '*') {\n var node = frame.node.edges[nEdge],\n qNode = frame.qNode.edges[qEdge],\n final = node.final && qNode.final,\n next = undefined\n\n if (nEdge in frame.output.edges) {\n // an edge already exists for this character\n // no need to create a new node, just set the finality\n // bit unless this node is already final\n next = frame.output.edges[nEdge]\n next.final = next.final || final\n\n } else {\n // no edge exists yet, must create one\n // set the finality bit and insert it\n // into the output\n next = new lunr.TokenSet\n next.final = final\n frame.output.edges[nEdge] = next\n }\n\n stack.push({\n qNode: qNode,\n output: next,\n node: node\n })\n }\n }\n }\n }\n\n return output\n}\nlunr.TokenSet.Builder = function () {\n this.previousWord = \"\"\n this.root = new lunr.TokenSet\n this.uncheckedNodes = []\n this.minimizedNodes = {}\n}\n\nlunr.TokenSet.Builder.prototype.insert = function (word) {\n var node,\n commonPrefix = 0\n\n if (word < this.previousWord) {\n throw new Error (\"Out of order word insertion\")\n }\n\n for (var i = 0; i < word.length && i < this.previousWord.length; i++) {\n if (word[i] != this.previousWord[i]) break\n commonPrefix++\n }\n\n this.minimize(commonPrefix)\n\n if (this.uncheckedNodes.length == 0) {\n node = this.root\n } else {\n node = this.uncheckedNodes[this.uncheckedNodes.length - 1].child\n }\n\n for (var i = commonPrefix; i < word.length; i++) {\n var nextNode = new lunr.TokenSet,\n char = word[i]\n\n node.edges[char] = nextNode\n\n this.uncheckedNodes.push({\n parent: node,\n char: char,\n child: nextNode\n })\n\n node = nextNode\n }\n\n node.final = true\n this.previousWord = word\n}\n\nlunr.TokenSet.Builder.prototype.finish = function () {\n this.minimize(0)\n}\n\nlunr.TokenSet.Builder.prototype.minimize = function (downTo) {\n for (var i = this.uncheckedNodes.length - 1; i >= downTo; i--) {\n var node = this.uncheckedNodes[i],\n childKey = node.child.toString()\n\n if (childKey in this.minimizedNodes) {\n node.parent.edges[node.char] = this.minimizedNodes[childKey]\n } else {\n // Cache the key for this node since\n // we know it can't change anymore\n node.child._str = childKey\n\n this.minimizedNodes[childKey] = node.child\n }\n\n this.uncheckedNodes.pop()\n }\n}\n/*!\n * lunr.Index\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * An index contains the built index of all documents and provides a query interface\n * to the index.\n *\n * Usually instances of lunr.Index will not be created using this constructor, instead\n * lunr.Builder should be used to construct new indexes, or lunr.Index.load should be\n * used to load previously built and serialized indexes.\n *\n * @constructor\n * @param {Object} attrs - The attributes of the built search index.\n * @param {Object} attrs.invertedIndex - An index of term/field to document reference.\n * @param {Object} attrs.fieldVectors - Field vectors\n * @param {lunr.TokenSet} attrs.tokenSet - An set of all corpus tokens.\n * @param {string[]} attrs.fields - The names of indexed document fields.\n * @param {lunr.Pipeline} attrs.pipeline - The pipeline to use for search terms.\n */\nlunr.Index = function (attrs) {\n this.invertedIndex = attrs.invertedIndex\n this.fieldVectors = attrs.fieldVectors\n this.tokenSet = attrs.tokenSet\n this.fields = attrs.fields\n this.pipeline = attrs.pipeline\n}\n\n/**\n * A result contains details of a document matching a search query.\n * @typedef {Object} lunr.Index~Result\n * @property {string} ref - The reference of the document this result represents.\n * @property {number} score - A number between 0 and 1 representing how similar this document is to the query.\n * @property {lunr.MatchData} matchData - Contains metadata about this match including which term(s) caused the match.\n */\n\n/**\n * Although lunr provides the ability to create queries using lunr.Query, it also provides a simple\n * query language which itself is parsed into an instance of lunr.Query.\n *\n * For programmatically building queries it is advised to directly use lunr.Query, the query language\n * is best used for human entered text rather than program generated text.\n *\n * At its simplest queries can just be a single term, e.g. `hello`, multiple terms are also supported\n * and will be combined with OR, e.g `hello world` will match documents that contain either 'hello'\n * or 'world', though those that contain both will rank higher in the results.\n *\n * Wildcards can be included in terms to match one or more unspecified characters, these wildcards can\n * be inserted anywhere within the term, and more than one wildcard can exist in a single term. Adding\n * wildcards will increase the number of documents that will be found but can also have a negative\n * impact on query performance, especially with wildcards at the beginning of a term.\n *\n * Terms can be restricted to specific fields, e.g. `title:hello`, only documents with the term\n * hello in the title field will match this query. Using a field not present in the index will lead\n * to an error being thrown.\n *\n * Modifiers can also be added to terms, lunr supports edit distance and boost modifiers on terms. A term\n * boost will make documents matching that term score higher, e.g. `foo^5`. Edit distance is also supported\n * to provide fuzzy matching, e.g. 'hello~2' will match documents with hello with an edit distance of 2.\n * Avoid large values for edit distance to improve query performance.\n *\n * Each term also supports a presence modifier. By default a term's presence in document is optional, however\n * this can be changed to either required or prohibited. For a term's presence to be required in a document the\n * term should be prefixed with a '+', e.g. `+foo bar` is a search for documents that must contain 'foo' and\n * optionally contain 'bar'. Conversely a leading '-' sets the terms presence to prohibited, i.e. it must not\n * appear in a document, e.g. `-foo bar` is a search for documents that do not contain 'foo' but may contain 'bar'.\n *\n * To escape special characters the backslash character '\\' can be used, this allows searches to include\n * characters that would normally be considered modifiers, e.g. `foo\\~2` will search for a term \"foo~2\" instead\n * of attempting to apply a boost of 2 to the search term \"foo\".\n *\n * @typedef {string} lunr.Index~QueryString\n * @example Simple single term query\n * hello\n * @example Multiple term query\n * hello world\n * @example term scoped to a field\n * title:hello\n * @example term with a boost of 10\n * hello^10\n * @example term with an edit distance of 2\n * hello~2\n * @example terms with presence modifiers\n * -foo +bar baz\n */\n\n/**\n * Performs a search against the index using lunr query syntax.\n *\n * Results will be returned sorted by their score, the most relevant results\n * will be returned first. For details on how the score is calculated, please see\n * the {@link https://lunrjs.com/guides/searching.html#scoring|guide}.\n *\n * For more programmatic querying use lunr.Index#query.\n *\n * @param {lunr.Index~QueryString} queryString - A string containing a lunr query.\n * @throws {lunr.QueryParseError} If the passed query string cannot be parsed.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.search = function (queryString) {\n return this.query(function (query) {\n var parser = new lunr.QueryParser(queryString, query)\n parser.parse()\n })\n}\n\n/**\n * A query builder callback provides a query object to be used to express\n * the query to perform on the index.\n *\n * @callback lunr.Index~queryBuilder\n * @param {lunr.Query} query - The query object to build up.\n * @this lunr.Query\n */\n\n/**\n * Performs a query against the index using the yielded lunr.Query object.\n *\n * If performing programmatic queries against the index, this method is preferred\n * over lunr.Index#search so as to avoid the additional query parsing overhead.\n *\n * A query object is yielded to the supplied function which should be used to\n * express the query to be run against the index.\n *\n * Note that although this function takes a callback parameter it is _not_ an\n * asynchronous operation, the callback is just yielded a query object to be\n * customized.\n *\n * @param {lunr.Index~queryBuilder} fn - A function that is used to build the query.\n * @returns {lunr.Index~Result[]}\n */\nlunr.Index.prototype.query = function (fn) {\n // for each query clause\n // * process terms\n // * expand terms from token set\n // * find matching documents and metadata\n // * get document vectors\n // * score documents\n\n var query = new lunr.Query(this.fields),\n matchingFields = Object.create(null),\n queryVectors = Object.create(null),\n termFieldCache = Object.create(null),\n requiredMatches = Object.create(null),\n prohibitedMatches = Object.create(null)\n\n /*\n * To support field level boosts a query vector is created per\n * field. An empty vector is eagerly created to support negated\n * queries.\n */\n for (var i = 0; i < this.fields.length; i++) {\n queryVectors[this.fields[i]] = new lunr.Vector\n }\n\n fn.call(query, query)\n\n for (var i = 0; i < query.clauses.length; i++) {\n /*\n * Unless the pipeline has been disabled for this term, which is\n * the case for terms with wildcards, we need to pass the clause\n * term through the search pipeline. A pipeline returns an array\n * of processed terms. Pipeline functions may expand the passed\n * term, which means we may end up performing multiple index lookups\n * for a single query term.\n */\n var clause = query.clauses[i],\n terms = null,\n clauseMatches = lunr.Set.empty\n\n if (clause.usePipeline) {\n terms = this.pipeline.runString(clause.term, {\n fields: clause.fields\n })\n } else {\n terms = [clause.term]\n }\n\n for (var m = 0; m < terms.length; m++) {\n var term = terms[m]\n\n /*\n * Each term returned from the pipeline needs to use the same query\n * clause object, e.g. the same boost and or edit distance. The\n * simplest way to do this is to re-use the clause object but mutate\n * its term property.\n */\n clause.term = term\n\n /*\n * From the term in the clause we create a token set which will then\n * be used to intersect the indexes token set to get a list of terms\n * to lookup in the inverted index\n */\n var termTokenSet = lunr.TokenSet.fromClause(clause),\n expandedTerms = this.tokenSet.intersect(termTokenSet).toArray()\n\n /*\n * If a term marked as required does not exist in the tokenSet it is\n * impossible for the search to return any matches. We set all the field\n * scoped required matches set to empty and stop examining any further\n * clauses.\n */\n if (expandedTerms.length === 0 && clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = lunr.Set.empty\n }\n\n break\n }\n\n for (var j = 0; j < expandedTerms.length; j++) {\n /*\n * For each term get the posting and termIndex, this is required for\n * building the query vector.\n */\n var expandedTerm = expandedTerms[j],\n posting = this.invertedIndex[expandedTerm],\n termIndex = posting._index\n\n for (var k = 0; k < clause.fields.length; k++) {\n /*\n * For each field that this query term is scoped by (by default\n * all fields are in scope) we need to get all the document refs\n * that have this term in that field.\n *\n * The posting is the entry in the invertedIndex for the matching\n * term from above.\n */\n var field = clause.fields[k],\n fieldPosting = posting[field],\n matchingDocumentRefs = Object.keys(fieldPosting),\n termField = expandedTerm + \"/\" + field,\n matchingDocumentsSet = new lunr.Set(matchingDocumentRefs)\n\n /*\n * if the presence of this term is required ensure that the matching\n * documents are added to the set of required matches for this clause.\n *\n */\n if (clause.presence == lunr.Query.presence.REQUIRED) {\n clauseMatches = clauseMatches.union(matchingDocumentsSet)\n\n if (requiredMatches[field] === undefined) {\n requiredMatches[field] = lunr.Set.complete\n }\n }\n\n /*\n * if the presence of this term is prohibited ensure that the matching\n * documents are added to the set of prohibited matches for this field,\n * creating that set if it does not yet exist.\n */\n if (clause.presence == lunr.Query.presence.PROHIBITED) {\n if (prohibitedMatches[field] === undefined) {\n prohibitedMatches[field] = lunr.Set.empty\n }\n\n prohibitedMatches[field] = prohibitedMatches[field].union(matchingDocumentsSet)\n\n /*\n * Prohibited matches should not be part of the query vector used for\n * similarity scoring and no metadata should be extracted so we continue\n * to the next field\n */\n continue\n }\n\n /*\n * The query field vector is populated using the termIndex found for\n * the term and a unit value with the appropriate boost applied.\n * Using upsert because there could already be an entry in the vector\n * for the term we are working with. In that case we just add the scores\n * together.\n */\n queryVectors[field].upsert(termIndex, clause.boost, function (a, b) { return a + b })\n\n /**\n * If we've already seen this term, field combo then we've already collected\n * the matching documents and metadata, no need to go through all that again\n */\n if (termFieldCache[termField]) {\n continue\n }\n\n for (var l = 0; l < matchingDocumentRefs.length; l++) {\n /*\n * All metadata for this term/field/document triple\n * are then extracted and collected into an instance\n * of lunr.MatchData ready to be returned in the query\n * results\n */\n var matchingDocumentRef = matchingDocumentRefs[l],\n matchingFieldRef = new lunr.FieldRef (matchingDocumentRef, field),\n metadata = fieldPosting[matchingDocumentRef],\n fieldMatch\n\n if ((fieldMatch = matchingFields[matchingFieldRef]) === undefined) {\n matchingFields[matchingFieldRef] = new lunr.MatchData (expandedTerm, field, metadata)\n } else {\n fieldMatch.add(expandedTerm, field, metadata)\n }\n\n }\n\n termFieldCache[termField] = true\n }\n }\n }\n\n /**\n * If the presence was required we need to update the requiredMatches field sets.\n * We do this after all fields for the term have collected their matches because\n * the clause terms presence is required in _any_ of the fields not _all_ of the\n * fields.\n */\n if (clause.presence === lunr.Query.presence.REQUIRED) {\n for (var k = 0; k < clause.fields.length; k++) {\n var field = clause.fields[k]\n requiredMatches[field] = requiredMatches[field].intersect(clauseMatches)\n }\n }\n }\n\n /**\n * Need to combine the field scoped required and prohibited\n * matching documents into a global set of required and prohibited\n * matches\n */\n var allRequiredMatches = lunr.Set.complete,\n allProhibitedMatches = lunr.Set.empty\n\n for (var i = 0; i < this.fields.length; i++) {\n var field = this.fields[i]\n\n if (requiredMatches[field]) {\n allRequiredMatches = allRequiredMatches.intersect(requiredMatches[field])\n }\n\n if (prohibitedMatches[field]) {\n allProhibitedMatches = allProhibitedMatches.union(prohibitedMatches[field])\n }\n }\n\n var matchingFieldRefs = Object.keys(matchingFields),\n results = [],\n matches = Object.create(null)\n\n /*\n * If the query is negated (contains only prohibited terms)\n * we need to get _all_ fieldRefs currently existing in the\n * index. This is only done when we know that the query is\n * entirely prohibited terms to avoid any cost of getting all\n * fieldRefs unnecessarily.\n *\n * Additionally, blank MatchData must be created to correctly\n * populate the results.\n */\n if (query.isNegated()) {\n matchingFieldRefs = Object.keys(this.fieldVectors)\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n var matchingFieldRef = matchingFieldRefs[i]\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRef)\n matchingFields[matchingFieldRef] = new lunr.MatchData\n }\n }\n\n for (var i = 0; i < matchingFieldRefs.length; i++) {\n /*\n * Currently we have document fields that match the query, but we\n * need to return documents. The matchData and scores are combined\n * from multiple fields belonging to the same document.\n *\n * Scores are calculated by field, using the query vectors created\n * above, and combined into a final document score using addition.\n */\n var fieldRef = lunr.FieldRef.fromString(matchingFieldRefs[i]),\n docRef = fieldRef.docRef\n\n if (!allRequiredMatches.contains(docRef)) {\n continue\n }\n\n if (allProhibitedMatches.contains(docRef)) {\n continue\n }\n\n var fieldVector = this.fieldVectors[fieldRef],\n score = queryVectors[fieldRef.fieldName].similarity(fieldVector),\n docMatch\n\n if ((docMatch = matches[docRef]) !== undefined) {\n docMatch.score += score\n docMatch.matchData.combine(matchingFields[fieldRef])\n } else {\n var match = {\n ref: docRef,\n score: score,\n matchData: matchingFields[fieldRef]\n }\n matches[docRef] = match\n results.push(match)\n }\n }\n\n /*\n * Sort the results objects by score, highest first.\n */\n return results.sort(function (a, b) {\n return b.score - a.score\n })\n}\n\n/**\n * Prepares the index for JSON serialization.\n *\n * The schema for this JSON blob will be described in a\n * separate JSON schema file.\n *\n * @returns {Object}\n */\nlunr.Index.prototype.toJSON = function () {\n var invertedIndex = Object.keys(this.invertedIndex)\n .sort()\n .map(function (term) {\n return [term, this.invertedIndex[term]]\n }, this)\n\n var fieldVectors = Object.keys(this.fieldVectors)\n .map(function (ref) {\n return [ref, this.fieldVectors[ref].toJSON()]\n }, this)\n\n return {\n version: lunr.version,\n fields: this.fields,\n fieldVectors: fieldVectors,\n invertedIndex: invertedIndex,\n pipeline: this.pipeline.toJSON()\n }\n}\n\n/**\n * Loads a previously serialized lunr.Index\n *\n * @param {Object} serializedIndex - A previously serialized lunr.Index\n * @returns {lunr.Index}\n */\nlunr.Index.load = function (serializedIndex) {\n var attrs = {},\n fieldVectors = {},\n serializedVectors = serializedIndex.fieldVectors,\n invertedIndex = Object.create(null),\n serializedInvertedIndex = serializedIndex.invertedIndex,\n tokenSetBuilder = new lunr.TokenSet.Builder,\n pipeline = lunr.Pipeline.load(serializedIndex.pipeline)\n\n if (serializedIndex.version != lunr.version) {\n lunr.utils.warn(\"Version mismatch when loading serialised index. Current version of lunr '\" + lunr.version + \"' does not match serialized index '\" + serializedIndex.version + \"'\")\n }\n\n for (var i = 0; i < serializedVectors.length; i++) {\n var tuple = serializedVectors[i],\n ref = tuple[0],\n elements = tuple[1]\n\n fieldVectors[ref] = new lunr.Vector(elements)\n }\n\n for (var i = 0; i < serializedInvertedIndex.length; i++) {\n var tuple = serializedInvertedIndex[i],\n term = tuple[0],\n posting = tuple[1]\n\n tokenSetBuilder.insert(term)\n invertedIndex[term] = posting\n }\n\n tokenSetBuilder.finish()\n\n attrs.fields = serializedIndex.fields\n\n attrs.fieldVectors = fieldVectors\n attrs.invertedIndex = invertedIndex\n attrs.tokenSet = tokenSetBuilder.root\n attrs.pipeline = pipeline\n\n return new lunr.Index(attrs)\n}\n/*!\n * lunr.Builder\n * Copyright (C) 2020 Oliver Nightingale\n */\n\n/**\n * lunr.Builder performs indexing on a set of documents and\n * returns instances of lunr.Index ready for querying.\n *\n * All configuration of the index is done via the builder, the\n * fields to index, the document reference, the text processing\n * pipeline and document scoring parameters are all set on the\n * builder before indexing.\n *\n * @constructor\n * @property {string} _ref - Internal reference to the document reference field.\n * @property {string[]} _fields - Internal reference to the document fields to index.\n * @property {object} invertedIndex - The inverted index maps terms to document fields.\n * @property {object} documentTermFrequencies - Keeps track of document term frequencies.\n * @property {object} documentLengths - Keeps track of the length of documents added to the index.\n * @property {lunr.tokenizer} tokenizer - Function for splitting strings into tokens for indexing.\n * @property {lunr.Pipeline} pipeline - The pipeline performs text processing on tokens before indexing.\n * @property {lunr.Pipeline} searchPipeline - A pipeline for processing search terms before querying the index.\n * @property {number} documentCount - Keeps track of the total number of documents indexed.\n * @property {number} _b - A parameter to control field length normalization, setting this to 0 disabled normalization, 1 fully normalizes field lengths, the default value is 0.75.\n * @property {number} _k1 - A parameter to control how quickly an increase in term frequency results in term frequency saturation, the default value is 1.2.\n * @property {number} termIndex - A counter incremented for each unique term, used to identify a terms position in the vector space.\n * @property {array} metadataWhitelist - A list of metadata keys that have been whitelisted for entry in the index.\n */\nlunr.Builder = function () {\n this._ref = \"id\"\n this._fields = Object.create(null)\n this._documents = Object.create(null)\n this.invertedIndex = Object.create(null)\n this.fieldTermFrequencies = {}\n this.fieldLengths = {}\n this.tokenizer = lunr.tokenizer\n this.pipeline = new lunr.Pipeline\n this.searchPipeline = new lunr.Pipeline\n this.documentCount = 0\n this._b = 0.75\n this._k1 = 1.2\n this.termIndex = 0\n this.metadataWhitelist = []\n}\n\n/**\n * Sets the document field used as the document reference. Every document must have this field.\n * The type of this field in the document should be a string, if it is not a string it will be\n * coerced into a string by calling toString.\n *\n * The default ref is 'id'.\n *\n * The ref should _not_ be changed during indexing, it should be set before any documents are\n * added to the index. Changing it during indexing can lead to inconsistent results.\n *\n * @param {string} ref - The name of the reference field in the document.\n */\nlunr.Builder.prototype.ref = function (ref) {\n this._ref = ref\n}\n\n/**\n * A function that is used to extract a field from a document.\n *\n * Lunr expects a field to be at the top level of a document, if however the field\n * is deeply nested within a document an extractor function can be used to extract\n * the right field for indexing.\n *\n * @callback fieldExtractor\n * @param {object} doc - The document being added to the index.\n * @returns {?(string|object|object[])} obj - The object that will be indexed for this field.\n * @example Extracting a nested field\n * function (doc) { return doc.nested.field }\n */\n\n/**\n * Adds a field to the list of document fields that will be indexed. Every document being\n * indexed should have this field. Null values for this field in indexed documents will\n * not cause errors but will limit the chance of that document being retrieved by searches.\n *\n * All fields should be added before adding documents to the index. Adding fields after\n * a document has been indexed will have no effect on already indexed documents.\n *\n * Fields can be boosted at build time. This allows terms within that field to have more\n * importance when ranking search results. Use a field boost to specify that matches within\n * one field are more important than other fields.\n *\n * @param {string} fieldName - The name of a field to index in all documents.\n * @param {object} attributes - Optional attributes associated with this field.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this field.\n * @param {fieldExtractor} [attributes.extractor] - Function to extract a field from a document.\n * @throws {RangeError} fieldName cannot contain unsupported characters '/'\n */\nlunr.Builder.prototype.field = function (fieldName, attributes) {\n if (/\\//.test(fieldName)) {\n throw new RangeError (\"Field '\" + fieldName + \"' contains illegal character '/'\")\n }\n\n this._fields[fieldName] = attributes || {}\n}\n\n/**\n * A parameter to tune the amount of field length normalisation that is applied when\n * calculating relevance scores. A value of 0 will completely disable any normalisation\n * and a value of 1 will fully normalise field lengths. The default is 0.75. Values of b\n * will be clamped to the range 0 - 1.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.b = function (number) {\n if (number < 0) {\n this._b = 0\n } else if (number > 1) {\n this._b = 1\n } else {\n this._b = number\n }\n}\n\n/**\n * A parameter that controls the speed at which a rise in term frequency results in term\n * frequency saturation. The default value is 1.2. Setting this to a higher value will give\n * slower saturation levels, a lower value will result in quicker saturation.\n *\n * @param {number} number - The value to set for this tuning parameter.\n */\nlunr.Builder.prototype.k1 = function (number) {\n this._k1 = number\n}\n\n/**\n * Adds a document to the index.\n *\n * Before adding fields to the index the index should have been fully setup, with the document\n * ref and all fields to index already having been specified.\n *\n * The document must have a field name as specified by the ref (by default this is 'id') and\n * it should have all fields defined for indexing, though null or undefined values will not\n * cause errors.\n *\n * Entire documents can be boosted at build time. Applying a boost to a document indicates that\n * this document should rank higher in search results than other documents.\n *\n * @param {object} doc - The document to add to the index.\n * @param {object} attributes - Optional attributes associated with this document.\n * @param {number} [attributes.boost=1] - Boost applied to all terms within this document.\n */\nlunr.Builder.prototype.add = function (doc, attributes) {\n var docRef = doc[this._ref],\n fields = Object.keys(this._fields)\n\n this._documents[docRef] = attributes || {}\n this.documentCount += 1\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i],\n extractor = this._fields[fieldName].extractor,\n field = extractor ? extractor(doc) : doc[fieldName],\n tokens = this.tokenizer(field, {\n fields: [fieldName]\n }),\n terms = this.pipeline.run(tokens),\n fieldRef = new lunr.FieldRef (docRef, fieldName),\n fieldTerms = Object.create(null)\n\n this.fieldTermFrequencies[fieldRef] = fieldTerms\n this.fieldLengths[fieldRef] = 0\n\n // store the length of this field for this document\n this.fieldLengths[fieldRef] += terms.length\n\n // calculate term frequencies for this field\n for (var j = 0; j < terms.length; j++) {\n var term = terms[j]\n\n if (fieldTerms[term] == undefined) {\n fieldTerms[term] = 0\n }\n\n fieldTerms[term] += 1\n\n // add to inverted index\n // create an initial posting if one doesn't exist\n if (this.invertedIndex[term] == undefined) {\n var posting = Object.create(null)\n posting[\"_index\"] = this.termIndex\n this.termIndex += 1\n\n for (var k = 0; k < fields.length; k++) {\n posting[fields[k]] = Object.create(null)\n }\n\n this.invertedIndex[term] = posting\n }\n\n // add an entry for this term/fieldName/docRef to the invertedIndex\n if (this.invertedIndex[term][fieldName][docRef] == undefined) {\n this.invertedIndex[term][fieldName][docRef] = Object.create(null)\n }\n\n // store all whitelisted metadata about this token in the\n // inverted index\n for (var l = 0; l < this.metadataWhitelist.length; l++) {\n var metadataKey = this.metadataWhitelist[l],\n metadata = term.metadata[metadataKey]\n\n if (this.invertedIndex[term][fieldName][docRef][metadataKey] == undefined) {\n this.invertedIndex[term][fieldName][docRef][metadataKey] = []\n }\n\n this.invertedIndex[term][fieldName][docRef][metadataKey].push(metadata)\n }\n }\n\n }\n}\n\n/**\n * Calculates the average document length for this index\n *\n * @private\n */\nlunr.Builder.prototype.calculateAverageFieldLengths = function () {\n\n var fieldRefs = Object.keys(this.fieldLengths),\n numberOfFields = fieldRefs.length,\n accumulator = {},\n documentsWithField = {}\n\n for (var i = 0; i < numberOfFields; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n field = fieldRef.fieldName\n\n documentsWithField[field] || (documentsWithField[field] = 0)\n documentsWithField[field] += 1\n\n accumulator[field] || (accumulator[field] = 0)\n accumulator[field] += this.fieldLengths[fieldRef]\n }\n\n var fields = Object.keys(this._fields)\n\n for (var i = 0; i < fields.length; i++) {\n var fieldName = fields[i]\n accumulator[fieldName] = accumulator[fieldName] / documentsWithField[fieldName]\n }\n\n this.averageFieldLength = accumulator\n}\n\n/**\n * Builds a vector space model of every document using lunr.Vector\n *\n * @private\n */\nlunr.Builder.prototype.createFieldVectors = function () {\n var fieldVectors = {},\n fieldRefs = Object.keys(this.fieldTermFrequencies),\n fieldRefsLength = fieldRefs.length,\n termIdfCache = Object.create(null)\n\n for (var i = 0; i < fieldRefsLength; i++) {\n var fieldRef = lunr.FieldRef.fromString(fieldRefs[i]),\n fieldName = fieldRef.fieldName,\n fieldLength = this.fieldLengths[fieldRef],\n fieldVector = new lunr.Vector,\n termFrequencies = this.fieldTermFrequencies[fieldRef],\n terms = Object.keys(termFrequencies),\n termsLength = terms.length\n\n\n var fieldBoost = this._fields[fieldName].boost || 1,\n docBoost = this._documents[fieldRef.docRef].boost || 1\n\n for (var j = 0; j < termsLength; j++) {\n var term = terms[j],\n tf = termFrequencies[term],\n termIndex = this.invertedIndex[term]._index,\n idf, score, scoreWithPrecision\n\n if (termIdfCache[term] === undefined) {\n idf = lunr.idf(this.invertedIndex[term], this.documentCount)\n termIdfCache[term] = idf\n } else {\n idf = termIdfCache[term]\n }\n\n score = idf * ((this._k1 + 1) * tf) / (this._k1 * (1 - this._b + this._b * (fieldLength / this.averageFieldLength[fieldName])) + tf)\n score *= fieldBoost\n score *= docBoost\n scoreWithPrecision = Math.round(score * 1000) / 1000\n // Converts 1.23456789 to 1.234.\n // Reducing the precision so that the vectors take up less\n // space when serialised. Doing it now so that they behave\n // the same before and after serialisation. Also, this is\n // the fastest approach to reducing a number's precision in\n // JavaScript.\n\n fieldVector.insert(termIndex, scoreWithPrecision)\n }\n\n fieldVectors[fieldRef] = fieldVector\n }\n\n this.fieldVectors = fieldVectors\n}\n\n/**\n * Creates a token set of all tokens in the index using lunr.TokenSet\n *\n * @private\n */\nlunr.Builder.prototype.createTokenSet = function () {\n this.tokenSet = lunr.TokenSet.fromArray(\n Object.keys(this.invertedIndex).sort()\n )\n}\n\n/**\n * Builds the index, creating an instance of lunr.Index.\n *\n * This completes the indexing process and should only be called\n * once all documents have been added to the index.\n *\n * @returns {lunr.Index}\n */\nlunr.Builder.prototype.build = function () {\n this.calculateAverageFieldLengths()\n this.createFieldVectors()\n this.createTokenSet()\n\n return new lunr.Index({\n invertedIndex: this.invertedIndex,\n fieldVectors: this.fieldVectors,\n tokenSet: this.tokenSet,\n fields: Object.keys(this._fields),\n pipeline: this.searchPipeline\n })\n}\n\n/**\n * Applies a plugin to the index builder.\n *\n * A plugin is a function that is called with the index builder as its context.\n * Plugins can be used to customise or extend the behaviour of the index\n * in some way. A plugin is just a function, that encapsulated the custom\n * behaviour that should be applied when building the index.\n *\n * The plugin function will be called with the index builder as its argument, additional\n * arguments can also be passed when calling use. The function will be called\n * with the index builder as its context.\n *\n * @param {Function} plugin The plugin to apply.\n */\nlunr.Builder.prototype.use = function (fn) {\n var args = Array.prototype.slice.call(arguments, 1)\n args.unshift(this)\n fn.apply(this, args)\n}\n/**\n * Contains and collects metadata about a matching document.\n * A single instance of lunr.MatchData is returned as part of every\n * lunr.Index~Result.\n *\n * @constructor\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n * @property {object} metadata - A cloned collection of metadata associated with this document.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData = function (term, field, metadata) {\n var clonedMetadata = Object.create(null),\n metadataKeys = Object.keys(metadata || {})\n\n // Cloning the metadata to prevent the original\n // being mutated during match data combination.\n // Metadata is kept in an array within the inverted\n // index so cloning the data can be done with\n // Array#slice\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n clonedMetadata[key] = metadata[key].slice()\n }\n\n this.metadata = Object.create(null)\n\n if (term !== undefined) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = clonedMetadata\n }\n}\n\n/**\n * An instance of lunr.MatchData will be created for every term that matches a\n * document. However only one instance is required in a lunr.Index~Result. This\n * method combines metadata from another instance of lunr.MatchData with this\n * objects metadata.\n *\n * @param {lunr.MatchData} otherMatchData - Another instance of match data to merge with this one.\n * @see {@link lunr.Index~Result}\n */\nlunr.MatchData.prototype.combine = function (otherMatchData) {\n var terms = Object.keys(otherMatchData.metadata)\n\n for (var i = 0; i < terms.length; i++) {\n var term = terms[i],\n fields = Object.keys(otherMatchData.metadata[term])\n\n if (this.metadata[term] == undefined) {\n this.metadata[term] = Object.create(null)\n }\n\n for (var j = 0; j < fields.length; j++) {\n var field = fields[j],\n keys = Object.keys(otherMatchData.metadata[term][field])\n\n if (this.metadata[term][field] == undefined) {\n this.metadata[term][field] = Object.create(null)\n }\n\n for (var k = 0; k < keys.length; k++) {\n var key = keys[k]\n\n if (this.metadata[term][field][key] == undefined) {\n this.metadata[term][field][key] = otherMatchData.metadata[term][field][key]\n } else {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(otherMatchData.metadata[term][field][key])\n }\n\n }\n }\n }\n}\n\n/**\n * Add metadata for a term/field pair to this instance of match data.\n *\n * @param {string} term - The term this match data is associated with\n * @param {string} field - The field in which the term was found\n * @param {object} metadata - The metadata recorded about this term in this field\n */\nlunr.MatchData.prototype.add = function (term, field, metadata) {\n if (!(term in this.metadata)) {\n this.metadata[term] = Object.create(null)\n this.metadata[term][field] = metadata\n return\n }\n\n if (!(field in this.metadata[term])) {\n this.metadata[term][field] = metadata\n return\n }\n\n var metadataKeys = Object.keys(metadata)\n\n for (var i = 0; i < metadataKeys.length; i++) {\n var key = metadataKeys[i]\n\n if (key in this.metadata[term][field]) {\n this.metadata[term][field][key] = this.metadata[term][field][key].concat(metadata[key])\n } else {\n this.metadata[term][field][key] = metadata[key]\n }\n }\n}\n/**\n * A lunr.Query provides a programmatic way of defining queries to be performed\n * against a {@link lunr.Index}.\n *\n * Prefer constructing a lunr.Query using the {@link lunr.Index#query} method\n * so the query object is pre-initialized with the right index fields.\n *\n * @constructor\n * @property {lunr.Query~Clause[]} clauses - An array of query clauses.\n * @property {string[]} allFields - An array of all available fields in a lunr.Index.\n */\nlunr.Query = function (allFields) {\n this.clauses = []\n this.allFields = allFields\n}\n\n/**\n * Constants for indicating what kind of automatic wildcard insertion will be used when constructing a query clause.\n *\n * This allows wildcards to be added to the beginning and end of a term without having to manually do any string\n * concatenation.\n *\n * The wildcard constants can be bitwise combined to select both leading and trailing wildcards.\n *\n * @constant\n * @default\n * @property {number} wildcard.NONE - The term will have no wildcards inserted, this is the default behaviour\n * @property {number} wildcard.LEADING - Prepend the term with a wildcard, unless a leading wildcard already exists\n * @property {number} wildcard.TRAILING - Append a wildcard to the term, unless a trailing wildcard already exists\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example query term with trailing wildcard\n * query.term('foo', { wildcard: lunr.Query.wildcard.TRAILING })\n * @example query term with leading and trailing wildcard\n * query.term('foo', {\n * wildcard: lunr.Query.wildcard.LEADING | lunr.Query.wildcard.TRAILING\n * })\n */\n\nlunr.Query.wildcard = new String (\"*\")\nlunr.Query.wildcard.NONE = 0\nlunr.Query.wildcard.LEADING = 1\nlunr.Query.wildcard.TRAILING = 2\n\n/**\n * Constants for indicating what kind of presence a term must have in matching documents.\n *\n * @constant\n * @enum {number}\n * @see lunr.Query~Clause\n * @see lunr.Query#clause\n * @see lunr.Query#term\n * @example query term with required presence\n * query.term('foo', { presence: lunr.Query.presence.REQUIRED })\n */\nlunr.Query.presence = {\n /**\n * Term's presence in a document is optional, this is the default value.\n */\n OPTIONAL: 1,\n\n /**\n * Term's presence in a document is required, documents that do not contain\n * this term will not be returned.\n */\n REQUIRED: 2,\n\n /**\n * Term's presence in a document is prohibited, documents that do contain\n * this term will not be returned.\n */\n PROHIBITED: 3\n}\n\n/**\n * A single clause in a {@link lunr.Query} contains a term and details on how to\n * match that term against a {@link lunr.Index}.\n *\n * @typedef {Object} lunr.Query~Clause\n * @property {string[]} fields - The fields in an index this clause should be matched against.\n * @property {number} [boost=1] - Any boost that should be applied when matching this clause.\n * @property {number} [editDistance] - Whether the term should have fuzzy matching applied, and how fuzzy the match should be.\n * @property {boolean} [usePipeline] - Whether the term should be passed through the search pipeline.\n * @property {number} [wildcard=lunr.Query.wildcard.NONE] - Whether the term should have wildcards appended or prepended.\n * @property {number} [presence=lunr.Query.presence.OPTIONAL] - The terms presence in any matching documents.\n */\n\n/**\n * Adds a {@link lunr.Query~Clause} to this query.\n *\n * Unless the clause contains the fields to be matched all fields will be matched. In addition\n * a default boost of 1 is applied to the clause.\n *\n * @param {lunr.Query~Clause} clause - The clause to add to this query.\n * @see lunr.Query~Clause\n * @returns {lunr.Query}\n */\nlunr.Query.prototype.clause = function (clause) {\n if (!('fields' in clause)) {\n clause.fields = this.allFields\n }\n\n if (!('boost' in clause)) {\n clause.boost = 1\n }\n\n if (!('usePipeline' in clause)) {\n clause.usePipeline = true\n }\n\n if (!('wildcard' in clause)) {\n clause.wildcard = lunr.Query.wildcard.NONE\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.LEADING) && (clause.term.charAt(0) != lunr.Query.wildcard)) {\n clause.term = \"*\" + clause.term\n }\n\n if ((clause.wildcard & lunr.Query.wildcard.TRAILING) && (clause.term.slice(-1) != lunr.Query.wildcard)) {\n clause.term = \"\" + clause.term + \"*\"\n }\n\n if (!('presence' in clause)) {\n clause.presence = lunr.Query.presence.OPTIONAL\n }\n\n this.clauses.push(clause)\n\n return this\n}\n\n/**\n * A negated query is one in which every clause has a presence of\n * prohibited. These queries require some special processing to return\n * the expected results.\n *\n * @returns boolean\n */\nlunr.Query.prototype.isNegated = function () {\n for (var i = 0; i < this.clauses.length; i++) {\n if (this.clauses[i].presence != lunr.Query.presence.PROHIBITED) {\n return false\n }\n }\n\n return true\n}\n\n/**\n * Adds a term to the current query, under the covers this will create a {@link lunr.Query~Clause}\n * to the list of clauses that make up this query.\n *\n * The term is used as is, i.e. no tokenization will be performed by this method. Instead conversion\n * to a token or token-like string should be done before calling this method.\n *\n * The term will be converted to a string by calling `toString`. Multiple terms can be passed as an\n * array, each term in the array will share the same options.\n *\n * @param {object|object[]} term - The term(s) to add to the query.\n * @param {object} [options] - Any additional properties to add to the query clause.\n * @returns {lunr.Query}\n * @see lunr.Query#clause\n * @see lunr.Query~Clause\n * @example adding a single term to a query\n * query.term(\"foo\")\n * @example adding a single term to a query and specifying search fields, term boost and automatic trailing wildcard\n * query.term(\"foo\", {\n * fields: [\"title\"],\n * boost: 10,\n * wildcard: lunr.Query.wildcard.TRAILING\n * })\n * @example using lunr.tokenizer to convert a string to tokens before using them as terms\n * query.term(lunr.tokenizer(\"foo bar\"))\n */\nlunr.Query.prototype.term = function (term, options) {\n if (Array.isArray(term)) {\n term.forEach(function (t) { this.term(t, lunr.utils.clone(options)) }, this)\n return this\n }\n\n var clause = options || {}\n clause.term = term.toString()\n\n this.clause(clause)\n\n return this\n}\nlunr.QueryParseError = function (message, start, end) {\n this.name = \"QueryParseError\"\n this.message = message\n this.start = start\n this.end = end\n}\n\nlunr.QueryParseError.prototype = new Error\nlunr.QueryLexer = function (str) {\n this.lexemes = []\n this.str = str\n this.length = str.length\n this.pos = 0\n this.start = 0\n this.escapeCharPositions = []\n}\n\nlunr.QueryLexer.prototype.run = function () {\n var state = lunr.QueryLexer.lexText\n\n while (state) {\n state = state(this)\n }\n}\n\nlunr.QueryLexer.prototype.sliceString = function () {\n var subSlices = [],\n sliceStart = this.start,\n sliceEnd = this.pos\n\n for (var i = 0; i < this.escapeCharPositions.length; i++) {\n sliceEnd = this.escapeCharPositions[i]\n subSlices.push(this.str.slice(sliceStart, sliceEnd))\n sliceStart = sliceEnd + 1\n }\n\n subSlices.push(this.str.slice(sliceStart, this.pos))\n this.escapeCharPositions.length = 0\n\n return subSlices.join('')\n}\n\nlunr.QueryLexer.prototype.emit = function (type) {\n this.lexemes.push({\n type: type,\n str: this.sliceString(),\n start: this.start,\n end: this.pos\n })\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.escapeCharacter = function () {\n this.escapeCharPositions.push(this.pos - 1)\n this.pos += 1\n}\n\nlunr.QueryLexer.prototype.next = function () {\n if (this.pos >= this.length) {\n return lunr.QueryLexer.EOS\n }\n\n var char = this.str.charAt(this.pos)\n this.pos += 1\n return char\n}\n\nlunr.QueryLexer.prototype.width = function () {\n return this.pos - this.start\n}\n\nlunr.QueryLexer.prototype.ignore = function () {\n if (this.start == this.pos) {\n this.pos += 1\n }\n\n this.start = this.pos\n}\n\nlunr.QueryLexer.prototype.backup = function () {\n this.pos -= 1\n}\n\nlunr.QueryLexer.prototype.acceptDigitRun = function () {\n var char, charCode\n\n do {\n char = this.next()\n charCode = char.charCodeAt(0)\n } while (charCode > 47 && charCode < 58)\n\n if (char != lunr.QueryLexer.EOS) {\n this.backup()\n }\n}\n\nlunr.QueryLexer.prototype.more = function () {\n return this.pos < this.length\n}\n\nlunr.QueryLexer.EOS = 'EOS'\nlunr.QueryLexer.FIELD = 'FIELD'\nlunr.QueryLexer.TERM = 'TERM'\nlunr.QueryLexer.EDIT_DISTANCE = 'EDIT_DISTANCE'\nlunr.QueryLexer.BOOST = 'BOOST'\nlunr.QueryLexer.PRESENCE = 'PRESENCE'\n\nlunr.QueryLexer.lexField = function (lexer) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.FIELD)\n lexer.ignore()\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexTerm = function (lexer) {\n if (lexer.width() > 1) {\n lexer.backup()\n lexer.emit(lunr.QueryLexer.TERM)\n }\n\n lexer.ignore()\n\n if (lexer.more()) {\n return lunr.QueryLexer.lexText\n }\n}\n\nlunr.QueryLexer.lexEditDistance = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.EDIT_DISTANCE)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexBoost = function (lexer) {\n lexer.ignore()\n lexer.acceptDigitRun()\n lexer.emit(lunr.QueryLexer.BOOST)\n return lunr.QueryLexer.lexText\n}\n\nlunr.QueryLexer.lexEOS = function (lexer) {\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n}\n\n// This matches the separator used when tokenising fields\n// within a document. These should match otherwise it is\n// not possible to search for some tokens within a document.\n//\n// It is possible for the user to change the separator on the\n// tokenizer so it _might_ clash with any other of the special\n// characters already used within the search string, e.g. :.\n//\n// This means that it is possible to change the separator in\n// such a way that makes some words unsearchable using a search\n// string.\nlunr.QueryLexer.termSeparator = lunr.tokenizer.separator\n\nlunr.QueryLexer.lexText = function (lexer) {\n while (true) {\n var char = lexer.next()\n\n if (char == lunr.QueryLexer.EOS) {\n return lunr.QueryLexer.lexEOS\n }\n\n // Escape character is '\\'\n if (char.charCodeAt(0) == 92) {\n lexer.escapeCharacter()\n continue\n }\n\n if (char == \":\") {\n return lunr.QueryLexer.lexField\n }\n\n if (char == \"~\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexEditDistance\n }\n\n if (char == \"^\") {\n lexer.backup()\n if (lexer.width() > 0) {\n lexer.emit(lunr.QueryLexer.TERM)\n }\n return lunr.QueryLexer.lexBoost\n }\n\n // \"+\" indicates term presence is required\n // checking for length to ensure that only\n // leading \"+\" are considered\n if (char == \"+\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n // \"-\" indicates term presence is prohibited\n // checking for length to ensure that only\n // leading \"-\" are considered\n if (char == \"-\" && lexer.width() === 1) {\n lexer.emit(lunr.QueryLexer.PRESENCE)\n return lunr.QueryLexer.lexText\n }\n\n if (char.match(lunr.QueryLexer.termSeparator)) {\n return lunr.QueryLexer.lexTerm\n }\n }\n}\n\nlunr.QueryParser = function (str, query) {\n this.lexer = new lunr.QueryLexer (str)\n this.query = query\n this.currentClause = {}\n this.lexemeIdx = 0\n}\n\nlunr.QueryParser.prototype.parse = function () {\n this.lexer.run()\n this.lexemes = this.lexer.lexemes\n\n var state = lunr.QueryParser.parseClause\n\n while (state) {\n state = state(this)\n }\n\n return this.query\n}\n\nlunr.QueryParser.prototype.peekLexeme = function () {\n return this.lexemes[this.lexemeIdx]\n}\n\nlunr.QueryParser.prototype.consumeLexeme = function () {\n var lexeme = this.peekLexeme()\n this.lexemeIdx += 1\n return lexeme\n}\n\nlunr.QueryParser.prototype.nextClause = function () {\n var completedClause = this.currentClause\n this.query.clause(completedClause)\n this.currentClause = {}\n}\n\nlunr.QueryParser.parseClause = function (parser) {\n var lexeme = parser.peekLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.type) {\n case lunr.QueryLexer.PRESENCE:\n return lunr.QueryParser.parsePresence\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expected either a field or a term, found \" + lexeme.type\n\n if (lexeme.str.length >= 1) {\n errorMessage += \" with value '\" + lexeme.str + \"'\"\n }\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n}\n\nlunr.QueryParser.parsePresence = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n switch (lexeme.str) {\n case \"-\":\n parser.currentClause.presence = lunr.Query.presence.PROHIBITED\n break\n case \"+\":\n parser.currentClause.presence = lunr.Query.presence.REQUIRED\n break\n default:\n var errorMessage = \"unrecognised presence operator'\" + lexeme.str + \"'\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term or field, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.FIELD:\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expecting term or field, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseField = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n if (parser.query.allFields.indexOf(lexeme.str) == -1) {\n var possibleFields = parser.query.allFields.map(function (f) { return \"'\" + f + \"'\" }).join(', '),\n errorMessage = \"unrecognised field '\" + lexeme.str + \"', possible fields: \" + possibleFields\n\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.fields = [lexeme.str]\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n var errorMessage = \"expecting term, found nothing\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n return lunr.QueryParser.parseTerm\n default:\n var errorMessage = \"expecting term, found '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseTerm = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n parser.currentClause.term = lexeme.str.toLowerCase()\n\n if (lexeme.str.indexOf(\"*\") != -1) {\n parser.currentClause.usePipeline = false\n }\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseEditDistance = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var editDistance = parseInt(lexeme.str, 10)\n\n if (isNaN(editDistance)) {\n var errorMessage = \"edit distance must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.editDistance = editDistance\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\nlunr.QueryParser.parseBoost = function (parser) {\n var lexeme = parser.consumeLexeme()\n\n if (lexeme == undefined) {\n return\n }\n\n var boost = parseInt(lexeme.str, 10)\n\n if (isNaN(boost)) {\n var errorMessage = \"boost must be numeric\"\n throw new lunr.QueryParseError (errorMessage, lexeme.start, lexeme.end)\n }\n\n parser.currentClause.boost = boost\n\n var nextLexeme = parser.peekLexeme()\n\n if (nextLexeme == undefined) {\n parser.nextClause()\n return\n }\n\n switch (nextLexeme.type) {\n case lunr.QueryLexer.TERM:\n parser.nextClause()\n return lunr.QueryParser.parseTerm\n case lunr.QueryLexer.FIELD:\n parser.nextClause()\n return lunr.QueryParser.parseField\n case lunr.QueryLexer.EDIT_DISTANCE:\n return lunr.QueryParser.parseEditDistance\n case lunr.QueryLexer.BOOST:\n return lunr.QueryParser.parseBoost\n case lunr.QueryLexer.PRESENCE:\n parser.nextClause()\n return lunr.QueryParser.parsePresence\n default:\n var errorMessage = \"Unexpected lexeme type '\" + nextLexeme.type + \"'\"\n throw new lunr.QueryParseError (errorMessage, nextLexeme.start, nextLexeme.end)\n }\n}\n\n /**\n * export the module via AMD, CommonJS or as a browser global\n * Export code from https://github.com/umdjs/umd/blob/master/returnExports.js\n */\n ;(function (root, factory) {\n if (typeof define === 'function' && define.amd) {\n // AMD. Register as an anonymous module.\n define(factory)\n } else if (typeof exports === 'object') {\n /**\n * Node. Does not work with strict CommonJS, but\n * only CommonJS-like enviroments that support module.exports,\n * like Node.\n */\n module.exports = factory()\n } else {\n // Browser globals (root is window)\n root.lunr = factory()\n }\n }(this, function () {\n /**\n * Just return a value to define the module export.\n * This example returns an object, but the module\n * can return a function as the exported value.\n */\n return lunr\n }))\n})();\n", "/*!\n * escape-html\n * Copyright(c) 2012-2013 TJ Holowaychuk\n * Copyright(c) 2015 Andreas Lubbe\n * Copyright(c) 2015 Tiancheng \"Timothy\" Gu\n * MIT Licensed\n */\n\n'use strict';\n\n/**\n * Module variables.\n * @private\n */\n\nvar matchHtmlRegExp = /[\"'&<>]/;\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = escapeHtml;\n\n/**\n * Escape special characters in the given string of html.\n *\n * @param {string} string The string to escape for inserting into HTML\n * @return {string}\n * @public\n */\n\nfunction escapeHtml(string) {\n var str = '' + string;\n var match = matchHtmlRegExp.exec(str);\n\n if (!match) {\n return str;\n }\n\n var escape;\n var html = '';\n var index = 0;\n var lastIndex = 0;\n\n for (index = match.index; index < str.length; index++) {\n switch (str.charCodeAt(index)) {\n case 34: // \"\n escape = '"';\n break;\n case 38: // &\n escape = '&';\n break;\n case 39: // '\n escape = ''';\n break;\n case 60: // <\n escape = '<';\n break;\n case 62: // >\n escape = '>';\n break;\n default:\n continue;\n }\n\n if (lastIndex !== index) {\n html += str.substring(lastIndex, index);\n }\n\n lastIndex = index + 1;\n html += escape;\n }\n\n return lastIndex !== index\n ? html + str.substring(lastIndex, index)\n : html;\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A RTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport lunr from \"lunr\"\n\nimport \"~/polyfills\"\n\nimport { Search, SearchIndexConfig } from \"../../_\"\nimport {\n SearchMessage,\n SearchMessageType\n} from \"../message\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Add support for usage with `iframe-worker` polyfill\n *\n * While `importScripts` is synchronous when executed inside of a web worker,\n * it's not possible to provide a synchronous polyfilled implementation. The\n * cool thing is that awaiting a non-Promise is a noop, so extending the type\n * definition to return a `Promise` shouldn't break anything.\n *\n * @see https://bit.ly/2PjDnXi - GitHub comment\n */\ndeclare global {\n function importScripts(...urls: string[]): Promise | void\n}\n\n/* ----------------------------------------------------------------------------\n * Data\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index\n */\nlet index: Search\n\n/* ----------------------------------------------------------------------------\n * Helper functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Fetch (= import) multi-language support through `lunr-languages`\n *\n * This function automatically imports the stemmers necessary to process the\n * languages, which are defined through the search index configuration.\n *\n * If the worker runs inside of an `iframe` (when using `iframe-worker` as\n * a shim), the base URL for the stemmers to be loaded must be determined by\n * searching for the first `script` element with a `src` attribute, which will\n * contain the contents of this script.\n *\n * @param config - Search index configuration\n *\n * @returns Promise resolving with no result\n */\nasync function setupSearchLanguages(\n config: SearchIndexConfig\n): Promise {\n let base = \"../lunr\"\n\n /* Detect `iframe-worker` and fix base URL */\n if (typeof parent !== \"undefined\" && \"IFrameWorker\" in parent) {\n const worker = document.querySelector(\"script[src]\")!\n const [path] = worker.src.split(\"/worker\")\n\n /* Prefix base with path */\n base = base.replace(\"..\", path)\n }\n\n /* Add scripts for languages */\n const scripts = []\n for (const lang of config.lang) {\n switch (lang) {\n\n /* Add segmenter for Japanese */\n case \"ja\":\n scripts.push(`${base}/tinyseg.js`)\n break\n\n /* Add segmenter for Hindi and Thai */\n case \"hi\":\n case \"th\":\n scripts.push(`${base}/wordcut.js`)\n break\n }\n\n /* Add language support */\n if (lang !== \"en\")\n scripts.push(`${base}/min/lunr.${lang}.min.js`)\n }\n\n /* Add multi-language support */\n if (config.lang.length > 1)\n scripts.push(`${base}/min/lunr.multi.min.js`)\n\n /* Load scripts synchronously */\n if (scripts.length)\n await importScripts(\n `${base}/min/lunr.stemmer.support.min.js`,\n ...scripts\n )\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Message handler\n *\n * @param message - Source message\n *\n * @returns Target message\n */\nexport async function handler(\n message: SearchMessage\n): Promise {\n switch (message.type) {\n\n /* Search setup message */\n case SearchMessageType.SETUP:\n await setupSearchLanguages(message.data.config)\n index = new Search(message.data)\n return {\n type: SearchMessageType.READY\n }\n\n /* Search query message */\n case SearchMessageType.QUERY:\n return {\n type: SearchMessageType.RESULT,\n data: index ? index.search(message.data) : { items: [] }\n }\n\n /* All other messages */\n default:\n throw new TypeError(\"Invalid message type\")\n }\n}\n\n/* ----------------------------------------------------------------------------\n * Worker\n * ------------------------------------------------------------------------- */\n\n/* @ts-expect-error - expose Lunr.js in global scope, or stemmers won't work */\nself.lunr = lunr\n\n/* Handle messages */\naddEventListener(\"message\", async ev => {\n postMessage(await handler(ev.data))\n})\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Polyfills\n * ------------------------------------------------------------------------- */\n\n/* Polyfill `Object.entries` */\nif (!Object.entries)\n Object.entries = function (obj: object) {\n const data: [string, string][] = []\n for (const key of Object.keys(obj))\n // @ts-expect-error - ignore property access warning\n data.push([key, obj[key]])\n\n /* Return entries */\n return data\n }\n\n/* Polyfill `Object.values` */\nif (!Object.values)\n Object.values = function (obj: object) {\n const data: string[] = []\n for (const key of Object.keys(obj))\n // @ts-expect-error - ignore property access warning\n data.push(obj[key])\n\n /* Return values */\n return data\n }\n\n/* ------------------------------------------------------------------------- */\n\n/* Polyfills for `Element` */\nif (typeof Element !== \"undefined\") {\n\n /* Polyfill `Element.scrollTo` */\n if (!Element.prototype.scrollTo)\n Element.prototype.scrollTo = function (\n x?: ScrollToOptions | number, y?: number\n ): void {\n if (typeof x === \"object\") {\n this.scrollLeft = x.left!\n this.scrollTop = x.top!\n } else {\n this.scrollLeft = x!\n this.scrollTop = y!\n }\n }\n\n /* Polyfill `Element.replaceWith` */\n if (!Element.prototype.replaceWith)\n Element.prototype.replaceWith = function (\n ...nodes: Array\n ): void {\n const parent = this.parentNode\n if (parent) {\n if (nodes.length === 0)\n parent.removeChild(this)\n\n /* Replace children and create text nodes */\n for (let i = nodes.length - 1; i >= 0; i--) {\n let node = nodes[i]\n if (typeof node !== \"object\")\n node = document.createTextNode(node)\n else if (node.parentNode)\n node.parentNode.removeChild(node)\n\n /* Replace child or insert before previous sibling */\n if (!i)\n parent.replaceChild(node, this)\n else\n parent.insertBefore(this.previousSibling!, node)\n }\n }\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport escapeHTML from \"escape-html\"\n\nimport { SearchIndexDocument } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search document\n */\nexport interface SearchDocument extends SearchIndexDocument {\n parent?: SearchIndexDocument /* Parent article */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search document mapping\n */\nexport type SearchDocumentMap = Map\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search document mapping\n *\n * @param docs - Search index documents\n *\n * @returns Search document map\n */\nexport function setupSearchDocumentMap(\n docs: SearchIndexDocument[]\n): SearchDocumentMap {\n const documents = new Map()\n const parents = new Set()\n for (const doc of docs) {\n const [path, hash] = doc.location.split(\"#\")\n\n /* Extract location and title */\n const location = doc.location\n const title = doc.title\n\n /* Escape and cleanup text */\n const text = escapeHTML(doc.text)\n .replace(/\\s+(?=[,.:;!?])/g, \"\")\n .replace(/\\s+/g, \" \")\n\n /* Handle section */\n if (hash) {\n const parent = documents.get(path)!\n\n /* Ignore first section, override article */\n if (!parents.has(parent)) {\n parent.title = doc.title\n parent.text = text\n\n /* Remember that we processed the article */\n parents.add(parent)\n\n /* Add subsequent section */\n } else {\n documents.set(location, {\n location,\n title,\n text,\n parent\n })\n }\n\n /* Add article */\n } else {\n documents.set(location, {\n location,\n title,\n text\n })\n }\n }\n return documents\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport escapeHTML from \"escape-html\"\n\nimport { SearchIndexConfig } from \"../_\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search highlight function\n *\n * @param value - Value\n *\n * @returns Highlighted value\n */\nexport type SearchHighlightFn = (value: string) => string\n\n/**\n * Search highlight factory function\n *\n * @param query - Query value\n *\n * @returns Search highlight function\n */\nexport type SearchHighlightFactoryFn = (query: string) => SearchHighlightFn\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Create a search highlighter\n *\n * @param config - Search index configuration\n * @param escape - Whether to escape HTML\n *\n * @returns Search highlight factory function\n */\nexport function setupSearchHighlighter(\n config: SearchIndexConfig, escape: boolean\n): SearchHighlightFactoryFn {\n const separator = new RegExp(config.separator, \"img\")\n const highlight = (_: unknown, data: string, term: string) => {\n return `${data}${term}`\n }\n\n /* Return factory function */\n return (query: string) => {\n query = query\n .replace(/[\\s*+\\-:~^]+/g, \" \")\n .trim()\n\n /* Create search term match expression */\n const match = new RegExp(`(^|${config.separator})(${\n query\n .replace(/[|\\\\{}()[\\]^$+*?.-]/g, \"\\\\$&\")\n .replace(separator, \"|\")\n })`, \"img\")\n\n /* Highlight string value */\n return value => (\n escape\n ? escapeHTML(value)\n : value\n )\n .replace(match, highlight)\n .replace(/<\\/mark>(\\s+)]*>/img, \"$1\")\n }\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search query clause\n */\nexport interface SearchQueryClause {\n presence: lunr.Query.presence /* Clause presence */\n term: string /* Clause term */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search query terms\n */\nexport type SearchQueryTerms = Record\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Parse a search query for analysis\n *\n * @param value - Query value\n *\n * @returns Search query clauses\n */\nexport function parseSearchQuery(\n value: string\n): SearchQueryClause[] {\n const query = new (lunr as any).Query([\"title\", \"text\"])\n const parser = new (lunr as any).QueryParser(value, query)\n\n /* Parse and return query clauses */\n parser.parse()\n return query.clauses\n}\n\n/**\n * Analyze the search query clauses in regard to the search terms found\n *\n * @param query - Search query clauses\n * @param terms - Search terms\n *\n * @returns Search query terms\n */\nexport function getSearchQueryTerms(\n query: SearchQueryClause[], terms: string[]\n): SearchQueryTerms {\n const clauses = new Set(query)\n\n /* Match query clauses against terms */\n const result: SearchQueryTerms = {}\n for (let t = 0; t < terms.length; t++)\n for (const clause of clauses)\n if (terms[t].startsWith(clause.term)) {\n result[clause.term] = true\n clauses.delete(clause)\n }\n\n /* Annotate unmatched non-stopword query clauses */\n for (const clause of clauses)\n if (lunr.stopWordFilter?.(clause.term as any))\n result[clause.term] = false\n\n /* Return query terms */\n return result\n}\n", "/*\n * Copyright (c) 2016-2022 Martin Donath \n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to\n * deal in the Software without restriction, including without limitation the\n * rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n * sell copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING\n * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS\n * IN THE SOFTWARE.\n */\n\nimport {\n SearchDocument,\n SearchDocumentMap,\n setupSearchDocumentMap\n} from \"../document\"\nimport {\n SearchHighlightFactoryFn,\n setupSearchHighlighter\n} from \"../highlighter\"\nimport { SearchOptions } from \"../options\"\nimport {\n SearchQueryTerms,\n getSearchQueryTerms,\n parseSearchQuery\n} from \"../query\"\n\n/* ----------------------------------------------------------------------------\n * Types\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index configuration\n */\nexport interface SearchIndexConfig {\n lang: string[] /* Search languages */\n separator: string /* Search separator */\n}\n\n/**\n * Search index document\n */\nexport interface SearchIndexDocument {\n location: string /* Document location */\n title: string /* Document title */\n text: string /* Document text */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search index\n *\n * This interfaces describes the format of the `search_index.json` file which\n * is automatically built by the MkDocs search plugin.\n */\nexport interface SearchIndex {\n config: SearchIndexConfig /* Search index configuration */\n docs: SearchIndexDocument[] /* Search index documents */\n options: SearchOptions /* Search options */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search metadata\n */\nexport interface SearchMetadata {\n score: number /* Score (relevance) */\n terms: SearchQueryTerms /* Search query terms */\n}\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search result document\n */\nexport type SearchResultDocument = SearchDocument & SearchMetadata\n\n/**\n * Search result item\n */\nexport type SearchResultItem = SearchResultDocument[]\n\n/* ------------------------------------------------------------------------- */\n\n/**\n * Search result\n */\nexport interface SearchResult {\n items: SearchResultItem[] /* Search result items */\n suggestions?: string[] /* Search suggestions */\n}\n\n/* ----------------------------------------------------------------------------\n * Functions\n * ------------------------------------------------------------------------- */\n\n/**\n * Compute the difference of two lists of strings\n *\n * @param a - 1st list of strings\n * @param b - 2nd list of strings\n *\n * @returns Difference\n */\nfunction difference(a: string[], b: string[]): string[] {\n const [x, y] = [new Set(a), new Set(b)]\n return [\n ...new Set([...x].filter(value => !y.has(value)))\n ]\n}\n\n/* ----------------------------------------------------------------------------\n * Class\n * ------------------------------------------------------------------------- */\n\n/**\n * Search index\n */\nexport class Search {\n\n /**\n * Search document mapping\n *\n * A mapping of URLs (including hash fragments) to the actual articles and\n * sections of the documentation. The search document mapping must be created\n * regardless of whether the index was prebuilt or not, as Lunr.js itself\n * only stores the actual index.\n */\n protected documents: SearchDocumentMap\n\n /**\n * Search highlight factory function\n */\n protected highlight: SearchHighlightFactoryFn\n\n /**\n * The underlying Lunr.js search index\n */\n protected index: lunr.Index\n\n /**\n * Search options\n */\n protected options: SearchOptions\n\n /**\n * Create the search integration\n *\n * @param data - Search index\n */\n public constructor({ config, docs, options }: SearchIndex) {\n this.options = options\n\n /* Set up document map and highlighter factory */\n this.documents = setupSearchDocumentMap(docs)\n this.highlight = setupSearchHighlighter(config, false)\n\n /* Set separator for tokenizer */\n lunr.tokenizer.separator = new RegExp(config.separator)\n\n /* Create search index */\n this.index = lunr(function () {\n\n /* Set up multi-language support */\n if (config.lang.length === 1 && config.lang[0] !== \"en\") {\n this.use((lunr as any)[config.lang[0]])\n } else if (config.lang.length > 1) {\n this.use((lunr as any).multiLanguage(...config.lang))\n }\n\n /* Compute functions to be removed from the pipeline */\n const fns = difference([\n \"trimmer\", \"stopWordFilter\", \"stemmer\"\n ], options.pipeline)\n\n /* Remove functions from the pipeline for registered languages */\n for (const lang of config.lang.map(language => (\n language === \"en\" ? lunr : (lunr as any)[language]\n ))) {\n for (const fn of fns) {\n this.pipeline.remove(lang[fn])\n this.searchPipeline.remove(lang[fn])\n }\n }\n\n /* Set up reference */\n this.ref(\"location\")\n\n /* Set up fields */\n this.field(\"title\", { boost: 1e3 })\n this.field(\"text\")\n\n /* Index documents */\n for (const doc of docs)\n this.add(doc)\n })\n }\n\n /**\n * Search for matching documents\n *\n * The search index which MkDocs provides is divided up into articles, which\n * contain the whole content of the individual pages, and sections, which only\n * contain the contents of the subsections obtained by breaking the individual\n * pages up at `h1` ... `h6`. As there may be many sections on different pages\n * with identical titles (for example within this very project, e.g. \"Usage\"\n * or \"Installation\"), they need to be put into the context of the containing\n * page. For this reason, section results are grouped within their respective\n * articles which are the top-level results that are returned.\n *\n * @param query - Query value\n *\n * @returns Search results\n */\n public search(query: string): SearchResult {\n if (query) {\n try {\n const highlight = this.highlight(query)\n\n /* Parse query to extract clauses for analysis */\n const clauses = parseSearchQuery(query)\n .filter(clause => (\n clause.presence !== lunr.Query.presence.PROHIBITED\n ))\n\n /* Perform search and post-process results */\n const groups = this.index.search(`${query}*`)\n\n /* Apply post-query boosts based on title and search query terms */\n .reduce((item, { ref, score, matchData }) => {\n const document = this.documents.get(ref)\n if (typeof document !== \"undefined\") {\n const { location, title, text, parent } = document\n\n /* Compute and analyze search query terms */\n const terms = getSearchQueryTerms(\n clauses,\n Object.keys(matchData.metadata)\n )\n\n /* Highlight title and text and apply post-query boosts */\n const boost = +!parent + +Object.values(terms).every(t => t)\n item.push({\n location,\n title: highlight(title),\n text: highlight(text),\n score: score * (1 + boost),\n terms\n })\n }\n return item\n }, [])\n\n /* Sort search results again after applying boosts */\n .sort((a, b) => b.score - a.score)\n\n /* Group search results by page */\n .reduce((items, result) => {\n const document = this.documents.get(result.location)\n if (typeof document !== \"undefined\") {\n const ref = \"parent\" in document\n ? document.parent!.location\n : document.location\n items.set(ref, [...items.get(ref) || [], result])\n }\n return items\n }, new Map())\n\n /* Generate search suggestions, if desired */\n let suggestions: string[] | undefined\n if (this.options.suggestions) {\n const titles = this.index.query(builder => {\n for (const clause of clauses)\n builder.term(clause.term, {\n fields: [\"title\"],\n presence: lunr.Query.presence.REQUIRED,\n wildcard: lunr.Query.wildcard.TRAILING\n })\n })\n\n /* Retrieve suggestions for best match */\n suggestions = titles.length\n ? Object.keys(titles[0].matchData.metadata)\n : []\n }\n\n /* Return items and suggestions */\n return {\n items: [...groups.values()],\n ...typeof suggestions !== \"undefined\" && { suggestions }\n }\n\n /* Log errors to console (for now) */\n } catch {\n console.warn(`Invalid query: ${query} \u2013 see https://bit.ly/2s3ChXG`)\n }\n }\n\n /* Return nothing in case of error or empty query */\n return { items: [] }\n }\n}\n"], + "mappings": "kkCAAA;AAAA;AAAA;AAAA;AAAA,GAMC,AAAC,WAAU,CAiCZ,GAAI,GAAO,SAAU,EAAQ,CAC3B,GAAI,GAAU,GAAI,GAAK,QAEvB,SAAQ,SAAS,IACf,EAAK,QACL,EAAK,eACL,EAAK,SAGP,EAAQ,eAAe,IACrB,EAAK,SAGP,EAAO,KAAK,EAAS,GACd,EAAQ,SAGjB,EAAK,QAAU,QACf;AAAA;AAAA;AAAA,GASA,EAAK,MAAQ,GASb,EAAK,MAAM,KAAQ,SAAU,EAAQ,CAEnC,MAAO,UAAU,EAAS,CACxB,AAAI,EAAO,SAAW,QAAQ,MAC5B,QAAQ,KAAK,KAIhB,MAaH,EAAK,MAAM,SAAW,SAAU,EAAK,CACnC,MAAI,AAAkB,IAAQ,KACrB,GAEA,EAAI,YAoBf,EAAK,MAAM,MAAQ,SAAU,EAAK,CAChC,GAAI,GAAQ,KACV,MAAO,GAMT,OAHI,GAAQ,OAAO,OAAO,MACtB,EAAO,OAAO,KAAK,GAEd,EAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CACpC,GAAI,GAAM,EAAK,GACX,EAAM,EAAI,GAEd,GAAI,MAAM,QAAQ,GAAM,CACtB,EAAM,GAAO,EAAI,QACjB,SAGF,GAAI,MAAO,IAAQ,UACf,MAAO,IAAQ,UACf,MAAO,IAAQ,UAAW,CAC5B,EAAM,GAAO,EACb,SAGF,KAAM,IAAI,WAAU,yDAGtB,MAAO,IAET,EAAK,SAAW,SAAU,EAAQ,EAAW,EAAa,CACxD,KAAK,OAAS,EACd,KAAK,UAAY,EACjB,KAAK,aAAe,GAGtB,EAAK,SAAS,OAAS,IAEvB,EAAK,SAAS,WAAa,SAAU,EAAG,CACtC,GAAI,GAAI,EAAE,QAAQ,EAAK,SAAS,QAEhC,GAAI,IAAM,GACR,KAAM,6BAGR,GAAI,GAAW,EAAE,MAAM,EAAG,GACtB,EAAS,EAAE,MAAM,EAAI,GAEzB,MAAO,IAAI,GAAK,SAAU,EAAQ,EAAU,IAG9C,EAAK,SAAS,UAAU,SAAW,UAAY,CAC7C,MAAI,MAAK,cAAgB,MACvB,MAAK,aAAe,KAAK,UAAY,EAAK,SAAS,OAAS,KAAK,QAG5D,KAAK,cAEd;AAAA;AAAA;AAAA,GAUA,EAAK,IAAM,SAAU,EAAU,CAG7B,GAFA,KAAK,SAAW,OAAO,OAAO,MAE1B,EAAU,CACZ,KAAK,OAAS,EAAS,OAEvB,OAAS,GAAI,EAAG,EAAI,KAAK,OAAQ,IAC/B,KAAK,SAAS,EAAS,IAAM,OAG/B,MAAK,OAAS,GAWlB,EAAK,IAAI,SAAW,CAClB,UAAW,SAAU,EAAO,CAC1B,MAAO,IAGT,MAAO,UAAY,CACjB,MAAO,OAGT,SAAU,UAAY,CACpB,MAAO,KAWX,EAAK,IAAI,MAAQ,CACf,UAAW,UAAY,CACrB,MAAO,OAGT,MAAO,SAAU,EAAO,CACtB,MAAO,IAGT,SAAU,UAAY,CACpB,MAAO,KAUX,EAAK,IAAI,UAAU,SAAW,SAAU,EAAQ,CAC9C,MAAO,CAAC,CAAC,KAAK,SAAS,IAWzB,EAAK,IAAI,UAAU,UAAY,SAAU,EAAO,CAC9C,GAAI,GAAG,EAAG,EAAU,EAAe,GAEnC,GAAI,IAAU,EAAK,IAAI,SACrB,MAAO,MAGT,GAAI,IAAU,EAAK,IAAI,MACrB,MAAO,GAGT,AAAI,KAAK,OAAS,EAAM,OACtB,GAAI,KACJ,EAAI,GAEJ,GAAI,EACJ,EAAI,MAGN,EAAW,OAAO,KAAK,EAAE,UAEzB,OAAS,GAAI,EAAG,EAAI,EAAS,OAAQ,IAAK,CACxC,GAAI,GAAU,EAAS,GACvB,AAAI,IAAW,GAAE,UACf,EAAa,KAAK,GAItB,MAAO,IAAI,GAAK,IAAK,IAUvB,EAAK,IAAI,UAAU,MAAQ,SAAU,EAAO,CAC1C,MAAI,KAAU,EAAK,IAAI,SACd,EAAK,IAAI,SAGd,IAAU,EAAK,IAAI,MACd,KAGF,GAAI,GAAK,IAAI,OAAO,KAAK,KAAK,UAAU,OAAO,OAAO,KAAK,EAAM,aAU1E,EAAK,IAAM,SAAU,EAAS,EAAe,CAC3C,GAAI,GAAoB,EAExB,OAAS,KAAa,GACpB,AAAI,GAAa,UACjB,IAAqB,OAAO,KAAK,EAAQ,IAAY,QAGvD,GAAI,GAAK,GAAgB,EAAoB,IAAQ,GAAoB,IAEzE,MAAO,MAAK,IAAI,EAAI,KAAK,IAAI,KAW/B,EAAK,MAAQ,SAAU,EAAK,EAAU,CACpC,KAAK,IAAM,GAAO,GAClB,KAAK,SAAW,GAAY,IAQ9B,EAAK,MAAM,UAAU,SAAW,UAAY,CAC1C,MAAO,MAAK,KAuBd,EAAK,MAAM,UAAU,OAAS,SAAU,EAAI,CAC1C,YAAK,IAAM,EAAG,KAAK,IAAK,KAAK,UACtB,MAUT,EAAK,MAAM,UAAU,MAAQ,SAAU,EAAI,CACzC,SAAK,GAAM,SAAU,EAAG,CAAE,MAAO,IAC1B,GAAI,GAAK,MAAO,EAAG,KAAK,IAAK,KAAK,UAAW,KAAK,WAE3D;AAAA;AAAA;AAAA,GAuBA,EAAK,UAAY,SAAU,EAAK,EAAU,CACxC,GAAI,GAAO,MAAQ,GAAO,KACxB,MAAO,GAGT,GAAI,MAAM,QAAQ,GAChB,MAAO,GAAI,IAAI,SAAU,EAAG,CAC1B,MAAO,IAAI,GAAK,MACd,EAAK,MAAM,SAAS,GAAG,cACvB,EAAK,MAAM,MAAM,MASvB,OAJI,GAAM,EAAI,WAAW,cACrB,EAAM,EAAI,OACV,EAAS,GAEJ,EAAW,EAAG,EAAa,EAAG,GAAY,EAAK,IAAY,CAClE,GAAI,GAAO,EAAI,OAAO,GAClB,EAAc,EAAW,EAE7B,GAAK,EAAK,MAAM,EAAK,UAAU,YAAc,GAAY,EAAM,CAE7D,GAAI,EAAc,EAAG,CACnB,GAAI,GAAgB,EAAK,MAAM,MAAM,IAAa,GAClD,EAAc,SAAc,CAAC,EAAY,GACzC,EAAc,MAAW,EAAO,OAEhC,EAAO,KACL,GAAI,GAAK,MACP,EAAI,MAAM,EAAY,GACtB,IAKN,EAAa,EAAW,GAK5B,MAAO,IAUT,EAAK,UAAU,UAAY,UAC3B;AAAA;AAAA;AAAA,GAkCA,EAAK,SAAW,UAAY,CAC1B,KAAK,OAAS,IAGhB,EAAK,SAAS,oBAAsB,OAAO,OAAO,MAmClD,EAAK,SAAS,iBAAmB,SAAU,EAAI,EAAO,CACpD,AAAI,IAAS,MAAK,qBAChB,EAAK,MAAM,KAAK,6CAA+C,GAGjE,EAAG,MAAQ,EACX,EAAK,SAAS,oBAAoB,EAAG,OAAS,GAShD,EAAK,SAAS,4BAA8B,SAAU,EAAI,CACxD,GAAI,GAAe,EAAG,OAAU,EAAG,QAAS,MAAK,oBAEjD,AAAK,GACH,EAAK,MAAM,KAAK;AAAA,EAAmG,IAcvH,EAAK,SAAS,KAAO,SAAU,EAAY,CACzC,GAAI,GAAW,GAAI,GAAK,SAExB,SAAW,QAAQ,SAAU,EAAQ,CACnC,GAAI,GAAK,EAAK,SAAS,oBAAoB,GAE3C,GAAI,EACF,EAAS,IAAI,OAEb,MAAM,IAAI,OAAM,sCAAwC,KAIrD,GAUT,EAAK,SAAS,UAAU,IAAM,UAAY,CACxC,GAAI,GAAM,MAAM,UAAU,MAAM,KAAK,WAErC,EAAI,QAAQ,SAAU,EAAI,CACxB,EAAK,SAAS,4BAA4B,GAC1C,KAAK,OAAO,KAAK,IAChB,OAYL,EAAK,SAAS,UAAU,MAAQ,SAAU,EAAY,EAAO,CAC3D,EAAK,SAAS,4BAA4B,GAE1C,GAAI,GAAM,KAAK,OAAO,QAAQ,GAC9B,GAAI,GAAO,GACT,KAAM,IAAI,OAAM,0BAGlB,EAAM,EAAM,EACZ,KAAK,OAAO,OAAO,EAAK,EAAG,IAY7B,EAAK,SAAS,UAAU,OAAS,SAAU,EAAY,EAAO,CAC5D,EAAK,SAAS,4BAA4B,GAE1C,GAAI,GAAM,KAAK,OAAO,QAAQ,GAC9B,GAAI,GAAO,GACT,KAAM,IAAI,OAAM,0BAGlB,KAAK,OAAO,OAAO,EAAK,EAAG,IAQ7B,EAAK,SAAS,UAAU,OAAS,SAAU,EAAI,CAC7C,GAAI,GAAM,KAAK,OAAO,QAAQ,GAC9B,AAAI,GAAO,IAIX,KAAK,OAAO,OAAO,EAAK,IAU1B,EAAK,SAAS,UAAU,IAAM,SAAU,EAAQ,CAG9C,OAFI,GAAc,KAAK,OAAO,OAErB,EAAI,EAAG,EAAI,EAAa,IAAK,CAIpC,OAHI,GAAK,KAAK,OAAO,GACjB,EAAO,GAEF,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,GAAI,GAAS,EAAG,EAAO,GAAI,EAAG,GAE9B,GAAI,KAAW,MAA6B,IAAW,IAEvD,GAAI,MAAM,QAAQ,GAChB,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAK,KAAK,EAAO,QAGnB,GAAK,KAAK,GAId,EAAS,EAGX,MAAO,IAaT,EAAK,SAAS,UAAU,UAAY,SAAU,EAAK,EAAU,CAC3D,GAAI,GAAQ,GAAI,GAAK,MAAO,EAAK,GAEjC,MAAO,MAAK,IAAI,CAAC,IAAQ,IAAI,SAAU,EAAG,CACxC,MAAO,GAAE,cAQb,EAAK,SAAS,UAAU,MAAQ,UAAY,CAC1C,KAAK,OAAS,IAUhB,EAAK,SAAS,UAAU,OAAS,UAAY,CAC3C,MAAO,MAAK,OAAO,IAAI,SAAU,EAAI,CACnC,SAAK,SAAS,4BAA4B,GAEnC,EAAG,SAGd;AAAA;AAAA;AAAA,GAqBA,EAAK,OAAS,SAAU,EAAU,CAChC,KAAK,WAAa,EAClB,KAAK,SAAW,GAAY,IAc9B,EAAK,OAAO,UAAU,iBAAmB,SAAU,EAAO,CAExD,GAAI,KAAK,SAAS,QAAU,EAC1B,MAAO,GAST,OANI,GAAQ,EACR,EAAM,KAAK,SAAS,OAAS,EAC7B,EAAc,EAAM,EACpB,EAAa,KAAK,MAAM,EAAc,GACtC,EAAa,KAAK,SAAS,EAAa,GAErC,EAAc,GACf,GAAa,GACf,GAAQ,GAGN,EAAa,GACf,GAAM,GAGJ,GAAc,IAIlB,EAAc,EAAM,EACpB,EAAa,EAAQ,KAAK,MAAM,EAAc,GAC9C,EAAa,KAAK,SAAS,EAAa,GAO1C,GAJI,GAAc,GAId,EAAa,EACf,MAAO,GAAa,EAGtB,GAAI,EAAa,EACf,MAAQ,GAAa,GAAK,GAa9B,EAAK,OAAO,UAAU,OAAS,SAAU,EAAW,EAAK,CACvD,KAAK,OAAO,EAAW,EAAK,UAAY,CACtC,KAAM,qBAYV,EAAK,OAAO,UAAU,OAAS,SAAU,EAAW,EAAK,EAAI,CAC3D,KAAK,WAAa,EAClB,GAAI,GAAW,KAAK,iBAAiB,GAErC,AAAI,KAAK,SAAS,IAAa,EAC7B,KAAK,SAAS,EAAW,GAAK,EAAG,KAAK,SAAS,EAAW,GAAI,GAE9D,KAAK,SAAS,OAAO,EAAU,EAAG,EAAW,IASjD,EAAK,OAAO,UAAU,UAAY,UAAY,CAC5C,GAAI,KAAK,WAAY,MAAO,MAAK,WAKjC,OAHI,GAAe,EACf,EAAiB,KAAK,SAAS,OAE1B,EAAI,EAAG,EAAI,EAAgB,GAAK,EAAG,CAC1C,GAAI,GAAM,KAAK,SAAS,GACxB,GAAgB,EAAM,EAGxB,MAAO,MAAK,WAAa,KAAK,KAAK,IASrC,EAAK,OAAO,UAAU,IAAM,SAAU,EAAa,CAOjD,OANI,GAAa,EACb,EAAI,KAAK,SAAU,EAAI,EAAY,SACnC,EAAO,EAAE,OAAQ,EAAO,EAAE,OAC1B,EAAO,EAAG,EAAO,EACjB,EAAI,EAAG,EAAI,EAER,EAAI,GAAQ,EAAI,GACrB,EAAO,EAAE,GAAI,EAAO,EAAE,GACtB,AAAI,EAAO,EACT,GAAK,EACA,AAAI,EAAO,EAChB,GAAK,EACI,GAAQ,GACjB,IAAc,EAAE,EAAI,GAAK,EAAE,EAAI,GAC/B,GAAK,EACL,GAAK,GAIT,MAAO,IAUT,EAAK,OAAO,UAAU,WAAa,SAAU,EAAa,CACxD,MAAO,MAAK,IAAI,GAAe,KAAK,aAAe,GAQrD,EAAK,OAAO,UAAU,QAAU,UAAY,CAG1C,OAFI,GAAS,GAAI,OAAO,KAAK,SAAS,OAAS,GAEtC,EAAI,EAAG,EAAI,EAAG,EAAI,KAAK,SAAS,OAAQ,GAAK,EAAG,IACvD,EAAO,GAAK,KAAK,SAAS,GAG5B,MAAO,IAQT,EAAK,OAAO,UAAU,OAAS,UAAY,CACzC,MAAO,MAAK,UAGd;AAAA;AAAA;AAAA;AAAA,GAiBA,EAAK,QAAW,UAAU,CACxB,GAAI,GAAY,CACZ,QAAY,MACZ,OAAW,OACX,KAAS,OACT,KAAS,OACT,KAAS,MACT,IAAQ,MACR,KAAS,KACT,MAAU,MACV,IAAQ,IACR,MAAU,MACV,QAAY,MACZ,MAAU,MACV,KAAS,MACT,MAAU,KACV,QAAY,MACZ,QAAY,MACZ,QAAY,MACZ,MAAU,KACV,MAAU,MACV,OAAW,MACX,KAAS,OAGX,EAAY,CACV,MAAU,KACV,MAAU,GACV,MAAU,KACV,MAAU,KACV,KAAS,KACT,IAAQ,GACR,KAAS,IAGX,EAAI,WACJ,EAAI,WACJ,EAAI,EAAI,aACR,EAAI,EAAI,WAER,EAAO,KAAO,EAAI,KAAO,EAAI,EAC7B,EAAO,KAAO,EAAI,KAAO,EAAI,EAAI,IAAM,EAAI,MAC3C,EAAO,KAAO,EAAI,KAAO,EAAI,EAAI,EAAI,EACrC,EAAM,KAAO,EAAI,KAAO,EAEtB,EAAU,GAAI,QAAO,GACrB,EAAU,GAAI,QAAO,GACrB,EAAU,GAAI,QAAO,GACrB,EAAS,GAAI,QAAO,GAEpB,EAAQ,kBACR,EAAS,iBACT,EAAQ,aACR,EAAS,kBACT,EAAU,KACV,EAAW,cACX,EAAW,GAAI,QAAO,sBACtB,EAAW,GAAI,QAAO,IAAM,EAAI,EAAI,gBAEpC,EAAQ,mBACR,EAAO,2IAEP,EAAO,iDAEP,EAAO,sFACP,EAAQ,oBAER,EAAO,WACP,EAAS,MACT,EAAQ,GAAI,QAAO,IAAM,EAAI,EAAI,gBAEjC,EAAgB,SAAuB,EAAG,CAC5C,GAAI,GACF,EACA,EACA,EACA,EACA,EACA,EAEF,GAAI,EAAE,OAAS,EAAK,MAAO,GAiB3B,GAfA,EAAU,EAAE,OAAO,EAAE,GACjB,GAAW,KACb,GAAI,EAAQ,cAAgB,EAAE,OAAO,IAIvC,EAAK,EACL,EAAM,EAEN,AAAI,EAAG,KAAK,GAAM,EAAI,EAAE,QAAQ,EAAG,QAC1B,EAAI,KAAK,IAAM,GAAI,EAAE,QAAQ,EAAI,SAG1C,EAAK,EACL,EAAM,EACF,EAAG,KAAK,GAAI,CACd,GAAI,GAAK,EAAG,KAAK,GACjB,EAAK,EACD,EAAG,KAAK,EAAG,KACb,GAAK,EACL,EAAI,EAAE,QAAQ,EAAG,aAEV,EAAI,KAAK,GAAI,CACtB,GAAI,GAAK,EAAI,KAAK,GAClB,EAAO,EAAG,GACV,EAAM,EACF,EAAI,KAAK,IACX,GAAI,EACJ,EAAM,EACN,EAAM,EACN,EAAM,EACN,AAAI,EAAI,KAAK,GAAM,EAAI,EAAI,IACtB,AAAI,EAAI,KAAK,GAAM,GAAK,EAAS,EAAI,EAAE,QAAQ,EAAG,KAC9C,EAAI,KAAK,IAAM,GAAI,EAAI,MAMpC,GADA,EAAK,EACD,EAAG,KAAK,GAAI,CACd,GAAI,GAAK,EAAG,KAAK,GACjB,EAAO,EAAG,GACV,EAAI,EAAO,IAKb,GADA,EAAK,EACD,EAAG,KAAK,GAAI,CACd,GAAI,GAAK,EAAG,KAAK,GACjB,EAAO,EAAG,GACV,EAAS,EAAG,GACZ,EAAK,EACD,EAAG,KAAK,IACV,GAAI,EAAO,EAAU,IAMzB,GADA,EAAK,EACD,EAAG,KAAK,GAAI,CACd,GAAI,GAAK,EAAG,KAAK,GACjB,EAAO,EAAG,GACV,EAAS,EAAG,GACZ,EAAK,EACD,EAAG,KAAK,IACV,GAAI,EAAO,EAAU,IAOzB,GAFA,EAAK,EACL,EAAM,EACF,EAAG,KAAK,GAAI,CACd,GAAI,GAAK,EAAG,KAAK,GACjB,EAAO,EAAG,GACV,EAAK,EACD,EAAG,KAAK,IACV,GAAI,WAEG,EAAI,KAAK,GAAI,CACtB,GAAI,GAAK,EAAI,KAAK,GAClB,EAAO,EAAG,GAAK,EAAG,GAClB,EAAM,EACF,EAAI,KAAK,IACX,GAAI,GAMR,GADA,EAAK,EACD,EAAG,KAAK,GAAI,CACd,GAAI,GAAK,EAAG,KAAK,GACjB,EAAO,EAAG,GACV,EAAK,EACL,EAAM,EACN,EAAM,EACF,GAAG,KAAK,IAAU,EAAI,KAAK,IAAS,CAAE,EAAI,KAAK,KACjD,GAAI,GAIR,SAAK,EACL,EAAM,EACF,EAAG,KAAK,IAAM,EAAI,KAAK,IACzB,GAAK,EACL,EAAI,EAAE,QAAQ,EAAG,KAKf,GAAW,KACb,GAAI,EAAQ,cAAgB,EAAE,OAAO,IAGhC,GAGT,MAAO,UAAU,EAAO,CACtB,MAAO,GAAM,OAAO,OAIxB,EAAK,SAAS,iBAAiB,EAAK,QAAS,WAC7C;AAAA;AAAA;AAAA,GAkBA,EAAK,uBAAyB,SAAU,EAAW,CACjD,GAAI,GAAQ,EAAU,OAAO,SAAU,EAAM,EAAU,CACrD,SAAK,GAAY,EACV,GACN,IAEH,MAAO,UAAU,EAAO,CACtB,GAAI,GAAS,EAAM,EAAM,cAAgB,EAAM,WAAY,MAAO,KAiBtE,EAAK,eAAiB,EAAK,uBAAuB,CAChD,IACA,OACA,QACA,SACA,QACA,MACA,SACA,OACA,KACA,QACA,KACA,MACA,MACA,MACA,KACA,KACA,KACA,UACA,OACA,MACA,KACA,MACA,SACA,QACA,OACA,MACA,KACA,OACA,SACA,OACA,OACA,QACA,MACA,OACA,MACA,MACA,MACA,MACA,OACA,KACA,MACA,OACA,MACA,MACA,MACA,UACA,IACA,KACA,KACA,OACA,KACA,KACA,MACA,OACA,QACA,MACA,OACA,SACA,MACA,KACA,QACA,OACA,OACA,KACA,UACA,KACA,MACA,MACA,KACA,MACA,QACA,KACA,OACA,KACA,QACA,MACA,MACA,SACA,OACA,MACA,OACA,MACA,SACA,QACA,KACA,OACA,OACA,OACA,MACA,QACA,OACA,OACA,QACA,QACA,OACA,OACA,MACA,KACA,MACA,OACA,KACA,QACA,MACA,KACA,OACA,OACA,OACA,QACA,QACA,QACA,MACA,OACA,MACA,OACA,OACA,QACA,MACA,MACA,SAGF,EAAK,SAAS,iBAAiB,EAAK,eAAgB,kBACpD;AAAA;AAAA;AAAA,GAoBA,EAAK,QAAU,SAAU,EAAO,CAC9B,MAAO,GAAM,OAAO,SAAU,EAAG,CAC/B,MAAO,GAAE,QAAQ,OAAQ,IAAI,QAAQ,OAAQ,OAIjD,EAAK,SAAS,iBAAiB,EAAK,QAAS,WAC7C;AAAA;AAAA;AAAA,GA0BA,EAAK,SAAW,UAAY,CAC1B,KAAK,MAAQ,GACb,KAAK,MAAQ,GACb,KAAK,GAAK,EAAK,SAAS,QACxB,EAAK,SAAS,SAAW,GAW3B,EAAK,SAAS,QAAU,EASxB,EAAK,SAAS,UAAY,SAAU,EAAK,CAGvC,OAFI,GAAU,GAAI,GAAK,SAAS,QAEvB,EAAI,EAAG,EAAM,EAAI,OAAQ,EAAI,EAAK,IACzC,EAAQ,OAAO,EAAI,IAGrB,SAAQ,SACD,EAAQ,MAYjB,EAAK,SAAS,WAAa,SAAU,EAAQ,CAC3C,MAAI,gBAAkB,GACb,EAAK,SAAS,gBAAgB,EAAO,KAAM,EAAO,cAElD,EAAK,SAAS,WAAW,EAAO,OAmB3C,EAAK,SAAS,gBAAkB,SAAU,EAAK,EAAc,CAS3D,OARI,GAAO,GAAI,GAAK,SAEhB,EAAQ,CAAC,CACX,KAAM,EACN,eAAgB,EAChB,IAAK,IAGA,EAAM,QAAQ,CACnB,GAAI,GAAQ,EAAM,MAGlB,GAAI,EAAM,IAAI,OAAS,EAAG,CACxB,GAAI,GAAO,EAAM,IAAI,OAAO,GACxB,EAEJ,AAAI,IAAQ,GAAM,KAAK,MACrB,EAAa,EAAM,KAAK,MAAM,GAE9B,GAAa,GAAI,GAAK,SACtB,EAAM,KAAK,MAAM,GAAQ,GAGvB,EAAM,IAAI,QAAU,GACtB,GAAW,MAAQ,IAGrB,EAAM,KAAK,CACT,KAAM,EACN,eAAgB,EAAM,eACtB,IAAK,EAAM,IAAI,MAAM,KAIzB,GAAI,EAAM,gBAAkB,EAK5B,IAAI,KAAO,GAAM,KAAK,MACpB,GAAI,GAAgB,EAAM,KAAK,MAAM,SAChC,CACL,GAAI,GAAgB,GAAI,GAAK,SAC7B,EAAM,KAAK,MAAM,KAAO,EAiC1B,GA9BI,EAAM,IAAI,QAAU,GACtB,GAAc,MAAQ,IAGxB,EAAM,KAAK,CACT,KAAM,EACN,eAAgB,EAAM,eAAiB,EACvC,IAAK,EAAM,MAMT,EAAM,IAAI,OAAS,GACrB,EAAM,KAAK,CACT,KAAM,EAAM,KACZ,eAAgB,EAAM,eAAiB,EACvC,IAAK,EAAM,IAAI,MAAM,KAMrB,EAAM,IAAI,QAAU,GACtB,GAAM,KAAK,MAAQ,IAMjB,EAAM,IAAI,QAAU,EAAG,CACzB,GAAI,KAAO,GAAM,KAAK,MACpB,GAAI,GAAmB,EAAM,KAAK,MAAM,SACnC,CACL,GAAI,GAAmB,GAAI,GAAK,SAChC,EAAM,KAAK,MAAM,KAAO,EAG1B,AAAI,EAAM,IAAI,QAAU,GACtB,GAAiB,MAAQ,IAG3B,EAAM,KAAK,CACT,KAAM,EACN,eAAgB,EAAM,eAAiB,EACvC,IAAK,EAAM,IAAI,MAAM,KAOzB,GAAI,EAAM,IAAI,OAAS,EAAG,CACxB,GAAI,GAAQ,EAAM,IAAI,OAAO,GACzB,EAAQ,EAAM,IAAI,OAAO,GACzB,EAEJ,AAAI,IAAS,GAAM,KAAK,MACtB,EAAgB,EAAM,KAAK,MAAM,GAEjC,GAAgB,GAAI,GAAK,SACzB,EAAM,KAAK,MAAM,GAAS,GAGxB,EAAM,IAAI,QAAU,GACtB,GAAc,MAAQ,IAGxB,EAAM,KAAK,CACT,KAAM,EACN,eAAgB,EAAM,eAAiB,EACvC,IAAK,EAAQ,EAAM,IAAI,MAAM,OAKnC,MAAO,IAaT,EAAK,SAAS,WAAa,SAAU,EAAK,CAYxC,OAXI,GAAO,GAAI,GAAK,SAChB,EAAO,EAUF,EAAI,EAAG,EAAM,EAAI,OAAQ,EAAI,EAAK,IAAK,CAC9C,GAAI,GAAO,EAAI,GACX,EAAS,GAAK,EAAM,EAExB,GAAI,GAAQ,IACV,EAAK,MAAM,GAAQ,EACnB,EAAK,MAAQ,MAER,CACL,GAAI,GAAO,GAAI,GAAK,SACpB,EAAK,MAAQ,EAEb,EAAK,MAAM,GAAQ,EACnB,EAAO,GAIX,MAAO,IAaT,EAAK,SAAS,UAAU,QAAU,UAAY,CAQ5C,OAPI,GAAQ,GAER,EAAQ,CAAC,CACX,OAAQ,GACR,KAAM,OAGD,EAAM,QAAQ,CACnB,GAAI,GAAQ,EAAM,MACd,EAAQ,OAAO,KAAK,EAAM,KAAK,OAC/B,EAAM,EAAM,OAEhB,AAAI,EAAM,KAAK,OAKb,GAAM,OAAO,OAAO,GACpB,EAAM,KAAK,EAAM,SAGnB,OAAS,GAAI,EAAG,EAAI,EAAK,IAAK,CAC5B,GAAI,GAAO,EAAM,GAEjB,EAAM,KAAK,CACT,OAAQ,EAAM,OAAO,OAAO,GAC5B,KAAM,EAAM,KAAK,MAAM,MAK7B,MAAO,IAaT,EAAK,SAAS,UAAU,SAAW,UAAY,CAS7C,GAAI,KAAK,KACP,MAAO,MAAK,KAOd,OAJI,GAAM,KAAK,MAAQ,IAAM,IACzB,EAAS,OAAO,KAAK,KAAK,OAAO,OACjC,EAAM,EAAO,OAER,EAAI,EAAG,EAAI,EAAK,IAAK,CAC5B,GAAI,GAAQ,EAAO,GACf,EAAO,KAAK,MAAM,GAEtB,EAAM,EAAM,EAAQ,EAAK,GAG3B,MAAO,IAaT,EAAK,SAAS,UAAU,UAAY,SAAU,EAAG,CAU/C,OATI,GAAS,GAAI,GAAK,SAClB,EAAQ,OAER,EAAQ,CAAC,CACX,MAAO,EACP,OAAQ,EACR,KAAM,OAGD,EAAM,QAAQ,CACnB,EAAQ,EAAM,MAWd,OALI,GAAS,OAAO,KAAK,EAAM,MAAM,OACjC,EAAO,EAAO,OACd,EAAS,OAAO,KAAK,EAAM,KAAK,OAChC,EAAO,EAAO,OAET,EAAI,EAAG,EAAI,EAAM,IAGxB,OAFI,GAAQ,EAAO,GAEV,EAAI,EAAG,EAAI,EAAM,IAAK,CAC7B,GAAI,GAAQ,EAAO,GAEnB,GAAI,GAAS,GAAS,GAAS,IAAK,CAClC,GAAI,GAAO,EAAM,KAAK,MAAM,GACxB,EAAQ,EAAM,MAAM,MAAM,GAC1B,EAAQ,EAAK,OAAS,EAAM,MAC5B,EAAO,OAEX,AAAI,IAAS,GAAM,OAAO,MAIxB,GAAO,EAAM,OAAO,MAAM,GAC1B,EAAK,MAAQ,EAAK,OAAS,GAM3B,GAAO,GAAI,GAAK,SAChB,EAAK,MAAQ,EACb,EAAM,OAAO,MAAM,GAAS,GAG9B,EAAM,KAAK,CACT,MAAO,EACP,OAAQ,EACR,KAAM,MAOhB,MAAO,IAET,EAAK,SAAS,QAAU,UAAY,CAClC,KAAK,aAAe,GACpB,KAAK,KAAO,GAAI,GAAK,SACrB,KAAK,eAAiB,GACtB,KAAK,eAAiB,IAGxB,EAAK,SAAS,QAAQ,UAAU,OAAS,SAAU,EAAM,CACvD,GAAI,GACA,EAAe,EAEnB,GAAI,EAAO,KAAK,aACd,KAAM,IAAI,OAAO,+BAGnB,OAAS,GAAI,EAAG,EAAI,EAAK,QAAU,EAAI,KAAK,aAAa,QACnD,EAAK,IAAM,KAAK,aAAa,GAD8B,IAE/D,IAGF,KAAK,SAAS,GAEd,AAAI,KAAK,eAAe,QAAU,EAChC,EAAO,KAAK,KAEZ,EAAO,KAAK,eAAe,KAAK,eAAe,OAAS,GAAG,MAG7D,OAAS,GAAI,EAAc,EAAI,EAAK,OAAQ,IAAK,CAC/C,GAAI,GAAW,GAAI,GAAK,SACpB,EAAO,EAAK,GAEhB,EAAK,MAAM,GAAQ,EAEnB,KAAK,eAAe,KAAK,CACvB,OAAQ,EACR,KAAM,EACN,MAAO,IAGT,EAAO,EAGT,EAAK,MAAQ,GACb,KAAK,aAAe,GAGtB,EAAK,SAAS,QAAQ,UAAU,OAAS,UAAY,CACnD,KAAK,SAAS,IAGhB,EAAK,SAAS,QAAQ,UAAU,SAAW,SAAU,EAAQ,CAC3D,OAAS,GAAI,KAAK,eAAe,OAAS,EAAG,GAAK,EAAQ,IAAK,CAC7D,GAAI,GAAO,KAAK,eAAe,GAC3B,EAAW,EAAK,MAAM,WAE1B,AAAI,IAAY,MAAK,eACnB,EAAK,OAAO,MAAM,EAAK,MAAQ,KAAK,eAAe,GAInD,GAAK,MAAM,KAAO,EAElB,KAAK,eAAe,GAAY,EAAK,OAGvC,KAAK,eAAe,QAGxB;AAAA;AAAA;AAAA,GAqBA,EAAK,MAAQ,SAAU,EAAO,CAC5B,KAAK,cAAgB,EAAM,cAC3B,KAAK,aAAe,EAAM,aAC1B,KAAK,SAAW,EAAM,SACtB,KAAK,OAAS,EAAM,OACpB,KAAK,SAAW,EAAM,UA0ExB,EAAK,MAAM,UAAU,OAAS,SAAU,EAAa,CACnD,MAAO,MAAK,MAAM,SAAU,EAAO,CACjC,GAAI,GAAS,GAAI,GAAK,YAAY,EAAa,GAC/C,EAAO,WA6BX,EAAK,MAAM,UAAU,MAAQ,SAAU,EAAI,CAoBzC,OAZI,GAAQ,GAAI,GAAK,MAAM,KAAK,QAC5B,EAAiB,OAAO,OAAO,MAC/B,EAAe,OAAO,OAAO,MAC7B,EAAiB,OAAO,OAAO,MAC/B,EAAkB,OAAO,OAAO,MAChC,EAAoB,OAAO,OAAO,MAO7B,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IACtC,EAAa,KAAK,OAAO,IAAM,GAAI,GAAK,OAG1C,EAAG,KAAK,EAAO,GAEf,OAAS,GAAI,EAAG,EAAI,EAAM,QAAQ,OAAQ,IAAK,CAS7C,GAAI,GAAS,EAAM,QAAQ,GACvB,EAAQ,KACR,EAAgB,EAAK,IAAI,MAE7B,AAAI,EAAO,YACT,EAAQ,KAAK,SAAS,UAAU,EAAO,KAAM,CAC3C,OAAQ,EAAO,SAGjB,EAAQ,CAAC,EAAO,MAGlB,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,GAAI,GAAO,EAAM,GAQjB,EAAO,KAAO,EAOd,GAAI,GAAe,EAAK,SAAS,WAAW,GACxC,EAAgB,KAAK,SAAS,UAAU,GAAc,UAQ1D,GAAI,EAAc,SAAW,GAAK,EAAO,WAAa,EAAK,MAAM,SAAS,SAAU,CAClF,OAAS,GAAI,EAAG,EAAI,EAAO,OAAO,OAAQ,IAAK,CAC7C,GAAI,GAAQ,EAAO,OAAO,GAC1B,EAAgB,GAAS,EAAK,IAAI,MAGpC,MAGF,OAAS,GAAI,EAAG,EAAI,EAAc,OAAQ,IASxC,OAJI,GAAe,EAAc,GAC7B,EAAU,KAAK,cAAc,GAC7B,EAAY,EAAQ,OAEf,EAAI,EAAG,EAAI,EAAO,OAAO,OAAQ,IAAK,CAS7C,GAAI,GAAQ,EAAO,OAAO,GACtB,EAAe,EAAQ,GACvB,EAAuB,OAAO,KAAK,GACnC,EAAY,EAAe,IAAM,EACjC,EAAuB,GAAI,GAAK,IAAI,GAoBxC,GAbI,EAAO,UAAY,EAAK,MAAM,SAAS,UACzC,GAAgB,EAAc,MAAM,GAEhC,EAAgB,KAAW,QAC7B,GAAgB,GAAS,EAAK,IAAI,WASlC,EAAO,UAAY,EAAK,MAAM,SAAS,WAAY,CACrD,AAAI,EAAkB,KAAW,QAC/B,GAAkB,GAAS,EAAK,IAAI,OAGtC,EAAkB,GAAS,EAAkB,GAAO,MAAM,GAO1D,SAgBF,GANA,EAAa,GAAO,OAAO,EAAW,EAAO,MAAO,SAAU,GAAG,GAAG,CAAE,MAAO,IAAI,KAM7E,GAAe,GAInB,QAAS,GAAI,EAAG,EAAI,EAAqB,OAAQ,IAAK,CAOpD,GAAI,GAAsB,EAAqB,GAC3C,EAAmB,GAAI,GAAK,SAAU,EAAqB,GAC3D,EAAW,EAAa,GACxB,EAEJ,AAAK,GAAa,EAAe,MAAuB,OACtD,EAAe,GAAoB,GAAI,GAAK,UAAW,EAAc,EAAO,GAE5E,EAAW,IAAI,EAAc,EAAO,GAKxC,EAAe,GAAa,KAWlC,GAAI,EAAO,WAAa,EAAK,MAAM,SAAS,SAC1C,OAAS,GAAI,EAAG,EAAI,EAAO,OAAO,OAAQ,IAAK,CAC7C,GAAI,GAAQ,EAAO,OAAO,GAC1B,EAAgB,GAAS,EAAgB,GAAO,UAAU,IAahE,OAHI,GAAqB,EAAK,IAAI,SAC9B,EAAuB,EAAK,IAAI,MAE3B,EAAI,EAAG,EAAI,KAAK,OAAO,OAAQ,IAAK,CAC3C,GAAI,GAAQ,KAAK,OAAO,GAExB,AAAI,EAAgB,IAClB,GAAqB,EAAmB,UAAU,EAAgB,KAGhE,EAAkB,IACpB,GAAuB,EAAqB,MAAM,EAAkB,KAIxE,GAAI,GAAoB,OAAO,KAAK,GAChC,EAAU,GACV,EAAU,OAAO,OAAO,MAY5B,GAAI,EAAM,YAAa,CACrB,EAAoB,OAAO,KAAK,KAAK,cAErC,OAAS,GAAI,EAAG,EAAI,EAAkB,OAAQ,IAAK,CACjD,GAAI,GAAmB,EAAkB,GACrC,EAAW,EAAK,SAAS,WAAW,GACxC,EAAe,GAAoB,GAAI,GAAK,WAIhD,OAAS,GAAI,EAAG,EAAI,EAAkB,OAAQ,IAAK,CASjD,GAAI,GAAW,EAAK,SAAS,WAAW,EAAkB,IACtD,EAAS,EAAS,OAEtB,GAAI,EAAC,EAAmB,SAAS,IAI7B,GAAqB,SAAS,GAIlC,IAAI,GAAc,KAAK,aAAa,GAChC,EAAQ,EAAa,EAAS,WAAW,WAAW,GACpD,EAEJ,GAAK,GAAW,EAAQ,MAAa,OACnC,EAAS,OAAS,EAClB,EAAS,UAAU,QAAQ,EAAe,QACrC,CACL,GAAI,GAAQ,CACV,IAAK,EACL,MAAO,EACP,UAAW,EAAe,IAE5B,EAAQ,GAAU,EAClB,EAAQ,KAAK,KAOjB,MAAO,GAAQ,KAAK,SAAU,GAAG,GAAG,CAClC,MAAO,IAAE,MAAQ,GAAE,SAYvB,EAAK,MAAM,UAAU,OAAS,UAAY,CACxC,GAAI,GAAgB,OAAO,KAAK,KAAK,eAClC,OACA,IAAI,SAAU,EAAM,CACnB,MAAO,CAAC,EAAM,KAAK,cAAc,KAChC,MAED,EAAe,OAAO,KAAK,KAAK,cACjC,IAAI,SAAU,EAAK,CAClB,MAAO,CAAC,EAAK,KAAK,aAAa,GAAK,WACnC,MAEL,MAAO,CACL,QAAS,EAAK,QACd,OAAQ,KAAK,OACb,aAAc,EACd,cAAe,EACf,SAAU,KAAK,SAAS,WAU5B,EAAK,MAAM,KAAO,SAAU,EAAiB,CAC3C,GAAI,GAAQ,GACR,EAAe,GACf,EAAoB,EAAgB,aACpC,EAAgB,OAAO,OAAO,MAC9B,EAA0B,EAAgB,cAC1C,EAAkB,GAAI,GAAK,SAAS,QACpC,EAAW,EAAK,SAAS,KAAK,EAAgB,UAElD,AAAI,EAAgB,SAAW,EAAK,SAClC,EAAK,MAAM,KAAK,4EAA8E,EAAK,QAAU,sCAAwC,EAAgB,QAAU,KAGjL,OAAS,GAAI,EAAG,EAAI,EAAkB,OAAQ,IAAK,CACjD,GAAI,GAAQ,EAAkB,GAC1B,EAAM,EAAM,GACZ,EAAW,EAAM,GAErB,EAAa,GAAO,GAAI,GAAK,OAAO,GAGtC,OAAS,GAAI,EAAG,EAAI,EAAwB,OAAQ,IAAK,CACvD,GAAI,GAAQ,EAAwB,GAChC,EAAO,EAAM,GACb,EAAU,EAAM,GAEpB,EAAgB,OAAO,GACvB,EAAc,GAAQ,EAGxB,SAAgB,SAEhB,EAAM,OAAS,EAAgB,OAE/B,EAAM,aAAe,EACrB,EAAM,cAAgB,EACtB,EAAM,SAAW,EAAgB,KACjC,EAAM,SAAW,EAEV,GAAI,GAAK,MAAM,IAExB;AAAA;AAAA;AAAA,GA6BA,EAAK,QAAU,UAAY,CACzB,KAAK,KAAO,KACZ,KAAK,QAAU,OAAO,OAAO,MAC7B,KAAK,WAAa,OAAO,OAAO,MAChC,KAAK,cAAgB,OAAO,OAAO,MACnC,KAAK,qBAAuB,GAC5B,KAAK,aAAe,GACpB,KAAK,UAAY,EAAK,UACtB,KAAK,SAAW,GAAI,GAAK,SACzB,KAAK,eAAiB,GAAI,GAAK,SAC/B,KAAK,cAAgB,EACrB,KAAK,GAAK,IACV,KAAK,IAAM,IACX,KAAK,UAAY,EACjB,KAAK,kBAAoB,IAe3B,EAAK,QAAQ,UAAU,IAAM,SAAU,EAAK,CAC1C,KAAK,KAAO,GAmCd,EAAK,QAAQ,UAAU,MAAQ,SAAU,EAAW,EAAY,CAC9D,GAAI,KAAK,KAAK,GACZ,KAAM,IAAI,YAAY,UAAY,EAAY,oCAGhD,KAAK,QAAQ,GAAa,GAAc,IAW1C,EAAK,QAAQ,UAAU,EAAI,SAAU,EAAQ,CAC3C,AAAI,EAAS,EACX,KAAK,GAAK,EACL,AAAI,EAAS,EAClB,KAAK,GAAK,EAEV,KAAK,GAAK,GAWd,EAAK,QAAQ,UAAU,GAAK,SAAU,EAAQ,CAC5C,KAAK,IAAM,GAoBb,EAAK,QAAQ,UAAU,IAAM,SAAU,EAAK,EAAY,CACtD,GAAI,GAAS,EAAI,KAAK,MAClB,EAAS,OAAO,KAAK,KAAK,SAE9B,KAAK,WAAW,GAAU,GAAc,GACxC,KAAK,eAAiB,EAEtB,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,GAAI,GAAY,EAAO,GACnB,EAAY,KAAK,QAAQ,GAAW,UACpC,EAAQ,EAAY,EAAU,GAAO,EAAI,GACzC,EAAS,KAAK,UAAU,EAAO,CAC7B,OAAQ,CAAC,KAEX,EAAQ,KAAK,SAAS,IAAI,GAC1B,EAAW,GAAI,GAAK,SAAU,EAAQ,GACtC,EAAa,OAAO,OAAO,MAE/B,KAAK,qBAAqB,GAAY,EACtC,KAAK,aAAa,GAAY,EAG9B,KAAK,aAAa,IAAa,EAAM,OAGrC,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,GAAI,GAAO,EAAM,GAUjB,GARI,EAAW,IAAS,MACtB,GAAW,GAAQ,GAGrB,EAAW,IAAS,EAIhB,KAAK,cAAc,IAAS,KAAW,CACzC,GAAI,GAAU,OAAO,OAAO,MAC5B,EAAQ,OAAY,KAAK,UACzB,KAAK,WAAa,EAElB,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IACjC,EAAQ,EAAO,IAAM,OAAO,OAAO,MAGrC,KAAK,cAAc,GAAQ,EAI7B,AAAI,KAAK,cAAc,GAAM,GAAW,IAAW,MACjD,MAAK,cAAc,GAAM,GAAW,GAAU,OAAO,OAAO,OAK9D,OAAS,GAAI,EAAG,EAAI,KAAK,kBAAkB,OAAQ,IAAK,CACtD,GAAI,GAAc,KAAK,kBAAkB,GACrC,EAAW,EAAK,SAAS,GAE7B,AAAI,KAAK,cAAc,GAAM,GAAW,GAAQ,IAAgB,MAC9D,MAAK,cAAc,GAAM,GAAW,GAAQ,GAAe,IAG7D,KAAK,cAAc,GAAM,GAAW,GAAQ,GAAa,KAAK,OAYtE,EAAK,QAAQ,UAAU,6BAA+B,UAAY,CAOhE,OALI,GAAY,OAAO,KAAK,KAAK,cAC7B,EAAiB,EAAU,OAC3B,EAAc,GACd,EAAqB,GAEhB,EAAI,EAAG,EAAI,EAAgB,IAAK,CACvC,GAAI,GAAW,EAAK,SAAS,WAAW,EAAU,IAC9C,EAAQ,EAAS,UAErB,EAAmB,IAAW,GAAmB,GAAS,GAC1D,EAAmB,IAAU,EAE7B,EAAY,IAAW,GAAY,GAAS,GAC5C,EAAY,IAAU,KAAK,aAAa,GAK1C,OAFI,GAAS,OAAO,KAAK,KAAK,SAErB,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,GAAI,GAAY,EAAO,GACvB,EAAY,GAAa,EAAY,GAAa,EAAmB,GAGvE,KAAK,mBAAqB,GAQ5B,EAAK,QAAQ,UAAU,mBAAqB,UAAY,CAMtD,OALI,GAAe,GACf,EAAY,OAAO,KAAK,KAAK,sBAC7B,EAAkB,EAAU,OAC5B,EAAe,OAAO,OAAO,MAExB,EAAI,EAAG,EAAI,EAAiB,IAAK,CAaxC,OAZI,GAAW,EAAK,SAAS,WAAW,EAAU,IAC9C,EAAY,EAAS,UACrB,EAAc,KAAK,aAAa,GAChC,EAAc,GAAI,GAAK,OACvB,EAAkB,KAAK,qBAAqB,GAC5C,EAAQ,OAAO,KAAK,GACpB,EAAc,EAAM,OAGpB,EAAa,KAAK,QAAQ,GAAW,OAAS,EAC9C,EAAW,KAAK,WAAW,EAAS,QAAQ,OAAS,EAEhD,EAAI,EAAG,EAAI,EAAa,IAAK,CACpC,GAAI,GAAO,EAAM,GACb,EAAK,EAAgB,GACrB,EAAY,KAAK,cAAc,GAAM,OACrC,EAAK,EAAO,EAEhB,AAAI,EAAa,KAAU,OACzB,GAAM,EAAK,IAAI,KAAK,cAAc,GAAO,KAAK,eAC9C,EAAa,GAAQ,GAErB,EAAM,EAAa,GAGrB,EAAQ,EAAQ,OAAK,IAAM,GAAK,GAAO,MAAK,IAAO,GAAI,KAAK,GAAK,KAAK,GAAM,GAAc,KAAK,mBAAmB,KAAe,GACjI,GAAS,EACT,GAAS,EACT,EAAqB,KAAK,MAAM,EAAQ,KAAQ,IAQhD,EAAY,OAAO,EAAW,GAGhC,EAAa,GAAY,EAG3B,KAAK,aAAe,GAQtB,EAAK,QAAQ,UAAU,eAAiB,UAAY,CAClD,KAAK,SAAW,EAAK,SAAS,UAC5B,OAAO,KAAK,KAAK,eAAe,SAYpC,EAAK,QAAQ,UAAU,MAAQ,UAAY,CACzC,YAAK,+BACL,KAAK,qBACL,KAAK,iBAEE,GAAI,GAAK,MAAM,CACpB,cAAe,KAAK,cACpB,aAAc,KAAK,aACnB,SAAU,KAAK,SACf,OAAQ,OAAO,KAAK,KAAK,SACzB,SAAU,KAAK,kBAkBnB,EAAK,QAAQ,UAAU,IAAM,SAAU,EAAI,CACzC,GAAI,GAAO,MAAM,UAAU,MAAM,KAAK,UAAW,GACjD,EAAK,QAAQ,MACb,EAAG,MAAM,KAAM,IAcjB,EAAK,UAAY,SAAU,EAAM,EAAO,EAAU,CAShD,OARI,GAAiB,OAAO,OAAO,MAC/B,EAAe,OAAO,KAAK,GAAY,IAOlC,EAAI,EAAG,EAAI,EAAa,OAAQ,IAAK,CAC5C,GAAI,GAAM,EAAa,GACvB,EAAe,GAAO,EAAS,GAAK,QAGtC,KAAK,SAAW,OAAO,OAAO,MAE1B,IAAS,QACX,MAAK,SAAS,GAAQ,OAAO,OAAO,MACpC,KAAK,SAAS,GAAM,GAAS,IAajC,EAAK,UAAU,UAAU,QAAU,SAAU,EAAgB,CAG3D,OAFI,GAAQ,OAAO,KAAK,EAAe,UAE9B,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,GAAI,GAAO,EAAM,GACb,EAAS,OAAO,KAAK,EAAe,SAAS,IAEjD,AAAI,KAAK,SAAS,IAAS,MACzB,MAAK,SAAS,GAAQ,OAAO,OAAO,OAGtC,OAAS,GAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,GAAI,GAAQ,EAAO,GACf,EAAO,OAAO,KAAK,EAAe,SAAS,GAAM,IAErD,AAAI,KAAK,SAAS,GAAM,IAAU,MAChC,MAAK,SAAS,GAAM,GAAS,OAAO,OAAO,OAG7C,OAAS,GAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CACpC,GAAI,GAAM,EAAK,GAEf,AAAI,KAAK,SAAS,GAAM,GAAO,IAAQ,KACrC,KAAK,SAAS,GAAM,GAAO,GAAO,EAAe,SAAS,GAAM,GAAO,GAEvE,KAAK,SAAS,GAAM,GAAO,GAAO,KAAK,SAAS,GAAM,GAAO,GAAK,OAAO,EAAe,SAAS,GAAM,GAAO,QAexH,EAAK,UAAU,UAAU,IAAM,SAAU,EAAM,EAAO,EAAU,CAC9D,GAAI,CAAE,KAAQ,MAAK,UAAW,CAC5B,KAAK,SAAS,GAAQ,OAAO,OAAO,MACpC,KAAK,SAAS,GAAM,GAAS,EAC7B,OAGF,GAAI,CAAE,KAAS,MAAK,SAAS,IAAQ,CACnC,KAAK,SAAS,GAAM,GAAS,EAC7B,OAKF,OAFI,GAAe,OAAO,KAAK,GAEtB,EAAI,EAAG,EAAI,EAAa,OAAQ,IAAK,CAC5C,GAAI,GAAM,EAAa,GAEvB,AAAI,IAAO,MAAK,SAAS,GAAM,GAC7B,KAAK,SAAS,GAAM,GAAO,GAAO,KAAK,SAAS,GAAM,GAAO,GAAK,OAAO,EAAS,IAElF,KAAK,SAAS,GAAM,GAAO,GAAO,EAAS,KAejD,EAAK,MAAQ,SAAU,EAAW,CAChC,KAAK,QAAU,GACf,KAAK,UAAY,GA2BnB,EAAK,MAAM,SAAW,GAAI,QAAQ,KAClC,EAAK,MAAM,SAAS,KAAO,EAC3B,EAAK,MAAM,SAAS,QAAU,EAC9B,EAAK,MAAM,SAAS,SAAW,EAa/B,EAAK,MAAM,SAAW,CAIpB,SAAU,EAMV,SAAU,EAMV,WAAY,GA0Bd,EAAK,MAAM,UAAU,OAAS,SAAU,EAAQ,CAC9C,MAAM,UAAY,IAChB,GAAO,OAAS,KAAK,WAGjB,SAAW,IACf,GAAO,MAAQ,GAGX,eAAiB,IACrB,GAAO,YAAc,IAGjB,YAAc,IAClB,GAAO,SAAW,EAAK,MAAM,SAAS,MAGnC,EAAO,SAAW,EAAK,MAAM,SAAS,SAAa,EAAO,KAAK,OAAO,IAAM,EAAK,MAAM,UAC1F,GAAO,KAAO,IAAM,EAAO,MAGxB,EAAO,SAAW,EAAK,MAAM,SAAS,UAAc,EAAO,KAAK,MAAM,KAAO,EAAK,MAAM,UAC3F,GAAO,KAAO,GAAK,EAAO,KAAO,KAG7B,YAAc,IAClB,GAAO,SAAW,EAAK,MAAM,SAAS,UAGxC,KAAK,QAAQ,KAAK,GAEX,MAUT,EAAK,MAAM,UAAU,UAAY,UAAY,CAC3C,OAAS,GAAI,EAAG,EAAI,KAAK,QAAQ,OAAQ,IACvC,GAAI,KAAK,QAAQ,GAAG,UAAY,EAAK,MAAM,SAAS,WAClD,MAAO,GAIX,MAAO,IA6BT,EAAK,MAAM,UAAU,KAAO,SAAU,EAAM,EAAS,CACnD,GAAI,MAAM,QAAQ,GAChB,SAAK,QAAQ,SAAU,EAAG,CAAE,KAAK,KAAK,EAAG,EAAK,MAAM,MAAM,KAAa,MAChE,KAGT,GAAI,GAAS,GAAW,GACxB,SAAO,KAAO,EAAK,WAEnB,KAAK,OAAO,GAEL,MAET,EAAK,gBAAkB,SAAU,EAAS,EAAO,EAAK,CACpD,KAAK,KAAO,kBACZ,KAAK,QAAU,EACf,KAAK,MAAQ,EACb,KAAK,IAAM,GAGb,EAAK,gBAAgB,UAAY,GAAI,OACrC,EAAK,WAAa,SAAU,EAAK,CAC/B,KAAK,QAAU,GACf,KAAK,IAAM,EACX,KAAK,OAAS,EAAI,OAClB,KAAK,IAAM,EACX,KAAK,MAAQ,EACb,KAAK,oBAAsB,IAG7B,EAAK,WAAW,UAAU,IAAM,UAAY,CAG1C,OAFI,GAAQ,EAAK,WAAW,QAErB,GACL,EAAQ,EAAM,OAIlB,EAAK,WAAW,UAAU,YAAc,UAAY,CAKlD,OAJI,GAAY,GACZ,EAAa,KAAK,MAClB,EAAW,KAAK,IAEX,EAAI,EAAG,EAAI,KAAK,oBAAoB,OAAQ,IACnD,EAAW,KAAK,oBAAoB,GACpC,EAAU,KAAK,KAAK,IAAI,MAAM,EAAY,IAC1C,EAAa,EAAW,EAG1B,SAAU,KAAK,KAAK,IAAI,MAAM,EAAY,KAAK,MAC/C,KAAK,oBAAoB,OAAS,EAE3B,EAAU,KAAK,KAGxB,EAAK,WAAW,UAAU,KAAO,SAAU,EAAM,CAC/C,KAAK,QAAQ,KAAK,CAChB,KAAM,EACN,IAAK,KAAK,cACV,MAAO,KAAK,MACZ,IAAK,KAAK,MAGZ,KAAK,MAAQ,KAAK,KAGpB,EAAK,WAAW,UAAU,gBAAkB,UAAY,CACtD,KAAK,oBAAoB,KAAK,KAAK,IAAM,GACzC,KAAK,KAAO,GAGd,EAAK,WAAW,UAAU,KAAO,UAAY,CAC3C,GAAI,KAAK,KAAO,KAAK,OACnB,MAAO,GAAK,WAAW,IAGzB,GAAI,GAAO,KAAK,IAAI,OAAO,KAAK,KAChC,YAAK,KAAO,EACL,GAGT,EAAK,WAAW,UAAU,MAAQ,UAAY,CAC5C,MAAO,MAAK,IAAM,KAAK,OAGzB,EAAK,WAAW,UAAU,OAAS,UAAY,CAC7C,AAAI,KAAK,OAAS,KAAK,KACrB,MAAK,KAAO,GAGd,KAAK,MAAQ,KAAK,KAGpB,EAAK,WAAW,UAAU,OAAS,UAAY,CAC7C,KAAK,KAAO,GAGd,EAAK,WAAW,UAAU,eAAiB,UAAY,CACrD,GAAI,GAAM,EAEV,EACE,GAAO,KAAK,OACZ,EAAW,EAAK,WAAW,SACpB,EAAW,IAAM,EAAW,IAErC,AAAI,GAAQ,EAAK,WAAW,KAC1B,KAAK,UAIT,EAAK,WAAW,UAAU,KAAO,UAAY,CAC3C,MAAO,MAAK,IAAM,KAAK,QAGzB,EAAK,WAAW,IAAM,MACtB,EAAK,WAAW,MAAQ,QACxB,EAAK,WAAW,KAAO,OACvB,EAAK,WAAW,cAAgB,gBAChC,EAAK,WAAW,MAAQ,QACxB,EAAK,WAAW,SAAW,WAE3B,EAAK,WAAW,SAAW,SAAU,EAAO,CAC1C,SAAM,SACN,EAAM,KAAK,EAAK,WAAW,OAC3B,EAAM,SACC,EAAK,WAAW,SAGzB,EAAK,WAAW,QAAU,SAAU,EAAO,CAQzC,GAPI,EAAM,QAAU,GAClB,GAAM,SACN,EAAM,KAAK,EAAK,WAAW,OAG7B,EAAM,SAEF,EAAM,OACR,MAAO,GAAK,WAAW,SAI3B,EAAK,WAAW,gBAAkB,SAAU,EAAO,CACjD,SAAM,SACN,EAAM,iBACN,EAAM,KAAK,EAAK,WAAW,eACpB,EAAK,WAAW,SAGzB,EAAK,WAAW,SAAW,SAAU,EAAO,CAC1C,SAAM,SACN,EAAM,iBACN,EAAM,KAAK,EAAK,WAAW,OACpB,EAAK,WAAW,SAGzB,EAAK,WAAW,OAAS,SAAU,EAAO,CACxC,AAAI,EAAM,QAAU,GAClB,EAAM,KAAK,EAAK,WAAW,OAe/B,EAAK,WAAW,cAAgB,EAAK,UAAU,UAE/C,EAAK,WAAW,QAAU,SAAU,EAAO,CACzC,OAAa,CACX,GAAI,GAAO,EAAM,OAEjB,GAAI,GAAQ,EAAK,WAAW,IAC1B,MAAO,GAAK,WAAW,OAIzB,GAAI,EAAK,WAAW,IAAM,GAAI,CAC5B,EAAM,kBACN,SAGF,GAAI,GAAQ,IACV,MAAO,GAAK,WAAW,SAGzB,GAAI,GAAQ,IACV,SAAM,SACF,EAAM,QAAU,GAClB,EAAM,KAAK,EAAK,WAAW,MAEtB,EAAK,WAAW,gBAGzB,GAAI,GAAQ,IACV,SAAM,SACF,EAAM,QAAU,GAClB,EAAM,KAAK,EAAK,WAAW,MAEtB,EAAK,WAAW,SAczB,GARI,GAAQ,KAAO,EAAM,UAAY,GAQjC,GAAQ,KAAO,EAAM,UAAY,EACnC,SAAM,KAAK,EAAK,WAAW,UACpB,EAAK,WAAW,QAGzB,GAAI,EAAK,MAAM,EAAK,WAAW,eAC7B,MAAO,GAAK,WAAW,UAK7B,EAAK,YAAc,SAAU,EAAK,EAAO,CACvC,KAAK,MAAQ,GAAI,GAAK,WAAY,GAClC,KAAK,MAAQ,EACb,KAAK,cAAgB,GACrB,KAAK,UAAY,GAGnB,EAAK,YAAY,UAAU,MAAQ,UAAY,CAC7C,KAAK,MAAM,MACX,KAAK,QAAU,KAAK,MAAM,QAI1B,OAFI,GAAQ,EAAK,YAAY,YAEtB,GACL,EAAQ,EAAM,MAGhB,MAAO,MAAK,OAGd,EAAK,YAAY,UAAU,WAAa,UAAY,CAClD,MAAO,MAAK,QAAQ,KAAK,YAG3B,EAAK,YAAY,UAAU,cAAgB,UAAY,CACrD,GAAI,GAAS,KAAK,aAClB,YAAK,WAAa,EACX,GAGT,EAAK,YAAY,UAAU,WAAa,UAAY,CAClD,GAAI,GAAkB,KAAK,cAC3B,KAAK,MAAM,OAAO,GAClB,KAAK,cAAgB,IAGvB,EAAK,YAAY,YAAc,SAAU,EAAQ,CAC/C,GAAI,GAAS,EAAO,aAEpB,GAAI,GAAU,KAId,OAAQ,EAAO,UACR,GAAK,WAAW,SACnB,MAAO,GAAK,YAAY,kBACrB,GAAK,WAAW,MACnB,MAAO,GAAK,YAAY,eACrB,GAAK,WAAW,KACnB,MAAO,GAAK,YAAY,kBAExB,GAAI,GAAe,4CAA8C,EAAO,KAExE,KAAI,GAAO,IAAI,QAAU,GACvB,IAAgB,gBAAkB,EAAO,IAAM,KAG3C,GAAI,GAAK,gBAAiB,EAAc,EAAO,MAAO,EAAO,OAIzE,EAAK,YAAY,cAAgB,SAAU,EAAQ,CACjD,GAAI,GAAS,EAAO,gBAEpB,GAAI,GAAU,KAId,QAAQ,EAAO,SACR,IACH,EAAO,cAAc,SAAW,EAAK,MAAM,SAAS,WACpD,UACG,IACH,EAAO,cAAc,SAAW,EAAK,MAAM,SAAS,SACpD,cAEA,GAAI,GAAe,kCAAoC,EAAO,IAAM,IACpE,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAO,MAAO,EAAO,KAGvE,GAAI,GAAa,EAAO,aAExB,GAAI,GAAc,KAAW,CAC3B,GAAI,GAAe,yCACnB,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAO,MAAO,EAAO,KAGrE,OAAQ,EAAW,UACZ,GAAK,WAAW,MACnB,MAAO,GAAK,YAAY,eACrB,GAAK,WAAW,KACnB,MAAO,GAAK,YAAY,kBAExB,GAAI,GAAe,mCAAqC,EAAW,KAAO,IAC1E,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAW,MAAO,EAAW,QAIjF,EAAK,YAAY,WAAa,SAAU,EAAQ,CAC9C,GAAI,GAAS,EAAO,gBAEpB,GAAI,GAAU,KAId,IAAI,EAAO,MAAM,UAAU,QAAQ,EAAO,MAAQ,GAAI,CACpD,GAAI,GAAiB,EAAO,MAAM,UAAU,IAAI,SAAU,EAAG,CAAE,MAAO,IAAM,EAAI,MAAO,KAAK,MACxF,EAAe,uBAAyB,EAAO,IAAM,uBAAyB,EAElF,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAO,MAAO,EAAO,KAGrE,EAAO,cAAc,OAAS,CAAC,EAAO,KAEtC,GAAI,GAAa,EAAO,aAExB,GAAI,GAAc,KAAW,CAC3B,GAAI,GAAe,gCACnB,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAO,MAAO,EAAO,KAGrE,OAAQ,EAAW,UACZ,GAAK,WAAW,KACnB,MAAO,GAAK,YAAY,kBAExB,GAAI,GAAe,0BAA4B,EAAW,KAAO,IACjE,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAW,MAAO,EAAW,QAIjF,EAAK,YAAY,UAAY,SAAU,EAAQ,CAC7C,GAAI,GAAS,EAAO,gBAEpB,GAAI,GAAU,KAId,GAAO,cAAc,KAAO,EAAO,IAAI,cAEnC,EAAO,IAAI,QAAQ,MAAQ,IAC7B,GAAO,cAAc,YAAc,IAGrC,GAAI,GAAa,EAAO,aAExB,GAAI,GAAc,KAAW,CAC3B,EAAO,aACP,OAGF,OAAQ,EAAW,UACZ,GAAK,WAAW,KACnB,SAAO,aACA,EAAK,YAAY,cACrB,GAAK,WAAW,MACnB,SAAO,aACA,EAAK,YAAY,eACrB,GAAK,WAAW,cACnB,MAAO,GAAK,YAAY,sBACrB,GAAK,WAAW,MACnB,MAAO,GAAK,YAAY,eACrB,GAAK,WAAW,SACnB,SAAO,aACA,EAAK,YAAY,sBAExB,GAAI,GAAe,2BAA6B,EAAW,KAAO,IAClE,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAW,MAAO,EAAW,QAIjF,EAAK,YAAY,kBAAoB,SAAU,EAAQ,CACrD,GAAI,GAAS,EAAO,gBAEpB,GAAI,GAAU,KAId,IAAI,GAAe,SAAS,EAAO,IAAK,IAExC,GAAI,MAAM,GAAe,CACvB,GAAI,GAAe,gCACnB,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAO,MAAO,EAAO,KAGrE,EAAO,cAAc,aAAe,EAEpC,GAAI,GAAa,EAAO,aAExB,GAAI,GAAc,KAAW,CAC3B,EAAO,aACP,OAGF,OAAQ,EAAW,UACZ,GAAK,WAAW,KACnB,SAAO,aACA,EAAK,YAAY,cACrB,GAAK,WAAW,MACnB,SAAO,aACA,EAAK,YAAY,eACrB,GAAK,WAAW,cACnB,MAAO,GAAK,YAAY,sBACrB,GAAK,WAAW,MACnB,MAAO,GAAK,YAAY,eACrB,GAAK,WAAW,SACnB,SAAO,aACA,EAAK,YAAY,sBAExB,GAAI,GAAe,2BAA6B,EAAW,KAAO,IAClE,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAW,MAAO,EAAW,QAIjF,EAAK,YAAY,WAAa,SAAU,EAAQ,CAC9C,GAAI,GAAS,EAAO,gBAEpB,GAAI,GAAU,KAId,IAAI,GAAQ,SAAS,EAAO,IAAK,IAEjC,GAAI,MAAM,GAAQ,CAChB,GAAI,GAAe,wBACnB,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAO,MAAO,EAAO,KAGrE,EAAO,cAAc,MAAQ,EAE7B,GAAI,GAAa,EAAO,aAExB,GAAI,GAAc,KAAW,CAC3B,EAAO,aACP,OAGF,OAAQ,EAAW,UACZ,GAAK,WAAW,KACnB,SAAO,aACA,EAAK,YAAY,cACrB,GAAK,WAAW,MACnB,SAAO,aACA,EAAK,YAAY,eACrB,GAAK,WAAW,cACnB,MAAO,GAAK,YAAY,sBACrB,GAAK,WAAW,MACnB,MAAO,GAAK,YAAY,eACrB,GAAK,WAAW,SACnB,SAAO,aACA,EAAK,YAAY,sBAExB,GAAI,GAAe,2BAA6B,EAAW,KAAO,IAClE,KAAM,IAAI,GAAK,gBAAiB,EAAc,EAAW,MAAO,EAAW,QAQ7E,SAAU,EAAM,EAAS,CACzB,AAAI,MAAO,SAAW,YAAc,OAAO,IAEzC,OAAO,GACF,AAAI,MAAO,IAAY,SAM5B,GAAO,QAAU,IAGjB,EAAK,KAAO,KAEd,KAAM,UAAY,CAMlB,MAAO,WCh5GX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GAeA,GAAI,IAAkB,UAOtB,GAAO,QAAU,GAUjB,YAAoB,EAAQ,CAC1B,GAAI,GAAM,GAAK,EACX,EAAQ,GAAgB,KAAK,GAEjC,GAAI,CAAC,EACH,MAAO,GAGT,GAAI,GACA,EAAO,GACP,EAAQ,EACR,EAAY,EAEhB,IAAK,EAAQ,EAAM,MAAO,EAAQ,EAAI,OAAQ,IAAS,CACrD,OAAQ,EAAI,WAAW,QAChB,IACH,EAAS,SACT,UACG,IACH,EAAS,QACT,UACG,IACH,EAAS,QACT,UACG,IACH,EAAS,OACT,UACG,IACH,EAAS,OACT,cAEA,SAGJ,AAAI,IAAc,GAChB,IAAQ,EAAI,UAAU,EAAW,IAGnC,EAAY,EAAQ,EACpB,GAAQ,EAGV,MAAO,KAAc,EACjB,EAAO,EAAI,UAAU,EAAW,GAChC,KCtDN,OAAiB,QCKjB,AAAK,OAAO,SACV,QAAO,QAAU,SAAU,EAAa,CACtC,GAAM,GAA2B,GACjC,OAAW,KAAO,QAAO,KAAK,GAE5B,EAAK,KAAK,CAAC,EAAK,EAAI,KAGtB,MAAO,KAIX,AAAK,OAAO,QACV,QAAO,OAAS,SAAU,EAAa,CACrC,GAAM,GAAiB,GACvB,OAAW,KAAO,QAAO,KAAK,GAE5B,EAAK,KAAK,EAAI,IAGhB,MAAO,KAMX,AAAI,MAAO,UAAY,aAGhB,SAAQ,UAAU,UACrB,SAAQ,UAAU,SAAW,SAC3B,EAA8B,EACxB,CACN,AAAI,MAAO,IAAM,SACf,MAAK,WAAa,EAAE,KACpB,KAAK,UAAY,EAAE,KAEnB,MAAK,WAAa,EAClB,KAAK,UAAY,KAKlB,QAAQ,UAAU,aACrB,SAAQ,UAAU,YAAc,YAC3B,EACG,CACN,GAAM,GAAS,KAAK,WACpB,GAAI,EAAQ,CACV,AAAI,EAAM,SAAW,GACnB,EAAO,YAAY,MAGrB,OAAS,GAAI,EAAM,OAAS,EAAG,GAAK,EAAG,IAAK,CAC1C,GAAI,GAAO,EAAM,GACjB,AAAI,MAAO,IAAS,SAClB,EAAO,SAAS,eAAe,GACxB,EAAK,YACZ,EAAK,WAAW,YAAY,GAG9B,AAAK,EAGH,EAAO,aAAa,KAAK,gBAAkB,GAF3C,EAAO,aAAa,EAAM,WCnEtC,OAAuB,OAiChB,YACL,EACmB,CACnB,GAAM,GAAY,GAAI,KAChB,EAAY,GAAI,KACtB,OAAW,KAAO,GAAM,CACtB,GAAM,CAAC,EAAM,GAAQ,EAAI,SAAS,MAAM,KAGlC,EAAW,EAAI,SACf,EAAW,EAAI,MAGf,EAAO,eAAW,EAAI,MACzB,QAAQ,mBAAoB,IAC5B,QAAQ,OAAQ,KAGnB,GAAI,EAAM,CACR,GAAM,GAAS,EAAU,IAAI,GAG7B,AAAK,EAAQ,IAAI,GASf,EAAU,IAAI,EAAU,CACtB,WACA,QACA,OACA,WAZF,GAAO,MAAQ,EAAI,MACnB,EAAO,KAAQ,EAGf,EAAQ,IAAI,QAcd,GAAU,IAAI,EAAU,CACtB,WACA,QACA,SAIN,MAAO,GCjFT,OAAuB,OAsChB,YACL,EAA2B,EACD,CAC1B,GAAM,GAAY,GAAI,QAAO,EAAO,UAAW,OACzC,EAAY,CAAC,EAAY,EAAc,IACpC,GAAG,4BAA+B,WAI3C,MAAO,AAAC,IAAkB,CACxB,EAAQ,EACL,QAAQ,gBAAiB,KACzB,OAGH,GAAM,GAAQ,GAAI,QAAO,MAAM,EAAO,cACpC,EACG,QAAQ,uBAAwB,QAChC,QAAQ,EAAW,QACnB,OAGL,MAAO,IACL,GACI,eAAW,GACX,GAED,QAAQ,EAAO,GACf,QAAQ,8BAA+B,OCpCzC,YACL,EACqB,CACrB,GAAM,GAAS,GAAK,MAAa,MAAM,CAAC,QAAS,SAIjD,MAHe,IAAK,MAAa,YAAY,EAAO,GAG7C,QACA,EAAM,QAWR,YACL,EAA4B,EACV,CAzEpB,MA0EE,GAAM,GAAU,GAAI,KAAuB,GAGrC,EAA2B,GACjC,OAAS,GAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,OAAW,KAAU,GACnB,AAAI,EAAM,GAAG,WAAW,EAAO,OAC7B,GAAO,EAAO,MAAQ,GACtB,EAAQ,OAAO,IAIrB,OAAW,KAAU,GACnB,AAAI,SAAK,iBAAL,wBAAsB,EAAO,QAC/B,GAAO,EAAO,MAAQ,IAG1B,MAAO,GC0BT,YAAoB,EAAa,EAAuB,CACtD,GAAM,CAAC,EAAG,GAAK,CAAC,GAAI,KAAI,GAAI,GAAI,KAAI,IACpC,MAAO,CACL,GAAG,GAAI,KAAI,CAAC,GAAG,GAAG,OAAO,GAAS,CAAC,EAAE,IAAI,MAWtC,WAAa,CAgCX,YAAY,CAAE,SAAQ,OAAM,WAAwB,CACzD,KAAK,QAAU,EAGf,KAAK,UAAY,GAAuB,GACxC,KAAK,UAAY,GAAuB,EAAQ,IAGhD,KAAK,UAAU,UAAY,GAAI,QAAO,EAAO,WAG7C,KAAK,MAAQ,KAAK,UAAY,CAG5B,AAAI,EAAO,KAAK,SAAW,GAAK,EAAO,KAAK,KAAO,KACjD,KAAK,IAAK,KAAa,EAAO,KAAK,KAC1B,EAAO,KAAK,OAAS,GAC9B,KAAK,IAAK,KAAa,cAAc,GAAG,EAAO,OAIjD,GAAM,GAAM,GAAW,CACrB,UAAW,iBAAkB,WAC5B,EAAQ,UAGX,OAAW,KAAQ,GAAO,KAAK,IAAI,GACjC,IAAa,KAAO,KAAQ,KAAa,IAEzC,OAAW,KAAM,GACf,KAAK,SAAS,OAAO,EAAK,IAC1B,KAAK,eAAe,OAAO,EAAK,IAKpC,KAAK,IAAI,YAGT,KAAK,MAAM,QAAS,CAAE,MAAO,MAC7B,KAAK,MAAM,QAGX,OAAW,KAAO,GAChB,KAAK,IAAI,KAoBR,OAAO,EAA6B,CACzC,GAAI,EACF,GAAI,CACF,GAAM,GAAY,KAAK,UAAU,GAG3B,EAAU,GAAiB,GAC9B,OAAO,GACN,EAAO,WAAa,KAAK,MAAM,SAAS,YAItC,EAAS,KAAK,MAAM,OAAO,GAAG,MAGjC,OAAyB,CAAC,EAAM,CAAE,MAAK,QAAO,eAAgB,CAC7D,GAAM,GAAW,KAAK,UAAU,IAAI,GACpC,GAAI,MAAO,IAAa,YAAa,CACnC,GAAM,CAAE,WAAU,QAAO,OAAM,UAAW,EAGpC,EAAQ,GACZ,EACA,OAAO,KAAK,EAAU,WAIlB,EAAQ,CAAC,CAAC,EAAS,EAAC,OAAO,OAAO,GAAO,MAAM,GAAK,GAC1D,EAAK,KAAK,CACR,WACA,MAAO,EAAU,GACjB,KAAO,EAAU,GACjB,MAAO,EAAS,GAAI,GACpB,UAGJ,MAAO,IACN,IAGF,KAAK,CAAC,EAAG,IAAM,EAAE,MAAQ,EAAE,OAG3B,OAAO,CAAC,EAAO,IAAW,CACzB,GAAM,GAAW,KAAK,UAAU,IAAI,EAAO,UAC3C,GAAI,MAAO,IAAa,YAAa,CACnC,GAAM,GAAM,UAAY,GACpB,EAAS,OAAQ,SACjB,EAAS,SACb,EAAM,IAAI,EAAK,CAAC,GAAG,EAAM,IAAI,IAAQ,GAAI,IAE3C,MAAO,IACN,GAAI,MAGL,EACJ,GAAI,KAAK,QAAQ,YAAa,CAC5B,GAAM,GAAS,KAAK,MAAM,MAAM,GAAW,CACzC,OAAW,KAAU,GACnB,EAAQ,KAAK,EAAO,KAAM,CACxB,OAAQ,CAAC,SACT,SAAU,KAAK,MAAM,SAAS,SAC9B,SAAU,KAAK,MAAM,SAAS,aAKpC,EAAc,EAAO,OACjB,OAAO,KAAK,EAAO,GAAG,UAAU,UAChC,GAIN,MAAO,IACL,MAAO,CAAC,GAAG,EAAO,WACf,MAAO,IAAgB,aAAe,CAAE,sBAIvC,EAAN,CACA,QAAQ,KAAK,kBAAkB,uCAKnC,MAAO,CAAE,MAAO,ML/PpB,GAAI,GAqBJ,YACE,EACe,gCACf,GAAI,GAAO,UAGX,GAAI,MAAO,SAAW,aAAe,gBAAkB,QAAQ,CAC7D,GAAM,GAAS,SAAS,cAAiC,eACnD,CAAC,GAAQ,EAAO,IAAI,MAAM,WAGhC,EAAO,EAAK,QAAQ,KAAM,GAI5B,GAAM,GAAU,GAChB,OAAW,KAAQ,GAAO,KAAM,CAC9B,OAAQ,OAGD,KACH,EAAQ,KAAK,GAAG,gBAChB,UAGG,SACA,KACH,EAAQ,KAAK,GAAG,gBAChB,MAIJ,AAAI,IAAS,MACX,EAAQ,KAAK,GAAG,cAAiB,YAIrC,AAAI,EAAO,KAAK,OAAS,GACvB,EAAQ,KAAK,GAAG,2BAGd,EAAQ,QACV,MAAM,eACJ,GAAG,oCACH,GAAG,MAeT,YACE,EACwB,gCACxB,OAAQ,EAAQ,UAGT,GACH,YAAM,IAAqB,EAAQ,KAAK,QACxC,EAAQ,GAAI,GAAO,EAAQ,MACpB,CACL,KAAM,OAIL,GACH,MAAO,CACL,KAAM,EACN,KAAM,EAAQ,EAAM,OAAO,EAAQ,MAAQ,CAAE,MAAO,aAKtD,KAAM,IAAI,WAAU,2BAS1B,KAAK,KAAO,WAGZ,iBAAiB,UAAW,AAAM,GAAM,0BACtC,YAAY,KAAM,IAAQ,EAAG", + "names": [] +} diff --git a/assets/stylesheets/main.50e68009.min.css b/assets/stylesheets/main.50e68009.min.css new file mode 100644 index 00000000..6874a7c6 --- /dev/null +++ b/assets/stylesheets/main.50e68009.min.css @@ -0,0 +1 @@ +@charset "UTF-8";html{-webkit-text-size-adjust:none;-moz-text-size-adjust:none;-ms-text-size-adjust:none;text-size-adjust:none;box-sizing:border-box}*,:after,:before{box-sizing:inherit}@media (prefers-reduced-motion){*,:after,:before{transition:none!important}}body{margin:0}a,button,input,label{-webkit-tap-highlight-color:transparent}a{color:inherit;text-decoration:none}hr{border:0;box-sizing:content-box;display:block;height:.05rem;overflow:visible;padding:0}small{font-size:80%}sub,sup{line-height:1em}img{border-style:none}table{border-collapse:separate;border-spacing:0}td,th{font-weight:400;vertical-align:top}button{background:transparent;border:0;font-family:inherit;font-size:inherit;margin:0;padding:0}input{border:0;outline:none}:root{--md-default-fg-color:rgba(0,0,0,.87);--md-default-fg-color--light:rgba(0,0,0,.54);--md-default-fg-color--lighter:rgba(0,0,0,.32);--md-default-fg-color--lightest:rgba(0,0,0,.07);--md-default-bg-color:#fff;--md-default-bg-color--light:hsla(0,0%,100%,.7);--md-default-bg-color--lighter:hsla(0,0%,100%,.3);--md-default-bg-color--lightest:hsla(0,0%,100%,.12);--md-primary-fg-color:#4051b5;--md-primary-fg-color--light:#5d6cc0;--md-primary-fg-color--dark:#303fa1;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7);--md-accent-fg-color:#526cfe;--md-accent-fg-color--transparent:rgba(82,108,254,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7);--md-shadow-z1:0 0.2rem 0.5rem rgba(0,0,0,.05),0 0 0.05rem rgba(0,0,0,.1);--md-shadow-z2:0 0.2rem 0.5rem rgba(0,0,0,.1),0 0 0.05rem rgba(0,0,0,.25);--md-shadow-z3:0 0.2rem 0.5rem rgba(0,0,0,.2),0 0 0.05rem rgba(0,0,0,.35)}:root>*{--md-code-fg-color:#36464e;--md-code-bg-color:#f5f5f5;--md-code-hl-color:rgba(255,255,0,.5);--md-code-hl-number-color:#d52a2a;--md-code-hl-special-color:#db1457;--md-code-hl-function-color:#a846b9;--md-code-hl-constant-color:#6e59d9;--md-code-hl-keyword-color:#3f6ec6;--md-code-hl-string-color:#1c7d4d;--md-code-hl-name-color:var(--md-code-fg-color);--md-code-hl-operator-color:var(--md-default-fg-color--light);--md-code-hl-punctuation-color:var(--md-default-fg-color--light);--md-code-hl-comment-color:var(--md-default-fg-color--light);--md-code-hl-generic-color:var(--md-default-fg-color--light);--md-code-hl-variable-color:var(--md-default-fg-color--light);--md-typeset-color:var(--md-default-fg-color);--md-typeset-a-color:var(--md-primary-fg-color);--md-typeset-mark-color:rgba(255,255,0,.5);--md-typeset-del-color:rgba(245,80,61,.15);--md-typeset-ins-color:rgba(11,213,112,.15);--md-typeset-kbd-color:#fafafa;--md-typeset-kbd-accent-color:#fff;--md-typeset-kbd-border-color:#b8b8b8;--md-typeset-table-color:rgba(0,0,0,.12);--md-admonition-fg-color:var(--md-default-fg-color);--md-admonition-bg-color:var(--md-default-bg-color);--md-footer-fg-color:#fff;--md-footer-fg-color--light:hsla(0,0%,100%,.7);--md-footer-fg-color--lighter:hsla(0,0%,100%,.3);--md-footer-bg-color:rgba(0,0,0,.87);--md-footer-bg-color--dark:rgba(0,0,0,.32)}.md-icon svg{fill:currentcolor;display:block;height:1.2rem;width:1.2rem}body{-webkit-font-smoothing:antialiased;-moz-osx-font-smoothing:grayscale;--md-text-font-family:var(--md-text-font,_),-apple-system,BlinkMacSystemFont,Helvetica,Arial,sans-serif;--md-code-font-family:var(--md-code-font,_),SFMono-Regular,Consolas,Menlo,monospace}body,input{font-feature-settings:"kern","liga";font-family:var(--md-text-font-family)}body,code,input,kbd,pre{color:var(--md-typeset-color)}code,kbd,pre{font-feature-settings:"kern";font-family:var(--md-code-font-family)}:root{--md-typeset-table-sort-icon:url('data:image/svg+xml;charset=utf-8,');--md-typeset-table-sort-icon--asc:url('data:image/svg+xml;charset=utf-8,');--md-typeset-table-sort-icon--desc:url('data:image/svg+xml;charset=utf-8,')}.md-typeset{-webkit-print-color-adjust:exact;color-adjust:exact;font-size:.8rem;line-height:1.6}@media print{.md-typeset{font-size:.68rem}}.md-typeset blockquote,.md-typeset dl,.md-typeset figure,.md-typeset ol,.md-typeset pre,.md-typeset ul{margin-bottom:1em;margin-top:1em}.md-typeset h1{color:var(--md-default-fg-color--light);font-size:2em;line-height:1.3;margin:0 0 1.25em}.md-typeset h1,.md-typeset h2{font-weight:300;letter-spacing:-.01em}.md-typeset h2{font-size:1.5625em;line-height:1.4;margin:1.6em 0 .64em}.md-typeset h3{font-size:1.25em;font-weight:400;letter-spacing:-.01em;line-height:1.5;margin:1.6em 0 .8em}.md-typeset h2+h3{margin-top:.8em}.md-typeset h4{font-weight:700;letter-spacing:-.01em;margin:1em 0}.md-typeset h5,.md-typeset h6{color:var(--md-default-fg-color--light);font-size:.8em;font-weight:700;letter-spacing:-.01em;margin:1.25em 0}.md-typeset h5{text-transform:uppercase}.md-typeset hr{border-bottom:.05rem solid var(--md-default-fg-color--lightest);display:flow-root;margin:1.5em 0}.md-typeset a{color:var(--md-typeset-a-color);word-break:break-word}.md-typeset a,.md-typeset a:before{transition:color 125ms}.md-typeset a:focus,.md-typeset a:hover{color:var(--md-accent-fg-color)}.md-typeset a.focus-visible{outline-color:var(--md-accent-fg-color);outline-offset:.2rem}.md-typeset code,.md-typeset kbd,.md-typeset pre{color:var(--md-code-fg-color);direction:ltr}@media print{.md-typeset code,.md-typeset kbd,.md-typeset pre{white-space:pre-wrap}}.md-typeset code{background-color:var(--md-code-bg-color);border-radius:.1rem;-webkit-box-decoration-break:clone;box-decoration-break:clone;font-size:.85em;padding:0 .2941176471em;word-break:break-word}.md-typeset code:not(.focus-visible){-webkit-tap-highlight-color:transparent;outline:none}.md-typeset a code{color:currentcolor}.md-typeset pre{display:flow-root;line-height:1.4;position:relative}.md-typeset pre>code{-webkit-box-decoration-break:slice;box-decoration-break:slice;box-shadow:none;display:block;margin:0;outline-color:var(--md-accent-fg-color);overflow:auto;padding:.7720588235em 1.1764705882em;scrollbar-color:var(--md-default-fg-color--lighter) transparent;scrollbar-width:thin;touch-action:auto;word-break:normal}.md-typeset pre>code:hover{scrollbar-color:var(--md-accent-fg-color) transparent}.md-typeset pre>code::-webkit-scrollbar{height:.2rem;width:.2rem}.md-typeset pre>code::-webkit-scrollbar-thumb{background-color:var(--md-default-fg-color--lighter)}.md-typeset pre>code::-webkit-scrollbar-thumb:hover{background-color:var(--md-accent-fg-color)}.md-typeset kbd{background-color:var(--md-typeset-kbd-color);border-radius:.1rem;box-shadow:0 .1rem 0 .05rem var(--md-typeset-kbd-border-color),0 .1rem 0 var(--md-typeset-kbd-border-color),0 -.1rem .2rem var(--md-typeset-kbd-accent-color) inset;color:var(--md-default-fg-color);display:inline-block;font-size:.75em;padding:0 .6666666667em;vertical-align:text-top;word-break:break-word}.md-typeset mark{background-color:var(--md-typeset-mark-color);-webkit-box-decoration-break:clone;box-decoration-break:clone;color:inherit;word-break:break-word}.md-typeset abbr{border-bottom:.05rem dotted var(--md-default-fg-color--light);cursor:help;text-decoration:none}@media (hover:none){.md-typeset abbr{position:relative}.md-typeset abbr[title]:-webkit-any(:focus,:hover):after{background-color:var(--md-default-fg-color);border-radius:.1rem;box-shadow:var(--md-shadow-z3);color:var(--md-default-bg-color);content:attr(title);display:inline-block;font-size:.7rem;margin-top:2em;max-width:80%;min-width:-webkit-max-content;min-width:max-content;padding:.2rem .3rem;position:absolute;width:auto}.md-typeset abbr[title]:-moz-any(:focus,:hover):after{background-color:var(--md-default-fg-color);border-radius:.1rem;box-shadow:var(--md-shadow-z3);color:var(--md-default-bg-color);content:attr(title);display:inline-block;font-size:.7rem;margin-top:2em;max-width:80%;min-width:-moz-max-content;min-width:max-content;padding:.2rem .3rem;position:absolute;width:auto}[dir=ltr] .md-typeset abbr[title]:-webkit-any(:focus,:hover):after{left:0}[dir=ltr] .md-typeset abbr[title]:-moz-any(:focus,:hover):after{left:0}[dir=ltr] .md-typeset abbr[title]:is(:focus,:hover):after{left:0}[dir=rtl] .md-typeset abbr[title]:-webkit-any(:focus,:hover):after{right:0}[dir=rtl] .md-typeset abbr[title]:-moz-any(:focus,:hover):after{right:0}[dir=rtl] .md-typeset abbr[title]:is(:focus,:hover):after{right:0}.md-typeset abbr[title]:is(:focus,:hover):after{background-color:var(--md-default-fg-color);border-radius:.1rem;box-shadow:var(--md-shadow-z3);color:var(--md-default-bg-color);content:attr(title);display:inline-block;font-size:.7rem;margin-top:2em;max-width:80%;min-width:-webkit-max-content;min-width:-moz-max-content;min-width:max-content;padding:.2rem .3rem;position:absolute;width:auto}}.md-typeset small{opacity:.75}[dir=ltr] .md-typeset sub,[dir=ltr] .md-typeset sup{margin-left:.078125em}[dir=rtl] .md-typeset sub,[dir=rtl] .md-typeset sup{margin-right:.078125em}[dir=ltr] .md-typeset blockquote{padding-left:.6rem}[dir=rtl] .md-typeset blockquote{padding-right:.6rem}[dir=ltr] .md-typeset blockquote{border-left:.2rem solid var(--md-default-fg-color--lighter)}[dir=rtl] .md-typeset blockquote{border-right:.2rem solid var(--md-default-fg-color--lighter)}.md-typeset blockquote{color:var(--md-default-fg-color--light);margin-left:0;margin-right:0}.md-typeset ul{list-style-type:disc}[dir=ltr] .md-typeset ol,[dir=ltr] .md-typeset ul{margin-left:.625em}[dir=rtl] .md-typeset ol,[dir=rtl] .md-typeset ul{margin-right:.625em}.md-typeset ol,.md-typeset ul{padding:0}.md-typeset ol:not([hidden]),.md-typeset ul:not([hidden]){display:flow-root}.md-typeset ol ol,.md-typeset ul ol{list-style-type:lower-alpha}.md-typeset ol ol ol,.md-typeset ul ol ol{list-style-type:lower-roman}[dir=ltr] .md-typeset ol li,[dir=ltr] .md-typeset ul li{margin-left:1.25em}[dir=rtl] .md-typeset ol li,[dir=rtl] .md-typeset ul li{margin-right:1.25em}.md-typeset ol li,.md-typeset ul li{margin-bottom:.5em}.md-typeset ol li :-webkit-any(p,blockquote),.md-typeset ul li :-webkit-any(p,blockquote){margin:.5em 0}.md-typeset ol li :-moz-any(p,blockquote),.md-typeset ul li :-moz-any(p,blockquote){margin:.5em 0}.md-typeset ol li :is(p,blockquote),.md-typeset ul li :is(p,blockquote){margin:.5em 0}.md-typeset ol li:last-child,.md-typeset ul li:last-child{margin-bottom:0}.md-typeset ol li :-webkit-any(ul,ol),.md-typeset ul li :-webkit-any(ul,ol){margin-bottom:.5em;margin-top:.5em}.md-typeset ol li :-moz-any(ul,ol),.md-typeset ul li :-moz-any(ul,ol){margin-bottom:.5em;margin-top:.5em}[dir=ltr] .md-typeset ol li :-webkit-any(ul,ol),[dir=ltr] .md-typeset ul li :-webkit-any(ul,ol){margin-left:.625em}[dir=ltr] .md-typeset ol li :-moz-any(ul,ol),[dir=ltr] .md-typeset ul li :-moz-any(ul,ol){margin-left:.625em}[dir=ltr] .md-typeset ol li :is(ul,ol),[dir=ltr] .md-typeset ul li :is(ul,ol){margin-left:.625em}[dir=rtl] .md-typeset ol li :-webkit-any(ul,ol),[dir=rtl] .md-typeset ul li :-webkit-any(ul,ol){margin-right:.625em}[dir=rtl] .md-typeset ol li :-moz-any(ul,ol),[dir=rtl] .md-typeset ul li :-moz-any(ul,ol){margin-right:.625em}[dir=rtl] .md-typeset ol li :is(ul,ol),[dir=rtl] .md-typeset ul li :is(ul,ol){margin-right:.625em}.md-typeset ol li :is(ul,ol),.md-typeset ul li :is(ul,ol){margin-bottom:.5em;margin-top:.5em}[dir=ltr] .md-typeset dd{margin-left:1.875em}[dir=rtl] .md-typeset dd{margin-right:1.875em}.md-typeset dd{margin-bottom:1.5em;margin-top:1em}.md-typeset img,.md-typeset svg{height:auto;max-width:100%}.md-typeset img[align=left],.md-typeset svg[align=left]{margin:1em 1em 1em 0}.md-typeset img[align=right],.md-typeset svg[align=right]{margin:1em 0 1em 1em}.md-typeset img[align]:only-child,.md-typeset svg[align]:only-child{margin-top:0}.md-typeset img[src$="#only-dark"]{display:none}.md-typeset figure{display:flow-root;margin:1em auto;max-width:100%;text-align:center;width:-webkit-fit-content;width:-moz-fit-content;width:fit-content}.md-typeset figure img{display:block}.md-typeset figcaption{font-style:italic;margin:1em auto;max-width:24rem}.md-typeset iframe{max-width:100%}.md-typeset table:not([class]){background-color:var(--md-default-bg-color);border:.05rem solid var(--md-typeset-table-color);border-radius:.1rem;display:inline-block;font-size:.64rem;max-width:100%;overflow:auto;touch-action:auto}@media print{.md-typeset table:not([class]){display:table}}.md-typeset table:not([class])+*{margin-top:1.5em}.md-typeset table:not([class]) :-webkit-any(th,td)>:first-child{margin-top:0}.md-typeset table:not([class]) :-moz-any(th,td)>:first-child{margin-top:0}.md-typeset table:not([class]) :is(th,td)>:first-child{margin-top:0}.md-typeset table:not([class]) :-webkit-any(th,td)>:last-child{margin-bottom:0}.md-typeset table:not([class]) :-moz-any(th,td)>:last-child{margin-bottom:0}.md-typeset table:not([class]) :is(th,td)>:last-child{margin-bottom:0}.md-typeset table:not([class]) :-webkit-any(th,td):not([align]){text-align:left}.md-typeset table:not([class]) :-moz-any(th,td):not([align]){text-align:left}.md-typeset table:not([class]) :is(th,td):not([align]){text-align:left}[dir=rtl] .md-typeset table:not([class]) :-webkit-any(th,td):not([align]){text-align:right}[dir=rtl] .md-typeset table:not([class]) :-moz-any(th,td):not([align]){text-align:right}[dir=rtl] .md-typeset table:not([class]) :is(th,td):not([align]){text-align:right}.md-typeset table:not([class]) th{font-weight:700;min-width:5rem;padding:.9375em 1.25em;vertical-align:top}.md-typeset table:not([class]) th a{color:inherit}.md-typeset table:not([class]) td{border-top:.05rem solid var(--md-typeset-table-color);padding:.9375em 1.25em;vertical-align:top}.md-typeset table:not([class]) tbody tr{transition:background-color 125ms}.md-typeset table:not([class]) tbody tr:hover{background-color:rgba(0,0,0,.035);box-shadow:0 .05rem 0 var(--md-default-bg-color) inset}.md-typeset table:not([class]) a{word-break:normal}.md-typeset table th[role=columnheader]{cursor:pointer}[dir=ltr] .md-typeset table th[role=columnheader]:after{margin-left:.5em}[dir=rtl] .md-typeset table th[role=columnheader]:after{margin-right:.5em}.md-typeset table th[role=columnheader]:after{content:"";display:inline-block;height:1.2em;-webkit-mask-image:var(--md-typeset-table-sort-icon);mask-image:var(--md-typeset-table-sort-icon);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;transition:background-color 125ms;vertical-align:text-bottom;width:1.2em}.md-typeset table th[role=columnheader]:hover:after{background-color:var(--md-default-fg-color--lighter)}.md-typeset table th[role=columnheader][aria-sort=ascending]:after{background-color:var(--md-default-fg-color--light);-webkit-mask-image:var(--md-typeset-table-sort-icon--asc);mask-image:var(--md-typeset-table-sort-icon--asc)}.md-typeset table th[role=columnheader][aria-sort=descending]:after{background-color:var(--md-default-fg-color--light);-webkit-mask-image:var(--md-typeset-table-sort-icon--desc);mask-image:var(--md-typeset-table-sort-icon--desc)}.md-typeset__scrollwrap{margin:1em -.8rem;overflow-x:auto;touch-action:auto}.md-typeset__table{display:inline-block;margin-bottom:.5em;padding:0 .8rem}@media print{.md-typeset__table{display:block}}html .md-typeset__table table{display:table;margin:0;overflow:hidden;width:100%}@media screen and (max-width:44.9375em){.md-content__inner>pre{margin:1em -.8rem}.md-content__inner>pre code{border-radius:0}}.md-banner{background-color:var(--md-footer-bg-color);color:var(--md-footer-fg-color);overflow:auto}@media print{.md-banner{display:none}}.md-banner--warning{background:var(--md-typeset-mark-color);color:var(--md-default-fg-color)}.md-banner__inner{font-size:.7rem;margin:.6rem auto;padding:0 .8rem}html{font-size:125%;height:100%;overflow-x:hidden}@media screen and (min-width:100em){html{font-size:137.5%}}@media screen and (min-width:125em){html{font-size:150%}}body{background-color:var(--md-default-bg-color);display:flex;flex-direction:column;font-size:.5rem;min-height:100%;position:relative;width:100%}@media print{body{display:block}}@media screen and (max-width:59.9375em){body[data-md-state=lock]{position:fixed}}.md-grid{margin-left:auto;margin-right:auto;max-width:61rem}.md-container{display:flex;flex-direction:column;flex-grow:1}@media print{.md-container{display:block}}.md-main{flex-grow:1}.md-main__inner{display:flex;height:100%;margin-top:1.5rem}.md-ellipsis{overflow:hidden;text-overflow:ellipsis;white-space:nowrap}.md-toggle{display:none}.md-option{height:0;opacity:0;position:absolute;width:0}.md-option:checked+label:not([hidden]){display:block}.md-option.focus-visible+label{outline-color:var(--md-accent-fg-color);outline-style:auto}.md-skip{background-color:var(--md-default-fg-color);border-radius:.1rem;color:var(--md-default-bg-color);font-size:.64rem;margin:.5rem;opacity:0;outline-color:var(--md-accent-fg-color);padding:.3rem .5rem;position:fixed;transform:translateY(.4rem);z-index:-1}.md-skip:focus{opacity:1;transform:translateY(0);transition:transform .25s cubic-bezier(.4,0,.2,1),opacity 175ms 75ms;z-index:10}@page{margin:25mm}:root{--md-clipboard-icon:url('data:image/svg+xml;charset=utf-8,')}.md-clipboard{border-radius:.1rem;color:var(--md-default-fg-color--lightest);cursor:pointer;height:1.5em;outline-color:var(--md-accent-fg-color);outline-offset:.1rem;position:absolute;right:.5em;top:.5em;transition:color .25s;width:1.5em;z-index:1}@media print{.md-clipboard{display:none}}.md-clipboard:not(.focus-visible){-webkit-tap-highlight-color:transparent;outline:none}:hover>.md-clipboard{color:var(--md-default-fg-color--light)}.md-clipboard:-webkit-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-clipboard:-moz-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-clipboard:is(:focus,:hover){color:var(--md-accent-fg-color)}.md-clipboard:after{background-color:currentcolor;content:"";display:block;height:1.125em;margin:0 auto;-webkit-mask-image:var(--md-clipboard-icon);mask-image:var(--md-clipboard-icon);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;width:1.125em}.md-clipboard--inline{cursor:pointer}.md-clipboard--inline code{transition:color .25s,background-color .25s}.md-clipboard--inline:-webkit-any(:focus,:hover) code{background-color:var(--md-accent-fg-color--transparent);color:var(--md-accent-fg-color)}.md-clipboard--inline:-moz-any(:focus,:hover) code{background-color:var(--md-accent-fg-color--transparent);color:var(--md-accent-fg-color)}.md-clipboard--inline:is(:focus,:hover) code{background-color:var(--md-accent-fg-color--transparent);color:var(--md-accent-fg-color)}.md-content{flex-grow:1;min-width:0}.md-content__inner{margin:0 .8rem 1.2rem;padding-top:.6rem}@media screen and (min-width:76.25em){[dir=ltr] .md-sidebar--primary:not([hidden])~.md-content>.md-content__inner{margin-left:1.2rem}[dir=rtl] .md-sidebar--primary:not([hidden])~.md-content>.md-content__inner{margin-right:1.2rem}[dir=ltr] .md-sidebar--secondary:not([hidden])~.md-content>.md-content__inner{margin-right:1.2rem}[dir=rtl] .md-sidebar--secondary:not([hidden])~.md-content>.md-content__inner{margin-left:1.2rem}}.md-content__inner:before{content:"";display:block;height:.4rem}.md-content__inner>:last-child{margin-bottom:0}[dir=ltr] .md-content__button{margin-left:.4rem}[dir=rtl] .md-content__button{margin-right:.4rem}.md-content__button{float:right;margin:.4rem 0;padding:0}@media print{.md-content__button{display:none}}[dir=rtl] .md-content__button{float:left}.md-typeset .md-content__button{color:var(--md-default-fg-color--lighter)}.md-content__button svg{display:inline;vertical-align:top}[dir=rtl] .md-content__button svg{transform:scaleX(-1)}[dir=ltr] .md-dialog{right:.8rem}[dir=rtl] .md-dialog{left:.8rem}.md-dialog{background-color:var(--md-default-fg-color);border-radius:.1rem;bottom:.8rem;box-shadow:var(--md-shadow-z3);min-width:11.1rem;opacity:0;padding:.4rem .6rem;pointer-events:none;position:fixed;transform:translateY(100%);transition:transform 0ms .4s,opacity .4s;z-index:4}@media print{.md-dialog{display:none}}.md-dialog[data-md-state=open]{opacity:1;pointer-events:auto;transform:translateY(0);transition:transform .4s cubic-bezier(.075,.85,.175,1),opacity .4s}.md-dialog__inner{color:var(--md-default-bg-color);font-size:.7rem}.md-footer{background-color:var(--md-footer-bg-color);color:var(--md-footer-fg-color)}@media print{.md-footer{display:none}}.md-footer__inner{display:flex;justify-content:space-between;overflow:auto;padding:.2rem}.md-footer__link{display:flex;flex-grow:0.01;outline-color:var(--md-accent-fg-color);overflow:hidden;padding-bottom:.4rem;padding-top:1.4rem;transition:opacity .25s}.md-footer__link:-webkit-any(:focus,:hover){opacity:.7}.md-footer__link:-moz-any(:focus,:hover){opacity:.7}.md-footer__link:is(:focus,:hover){opacity:.7}[dir=rtl] .md-footer__link svg{transform:scaleX(-1)}@media screen and (max-width:44.9375em){.md-footer__link--prev .md-footer__title{display:none}}[dir=ltr] .md-footer__link--next{margin-left:auto}[dir=rtl] .md-footer__link--next{margin-right:auto}.md-footer__link--next{text-align:right}[dir=rtl] .md-footer__link--next{text-align:left}.md-footer__title{flex-grow:1;font-size:.9rem;line-height:2.4rem;max-width:calc(100% - 2.4rem);padding:0 1rem;position:relative}.md-footer__button{margin:.2rem;padding:.4rem}.md-footer__direction{font-size:.64rem;left:0;margin-top:-1rem;opacity:.7;padding:0 1rem;position:absolute;right:0}.md-footer-meta{background-color:var(--md-footer-bg-color--dark)}.md-footer-meta__inner{display:flex;flex-wrap:wrap;justify-content:space-between;padding:.2rem}html .md-footer-meta.md-typeset a{color:var(--md-footer-fg-color--light)}html .md-footer-meta.md-typeset a:-webkit-any(:focus,:hover){color:var(--md-footer-fg-color)}html .md-footer-meta.md-typeset a:-moz-any(:focus,:hover){color:var(--md-footer-fg-color)}html .md-footer-meta.md-typeset a:is(:focus,:hover){color:var(--md-footer-fg-color)}.md-copyright{color:var(--md-footer-fg-color--lighter);font-size:.64rem;margin:auto .6rem;padding:.4rem 0;width:100%}@media screen and (min-width:45em){.md-copyright{width:auto}}.md-copyright__highlight{color:var(--md-footer-fg-color--light)}.md-social{margin:0 .4rem;padding:.2rem 0 .6rem}@media screen and (min-width:45em){.md-social{padding:.6rem 0}}.md-social__link{display:inline-block;height:1.6rem;text-align:center;width:1.6rem}.md-social__link:before{line-height:1.9}.md-social__link svg{fill:currentcolor;max-height:.8rem;vertical-align:-25%}.md-typeset .md-button{border:.1rem solid;border-radius:.1rem;color:var(--md-primary-fg-color);cursor:pointer;display:inline-block;font-weight:700;padding:.625em 2em;transition:color 125ms,background-color 125ms,border-color 125ms}.md-typeset .md-button--primary{background-color:var(--md-primary-fg-color);border-color:var(--md-primary-fg-color);color:var(--md-primary-bg-color)}.md-typeset .md-button:-webkit-any(:focus,:hover){background-color:var(--md-accent-fg-color);border-color:var(--md-accent-fg-color);color:var(--md-accent-bg-color)}.md-typeset .md-button:-moz-any(:focus,:hover){background-color:var(--md-accent-fg-color);border-color:var(--md-accent-fg-color);color:var(--md-accent-bg-color)}.md-typeset .md-button:is(:focus,:hover){background-color:var(--md-accent-fg-color);border-color:var(--md-accent-fg-color);color:var(--md-accent-bg-color)}[dir=ltr] .md-typeset .md-input{border-top-left-radius:.1rem}[dir=rtl] .md-typeset .md-input{border-top-right-radius:.1rem}[dir=ltr] .md-typeset .md-input{border-top-right-radius:.1rem}[dir=rtl] .md-typeset .md-input{border-top-left-radius:.1rem}.md-typeset .md-input{border-bottom:.1rem solid var(--md-default-fg-color--lighter);box-shadow:var(--md-shadow-z1);font-size:.8rem;height:1.8rem;padding:0 .6rem;transition:border .25s,box-shadow .25s}.md-typeset .md-input:-webkit-any(:focus,:hover){border-bottom-color:var(--md-accent-fg-color);box-shadow:var(--md-shadow-z2)}.md-typeset .md-input:-moz-any(:focus,:hover){border-bottom-color:var(--md-accent-fg-color);box-shadow:var(--md-shadow-z2)}.md-typeset .md-input:is(:focus,:hover){border-bottom-color:var(--md-accent-fg-color);box-shadow:var(--md-shadow-z2)}.md-typeset .md-input--stretch{width:100%}.md-header{background-color:var(--md-primary-fg-color);box-shadow:0 0 .2rem transparent,0 .2rem .4rem transparent;color:var(--md-primary-bg-color);left:0;position:-webkit-sticky;position:sticky;right:0;top:0;z-index:4}@media print{.md-header{display:none}}.md-header[data-md-state=shadow]{box-shadow:0 0 .2rem rgba(0,0,0,.1),0 .2rem .4rem rgba(0,0,0,.2);transition:transform .25s cubic-bezier(.1,.7,.1,1),box-shadow .25s}.md-header[data-md-state=hidden]{transform:translateY(-100%);transition:transform .25s cubic-bezier(.8,0,.6,1),box-shadow .25s}.md-header__inner{align-items:center;display:flex;padding:0 .2rem}.md-header__button{color:currentcolor;cursor:pointer;margin:.2rem;outline-color:var(--md-accent-fg-color);padding:.4rem;position:relative;transition:opacity .25s;vertical-align:middle;z-index:1}.md-header__button:hover{opacity:.7}.md-header__button:not([hidden]){display:inline-block}.md-header__button:not(.focus-visible){-webkit-tap-highlight-color:transparent;outline:none}.md-header__button.md-logo{margin:.2rem;padding:.4rem}@media screen and (max-width:76.1875em){.md-header__button.md-logo{display:none}}.md-header__button.md-logo :-webkit-any(img,svg){fill:currentcolor;display:block;height:1.2rem;width:auto}.md-header__button.md-logo :-moz-any(img,svg){fill:currentcolor;display:block;height:1.2rem;width:auto}.md-header__button.md-logo :is(img,svg){fill:currentcolor;display:block;height:1.2rem;width:auto}@media screen and (min-width:60em){.md-header__button[for=__search]{display:none}}.no-js .md-header__button[for=__search]{display:none}[dir=rtl] .md-header__button[for=__search] svg{transform:scaleX(-1)}@media screen and (min-width:76.25em){.md-header__button[for=__drawer]{display:none}}.md-header__topic{display:flex;max-width:100%;position:absolute;transition:transform .4s cubic-bezier(.1,.7,.1,1),opacity .15s}.md-header__topic+.md-header__topic{opacity:0;pointer-events:none;transform:translateX(1.25rem);transition:transform .4s cubic-bezier(1,.7,.1,.1),opacity .15s;z-index:-1}[dir=rtl] .md-header__topic+.md-header__topic{transform:translateX(-1.25rem)}.md-header__topic:first-child{font-weight:700}[dir=ltr] .md-header__title{margin-right:.4rem}[dir=rtl] .md-header__title{margin-left:.4rem}[dir=ltr] .md-header__title{margin-left:1rem}[dir=rtl] .md-header__title{margin-right:1rem}.md-header__title{flex-grow:1;font-size:.9rem;height:2.4rem;line-height:2.4rem}.md-header__title[data-md-state=active] .md-header__topic{opacity:0;pointer-events:none;transform:translateX(-1.25rem);transition:transform .4s cubic-bezier(1,.7,.1,.1),opacity .15s;z-index:-1}[dir=rtl] .md-header__title[data-md-state=active] .md-header__topic{transform:translateX(1.25rem)}.md-header__title[data-md-state=active] .md-header__topic+.md-header__topic{opacity:1;pointer-events:auto;transform:translateX(0);transition:transform .4s cubic-bezier(.1,.7,.1,1),opacity .15s;z-index:0}.md-header__title>.md-header__ellipsis{height:100%;position:relative;width:100%}.md-header__option{display:flex;flex-shrink:0;max-width:100%;transition:max-width 0ms .25s,opacity .25s .25s;white-space:nowrap}[data-md-toggle=search]:checked~.md-header .md-header__option{max-width:0;opacity:0;transition:max-width 0ms,opacity 0ms}.md-header__source{display:none}@media screen and (min-width:60em){[dir=ltr] .md-header__source{margin-left:1rem}[dir=rtl] .md-header__source{margin-right:1rem}.md-header__source{display:block;max-width:11.7rem;width:11.7rem}}@media screen and (min-width:76.25em){[dir=ltr] .md-header__source{margin-left:1.4rem}[dir=rtl] .md-header__source{margin-right:1.4rem}}:root{--md-nav-icon--prev:url('data:image/svg+xml;charset=utf-8,');--md-nav-icon--next:url('data:image/svg+xml;charset=utf-8,');--md-toc-icon:url('data:image/svg+xml;charset=utf-8,')}.md-nav{font-size:.7rem;line-height:1.3}.md-nav__title{display:block;font-weight:700;overflow:hidden;padding:0 .6rem;text-overflow:ellipsis}.md-nav__title .md-nav__button{display:none}.md-nav__title .md-nav__button img{height:100%;width:auto}.md-nav__title .md-nav__button.md-logo :-webkit-any(img,svg){fill:currentcolor;display:block;height:2.4rem;max-width:100%;object-fit:contain;width:auto}.md-nav__title .md-nav__button.md-logo :-moz-any(img,svg){fill:currentcolor;display:block;height:2.4rem;max-width:100%;object-fit:contain;width:auto}.md-nav__title .md-nav__button.md-logo :is(img,svg){fill:currentcolor;display:block;height:2.4rem;max-width:100%;object-fit:contain;width:auto}.md-nav__list{list-style:none;margin:0;padding:0}.md-nav__item{padding:0 .6rem}[dir=ltr] .md-nav__item .md-nav__item{padding-right:0}[dir=rtl] .md-nav__item .md-nav__item{padding-left:0}.md-nav__link{align-items:center;cursor:pointer;display:flex;justify-content:space-between;margin-top:.625em;overflow:hidden;scroll-snap-align:start;text-overflow:ellipsis;transition:color 125ms}.md-nav__link[data-md-state=blur]{color:var(--md-default-fg-color--light)}.md-nav__item .md-nav__link--active{color:var(--md-typeset-a-color)}.md-nav__item .md-nav__link--index [href]{width:100%}.md-nav__link:-webkit-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-nav__link:-moz-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-nav__link:is(:focus,:hover){color:var(--md-accent-fg-color)}.md-nav__link.focus-visible{outline-color:var(--md-accent-fg-color);outline-offset:.2rem}.md-nav--primary .md-nav__link[for=__toc]{display:none}.md-nav--primary .md-nav__link[for=__toc] .md-icon:after{background-color:currentcolor;display:block;height:100%;-webkit-mask-image:var(--md-toc-icon);mask-image:var(--md-toc-icon);width:100%}.md-nav--primary .md-nav__link[for=__toc]~.md-nav{display:none}.md-nav__link>*{cursor:pointer;display:flex}.md-nav__icon{flex-shrink:0}.md-nav__source{display:none}@media screen and (max-width:76.1875em){.md-nav--primary,.md-nav--primary .md-nav{background-color:var(--md-default-bg-color);display:flex;flex-direction:column;height:100%;left:0;position:absolute;right:0;top:0;z-index:1}.md-nav--primary :-webkit-any(.md-nav__title,.md-nav__item){font-size:.8rem;line-height:1.5}.md-nav--primary :-moz-any(.md-nav__title,.md-nav__item){font-size:.8rem;line-height:1.5}.md-nav--primary :is(.md-nav__title,.md-nav__item){font-size:.8rem;line-height:1.5}.md-nav--primary .md-nav__title{background-color:var(--md-default-fg-color--lightest);color:var(--md-default-fg-color--light);cursor:pointer;font-weight:400;height:5.6rem;line-height:2.4rem;padding:3rem .8rem .2rem;position:relative;white-space:nowrap}[dir=ltr] .md-nav--primary .md-nav__title .md-nav__icon{left:.4rem}[dir=rtl] .md-nav--primary .md-nav__title .md-nav__icon{right:.4rem}.md-nav--primary .md-nav__title .md-nav__icon{display:block;height:1.2rem;margin:.2rem;position:absolute;top:.4rem;width:1.2rem}.md-nav--primary .md-nav__title .md-nav__icon:after{background-color:currentcolor;content:"";display:block;height:100%;-webkit-mask-image:var(--md-nav-icon--prev);mask-image:var(--md-nav-icon--prev);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;width:100%}.md-nav--primary .md-nav__title~.md-nav__list{background-color:var(--md-default-bg-color);box-shadow:0 .05rem 0 var(--md-default-fg-color--lightest) inset;overflow-y:auto;-ms-scroll-snap-type:y mandatory;scroll-snap-type:y mandatory;touch-action:pan-y}.md-nav--primary .md-nav__title~.md-nav__list>:first-child{border-top:0}.md-nav--primary .md-nav__title[for=__drawer]{background-color:var(--md-primary-fg-color);color:var(--md-primary-bg-color);font-weight:700}.md-nav--primary .md-nav__title .md-logo{display:block;left:.2rem;margin:.2rem;padding:.4rem;position:absolute;right:.2rem;top:.2rem}.md-nav--primary .md-nav__list{flex:1}.md-nav--primary .md-nav__item{border-top:.05rem solid var(--md-default-fg-color--lightest);padding:0}.md-nav--primary .md-nav__item--active>.md-nav__link{color:var(--md-typeset-a-color)}.md-nav--primary .md-nav__item--active>.md-nav__link:-webkit-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-nav--primary .md-nav__item--active>.md-nav__link:-moz-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-nav--primary .md-nav__item--active>.md-nav__link:is(:focus,:hover){color:var(--md-accent-fg-color)}.md-nav--primary .md-nav__link{margin-top:0;padding:.6rem .8rem}[dir=ltr] .md-nav--primary .md-nav__link .md-nav__icon{margin-right:-.2rem}[dir=rtl] .md-nav--primary .md-nav__link .md-nav__icon{margin-left:-.2rem}.md-nav--primary .md-nav__link .md-nav__icon{font-size:1.2rem;height:1.2rem;width:1.2rem}.md-nav--primary .md-nav__link .md-nav__icon:after{background-color:currentcolor;content:"";display:block;height:100%;-webkit-mask-image:var(--md-nav-icon--next);mask-image:var(--md-nav-icon--next);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;width:100%}[dir=rtl] .md-nav--primary .md-nav__icon:after{transform:scale(-1)}.md-nav--primary .md-nav--secondary .md-nav{background-color:transparent;position:static}[dir=ltr] .md-nav--primary .md-nav--secondary .md-nav .md-nav__link{padding-left:1.4rem}[dir=rtl] .md-nav--primary .md-nav--secondary .md-nav .md-nav__link{padding-right:1.4rem}[dir=ltr] .md-nav--primary .md-nav--secondary .md-nav .md-nav .md-nav__link{padding-left:2rem}[dir=rtl] .md-nav--primary .md-nav--secondary .md-nav .md-nav .md-nav__link{padding-right:2rem}[dir=ltr] .md-nav--primary .md-nav--secondary .md-nav .md-nav .md-nav .md-nav__link{padding-left:2.6rem}[dir=rtl] .md-nav--primary .md-nav--secondary .md-nav .md-nav .md-nav .md-nav__link{padding-right:2.6rem}[dir=ltr] .md-nav--primary .md-nav--secondary .md-nav .md-nav .md-nav .md-nav .md-nav__link{padding-left:3.2rem}[dir=rtl] .md-nav--primary .md-nav--secondary .md-nav .md-nav .md-nav .md-nav .md-nav__link{padding-right:3.2rem}.md-nav--secondary{background-color:transparent}.md-nav__toggle~.md-nav{display:flex;opacity:0;transform:translateX(100%);transition:transform .25s cubic-bezier(.8,0,.6,1),opacity 125ms 50ms}[dir=rtl] .md-nav__toggle~.md-nav{transform:translateX(-100%)}.md-nav__toggle:checked~.md-nav{opacity:1;transform:translateX(0);transition:transform .25s cubic-bezier(.4,0,.2,1),opacity 125ms 125ms}.md-nav__toggle:checked~.md-nav>.md-nav__list{-webkit-backface-visibility:hidden;backface-visibility:hidden}}@media screen and (max-width:59.9375em){.md-nav--primary .md-nav__link[for=__toc]{display:flex}.md-nav--primary .md-nav__link[for=__toc] .md-icon:after{content:""}.md-nav--primary .md-nav__link[for=__toc]+.md-nav__link{display:none}.md-nav--primary .md-nav__link[for=__toc]~.md-nav{display:flex}.md-nav__source{background-color:var(--md-primary-fg-color--dark);color:var(--md-primary-bg-color);display:block;padding:0 .2rem}}@media screen and (min-width:60em) and (max-width:76.1875em){.md-nav--integrated .md-nav__link[for=__toc]{display:flex}.md-nav--integrated .md-nav__link[for=__toc] .md-icon:after{content:""}.md-nav--integrated .md-nav__link[for=__toc]+.md-nav__link{display:none}.md-nav--integrated .md-nav__link[for=__toc]~.md-nav{display:flex}}@media screen and (min-width:60em){.md-nav--secondary .md-nav__title[for=__toc]{scroll-snap-align:start}.md-nav--secondary .md-nav__title .md-nav__icon{display:none}}@media screen and (min-width:76.25em){.md-nav{transition:max-height .25s cubic-bezier(.86,0,.07,1)}.md-nav--primary .md-nav__title[for=__drawer]{scroll-snap-align:start}.md-nav--primary .md-nav__title .md-nav__icon{display:none}.md-nav__toggle~.md-nav{display:none}.md-nav__toggle:-webkit-any(:checked,:indeterminate)~.md-nav{display:block}.md-nav__toggle:-moz-any(:checked,:indeterminate)~.md-nav{display:block}.md-nav__toggle:is(:checked,:indeterminate)~.md-nav{display:block}.md-nav__item--nested>.md-nav>.md-nav__title{display:none}.md-nav__item--section{display:block;margin:1.25em 0}.md-nav__item--section:last-child{margin-bottom:0}.md-nav__item--section>.md-nav__link{font-weight:700;pointer-events:none}.md-nav__item--section>.md-nav__link--index [href]{pointer-events:auto}.md-nav__item--section>.md-nav__link .md-nav__icon{display:none}.md-nav__item--section>.md-nav{display:block}.md-nav__item--section>.md-nav>.md-nav__list>.md-nav__item{padding:0}.md-nav__icon{border-radius:100%;float:right;height:.9rem;transition:background-color .25s,transform .25s;width:.9rem}[dir=rtl] .md-nav__icon{float:left;transform:rotate(180deg)}.md-nav__icon:hover{background-color:var(--md-accent-fg-color--transparent)}.md-nav__icon:after{background-color:currentcolor;content:"";display:inline-block;height:100%;-webkit-mask-image:var(--md-nav-icon--next);mask-image:var(--md-nav-icon--next);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;vertical-align:-.1rem;width:100%}.md-nav__item--nested .md-nav__toggle:checked~.md-nav__link .md-nav__icon,.md-nav__item--nested .md-nav__toggle:indeterminate~.md-nav__link .md-nav__icon{transform:rotate(90deg)}.md-nav--lifted>.md-nav__list>.md-nav__item--nested,.md-nav--lifted>.md-nav__title{display:none}.md-nav--lifted>.md-nav__list>.md-nav__item{display:none}.md-nav--lifted>.md-nav__list>.md-nav__item--active{display:block;padding:0}.md-nav--lifted>.md-nav__list>.md-nav__item--active>.md-nav__link{font-weight:700;margin-top:0;padding:0 .6rem;pointer-events:none}.md-nav--lifted>.md-nav__list>.md-nav__item--active>.md-nav__link--index [href]{pointer-events:auto}.md-nav--lifted>.md-nav__list>.md-nav__item--active>.md-nav__link .md-nav__icon{display:none}.md-nav--lifted .md-nav[data-md-level="1"]{display:block}[dir=ltr] .md-nav--lifted .md-nav[data-md-level="1"]>.md-nav__list>.md-nav__item{padding-right:.6rem}[dir=rtl] .md-nav--lifted .md-nav[data-md-level="1"]>.md-nav__list>.md-nav__item{padding-left:.6rem}.md-nav--integrated>.md-nav__list>.md-nav__item--active:not(.md-nav__item--nested){padding:0 .6rem}.md-nav--integrated>.md-nav__list>.md-nav__item--active:not(.md-nav__item--nested)>.md-nav__link{padding:0}[dir=ltr] .md-nav--integrated>.md-nav__list>.md-nav__item--active .md-nav--secondary{border-left:.05rem solid var(--md-primary-fg-color)}[dir=rtl] .md-nav--integrated>.md-nav__list>.md-nav__item--active .md-nav--secondary{border-right:.05rem solid var(--md-primary-fg-color)}.md-nav--integrated>.md-nav__list>.md-nav__item--active .md-nav--secondary{display:block;margin-bottom:1.25em}.md-nav--integrated>.md-nav__list>.md-nav__item--active .md-nav--secondary>.md-nav__title{display:none}}:root{--md-search-result-icon:url('data:image/svg+xml;charset=utf-8,')}.md-search{position:relative}@media screen and (min-width:60em){.md-search{padding:.2rem 0}}.no-js .md-search{display:none}.md-search__overlay{opacity:0;z-index:1}@media screen and (max-width:59.9375em){[dir=ltr] .md-search__overlay{left:-2.2rem}[dir=rtl] .md-search__overlay{right:-2.2rem}.md-search__overlay{background-color:var(--md-default-bg-color);border-radius:1rem;height:2rem;overflow:hidden;pointer-events:none;position:absolute;top:-1rem;transform-origin:center;transition:transform .3s .1s,opacity .2s .2s;width:2rem}[data-md-toggle=search]:checked~.md-header .md-search__overlay{opacity:1;transition:transform .4s,opacity .1s}}@media screen and (min-width:60em){[dir=ltr] .md-search__overlay{left:0}[dir=rtl] .md-search__overlay{right:0}.md-search__overlay{background-color:rgba(0,0,0,.54);cursor:pointer;height:0;position:fixed;top:0;transition:width 0ms .25s,height 0ms .25s,opacity .25s;width:0}[data-md-toggle=search]:checked~.md-header .md-search__overlay{height:200vh;opacity:1;transition:width 0ms,height 0ms,opacity .25s;width:100%}}@media screen and (max-width:29.9375em){[data-md-toggle=search]:checked~.md-header .md-search__overlay{transform:scale(45)}}@media screen and (min-width:30em) and (max-width:44.9375em){[data-md-toggle=search]:checked~.md-header .md-search__overlay{transform:scale(60)}}@media screen and (min-width:45em) and (max-width:59.9375em){[data-md-toggle=search]:checked~.md-header .md-search__overlay{transform:scale(75)}}.md-search__inner{-webkit-backface-visibility:hidden;backface-visibility:hidden}@media screen and (max-width:59.9375em){[dir=ltr] .md-search__inner{left:0}[dir=rtl] .md-search__inner{right:0}.md-search__inner{height:0;opacity:0;overflow:hidden;position:fixed;top:0;transform:translateX(5%);transition:width 0ms .3s,height 0ms .3s,transform .15s cubic-bezier(.4,0,.2,1) .15s,opacity .15s .15s;width:0;z-index:2}[dir=rtl] .md-search__inner{transform:translateX(-5%)}[data-md-toggle=search]:checked~.md-header .md-search__inner{height:100%;opacity:1;transform:translateX(0);transition:width 0ms 0ms,height 0ms 0ms,transform .15s cubic-bezier(.1,.7,.1,1) .15s,opacity .15s .15s;width:100%}}@media screen and (min-width:60em){.md-search__inner{float:right;padding:.1rem 0;position:relative;transition:width .25s cubic-bezier(.1,.7,.1,1);width:11.7rem}[dir=rtl] .md-search__inner{float:left}}@media screen and (min-width:60em) and (max-width:76.1875em){[data-md-toggle=search]:checked~.md-header .md-search__inner{width:23.4rem}}@media screen and (min-width:76.25em){[data-md-toggle=search]:checked~.md-header .md-search__inner{width:34.4rem}}.md-search__form{background-color:var(--md-default-bg-color);box-shadow:0 0 .6rem transparent;height:2.4rem;position:relative;transition:color .25s,background-color .25s;z-index:2}@media screen and (min-width:60em){.md-search__form{background-color:rgba(0,0,0,.26);border-radius:.1rem;height:1.8rem}.md-search__form:hover{background-color:hsla(0,0%,100%,.12)}}[data-md-toggle=search]:checked~.md-header .md-search__form{background-color:var(--md-default-bg-color);border-radius:.1rem .1rem 0 0;box-shadow:0 0 .6rem rgba(0,0,0,.07);color:var(--md-default-fg-color)}[dir=ltr] .md-search__input{padding-left:3.6rem;padding-right:2.2rem}[dir=rtl] .md-search__input{padding-left:2.2rem;padding-right:3.6rem}.md-search__input{background:transparent;font-size:.9rem;height:100%;position:relative;text-overflow:ellipsis;width:100%;z-index:2}.md-search__input::-moz-placeholder{-moz-transition:color .25s;transition:color .25s}.md-search__input::-ms-input-placeholder{-ms-transition:color .25s;transition:color .25s}.md-search__input::placeholder{transition:color .25s}.md-search__input::-moz-placeholder{color:var(--md-default-fg-color--light)}.md-search__input::-ms-input-placeholder{color:var(--md-default-fg-color--light)}.md-search__input::placeholder,.md-search__input~.md-search__icon{color:var(--md-default-fg-color--light)}.md-search__input::-ms-clear{display:none}@media screen and (max-width:59.9375em){.md-search__input{font-size:.9rem;height:2.4rem;width:100%}}@media screen and (min-width:60em){[dir=ltr] .md-search__input{padding-left:2.2rem}[dir=rtl] .md-search__input{padding-right:2.2rem}.md-search__input{color:inherit;font-size:.8rem}.md-search__input::-moz-placeholder{color:var(--md-primary-bg-color--light)}.md-search__input::-ms-input-placeholder{color:var(--md-primary-bg-color--light)}.md-search__input::placeholder{color:var(--md-primary-bg-color--light)}.md-search__input+.md-search__icon{color:var(--md-primary-bg-color)}[data-md-toggle=search]:checked~.md-header .md-search__input{text-overflow:clip}[data-md-toggle=search]:checked~.md-header .md-search__input::-moz-placeholder{color:var(--md-default-fg-color--light)}[data-md-toggle=search]:checked~.md-header .md-search__input::-ms-input-placeholder{color:var(--md-default-fg-color--light)}[data-md-toggle=search]:checked~.md-header .md-search__input+.md-search__icon,[data-md-toggle=search]:checked~.md-header .md-search__input::placeholder{color:var(--md-default-fg-color--light)}}.md-search__icon{cursor:pointer;display:inline-block;height:1.2rem;transition:color .25s,opacity .25s;width:1.2rem}.md-search__icon:hover{opacity:.7}[dir=ltr] .md-search__icon[for=__search]{left:.5rem}[dir=rtl] .md-search__icon[for=__search]{right:.5rem}.md-search__icon[for=__search]{position:absolute;top:.3rem;z-index:2}[dir=rtl] .md-search__icon[for=__search] svg{transform:scaleX(-1)}@media screen and (max-width:59.9375em){[dir=ltr] .md-search__icon[for=__search]{left:.8rem}[dir=rtl] .md-search__icon[for=__search]{right:.8rem}.md-search__icon[for=__search]{top:.6rem}.md-search__icon[for=__search] svg:first-child{display:none}}@media screen and (min-width:60em){.md-search__icon[for=__search]{pointer-events:none}.md-search__icon[for=__search] svg:last-child{display:none}}[dir=ltr] .md-search__options{right:.5rem}[dir=rtl] .md-search__options{left:.5rem}.md-search__options{pointer-events:none;position:absolute;top:.3rem;z-index:2}@media screen and (max-width:59.9375em){[dir=ltr] .md-search__options{right:.8rem}[dir=rtl] .md-search__options{left:.8rem}.md-search__options{top:.6rem}}[dir=ltr] .md-search__options>*{margin-left:.2rem}[dir=rtl] .md-search__options>*{margin-right:.2rem}.md-search__options>*{color:var(--md-default-fg-color--light);opacity:0;transform:scale(.75);transition:transform .15s cubic-bezier(.1,.7,.1,1),opacity .15s}.md-search__options>:not(.focus-visible){-webkit-tap-highlight-color:transparent;outline:none}[data-md-toggle=search]:checked~.md-header .md-search__input:valid~.md-search__options>*{opacity:1;pointer-events:auto;transform:scale(1)}[data-md-toggle=search]:checked~.md-header .md-search__input:valid~.md-search__options>:hover{opacity:.7}[dir=ltr] .md-search__suggest{padding-left:3.6rem;padding-right:2.2rem}[dir=rtl] .md-search__suggest{padding-left:2.2rem;padding-right:3.6rem}.md-search__suggest{align-items:center;color:var(--md-default-fg-color--lighter);display:flex;font-size:.9rem;height:100%;opacity:0;position:absolute;top:0;transition:opacity 50ms;white-space:nowrap;width:100%}@media screen and (min-width:60em){[dir=ltr] .md-search__suggest{padding-left:2.2rem}[dir=rtl] .md-search__suggest{padding-right:2.2rem}.md-search__suggest{font-size:.8rem}}[data-md-toggle=search]:checked~.md-header .md-search__suggest{opacity:1;transition:opacity .3s .1s}[dir=ltr] .md-search__output{border-bottom-left-radius:.1rem}[dir=rtl] .md-search__output{border-bottom-right-radius:.1rem}[dir=ltr] .md-search__output{border-bottom-right-radius:.1rem}[dir=rtl] .md-search__output{border-bottom-left-radius:.1rem}.md-search__output{overflow:hidden;position:absolute;width:100%;z-index:1}@media screen and (max-width:59.9375em){.md-search__output{bottom:0;top:2.4rem}}@media screen and (min-width:60em){.md-search__output{opacity:0;top:1.9rem;transition:opacity .4s}[data-md-toggle=search]:checked~.md-header .md-search__output{box-shadow:var(--md-shadow-z3);opacity:1}}.md-search__scrollwrap{-webkit-backface-visibility:hidden;backface-visibility:hidden;background-color:var(--md-default-bg-color);height:100%;overflow-y:auto;touch-action:pan-y}@media (-webkit-max-device-pixel-ratio:1),(max-resolution:1dppx){.md-search__scrollwrap{transform:translateZ(0)}}@media screen and (min-width:60em) and (max-width:76.1875em){.md-search__scrollwrap{width:23.4rem}}@media screen and (min-width:76.25em){.md-search__scrollwrap{width:34.4rem}}@media screen and (min-width:60em){.md-search__scrollwrap{max-height:0;scrollbar-color:var(--md-default-fg-color--lighter) transparent;scrollbar-width:thin}[data-md-toggle=search]:checked~.md-header .md-search__scrollwrap{max-height:75vh}.md-search__scrollwrap:hover{scrollbar-color:var(--md-accent-fg-color) transparent}.md-search__scrollwrap::-webkit-scrollbar{height:.2rem;width:.2rem}.md-search__scrollwrap::-webkit-scrollbar-thumb{background-color:var(--md-default-fg-color--lighter)}.md-search__scrollwrap::-webkit-scrollbar-thumb:hover{background-color:var(--md-accent-fg-color)}}.md-search-result{color:var(--md-default-fg-color);word-break:break-word}.md-search-result__meta{background-color:var(--md-default-fg-color--lightest);color:var(--md-default-fg-color--light);font-size:.64rem;line-height:1.8rem;padding:0 .8rem;scroll-snap-align:start}@media screen and (min-width:60em){[dir=ltr] .md-search-result__meta{padding-left:2.2rem}[dir=rtl] .md-search-result__meta{padding-right:2.2rem}}.md-search-result__list{list-style:none;margin:0;padding:0}.md-search-result__item{box-shadow:0 -.05rem var(--md-default-fg-color--lightest)}.md-search-result__item:first-child{box-shadow:none}.md-search-result__link{display:block;outline:none;scroll-snap-align:start;transition:background-color .25s}.md-search-result__link:-webkit-any(:focus,:hover){background-color:var(--md-accent-fg-color--transparent)}.md-search-result__link:-moz-any(:focus,:hover){background-color:var(--md-accent-fg-color--transparent)}.md-search-result__link:is(:focus,:hover){background-color:var(--md-accent-fg-color--transparent)}.md-search-result__link:last-child p:last-child{margin-bottom:.6rem}.md-search-result__more summary{color:var(--md-typeset-a-color);cursor:pointer;display:block;font-size:.64rem;outline:none;padding:.75em .8rem;scroll-snap-align:start;transition:color .25s,background-color .25s}@media screen and (min-width:60em){[dir=ltr] .md-search-result__more summary{padding-left:2.2rem}[dir=rtl] .md-search-result__more summary{padding-right:2.2rem}}.md-search-result__more summary:-webkit-any(:focus,:hover){background-color:var(--md-accent-fg-color--transparent);color:var(--md-accent-fg-color)}.md-search-result__more summary:-moz-any(:focus,:hover){background-color:var(--md-accent-fg-color--transparent);color:var(--md-accent-fg-color)}.md-search-result__more summary:is(:focus,:hover){background-color:var(--md-accent-fg-color--transparent);color:var(--md-accent-fg-color)}.md-search-result__more summary::marker{display:none}.md-search-result__more summary::-webkit-details-marker{display:none}.md-search-result__more summary~*>*{opacity:.65}.md-search-result__article{overflow:hidden;padding:0 .8rem;position:relative}@media screen and (min-width:60em){[dir=ltr] .md-search-result__article{padding-left:2.2rem}[dir=rtl] .md-search-result__article{padding-right:2.2rem}}.md-search-result__article--document .md-search-result__title{font-size:.8rem;font-weight:400;line-height:1.4;margin:.55rem 0}[dir=ltr] .md-search-result__icon{left:0}[dir=rtl] .md-search-result__icon{right:0}.md-search-result__icon{color:var(--md-default-fg-color--light);height:1.2rem;margin:.5rem;position:absolute;width:1.2rem}@media screen and (max-width:59.9375em){.md-search-result__icon{display:none}}.md-search-result__icon:after{background-color:currentcolor;content:"";display:inline-block;height:100%;-webkit-mask-image:var(--md-search-result-icon);mask-image:var(--md-search-result-icon);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;width:100%}[dir=rtl] .md-search-result__icon:after{transform:scaleX(-1)}.md-search-result__title{font-size:.64rem;font-weight:700;line-height:1.6;margin:.5em 0}.md-search-result__teaser{-webkit-box-orient:vertical;-webkit-line-clamp:2;color:var(--md-default-fg-color--light);display:-webkit-box;font-size:.64rem;line-height:1.6;margin:.5em 0;max-height:2rem;overflow:hidden;text-overflow:ellipsis}@media screen and (max-width:44.9375em){.md-search-result__teaser{-webkit-line-clamp:3;max-height:3rem}}@media screen and (min-width:60em) and (max-width:76.1875em){.md-search-result__teaser{-webkit-line-clamp:3;max-height:3rem}}.md-search-result__teaser mark{background-color:transparent;text-decoration:underline}.md-search-result__terms{font-size:.64rem;font-style:italic;margin:.5em 0}.md-search-result mark{background-color:transparent;color:var(--md-accent-fg-color)}.md-select{position:relative;z-index:1}.md-select__inner{background-color:var(--md-default-bg-color);border-radius:.1rem;box-shadow:var(--md-shadow-z2);color:var(--md-default-fg-color);left:50%;margin-top:.2rem;max-height:0;opacity:0;position:absolute;top:calc(100% - .2rem);transform:translate3d(-50%,.3rem,0);transition:transform .25s 375ms,opacity .25s .25s,max-height 0ms .5s}.md-select:-webkit-any(:focus-within,:hover) .md-select__inner{max-height:10rem;opacity:1;transform:translate3d(-50%,0,0);-webkit-transition:transform .25s cubic-bezier(.1,.7,.1,1),opacity .25s,max-height 0ms;transition:transform .25s cubic-bezier(.1,.7,.1,1),opacity .25s,max-height 0ms}.md-select:-moz-any(:focus-within,:hover) .md-select__inner{max-height:10rem;opacity:1;transform:translate3d(-50%,0,0);-moz-transition:transform .25s cubic-bezier(.1,.7,.1,1),opacity .25s,max-height 0ms;transition:transform .25s cubic-bezier(.1,.7,.1,1),opacity .25s,max-height 0ms}.md-select:is(:focus-within,:hover) .md-select__inner{max-height:10rem;opacity:1;transform:translate3d(-50%,0,0);transition:transform .25s cubic-bezier(.1,.7,.1,1),opacity .25s,max-height 0ms}.md-select__inner:after{border-bottom:.2rem solid transparent;border-bottom-color:var(--md-default-bg-color);border-left:.2rem solid transparent;border-right:.2rem solid transparent;border-top:0;content:"";height:0;left:50%;margin-left:-.2rem;margin-top:-.2rem;position:absolute;top:0;width:0}.md-select__list{border-radius:.1rem;font-size:.8rem;list-style-type:none;margin:0;max-height:inherit;overflow:auto;padding:0}.md-select__item{line-height:1.8rem}[dir=ltr] .md-select__link{padding-left:.6rem;padding-right:1.2rem}[dir=rtl] .md-select__link{padding-left:1.2rem;padding-right:.6rem}.md-select__link{cursor:pointer;display:block;outline:none;scroll-snap-align:start;transition:background-color .25s,color .25s;width:100%}.md-select__link:-webkit-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-select__link:-moz-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-select__link:is(:focus,:hover){color:var(--md-accent-fg-color)}.md-select__link:focus{background-color:var(--md-default-fg-color--lightest)}.md-sidebar{align-self:flex-start;flex-shrink:0;padding:1.2rem 0;position:-webkit-sticky;position:sticky;top:2.4rem;width:12.1rem}@media print{.md-sidebar{display:none}}@media screen and (max-width:76.1875em){[dir=ltr] .md-sidebar--primary{left:-12.1rem}[dir=rtl] .md-sidebar--primary{right:-12.1rem}.md-sidebar--primary{background-color:var(--md-default-bg-color);display:block;height:100%;position:fixed;top:0;transform:translateX(0);transition:transform .25s cubic-bezier(.4,0,.2,1),box-shadow .25s;width:12.1rem;z-index:5}[data-md-toggle=drawer]:checked~.md-container .md-sidebar--primary{box-shadow:var(--md-shadow-z3);transform:translateX(12.1rem)}[dir=rtl] [data-md-toggle=drawer]:checked~.md-container .md-sidebar--primary{transform:translateX(-12.1rem)}.md-sidebar--primary .md-sidebar__scrollwrap{bottom:0;left:0;margin:0;overflow:hidden;position:absolute;right:0;-ms-scroll-snap-type:none;scroll-snap-type:none;top:0}}@media screen and (min-width:76.25em){.md-sidebar{height:0}.no-js .md-sidebar{height:auto}}.md-sidebar--secondary{display:none;order:2}@media screen and (min-width:60em){.md-sidebar--secondary{height:0}.no-js .md-sidebar--secondary{height:auto}.md-sidebar--secondary:not([hidden]){display:block}.md-sidebar--secondary .md-sidebar__scrollwrap{touch-action:pan-y}}.md-sidebar__scrollwrap{-webkit-backface-visibility:hidden;backface-visibility:hidden;margin:0 .2rem;overflow-y:auto;scrollbar-color:var(--md-default-fg-color--lighter) transparent;scrollbar-width:thin}.md-sidebar__scrollwrap:hover{scrollbar-color:var(--md-accent-fg-color) transparent}.md-sidebar__scrollwrap::-webkit-scrollbar{height:.2rem;width:.2rem}.md-sidebar__scrollwrap::-webkit-scrollbar-thumb{background-color:var(--md-default-fg-color--lighter)}.md-sidebar__scrollwrap::-webkit-scrollbar-thumb:hover{background-color:var(--md-accent-fg-color)}@media screen and (max-width:76.1875em){.md-overlay{background-color:rgba(0,0,0,.54);height:0;opacity:0;position:fixed;top:0;transition:width 0ms .25s,height 0ms .25s,opacity .25s;width:0;z-index:5}[data-md-toggle=drawer]:checked~.md-overlay{height:100%;opacity:1;transition:width 0ms,height 0ms,opacity .25s;width:100%}}@-webkit-keyframes facts{0%{height:0}to{height:.65rem}}@keyframes facts{0%{height:0}to{height:.65rem}}@-webkit-keyframes fact{0%{opacity:0;transform:translateY(100%)}50%{opacity:0}to{opacity:1;transform:translateY(0)}}@keyframes fact{0%{opacity:0;transform:translateY(100%)}50%{opacity:0}to{opacity:1;transform:translateY(0)}}:root{--md-source-forks-icon:url('data:image/svg+xml;charset=utf-8,');--md-source-repositories-icon:url('data:image/svg+xml;charset=utf-8,');--md-source-stars-icon:url('data:image/svg+xml;charset=utf-8,');--md-source-version-icon:url('data:image/svg+xml;charset=utf-8,')}.md-source{-webkit-backface-visibility:hidden;backface-visibility:hidden;display:block;font-size:.65rem;line-height:1.2;outline-color:var(--md-accent-fg-color);transition:opacity .25s;white-space:nowrap}.md-source:hover{opacity:.7}.md-source__icon{display:inline-block;height:2.4rem;vertical-align:middle;width:2rem}[dir=ltr] .md-source__icon svg{margin-left:.6rem}[dir=rtl] .md-source__icon svg{margin-right:.6rem}.md-source__icon svg{margin-top:.6rem}[dir=ltr] .md-source__icon+.md-source__repository{margin-left:-2rem}[dir=rtl] .md-source__icon+.md-source__repository{margin-right:-2rem}[dir=ltr] .md-source__icon+.md-source__repository{padding-left:2rem}[dir=rtl] .md-source__icon+.md-source__repository{padding-right:2rem}[dir=ltr] .md-source__repository{margin-left:.6rem}[dir=rtl] .md-source__repository{margin-right:.6rem}.md-source__repository{display:inline-block;max-width:calc(100% - 1.2rem);overflow:hidden;text-overflow:ellipsis;vertical-align:middle}.md-source__facts{font-size:.55rem;list-style-type:none;margin:.1rem 0 0;opacity:.75;overflow:hidden;padding:0}[data-md-state=done] .md-source__facts{-webkit-animation:facts .25s ease-in;animation:facts .25s ease-in}.md-source__fact{display:inline-block}[data-md-state=done] .md-source__fact{-webkit-animation:fact .4s ease-out;animation:fact .4s ease-out}[dir=ltr] .md-source__fact:before{margin-right:.1rem}[dir=rtl] .md-source__fact:before{margin-left:.1rem}.md-source__fact:before{background-color:currentcolor;content:"";display:inline-block;height:.6rem;-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;vertical-align:text-top;width:.6rem}[dir=ltr] .md-source__fact:nth-child(1n+2):before{margin-left:.4rem}[dir=rtl] .md-source__fact:nth-child(1n+2):before{margin-right:.4rem}.md-source__fact--version:before{-webkit-mask-image:var(--md-source-version-icon);mask-image:var(--md-source-version-icon)}.md-source__fact--stars:before{-webkit-mask-image:var(--md-source-stars-icon);mask-image:var(--md-source-stars-icon)}.md-source__fact--forks:before{-webkit-mask-image:var(--md-source-forks-icon);mask-image:var(--md-source-forks-icon)}.md-source__fact--repositories:before{-webkit-mask-image:var(--md-source-repositories-icon);mask-image:var(--md-source-repositories-icon)}.md-tabs{background-color:var(--md-primary-fg-color);color:var(--md-primary-bg-color);overflow:auto;width:100%}@media print{.md-tabs{display:none}}@media screen and (max-width:76.1875em){.md-tabs{display:none}}.md-tabs[data-md-state=hidden]{pointer-events:none}[dir=ltr] .md-tabs__list{margin-left:.2rem}[dir=rtl] .md-tabs__list{margin-right:.2rem}.md-tabs__list{contain:content;list-style:none;margin:0;padding:0;white-space:nowrap}.md-tabs__item{display:inline-block;height:2.4rem;padding-left:.6rem;padding-right:.6rem}.md-tabs__link{-webkit-backface-visibility:hidden;backface-visibility:hidden;display:block;font-size:.7rem;margin-top:.8rem;opacity:.7;outline-color:var(--md-accent-fg-color);outline-offset:.2rem;transition:transform .4s cubic-bezier(.1,.7,.1,1),opacity .25s}.md-tabs__link--active,.md-tabs__link:-webkit-any(:focus,:hover){color:inherit;opacity:1}.md-tabs__link--active,.md-tabs__link:-moz-any(:focus,:hover){color:inherit;opacity:1}.md-tabs__link--active,.md-tabs__link:is(:focus,:hover){color:inherit;opacity:1}.md-tabs__item:nth-child(2) .md-tabs__link{transition-delay:20ms}.md-tabs__item:nth-child(3) .md-tabs__link{transition-delay:40ms}.md-tabs__item:nth-child(4) .md-tabs__link{transition-delay:60ms}.md-tabs__item:nth-child(5) .md-tabs__link{transition-delay:80ms}.md-tabs__item:nth-child(6) .md-tabs__link{transition-delay:.1s}.md-tabs__item:nth-child(7) .md-tabs__link{transition-delay:.12s}.md-tabs__item:nth-child(8) .md-tabs__link{transition-delay:.14s}.md-tabs__item:nth-child(9) .md-tabs__link{transition-delay:.16s}.md-tabs__item:nth-child(10) .md-tabs__link{transition-delay:.18s}.md-tabs__item:nth-child(11) .md-tabs__link{transition-delay:.2s}.md-tabs__item:nth-child(12) .md-tabs__link{transition-delay:.22s}.md-tabs__item:nth-child(13) .md-tabs__link{transition-delay:.24s}.md-tabs__item:nth-child(14) .md-tabs__link{transition-delay:.26s}.md-tabs__item:nth-child(15) .md-tabs__link{transition-delay:.28s}.md-tabs__item:nth-child(16) .md-tabs__link{transition-delay:.3s}.md-tabs[data-md-state=hidden] .md-tabs__link{opacity:0;transform:translateY(50%);transition:transform 0ms .1s,opacity .1s}@-webkit-keyframes pulse{0%{box-shadow:0 0 0 0 var(--md-default-fg-color--lightest)}75%{box-shadow:0 0 0 .625em transparent}to{box-shadow:0 0 0 0 transparent}}@keyframes pulse{0%{box-shadow:0 0 0 0 var(--md-default-fg-color--lightest)}75%{box-shadow:0 0 0 .625em transparent}to{box-shadow:0 0 0 0 transparent}}:root{--md-tooltip-width:20rem}.md-tooltip{-webkit-backface-visibility:hidden;backface-visibility:hidden;background-color:var(--md-default-bg-color);border-radius:.1rem;box-shadow:var(--md-shadow-z2);color:var(--md-default-fg-color);left:clamp(var(--md-tooltip-0,0rem) + .8rem,var(--md-tooltip-x),(100vw + var(--md-tooltip-0,0rem) + .8rem - var(--md-tooltip-width) - 2 * .8rem));max-height:0;max-width:calc(100vw - 1.6rem);opacity:0;position:absolute;top:var(--md-tooltip-y);transform:translateY(-.4rem);transition:transform 0ms .25s,opacity .25s,max-height 0ms .25s,z-index .25s;width:var(--md-tooltip-width);z-index:0}:focus-within>.md-tooltip{max-height:1000%;opacity:1;transform:translateY(0);transition:transform .25s cubic-bezier(.1,.7,.1,1),opacity .25s,max-height .25s,z-index 0ms}.focus-visible>.md-tooltip{outline:var(--md-accent-fg-color) auto}.md-tooltip__inner{font-size:.64rem;padding:.8rem}.md-tooltip__inner.md-typeset>:first-child{margin-top:0}.md-tooltip__inner.md-typeset>:last-child{margin-bottom:0}.md-annotation{outline:none;white-space:normal}[dir=rtl] .md-annotation{direction:rtl}.md-annotation:not([hidden]){display:inline-block;line-height:1.325}.md-annotation:focus-within>*{z-index:2}.md-annotation__inner{font-family:var(--md-text-font-family);top:calc(var(--md-tooltip-y) + 1.2ch)}:not(:focus-within)>.md-annotation__inner{pointer-events:none;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.md-annotation__index{color:#fff;cursor:pointer;margin:0 1ch;position:relative;transition:z-index .25s;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;z-index:0}.md-annotation__index:after{-webkit-animation:pulse 2s infinite;animation:pulse 2s infinite;background-color:var(--md-default-fg-color--lighter);border-radius:2ch;content:"";height:2.2ch;left:-.126em;margin:0 -.4ch;padding:0 .4ch;position:absolute;top:.025em;transition:color .25s,background-color .25s;width:calc(100% + 1.2ch);width:max(2.2ch,100% + 1.2ch);z-index:-1}@media (prefers-reduced-motion){.md-annotation__index:after{-webkit-animation:none;animation:none}}:-webkit-any(:focus-within,:hover)>.md-annotation__index:after{background-color:var(--md-accent-fg-color)}:-moz-any(:focus-within,:hover)>.md-annotation__index:after{background-color:var(--md-accent-fg-color)}:is(:focus-within,:hover)>.md-annotation__index:after{background-color:var(--md-accent-fg-color)}:focus-within>.md-annotation__index:after{-webkit-animation:none;animation:none;transition:color .25s,background-color .25s}.md-annotation__index [data-md-annotation-id]:before{content:attr(data-md-annotation-id);display:inline-block;transition:transform .4s cubic-bezier(.1,.7,.1,1)}@media not print{.md-annotation__index [data-md-annotation-id]:before{content:"+"}:focus-within>.md-annotation__index [data-md-annotation-id]:before{transform:rotate(45deg)}}:-webkit-any(:focus-within,:hover)>.md-annotation__index{color:var(--md-accent-bg-color)}:-moz-any(:focus-within,:hover)>.md-annotation__index{color:var(--md-accent-bg-color)}:is(:focus-within,:hover)>.md-annotation__index{color:var(--md-accent-bg-color)}:focus-within>.md-annotation__index{-webkit-animation:none;animation:none;transition:none}[dir=ltr] .md-top{margin-left:50%}[dir=rtl] .md-top{margin-right:50%}.md-top{background-color:var(--md-default-bg-color);border-radius:1.6rem;box-shadow:var(--md-shadow-z2);color:var(--md-default-fg-color--light);font-size:.7rem;outline:none;padding:.4rem .8rem;position:fixed;top:3.2rem;transform:translate(-50%);transition:color 125ms,background-color 125ms,transform 125ms cubic-bezier(.4,0,.2,1),opacity 125ms;z-index:2}@media print{.md-top{display:none}}[dir=rtl] .md-top{transform:translate(50%)}.md-top[data-md-state=hidden]{opacity:0;pointer-events:none;transform:translate(-50%,.2rem);transition-duration:0ms}[dir=rtl] .md-top[data-md-state=hidden]{transform:translate(50%,.2rem)}.md-top:-webkit-any(:focus,:hover){background-color:var(--md-accent-fg-color);color:var(--md-accent-bg-color)}.md-top:-moz-any(:focus,:hover){background-color:var(--md-accent-fg-color);color:var(--md-accent-bg-color)}.md-top:is(:focus,:hover){background-color:var(--md-accent-fg-color);color:var(--md-accent-bg-color)}.md-top svg{display:inline-block;vertical-align:-.5em}@-webkit-keyframes hoverfix{0%{pointer-events:none}}@keyframes hoverfix{0%{pointer-events:none}}:root{--md-version-icon:url('data:image/svg+xml;charset=utf-8,')}.md-version{flex-shrink:0;font-size:.8rem;height:2.4rem}[dir=ltr] .md-version__current{margin-left:1.4rem;margin-right:.4rem}[dir=rtl] .md-version__current{margin-left:.4rem;margin-right:1.4rem}.md-version__current{color:inherit;cursor:pointer;outline:none;position:relative;top:.05rem}[dir=ltr] .md-version__current:after{margin-left:.4rem}[dir=rtl] .md-version__current:after{margin-right:.4rem}.md-version__current:after{background-color:currentcolor;content:"";display:inline-block;height:.6rem;-webkit-mask-image:var(--md-version-icon);mask-image:var(--md-version-icon);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;width:.4rem}.md-version__list{background-color:var(--md-default-bg-color);border-radius:.1rem;box-shadow:var(--md-shadow-z2);color:var(--md-default-fg-color);list-style-type:none;margin:.2rem .8rem;max-height:0;opacity:0;overflow:auto;padding:0;position:absolute;-ms-scroll-snap-type:y mandatory;scroll-snap-type:y mandatory;top:.15rem;transition:max-height 0ms .5s,opacity .25s .25s;z-index:3}.md-version:-webkit-any(:focus-within,:hover) .md-version__list{max-height:10rem;opacity:1;-webkit-transition:max-height 0ms,opacity .25s;transition:max-height 0ms,opacity .25s}.md-version:-moz-any(:focus-within,:hover) .md-version__list{max-height:10rem;opacity:1;-moz-transition:max-height 0ms,opacity .25s;transition:max-height 0ms,opacity .25s}.md-version:is(:focus-within,:hover) .md-version__list{max-height:10rem;opacity:1;transition:max-height 0ms,opacity .25s}@media (pointer:coarse){.md-version:hover .md-version__list{-webkit-animation:hoverfix .25s forwards;animation:hoverfix .25s forwards}.md-version:focus-within .md-version__list{-webkit-animation:none;animation:none}}.md-version__item{line-height:1.8rem}[dir=ltr] .md-version__link{padding-left:.6rem;padding-right:1.2rem}[dir=rtl] .md-version__link{padding-left:1.2rem;padding-right:.6rem}.md-version__link{cursor:pointer;display:block;outline:none;scroll-snap-align:start;transition:color .25s,background-color .25s;white-space:nowrap;width:100%}.md-version__link:-webkit-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-version__link:-moz-any(:focus,:hover){color:var(--md-accent-fg-color)}.md-version__link:is(:focus,:hover){color:var(--md-accent-fg-color)}.md-version__link:focus{background-color:var(--md-default-fg-color--lightest)}:root{--md-admonition-icon--note:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--abstract:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--info:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--tip:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--success:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--question:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--warning:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--failure:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--danger:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--bug:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--example:url('data:image/svg+xml;charset=utf-8,');--md-admonition-icon--quote:url('data:image/svg+xml;charset=utf-8,')}.md-typeset :-webkit-any(.admonition,details){background-color:var(--md-admonition-bg-color);border:0 solid #448aff;border-radius:.1rem;box-shadow:var(--md-shadow-z1);color:var(--md-admonition-fg-color);display:flow-root;font-size:.64rem;margin:1.5625em 0;padding:0 .6rem;page-break-inside:avoid}.md-typeset :-moz-any(.admonition,details){background-color:var(--md-admonition-bg-color);border:0 solid #448aff;border-radius:.1rem;box-shadow:var(--md-shadow-z1);color:var(--md-admonition-fg-color);display:flow-root;font-size:.64rem;margin:1.5625em 0;padding:0 .6rem;page-break-inside:avoid}[dir=ltr] .md-typeset :-webkit-any(.admonition,details){border-left-width:.2rem}[dir=ltr] .md-typeset :-moz-any(.admonition,details){border-left-width:.2rem}[dir=ltr] .md-typeset :is(.admonition,details){border-left-width:.2rem}[dir=rtl] .md-typeset :-webkit-any(.admonition,details){border-right-width:.2rem}[dir=rtl] .md-typeset :-moz-any(.admonition,details){border-right-width:.2rem}[dir=rtl] .md-typeset :is(.admonition,details){border-right-width:.2rem}.md-typeset :is(.admonition,details){background-color:var(--md-admonition-bg-color);border:0 solid #448aff;border-radius:.1rem;box-shadow:var(--md-shadow-z1);color:var(--md-admonition-fg-color);display:flow-root;font-size:.64rem;margin:1.5625em 0;padding:0 .6rem;page-break-inside:avoid}@media print{.md-typeset :-webkit-any(.admonition,details){box-shadow:none}.md-typeset :-moz-any(.admonition,details){box-shadow:none}.md-typeset :is(.admonition,details){box-shadow:none}}.md-typeset :-webkit-any(.admonition,details)>*{box-sizing:border-box}.md-typeset :-moz-any(.admonition,details)>*{box-sizing:border-box}.md-typeset :is(.admonition,details)>*{box-sizing:border-box}.md-typeset :-webkit-any(.admonition,details) :-webkit-any(.admonition,details){margin-bottom:1em;margin-top:1em}.md-typeset :-moz-any(.admonition,details) :-moz-any(.admonition,details){margin-bottom:1em;margin-top:1em}.md-typeset :is(.admonition,details) :is(.admonition,details){margin-bottom:1em;margin-top:1em}.md-typeset :-webkit-any(.admonition,details) .md-typeset__scrollwrap{margin:1em -.6rem}.md-typeset :-moz-any(.admonition,details) .md-typeset__scrollwrap{margin:1em -.6rem}.md-typeset :is(.admonition,details) .md-typeset__scrollwrap{margin:1em -.6rem}.md-typeset :-webkit-any(.admonition,details) .md-typeset__table{padding:0 .6rem}.md-typeset :-moz-any(.admonition,details) .md-typeset__table{padding:0 .6rem}.md-typeset :is(.admonition,details) .md-typeset__table{padding:0 .6rem}.md-typeset :-webkit-any(.admonition,details)>.tabbed-set:only-child{margin-top:0}.md-typeset :-moz-any(.admonition,details)>.tabbed-set:only-child{margin-top:0}.md-typeset :is(.admonition,details)>.tabbed-set:only-child{margin-top:0}html .md-typeset :-webkit-any(.admonition,details)>:last-child{margin-bottom:.6rem}html .md-typeset :-moz-any(.admonition,details)>:last-child{margin-bottom:.6rem}html .md-typeset :is(.admonition,details)>:last-child{margin-bottom:.6rem}.md-typeset :-webkit-any(.admonition-title,summary){background-color:rgba(68,138,255,.1);border:0 solid #448aff;font-weight:700;margin-bottom:0;margin-top:0;padding-bottom:.4rem;padding-top:.4rem;position:relative}.md-typeset :-moz-any(.admonition-title,summary){background-color:rgba(68,138,255,.1);border:0 solid #448aff;font-weight:700;margin-bottom:0;margin-top:0;padding-bottom:.4rem;padding-top:.4rem;position:relative}[dir=ltr] .md-typeset :-webkit-any(.admonition-title,summary){margin-left:-.8rem;margin-right:-.6rem}[dir=ltr] .md-typeset :-moz-any(.admonition-title,summary){margin-left:-.8rem;margin-right:-.6rem}[dir=ltr] .md-typeset :is(.admonition-title,summary){margin-left:-.8rem;margin-right:-.6rem}[dir=rtl] .md-typeset :-webkit-any(.admonition-title,summary){margin-left:-.6rem;margin-right:-.8rem}[dir=rtl] .md-typeset :-moz-any(.admonition-title,summary){margin-left:-.6rem;margin-right:-.8rem}[dir=rtl] .md-typeset :is(.admonition-title,summary){margin-left:-.6rem;margin-right:-.8rem}[dir=ltr] .md-typeset :-webkit-any(.admonition-title,summary){padding-left:2rem;padding-right:.6rem}[dir=ltr] .md-typeset :-moz-any(.admonition-title,summary){padding-left:2rem;padding-right:.6rem}[dir=ltr] .md-typeset :is(.admonition-title,summary){padding-left:2rem;padding-right:.6rem}[dir=rtl] .md-typeset :-webkit-any(.admonition-title,summary){padding-left:.6rem;padding-right:2rem}[dir=rtl] .md-typeset :-moz-any(.admonition-title,summary){padding-left:.6rem;padding-right:2rem}[dir=rtl] .md-typeset :is(.admonition-title,summary){padding-left:.6rem;padding-right:2rem}[dir=ltr] .md-typeset :-webkit-any(.admonition-title,summary){border-left-width:.2rem}[dir=ltr] .md-typeset :-moz-any(.admonition-title,summary){border-left-width:.2rem}[dir=ltr] .md-typeset :is(.admonition-title,summary){border-left-width:.2rem}[dir=rtl] .md-typeset :-webkit-any(.admonition-title,summary){border-right-width:.2rem}[dir=rtl] .md-typeset :-moz-any(.admonition-title,summary){border-right-width:.2rem}[dir=rtl] .md-typeset :is(.admonition-title,summary){border-right-width:.2rem}[dir=ltr] .md-typeset :-webkit-any(.admonition-title,summary){border-top-left-radius:.1rem}[dir=ltr] .md-typeset :-moz-any(.admonition-title,summary){border-top-left-radius:.1rem}[dir=ltr] .md-typeset :is(.admonition-title,summary){border-top-left-radius:.1rem}[dir=rtl] .md-typeset :-webkit-any(.admonition-title,summary){border-top-right-radius:.1rem}[dir=rtl] .md-typeset :-moz-any(.admonition-title,summary){border-top-right-radius:.1rem}[dir=rtl] .md-typeset :is(.admonition-title,summary){border-top-right-radius:.1rem}.md-typeset :is(.admonition-title,summary){background-color:rgba(68,138,255,.1);border:0 solid #448aff;font-weight:700;margin-bottom:0;margin-top:0;padding-bottom:.4rem;padding-top:.4rem;position:relative}html .md-typeset :-webkit-any(.admonition-title,summary):last-child{margin-bottom:0}html .md-typeset :-moz-any(.admonition-title,summary):last-child{margin-bottom:0}html .md-typeset :is(.admonition-title,summary):last-child{margin-bottom:0}.md-typeset :-webkit-any(.admonition-title,summary):before{background-color:#448aff;content:"";height:1rem;-webkit-mask-image:var(--md-admonition-icon--note);mask-image:var(--md-admonition-icon--note);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;position:absolute;top:.625em;width:1rem}.md-typeset :-moz-any(.admonition-title,summary):before{background-color:#448aff;content:"";height:1rem;mask-image:var(--md-admonition-icon--note);mask-repeat:no-repeat;mask-size:contain;position:absolute;top:.625em;width:1rem}[dir=ltr] .md-typeset :-webkit-any(.admonition-title,summary):before{left:.6rem}[dir=ltr] .md-typeset :-moz-any(.admonition-title,summary):before{left:.6rem}[dir=ltr] .md-typeset :is(.admonition-title,summary):before{left:.6rem}[dir=rtl] .md-typeset :-webkit-any(.admonition-title,summary):before{right:.6rem}[dir=rtl] .md-typeset :-moz-any(.admonition-title,summary):before{right:.6rem}[dir=rtl] .md-typeset :is(.admonition-title,summary):before{right:.6rem}.md-typeset :is(.admonition-title,summary):before{background-color:#448aff;content:"";height:1rem;-webkit-mask-image:var(--md-admonition-icon--note);mask-image:var(--md-admonition-icon--note);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;position:absolute;top:.625em;width:1rem}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.note){border-color:#448aff}.md-typeset :-moz-any(.admonition,details):-moz-any(.note){border-color:#448aff}.md-typeset :is(.admonition,details):is(.note){border-color:#448aff}.md-typeset :-webkit-any(.note)>:-webkit-any(.admonition-title,summary){background-color:rgba(68,138,255,.1);border-color:#448aff}.md-typeset :-moz-any(.note)>:-moz-any(.admonition-title,summary){background-color:rgba(68,138,255,.1);border-color:#448aff}.md-typeset :is(.note)>:is(.admonition-title,summary){background-color:rgba(68,138,255,.1);border-color:#448aff}.md-typeset :-webkit-any(.note)>:-webkit-any(.admonition-title,summary):before{background-color:#448aff;-webkit-mask-image:var(--md-admonition-icon--note);mask-image:var(--md-admonition-icon--note);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.note)>:-moz-any(.admonition-title,summary):before{background-color:#448aff;mask-image:var(--md-admonition-icon--note);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.note)>:is(.admonition-title,summary):before{background-color:#448aff;-webkit-mask-image:var(--md-admonition-icon--note);mask-image:var(--md-admonition-icon--note);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.abstract,.summary,.tldr){border-color:#00b0ff}.md-typeset :-moz-any(.admonition,details):-moz-any(.abstract,.summary,.tldr){border-color:#00b0ff}.md-typeset :is(.admonition,details):is(.abstract,.summary,.tldr){border-color:#00b0ff}.md-typeset :-webkit-any(.abstract,.summary,.tldr)>:-webkit-any(.admonition-title,summary){background-color:rgba(0,176,255,.1);border-color:#00b0ff}.md-typeset :-moz-any(.abstract,.summary,.tldr)>:-moz-any(.admonition-title,summary){background-color:rgba(0,176,255,.1);border-color:#00b0ff}.md-typeset :is(.abstract,.summary,.tldr)>:is(.admonition-title,summary){background-color:rgba(0,176,255,.1);border-color:#00b0ff}.md-typeset :-webkit-any(.abstract,.summary,.tldr)>:-webkit-any(.admonition-title,summary):before{background-color:#00b0ff;-webkit-mask-image:var(--md-admonition-icon--abstract);mask-image:var(--md-admonition-icon--abstract);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.abstract,.summary,.tldr)>:-moz-any(.admonition-title,summary):before{background-color:#00b0ff;mask-image:var(--md-admonition-icon--abstract);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.abstract,.summary,.tldr)>:is(.admonition-title,summary):before{background-color:#00b0ff;-webkit-mask-image:var(--md-admonition-icon--abstract);mask-image:var(--md-admonition-icon--abstract);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.info,.todo){border-color:#00b8d4}.md-typeset :-moz-any(.admonition,details):-moz-any(.info,.todo){border-color:#00b8d4}.md-typeset :is(.admonition,details):is(.info,.todo){border-color:#00b8d4}.md-typeset :-webkit-any(.info,.todo)>:-webkit-any(.admonition-title,summary){background-color:rgba(0,184,212,.1);border-color:#00b8d4}.md-typeset :-moz-any(.info,.todo)>:-moz-any(.admonition-title,summary){background-color:rgba(0,184,212,.1);border-color:#00b8d4}.md-typeset :is(.info,.todo)>:is(.admonition-title,summary){background-color:rgba(0,184,212,.1);border-color:#00b8d4}.md-typeset :-webkit-any(.info,.todo)>:-webkit-any(.admonition-title,summary):before{background-color:#00b8d4;-webkit-mask-image:var(--md-admonition-icon--info);mask-image:var(--md-admonition-icon--info);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.info,.todo)>:-moz-any(.admonition-title,summary):before{background-color:#00b8d4;mask-image:var(--md-admonition-icon--info);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.info,.todo)>:is(.admonition-title,summary):before{background-color:#00b8d4;-webkit-mask-image:var(--md-admonition-icon--info);mask-image:var(--md-admonition-icon--info);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.tip,.hint,.important){border-color:#00bfa5}.md-typeset :-moz-any(.admonition,details):-moz-any(.tip,.hint,.important){border-color:#00bfa5}.md-typeset :is(.admonition,details):is(.tip,.hint,.important){border-color:#00bfa5}.md-typeset :-webkit-any(.tip,.hint,.important)>:-webkit-any(.admonition-title,summary){background-color:rgba(0,191,165,.1);border-color:#00bfa5}.md-typeset :-moz-any(.tip,.hint,.important)>:-moz-any(.admonition-title,summary){background-color:rgba(0,191,165,.1);border-color:#00bfa5}.md-typeset :is(.tip,.hint,.important)>:is(.admonition-title,summary){background-color:rgba(0,191,165,.1);border-color:#00bfa5}.md-typeset :-webkit-any(.tip,.hint,.important)>:-webkit-any(.admonition-title,summary):before{background-color:#00bfa5;-webkit-mask-image:var(--md-admonition-icon--tip);mask-image:var(--md-admonition-icon--tip);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.tip,.hint,.important)>:-moz-any(.admonition-title,summary):before{background-color:#00bfa5;mask-image:var(--md-admonition-icon--tip);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.tip,.hint,.important)>:is(.admonition-title,summary):before{background-color:#00bfa5;-webkit-mask-image:var(--md-admonition-icon--tip);mask-image:var(--md-admonition-icon--tip);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.success,.check,.done){border-color:#00c853}.md-typeset :-moz-any(.admonition,details):-moz-any(.success,.check,.done){border-color:#00c853}.md-typeset :is(.admonition,details):is(.success,.check,.done){border-color:#00c853}.md-typeset :-webkit-any(.success,.check,.done)>:-webkit-any(.admonition-title,summary){background-color:rgba(0,200,83,.1);border-color:#00c853}.md-typeset :-moz-any(.success,.check,.done)>:-moz-any(.admonition-title,summary){background-color:rgba(0,200,83,.1);border-color:#00c853}.md-typeset :is(.success,.check,.done)>:is(.admonition-title,summary){background-color:rgba(0,200,83,.1);border-color:#00c853}.md-typeset :-webkit-any(.success,.check,.done)>:-webkit-any(.admonition-title,summary):before{background-color:#00c853;-webkit-mask-image:var(--md-admonition-icon--success);mask-image:var(--md-admonition-icon--success);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.success,.check,.done)>:-moz-any(.admonition-title,summary):before{background-color:#00c853;mask-image:var(--md-admonition-icon--success);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.success,.check,.done)>:is(.admonition-title,summary):before{background-color:#00c853;-webkit-mask-image:var(--md-admonition-icon--success);mask-image:var(--md-admonition-icon--success);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.question,.help,.faq){border-color:#64dd17}.md-typeset :-moz-any(.admonition,details):-moz-any(.question,.help,.faq){border-color:#64dd17}.md-typeset :is(.admonition,details):is(.question,.help,.faq){border-color:#64dd17}.md-typeset :-webkit-any(.question,.help,.faq)>:-webkit-any(.admonition-title,summary){background-color:rgba(100,221,23,.1);border-color:#64dd17}.md-typeset :-moz-any(.question,.help,.faq)>:-moz-any(.admonition-title,summary){background-color:rgba(100,221,23,.1);border-color:#64dd17}.md-typeset :is(.question,.help,.faq)>:is(.admonition-title,summary){background-color:rgba(100,221,23,.1);border-color:#64dd17}.md-typeset :-webkit-any(.question,.help,.faq)>:-webkit-any(.admonition-title,summary):before{background-color:#64dd17;-webkit-mask-image:var(--md-admonition-icon--question);mask-image:var(--md-admonition-icon--question);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.question,.help,.faq)>:-moz-any(.admonition-title,summary):before{background-color:#64dd17;mask-image:var(--md-admonition-icon--question);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.question,.help,.faq)>:is(.admonition-title,summary):before{background-color:#64dd17;-webkit-mask-image:var(--md-admonition-icon--question);mask-image:var(--md-admonition-icon--question);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.warning,.caution,.attention){border-color:#ff9100}.md-typeset :-moz-any(.admonition,details):-moz-any(.warning,.caution,.attention){border-color:#ff9100}.md-typeset :is(.admonition,details):is(.warning,.caution,.attention){border-color:#ff9100}.md-typeset :-webkit-any(.warning,.caution,.attention)>:-webkit-any(.admonition-title,summary){background-color:rgba(255,145,0,.1);border-color:#ff9100}.md-typeset :-moz-any(.warning,.caution,.attention)>:-moz-any(.admonition-title,summary){background-color:rgba(255,145,0,.1);border-color:#ff9100}.md-typeset :is(.warning,.caution,.attention)>:is(.admonition-title,summary){background-color:rgba(255,145,0,.1);border-color:#ff9100}.md-typeset :-webkit-any(.warning,.caution,.attention)>:-webkit-any(.admonition-title,summary):before{background-color:#ff9100;-webkit-mask-image:var(--md-admonition-icon--warning);mask-image:var(--md-admonition-icon--warning);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.warning,.caution,.attention)>:-moz-any(.admonition-title,summary):before{background-color:#ff9100;mask-image:var(--md-admonition-icon--warning);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.warning,.caution,.attention)>:is(.admonition-title,summary):before{background-color:#ff9100;-webkit-mask-image:var(--md-admonition-icon--warning);mask-image:var(--md-admonition-icon--warning);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.failure,.fail,.missing){border-color:#ff5252}.md-typeset :-moz-any(.admonition,details):-moz-any(.failure,.fail,.missing){border-color:#ff5252}.md-typeset :is(.admonition,details):is(.failure,.fail,.missing){border-color:#ff5252}.md-typeset :-webkit-any(.failure,.fail,.missing)>:-webkit-any(.admonition-title,summary){background-color:rgba(255,82,82,.1);border-color:#ff5252}.md-typeset :-moz-any(.failure,.fail,.missing)>:-moz-any(.admonition-title,summary){background-color:rgba(255,82,82,.1);border-color:#ff5252}.md-typeset :is(.failure,.fail,.missing)>:is(.admonition-title,summary){background-color:rgba(255,82,82,.1);border-color:#ff5252}.md-typeset :-webkit-any(.failure,.fail,.missing)>:-webkit-any(.admonition-title,summary):before{background-color:#ff5252;-webkit-mask-image:var(--md-admonition-icon--failure);mask-image:var(--md-admonition-icon--failure);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.failure,.fail,.missing)>:-moz-any(.admonition-title,summary):before{background-color:#ff5252;mask-image:var(--md-admonition-icon--failure);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.failure,.fail,.missing)>:is(.admonition-title,summary):before{background-color:#ff5252;-webkit-mask-image:var(--md-admonition-icon--failure);mask-image:var(--md-admonition-icon--failure);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.danger,.error){border-color:#ff1744}.md-typeset :-moz-any(.admonition,details):-moz-any(.danger,.error){border-color:#ff1744}.md-typeset :is(.admonition,details):is(.danger,.error){border-color:#ff1744}.md-typeset :-webkit-any(.danger,.error)>:-webkit-any(.admonition-title,summary){background-color:rgba(255,23,68,.1);border-color:#ff1744}.md-typeset :-moz-any(.danger,.error)>:-moz-any(.admonition-title,summary){background-color:rgba(255,23,68,.1);border-color:#ff1744}.md-typeset :is(.danger,.error)>:is(.admonition-title,summary){background-color:rgba(255,23,68,.1);border-color:#ff1744}.md-typeset :-webkit-any(.danger,.error)>:-webkit-any(.admonition-title,summary):before{background-color:#ff1744;-webkit-mask-image:var(--md-admonition-icon--danger);mask-image:var(--md-admonition-icon--danger);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.danger,.error)>:-moz-any(.admonition-title,summary):before{background-color:#ff1744;mask-image:var(--md-admonition-icon--danger);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.danger,.error)>:is(.admonition-title,summary):before{background-color:#ff1744;-webkit-mask-image:var(--md-admonition-icon--danger);mask-image:var(--md-admonition-icon--danger);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.bug){border-color:#f50057}.md-typeset :-moz-any(.admonition,details):-moz-any(.bug){border-color:#f50057}.md-typeset :is(.admonition,details):is(.bug){border-color:#f50057}.md-typeset :-webkit-any(.bug)>:-webkit-any(.admonition-title,summary){background-color:rgba(245,0,87,.1);border-color:#f50057}.md-typeset :-moz-any(.bug)>:-moz-any(.admonition-title,summary){background-color:rgba(245,0,87,.1);border-color:#f50057}.md-typeset :is(.bug)>:is(.admonition-title,summary){background-color:rgba(245,0,87,.1);border-color:#f50057}.md-typeset :-webkit-any(.bug)>:-webkit-any(.admonition-title,summary):before{background-color:#f50057;-webkit-mask-image:var(--md-admonition-icon--bug);mask-image:var(--md-admonition-icon--bug);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.bug)>:-moz-any(.admonition-title,summary):before{background-color:#f50057;mask-image:var(--md-admonition-icon--bug);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.bug)>:is(.admonition-title,summary):before{background-color:#f50057;-webkit-mask-image:var(--md-admonition-icon--bug);mask-image:var(--md-admonition-icon--bug);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.example){border-color:#7c4dff}.md-typeset :-moz-any(.admonition,details):-moz-any(.example){border-color:#7c4dff}.md-typeset :is(.admonition,details):is(.example){border-color:#7c4dff}.md-typeset :-webkit-any(.example)>:-webkit-any(.admonition-title,summary){background-color:rgba(124,77,255,.1);border-color:#7c4dff}.md-typeset :-moz-any(.example)>:-moz-any(.admonition-title,summary){background-color:rgba(124,77,255,.1);border-color:#7c4dff}.md-typeset :is(.example)>:is(.admonition-title,summary){background-color:rgba(124,77,255,.1);border-color:#7c4dff}.md-typeset :-webkit-any(.example)>:-webkit-any(.admonition-title,summary):before{background-color:#7c4dff;-webkit-mask-image:var(--md-admonition-icon--example);mask-image:var(--md-admonition-icon--example);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.example)>:-moz-any(.admonition-title,summary):before{background-color:#7c4dff;mask-image:var(--md-admonition-icon--example);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.example)>:is(.admonition-title,summary):before{background-color:#7c4dff;-webkit-mask-image:var(--md-admonition-icon--example);mask-image:var(--md-admonition-icon--example);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-webkit-any(.admonition,details):-webkit-any(.quote,.cite){border-color:#9e9e9e}.md-typeset :-moz-any(.admonition,details):-moz-any(.quote,.cite){border-color:#9e9e9e}.md-typeset :is(.admonition,details):is(.quote,.cite){border-color:#9e9e9e}.md-typeset :-webkit-any(.quote,.cite)>:-webkit-any(.admonition-title,summary){background-color:hsla(0,0%,62%,.1);border-color:#9e9e9e}.md-typeset :-moz-any(.quote,.cite)>:-moz-any(.admonition-title,summary){background-color:hsla(0,0%,62%,.1);border-color:#9e9e9e}.md-typeset :is(.quote,.cite)>:is(.admonition-title,summary){background-color:hsla(0,0%,62%,.1);border-color:#9e9e9e}.md-typeset :-webkit-any(.quote,.cite)>:-webkit-any(.admonition-title,summary):before{background-color:#9e9e9e;-webkit-mask-image:var(--md-admonition-icon--quote);mask-image:var(--md-admonition-icon--quote);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}.md-typeset :-moz-any(.quote,.cite)>:-moz-any(.admonition-title,summary):before{background-color:#9e9e9e;mask-image:var(--md-admonition-icon--quote);mask-repeat:no-repeat;mask-size:contain}.md-typeset :is(.quote,.cite)>:is(.admonition-title,summary):before{background-color:#9e9e9e;-webkit-mask-image:var(--md-admonition-icon--quote);mask-image:var(--md-admonition-icon--quote);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain}:root{--md-footnotes-icon:url('data:image/svg+xml;charset=utf-8,')}.md-typeset .footnote{color:var(--md-default-fg-color--light);font-size:.64rem}[dir=ltr] .md-typeset .footnote>ol{margin-left:0}[dir=rtl] .md-typeset .footnote>ol{margin-right:0}.md-typeset .footnote>ol>li{transition:color 125ms}.md-typeset .footnote>ol>li:target{color:var(--md-default-fg-color)}.md-typeset .footnote>ol>li:focus-within .footnote-backref{opacity:1;transform:translateX(0);transition:none}.md-typeset .footnote>ol>li:-webkit-any(:hover,:target) .footnote-backref{opacity:1;transform:translateX(0)}.md-typeset .footnote>ol>li:-moz-any(:hover,:target) .footnote-backref{opacity:1;transform:translateX(0)}.md-typeset .footnote>ol>li:is(:hover,:target) .footnote-backref{opacity:1;transform:translateX(0)}.md-typeset .footnote>ol>li>:first-child{margin-top:0}.md-typeset .footnote-ref{font-size:.75em;font-weight:700}html .md-typeset .footnote-ref{outline-offset:.1rem}.md-typeset [id^="fnref:"]:target>.footnote-ref{outline:auto}.md-typeset .footnote-backref{color:var(--md-typeset-a-color);display:inline-block;font-size:0;opacity:0;transform:translateX(.25rem);transition:color .25s,transform .25s .25s,opacity 125ms .25s;vertical-align:text-bottom}@media print{.md-typeset .footnote-backref{color:var(--md-typeset-a-color);opacity:1;transform:translateX(0)}}[dir=rtl] .md-typeset .footnote-backref{transform:translateX(-.25rem)}.md-typeset .footnote-backref:hover{color:var(--md-accent-fg-color)}.md-typeset .footnote-backref:before{background-color:currentcolor;content:"";display:inline-block;height:.8rem;-webkit-mask-image:var(--md-footnotes-icon);mask-image:var(--md-footnotes-icon);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;width:.8rem}[dir=rtl] .md-typeset .footnote-backref:before svg{transform:scaleX(-1)}[dir=ltr] .md-typeset .headerlink{margin-left:.5rem}[dir=rtl] .md-typeset .headerlink{margin-right:.5rem}.md-typeset .headerlink{color:var(--md-default-fg-color--lighter);display:inline-block;opacity:0;transition:color .25s,opacity 125ms}@media print{.md-typeset .headerlink{display:none}}.md-typeset .headerlink:focus,.md-typeset :-webkit-any(:hover,:target)>.headerlink{opacity:1;-webkit-transition:color .25s,opacity 125ms;transition:color .25s,opacity 125ms}.md-typeset .headerlink:focus,.md-typeset :-moz-any(:hover,:target)>.headerlink{opacity:1;-moz-transition:color .25s,opacity 125ms;transition:color .25s,opacity 125ms}.md-typeset .headerlink:focus,.md-typeset :is(:hover,:target)>.headerlink{opacity:1;transition:color .25s,opacity 125ms}.md-typeset .headerlink:-webkit-any(:focus,:hover),.md-typeset :target>.headerlink{color:var(--md-accent-fg-color)}.md-typeset .headerlink:-moz-any(:focus,:hover),.md-typeset :target>.headerlink{color:var(--md-accent-fg-color)}.md-typeset .headerlink:is(:focus,:hover),.md-typeset :target>.headerlink{color:var(--md-accent-fg-color)}.md-typeset :target{--md-scroll-margin:3.6rem;--md-scroll-offset:0rem;scroll-margin-top:calc(var(--md-scroll-margin) - var(--md-scroll-offset))}@media screen and (min-width:76.25em){.md-header--lifted~.md-container .md-typeset :target{--md-scroll-margin:6rem}}.md-typeset :-webkit-any(h1,h2,h3):target{--md-scroll-offset:0.2rem}.md-typeset :-moz-any(h1,h2,h3):target{--md-scroll-offset:0.2rem}.md-typeset :is(h1,h2,h3):target{--md-scroll-offset:0.2rem}.md-typeset h4:target{--md-scroll-offset:0.15rem}.md-typeset div.arithmatex{overflow:auto}@media screen and (max-width:44.9375em){.md-typeset div.arithmatex{margin:0 -.8rem}}.md-typeset div.arithmatex>*{margin-left:auto!important;margin-right:auto!important;padding:0 .8rem;touch-action:auto;width:-webkit-min-content;width:-moz-min-content;width:min-content}.md-typeset div.arithmatex>* mjx-container{margin:0!important}.md-typeset :-webkit-any(del,ins,.comment).critic{-webkit-box-decoration-break:clone;box-decoration-break:clone}.md-typeset :-moz-any(del,ins,.comment).critic{box-decoration-break:clone}.md-typeset :is(del,ins,.comment).critic{-webkit-box-decoration-break:clone;box-decoration-break:clone}.md-typeset del.critic{background-color:var(--md-typeset-del-color)}.md-typeset ins.critic{background-color:var(--md-typeset-ins-color)}.md-typeset .critic.comment{color:var(--md-code-hl-comment-color)}.md-typeset .critic.comment:before{content:"/* "}.md-typeset .critic.comment:after{content:" */"}.md-typeset .critic.block{box-shadow:none;display:block;margin:1em 0;overflow:auto;padding-left:.8rem;padding-right:.8rem}.md-typeset .critic.block>:first-child{margin-top:.5em}.md-typeset .critic.block>:last-child{margin-bottom:.5em}:root{--md-details-icon:url('data:image/svg+xml;charset=utf-8,')}.md-typeset details{display:flow-root;overflow:visible;padding-top:0}.md-typeset details[open]>summary:after{transform:rotate(90deg)}.md-typeset details:not([open]){box-shadow:none;padding-bottom:0}.md-typeset details:not([open])>summary{border-radius:.1rem}[dir=ltr] .md-typeset summary{padding-right:1.8rem}[dir=rtl] .md-typeset summary{padding-left:1.8rem}[dir=ltr] .md-typeset summary{border-top-left-radius:.1rem}[dir=rtl] .md-typeset summary{border-top-right-radius:.1rem}[dir=ltr] .md-typeset summary{border-top-right-radius:.1rem}[dir=rtl] .md-typeset summary{border-top-left-radius:.1rem}.md-typeset summary{cursor:pointer;display:block;min-height:1rem}.md-typeset summary.focus-visible{outline-color:var(--md-accent-fg-color);outline-offset:.2rem}.md-typeset summary:not(.focus-visible){-webkit-tap-highlight-color:transparent;outline:none}[dir=ltr] .md-typeset summary:after{right:.4rem}[dir=rtl] .md-typeset summary:after{left:.4rem}.md-typeset summary:after{background-color:currentcolor;content:"";height:1rem;-webkit-mask-image:var(--md-details-icon);mask-image:var(--md-details-icon);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;position:absolute;top:.625em;transform:rotate(0deg);transition:transform .25s;width:1rem}[dir=rtl] .md-typeset summary:after{transform:rotate(180deg)}.md-typeset summary::marker{display:none}.md-typeset summary::-webkit-details-marker{display:none}.md-typeset :-webkit-any(.emojione,.twemoji,.gemoji){display:inline-flex;height:1.125em;vertical-align:text-top}.md-typeset :-moz-any(.emojione,.twemoji,.gemoji){display:inline-flex;height:1.125em;vertical-align:text-top}.md-typeset :is(.emojione,.twemoji,.gemoji){display:inline-flex;height:1.125em;vertical-align:text-top}.md-typeset :-webkit-any(.emojione,.twemoji,.gemoji) svg{fill:currentcolor;max-height:100%;width:1.125em}.md-typeset :-moz-any(.emojione,.twemoji,.gemoji) svg{fill:currentcolor;max-height:100%;width:1.125em}.md-typeset :is(.emojione,.twemoji,.gemoji) svg{fill:currentcolor;max-height:100%;width:1.125em}.highlight :-webkit-any(.o,.ow){color:var(--md-code-hl-operator-color)}.highlight :-moz-any(.o,.ow){color:var(--md-code-hl-operator-color)}.highlight :is(.o,.ow){color:var(--md-code-hl-operator-color)}.highlight .p{color:var(--md-code-hl-punctuation-color)}.highlight :-webkit-any(.cpf,.l,.s,.sb,.sc,.s2,.si,.s1,.ss){color:var(--md-code-hl-string-color)}.highlight :-moz-any(.cpf,.l,.s,.sb,.sc,.s2,.si,.s1,.ss){color:var(--md-code-hl-string-color)}.highlight :is(.cpf,.l,.s,.sb,.sc,.s2,.si,.s1,.ss){color:var(--md-code-hl-string-color)}.highlight :-webkit-any(.cp,.se,.sh,.sr,.sx){color:var(--md-code-hl-special-color)}.highlight :-moz-any(.cp,.se,.sh,.sr,.sx){color:var(--md-code-hl-special-color)}.highlight :is(.cp,.se,.sh,.sr,.sx){color:var(--md-code-hl-special-color)}.highlight :-webkit-any(.m,.mb,.mf,.mh,.mi,.il,.mo){color:var(--md-code-hl-number-color)}.highlight :-moz-any(.m,.mb,.mf,.mh,.mi,.il,.mo){color:var(--md-code-hl-number-color)}.highlight :is(.m,.mb,.mf,.mh,.mi,.il,.mo){color:var(--md-code-hl-number-color)}.highlight :-webkit-any(.k,.kd,.kn,.kp,.kr,.kt){color:var(--md-code-hl-keyword-color)}.highlight :-moz-any(.k,.kd,.kn,.kp,.kr,.kt){color:var(--md-code-hl-keyword-color)}.highlight :is(.k,.kd,.kn,.kp,.kr,.kt){color:var(--md-code-hl-keyword-color)}.highlight :-webkit-any(.kc,.n){color:var(--md-code-hl-name-color)}.highlight :-moz-any(.kc,.n){color:var(--md-code-hl-name-color)}.highlight :is(.kc,.n){color:var(--md-code-hl-name-color)}.highlight :-webkit-any(.no,.nb,.bp){color:var(--md-code-hl-constant-color)}.highlight :-moz-any(.no,.nb,.bp){color:var(--md-code-hl-constant-color)}.highlight :is(.no,.nb,.bp){color:var(--md-code-hl-constant-color)}.highlight :-webkit-any(.nc,.ne,.nf,.nn){color:var(--md-code-hl-function-color)}.highlight :-moz-any(.nc,.ne,.nf,.nn){color:var(--md-code-hl-function-color)}.highlight :is(.nc,.ne,.nf,.nn){color:var(--md-code-hl-function-color)}.highlight :-webkit-any(.nd,.ni,.nl,.nt){color:var(--md-code-hl-keyword-color)}.highlight :-moz-any(.nd,.ni,.nl,.nt){color:var(--md-code-hl-keyword-color)}.highlight :is(.nd,.ni,.nl,.nt){color:var(--md-code-hl-keyword-color)}.highlight :-webkit-any(.c,.cm,.c1,.ch,.cs,.sd){color:var(--md-code-hl-comment-color)}.highlight :-moz-any(.c,.cm,.c1,.ch,.cs,.sd){color:var(--md-code-hl-comment-color)}.highlight :is(.c,.cm,.c1,.ch,.cs,.sd){color:var(--md-code-hl-comment-color)}.highlight :-webkit-any(.na,.nv,.vc,.vg,.vi){color:var(--md-code-hl-variable-color)}.highlight :-moz-any(.na,.nv,.vc,.vg,.vi){color:var(--md-code-hl-variable-color)}.highlight :is(.na,.nv,.vc,.vg,.vi){color:var(--md-code-hl-variable-color)}.highlight :-webkit-any(.ge,.gr,.gh,.go,.gp,.gs,.gu,.gt){color:var(--md-code-hl-generic-color)}.highlight :-moz-any(.ge,.gr,.gh,.go,.gp,.gs,.gu,.gt){color:var(--md-code-hl-generic-color)}.highlight :is(.ge,.gr,.gh,.go,.gp,.gs,.gu,.gt){color:var(--md-code-hl-generic-color)}.highlight :-webkit-any(.gd,.gi){border-radius:.1rem;margin:0 -.125em;padding:0 .125em}.highlight :-moz-any(.gd,.gi){border-radius:.1rem;margin:0 -.125em;padding:0 .125em}.highlight :is(.gd,.gi){border-radius:.1rem;margin:0 -.125em;padding:0 .125em}.highlight .gd{background-color:var(--md-typeset-del-color)}.highlight .gi{background-color:var(--md-typeset-ins-color)}.highlight .hll{background-color:var(--md-code-hl-color);display:block;margin:0 -1.1764705882em;padding:0 1.1764705882em}.highlight span.filename{background-color:var(--md-code-bg-color);border-bottom:.05rem solid var(--md-default-fg-color--lightest);border-top-left-radius:.1rem;border-top-right-radius:.1rem;display:block;font-size:.85em;font-weight:700;margin-top:1em;padding:.6617647059em 1.1764705882em;position:relative}.highlight span.filename+pre{margin-top:0}.highlight span.filename+pre>code{border-top-left-radius:0;border-top-right-radius:0}.highlight [data-linenos]:before{background-color:var(--md-code-bg-color);box-shadow:-.05rem 0 var(--md-default-fg-color--lightest) inset;color:var(--md-default-fg-color--light);content:attr(data-linenos);float:left;left:-1.1764705882em;margin-left:-1.1764705882em;margin-right:1.1764705882em;padding-left:1.1764705882em;position:-webkit-sticky;position:sticky;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none;z-index:3}.highlight code a[id]{position:absolute;visibility:hidden}.highlight code[data-md-copying] .hll{display:contents}.highlight code[data-md-copying] .md-annotation{display:none}.highlighttable{display:flow-root}.highlighttable :-webkit-any(tbody,td){display:block;padding:0}.highlighttable :-moz-any(tbody,td){display:block;padding:0}.highlighttable :is(tbody,td){display:block;padding:0}.highlighttable tr{display:flex}.highlighttable pre{margin:0}.highlighttable th.filename{flex-grow:1;padding:0;text-align:left}.highlighttable .linenos{background-color:var(--md-code-bg-color);border-bottom-left-radius:.1rem;border-top-left-radius:.1rem;font-size:.85em;padding:.7720588235em 0 .7720588235em 1.1764705882em;-webkit-user-select:none;-moz-user-select:none;-ms-user-select:none;user-select:none}.highlighttable .linenodiv{box-shadow:-.05rem 0 var(--md-default-fg-color--lightest) inset;padding-right:.5882352941em}.highlighttable .linenodiv pre{color:var(--md-default-fg-color--light);text-align:right}.highlighttable .code{flex:1;min-width:0}.linenodiv a{color:inherit}.md-typeset .highlighttable{direction:ltr;margin:1em 0}.md-typeset .highlighttable code{border-bottom-left-radius:0;border-top-left-radius:0}.md-typeset :-webkit-any(.highlight,.highlighttable)+.result{border:.05rem solid var(--md-code-bg-color);border-bottom-left-radius:.1rem;border-bottom-right-radius:.1rem;border-top-width:.1rem;margin-top:-1.125em;overflow:visible;padding:0 1em}.md-typeset :-moz-any(.highlight,.highlighttable)+.result{border:.05rem solid var(--md-code-bg-color);border-bottom-left-radius:.1rem;border-bottom-right-radius:.1rem;border-top-width:.1rem;margin-top:-1.125em;overflow:visible;padding:0 1em}.md-typeset :is(.highlight,.highlighttable)+.result{border:.05rem solid var(--md-code-bg-color);border-bottom-left-radius:.1rem;border-bottom-right-radius:.1rem;border-top-width:.1rem;margin-top:-1.125em;overflow:visible;padding:0 1em}.md-typeset :-webkit-any(.highlight,.highlighttable)+.result:after{clear:both;content:"";display:block}.md-typeset :-moz-any(.highlight,.highlighttable)+.result:after{clear:both;content:"";display:block}.md-typeset :is(.highlight,.highlighttable)+.result:after{clear:both;content:"";display:block}@media screen and (max-width:44.9375em){.md-content__inner>.highlight{margin:1em -.8rem}.md-content__inner>.highlight .hll{margin:0 -.8rem;padding:0 .8rem}.md-content__inner>.highlight code{border-radius:0}.md-content__inner>.highlight+.result{border-left-width:0;border-radius:0;border-right-width:0;margin-left:-.8rem;margin-right:-.8rem}.md-content__inner>.highlighttable{border-radius:0;margin:1em -.8rem}.md-content__inner>.highlighttable .hll{margin:0 -.8rem;padding:0 .8rem}}.md-typeset .keys kbd:-webkit-any(:before,:after){-moz-osx-font-smoothing:initial;-webkit-font-smoothing:initial;color:inherit;margin:0;position:relative}.md-typeset .keys kbd:-moz-any(:before,:after){-moz-osx-font-smoothing:initial;-webkit-font-smoothing:initial;color:inherit;margin:0;position:relative}.md-typeset .keys kbd:is(:before,:after){-moz-osx-font-smoothing:initial;-webkit-font-smoothing:initial;color:inherit;margin:0;position:relative}.md-typeset .keys span{color:var(--md-default-fg-color--light);padding:0 .2em}.md-typeset .keys .key-alt:before{content:"⎇";padding-right:.4em}.md-typeset .keys .key-left-alt:before{content:"⎇";padding-right:.4em}.md-typeset .keys .key-right-alt:before{content:"⎇";padding-right:.4em}.md-typeset .keys .key-command:before{content:"⌘";padding-right:.4em}.md-typeset .keys .key-left-command:before{content:"⌘";padding-right:.4em}.md-typeset .keys .key-right-command:before{content:"⌘";padding-right:.4em}.md-typeset .keys .key-control:before{content:"⌃";padding-right:.4em}.md-typeset .keys .key-left-control:before{content:"⌃";padding-right:.4em}.md-typeset .keys .key-right-control:before{content:"⌃";padding-right:.4em}.md-typeset .keys .key-meta:before{content:"◆";padding-right:.4em}.md-typeset .keys .key-left-meta:before{content:"◆";padding-right:.4em}.md-typeset .keys .key-right-meta:before{content:"◆";padding-right:.4em}.md-typeset .keys .key-option:before{content:"⌥";padding-right:.4em}.md-typeset .keys .key-left-option:before{content:"⌥";padding-right:.4em}.md-typeset .keys .key-right-option:before{content:"⌥";padding-right:.4em}.md-typeset .keys .key-shift:before{content:"⇧";padding-right:.4em}.md-typeset .keys .key-left-shift:before{content:"⇧";padding-right:.4em}.md-typeset .keys .key-right-shift:before{content:"⇧";padding-right:.4em}.md-typeset .keys .key-super:before{content:"❖";padding-right:.4em}.md-typeset .keys .key-left-super:before{content:"❖";padding-right:.4em}.md-typeset .keys .key-right-super:before{content:"❖";padding-right:.4em}.md-typeset .keys .key-windows:before{content:"⊞";padding-right:.4em}.md-typeset .keys .key-left-windows:before{content:"⊞";padding-right:.4em}.md-typeset .keys .key-right-windows:before{content:"⊞";padding-right:.4em}.md-typeset .keys .key-arrow-down:before{content:"↓";padding-right:.4em}.md-typeset .keys .key-arrow-left:before{content:"←";padding-right:.4em}.md-typeset .keys .key-arrow-right:before{content:"→";padding-right:.4em}.md-typeset .keys .key-arrow-up:before{content:"↑";padding-right:.4em}.md-typeset .keys .key-backspace:before{content:"⌫";padding-right:.4em}.md-typeset .keys .key-backtab:before{content:"⇤";padding-right:.4em}.md-typeset .keys .key-caps-lock:before{content:"⇪";padding-right:.4em}.md-typeset .keys .key-clear:before{content:"⌧";padding-right:.4em}.md-typeset .keys .key-context-menu:before{content:"☰";padding-right:.4em}.md-typeset .keys .key-delete:before{content:"⌦";padding-right:.4em}.md-typeset .keys .key-eject:before{content:"⏏";padding-right:.4em}.md-typeset .keys .key-end:before{content:"⤓";padding-right:.4em}.md-typeset .keys .key-escape:before{content:"⎋";padding-right:.4em}.md-typeset .keys .key-home:before{content:"⤒";padding-right:.4em}.md-typeset .keys .key-insert:before{content:"⎀";padding-right:.4em}.md-typeset .keys .key-page-down:before{content:"⇟";padding-right:.4em}.md-typeset .keys .key-page-up:before{content:"⇞";padding-right:.4em}.md-typeset .keys .key-print-screen:before{content:"⎙";padding-right:.4em}.md-typeset .keys .key-tab:after{content:"⇥";padding-left:.4em}.md-typeset .keys .key-num-enter:after{content:"⌤";padding-left:.4em}.md-typeset .keys .key-enter:after{content:"⏎";padding-left:.4em}.md-typeset .tabbed-set{border-radius:.1rem;display:flex;flex-flow:column wrap;margin:1em 0;position:relative}.md-typeset .tabbed-set>input{height:0;opacity:0;position:absolute;width:0}.md-typeset .tabbed-labels{-ms-overflow-style:none;box-shadow:0 -.05rem var(--md-default-fg-color--lightest) inset;display:flex;max-width:100%;overflow:auto;-ms-scroll-snap-type:x proximity;scroll-snap-type:x proximity;scrollbar-width:none}@media print{.md-typeset .tabbed-labels{display:contents}}@media screen{.js .md-typeset .tabbed-labels{position:relative}.js .md-typeset .tabbed-labels:before{background:var(--md-accent-fg-color);bottom:0;content:"";display:block;height:2px;left:0;position:absolute;transform:translateX(var(--md-indicator-x));transition:width 225ms,transform .25s;transition-timing-function:cubic-bezier(.4,0,.2,1);width:var(--md-indicator-width)}}.md-typeset .tabbed-labels::-webkit-scrollbar{display:none}.md-typeset .tabbed-labels>label{border-bottom:.1rem solid transparent;border-radius:.1rem .1rem 0 0;color:var(--md-default-fg-color--light);cursor:pointer;flex-shrink:0;font-size:.64rem;font-weight:700;padding:.78125em 1.25em .625em;scroll-snap-align:start;transition:background-color .25s,color .25s;white-space:nowrap;width:auto}@media print{.md-typeset .tabbed-labels>label:first-child{order:1}.md-typeset .tabbed-labels>label:nth-child(2){order:2}.md-typeset .tabbed-labels>label:nth-child(3){order:3}.md-typeset .tabbed-labels>label:nth-child(4){order:4}.md-typeset .tabbed-labels>label:nth-child(5){order:5}.md-typeset .tabbed-labels>label:nth-child(6){order:6}.md-typeset .tabbed-labels>label:nth-child(7){order:7}.md-typeset .tabbed-labels>label:nth-child(8){order:8}.md-typeset .tabbed-labels>label:nth-child(9){order:9}.md-typeset .tabbed-labels>label:nth-child(10){order:10}.md-typeset .tabbed-labels>label:nth-child(11){order:11}.md-typeset .tabbed-labels>label:nth-child(12){order:12}.md-typeset .tabbed-labels>label:nth-child(13){order:13}.md-typeset .tabbed-labels>label:nth-child(14){order:14}.md-typeset .tabbed-labels>label:nth-child(15){order:15}.md-typeset .tabbed-labels>label:nth-child(16){order:16}.md-typeset .tabbed-labels>label:nth-child(17){order:17}.md-typeset .tabbed-labels>label:nth-child(18){order:18}.md-typeset .tabbed-labels>label:nth-child(19){order:19}.md-typeset .tabbed-labels>label:nth-child(20){order:20}}.md-typeset .tabbed-labels>label:hover{color:var(--md-accent-fg-color)}.md-typeset .tabbed-content{width:100%}@media print{.md-typeset .tabbed-content{display:contents}}.md-typeset .tabbed-block{display:none}@media print{.md-typeset .tabbed-block{display:block}.md-typeset .tabbed-block:first-child{order:1}.md-typeset .tabbed-block:nth-child(2){order:2}.md-typeset .tabbed-block:nth-child(3){order:3}.md-typeset .tabbed-block:nth-child(4){order:4}.md-typeset .tabbed-block:nth-child(5){order:5}.md-typeset .tabbed-block:nth-child(6){order:6}.md-typeset .tabbed-block:nth-child(7){order:7}.md-typeset .tabbed-block:nth-child(8){order:8}.md-typeset .tabbed-block:nth-child(9){order:9}.md-typeset .tabbed-block:nth-child(10){order:10}.md-typeset .tabbed-block:nth-child(11){order:11}.md-typeset .tabbed-block:nth-child(12){order:12}.md-typeset .tabbed-block:nth-child(13){order:13}.md-typeset .tabbed-block:nth-child(14){order:14}.md-typeset .tabbed-block:nth-child(15){order:15}.md-typeset .tabbed-block:nth-child(16){order:16}.md-typeset .tabbed-block:nth-child(17){order:17}.md-typeset .tabbed-block:nth-child(18){order:18}.md-typeset .tabbed-block:nth-child(19){order:19}.md-typeset .tabbed-block:nth-child(20){order:20}}.md-typeset .tabbed-block>.highlight:first-child pre,.md-typeset .tabbed-block>.highlighttable:first-child,.md-typeset .tabbed-block>pre:first-child{margin:0}[dir=ltr] .md-typeset .tabbed-block>.highlight:first-child pre code,[dir=ltr] .md-typeset .tabbed-block>.highlighttable:first-child code,[dir=ltr] .md-typeset .tabbed-block>pre:first-child code{border-top-left-radius:0}[dir=rtl] .md-typeset .tabbed-block>.highlight:first-child pre code,[dir=rtl] .md-typeset .tabbed-block>.highlighttable:first-child code,[dir=rtl] .md-typeset .tabbed-block>pre:first-child code{border-top-right-radius:0}[dir=ltr] .md-typeset .tabbed-block>.highlight:first-child pre code,[dir=ltr] .md-typeset .tabbed-block>.highlighttable:first-child code,[dir=ltr] .md-typeset .tabbed-block>pre:first-child code{border-top-right-radius:0}[dir=rtl] .md-typeset .tabbed-block>.highlight:first-child pre code,[dir=rtl] .md-typeset .tabbed-block>.highlighttable:first-child code,[dir=rtl] .md-typeset .tabbed-block>pre:first-child code{border-top-left-radius:0}[dir=ltr] .md-typeset .tabbed-block>.highlighttable:first-child .linenos{border-top-left-radius:0}[dir=rtl] .md-typeset .tabbed-block>.highlighttable:first-child .linenos{border-top-right-radius:0}[dir=ltr] .md-typeset .tabbed-block>.highlighttable:first-child .linenos{border-top-right-radius:0}[dir=rtl] .md-typeset .tabbed-block>.highlighttable:first-child .linenos{border-top-left-radius:0}.md-typeset .tabbed-block>.result:nth-child(2){margin-top:0}.md-typeset .tabbed-block>.tabbed-set{margin:0}@media screen and (max-width:44.9375em){[dir=ltr] .md-content__inner>.tabbed-set .tabbed-labels{padding-left:.8rem}[dir=rtl] .md-content__inner>.tabbed-set .tabbed-labels{padding-right:.8rem}.md-content__inner>.tabbed-set .tabbed-labels{margin:0 -.8rem;max-width:100vw;scroll-padding-inline-start:.8rem}[dir=ltr] .md-content__inner>.tabbed-set .tabbed-labels:after{padding-right:.8rem}[dir=rtl] .md-content__inner>.tabbed-set .tabbed-labels:after{padding-left:.8rem}.md-content__inner>.tabbed-set .tabbed-labels:after{content:""}}@media screen{.md-typeset .tabbed-set>input:first-child:checked~.tabbed-labels>:first-child,.md-typeset .tabbed-set>input:nth-child(10):checked~.tabbed-labels>:nth-child(10),.md-typeset .tabbed-set>input:nth-child(11):checked~.tabbed-labels>:nth-child(11),.md-typeset .tabbed-set>input:nth-child(12):checked~.tabbed-labels>:nth-child(12),.md-typeset .tabbed-set>input:nth-child(13):checked~.tabbed-labels>:nth-child(13),.md-typeset .tabbed-set>input:nth-child(14):checked~.tabbed-labels>:nth-child(14),.md-typeset .tabbed-set>input:nth-child(15):checked~.tabbed-labels>:nth-child(15),.md-typeset .tabbed-set>input:nth-child(16):checked~.tabbed-labels>:nth-child(16),.md-typeset .tabbed-set>input:nth-child(17):checked~.tabbed-labels>:nth-child(17),.md-typeset .tabbed-set>input:nth-child(18):checked~.tabbed-labels>:nth-child(18),.md-typeset .tabbed-set>input:nth-child(19):checked~.tabbed-labels>:nth-child(19),.md-typeset .tabbed-set>input:nth-child(2):checked~.tabbed-labels>:nth-child(2),.md-typeset .tabbed-set>input:nth-child(20):checked~.tabbed-labels>:nth-child(20),.md-typeset .tabbed-set>input:nth-child(3):checked~.tabbed-labels>:nth-child(3),.md-typeset .tabbed-set>input:nth-child(4):checked~.tabbed-labels>:nth-child(4),.md-typeset .tabbed-set>input:nth-child(5):checked~.tabbed-labels>:nth-child(5),.md-typeset .tabbed-set>input:nth-child(6):checked~.tabbed-labels>:nth-child(6),.md-typeset .tabbed-set>input:nth-child(7):checked~.tabbed-labels>:nth-child(7),.md-typeset .tabbed-set>input:nth-child(8):checked~.tabbed-labels>:nth-child(8),.md-typeset .tabbed-set>input:nth-child(9):checked~.tabbed-labels>:nth-child(9){color:var(--md-accent-fg-color)}.md-typeset .no-js .tabbed-set>input:first-child:checked~.tabbed-labels>:first-child,.md-typeset .no-js .tabbed-set>input:nth-child(10):checked~.tabbed-labels>:nth-child(10),.md-typeset .no-js .tabbed-set>input:nth-child(11):checked~.tabbed-labels>:nth-child(11),.md-typeset .no-js .tabbed-set>input:nth-child(12):checked~.tabbed-labels>:nth-child(12),.md-typeset .no-js .tabbed-set>input:nth-child(13):checked~.tabbed-labels>:nth-child(13),.md-typeset .no-js .tabbed-set>input:nth-child(14):checked~.tabbed-labels>:nth-child(14),.md-typeset .no-js .tabbed-set>input:nth-child(15):checked~.tabbed-labels>:nth-child(15),.md-typeset .no-js .tabbed-set>input:nth-child(16):checked~.tabbed-labels>:nth-child(16),.md-typeset .no-js .tabbed-set>input:nth-child(17):checked~.tabbed-labels>:nth-child(17),.md-typeset .no-js .tabbed-set>input:nth-child(18):checked~.tabbed-labels>:nth-child(18),.md-typeset .no-js .tabbed-set>input:nth-child(19):checked~.tabbed-labels>:nth-child(19),.md-typeset .no-js .tabbed-set>input:nth-child(2):checked~.tabbed-labels>:nth-child(2),.md-typeset .no-js .tabbed-set>input:nth-child(20):checked~.tabbed-labels>:nth-child(20),.md-typeset .no-js .tabbed-set>input:nth-child(3):checked~.tabbed-labels>:nth-child(3),.md-typeset .no-js .tabbed-set>input:nth-child(4):checked~.tabbed-labels>:nth-child(4),.md-typeset .no-js .tabbed-set>input:nth-child(5):checked~.tabbed-labels>:nth-child(5),.md-typeset .no-js .tabbed-set>input:nth-child(6):checked~.tabbed-labels>:nth-child(6),.md-typeset .no-js .tabbed-set>input:nth-child(7):checked~.tabbed-labels>:nth-child(7),.md-typeset .no-js .tabbed-set>input:nth-child(8):checked~.tabbed-labels>:nth-child(8),.md-typeset .no-js .tabbed-set>input:nth-child(9):checked~.tabbed-labels>:nth-child(9),.no-js .md-typeset .tabbed-set>input:first-child:checked~.tabbed-labels>:first-child,.no-js .md-typeset .tabbed-set>input:nth-child(10):checked~.tabbed-labels>:nth-child(10),.no-js .md-typeset .tabbed-set>input:nth-child(11):checked~.tabbed-labels>:nth-child(11),.no-js .md-typeset .tabbed-set>input:nth-child(12):checked~.tabbed-labels>:nth-child(12),.no-js .md-typeset .tabbed-set>input:nth-child(13):checked~.tabbed-labels>:nth-child(13),.no-js .md-typeset .tabbed-set>input:nth-child(14):checked~.tabbed-labels>:nth-child(14),.no-js .md-typeset .tabbed-set>input:nth-child(15):checked~.tabbed-labels>:nth-child(15),.no-js .md-typeset .tabbed-set>input:nth-child(16):checked~.tabbed-labels>:nth-child(16),.no-js .md-typeset .tabbed-set>input:nth-child(17):checked~.tabbed-labels>:nth-child(17),.no-js .md-typeset .tabbed-set>input:nth-child(18):checked~.tabbed-labels>:nth-child(18),.no-js .md-typeset .tabbed-set>input:nth-child(19):checked~.tabbed-labels>:nth-child(19),.no-js .md-typeset .tabbed-set>input:nth-child(2):checked~.tabbed-labels>:nth-child(2),.no-js .md-typeset .tabbed-set>input:nth-child(20):checked~.tabbed-labels>:nth-child(20),.no-js .md-typeset .tabbed-set>input:nth-child(3):checked~.tabbed-labels>:nth-child(3),.no-js .md-typeset .tabbed-set>input:nth-child(4):checked~.tabbed-labels>:nth-child(4),.no-js .md-typeset .tabbed-set>input:nth-child(5):checked~.tabbed-labels>:nth-child(5),.no-js .md-typeset .tabbed-set>input:nth-child(6):checked~.tabbed-labels>:nth-child(6),.no-js .md-typeset .tabbed-set>input:nth-child(7):checked~.tabbed-labels>:nth-child(7),.no-js .md-typeset .tabbed-set>input:nth-child(8):checked~.tabbed-labels>:nth-child(8),.no-js .md-typeset .tabbed-set>input:nth-child(9):checked~.tabbed-labels>:nth-child(9){border-color:var(--md-accent-fg-color)}}.md-typeset .tabbed-set>input:first-child.focus-visible~.tabbed-labels>:first-child,.md-typeset .tabbed-set>input:nth-child(10).focus-visible~.tabbed-labels>:nth-child(10),.md-typeset .tabbed-set>input:nth-child(11).focus-visible~.tabbed-labels>:nth-child(11),.md-typeset .tabbed-set>input:nth-child(12).focus-visible~.tabbed-labels>:nth-child(12),.md-typeset .tabbed-set>input:nth-child(13).focus-visible~.tabbed-labels>:nth-child(13),.md-typeset .tabbed-set>input:nth-child(14).focus-visible~.tabbed-labels>:nth-child(14),.md-typeset .tabbed-set>input:nth-child(15).focus-visible~.tabbed-labels>:nth-child(15),.md-typeset .tabbed-set>input:nth-child(16).focus-visible~.tabbed-labels>:nth-child(16),.md-typeset .tabbed-set>input:nth-child(17).focus-visible~.tabbed-labels>:nth-child(17),.md-typeset .tabbed-set>input:nth-child(18).focus-visible~.tabbed-labels>:nth-child(18),.md-typeset .tabbed-set>input:nth-child(19).focus-visible~.tabbed-labels>:nth-child(19),.md-typeset .tabbed-set>input:nth-child(2).focus-visible~.tabbed-labels>:nth-child(2),.md-typeset .tabbed-set>input:nth-child(20).focus-visible~.tabbed-labels>:nth-child(20),.md-typeset .tabbed-set>input:nth-child(3).focus-visible~.tabbed-labels>:nth-child(3),.md-typeset .tabbed-set>input:nth-child(4).focus-visible~.tabbed-labels>:nth-child(4),.md-typeset .tabbed-set>input:nth-child(5).focus-visible~.tabbed-labels>:nth-child(5),.md-typeset .tabbed-set>input:nth-child(6).focus-visible~.tabbed-labels>:nth-child(6),.md-typeset .tabbed-set>input:nth-child(7).focus-visible~.tabbed-labels>:nth-child(7),.md-typeset .tabbed-set>input:nth-child(8).focus-visible~.tabbed-labels>:nth-child(8),.md-typeset .tabbed-set>input:nth-child(9).focus-visible~.tabbed-labels>:nth-child(9){background-color:var(--md-accent-fg-color--transparent)}.md-typeset .tabbed-set>input:first-child:checked~.tabbed-content>:first-child,.md-typeset .tabbed-set>input:nth-child(10):checked~.tabbed-content>:nth-child(10),.md-typeset .tabbed-set>input:nth-child(11):checked~.tabbed-content>:nth-child(11),.md-typeset .tabbed-set>input:nth-child(12):checked~.tabbed-content>:nth-child(12),.md-typeset .tabbed-set>input:nth-child(13):checked~.tabbed-content>:nth-child(13),.md-typeset .tabbed-set>input:nth-child(14):checked~.tabbed-content>:nth-child(14),.md-typeset .tabbed-set>input:nth-child(15):checked~.tabbed-content>:nth-child(15),.md-typeset .tabbed-set>input:nth-child(16):checked~.tabbed-content>:nth-child(16),.md-typeset .tabbed-set>input:nth-child(17):checked~.tabbed-content>:nth-child(17),.md-typeset .tabbed-set>input:nth-child(18):checked~.tabbed-content>:nth-child(18),.md-typeset .tabbed-set>input:nth-child(19):checked~.tabbed-content>:nth-child(19),.md-typeset .tabbed-set>input:nth-child(2):checked~.tabbed-content>:nth-child(2),.md-typeset .tabbed-set>input:nth-child(20):checked~.tabbed-content>:nth-child(20),.md-typeset .tabbed-set>input:nth-child(3):checked~.tabbed-content>:nth-child(3),.md-typeset .tabbed-set>input:nth-child(4):checked~.tabbed-content>:nth-child(4),.md-typeset .tabbed-set>input:nth-child(5):checked~.tabbed-content>:nth-child(5),.md-typeset .tabbed-set>input:nth-child(6):checked~.tabbed-content>:nth-child(6),.md-typeset .tabbed-set>input:nth-child(7):checked~.tabbed-content>:nth-child(7),.md-typeset .tabbed-set>input:nth-child(8):checked~.tabbed-content>:nth-child(8),.md-typeset .tabbed-set>input:nth-child(9):checked~.tabbed-content>:nth-child(9){display:block}:root{--md-tasklist-icon:url('data:image/svg+xml;charset=utf-8,');--md-tasklist-icon--checked:url('data:image/svg+xml;charset=utf-8,')}.md-typeset .task-list-item{list-style-type:none;position:relative}[dir=ltr] .md-typeset .task-list-item [type=checkbox]{left:-2em}[dir=rtl] .md-typeset .task-list-item [type=checkbox]{right:-2em}.md-typeset .task-list-item [type=checkbox]{position:absolute;top:.45em}.md-typeset .task-list-control [type=checkbox]{opacity:0;z-index:-1}[dir=ltr] .md-typeset .task-list-indicator:before{left:-1.5em}[dir=rtl] .md-typeset .task-list-indicator:before{right:-1.5em}.md-typeset .task-list-indicator:before{background-color:var(--md-default-fg-color--lightest);content:"";height:1.25em;-webkit-mask-image:var(--md-tasklist-icon);mask-image:var(--md-tasklist-icon);-webkit-mask-repeat:no-repeat;mask-repeat:no-repeat;-webkit-mask-size:contain;mask-size:contain;position:absolute;top:.15em;width:1.25em}.md-typeset [type=checkbox]:checked+.task-list-indicator:before{background-color:#00e676;-webkit-mask-image:var(--md-tasklist-icon--checked);mask-image:var(--md-tasklist-icon--checked)}@media screen and (min-width:45em){[dir=ltr] .md-typeset .inline{margin-right:.8rem}[dir=rtl] .md-typeset .inline{margin-left:.8rem}.md-typeset .inline{float:left;margin-bottom:.8rem;margin-top:0;width:11.7rem}[dir=rtl] .md-typeset .inline{float:right}[dir=ltr] .md-typeset .inline.end{margin-left:.8rem;margin-right:0}[dir=rtl] .md-typeset .inline.end{margin-left:0;margin-right:.8rem}.md-typeset .inline.end{float:right}[dir=rtl] .md-typeset .inline.end{float:left}} \ No newline at end of file diff --git a/assets/stylesheets/main.50e68009.min.css.map b/assets/stylesheets/main.50e68009.min.css.map new file mode 100644 index 00000000..3866189b --- /dev/null +++ b/assets/stylesheets/main.50e68009.min.css.map @@ -0,0 +1 @@ +{"version":3,"sources":["src/assets/stylesheets/main/extensions/pymdownx/_keys.scss","../../../src/assets/stylesheets/main.scss","src/assets/stylesheets/main/_resets.scss","src/assets/stylesheets/main/_colors.scss","src/assets/stylesheets/main/_icons.scss","src/assets/stylesheets/main/_typeset.scss","src/assets/stylesheets/utilities/_break.scss","src/assets/stylesheets/main/layout/_banner.scss","src/assets/stylesheets/main/layout/_base.scss","src/assets/stylesheets/main/layout/_clipboard.scss","src/assets/stylesheets/main/layout/_content.scss","src/assets/stylesheets/main/layout/_dialog.scss","src/assets/stylesheets/main/layout/_footer.scss","src/assets/stylesheets/main/layout/_form.scss","src/assets/stylesheets/main/layout/_header.scss","src/assets/stylesheets/main/layout/_nav.scss","src/assets/stylesheets/main/layout/_search.scss","src/assets/stylesheets/main/layout/_select.scss","src/assets/stylesheets/main/layout/_sidebar.scss","src/assets/stylesheets/main/layout/_source.scss","src/assets/stylesheets/main/layout/_tabs.scss","src/assets/stylesheets/main/layout/_tooltip.scss","src/assets/stylesheets/main/layout/_top.scss","src/assets/stylesheets/main/layout/_version.scss","src/assets/stylesheets/main/extensions/markdown/_admonition.scss","node_modules/material-design-color/material-color.scss","src/assets/stylesheets/main/extensions/markdown/_footnotes.scss","src/assets/stylesheets/main/extensions/markdown/_toc.scss","src/assets/stylesheets/main/extensions/pymdownx/_arithmatex.scss","src/assets/stylesheets/main/extensions/pymdownx/_critic.scss","src/assets/stylesheets/main/extensions/pymdownx/_details.scss","src/assets/stylesheets/main/extensions/pymdownx/_emoji.scss","src/assets/stylesheets/main/extensions/pymdownx/_highlight.scss","src/assets/stylesheets/main/extensions/pymdownx/_tabbed.scss","src/assets/stylesheets/main/extensions/pymdownx/_tasklist.scss","src/assets/stylesheets/main/_modifiers.scss"],"names":[],"mappings":"AAgGM,gBCguGN,CCpyGA,KAEE,6BAAA,CAAA,0BAAA,CAAA,yBAAA,CAAA,qBAAA,CADA,qBDzBF,CC8BA,iBAGE,kBD3BF,CC8BE,gCANF,iBAOI,yBDzBF,CACF,CC6BA,KACE,QD1BF,CC8BA,qBAIE,uCD3BF,CC+BA,EACE,aAAA,CACA,oBD5BF,CCgCA,GAME,QAAA,CAJA,sBAAA,CADA,aAAA,CAEA,aAAA,CAEA,gBAAA,CADA,SD3BF,CCiCA,MACE,aD9BF,CCkCA,QAEE,eD/BF,CCmCA,IACE,iBDhCF,CCoCA,MACE,wBAAA,CACA,gBDjCF,CCqCA,MAEE,eAAA,CACA,kBDlCF,CCsCA,OAKE,sBAAA,CACA,QAAA,CAFA,mBAAA,CADA,iBAAA,CAFA,QAAA,CACA,SD/BF,CCuCA,MACE,QAAA,CACA,YDpCF,CErDA,MAGE,qCAAA,CACA,4CAAA,CACA,8CAAA,CACA,+CAAA,CACA,0BAAA,CACA,+CAAA,CACA,iDAAA,CACA,mDAAA,CAGA,6BAAA,CACA,oCAAA,CACA,mCAAA,CACA,0BAAA,CACA,+CAAA,CAGA,4BAAA,CACA,qDAAA,CACA,yBAAA,CACA,8CAAA,CA0DA,yEAAA,CAKA,yEAAA,CAKA,yEFTF,CExDE,QAGE,0BAAA,CACA,0BAAA,CAGA,qCAAA,CACA,iCAAA,CACA,kCAAA,CACA,mCAAA,CACA,mCAAA,CACA,kCAAA,CACA,iCAAA,CACA,+CAAA,CACA,6DAAA,CACA,gEAAA,CACA,4DAAA,CACA,4DAAA,CACA,6DAAA,CAGA,6CAAA,CAGA,+CAAA,CAGA,0CAAA,CAGA,0CAAA,CACA,2CAAA,CAGA,8BAAA,CACA,kCAAA,CACA,qCAAA,CAGA,wCAAA,CAGA,mDAAA,CACA,mDAAA,CAGA,yBAAA,CACA,8CAAA,CACA,gDAAA,CACA,oCAAA,CACA,0CFsCJ,CGhHE,aAIE,iBAAA,CAHA,aAAA,CAEA,aAAA,CADA,YHqHJ,CI1HA,KACE,kCAAA,CACA,iCAAA,CAGA,uGAAA,CAKA,mFJ2HF,CIrHA,WAGE,mCAAA,CACA,sCJwHF,CIpHA,wBANE,6BJkIF,CI5HA,aAIE,4BAAA,CACA,sCJuHF,CI/GA,MACE,0NAAA,CACA,mNAAA,CACA,oNJkHF,CI3GA,YAGE,gCAAA,CAAA,kBAAA,CAFA,eAAA,CACA,eJ+GF,CI1GE,aAPF,YAQI,gBJ6GF,CACF,CI1GE,uGAME,iBAAA,CAAA,cJ4GJ,CIxGE,eAEE,uCAAA,CAEA,aAAA,CACA,eAAA,CAJA,iBJ+GJ,CItGE,8BAPE,eAAA,CAGA,qBJiHJ,CI7GE,eAGE,kBAAA,CACA,eAAA,CAHA,oBJ4GJ,CIpGE,eAGE,gBAAA,CADA,eAAA,CAGA,qBAAA,CADA,eAAA,CAHA,mBJ0GJ,CIlGE,kBACE,eJoGJ,CIhGE,eAEE,eAAA,CACA,qBAAA,CAFA,YJoGJ,CI9FE,8BAGE,uCAAA,CAEA,cAAA,CADA,eAAA,CAEA,qBAAA,CAJA,eJoGJ,CI5FE,eACE,wBJ8FJ,CI1FE,eAGE,+DAAA,CAFA,iBAAA,CACA,cJ6FJ,CIxFE,cACE,+BAAA,CACA,qBJ0FJ,CIvFI,mCAEE,sBJwFN,CIpFI,wCAEE,+BJqFN,CIjFI,4BACE,uCAAA,CACA,oBJmFN,CI9EE,iDAGE,6BAAA,CACA,aJgFJ,CI7EI,aAPF,iDAQI,oBJkFJ,CACF,CI9EE,iBAIE,wCAAA,CACA,mBAAA,CACA,kCAAA,CAAA,0BAAA,CAJA,eAAA,CADA,uBAAA,CAEA,qBJmFJ,CI7EI,qCAEE,uCAAA,CADA,YJgFN,CI1EE,mBACE,kBJ4EJ,CIxEE,gBAEE,iBAAA,CACA,eAAA,CAFA,iBJ4EJ,CIvEI,qBAQE,kCAAA,CAAA,0BAAA,CADA,eAAA,CANA,aAAA,CACA,QAAA,CAIA,uCAAA,CAFA,aAAA,CADA,oCAAA,CAQA,+DAAA,CADA,oBAAA,CADA,iBAAA,CAJA,iBJ+EN,CItEM,2BACE,qDJwER,CIpEM,wCAEE,YAAA,CADA,WJuER,CIlEM,8CACE,oDJoER,CIjEQ,oDACE,0CJmEV,CI5DE,gBAOE,4CAAA,CACA,mBAAA,CACA,mKACE,CAPF,gCAAA,CAFA,oBAAA,CAGA,eAAA,CAFA,uBAAA,CAGA,uBAAA,CACA,qBJiEJ,CIvDE,iBAGE,6CAAA,CACA,kCAAA,CAAA,0BAAA,CAHA,aAAA,CACA,qBJ2DJ,CIrDE,iBAEE,6DAAA,CACA,WAAA,CAFA,oBJyDJ,CIpDI,oBANF,iBAOI,iBJuDJ,CIpDI,yDAWE,2CAAA,CACA,mBAAA,CACA,8BAAA,CAJA,gCAAA,CAKA,mBAAA,CAXA,oBAAA,CAOA,eAAA,CAHA,cAAA,CADA,aAAA,CADA,6BAAA,CAAA,qBAAA,CAGA,mBAAA,CAPA,iBAAA,CAGA,UJgEN,CIpEI,sDAWE,2CAAA,CACA,mBAAA,CACA,8BAAA,CAJA,gCAAA,CAKA,mBAAA,CAXA,oBAAA,CAOA,eAAA,CAHA,cAAA,CADA,aAAA,CADA,0BAAA,CAAA,qBAAA,CAGA,mBAAA,CAPA,iBAAA,CAGA,UJgEN,CIpEI,mEAEE,MJkEN,CIpEI,gEAEE,MJkEN,CIpEI,0DAEE,MJkEN,CIpEI,mEAEE,OJkEN,CIpEI,gEAEE,OJkEN,CIpEI,0DAEE,OJkEN,CIpEI,gDAWE,2CAAA,CACA,mBAAA,CACA,8BAAA,CAJA,gCAAA,CAKA,mBAAA,CAXA,oBAAA,CAOA,eAAA,CAHA,cAAA,CADA,aAAA,CADA,6BAAA,CAAA,0BAAA,CAAA,qBAAA,CAGA,mBAAA,CAPA,iBAAA,CAGA,UJgEN,CACF,CIjDE,kBACE,WJmDJ,CI/CE,oDAEE,qBJiDJ,CInDE,oDAEE,sBJiDJ,CI7CE,iCACE,kBJkDJ,CInDE,iCACE,mBJkDJ,CInDE,iCAIE,2DJ+CJ,CInDE,iCAIE,4DJ+CJ,CInDE,uBAGE,uCAAA,CADA,aAAA,CAAA,cJiDJ,CI3CE,eACE,oBJ6CJ,CIzCE,kDAEE,kBJ4CJ,CI9CE,kDAEE,mBJ4CJ,CI9CE,8BAGE,SJ2CJ,CIxCI,0DACE,iBJ2CN,CIvCI,oCACE,2BJ0CN,CIvCM,0CACE,2BJ0CR,CIrCI,wDAEE,kBJwCN,CI1CI,wDAEE,mBJwCN,CI1CI,oCACE,kBJyCN,CIrCM,0FACE,aJwCR,CIzCM,oFACE,aJwCR,CIzCM,wEACE,aJwCR,CIpCM,0DACE,eJuCR,CInCM,4EACE,kBAAA,CAAA,eJuCR,CIxCM,sEACE,kBAAA,CAAA,eJuCR,CIxCM,gGAEE,kBJsCR,CIxCM,0FAEE,kBJsCR,CIxCM,8EAEE,kBJsCR,CIxCM,gGAEE,mBJsCR,CIxCM,0FAEE,mBJsCR,CIxCM,8EAEE,mBJsCR,CIxCM,0DACE,kBAAA,CAAA,eJuCR,CIhCE,yBAEE,mBJkCJ,CIpCE,yBAEE,oBJkCJ,CIpCE,eACE,mBAAA,CAAA,cJmCJ,CI9BE,gCAGE,WAAA,CADA,cJiCJ,CI7BI,wDAEE,oBJgCN,CI5BI,0DAEE,oBJ+BN,CI3BI,oEACE,YJ8BN,CIzBE,mCACE,YJ2BJ,CIvBE,mBACE,iBAAA,CAGA,eAAA,CADA,cAAA,CAEA,iBAAA,CAHA,yBAAA,CAAA,sBAAA,CAAA,iBJ4BJ,CItBI,uBACE,aJwBN,CInBE,uBAGE,iBAAA,CADA,eAAA,CADA,eJuBJ,CIjBE,mBACE,cJmBJ,CIfE,+BAKE,2CAAA,CACA,iDAAA,CACA,mBAAA,CANA,oBAAA,CAGA,gBAAA,CAFA,cAAA,CACA,aAAA,CAKA,iBJiBJ,CIdI,aAXF,+BAYI,aJiBJ,CACF,CIZI,iCACE,gBJcN,CIPM,gEACE,YJSR,CIVM,6DACE,YJSR,CIVM,uDACE,YJSR,CILM,+DACE,eJOR,CIRM,4DACE,eJOR,CIRM,sDACE,eJOR,CIFI,gEACE,eJIN,CILI,6DACE,eJIN,CILI,uDACE,eJIN,CIDM,0EACE,gBJGR,CIJM,uEACE,gBJGR,CIJM,iEACE,gBJGR,CIEI,kCAGE,eAAA,CAFA,cAAA,CACA,sBAAA,CAEA,kBJAN,CIGM,oCACE,aJDR,CIMI,kCAGE,qDAAA,CAFA,sBAAA,CACA,kBJHN,CIQI,wCACE,iCJNN,CISM,8CACE,iCAAA,CACA,sDJPR,CIYI,iCACE,iBJVN,CIeE,wCACE,cJbJ,CIgBI,wDAIE,gBJRN,CIII,wDAIE,iBJRN,CIII,8CAUE,UAAA,CATA,oBAAA,CAEA,YAAA,CAGA,oDAAA,CAAA,4CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CACA,iCAAA,CAJA,0BAAA,CAHA,WJNN,CIkBI,oDACE,oDJhBN,CIoBI,mEACE,kDAAA,CACA,yDAAA,CAAA,iDJlBN,CIsBI,oEACE,kDAAA,CACA,0DAAA,CAAA,kDJpBN,CIyBE,wBACE,iBAAA,CACA,eAAA,CACA,iBJvBJ,CI2BE,mBACE,oBAAA,CACA,kBAAA,CACA,eJzBJ,CI4BI,aANF,mBAOI,aJzBJ,CACF,CI4BI,8BACE,aAAA,CAEA,QAAA,CACA,eAAA,CAFA,UJxBN,CK1VI,wCDiYF,uBACE,iBJnCF,CIsCE,4BACE,eJpCJ,CACF,CM5hBA,WAGE,0CAAA,CADA,+BAAA,CADA,aNgiBF,CM3hBE,aANF,WAOI,YN8hBF,CACF,CM3hBE,oBAEE,uCAAA,CADA,gCN8hBJ,CMzhBE,kBAGE,eAAA,CAFA,iBAAA,CACA,eN4hBJ,CO/iBA,KASE,cAAA,CARA,WAAA,CACA,iBPmjBF,CK/YI,oCEtKJ,KAaI,gBP4iBF,CACF,CKpZI,oCEtKJ,KAkBI,cP4iBF,CACF,COviBA,KASE,2CAAA,CAPA,YAAA,CACA,qBAAA,CAKA,eAAA,CAHA,eAAA,CAJA,iBAAA,CAGA,UP6iBF,COriBE,aAZF,KAaI,aPwiBF,CACF,CKrZI,wCEhJF,yBAII,cPqiBJ,CACF,CO5hBA,SAEE,gBAAA,CAAA,iBAAA,CADA,ePgiBF,CO3hBA,cACE,YAAA,CACA,qBAAA,CACA,WP8hBF,CO3hBE,aANF,cAOI,aP8hBF,CACF,CO1hBA,SACE,WP6hBF,CO1hBE,gBACE,YAAA,CACA,WAAA,CACA,iBP4hBJ,COvhBA,aACE,eAAA,CAEA,sBAAA,CADA,kBP2hBF,COjhBA,WACE,YPohBF,CO/gBA,WAGE,QAAA,CACA,SAAA,CAHA,iBAAA,CACA,OPohBF,CO/gBE,uCACE,aPihBJ,CO7gBE,+BAEE,uCAAA,CADA,kBPghBJ,CO1gBA,SASE,2CAAA,CACA,mBAAA,CAHA,gCAAA,CACA,gBAAA,CAHA,YAAA,CAQA,SAAA,CAFA,uCAAA,CALA,mBAAA,CALA,cAAA,CAWA,2BAAA,CARA,UPohBF,COxgBE,eAGE,SAAA,CADA,uBAAA,CAEA,oEACE,CAJF,UP6gBJ,CO/fA,MACE,WPkgBF,CQ5pBA,MACE,+PR8pBF,CQxpBA,cAQE,mBAAA,CADA,0CAAA,CAIA,cAAA,CALA,YAAA,CAGA,uCAAA,CACA,oBAAA,CATA,iBAAA,CAEA,UAAA,CADA,QAAA,CAUA,qBAAA,CAPA,WAAA,CADA,SRmqBF,CQxpBE,aAfF,cAgBI,YR2pBF,CACF,CQxpBE,kCAEE,uCAAA,CADA,YR2pBJ,CQtpBE,qBACE,uCRwpBJ,CQppBE,yCACE,+BRspBJ,CQvpBE,sCACE,+BRspBJ,CQvpBE,gCACE,+BRspBJ,CQjpBE,oBAKE,6BAAA,CAIA,UAAA,CARA,aAAA,CAEA,cAAA,CACA,aAAA,CAEA,2CAAA,CAAA,mCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CANA,aR0pBJ,CQ/oBE,sBACE,cRipBJ,CQ9oBI,2BACE,2CRgpBN,CQ1oBI,sDAEE,uDAAA,CADA,+BR6oBN,CQ9oBI,mDAEE,uDAAA,CADA,+BR6oBN,CQ9oBI,6CAEE,uDAAA,CADA,+BR6oBN,CSltBA,YACE,WAAA,CAIA,WTktBF,CS/sBE,mBACE,qBAAA,CACA,iBTitBJ,CKrjBI,sCItJE,4EACE,kBT8sBN,CS/sBI,4EACE,mBT8sBN,CS1sBI,8EACE,mBT4sBN,CS7sBI,8EACE,kBT4sBN,CACF,CSvsBI,0BAGE,UAAA,CAFA,aAAA,CACA,YT0sBN,CSrsBI,+BACE,eTusBN,CSjsBE,8BAGE,iBTosBJ,CSvsBE,8BAGE,kBTosBJ,CSvsBE,oBACE,WAAA,CACA,cAAA,CAEA,STmsBJ,CShsBI,aAPF,oBAQI,YTmsBJ,CACF,CShsBI,8BACE,UTksBN,CS9rBI,gCACE,yCTgsBN,CS5rBI,wBACE,cAAA,CACA,kBT8rBN,CS3rBM,kCACE,oBT6rBR,CUnwBA,qBAEE,WVixBF,CUnxBA,qBAEE,UVixBF,CUnxBA,WAOE,2CAAA,CACA,mBAAA,CALA,YAAA,CAMA,8BAAA,CAJA,iBAAA,CAMA,SAAA,CALA,mBAAA,CASA,mBAAA,CAdA,cAAA,CASA,0BAAA,CAEA,wCACE,CATF,SV+wBF,CUjwBE,aAlBF,WAmBI,YVowBF,CACF,CUjwBE,+BAEE,SAAA,CAIA,mBAAA,CALA,uBAAA,CAEA,kEVowBJ,CU7vBE,kBACE,gCAAA,CACA,eV+vBJ,CWlyBA,WAEE,0CAAA,CADA,+BXsyBF,CWlyBE,aALF,WAMI,YXqyBF,CACF,CWlyBE,kBACE,YAAA,CACA,6BAAA,CAEA,aAAA,CADA,aXqyBJ,CWhyBE,iBACE,YAAA,CAKA,cAAA,CAIA,uCAAA,CADA,eAAA,CADA,oBAAA,CADA,kBAAA,CAIA,uBX8xBJ,CW3xBI,4CACE,UX6xBN,CW9xBI,yCACE,UX6xBN,CW9xBI,mCACE,UX6xBN,CWzxBI,+BACE,oBX2xBN,CKxoBI,wCMzII,yCACE,YXoxBR,CACF,CW/wBI,iCACE,gBXkxBN,CWnxBI,iCACE,iBXkxBN,CWnxBI,uBAEE,gBXixBN,CW9wBM,iCACE,eXgxBR,CW1wBE,kBAEE,WAAA,CAGA,eAAA,CACA,kBAAA,CAHA,6BAAA,CACA,cAAA,CAHA,iBXixBJ,CWxwBE,mBACE,YAAA,CACA,aX0wBJ,CWtwBE,sBAKE,gBAAA,CAHA,MAAA,CACA,gBAAA,CAGA,UAAA,CAFA,cAAA,CAHA,iBAAA,CACA,OX4wBJ,CWnwBA,gBACE,gDXswBF,CWnwBE,uBACE,YAAA,CACA,cAAA,CACA,6BAAA,CACA,aXqwBJ,CWjwBE,kCACE,sCXmwBJ,CWhwBI,6DACE,+BXkwBN,CWnwBI,0DACE,+BXkwBN,CWnwBI,oDACE,+BXkwBN,CW1vBA,cAIE,wCAAA,CACA,gBAAA,CAHA,iBAAA,CACA,eAAA,CAFA,UXiwBF,CKntBI,mCM/CJ,cASI,UX6vBF,CACF,CWzvBE,yBACE,sCX2vBJ,CWpvBA,WACE,cAAA,CACA,qBXuvBF,CKhuBI,mCMzBJ,WAMI,eXuvBF,CACF,CWpvBE,iBACE,oBAAA,CAEA,aAAA,CACA,iBAAA,CAFA,YXwvBJ,CWnvBI,wBACE,eXqvBN,CWjvBI,qBAGE,iBAAA,CAFA,gBAAA,CACA,mBXovBN,CYt5BE,uBAKE,kBAAA,CACA,mBAAA,CAHA,gCAAA,CAIA,cAAA,CANA,oBAAA,CAGA,eAAA,CAFA,kBAAA,CAMA,gEZy5BJ,CYn5BI,gCAEE,2CAAA,CACA,uCAAA,CAFA,gCZu5BN,CYj5BI,kDAEE,0CAAA,CACA,sCAAA,CAFA,+BZq5BN,CYt5BI,+CAEE,0CAAA,CACA,sCAAA,CAFA,+BZq5BN,CYt5BI,yCAEE,0CAAA,CACA,sCAAA,CAFA,+BZq5BN,CY94BE,gCAKE,4BZm5BJ,CYx5BE,gCAKE,6BZm5BJ,CYx5BE,gCAME,6BZk5BJ,CYx5BE,gCAME,4BZk5BJ,CYx5BE,sBAIE,6DAAA,CAGA,8BAAA,CAJA,eAAA,CAFA,aAAA,CACA,eAAA,CAMA,sCZg5BJ,CY34BI,iDACE,6CAAA,CACA,8BZ64BN,CY/4BI,8CACE,6CAAA,CACA,8BZ64BN,CY/4BI,wCACE,6CAAA,CACA,8BZ64BN,CYz4BI,+BACE,UZ24BN,Ca97BA,WAME,2CAAA,CAGA,0DACE,CALF,gCAAA,CAFA,MAAA,CAFA,uBAAA,CAAA,eAAA,CAEA,OAAA,CADA,KAAA,CAEA,Sbo8BF,Ca17BE,aAdF,WAeI,Yb67BF,CACF,Ca17BE,iCACE,gEACE,CAEF,kEb07BJ,Cap7BE,iCACE,2BAAA,CACA,iEbs7BJ,Cah7BE,kBAEE,kBAAA,CADA,YAAA,CAEA,ebk7BJ,Ca96BE,mBAKE,kBAAA,CAGA,cAAA,CALA,YAAA,CAIA,uCAAA,CAHA,aAAA,CAHA,iBAAA,CAQA,uBAAA,CAHA,qBAAA,CAJA,Sbu7BJ,Ca76BI,yBACE,Ub+6BN,Ca36BI,iCACE,oBb66BN,Caz6BI,uCAEE,uCAAA,CADA,Yb46BN,Cav6BI,2BACE,YAAA,CACA,aby6BN,CK3zBI,wCQhHA,2BAMI,Yby6BN,CACF,Cat6BM,iDAIE,iBAAA,CAHA,aAAA,CAEA,aAAA,CADA,Ub06BR,Ca56BM,8CAIE,iBAAA,CAHA,aAAA,CAEA,aAAA,CADA,Ub06BR,Ca56BM,wCAIE,iBAAA,CAHA,aAAA,CAEA,aAAA,CADA,Ub06BR,CKz1BI,mCQ1EA,iCAII,Ybm6BN,CACF,Cah6BM,wCACE,Ybk6BR,Ca95BM,+CACE,oBbg6BR,CKp2BI,sCQvDA,iCAII,Yb25BN,CACF,Cat5BE,kBAEE,YAAA,CACA,cAAA,CAFA,iBAAA,CAGA,8Dbw5BJ,Can5BI,oCAGE,SAAA,CAIA,mBAAA,CALA,6BAAA,CAEA,8DACE,CAJF,Uby5BN,Cah5BM,8CACE,8Bbk5BR,Ca74BI,8BACE,eb+4BN,Ca14BE,4BAGE,kBb+4BJ,Cal5BE,4BAGE,iBb+4BJ,Cal5BE,4BAIE,gBb84BJ,Cal5BE,4BAIE,iBb84BJ,Cal5BE,kBACE,WAAA,CAIA,eAAA,CAHA,aAAA,CAIA,kBb44BJ,Caz4BI,0DAGE,SAAA,CAIA,mBAAA,CALA,8BAAA,CAEA,8DACE,CAJF,Ub+4BN,Cat4BM,oEACE,6Bbw4BR,Cap4BM,4EAGE,SAAA,CAIA,mBAAA,CALA,uBAAA,CAEA,8DACE,CAJF,Sb04BR,Ca/3BI,uCAGE,WAAA,CAFA,iBAAA,CACA,Ubk4BN,Ca53BE,mBACE,YAAA,CACA,aAAA,CACA,cAAA,CAEA,+CACE,CAFF,kBb+3BJ,Caz3BI,8DACE,WAAA,CACA,SAAA,CACA,oCb23BN,Cap3BE,mBACE,Ybs3BJ,CKz6BI,mCQkDF,6BAQI,gBbs3BJ,Ca93BA,6BAQI,iBbs3BJ,Ca93BA,mBAKI,aAAA,CAEA,iBAAA,CADA,abw3BJ,CACF,CKj7BI,sCQkDF,6BAaI,kBbs3BJ,Can4BA,6BAaI,mBbs3BJ,CACF,Cc5lCA,MACE,0MAAA,CACA,gMAAA,CACA,yNd+lCF,CczlCA,QACE,eAAA,CACA,ed4lCF,CczlCE,eACE,aAAA,CAGA,eAAA,CADA,eAAA,CADA,eAAA,CAGA,sBd2lCJ,CcxlCI,+BACE,Yd0lCN,CcvlCM,mCAEE,WAAA,CADA,Ud0lCR,CcllCQ,6DAME,iBAAA,CALA,aAAA,CAGA,aAAA,CADA,cAAA,CAEA,kBAAA,CAHA,UdwlCV,Cc1lCQ,0DAME,iBAAA,CALA,aAAA,CAGA,aAAA,CADA,cAAA,CAEA,kBAAA,CAHA,UdwlCV,Cc1lCQ,oDAME,iBAAA,CALA,aAAA,CAGA,aAAA,CADA,cAAA,CAEA,kBAAA,CAHA,UdwlCV,Cc7kCE,cAGE,eAAA,CAFA,QAAA,CACA,SdglCJ,Cc3kCE,cACE,ed6kCJ,Cc1kCI,sCACE,ed4kCN,Cc7kCI,sCACE,cd4kCN,CcvkCE,cAEE,kBAAA,CAKA,cAAA,CANA,YAAA,CAEA,6BAAA,CACA,iBAAA,CACA,eAAA,CAIA,uBAAA,CAHA,sBAAA,CAEA,sBd0kCJ,CctkCI,kCACE,uCdwkCN,CcpkCI,oCACE,+BdskCN,CclkCI,0CACE,UdokCN,CchkCI,yCACE,+BdkkCN,CcnkCI,sCACE,+BdkkCN,CcnkCI,gCACE,+BdkkCN,Cc9jCI,4BACE,uCAAA,CACA,oBdgkCN,Cc5jCI,0CACE,Yd8jCN,Cc3jCM,yDAKE,6BAAA,CAJA,aAAA,CAEA,WAAA,CACA,qCAAA,CAAA,6BAAA,CAFA,UdgkCR,CczjCM,kDACE,Yd2jCR,CctjCI,gBAEE,cAAA,CADA,YdyjCN,CcnjCE,cACE,adqjCJ,CcjjCE,gBACE,YdmjCJ,CKjgCI,wCS3CA,0CASE,2CAAA,CAHA,YAAA,CACA,qBAAA,CACA,WAAA,CAJA,MAAA,CAFA,iBAAA,CAEA,OAAA,CADA,KAAA,CAEA,SdkjCJ,CcviCI,4DACE,eAAA,CACA,edyiCN,Cc3iCI,yDACE,eAAA,CACA,edyiCN,Cc3iCI,mDACE,eAAA,CACA,edyiCN,CcriCI,gCAQE,qDAAA,CAJA,uCAAA,CAKA,cAAA,CAJA,eAAA,CAHA,aAAA,CAIA,kBAAA,CAHA,wBAAA,CAFA,iBAAA,CAMA,kBdyiCN,CcpiCM,wDAGE,Ud0iCR,Cc7iCM,wDAGE,Wd0iCR,Cc7iCM,8CAIE,aAAA,CAEA,aAAA,CACA,YAAA,CANA,iBAAA,CACA,SAAA,CAGA,YdwiCR,CcniCQ,oDAIE,6BAAA,CAIA,UAAA,CAPA,aAAA,CAEA,WAAA,CAEA,2CAAA,CAAA,mCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CALA,Ud2iCV,CchiCM,8CAEE,2CAAA,CACA,gEACE,CAHF,eAAA,CAIA,gCAAA,CAAA,4BAAA,CACA,kBdiiCR,Cc9hCQ,2DACE,YdgiCV,Cc3hCM,8CAGE,2CAAA,CAFA,gCAAA,CACA,ed8hCR,CczhCM,yCAIE,aAAA,CADA,UAAA,CAEA,YAAA,CACA,aAAA,CALA,iBAAA,CAEA,WAAA,CADA,Sd+hCR,CcthCI,+BACE,MdwhCN,CcphCI,+BAEE,4DAAA,CADA,SduhCN,CcnhCM,qDACE,+BdqhCR,CclhCQ,gFACE,+BdohCV,CcrhCQ,6EACE,+BdohCV,CcrhCQ,uEACE,+BdohCV,Cc9gCI,+BACE,YAAA,CACA,mBdghCN,Cc7gCM,uDAGE,mBdghCR,CcnhCM,uDAGE,kBdghCR,CcnhCM,6CAIE,gBAAA,CAFA,aAAA,CADA,YdkhCR,Cc5gCQ,mDAIE,6BAAA,CAIA,UAAA,CAPA,aAAA,CAEA,WAAA,CAEA,2CAAA,CAAA,mCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CALA,UdohCV,CcrgCM,+CACE,mBdugCR,Cc//BM,4CAEE,4BAAA,CADA,edkgCR,Cc9/BQ,oEACE,mBdggCV,CcjgCQ,oEACE,oBdggCV,Cc5/BQ,4EACE,iBd8/BV,Cc//BQ,4EACE,kBd8/BV,Cc1/BQ,oFACE,mBd4/BV,Cc7/BQ,oFACE,oBd4/BV,Ccx/BQ,4FACE,mBd0/BV,Cc3/BQ,4FACE,oBd0/BV,Ccn/BE,mBACE,4Bdq/BJ,Ccj/BE,wBACE,YAAA,CAEA,SAAA,CADA,0BAAA,CAEA,oEdm/BJ,Cc9+BI,kCACE,2Bdg/BN,Cc3+BE,gCAEE,SAAA,CADA,uBAAA,CAEA,qEd6+BJ,Ccx+BI,8CAEE,kCAAA,CAAA,0Bdy+BN,CACF,CK9oCI,wCS6KA,0CACE,Ydo+BJ,Ccj+BI,yDACE,Udm+BN,Cc/9BI,wDACE,Ydi+BN,Cc79BI,kDACE,Yd+9BN,Cc19BE,gBAIE,iDAAA,CADA,gCAAA,CAFA,aAAA,CACA,ed89BJ,CACF,CK3sCM,6DSsPF,6CACE,Ydw9BJ,Ccr9BI,4DACE,Udu9BN,Ccn9BI,2DACE,Ydq9BN,Ccj9BI,qDACE,Ydm9BN,CACF,CKnsCI,mCS2PE,6CACE,uBd28BN,Ccv8BI,gDACE,Ydy8BN,CACF,CK3sCI,sCS7JJ,QAqaI,oDdu8BF,Ccj8BI,8CACE,uBdm8BN,Cc/7BI,8CACE,Ydi8BN,Cc57BE,wBACE,Yd87BJ,Cc17BE,6DACE,ad47BJ,Cc77BE,0DACE,ad47BJ,Cc77BE,oDACE,ad47BJ,Ccx7BE,6CACE,Yd07BJ,Cct7BE,uBACE,aAAA,CACA,edw7BJ,Ccr7BI,kCACE,edu7BN,Ccn7BI,qCACE,eAAA,CACA,mBdq7BN,Ccl7BM,mDACE,mBdo7BR,Cch7BM,mDACE,Ydk7BR,Cc76BI,+BACE,ad+6BN,Cc56BM,2DACE,Sd86BR,Ccx6BE,cAIE,kBAAA,CAHA,WAAA,CAEA,YAAA,CAEA,+CACE,CAJF,Wd66BJ,Ccr6BI,wBACE,UAAA,CACA,wBdu6BN,Ccn6BI,oBACE,uDdq6BN,Ccj6BI,oBAKE,6BAAA,CAIA,UAAA,CARA,oBAAA,CAEA,WAAA,CAGA,2CAAA,CAAA,mCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CAJA,qBAAA,CAFA,Ud06BN,Cc/5BI,0JAEE,uBdg6BN,Ccx5BI,mFAEE,Yd05BN,Cct5BI,4CACE,Ydw5BN,Ccr5BM,oDACE,aAAA,CACA,Sdu5BR,Ccp5BQ,kEAGE,eAAA,CAFA,YAAA,CACA,eAAA,CAEA,mBds5BV,Ccn5BU,gFACE,mBdq5BZ,Ccj5BU,gFACE,Ydm5BZ,Cc34BI,2CACE,ad64BN,Cc14BM,iFACE,mBd44BR,Cc74BM,iFACE,kBd44BR,Ccn4BI,mFACE,edq4BN,Ccl4BM,iGACE,Sdo4BR,Cc/3BI,qFAGE,mDdi4BN,Ccp4BI,qFAGE,oDdi4BN,Ccp4BI,2EACE,aAAA,CACA,oBdk4BN,Cc93BM,0FACE,Ydg4BR,CACF,Cen+CA,MACE,igBfs+CF,Ceh+CA,WACE,iBfm+CF,CKr0CI,mCU/JJ,WAKI,efm+CF,CACF,Ceh+CE,kBACE,Yfk+CJ,Ce99CE,oBAEE,SAAA,CADA,Sfi+CJ,CK9zCI,wCUpKF,8BAQI,Yfw+CJ,Ceh/CA,8BAQI,afw+CJ,Ceh/CA,oBAYI,2CAAA,CACA,kBAAA,CAHA,WAAA,CACA,eAAA,CAOA,mBAAA,CAZA,iBAAA,CACA,SAAA,CAOA,uBAAA,CACA,4CACE,CAPF,Ufu+CJ,Ce39CI,+DACE,SAAA,CACA,oCf69CN,CACF,CKp2CI,mCUjJF,8BAiCI,Mf+9CJ,CehgDA,8BAiCI,Of+9CJ,CehgDA,oBAoCI,gCAAA,CACA,cAAA,CAFA,QAAA,CAJA,cAAA,CACA,KAAA,CAMA,sDACE,CALF,Of89CJ,Cep9CI,+DAME,YAAA,CACA,SAAA,CACA,4CACE,CARF,Ufy9CN,CACF,CKn2CI,wCUxGA,+DAII,mBf28CN,CACF,CKj5CM,6DU/DF,+DASI,mBf28CN,CACF,CKt5CM,6DU/DF,+DAcI,mBf28CN,CACF,Cet8CE,kBAEE,kCAAA,CAAA,0Bfu8CJ,CKr3CI,wCUpFF,4BAQI,Mf88CJ,Cet9CA,4BAQI,Of88CJ,Cet9CA,kBAWI,QAAA,CAGA,SAAA,CAFA,eAAA,CANA,cAAA,CACA,KAAA,CAMA,wBAAA,CAEA,qGACE,CANF,OAAA,CADA,Sf68CJ,Ceh8CI,4BACE,yBfk8CN,Ce97CI,6DAEE,WAAA,CAEA,SAAA,CADA,uBAAA,CAEA,sGACE,CALF,Ufo8CN,CACF,CKh6CI,mCUjEF,kBA2CI,WAAA,CAEA,eAAA,CAHA,iBAAA,CAIA,8CAAA,CAFA,af67CJ,Cex7CI,4BACE,Uf07CN,CACF,CKl8CM,6DUYF,6DAII,afs7CN,CACF,CKj7CI,sCUVA,6DASI,afs7CN,CACF,Cej7CE,iBAIE,2CAAA,CACA,gCAAA,CAFA,aAAA,CAFA,iBAAA,CAKA,2CACE,CALF,Sfu7CJ,CK97CI,mCUKF,iBAaI,gCAAA,CACA,mBAAA,CAFA,afm7CJ,Ce96CI,uBACE,oCfg7CN,CACF,Ce56CI,4DAEE,2CAAA,CACA,6BAAA,CACA,oCAAA,CAHA,gCfi7CN,Cez6CE,4BAKE,mBAAA,CAAA,oBf86CJ,Cen7CE,4BAKE,mBAAA,CAAA,oBf86CJ,Cen7CE,kBAQE,sBAAA,CAFA,eAAA,CAFA,WAAA,CAHA,iBAAA,CAMA,sBAAA,CAJA,UAAA,CADA,Sfi7CJ,Cex6CI,oCACE,0BAAA,CAAA,qBf06CN,Ce36CI,yCACE,yBAAA,CAAA,qBf06CN,Ce36CI,+BACE,qBf06CN,Cet6CI,oCAEE,uCfu6CN,Cez6CI,yCAEE,uCfu6CN,Cez6CI,kEAEE,uCfu6CN,Cen6CI,6BACE,Yfq6CN,CK98CI,wCUkBF,kBA8BI,eAAA,CADA,aAAA,CADA,Ufs6CJ,CACF,CKx+CI,mCUqCF,4BAmCI,mBfs6CJ,Cez8CA,4BAmCI,oBfs6CJ,Cez8CA,kBAoCI,aAAA,CACA,efo6CJ,Cej6CI,oCACE,uCfm6CN,Cep6CI,yCACE,uCfm6CN,Cep6CI,+BACE,uCfm6CN,Ce/5CI,mCACE,gCfi6CN,Ce75CI,6DACE,kBf+5CN,Ce55CM,+EAEE,uCf65CR,Ce/5CM,oFAEE,uCf65CR,Ce/5CM,wJAEE,uCf65CR,CACF,Cev5CE,iBAIE,cAAA,CAHA,oBAAA,CAEA,aAAA,CAEA,kCACE,CAJF,Yf45CJ,Cep5CI,uBACE,Ufs5CN,Cel5CI,yCAGE,Ufq5CN,Cex5CI,yCAGE,Wfq5CN,Cex5CI,+BACE,iBAAA,CACA,SAAA,CAEA,Sfo5CN,Cej5CM,6CACE,oBfm5CR,CK3/CI,wCUgGA,yCAcI,Ufk5CN,Ceh6CE,yCAcI,Wfk5CN,Ceh6CE,+BAaI,Sfm5CN,Ce/4CM,+CACE,Yfi5CR,CACF,CKvhDI,mCUmHA,+BAwBI,mBfg5CN,Ce74CM,8CACE,Yf+4CR,CACF,Cez4CE,8BAGE,Wf64CJ,Ceh5CE,8BAGE,Uf64CJ,Ceh5CE,oBAKE,mBAAA,CAJA,iBAAA,CACA,SAAA,CAEA,Sf44CJ,CKnhDI,wCUmIF,8BAUI,Wf24CJ,Cer5CA,8BAUI,Uf24CJ,Cer5CA,oBASI,Sf44CJ,CACF,Cex4CI,gCACE,iBf84CN,Ce/4CI,gCACE,kBf84CN,Ce/4CI,sBAEE,uCAAA,CAEA,SAAA,CADA,oBAAA,CAEA,+Df04CN,Cer4CM,yCAEE,uCAAA,CADA,Yfw4CR,Cen4CM,yFAGE,SAAA,CACA,mBAAA,CAFA,kBfs4CR,Cej4CQ,8FACE,Ufm4CV,Ce53CE,8BAOE,mBAAA,CAAA,oBfm4CJ,Ce14CE,8BAOE,mBAAA,CAAA,oBfm4CJ,Ce14CE,oBAIE,kBAAA,CAIA,yCAAA,CALA,YAAA,CAMA,eAAA,CAHA,WAAA,CAKA,SAAA,CAVA,iBAAA,CACA,KAAA,CAUA,uBAAA,CAFA,kBAAA,CALA,Ufq4CJ,CK7kDI,mCUmMF,8BAgBI,mBf+3CJ,Ce/4CA,8BAgBI,oBf+3CJ,Ce/4CA,oBAiBI,ef83CJ,CACF,Ce33CI,+DACE,SAAA,CACA,0Bf63CN,Cex3CE,6BAKE,+Bf23CJ,Ceh4CE,6BAKE,gCf23CJ,Ceh4CE,6BAME,gCf03CJ,Ceh4CE,6BAME,+Bf03CJ,Ceh4CE,mBAIE,eAAA,CAHA,iBAAA,CAEA,UAAA,CADA,Sf83CJ,CK5kDI,wCU4MF,mBAWI,QAAA,CADA,Uf23CJ,CACF,CKrmDI,mCU+NF,mBAiBI,SAAA,CADA,UAAA,CAEA,sBf03CJ,Cev3CI,8DACE,8BAAA,CACA,Sfy3CN,CACF,Cep3CE,uBAKE,kCAAA,CAAA,0BAAA,CAFA,2CAAA,CAFA,WAAA,CACA,eAAA,CAOA,kBfk3CJ,Ce/2CI,iEAZF,uBAaI,uBfk3CJ,CACF,CKlpDM,6DUkRJ,uBAkBI,afk3CJ,CACF,CKjoDI,sCU4PF,uBAuBI,afk3CJ,CACF,CKtoDI,mCU4PF,uBA4BI,YAAA,CAEA,+DAAA,CADA,oBfm3CJ,Ce/2CI,kEACE,efi3CN,Ce72CI,6BACE,qDf+2CN,Ce32CI,0CAEE,YAAA,CADA,Wf82CN,Cez2CI,gDACE,oDf22CN,Cex2CM,sDACE,0Cf02CR,CACF,Cen2CA,kBACE,gCAAA,CACA,qBfs2CF,Cen2CE,wBAKE,qDAAA,CAHA,uCAAA,CACA,gBAAA,CACA,kBAAA,CAHA,eAAA,CAKA,uBfq2CJ,CK1qDI,mCU+TF,kCAUI,mBfq2CJ,Ce/2CA,kCAUI,oBfq2CJ,CACF,Cej2CE,wBAGE,eAAA,CAFA,QAAA,CACA,Sfo2CJ,Ce/1CE,wBACE,yDfi2CJ,Ce91CI,oCACE,efg2CN,Ce31CE,wBACE,aAAA,CACA,YAAA,CAEA,uBAAA,CADA,gCf81CJ,Ce11CI,mDACE,uDf41CN,Ce71CI,gDACE,uDf41CN,Ce71CI,0CACE,uDf41CN,Cex1CI,gDACE,mBf01CN,Cer1CE,gCAGE,+BAAA,CAGA,cAAA,CALA,aAAA,CAGA,gBAAA,CACA,YAAA,CAHA,mBAAA,CAQA,uBAAA,CAHA,2Cfw1CJ,CKhtDI,mCUiXF,0CAcI,mBfq1CJ,Cen2CA,0CAcI,oBfq1CJ,CACF,Cel1CI,2DAEE,uDAAA,CADA,+Bfq1CN,Cet1CI,wDAEE,uDAAA,CADA,+Bfq1CN,Cet1CI,kDAEE,uDAAA,CADA,+Bfq1CN,Ceh1CI,wCACE,Yfk1CN,Ce70CI,wDACE,Yf+0CN,Ce30CI,oCACE,Wf60CN,Cex0CE,2BAGE,eAAA,CADA,eAAA,CADA,iBf40CJ,CKvuDI,mCU0ZF,qCAOI,mBf00CJ,Cej1CA,qCAOI,oBf00CJ,CACF,Cep0CM,8DAGE,eAAA,CADA,eAAA,CAEA,eAAA,CAHA,efy0CR,Ceh0CE,kCAEE,Mfs0CJ,Cex0CE,kCAEE,Ofs0CJ,Cex0CE,wBAME,uCAAA,CAFA,aAAA,CACA,YAAA,CAJA,iBAAA,CAEA,Yfq0CJ,CKvuDI,wCU+ZF,wBAUI,Yfk0CJ,CACF,Ce/zCI,8BAIE,6BAAA,CAIA,UAAA,CAPA,oBAAA,CAEA,WAAA,CAEA,+CAAA,CAAA,uCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CALA,Ufu0CN,Ce9zCM,wCACE,oBfg0CR,Ce1zCE,yBAGE,gBAAA,CADA,eAAA,CAEA,eAAA,CAHA,af+zCJ,CexzCE,0BASE,2BAAA,CACA,oBAAA,CALA,uCAAA,CAJA,mBAAA,CAKA,gBAAA,CACA,eAAA,CAJA,aAAA,CADA,eAAA,CAEA,eAAA,CAIA,sBf4zCJ,CK3wDI,wCUucF,0BAeI,oBAAA,CADA,ef2zCJ,CACF,CK1zDM,6DUgfJ,0BAqBI,oBAAA,CADA,ef2zCJ,CACF,CevzCI,+BAEE,4BAAA,CADA,yBf0zCN,CepzCE,yBAEE,gBAAA,CACA,iBAAA,CAFA,afwzCJ,CelzCE,uBAEE,4BAAA,CADA,+BfqzCJ,CgB79DA,WACE,iBAAA,CACA,ShBg+DF,CgB79DE,kBAOE,2CAAA,CACA,mBAAA,CACA,8BAAA,CAHA,gCAAA,CAHA,QAAA,CAEA,gBAAA,CADA,YAAA,CAOA,SAAA,CAVA,iBAAA,CACA,sBAAA,CAQA,mCAAA,CAEA,oEhB+9DJ,CgBz9DI,+DACE,gBAAA,CAEA,SAAA,CADA,+BAAA,CAEA,sFACE,CADF,8EhB29DN,CgB/9DI,4DACE,gBAAA,CAEA,SAAA,CADA,+BAAA,CAEA,mFACE,CADF,8EhB29DN,CgB/9DI,sDACE,gBAAA,CAEA,SAAA,CADA,+BAAA,CAEA,8EhB29DN,CgBp9DI,wBAUE,qCAAA,CAAA,8CAAA,CAFA,mCAAA,CAAA,oCAAA,CACA,YAAA,CAEA,UAAA,CANA,QAAA,CAFA,QAAA,CAIA,kBAAA,CADA,iBAAA,CALA,iBAAA,CACA,KAAA,CAEA,OhB69DN,CgBj9DE,iBAOE,mBAAA,CAFA,eAAA,CACA,oBAAA,CAJA,QAAA,CADA,kBAAA,CAGA,aAAA,CADA,ShBu9DJ,CgB/8DE,iBACE,kBhBi9DJ,CgB78DE,2BAGE,kBAAA,CAAA,oBhBm9DJ,CgBt9DE,2BAGE,mBAAA,CAAA,mBhBm9DJ,CgBt9DE,iBAKE,cAAA,CAJA,aAAA,CAGA,YAAA,CAKA,uBAAA,CAHA,2CACE,CALF,UhBo9DJ,CgB18DI,4CACE,+BhB48DN,CgB78DI,yCACE,+BhB48DN,CgB78DI,mCACE,+BhB48DN,CgBx8DI,uBACE,qDhB08DN,CiB9hEA,YAIE,qBAAA,CADA,aAAA,CAGA,gBAAA,CALA,uBAAA,CAAA,eAAA,CACA,UAAA,CAGA,ajBkiEF,CiB9hEE,aATF,YAUI,YjBiiEF,CACF,CKn3DI,wCYxKA,+BAGE,ajBqiEJ,CiBxiEE,+BAGE,cjBqiEJ,CiBxiEE,qBAQE,2CAAA,CAHA,aAAA,CAEA,WAAA,CANA,cAAA,CACA,KAAA,CAOA,uBAAA,CACA,iEACE,CALF,aAAA,CAFA,SjBoiEJ,CiBzhEI,mEACE,8BAAA,CACA,6BjB2hEN,CiBxhEM,6EACE,8BjB0hER,CiBrhEI,6CAEE,QAAA,CAAA,MAAA,CACA,QAAA,CAEA,eAAA,CAJA,iBAAA,CACA,OAAA,CAEA,yBAAA,CAAA,qBAAA,CAFA,KjB0hEN,CACF,CKl6DI,sCYtKJ,YAuDI,QjBqhEF,CiBlhEE,mBACE,WjBohEJ,CACF,CiBhhEE,uBACE,YAAA,CACA,OjBkhEJ,CK96DI,mCYtGF,uBAMI,QjBkhEJ,CiB/gEI,8BACE,WjBihEN,CiB7gEI,qCACE,ajB+gEN,CiB3gEI,+CACE,kBjB6gEN,CACF,CiBxgEE,wBAIE,kCAAA,CAAA,0BAAA,CAHA,cAAA,CACA,eAAA,CAQA,+DAAA,CADA,oBjBsgEJ,CiBlgEI,8BACE,qDjBogEN,CiBhgEI,2CAEE,YAAA,CADA,WjBmgEN,CiB9/DI,iDACE,oDjBggEN,CiB7/DM,uDACE,0CjB+/DR,CK77DI,wCYxDF,YAME,gCAAA,CADA,QAAA,CAEA,SAAA,CANA,cAAA,CACA,KAAA,CAMA,sDACE,CALF,OAAA,CADA,SjB8/DF,CiBn/DE,4CAEE,WAAA,CACA,SAAA,CACA,4CACE,CAJF,UjBw/DJ,CACF,CkBzoEA,yBACE,GACE,QlB2oEF,CkBxoEA,GACE,alB0oEF,CACF,CkBjpEA,iBACE,GACE,QlB2oEF,CkBxoEA,GACE,alB0oEF,CACF,CkBtoEA,wBACE,GAEE,SAAA,CADA,0BlByoEF,CkBroEA,IACE,SlBuoEF,CkBpoEA,GAEE,SAAA,CADA,uBlBuoEF,CACF,CkBnpEA,gBACE,GAEE,SAAA,CADA,0BlByoEF,CkBroEA,IACE,SlBuoEF,CkBpoEA,GAEE,SAAA,CADA,uBlBuoEF,CACF,CkB9nEA,MACE,mgBAAA,CACA,oiBAAA,CACA,0nBAAA,CACA,mhBlBgoEF,CkB1nEA,WAOE,kCAAA,CAAA,0BAAA,CANA,aAAA,CACA,gBAAA,CACA,eAAA,CAEA,uCAAA,CAGA,uBAAA,CAJA,kBlBgoEF,CkBznEE,iBACE,UlB2nEJ,CkBvnEE,iBACE,oBAAA,CAEA,aAAA,CACA,qBAAA,CAFA,UlB2nEJ,CkBtnEI,+BAEE,iBlBwnEN,CkB1nEI,+BAEE,kBlBwnEN,CkB1nEI,qBACE,gBlBynEN,CkBpnEI,kDACE,iBlBunEN,CkBxnEI,kDACE,kBlBunEN,CkBxnEI,kDAEE,iBlBsnEN,CkBxnEI,kDAEE,kBlBsnEN,CkBjnEE,iCAGE,iBlBsnEJ,CkBznEE,iCAGE,kBlBsnEJ,CkBznEE,uBACE,oBAAA,CACA,6BAAA,CAEA,eAAA,CACA,sBAAA,CACA,qBlBmnEJ,CkB/mEE,kBAIE,gBAAA,CACA,oBAAA,CAJA,gBAAA,CAKA,WAAA,CAHA,eAAA,CADA,SlBqnEJ,CkB9mEI,uCACE,oCAAA,CAAA,4BlBgnEN,CkB3mEE,iBACE,oBlB6mEJ,CkB1mEI,sCACE,mCAAA,CAAA,2BlB4mEN,CkBxmEI,kCAIE,kBlB+mEN,CkBnnEI,kCAIE,iBlB+mEN,CkBnnEI,wBAME,6BAAA,CAGA,UAAA,CARA,oBAAA,CAEA,YAAA,CAIA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CAHA,uBAAA,CAHA,WlBinEN,CkBtmEI,kDACE,iBlBwmEN,CkBzmEI,kDACE,kBlBwmEN,CkBpmEI,iCACE,gDAAA,CAAA,wClBsmEN,CkBlmEI,+BACE,8CAAA,CAAA,sClBomEN,CkBhmEI,+BACE,8CAAA,CAAA,sClBkmEN,CkB9lEI,sCACE,qDAAA,CAAA,6ClBgmEN,CmBlvEA,SAIE,2CAAA,CADA,gCAAA,CADA,aAAA,CADA,UnBwvEF,CmBlvEE,aAPF,SAQI,YnBqvEF,CACF,CKrkEI,wCczLJ,SAaI,YnBqvEF,CACF,CmBlvEE,+BACE,mBnBovEJ,CmBhvEE,yBAEE,iBnBsvEJ,CmBxvEE,yBAEE,kBnBsvEJ,CmBxvEE,eAME,eAAA,CADA,eAAA,CAJA,QAAA,CAEA,SAAA,CACA,kBnBovEJ,CmB9uEE,eACE,oBAAA,CACA,aAAA,CACA,kBAAA,CAAA,mBnBgvEJ,CmB3uEE,eAOE,kCAAA,CAAA,0BAAA,CANA,aAAA,CAEA,eAAA,CADA,gBAAA,CAMA,UAAA,CAJA,uCAAA,CACA,oBAAA,CAIA,8DnB4uEJ,CmBvuEI,iEAEE,aAAA,CACA,SnBwuEN,CmB3uEI,8DAEE,aAAA,CACA,SnBwuEN,CmB3uEI,wDAEE,aAAA,CACA,SnBwuEN,CmBnuEM,2CACE,qBnBquER,CmBtuEM,2CACE,qBnBwuER,CmBzuEM,2CACE,qBnB2uER,CmB5uEM,2CACE,qBnB8uER,CmB/uEM,2CACE,oBnBivER,CmBlvEM,2CACE,qBnBovER,CmBrvEM,2CACE,qBnBuvER,CmBxvEM,2CACE,qBnB0vER,CmB3vEM,4CACE,qBnB6vER,CmB9vEM,4CACE,oBnBgwER,CmBjwEM,4CACE,qBnBmwER,CmBpwEM,4CACE,qBnBswER,CmBvwEM,4CACE,qBnBywER,CmB1wEM,4CACE,qBnB4wER,CmB7wEM,4CACE,oBnB+wER,CmBzwEI,8CAEE,SAAA,CADA,yBAAA,CAEA,wCnB2wEN,CoBn1EA,yBACE,GACE,uDpBs1EF,CoBn1EA,IACE,mCpBq1EF,CoBl1EA,GACE,8BpBo1EF,CACF,CoB/1EA,iBACE,GACE,uDpBs1EF,CoBn1EA,IACE,mCpBq1EF,CoBl1EA,GACE,8BpBo1EF,CACF,CoB50EA,MACE,wBpB80EF,CoBx0EA,YA0BE,kCAAA,CAAA,0BAAA,CALA,2CAAA,CACA,mBAAA,CACA,8BAAA,CAHA,gCAAA,CAjBA,iJACE,CAeF,YAAA,CADA,8BAAA,CASA,SAAA,CA1BA,iBAAA,CACA,uBAAA,CAsBA,4BAAA,CAIA,2EACE,CAZF,6BAAA,CADA,SpBm1EF,CoBh0EE,0BACE,gBAAA,CAEA,SAAA,CADA,uBAAA,CAEA,2FpBk0EJ,CoB1zEE,2BACE,sCpB4zEJ,CoBxzEE,mBAEE,gBAAA,CADA,apB2zEJ,CoBvzEI,2CACE,YpByzEN,CoBrzEI,0CACE,epBuzEN,CoB/yEA,eAEE,YAAA,CADA,kBpBmzEF,CoB/yEE,yBACE,apBizEJ,CoB7yEE,6BACE,oBAAA,CAGA,iBpB6yEJ,CoBzyEE,8BACE,SpB2yEJ,CoBvyEE,sBAEE,sCAAA,CADA,qCpB0yEJ,CoBtyEI,0CAEE,mBAAA,CADA,wBAAA,CAAA,qBAAA,CAAA,oBAAA,CAAA,gBpByyEN,CoBnyEE,sBAIE,UAAA,CACA,cAAA,CAFA,YAAA,CAFA,iBAAA,CAKA,uBAAA,CACA,wBAAA,CAAA,qBAAA,CAAA,oBAAA,CAAA,gBAAA,CALA,SpB0yEJ,CoB/xEI,4BAiBE,mCAAA,CAAA,2BAAA,CALA,oDAAA,CACA,iBAAA,CAKA,UAAA,CATA,YAAA,CANA,YAAA,CAOA,cAAA,CACA,cAAA,CAVA,iBAAA,CACA,UAAA,CAYA,2CACE,CARF,wBAAA,CACA,6BAAA,CAJA,UpB2yEN,CoB1xEM,gCArBF,4BAsBI,sBAAA,CAAA,cpB6xEN,CACF,CoB1xEM,+DACE,0CpB4xER,CoB7xEM,4DACE,0CpB4xER,CoB7xEM,sDACE,0CpB4xER,CoBxxEM,0CAIE,sBAAA,CAAA,cAAA,CAHA,2CpB2xER,CoBnxEI,qDAGE,mCAAA,CAFA,oBAAA,CACA,iDpBsxEN,CoBjxEM,iBAPF,qDAQI,WpBoxEN,CoBjxEM,mEACE,uBpBmxER,CACF,CoB9wEI,yDACE,+BpBgxEN,CoBjxEI,sDACE,+BpBgxEN,CoBjxEI,gDACE,+BpBgxEN,CoB5wEI,oCAEE,sBAAA,CAAA,cAAA,CADA,epB+wEN,CqBh+EA,kBAIE,erB4+EF,CqBh/EA,kBAIE,gBrB4+EF,CqBh/EA,QAQE,2CAAA,CACA,oBAAA,CAEA,8BAAA,CALA,uCAAA,CACA,eAAA,CAGA,YAAA,CALA,mBAAA,CAJA,cAAA,CACA,UAAA,CAUA,yBAAA,CACA,mGACE,CAXF,SrB6+EF,CqB59EE,aApBF,QAqBI,YrB+9EF,CACF,CqB59EE,kBACE,wBrB89EJ,CqB19EE,8BAEE,SAAA,CAEA,mBAAA,CAHA,+BAAA,CAEA,uBrB69EJ,CqBz9EI,wCACE,8BrB29EN,CqBt9EE,mCAEE,0CAAA,CADA,+BrBy9EJ,CqB19EE,gCAEE,0CAAA,CADA,+BrBy9EJ,CqB19EE,0BAEE,0CAAA,CADA,+BrBy9EJ,CqBp9EE,YACE,oBAAA,CACA,oBrBs9EJ,CsBzgFA,4BACE,GACE,mBtB4gFF,CACF,CsB/gFA,oBACE,GACE,mBtB4gFF,CACF,CsBpgFA,MACE,kiBtBsgFF,CsBhgFA,YACE,aAAA,CAEA,eAAA,CADA,atBogFF,CsBhgFE,+BAOE,kBAAA,CAAA,kBtBigFJ,CsBxgFE,+BAOE,iBAAA,CAAA,mBtBigFJ,CsBxgFE,qBAQE,aAAA,CAEA,cAAA,CADA,YAAA,CARA,iBAAA,CAKA,UtBkgFJ,CsB3/EI,qCAIE,iBtBigFN,CsBrgFI,qCAIE,kBtBigFN,CsBrgFI,2BAKE,6BAAA,CAGA,UAAA,CAPA,oBAAA,CAEA,YAAA,CAGA,yCAAA,CAAA,iCAAA,CACA,6BAAA,CAAA,qBAAA,CALA,WtBmgFN,CsBx/EE,kBAUE,2CAAA,CACA,mBAAA,CACA,8BAAA,CAJA,gCAAA,CACA,oBAAA,CAJA,kBAAA,CADA,YAAA,CASA,SAAA,CANA,aAAA,CADA,SAAA,CALA,iBAAA,CAgBA,gCAAA,CAAA,4BAAA,CAfA,UAAA,CAYA,+CACE,CAZF,StBsgFJ,CsBr/EI,gEACE,gBAAA,CACA,SAAA,CACA,8CACE,CADF,sCtBu/EN,CsB1/EI,6DACE,gBAAA,CACA,SAAA,CACA,2CACE,CADF,sCtBu/EN,CsB1/EI,uDACE,gBAAA,CACA,SAAA,CACA,sCtBu/EN,CsBj/EI,wBAGE,oCACE,wCAAA,CAAA,gCtBi/EN,CsB7+EI,2CACE,sBAAA,CAAA,ctB++EN,CACF,CsB1+EE,kBACE,kBtB4+EJ,CsBx+EE,4BAGE,kBAAA,CAAA,oBtB++EJ,CsBl/EE,4BAGE,mBAAA,CAAA,mBtB++EJ,CsBl/EE,kBAME,cAAA,CALA,aAAA,CAIA,YAAA,CAKA,uBAAA,CAHA,2CACE,CAJF,kBAAA,CAFA,UtBg/EJ,CsBr+EI,6CACE,+BtBu+EN,CsBx+EI,0CACE,+BtBu+EN,CsBx+EI,oCACE,+BtBu+EN,CsBn+EI,wBACE,qDtBq+EN,CuBpkFA,MAEI,2RAAA,CAAA,8WAAA,CAAA,sPAAA,CAAA,8xBAAA,CAAA,qNAAA,CAAA,gbAAA,CAAA,gMAAA,CAAA,+PAAA,CAAA,8KAAA,CAAA,0eAAA,CAAA,kUAAA,CAAA,gMvB6lFJ,CuBjlFE,8CAOE,8CAAA,CACA,sBAAA,CAEA,mBAAA,CACA,8BAAA,CAPA,mCAAA,CAHA,iBAAA,CAIA,gBAAA,CAHA,iBAAA,CACA,eAAA,CAGA,uBvBylFJ,CuB/lFE,2CAOE,8CAAA,CACA,sBAAA,CAEA,mBAAA,CACA,8BAAA,CAPA,mCAAA,CAHA,iBAAA,CAIA,gBAAA,CAHA,iBAAA,CACA,eAAA,CAGA,uBvBylFJ,CuB/lFE,wDASE,uBvBslFJ,CuB/lFE,qDASE,uBvBslFJ,CuB/lFE,+CASE,uBvBslFJ,CuB/lFE,wDASE,wBvBslFJ,CuB/lFE,qDASE,wBvBslFJ,CuB/lFE,+CASE,wBvBslFJ,CuB/lFE,qCAOE,8CAAA,CACA,sBAAA,CAEA,mBAAA,CACA,8BAAA,CAPA,mCAAA,CAHA,iBAAA,CAIA,gBAAA,CAHA,iBAAA,CACA,eAAA,CAGA,uBvBylFJ,CuBjlFI,aAdF,8CAeI,evBolFJ,CuBnmFA,2CAeI,evBolFJ,CuBnmFA,qCAeI,evBolFJ,CACF,CuBhlFI,gDACE,qBvBklFN,CuBnlFI,6CACE,qBvBklFN,CuBnlFI,uCACE,qBvBklFN,CuB9kFI,gFAEE,iBAAA,CADA,cvBilFN,CuBllFI,0EAEE,iBAAA,CADA,cvBilFN,CuBllFI,8DAEE,iBAAA,CADA,cvBilFN,CuB5kFI,sEACE,iBvB8kFN,CuB/kFI,mEACE,iBvB8kFN,CuB/kFI,6DACE,iBvB8kFN,CuB1kFI,iEACE,evB4kFN,CuB7kFI,8DACE,evB4kFN,CuB7kFI,wDACE,evB4kFN,CuBxkFI,qEACE,YvB0kFN,CuB3kFI,kEACE,YvB0kFN,CuB3kFI,4DACE,YvB0kFN,CuBtkFI,+DACE,mBvBwkFN,CuBzkFI,4DACE,mBvBwkFN,CuBzkFI,sDACE,mBvBwkFN,CuBnkFE,oDAOE,oCAAA,CACA,sBAAA,CAFA,eAAA,CAJA,eAAA,CAAA,YAAA,CAEA,oBAAA,CAAA,iBAAA,CAHA,iBvB8kFJ,CuB/kFE,iDAOE,oCAAA,CACA,sBAAA,CAFA,eAAA,CAJA,eAAA,CAAA,YAAA,CAEA,oBAAA,CAAA,iBAAA,CAHA,iBvB8kFJ,CuB/kFE,8DAGE,kBAAA,CAAA,mBvB4kFJ,CuB/kFE,2DAGE,kBAAA,CAAA,mBvB4kFJ,CuB/kFE,qDAGE,kBAAA,CAAA,mBvB4kFJ,CuB/kFE,8DAGE,kBAAA,CAAA,mBvB4kFJ,CuB/kFE,2DAGE,kBAAA,CAAA,mBvB4kFJ,CuB/kFE,qDAGE,kBAAA,CAAA,mBvB4kFJ,CuB/kFE,8DAKE,iBAAA,CAAA,mBvB0kFJ,CuB/kFE,2DAKE,iBAAA,CAAA,mBvB0kFJ,CuB/kFE,qDAKE,iBAAA,CAAA,mBvB0kFJ,CuB/kFE,8DAKE,kBAAA,CAAA,kBvB0kFJ,CuB/kFE,2DAKE,kBAAA,CAAA,kBvB0kFJ,CuB/kFE,qDAKE,kBAAA,CAAA,kBvB0kFJ,CuB/kFE,8DASE,uBvBskFJ,CuB/kFE,2DASE,uBvBskFJ,CuB/kFE,qDASE,uBvBskFJ,CuB/kFE,8DASE,wBvBskFJ,CuB/kFE,2DASE,wBvBskFJ,CuB/kFE,qDASE,wBvBskFJ,CuB/kFE,8DAUE,4BvBqkFJ,CuB/kFE,2DAUE,4BvBqkFJ,CuB/kFE,qDAUE,4BvBqkFJ,CuB/kFE,8DAUE,6BvBqkFJ,CuB/kFE,2DAUE,6BvBqkFJ,CuB/kFE,qDAUE,6BvBqkFJ,CuB/kFE,2CAOE,oCAAA,CACA,sBAAA,CAFA,eAAA,CAJA,eAAA,CAAA,YAAA,CAEA,oBAAA,CAAA,iBAAA,CAHA,iBvB8kFJ,CuBlkFI,oEACE,evBokFN,CuBrkFI,iEACE,evBokFN,CuBrkFI,2DACE,evBokFN,CuBhkFI,2DAME,wBCwIU,CDpIV,UAAA,CALA,WAAA,CAEA,kDAAA,CAAA,0CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CARA,iBAAA,CACA,UAAA,CAEA,UvBwkFN,CuB5kFI,wDAME,wBCwIU,CDpIV,UAAA,CALA,WAAA,CAEA,0CAAA,CACA,qBAAA,CACA,iBAAA,CARA,iBAAA,CACA,UAAA,CAEA,UvBwkFN,CuB5kFI,qEAGE,UvBykFN,CuB5kFI,kEAGE,UvBykFN,CuB5kFI,4DAGE,UvBykFN,CuB5kFI,qEAGE,WvBykFN,CuB5kFI,kEAGE,WvBykFN,CuB5kFI,4DAGE,WvBykFN,CuB5kFI,kDAME,wBCwIU,CDpIV,UAAA,CALA,WAAA,CAEA,kDAAA,CAAA,0CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CARA,iBAAA,CACA,UAAA,CAEA,UvBwkFN,CuB9iFE,iEACE,oBvBijFJ,CuBljFE,2DACE,oBvBijFJ,CuBljFE,+CACE,oBvBijFJ,CuB7iFE,wEACE,oCAAA,CACA,oBvBgjFJ,CuBljFE,kEACE,oCAAA,CACA,oBvBgjFJ,CuBljFE,sDACE,oCAAA,CACA,oBvBgjFJ,CuB7iFI,+EACE,wBApBG,CAqBH,kDAAA,CAAA,0CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB+iFN,CuBnjFI,yEACE,wBApBG,CAqBH,0CAAA,CACA,qBAAA,CACA,iBvB+iFN,CuBnjFI,6DACE,wBApBG,CAqBH,kDAAA,CAAA,0CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB+iFN,CuB7jFE,oFACE,oBvBgkFJ,CuBjkFE,8EACE,oBvBgkFJ,CuBjkFE,kEACE,oBvBgkFJ,CuB5jFE,2FACE,mCAAA,CACA,oBvB+jFJ,CuBjkFE,qFACE,mCAAA,CACA,oBvB+jFJ,CuBjkFE,yEACE,mCAAA,CACA,oBvB+jFJ,CuB5jFI,kGACE,wBApBG,CAqBH,sDAAA,CAAA,8CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB8jFN,CuBlkFI,4FACE,wBApBG,CAqBH,8CAAA,CACA,qBAAA,CACA,iBvB8jFN,CuBlkFI,gFACE,wBApBG,CAqBH,sDAAA,CAAA,8CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB8jFN,CuB5kFE,uEACE,oBvB+kFJ,CuBhlFE,iEACE,oBvB+kFJ,CuBhlFE,qDACE,oBvB+kFJ,CuB3kFE,8EACE,mCAAA,CACA,oBvB8kFJ,CuBhlFE,wEACE,mCAAA,CACA,oBvB8kFJ,CuBhlFE,4DACE,mCAAA,CACA,oBvB8kFJ,CuB3kFI,qFACE,wBApBG,CAqBH,kDAAA,CAAA,0CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB6kFN,CuBjlFI,+EACE,wBApBG,CAqBH,0CAAA,CACA,qBAAA,CACA,iBvB6kFN,CuBjlFI,mEACE,wBApBG,CAqBH,kDAAA,CAAA,0CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB6kFN,CuB3lFE,iFACE,oBvB8lFJ,CuB/lFE,2EACE,oBvB8lFJ,CuB/lFE,+DACE,oBvB8lFJ,CuB1lFE,wFACE,mCAAA,CACA,oBvB6lFJ,CuB/lFE,kFACE,mCAAA,CACA,oBvB6lFJ,CuB/lFE,sEACE,mCAAA,CACA,oBvB6lFJ,CuB1lFI,+FACE,wBApBG,CAqBH,iDAAA,CAAA,yCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB4lFN,CuBhmFI,yFACE,wBApBG,CAqBH,yCAAA,CACA,qBAAA,CACA,iBvB4lFN,CuBhmFI,6EACE,wBApBG,CAqBH,iDAAA,CAAA,yCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB4lFN,CuB1mFE,iFACE,oBvB6mFJ,CuB9mFE,2EACE,oBvB6mFJ,CuB9mFE,+DACE,oBvB6mFJ,CuBzmFE,wFACE,kCAAA,CACA,oBvB4mFJ,CuB9mFE,kFACE,kCAAA,CACA,oBvB4mFJ,CuB9mFE,sEACE,kCAAA,CACA,oBvB4mFJ,CuBzmFI,+FACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB2mFN,CuB/mFI,yFACE,wBApBG,CAqBH,6CAAA,CACA,qBAAA,CACA,iBvB2mFN,CuB/mFI,6EACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB2mFN,CuBznFE,gFACE,oBvB4nFJ,CuB7nFE,0EACE,oBvB4nFJ,CuB7nFE,8DACE,oBvB4nFJ,CuBxnFE,uFACE,oCAAA,CACA,oBvB2nFJ,CuB7nFE,iFACE,oCAAA,CACA,oBvB2nFJ,CuB7nFE,qEACE,oCAAA,CACA,oBvB2nFJ,CuBxnFI,8FACE,wBApBG,CAqBH,sDAAA,CAAA,8CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB0nFN,CuB9nFI,wFACE,wBApBG,CAqBH,8CAAA,CACA,qBAAA,CACA,iBvB0nFN,CuB9nFI,4EACE,wBApBG,CAqBH,sDAAA,CAAA,8CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvB0nFN,CuBxoFE,wFACE,oBvB2oFJ,CuB5oFE,kFACE,oBvB2oFJ,CuB5oFE,sEACE,oBvB2oFJ,CuBvoFE,+FACE,mCAAA,CACA,oBvB0oFJ,CuB5oFE,yFACE,mCAAA,CACA,oBvB0oFJ,CuB5oFE,6EACE,mCAAA,CACA,oBvB0oFJ,CuBvoFI,sGACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvByoFN,CuB7oFI,gGACE,wBApBG,CAqBH,6CAAA,CACA,qBAAA,CACA,iBvByoFN,CuB7oFI,oFACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvByoFN,CuBvpFE,mFACE,oBvB0pFJ,CuB3pFE,6EACE,oBvB0pFJ,CuB3pFE,iEACE,oBvB0pFJ,CuBtpFE,0FACE,mCAAA,CACA,oBvBypFJ,CuB3pFE,oFACE,mCAAA,CACA,oBvBypFJ,CuB3pFE,wEACE,mCAAA,CACA,oBvBypFJ,CuBtpFI,iGACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBwpFN,CuB5pFI,2FACE,wBApBG,CAqBH,6CAAA,CACA,qBAAA,CACA,iBvBwpFN,CuB5pFI,+EACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBwpFN,CuBtqFE,0EACE,oBvByqFJ,CuB1qFE,oEACE,oBvByqFJ,CuB1qFE,wDACE,oBvByqFJ,CuBrqFE,iFACE,mCAAA,CACA,oBvBwqFJ,CuB1qFE,2EACE,mCAAA,CACA,oBvBwqFJ,CuB1qFE,+DACE,mCAAA,CACA,oBvBwqFJ,CuBrqFI,wFACE,wBApBG,CAqBH,oDAAA,CAAA,4CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBuqFN,CuB3qFI,kFACE,wBApBG,CAqBH,4CAAA,CACA,qBAAA,CACA,iBvBuqFN,CuB3qFI,sEACE,wBApBG,CAqBH,oDAAA,CAAA,4CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBuqFN,CuBrrFE,gEACE,oBvBwrFJ,CuBzrFE,0DACE,oBvBwrFJ,CuBzrFE,8CACE,oBvBwrFJ,CuBprFE,uEACE,kCAAA,CACA,oBvBurFJ,CuBzrFE,iEACE,kCAAA,CACA,oBvBurFJ,CuBzrFE,qDACE,kCAAA,CACA,oBvBurFJ,CuBprFI,8EACE,wBApBG,CAqBH,iDAAA,CAAA,yCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBsrFN,CuB1rFI,wEACE,wBApBG,CAqBH,yCAAA,CACA,qBAAA,CACA,iBvBsrFN,CuB1rFI,4DACE,wBApBG,CAqBH,iDAAA,CAAA,yCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBsrFN,CuBpsFE,oEACE,oBvBusFJ,CuBxsFE,8DACE,oBvBusFJ,CuBxsFE,kDACE,oBvBusFJ,CuBnsFE,2EACE,oCAAA,CACA,oBvBssFJ,CuBxsFE,qEACE,oCAAA,CACA,oBvBssFJ,CuBxsFE,yDACE,oCAAA,CACA,oBvBssFJ,CuBnsFI,kFACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBqsFN,CuBzsFI,4EACE,wBApBG,CAqBH,6CAAA,CACA,qBAAA,CACA,iBvBqsFN,CuBzsFI,gEACE,wBApBG,CAqBH,qDAAA,CAAA,6CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBqsFN,CuBntFE,wEACE,oBvBstFJ,CuBvtFE,kEACE,oBvBstFJ,CuBvtFE,sDACE,oBvBstFJ,CuBltFE,+EACE,kCAAA,CACA,oBvBqtFJ,CuBvtFE,yEACE,kCAAA,CACA,oBvBqtFJ,CuBvtFE,6DACE,kCAAA,CACA,oBvBqtFJ,CuBltFI,sFACE,wBApBG,CAqBH,mDAAA,CAAA,2CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBotFN,CuBxtFI,gFACE,wBApBG,CAqBH,2CAAA,CACA,qBAAA,CACA,iBvBotFN,CuBxtFI,oEACE,wBApBG,CAqBH,mDAAA,CAAA,2CAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBvBotFN,CyB32FA,MACE,wMzB82FF,CyBr2FE,sBACE,uCAAA,CACA,gBzBw2FJ,CyBr2FI,mCACE,azBu2FN,CyBx2FI,mCACE,czBu2FN,CyBn2FM,4BACE,sBzBq2FR,CyBl2FQ,mCACE,gCzBo2FV,CyBh2FQ,2DAEE,SAAA,CADA,uBAAA,CAEA,ezBk2FV,CyB91FQ,0EAEE,SAAA,CADA,uBzBi2FV,CyBl2FQ,uEAEE,SAAA,CADA,uBzBi2FV,CyBl2FQ,iEAEE,SAAA,CADA,uBzBi2FV,CyB51FQ,yCACE,YzB81FV,CyBv1FE,0BAEE,eAAA,CADA,ezB01FJ,CyBt1FI,+BACE,oBzBw1FN,CyBn1FE,gDACE,YzBq1FJ,CyBj1FE,8BAEE,+BAAA,CADA,oBAAA,CAGA,WAAA,CAGA,SAAA,CADA,4BAAA,CAEA,4DACE,CAJF,0BzBq1FJ,CyB50FI,aAdF,8BAeI,+BAAA,CAEA,SAAA,CADA,uBzBg1FJ,CACF,CyB50FI,wCACE,6BzB80FN,CyB10FI,oCACE,+BzB40FN,CyBx0FI,qCAIE,6BAAA,CAIA,UAAA,CAPA,oBAAA,CAEA,YAAA,CAEA,2CAAA,CAAA,mCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CALA,WzBg1FN,CyBp0FQ,mDACE,oBzBs0FV,C0Bn7FE,kCAEE,iB1By7FJ,C0B37FE,kCAEE,kB1By7FJ,C0B37FE,wBAGE,yCAAA,CAFA,oBAAA,CAGA,SAAA,CACA,mC1Bs7FJ,C0Bj7FI,aAVF,wBAWI,Y1Bo7FJ,CACF,C0Bh7FE,mFAEE,SAAA,CACA,2CACE,CADF,mC1Bk7FJ,C0Br7FE,gFAEE,SAAA,CACA,wCACE,CADF,mC1Bk7FJ,C0Br7FE,0EAEE,SAAA,CACA,mC1Bk7FJ,C0B56FE,mFAEE,+B1B86FJ,C0Bh7FE,gFAEE,+B1B86FJ,C0Bh7FE,0EAEE,+B1B86FJ,C0B16FE,oBACE,yBAAA,CACA,uBAAA,CAGA,yE1B06FJ,CK3yFI,sCqBrHE,qDACE,uB1Bm6FN,CACF,C0B95FE,0CACE,yB1Bg6FJ,C0Bj6FE,uCACE,yB1Bg6FJ,C0Bj6FE,iCACE,yB1Bg6FJ,C0B55FE,sBACE,0B1B85FJ,C2Bz9FE,2BACE,a3B49FJ,CKvyFI,wCsBtLF,2BAKI,e3B49FJ,CACF,C2Bz9FI,6BAEE,0BAAA,CAAA,2BAAA,CACA,eAAA,CACA,iBAAA,CAHA,yBAAA,CAAA,sBAAA,CAAA,iB3B89FN,C2Bx9FM,2CACE,kB3B09FR,C4B3+FE,kDACE,kCAAA,CAAA,0B5B8+FJ,C4B/+FE,+CACE,0B5B8+FJ,C4B/+FE,yCACE,kCAAA,CAAA,0B5B8+FJ,C4B1+FE,uBACE,4C5B4+FJ,C4Bx+FE,uBACE,4C5B0+FJ,C4Bt+FE,4BACE,qC5Bw+FJ,C4Br+FI,mCACE,a5Bu+FN,C4Bn+FI,kCACE,a5Bq+FN,C4Bh+FE,0BAKE,eAAA,CAJA,aAAA,CACA,YAAA,CAEA,aAAA,CADA,kBAAA,CAAA,mB5Bo+FJ,C4B/9FI,uCACE,e5Bi+FN,C4B79FI,sCACE,kB5B+9FN,C6B9gGA,MACE,8L7BihGF,C6BxgGE,oBACE,iBAAA,CAEA,gBAAA,CADA,a7B4gGJ,C6BxgGI,wCACE,uB7B0gGN,C6BtgGI,gCAEE,eAAA,CADA,gB7BygGN,C6BlgGM,wCACE,mB7BogGR,C6B9/FE,8BAGE,oB7BmgGJ,C6BtgGE,8BAGE,mB7BmgGJ,C6BtgGE,8BAIE,4B7BkgGJ,C6BtgGE,8BAIE,6B7BkgGJ,C6BtgGE,8BAKE,6B7BigGJ,C6BtgGE,8BAKE,4B7BigGJ,C6BtgGE,oBAME,cAAA,CALA,aAAA,CACA,e7BogGJ,C6B7/FI,kCACE,uCAAA,CACA,oB7B+/FN,C6B3/FI,wCAEE,uCAAA,CADA,Y7B8/FN,C6Bz/FI,oCAGE,W7BogGN,C6BvgGI,oCAGE,U7BogGN,C6BvgGI,0BAME,6BAAA,CAMA,UAAA,CAPA,WAAA,CAEA,yCAAA,CAAA,iCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CARA,iBAAA,CACA,UAAA,CAQA,sBAAA,CACA,yBAAA,CAPA,U7BmgGN,C6Bx/FM,oCACE,wB7B0/FR,C6Br/FI,4BACE,Y7Bu/FN,C6Bl/FI,4CACE,Y7Bo/FN,C8BtkGE,qDACE,mBAAA,CACA,cAAA,CACA,uB9BykGJ,C8B5kGE,kDACE,mBAAA,CACA,cAAA,CACA,uB9BykGJ,C8B5kGE,4CACE,mBAAA,CACA,cAAA,CACA,uB9BykGJ,C8BtkGI,yDAGE,iBAAA,CADA,eAAA,CADA,a9B0kGN,C8B3kGI,sDAGE,iBAAA,CADA,eAAA,CADA,a9B0kGN,C8B3kGI,gDAGE,iBAAA,CADA,eAAA,CADA,a9B0kGN,C+BhlGE,gCACE,sC/BmlGJ,C+BplGE,6BACE,sC/BmlGJ,C+BplGE,uBACE,sC/BmlGJ,C+BhlGE,cACE,yC/BklGJ,C+BtkGE,4DACE,oC/BwkGJ,C+BzkGE,yDACE,oC/BwkGJ,C+BzkGE,mDACE,oC/BwkGJ,C+BhkGE,6CACE,qC/BkkGJ,C+BnkGE,0CACE,qC/BkkGJ,C+BnkGE,oCACE,qC/BkkGJ,C+BxjGE,oDACE,oC/B0jGJ,C+B3jGE,iDACE,oC/B0jGJ,C+B3jGE,2CACE,oC/B0jGJ,C+BjjGE,gDACE,qC/BmjGJ,C+BpjGE,6CACE,qC/BmjGJ,C+BpjGE,uCACE,qC/BmjGJ,C+B9iGE,gCACE,kC/BgjGJ,C+BjjGE,6BACE,kC/BgjGJ,C+BjjGE,uBACE,kC/BgjGJ,C+B1iGE,qCACE,sC/B4iGJ,C+B7iGE,kCACE,sC/B4iGJ,C+B7iGE,4BACE,sC/B4iGJ,C+BriGE,yCACE,sC/BuiGJ,C+BxiGE,sCACE,sC/BuiGJ,C+BxiGE,gCACE,sC/BuiGJ,C+BhiGE,yCACE,qC/BkiGJ,C+BniGE,sCACE,qC/BkiGJ,C+BniGE,gCACE,qC/BkiGJ,C+BzhGE,gDACE,qC/B2hGJ,C+B5hGE,6CACE,qC/B2hGJ,C+B5hGE,uCACE,qC/B2hGJ,C+BnhGE,6CACE,sC/BqhGJ,C+BthGE,0CACE,sC/BqhGJ,C+BthGE,oCACE,sC/BqhGJ,C+B1gGE,yDACE,qC/B4gGJ,C+B7gGE,sDACE,qC/B4gGJ,C+B7gGE,gDACE,qC/B4gGJ,C+BvgGE,iCAGE,mBAAA,CAFA,gBAAA,CACA,gB/B0gGJ,C+B5gGE,8BAGE,mBAAA,CAFA,gBAAA,CACA,gB/B0gGJ,C+B5gGE,wBAGE,mBAAA,CAFA,gBAAA,CACA,gB/B0gGJ,C+BtgGE,eACE,4C/BwgGJ,C+BrgGE,eACE,4C/BugGJ,C+BngGE,gBAIE,wCAAA,CAHA,aAAA,CACA,wBAAA,CACA,wB/BsgGJ,C+BjgGE,yBAOE,wCAAA,CACA,+DAAA,CACA,4BAAA,CACA,6BAAA,CARA,aAAA,CAIA,eAAA,CADA,eAAA,CAFA,cAAA,CACA,oCAAA,CAHA,iB/B4gGJ,C+BhgGI,6BACE,Y/BkgGN,C+B//FM,kCACE,wBAAA,CACA,yB/BigGR,C+B3/FE,iCAWE,wCAAA,CACA,+DAAA,CAFA,uCAAA,CAGA,0BAAA,CAPA,UAAA,CAJA,oBAAA,CAMA,2BAAA,CADA,2BAAA,CAEA,2BAAA,CARA,uBAAA,CAAA,eAAA,CAaA,wBAAA,CAAA,qBAAA,CAAA,oBAAA,CAAA,gBAAA,CATA,S/BogGJ,C+Bl/FE,sBACE,iBAAA,CACA,iB/Bo/FJ,C+B5+FI,sCACE,gB/B8+FN,C+B1+FI,gDACE,Y/B4+FN,C+Bl+FA,gBACE,iB/Bq+FF,C+Bj+FE,uCACE,aAAA,CACA,S/Bm+FJ,C+Br+FE,oCACE,aAAA,CACA,S/Bm+FJ,C+Br+FE,8BACE,aAAA,CACA,S/Bm+FJ,C+B99FE,mBACE,Y/Bg+FJ,C+B39FE,oBACE,Q/B69FJ,C+Bz9FE,4BACE,WAAA,CACA,SAAA,CACA,e/B29FJ,C+Bt9FE,yBAIE,wCAAA,CAEA,+BAAA,CADA,4BAAA,CAFA,eAAA,CADA,oDAAA,CAKA,wBAAA,CAAA,qBAAA,CAAA,oBAAA,CAAA,gB/Bw9FJ,C+Bp9FE,2BAEE,+DAAA,CADA,2B/Bu9FJ,C+Bn9FI,+BACE,uCAAA,CACA,gB/Bq9FN,C+Bh9FE,sBACE,MAAA,CACA,W/Bk9FJ,C+B78FA,aACE,a/Bg9FF,C+Bv8FE,4BAEE,aAAA,CADA,Y/B28FJ,C+Bv8FI,iCAEE,2BAAA,CADA,wB/B08FN,C+Bp8FE,6DAKE,2CAAA,CAEA,+BAAA,CADA,gCAAA,CADA,sBAAA,CAJA,mBAAA,CAEA,gBAAA,CADA,a/B28FJ,C+B78FE,0DAKE,2CAAA,CAEA,+BAAA,CADA,gCAAA,CADA,sBAAA,CAJA,mBAAA,CAEA,gBAAA,CADA,a/B28FJ,C+B78FE,oDAKE,2CAAA,CAEA,+BAAA,CADA,gCAAA,CADA,sBAAA,CAJA,mBAAA,CAEA,gBAAA,CADA,a/B28FJ,C+Bn8FI,mEAEE,UAAA,CACA,UAAA,CAFA,a/Bu8FN,C+Bx8FI,gEAEE,UAAA,CACA,UAAA,CAFA,a/Bu8FN,C+Bx8FI,0DAEE,UAAA,CACA,UAAA,CAFA,a/Bu8FN,CKlkGI,wC0B0IF,8BACE,iB/B47FF,C+Bz7FE,mCACE,eAAA,CACA,e/B27FJ,C+Bv7FE,mCACE,e/By7FJ,C+Br7FE,sCAEE,mBAAA,CACA,eAAA,CADA,oBAAA,CADA,kBAAA,CAAA,mB/By7FJ,C+Bl7FA,mCAEE,eAAA,CADA,iB/Bs7FF,C+Bl7FE,wCACE,eAAA,CACA,e/Bo7FJ,CACF,CDhxGI,kDAIE,+BAAA,CACA,8BAAA,CAFA,aAAA,CADA,QAAA,CADA,iBCsxGN,CDvxGI,+CAIE,+BAAA,CACA,8BAAA,CAFA,aAAA,CADA,QAAA,CADA,iBCsxGN,CDvxGI,yCAIE,+BAAA,CACA,8BAAA,CAFA,aAAA,CADA,QAAA,CADA,iBCsxGN,CD9wGI,uBAEE,uCAAA,CADA,cCixGN,CD5tGM,kCAEE,WAlDkB,CAiDlB,kBC+tGR,CDhuGM,uCAEE,WAlDkB,CAiDlB,kBCmuGR,CDpuGM,wCAEE,WAlDkB,CAiDlB,kBCuuGR,CDxuGM,sCAEE,WAlDkB,CAiDlB,kBC2uGR,CD5uGM,2CAEE,WAlDkB,CAiDlB,kBC+uGR,CDhvGM,4CAEE,WAlDkB,CAiDlB,kBCmvGR,CDpvGM,sCAEE,WAlDkB,CAiDlB,kBCuvGR,CDxvGM,2CAEE,WAlDkB,CAiDlB,kBC2vGR,CD5vGM,4CAEE,WAlDkB,CAiDlB,kBC+vGR,CDhwGM,mCAEE,WAlDkB,CAiDlB,kBCmwGR,CDpwGM,wCAEE,WAlDkB,CAiDlB,kBCuwGR,CDxwGM,yCAEE,WAlDkB,CAiDlB,kBC2wGR,CD5wGM,qCAEE,WAlDkB,CAiDlB,kBC+wGR,CDhxGM,0CAEE,WAlDkB,CAiDlB,kBCmxGR,CDpxGM,2CAEE,WAlDkB,CAiDlB,kBCuxGR,CDxxGM,oCAEE,WAlDkB,CAiDlB,kBC2xGR,CD5xGM,yCAEE,WAlDkB,CAiDlB,kBC+xGR,CDhyGM,0CAEE,WAlDkB,CAiDlB,kBCmyGR,CDpyGM,oCAEE,WAlDkB,CAiDlB,kBCuyGR,CDxyGM,yCAEE,WAlDkB,CAiDlB,kBC2yGR,CD5yGM,0CAEE,WAlDkB,CAiDlB,kBC+yGR,CDhzGM,sCAEE,WAlDkB,CAiDlB,kBCmzGR,CDpzGM,2CAEE,WAlDkB,CAiDlB,kBCuzGR,CDxzGM,4CAEE,WAlDkB,CAiDlB,kBC2zGR,CD5zGM,yCAEE,WAlDkB,CAiDlB,kBC+zGR,CDh0GM,yCAEE,WAlDkB,CAiDlB,kBCm0GR,CDp0GM,0CAEE,WAlDkB,CAiDlB,kBCu0GR,CDx0GM,uCAEE,WAlDkB,CAiDlB,kBC20GR,CD50GM,wCAEE,WAlDkB,CAiDlB,kBC+0GR,CDh1GM,sCAEE,WAlDkB,CAiDlB,kBCm1GR,CDp1GM,wCAEE,WAlDkB,CAiDlB,kBCu1GR,CDx1GM,oCAEE,WAlDkB,CAiDlB,kBC21GR,CD51GM,2CAEE,WAlDkB,CAiDlB,kBC+1GR,CDh2GM,qCAEE,WAlDkB,CAiDlB,kBCm2GR,CDp2GM,oCAEE,WAlDkB,CAiDlB,kBCu2GR,CDx2GM,kCAEE,WAlDkB,CAiDlB,kBC22GR,CD52GM,qCAEE,WAlDkB,CAiDlB,kBC+2GR,CDh3GM,mCAEE,WAlDkB,CAiDlB,kBCm3GR,CDp3GM,qCAEE,WAlDkB,CAiDlB,kBCu3GR,CDx3GM,wCAEE,WAlDkB,CAiDlB,kBC23GR,CD53GM,sCAEE,WAlDkB,CAiDlB,kBC+3GR,CDh4GM,2CAEE,WAlDkB,CAiDlB,kBCm4GR,CDx3GM,iCAEE,WAPkB,CAMlB,iBC23GR,CD53GM,uCAEE,WAPkB,CAMlB,iBC+3GR,CDh4GM,mCAEE,WAPkB,CAMlB,iBCm4GR,CgCl9GE,wBAKE,mBAAA,CAHA,YAAA,CACA,qBAAA,CACA,YAAA,CAHA,iBhCy9GJ,CgC/8GI,8BAGE,QAAA,CACA,SAAA,CAHA,iBAAA,CACA,OhCm9GN,CgCn7GE,2BAME,uBAAA,CAFA,+DAAA,CAHA,YAAA,CACA,cAAA,CACA,aAAA,CAEA,gCAAA,CAAA,4BAAA,CAEA,oBhCq7GJ,CgCl7GI,aAVF,2BAWI,gBhCq7GJ,CACF,CgCl7GI,cAGE,+BACE,iBhCk7GN,CgC/6GM,sCAOE,oCAAA,CALA,QAAA,CAWA,UAAA,CATA,aAAA,CAEA,UAAA,CAHA,MAAA,CAFA,iBAAA,CAOA,2CAAA,CACA,qCACE,CAEF,kDAAA,CAPA,+BhCu7GR,CACF,CgC16GI,8CACE,YhC46GN,CgCx6GI,iCAQE,qCAAA,CAEA,6BAAA,CANA,uCAAA,CAOA,cAAA,CAVA,aAAA,CAKA,gBAAA,CADA,eAAA,CAFA,8BAAA,CAMA,uBAAA,CAGA,2CACE,CANF,kBAAA,CALA,UhCo7GN,CgCr6GM,aAII,6CACE,OhCo6GV,CgCr6GQ,8CACE,OhCu6GV,CgCx6GQ,8CACE,OhC06GV,CgC36GQ,8CACE,OhC66GV,CgC96GQ,8CACE,OhCg7GV,CgCj7GQ,8CACE,OhCm7GV,CgCp7GQ,8CACE,OhCs7GV,CgCv7GQ,8CACE,OhCy7GV,CgC17GQ,8CACE,OhC47GV,CgC77GQ,+CACE,QhC+7GV,CgCh8GQ,+CACE,QhCk8GV,CgCn8GQ,+CACE,QhCq8GV,CgCt8GQ,+CACE,QhCw8GV,CgCz8GQ,+CACE,QhC28GV,CgC58GQ,+CACE,QhC88GV,CgC/8GQ,+CACE,QhCi9GV,CgCl9GQ,+CACE,QhCo9GV,CgCr9GQ,+CACE,QhCu9GV,CgCx9GQ,+CACE,QhC09GV,CgC39GQ,+CACE,QhC69GV,CACF,CgCx9GM,uCACE,+BhC09GR,CgCp9GE,4BACE,UhCs9GJ,CgCn9GI,aAJF,4BAKI,gBhCs9GJ,CACF,CgCl9GE,0BACE,YhCo9GJ,CgCj9GI,aAJF,0BAKI,ahCo9GJ,CgCh9GM,sCACE,OhCk9GR,CgCn9GM,uCACE,OhCq9GR,CgCt9GM,uCACE,OhCw9GR,CgCz9GM,uCACE,OhC29GR,CgC59GM,uCACE,OhC89GR,CgC/9GM,uCACE,OhCi+GR,CgCl+GM,uCACE,OhCo+GR,CgCr+GM,uCACE,OhCu+GR,CgCx+GM,uCACE,OhC0+GR,CgC3+GM,wCACE,QhC6+GR,CgC9+GM,wCACE,QhCg/GR,CgCj/GM,wCACE,QhCm/GR,CgCp/GM,wCACE,QhCs/GR,CgCv/GM,wCACE,QhCy/GR,CgC1/GM,wCACE,QhC4/GR,CgC7/GM,wCACE,QhC+/GR,CgChgHM,wCACE,QhCkgHR,CgCngHM,wCACE,QhCqgHR,CgCtgHM,wCACE,QhCwgHR,CgCzgHM,wCACE,QhC2gHR,CACF,CgCrgHI,qJAGE,QhCugHN,CgCpgHM,kMACE,wBhCygHR,CgC1gHM,kMACE,yBhCygHR,CgC1gHM,kMAEE,yBhCwgHR,CgC1gHM,kMAEE,wBhCwgHR,CgCngHI,yEACE,wBhCsgHN,CgCvgHI,yEACE,yBhCsgHN,CgCvgHI,yEAEE,yBhCqgHN,CgCvgHI,yEAEE,wBhCqgHN,CgCjgHI,+CACE,YhCmgHN,CgC//GI,sCACE,QhCigHN,CK7/GI,wC2BSF,wDAGE,kBhCy/GF,CgC5/GA,wDAGE,mBhCy/GF,CgC5/GA,8CAEE,eAAA,CADA,eAAA,CAGA,iChCw/GF,CgCp/GE,8DACE,mBhCu/GJ,CgCx/GE,8DACE,kBhCu/GJ,CgCx/GE,oDAEE,UhCs/GJ,CACF,CgC1+GE,cAHF,olDAII,+BhC6+GF,CgC1+GE,g8GACE,sChC4+GJ,CACF,CgCv+GA,4sDACE,uDhC0+GF,CgCt+GA,wmDACE,ahCy+GF,CiCntHA,MACE,mVAAA,CAEA,4VjCutHF,CiC7sHE,4BAEE,oBAAA,CADA,iBjCitHJ,CiC5sHI,sDAGE,SjC8sHN,CiCjtHI,sDAGE,UjC8sHN,CiCjtHI,4CACE,iBAAA,CACA,SjC+sHN,CiCzsHE,+CAEE,SAAA,CADA,UjC4sHJ,CiCvsHE,kDAGE,WjCgtHJ,CiCntHE,kDAGE,YjCgtHJ,CiCntHE,wCAME,qDAAA,CAIA,UAAA,CALA,aAAA,CAEA,0CAAA,CAAA,kCAAA,CACA,6BAAA,CAAA,qBAAA,CACA,yBAAA,CAAA,iBAAA,CARA,iBAAA,CACA,SAAA,CAEA,YjC+sHJ,CiCrsHE,gEACE,wBT0Wa,CSzWb,mDAAA,CAAA,2CjCusHJ,CKllHI,mC6BhKA,8BAIE,kBlCuvHJ,CkC3vHE,8BAIE,iBlCuvHJ,CkC3vHE,oBACE,UAAA,CAIA,mBAAA,CAFA,YAAA,CADA,alCyvHJ,CkCnvHI,8BACE,WlCqvHN,CkCjvHI,kCAEE,iBAAA,CAAA,clCmvHN,CkCrvHI,kCAEE,aAAA,CAAA,kBlCmvHN,CkCrvHI,wBACE,WlCovHN,CkChvHM,kCACE,UlCkvHR,CACF","file":"main.css"} \ No newline at end of file diff --git a/assets/stylesheets/palette.e6a45f82.min.css b/assets/stylesheets/palette.e6a45f82.min.css new file mode 100644 index 00000000..9d16769c --- /dev/null +++ b/assets/stylesheets/palette.e6a45f82.min.css @@ -0,0 +1 @@ +[data-md-color-accent=red]{--md-accent-fg-color:#ff1947;--md-accent-fg-color--transparent:rgba(255,25,71,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=pink]{--md-accent-fg-color:#f50056;--md-accent-fg-color--transparent:rgba(245,0,86,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=purple]{--md-accent-fg-color:#df41fb;--md-accent-fg-color--transparent:rgba(223,65,251,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=deep-purple]{--md-accent-fg-color:#7c4dff;--md-accent-fg-color--transparent:rgba(124,77,255,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=indigo]{--md-accent-fg-color:#526cfe;--md-accent-fg-color--transparent:rgba(82,108,254,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=blue]{--md-accent-fg-color:#4287ff;--md-accent-fg-color--transparent:rgba(66,135,255,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=light-blue]{--md-accent-fg-color:#0091eb;--md-accent-fg-color--transparent:rgba(0,145,235,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=cyan]{--md-accent-fg-color:#00bad6;--md-accent-fg-color--transparent:rgba(0,186,214,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=teal]{--md-accent-fg-color:#00bda4;--md-accent-fg-color--transparent:rgba(0,189,164,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=green]{--md-accent-fg-color:#00c753;--md-accent-fg-color--transparent:rgba(0,199,83,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=light-green]{--md-accent-fg-color:#63de17;--md-accent-fg-color--transparent:rgba(99,222,23,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-accent=lime]{--md-accent-fg-color:#b0eb00;--md-accent-fg-color--transparent:rgba(176,235,0,.1);--md-accent-bg-color:rgba(0,0,0,.87);--md-accent-bg-color--light:rgba(0,0,0,.54)}[data-md-color-accent=yellow]{--md-accent-fg-color:#ffd500;--md-accent-fg-color--transparent:rgba(255,213,0,.1);--md-accent-bg-color:rgba(0,0,0,.87);--md-accent-bg-color--light:rgba(0,0,0,.54)}[data-md-color-accent=amber]{--md-accent-fg-color:#fa0;--md-accent-fg-color--transparent:rgba(255,170,0,.1);--md-accent-bg-color:rgba(0,0,0,.87);--md-accent-bg-color--light:rgba(0,0,0,.54)}[data-md-color-accent=orange]{--md-accent-fg-color:#ff9100;--md-accent-fg-color--transparent:rgba(255,145,0,.1);--md-accent-bg-color:rgba(0,0,0,.87);--md-accent-bg-color--light:rgba(0,0,0,.54)}[data-md-color-accent=deep-orange]{--md-accent-fg-color:#ff6e42;--md-accent-fg-color--transparent:rgba(255,110,66,.1);--md-accent-bg-color:#fff;--md-accent-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=red]{--md-primary-fg-color:#ef5552;--md-primary-fg-color--light:#e57171;--md-primary-fg-color--dark:#e53734;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=pink]{--md-primary-fg-color:#e92063;--md-primary-fg-color--light:#ec417a;--md-primary-fg-color--dark:#c3185d;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=purple]{--md-primary-fg-color:#ab47bd;--md-primary-fg-color--light:#bb69c9;--md-primary-fg-color--dark:#8c24a8;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=deep-purple]{--md-primary-fg-color:#7e56c2;--md-primary-fg-color--light:#9574cd;--md-primary-fg-color--dark:#673ab6;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=indigo]{--md-primary-fg-color:#4051b5;--md-primary-fg-color--light:#5d6cc0;--md-primary-fg-color--dark:#303fa1;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=blue]{--md-primary-fg-color:#2094f3;--md-primary-fg-color--light:#42a5f5;--md-primary-fg-color--dark:#1975d2;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=light-blue]{--md-primary-fg-color:#02a6f2;--md-primary-fg-color--light:#28b5f6;--md-primary-fg-color--dark:#0287cf;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=cyan]{--md-primary-fg-color:#00bdd6;--md-primary-fg-color--light:#25c5da;--md-primary-fg-color--dark:#0097a8;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=teal]{--md-primary-fg-color:#009485;--md-primary-fg-color--light:#26a699;--md-primary-fg-color--dark:#007a6c;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=green]{--md-primary-fg-color:#4cae4f;--md-primary-fg-color--light:#68bb6c;--md-primary-fg-color--dark:#398e3d;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=light-green]{--md-primary-fg-color:#8bc34b;--md-primary-fg-color--light:#9ccc66;--md-primary-fg-color--dark:#689f38;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=lime]{--md-primary-fg-color:#cbdc38;--md-primary-fg-color--light:#d3e156;--md-primary-fg-color--dark:#b0b52c;--md-primary-bg-color:rgba(0,0,0,.87);--md-primary-bg-color--light:rgba(0,0,0,.54)}[data-md-color-primary=yellow]{--md-primary-fg-color:#ffec3d;--md-primary-fg-color--light:#ffee57;--md-primary-fg-color--dark:#fbc02d;--md-primary-bg-color:rgba(0,0,0,.87);--md-primary-bg-color--light:rgba(0,0,0,.54)}[data-md-color-primary=amber]{--md-primary-fg-color:#ffc105;--md-primary-fg-color--light:#ffc929;--md-primary-fg-color--dark:#ffa200;--md-primary-bg-color:rgba(0,0,0,.87);--md-primary-bg-color--light:rgba(0,0,0,.54)}[data-md-color-primary=orange]{--md-primary-fg-color:#ffa724;--md-primary-fg-color--light:#ffa724;--md-primary-fg-color--dark:#fa8900;--md-primary-bg-color:rgba(0,0,0,.87);--md-primary-bg-color--light:rgba(0,0,0,.54)}[data-md-color-primary=deep-orange]{--md-primary-fg-color:#ff6e42;--md-primary-fg-color--light:#ff8a66;--md-primary-fg-color--dark:#f4511f;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=brown]{--md-primary-fg-color:#795649;--md-primary-fg-color--light:#8d6e62;--md-primary-fg-color--dark:#5d4037;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=grey]{--md-primary-fg-color:#757575;--md-primary-fg-color--light:#9e9e9e;--md-primary-fg-color--dark:#616161;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=blue-grey]{--md-primary-fg-color:#546d78;--md-primary-fg-color--light:#607c8a;--md-primary-fg-color--dark:#455a63;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7)}[data-md-color-primary=white]{--md-primary-fg-color:#fff;--md-primary-fg-color--light:hsla(0,0%,100%,.7);--md-primary-fg-color--dark:rgba(0,0,0,.07);--md-primary-bg-color:rgba(0,0,0,.87);--md-primary-bg-color--light:rgba(0,0,0,.54);--md-typeset-a-color:#4051b5}@media screen and (min-width:60em){[data-md-color-primary=white] .md-search__form{background-color:rgba(0,0,0,.07)}[data-md-color-primary=white] .md-search__form:hover{background-color:rgba(0,0,0,.32)}[data-md-color-primary=white] .md-search__input+.md-search__icon{color:rgba(0,0,0,.87)}}@media screen and (min-width:76.25em){[data-md-color-primary=white] .md-tabs{border-bottom:.05rem solid rgba(0,0,0,.07)}}[data-md-color-primary=black]{--md-primary-fg-color:#000;--md-primary-fg-color--light:rgba(0,0,0,.54);--md-primary-fg-color--dark:#000;--md-primary-bg-color:#fff;--md-primary-bg-color--light:hsla(0,0%,100%,.7);--md-typeset-a-color:#4051b5}[data-md-color-primary=black] .md-header{background-color:#000}@media screen and (max-width:59.9375em){[data-md-color-primary=black] .md-nav__source{background-color:rgba(0,0,0,.87)}}@media screen and (min-width:60em){[data-md-color-primary=black] .md-search__form{background-color:hsla(0,0%,100%,.12)}[data-md-color-primary=black] .md-search__form:hover{background-color:hsla(0,0%,100%,.3)}}@media screen and (max-width:76.1875em){html [data-md-color-primary=black] .md-nav--primary .md-nav__title[for=__drawer]{background-color:#000}}@media screen and (min-width:76.25em){[data-md-color-primary=black] .md-tabs{background-color:#000}}@media screen{[data-md-color-scheme=slate]{--md-hue:232;--md-default-fg-color:hsla(var(--md-hue),75%,95%,1);--md-default-fg-color--light:hsla(var(--md-hue),75%,90%,0.62);--md-default-fg-color--lighter:hsla(var(--md-hue),75%,90%,0.32);--md-default-fg-color--lightest:hsla(var(--md-hue),75%,90%,0.12);--md-default-bg-color:hsla(var(--md-hue),15%,21%,1);--md-default-bg-color--light:hsla(var(--md-hue),15%,21%,0.54);--md-default-bg-color--lighter:hsla(var(--md-hue),15%,21%,0.26);--md-default-bg-color--lightest:hsla(var(--md-hue),15%,21%,0.07);--md-code-fg-color:hsla(var(--md-hue),18%,86%,1);--md-code-bg-color:hsla(var(--md-hue),15%,15%,1);--md-code-hl-color:rgba(66,135,255,.15);--md-code-hl-number-color:#e6695b;--md-code-hl-special-color:#f06090;--md-code-hl-function-color:#c973d9;--md-code-hl-constant-color:#9383e2;--md-code-hl-keyword-color:#6791e0;--md-code-hl-string-color:#2fb170;--md-code-hl-name-color:var(--md-code-fg-color);--md-code-hl-operator-color:var(--md-default-fg-color--light);--md-code-hl-punctuation-color:var(--md-default-fg-color--light);--md-code-hl-comment-color:var(--md-default-fg-color--light);--md-code-hl-generic-color:var(--md-default-fg-color--light);--md-code-hl-variable-color:var(--md-default-fg-color--light);--md-typeset-color:var(--md-default-fg-color);--md-typeset-a-color:var(--md-primary-fg-color);--md-typeset-mark-color:rgba(66,135,255,.3);--md-typeset-kbd-color:hsla(var(--md-hue),15%,94%,0.12);--md-typeset-kbd-accent-color:hsla(var(--md-hue),15%,94%,0.2);--md-typeset-kbd-border-color:hsla(var(--md-hue),15%,14%,1);--md-typeset-table-color:hsla(var(--md-hue),75%,95%,0.12);--md-admonition-bg-color:hsla(var(--md-hue),0%,100%,0.025);--md-footer-bg-color:hsla(var(--md-hue),15%,12%,0.87);--md-footer-bg-color--dark:hsla(var(--md-hue),15%,10%,1)}[data-md-color-scheme=slate][data-md-color-primary=black],[data-md-color-scheme=slate][data-md-color-primary=white]{--md-typeset-a-color:#5d6cc0}[data-md-color-scheme=slate] img[src$="#only-light"]{display:none}[data-md-color-scheme=slate] img[src$="#only-dark"]{display:initial}} \ No newline at end of file diff --git a/assets/stylesheets/palette.e6a45f82.min.css.map b/assets/stylesheets/palette.e6a45f82.min.css.map new file mode 100644 index 00000000..b33c518d --- /dev/null +++ b/assets/stylesheets/palette.e6a45f82.min.css.map @@ -0,0 +1 @@ +{"version":3,"sources":["src/assets/stylesheets/palette/_accent.scss","../../../src/assets/stylesheets/palette.scss","src/assets/stylesheets/palette/_primary.scss","src/assets/stylesheets/utilities/_break.scss","src/assets/stylesheets/palette/_scheme.scss"],"names":[],"mappings":"AA8CE,2BACE,4BAAA,CACA,oDAAA,CAOE,yBAAA,CACA,8CCnDN,CDyCE,4BACE,4BAAA,CACA,mDAAA,CAOE,yBAAA,CACA,8CC5CN,CDkCE,8BACE,4BAAA,CACA,qDAAA,CAOE,yBAAA,CACA,8CCrCN,CD2BE,mCACE,4BAAA,CACA,qDAAA,CAOE,yBAAA,CACA,8CC9BN,CDoBE,8BACE,4BAAA,CACA,qDAAA,CAOE,yBAAA,CACA,8CCvBN,CDaE,4BACE,4BAAA,CACA,qDAAA,CAOE,yBAAA,CACA,8CChBN,CDME,kCACE,4BAAA,CACA,oDAAA,CAOE,yBAAA,CACA,8CCTN,CDDE,4BACE,4BAAA,CACA,oDAAA,CAOE,yBAAA,CACA,8CCFN,CDRE,4BACE,4BAAA,CACA,oDAAA,CAOE,yBAAA,CACA,8CCKN,CDfE,6BACE,4BAAA,CACA,mDAAA,CAOE,yBAAA,CACA,8CCYN,CDtBE,mCACE,4BAAA,CACA,oDAAA,CAOE,yBAAA,CACA,8CCmBN,CD7BE,4BACE,4BAAA,CACA,oDAAA,CAIE,oCAAA,CACA,2CC6BN,CDpCE,8BACE,4BAAA,CACA,oDAAA,CAIE,oCAAA,CACA,2CCoCN,CD3CE,6BACE,yBAAA,CACA,oDAAA,CAIE,oCAAA,CACA,2CC2CN,CDlDE,8BACE,4BAAA,CACA,oDAAA,CAIE,oCAAA,CACA,2CCkDN,CDzDE,mCACE,4BAAA,CACA,qDAAA,CAOE,yBAAA,CACA,8CCsDN,CC3DE,4BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwDN,CCnEE,6BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDgEN,CC3EE,+BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwEN,CCnFE,oCACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDgFN,CC3FE,+BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwFN,CCnGE,6BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDgGN,CC3GE,mCACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwGN,CCnHE,6BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDgHN,CC3HE,6BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwHN,CCnIE,8BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDgIN,CC3IE,oCACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwIN,CCnJE,6BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAIE,qCAAA,CACA,4CDmJN,CC3JE,+BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAIE,qCAAA,CACA,4CD2JN,CCnKE,8BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAIE,qCAAA,CACA,4CDmKN,CC3KE,+BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAIE,qCAAA,CACA,4CD2KN,CCnLE,oCACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDgLN,CC3LE,8BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwLN,CCnME,6BACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDgMN,CC3ME,kCACE,6BAAA,CACA,oCAAA,CACA,mCAAA,CAOE,0BAAA,CACA,+CDwMN,CC9LA,8BACE,0BAAA,CACA,+CAAA,CACA,2CAAA,CACA,qCAAA,CACA,4CAAA,CAGA,4BD+LF,CE9EI,mCD3GA,+CACE,gCD4LJ,CCzLI,qDACE,gCD2LN,CCtLE,iEACE,qBDwLJ,CACF,CEzFI,sCDxFA,uCACE,0CDoLJ,CACF,CC3KA,8BACE,0BAAA,CACA,4CAAA,CACA,gCAAA,CACA,0BAAA,CACA,+CAAA,CAGA,4BD4KF,CCzKE,yCACE,qBD2KJ,CEvFI,wCD7EA,8CACE,gCDuKJ,CACF,CE/GI,mCDjDA,+CACE,oCDmKJ,CChKI,qDACE,mCDkKN,CACF,CEpGI,wCDtDA,iFACE,qBD6JJ,CACF,CE5HI,sCD1BA,uCACE,qBDyJJ,CACF,CGvSA,cAGE,6BAKE,YAAA,CAGA,mDAAA,CACA,6DAAA,CACA,+DAAA,CACA,gEAAA,CACA,mDAAA,CACA,6DAAA,CACA,+DAAA,CACA,gEAAA,CAGA,gDAAA,CACA,gDAAA,CAGA,uCAAA,CACA,iCAAA,CACA,kCAAA,CACA,mCAAA,CACA,mCAAA,CACA,kCAAA,CACA,iCAAA,CACA,+CAAA,CACA,6DAAA,CACA,gEAAA,CACA,4DAAA,CACA,4DAAA,CACA,6DAAA,CAGA,6CAAA,CAGA,+CAAA,CAGA,2CAAA,CAGA,uDAAA,CACA,6DAAA,CACA,2DAAA,CAGA,yDAAA,CAGA,0DAAA,CAGA,qDAAA,CACA,wDHgRF,CG7QE,oHAIE,4BH4QJ,CGxQE,qDACE,YH0QJ,CGtQE,oDACE,eHwQJ,CACF","file":"palette.css"} \ No newline at end of file diff --git a/index.html b/index.html new file mode 100644 index 00000000..842ce26c --- /dev/null +++ b/index.html @@ -0,0 +1,2211 @@ + + + + + + + + + + + + + + + + CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + + + + +
    +
    + + + + + + + +

    前言

    +

    更新:本书最新网址 csdiy.wiki ,欢迎大家访问 ~

    +

    这是一本计算机的自学指南,也是对自己大学三年自学生涯的一个纪念。

    +

    这同时也是一份献给北大信科学弟学妹们的礼物。如果这本书能对你们的信科生涯有哪怕一丝一毫的帮助,都是对我极大的鼓励和慰藉。

    +

    本书目前规划了以下部分(如果你有其他好的建议,或者想加入贡献者的行列,欢迎邮件zhongyinmin@pku.edu.cn或者在issue里提问):

    +
      +
    • 必学工具:IDE, 翻墙, StackOverflow, Git, Github, Vim, Latex, Makefile, 实用工具 ...
    • +
    • 国外高质量CS课程汇总:我将把我上过的所有高质量的国外CS课程分门别类进行汇总,并给出相关的自学建议,大部分课程都会有一个独立的仓库维护相关的资源以及我的作业实现。
    • +
    • 环境配置:Linux基础,bash,环境变量,Anaconda ...
    • +
    • 经典书籍推荐:看过CSAPP这本书的同学一定感叹好书的重要,我将列举推荐自己看过的计算机领域的必看好书与资源链接。
    • +
    +

    梦开始的地方 —— CS61A

    +

    大一入学时我是一个对计算机一无所知的小白,装了几十个G的Visual Studio天天和OJ你死我活。凭着高中的数学底子我数学课学得还不错,但在专业课上对竞赛大佬只有仰望。提到编程我只会打开那笨重的IDE,新建一个我也不知道具体是干啥的命令行项目,然后就是cin,cout,for循环,然后CE,RE,WA循环。当时的我就处在一种拼命想学好但不知道怎么学,课上认真听讲但题还不会做,课后做作业完全是用时间和它硬耗的痛苦状态。我至今电脑里还存着自己大一上学期计算概论大作业的源代码 —— 一个1200行的C++文件,没有头文件、没有类、没有封装、没有unit test、没有makefile、没有git,唯一的优点是它确实能跑,缺点是“能跑”的补集。我一度怀疑我是不是不适合学计算机,因为童年对于极客的所有想象,已经被我第一个学期的体验彻底粉碎了。

    +

    这一切的转机发生在我大一的寒假,我心血来潮想学习Python。无意间看到知乎有人推荐了CS61A这门课,说是UC Berkeley的大一入门课程,讲的就是Python。我永远不会忘记那一天,打开CS61A课程网站的那个瞬间,就像哥伦布发现了新大陆一样,我开启了新世界的大门。

    +

    我一口气3个星期上完了这门课,它让我第一次感觉到原来CS可以学得如此充实而有趣,原来这世上竟有如此精华的课程。

    +

    为避免有崇洋媚外之嫌,我单纯从一个学生的视角来讲讲自学CS61A的体验:

    +
      +
    • +

      独立搭建的课程网站: 一个网站将所有课程资源整合一体,条理分明的课程schedule、所有slides,hw,discussion的文件链接、详细明确的课程给分说明、历年的考试题与答案。这样一个网站抛开美观程度不谈,既方便学生,也让资源公正透明。

      +
    • +
    • +

      课程教授亲自编写的教材:CS61A这门课的开课老师将MIT的经典教材Structure and Interpretation of Computer Programs(SICP)用Python这门语言进行改编(原教材基于Scheme语言),保证了课堂内容与教材内容的一致性,同时补充了更多细节,可以说诚意满满。而且全书开源,可以直接线上阅读。

      +
    • +
    • +

      丰富到让人眼花缭乱的课程作业:14个lab巩固随堂知识点,10个homework,还有4个代码量均上千行的project。与大家熟悉的OJ和word文档式的作业不同,所有作业均有完善的代码框架,保姆级的作业说明。每个Project都有详尽的handout文档、全自动的评分脚本。CS61A甚至专门开发了一个自动化的作业提交评分系统(据说还发了论文)。当然,有人会说“一个project几千行代码大部分都是助教帮你写好的,你还能学到啥?”。此言差矣,作为一个刚刚接触计算机,连安装Python都磕磕绊绊的小白来说,这样完善的代码框架既可以让你专注于巩固课堂上学习到的核心知识点,又能有“我才学了一个月就能做一个小游戏了!”的成就感,还能有机会阅读学习别人高质量的代码,从而为自己所用。我觉得在低年级,这种代码框架可以说百利而无一害。唯一的害也许是苦了老师和助教,因为开发这样的作业可想而知需要相当的时间投入。

      +
    • +
    • +

      每周Discussion讨论课,助教会讲解知识难点和考试例题:类似于北京大学ICS的小班研讨,但习题全部用Latex撰写,相当规范且会明确给出solution。

      +
    • +
    +

    这样的课程,你完全不需要任何计算机的基础,你只需要努力、认真、花时间就够了。此前那种有劲没处使的感觉,那种付出再多时间却得不到回报的感觉,从此烟消云散。这太适合我了,我从此爱上了自学。

    +

    试想如果有人能把艰深的知识点嚼碎嚼烂,用生动直白的方式呈现给你,还有那么多听起来就很fancy,种类繁多的project来巩固你的理论知识,你会觉得他们真的是在倾尽全力想方设法地让你完全掌握这门课,你会觉得不学好它简直是对这些课程建设者的侮辱。

    +

    如果你觉得我在夸大其词,那么不妨从CS61A开始,因为它是我的梦开始的地方。

    +

    为什么写这本书

    +

    在我2020年秋季学期担任《深入理解计算机系统》(CSAPP)这门课的助教时,我已经自学一年多了。这一年多来我无比享受这种自学模式,为了分享这种快乐,我为自己的小班同学做过一个CS自学资料整理仓库。当时纯粹是心血来潮,因为我也不敢公然鼓励大家翘课自学。

    +

    但随着又一年时间的维护,这个仓库的内容已经相当丰富,基本覆盖了计科、智能系、软工系的绝大多数课程,我也为每个课程都建了各自的Github仓库,汇总我用到的自学资料以及作业实现。

    +

    直到大四开始凑学分毕业的时候,我打开自己的培养方案,我发现它已经是我这个自学仓库的子集了,而这距离我开始自学也才两年半而已。于是,一个大胆的想法在我脑海中浮现:也许,我可以打造一个自学式的培养方案,把我这三年自学经历中遇到的坑、走过的路记录下来,以期能为后来的学弟学妹们贡献自己的一份微薄之力。

    +

    如果大家可以在三年不到的时间里就能建立起整座CS的基础大厦,能有相对扎实的数学功底和代码能力,经历过数十个千行代码量的Project的洗礼,掌握至少C/C++/Java/JS/Python/Go/Rust等主流语言,对算法、电路、体系、网络、操统、编译、人工智能、机器学习、计算机视觉、自然语言处理、强化学习、密码学、信息论、博弈论、数值分析、统计学、分布式、数据库、图形学、Web开发、云服务、超算等等方面均有涉猎。我想,你将有足够的底气和自信选择自己感兴趣的方向,无论是就业还是科研,你都将有相当的竞争力。

    +

    因为我坚信,既然你能坚持听我BB到这里,你一定不缺学好CS的能力,你只是没有一个好的老师,给你讲一门好的课程。而我,将力图根据我三年的体验,为你挑选这样的课程。

    +

    自学的好处

    +

    对我来说,自学最大的好处就在于可以完全根据自己的进度来调整学习速度。对于一些疑难知识点,我可以反复回看视频,在网上谷歌相关的内容,上StackOverflow提问题,直到完全将它弄明白。而对于自己掌握得相对较快的内容,则可以两倍速甚至三倍速略过。

    +

    自学的另一大好处就是博采众长。计算机系的几大核心课程:体系、网络、操统、编译,每一门我基本都上过不同大学的课程,不同的教材、不同的知识点侧重、不同的project将会极大丰富你的视野,也会让你理解错误的一些内容得到及时纠正。

    +

    自学的第三个好处是时间自由,具体原因省略。

    +

    自学的坏处

    +

    当然,作为CS自学主义的忠实拥趸者,我不得不承认自学也有它的坏处。

    +

    第一就是交流沟通的不便。我其实是一个很热衷于提问的人,对于所有没有弄明白的点,我都喜欢穷追到底。但当你面对着屏幕听到老师讲了一个你没明白的知识点的时候,你无法顺着网线到另一端向老师问个明白。我努力通过独立思考和善用Google来缓解这一点,但是,如果能有几个志同道合的伙伴结伴自学,那将是极好的。关于交流群的建立,大家可以参考仓库README中的教程。

    +

    第二就是这些自学的课程基本都是英文的。从视频到slides到作业全是英文,所以有一定的门槛。不过我觉得这个挑战如果你克服了的话对你是极为有利的。因为在当下,虽然我很不情愿,但也不得不承认,在计算机领域,很多优质的文档、论坛、网站都是全英文的。养成英文阅读的习惯,在赤旗插遍世界之前,还是有一定好处的(狗头保命)。

    +

    第三,也是我觉得最困难的一点,就是自律。因为没有DDL有时候真的是一件可怕的事情,特别是随着学习的深入,国外的很多课程是相当虐的。你得有足够的驱动力强迫自己静下心来,阅读几十页的Project Handout,理解上千行的代码框架,忍受数个小时的debug时光。而这一切,没有学分,没有绩点,没有老师,没有同学,只有一个信念 —— 你在变强。

    +

    这本书适合谁

    +

    正如我在前言里说的,任何有志于自学计算机的朋友都可以参考这本书。如果你已经有了一定的计算机基础,只是对某个特定的领域感兴趣,可以选择性地挑选你感兴趣的内容进行学习。当然,如果你是一个像我当年一样对计算机一无所知的小白,初入大学的校门,我希望这本书能成为你的攻略,让你花最少的时间掌握你所需要的知识和能力。某种程度上,这本书更像是一个根据我的体验来排序的课程搜索引擎,帮助大家足不出户,体验世界顶级名校的计算机优质课程。

    +

    当然,作为一个还未毕业的本科生,我深感自己没有能力也没有权利去宣扬一种学习方式,我只是希望这份资料能让那些同样有自学之心和毅力朋友可以少走些弯路,收获更丰富、更多样、更满足的学习体验。

    +

    特别鸣谢

    +

    在这里,我怀着崇敬之心真诚地感谢所有将课程资源无偿开源的各位教授们。这些课程倾注了他们数十年教学生涯的积淀和心血,他们却选择无私地让所有人享受到如此高质量的CS教育。没有他们,我的大学生活不会这样充实而快乐。很多教授在我给他们发了感谢邮件之后,甚至会回复上百字的长文,真的让我无比感动。他们也时刻激励着我,做一件事,就得用心做好,无论是科研,还是为人。

    +

    你也想加入到贡献者的行列

    +

    一个人的力量终究是有限的,这本书也是我在繁重的科研之余熬夜抽空写出来的,难免有不够完善之处。另外,由于个人做的是系统方向,很多课程侧重系统领域,对于数学、理论计算机、高级算法相关的内容则相对少些。如果有大佬想在其他领域分享自己的自学经历与资源,可以直接在项目中发起Pull Request,也欢迎和我邮件联系(zhongyinmin@pku.edu.cn)。

    +

    关于交流群的建立

    +

    方法参见仓库的README.

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/search/search_index.json b/search/search_index.json new file mode 100644 index 00000000..1e7177f2 --- /dev/null +++ b/search/search_index.json @@ -0,0 +1 @@ +{"config":{"indexing":"full","lang":["en"],"min_search_length":3,"prebuild_index":false,"separator":"[\\s\\-]+"},"docs":[{"location":"","text":"\u524d\u8a00 \u66f4\u65b0\uff1a\u672c\u4e66\u6700\u65b0\u7f51\u5740 csdiy.wiki \uff0c\u6b22\u8fce\u5927\u5bb6\u8bbf\u95ee \uff5e \u8fd9\u662f\u4e00\u672c\u8ba1\u7b97\u673a\u7684\u81ea\u5b66\u6307\u5357\uff0c\u4e5f\u662f\u5bf9\u81ea\u5df1\u5927\u5b66\u4e09\u5e74\u81ea\u5b66\u751f\u6daf\u7684\u4e00\u4e2a\u7eaa\u5ff5\u3002 \u8fd9\u540c\u65f6\u4e5f\u662f\u4e00\u4efd\u732e\u7ed9\u5317\u5927\u4fe1\u79d1\u5b66\u5f1f\u5b66\u59b9\u4eec\u7684\u793c\u7269\u3002\u5982\u679c\u8fd9\u672c\u4e66\u80fd\u5bf9\u4f60\u4eec\u7684\u4fe1\u79d1\u751f\u6daf\u6709\u54ea\u6015\u4e00\u4e1d\u4e00\u6beb\u7684\u5e2e\u52a9\uff0c\u90fd\u662f\u5bf9\u6211\u6781\u5927\u7684\u9f13\u52b1\u548c\u6170\u85c9\u3002 \u672c\u4e66\u76ee\u524d\u89c4\u5212\u4e86\u4ee5\u4e0b\u90e8\u5206(\u5982\u679c\u4f60\u6709\u5176\u4ed6\u597d\u7684\u5efa\u8bae\uff0c\u6216\u8005\u60f3\u52a0\u5165\u8d21\u732e\u8005\u7684\u884c\u5217\uff0c\u6b22\u8fce\u90ae\u4ef6zhongyinmin@pku.edu.cn\u6216\u8005\u5728issue\u91cc\u63d0\u95ee)\uff1a \u5fc5\u5b66\u5de5\u5177\uff1aIDE, \u7ffb\u5899, StackOverflow, Git, Github, Vim, Latex, Makefile, \u5b9e\u7528\u5de5\u5177 ... \u56fd\u5916\u9ad8\u8d28\u91cfCS\u8bfe\u7a0b\u6c47\u603b \uff1a\u6211\u5c06\u628a\u6211\u4e0a\u8fc7\u7684\u6240\u6709\u9ad8\u8d28\u91cf\u7684\u56fd\u5916CS\u8bfe\u7a0b\u5206\u95e8\u522b\u7c7b\u8fdb\u884c\u6c47\u603b\uff0c\u5e76\u7ed9\u51fa\u76f8\u5173\u7684\u81ea\u5b66\u5efa\u8bae\uff0c\u5927\u90e8\u5206\u8bfe\u7a0b\u90fd\u4f1a\u6709\u4e00\u4e2a\u72ec\u7acb\u7684\u4ed3\u5e93\u7ef4\u62a4\u76f8\u5173\u7684\u8d44\u6e90\u4ee5\u53ca\u6211\u7684\u4f5c\u4e1a\u5b9e\u73b0\u3002 \u73af\u5883\u914d\u7f6e\uff1aLinux\u57fa\u7840\uff0cbash\uff0c\u73af\u5883\u53d8\u91cf\uff0cAnaconda ... \u7ecf\u5178\u4e66\u7c4d\u63a8\u8350\uff1a\u770b\u8fc7CSAPP\u8fd9\u672c\u4e66\u7684\u540c\u5b66\u4e00\u5b9a\u611f\u53f9\u597d\u4e66\u7684\u91cd\u8981\uff0c\u6211\u5c06\u5217\u4e3e\u63a8\u8350\u81ea\u5df1\u770b\u8fc7\u7684\u8ba1\u7b97\u673a\u9886\u57df\u7684\u5fc5\u770b\u597d\u4e66\u4e0e\u8d44\u6e90\u94fe\u63a5\u3002 \u68a6\u5f00\u59cb\u7684\u5730\u65b9 \u2014\u2014 CS61A \u5927\u4e00\u5165\u5b66\u65f6\u6211\u662f\u4e00\u4e2a\u5bf9\u8ba1\u7b97\u673a\u4e00\u65e0\u6240\u77e5\u7684\u5c0f\u767d\uff0c\u88c5\u4e86\u51e0\u5341\u4e2aG\u7684Visual Studio\u5929\u5929\u548cOJ\u4f60\u6b7b\u6211\u6d3b\u3002\u51ed\u7740\u9ad8\u4e2d\u7684\u6570\u5b66\u5e95\u5b50\u6211\u6570\u5b66\u8bfe\u5b66\u5f97\u8fd8\u4e0d\u9519\uff0c\u4f46\u5728\u4e13\u4e1a\u8bfe\u4e0a\u5bf9\u7ade\u8d5b\u5927\u4f6c\u53ea\u6709\u4ef0\u671b\u3002\u63d0\u5230\u7f16\u7a0b\u6211\u53ea\u4f1a\u6253\u5f00\u90a3\u7b28\u91cd\u7684IDE\uff0c\u65b0\u5efa\u4e00\u4e2a\u6211\u4e5f\u4e0d\u77e5\u9053\u5177\u4f53\u662f\u5e72\u5565\u7684\u547d\u4ee4\u884c\u9879\u76ee\uff0c\u7136\u540e\u5c31\u662fcin\uff0ccout\uff0cfor\u5faa\u73af\uff0c\u7136\u540eCE\uff0cRE\uff0cWA\u5faa\u73af\u3002\u5f53\u65f6\u7684\u6211\u5c31\u5904\u5728\u4e00\u79cd\u62fc\u547d\u60f3\u5b66\u597d\u4f46\u4e0d\u77e5\u9053\u600e\u4e48\u5b66\uff0c\u8bfe\u4e0a\u8ba4\u771f\u542c\u8bb2\u4f46\u9898\u8fd8\u4e0d\u4f1a\u505a\uff0c\u8bfe\u540e\u505a\u4f5c\u4e1a\u5b8c\u5168\u662f\u7528\u65f6\u95f4\u548c\u5b83\u786c\u8017\u7684\u75db\u82e6\u72b6\u6001\u3002\u6211\u81f3\u4eca\u7535\u8111\u91cc\u8fd8\u5b58\u7740\u81ea\u5df1\u5927\u4e00\u4e0a\u5b66\u671f\u8ba1\u7b97\u6982\u8bba\u5927\u4f5c\u4e1a\u7684\u6e90\u4ee3\u7801 \u2014\u2014 \u4e00\u4e2a1200\u884c\u7684C++\u6587\u4ef6\uff0c\u6ca1\u6709\u5934\u6587\u4ef6\u3001\u6ca1\u6709\u7c7b\u3001\u6ca1\u6709\u5c01\u88c5\u3001\u6ca1\u6709unit test\u3001\u6ca1\u6709makefile\u3001\u6ca1\u6709git\uff0c\u552f\u4e00\u7684\u4f18\u70b9\u662f\u5b83\u786e\u5b9e\u80fd\u8dd1\uff0c\u7f3a\u70b9\u662f\u201c\u80fd\u8dd1\u201d\u7684\u8865\u96c6\u3002\u6211\u4e00\u5ea6\u6000\u7591\u6211\u662f\u4e0d\u662f\u4e0d\u9002\u5408\u5b66\u8ba1\u7b97\u673a\uff0c\u56e0\u4e3a\u7ae5\u5e74\u5bf9\u4e8e\u6781\u5ba2\u7684\u6240\u6709\u60f3\u8c61\uff0c\u5df2\u7ecf\u88ab\u6211\u7b2c\u4e00\u4e2a\u5b66\u671f\u7684\u4f53\u9a8c\u5f7b\u5e95\u7c89\u788e\u4e86\u3002 \u8fd9\u4e00\u5207\u7684\u8f6c\u673a\u53d1\u751f\u5728\u6211\u5927\u4e00\u7684\u5bd2\u5047\uff0c\u6211\u5fc3\u8840\u6765\u6f6e\u60f3\u5b66\u4e60Python\u3002\u65e0\u610f\u95f4\u770b\u5230\u77e5\u4e4e\u6709\u4eba\u63a8\u8350\u4e86CS61A\u8fd9\u95e8\u8bfe\uff0c\u8bf4\u662fUC Berkeley\u7684\u5927\u4e00\u5165\u95e8\u8bfe\u7a0b\uff0c\u8bb2\u7684\u5c31\u662fPython\u3002\u6211\u6c38\u8fdc\u4e0d\u4f1a\u5fd8\u8bb0\u90a3\u4e00\u5929\uff0c\u6253\u5f00 CS61A \u8bfe\u7a0b\u7f51\u7ad9\u7684\u90a3\u4e2a\u77ac\u95f4\uff0c\u5c31\u50cf\u54e5\u4f26\u5e03\u53d1\u73b0\u4e86\u65b0\u5927\u9646\u4e00\u6837\uff0c\u6211\u5f00\u542f\u4e86\u65b0\u4e16\u754c\u7684\u5927\u95e8\u3002 \u6211\u4e00\u53e3\u6c143\u4e2a\u661f\u671f\u4e0a\u5b8c\u4e86\u8fd9\u95e8\u8bfe\uff0c\u5b83\u8ba9\u6211\u7b2c\u4e00\u6b21\u611f\u89c9\u5230\u539f\u6765CS\u53ef\u4ee5\u5b66\u5f97\u5982\u6b64\u5145\u5b9e\u800c\u6709\u8da3\uff0c\u539f\u6765\u8fd9\u4e16\u4e0a\u7adf\u6709\u5982\u6b64\u7cbe\u534e\u7684\u8bfe\u7a0b\u3002 \u4e3a\u907f\u514d\u6709\u5d07\u6d0b\u5a9a\u5916\u4e4b\u5acc\uff0c\u6211\u5355\u7eaf\u4ece\u4e00\u4e2a\u5b66\u751f\u7684\u89c6\u89d2\u6765\u8bb2\u8bb2\u81ea\u5b66CS61A\u7684\u4f53\u9a8c\uff1a \u72ec\u7acb\u642d\u5efa\u7684\u8bfe\u7a0b\u7f51\u7ad9: \u4e00\u4e2a\u7f51\u7ad9\u5c06\u6240\u6709\u8bfe\u7a0b\u8d44\u6e90\u6574\u5408\u4e00\u4f53\uff0c\u6761\u7406\u5206\u660e\u7684\u8bfe\u7a0bschedule\u3001\u6240\u6709slides\uff0chw\uff0cdiscussion\u7684\u6587\u4ef6\u94fe\u63a5\u3001\u8be6\u7ec6\u660e\u786e\u7684\u8bfe\u7a0b\u7ed9\u5206\u8bf4\u660e\u3001\u5386\u5e74\u7684\u8003\u8bd5\u9898\u4e0e\u7b54\u6848\u3002\u8fd9\u6837\u4e00\u4e2a\u7f51\u7ad9\u629b\u5f00\u7f8e\u89c2\u7a0b\u5ea6\u4e0d\u8c08\uff0c\u65e2\u65b9\u4fbf\u5b66\u751f\uff0c\u4e5f\u8ba9\u8d44\u6e90\u516c\u6b63\u900f\u660e\u3002 \u8bfe\u7a0b\u6559\u6388\u4eb2\u81ea\u7f16\u5199\u7684\u6559\u6750\uff1aCS61A\u8fd9\u95e8\u8bfe\u7684\u5f00\u8bfe\u8001\u5e08\u5c06MIT\u7684\u7ecf\u5178\u6559\u6750 Structure and Interpretation of Computer Programs (SICP)\u7528Python\u8fd9\u95e8\u8bed\u8a00\u8fdb\u884c\u6539\u7f16\uff08\u539f\u6559\u6750\u57fa\u4e8eScheme\u8bed\u8a00\uff09\uff0c\u4fdd\u8bc1\u4e86\u8bfe\u5802\u5185\u5bb9\u4e0e\u6559\u6750\u5185\u5bb9\u7684\u4e00\u81f4\u6027\uff0c\u540c\u65f6\u8865\u5145\u4e86\u66f4\u591a\u7ec6\u8282\uff0c\u53ef\u4ee5\u8bf4\u8bda\u610f\u6ee1\u6ee1\u3002\u800c\u4e14\u5168\u4e66\u5f00\u6e90\uff0c\u53ef\u4ee5\u76f4\u63a5\u7ebf\u4e0a\u9605\u8bfb\u3002 \u4e30\u5bcc\u5230\u8ba9\u4eba\u773c\u82b1\u7f2d\u4e71\u7684\u8bfe\u7a0b\u4f5c\u4e1a\uff1a14\u4e2alab\u5de9\u56fa\u968f\u5802\u77e5\u8bc6\u70b9\uff0c10\u4e2ahomework\uff0c\u8fd8\u67094\u4e2a\u4ee3\u7801\u91cf\u5747\u4e0a\u5343\u884c\u7684project\u3002\u4e0e\u5927\u5bb6\u719f\u6089\u7684OJ\u548cword\u6587\u6863\u5f0f\u7684\u4f5c\u4e1a\u4e0d\u540c\uff0c\u6240\u6709\u4f5c\u4e1a\u5747\u6709\u5b8c\u5584\u7684\u4ee3\u7801\u6846\u67b6\uff0c\u4fdd\u59c6\u7ea7\u7684\u4f5c\u4e1a\u8bf4\u660e\u3002\u6bcf\u4e2aProject\u90fd\u6709\u8be6\u5c3d\u7684handout\u6587\u6863\u3001\u5168\u81ea\u52a8\u7684\u8bc4\u5206\u811a\u672c\u3002CS61A\u751a\u81f3\u4e13\u95e8\u5f00\u53d1\u4e86\u4e00\u4e2a \u81ea\u52a8\u5316\u7684\u4f5c\u4e1a\u63d0\u4ea4\u8bc4\u5206\u7cfb\u7edf \uff08\u636e\u8bf4\u8fd8\u53d1\u4e86\u8bba\u6587\uff09\u3002\u5f53\u7136\uff0c\u6709\u4eba\u4f1a\u8bf4\u201c\u4e00\u4e2aproject\u51e0\u5343\u884c\u4ee3\u7801\u5927\u90e8\u5206\u90fd\u662f\u52a9\u6559\u5e2e\u4f60\u5199\u597d\u7684\uff0c\u4f60\u8fd8\u80fd\u5b66\u5230\u5565\uff1f\u201d\u3002\u6b64\u8a00\u5dee\u77e3\uff0c\u4f5c\u4e3a\u4e00\u4e2a\u521a\u521a\u63a5\u89e6\u8ba1\u7b97\u673a\uff0c\u8fde\u5b89\u88c5Python\u90fd\u78d5\u78d5\u7eca\u7eca\u7684\u5c0f\u767d\u6765\u8bf4\uff0c\u8fd9\u6837\u5b8c\u5584\u7684\u4ee3\u7801\u6846\u67b6\u65e2\u53ef\u4ee5\u8ba9\u4f60\u4e13\u6ce8\u4e8e\u5de9\u56fa\u8bfe\u5802\u4e0a\u5b66\u4e60\u5230\u7684\u6838\u5fc3\u77e5\u8bc6\u70b9\uff0c\u53c8\u80fd\u6709\u201c\u6211\u624d\u5b66\u4e86\u4e00\u4e2a\u6708\u5c31\u80fd\u505a\u4e00\u4e2a\u5c0f\u6e38\u620f\u4e86\uff01\u201d\u7684\u6210\u5c31\u611f\uff0c\u8fd8\u80fd\u6709\u673a\u4f1a\u9605\u8bfb\u5b66\u4e60\u522b\u4eba\u9ad8\u8d28\u91cf\u7684\u4ee3\u7801\uff0c\u4ece\u800c\u4e3a\u81ea\u5df1\u6240\u7528\u3002\u6211\u89c9\u5f97\u5728\u4f4e\u5e74\u7ea7\uff0c\u8fd9\u79cd\u4ee3\u7801\u6846\u67b6\u53ef\u4ee5\u8bf4\u767e\u5229\u800c\u65e0\u4e00\u5bb3\u3002\u552f\u4e00\u7684\u5bb3\u4e5f\u8bb8\u662f\u82e6\u4e86\u8001\u5e08\u548c\u52a9\u6559\uff0c\u56e0\u4e3a\u5f00\u53d1\u8fd9\u6837\u7684\u4f5c\u4e1a\u53ef\u60f3\u800c\u77e5\u9700\u8981\u76f8\u5f53\u7684\u65f6\u95f4\u6295\u5165\u3002 \u6bcf\u5468Discussion\u8ba8\u8bba\u8bfe\uff0c\u52a9\u6559\u4f1a\u8bb2\u89e3\u77e5\u8bc6\u96be\u70b9\u548c\u8003\u8bd5\u4f8b\u9898\uff1a\u7c7b\u4f3c\u4e8e\u5317\u4eac\u5927\u5b66ICS\u7684\u5c0f\u73ed\u7814\u8ba8\uff0c\u4f46\u4e60\u9898\u5168\u90e8\u7528Latex\u64b0\u5199\uff0c\u76f8\u5f53\u89c4\u8303\u4e14\u4f1a\u660e\u786e\u7ed9\u51fasolution\u3002 \u8fd9\u6837\u7684\u8bfe\u7a0b\uff0c\u4f60\u5b8c\u5168\u4e0d\u9700\u8981\u4efb\u4f55\u8ba1\u7b97\u673a\u7684\u57fa\u7840\uff0c\u4f60\u53ea\u9700\u8981\u52aa\u529b\u3001\u8ba4\u771f\u3001\u82b1\u65f6\u95f4\u5c31\u591f\u4e86\u3002\u6b64\u524d\u90a3\u79cd\u6709\u52b2\u6ca1\u5904\u4f7f\u7684\u611f\u89c9\uff0c\u90a3\u79cd\u4ed8\u51fa\u518d\u591a\u65f6\u95f4\u5374\u5f97\u4e0d\u5230\u56de\u62a5\u7684\u611f\u89c9\uff0c\u4ece\u6b64\u70df\u6d88\u4e91\u6563\u3002\u8fd9\u592a\u9002\u5408\u6211\u4e86\uff0c\u6211\u4ece\u6b64\u7231\u4e0a\u4e86\u81ea\u5b66\u3002 \u8bd5\u60f3\u5982\u679c\u6709\u4eba\u80fd\u628a\u8270\u6df1\u7684\u77e5\u8bc6\u70b9\u56bc\u788e\u56bc\u70c2\uff0c\u7528\u751f\u52a8\u76f4\u767d\u7684\u65b9\u5f0f\u5448\u73b0\u7ed9\u4f60\uff0c\u8fd8\u6709\u90a3\u4e48\u591a\u542c\u8d77\u6765\u5c31\u5f88fancy\uff0c\u79cd\u7c7b\u7e41\u591a\u7684project\u6765\u5de9\u56fa\u4f60\u7684\u7406\u8bba\u77e5\u8bc6\uff0c\u4f60\u4f1a\u89c9\u5f97\u4ed6\u4eec\u771f\u7684\u662f\u5728\u503e\u5c3d\u5168\u529b\u60f3\u65b9\u8bbe\u6cd5\u5730\u8ba9\u4f60\u5b8c\u5168\u638c\u63e1\u8fd9\u95e8\u8bfe\uff0c\u4f60\u4f1a\u89c9\u5f97\u4e0d\u5b66\u597d\u5b83\u7b80\u76f4\u662f\u5bf9\u8fd9\u4e9b\u8bfe\u7a0b\u5efa\u8bbe\u8005\u7684\u4fae\u8fb1\u3002 \u5982\u679c\u4f60\u89c9\u5f97\u6211\u5728\u5938\u5927\u5176\u8bcd\uff0c\u90a3\u4e48\u4e0d\u59a8\u4ece CS61A \u5f00\u59cb\uff0c\u56e0\u4e3a\u5b83\u662f\u6211\u7684\u68a6\u5f00\u59cb\u7684\u5730\u65b9\u3002 \u4e3a\u4ec0\u4e48\u5199\u8fd9\u672c\u4e66 \u5728\u62112020\u5e74\u79cb\u5b63\u5b66\u671f\u62c5\u4efb\u300a\u6df1\u5165\u7406\u89e3\u8ba1\u7b97\u673a\u7cfb\u7edf\u300b\uff08CSAPP\uff09\u8fd9\u95e8\u8bfe\u7684\u52a9\u6559\u65f6\uff0c\u6211\u5df2\u7ecf\u81ea\u5b66\u4e00\u5e74\u591a\u4e86\u3002\u8fd9\u4e00\u5e74\u591a\u6765\u6211\u65e0\u6bd4\u4eab\u53d7\u8fd9\u79cd\u81ea\u5b66\u6a21\u5f0f\uff0c\u4e3a\u4e86\u5206\u4eab\u8fd9\u79cd\u5feb\u4e50\uff0c\u6211\u4e3a\u81ea\u5df1\u7684\u5c0f\u73ed\u540c\u5b66\u505a\u8fc7\u4e00\u4e2a CS\u81ea\u5b66\u8d44\u6599\u6574\u7406\u4ed3\u5e93 \u3002\u5f53\u65f6\u7eaf\u7cb9\u662f\u5fc3\u8840\u6765\u6f6e\uff0c\u56e0\u4e3a\u6211\u4e5f\u4e0d\u6562\u516c\u7136\u9f13\u52b1\u5927\u5bb6\u7fd8\u8bfe\u81ea\u5b66\u3002 \u4f46\u968f\u7740\u53c8\u4e00\u5e74\u65f6\u95f4\u7684\u7ef4\u62a4\uff0c\u8fd9\u4e2a\u4ed3\u5e93\u7684\u5185\u5bb9\u5df2\u7ecf\u76f8\u5f53\u4e30\u5bcc\uff0c\u57fa\u672c\u8986\u76d6\u4e86\u8ba1\u79d1\u3001\u667a\u80fd\u7cfb\u3001\u8f6f\u5de5\u7cfb\u7684\u7edd\u5927\u591a\u6570\u8bfe\u7a0b\uff0c\u6211\u4e5f\u4e3a\u6bcf\u4e2a\u8bfe\u7a0b\u90fd\u5efa\u4e86\u5404\u81ea\u7684Github\u4ed3\u5e93\uff0c\u6c47\u603b\u6211\u7528\u5230\u7684\u81ea\u5b66\u8d44\u6599\u4ee5\u53ca\u4f5c\u4e1a\u5b9e\u73b0\u3002 \u76f4\u5230\u5927\u56db\u5f00\u59cb\u51d1\u5b66\u5206\u6bd5\u4e1a\u7684\u65f6\u5019\uff0c\u6211\u6253\u5f00\u81ea\u5df1\u7684\u57f9\u517b\u65b9\u6848\uff0c\u6211\u53d1\u73b0\u5b83\u5df2\u7ecf\u662f\u6211\u8fd9\u4e2a\u81ea\u5b66\u4ed3\u5e93\u7684\u5b50\u96c6\u4e86\uff0c\u800c\u8fd9\u8ddd\u79bb\u6211\u5f00\u59cb\u81ea\u5b66\u4e5f\u624d\u4e24\u5e74\u534a\u800c\u5df2\u3002\u4e8e\u662f\uff0c\u4e00\u4e2a\u5927\u80c6\u7684\u60f3\u6cd5\u5728\u6211\u8111\u6d77\u4e2d\u6d6e\u73b0\uff1a\u4e5f\u8bb8\uff0c\u6211\u53ef\u4ee5\u6253\u9020\u4e00\u4e2a\u81ea\u5b66\u5f0f\u7684\u57f9\u517b\u65b9\u6848\uff0c\u628a\u6211\u8fd9\u4e09\u5e74\u81ea\u5b66\u7ecf\u5386\u4e2d\u9047\u5230\u7684\u5751\u3001\u8d70\u8fc7\u7684\u8def\u8bb0\u5f55\u4e0b\u6765\uff0c\u4ee5\u671f\u80fd\u4e3a\u540e\u6765\u7684\u5b66\u5f1f\u5b66\u59b9\u4eec\u8d21\u732e\u81ea\u5df1\u7684\u4e00\u4efd\u5fae\u8584\u4e4b\u529b\u3002 \u5982\u679c\u5927\u5bb6\u53ef\u4ee5\u5728\u4e09\u5e74\u4e0d\u5230\u7684\u65f6\u95f4\u91cc\u5c31\u80fd\u5efa\u7acb\u8d77\u6574\u5ea7CS\u7684\u57fa\u7840\u5927\u53a6\uff0c\u80fd\u6709\u76f8\u5bf9\u624e\u5b9e\u7684\u6570\u5b66\u529f\u5e95\u548c\u4ee3\u7801\u80fd\u529b\uff0c\u7ecf\u5386\u8fc7\u6570\u5341\u4e2a\u5343\u884c\u4ee3\u7801\u91cf\u7684Project\u7684\u6d17\u793c\uff0c\u638c\u63e1\u81f3\u5c11C/C++/Java/JS/Python/Go/Rust\u7b49\u4e3b\u6d41\u8bed\u8a00\uff0c\u5bf9\u7b97\u6cd5\u3001\u7535\u8def\u3001\u4f53\u7cfb\u3001\u7f51\u7edc\u3001\u64cd\u7edf\u3001\u7f16\u8bd1\u3001\u4eba\u5de5\u667a\u80fd\u3001\u673a\u5668\u5b66\u4e60\u3001\u8ba1\u7b97\u673a\u89c6\u89c9\u3001\u81ea\u7136\u8bed\u8a00\u5904\u7406\u3001\u5f3a\u5316\u5b66\u4e60\u3001\u5bc6\u7801\u5b66\u3001\u4fe1\u606f\u8bba\u3001\u535a\u5f08\u8bba\u3001\u6570\u503c\u5206\u6790\u3001\u7edf\u8ba1\u5b66\u3001\u5206\u5e03\u5f0f\u3001\u6570\u636e\u5e93\u3001\u56fe\u5f62\u5b66\u3001Web\u5f00\u53d1\u3001\u4e91\u670d\u52a1\u3001\u8d85\u7b97\u7b49\u7b49\u65b9\u9762\u5747\u6709\u6d89\u730e\u3002\u6211\u60f3\uff0c\u4f60\u5c06\u6709\u8db3\u591f\u7684\u5e95\u6c14\u548c\u81ea\u4fe1\u9009\u62e9\u81ea\u5df1\u611f\u5174\u8da3\u7684\u65b9\u5411\uff0c\u65e0\u8bba\u662f\u5c31\u4e1a\u8fd8\u662f\u79d1\u7814\uff0c\u4f60\u90fd\u5c06\u6709\u76f8\u5f53\u7684\u7ade\u4e89\u529b\u3002 \u56e0\u4e3a\u6211\u575a\u4fe1\uff0c\u65e2\u7136\u4f60\u80fd\u575a\u6301\u542c\u6211BB\u5230\u8fd9\u91cc\uff0c\u4f60\u4e00\u5b9a\u4e0d\u7f3a\u5b66\u597dCS\u7684\u80fd\u529b\uff0c\u4f60\u53ea\u662f\u6ca1\u6709\u4e00\u4e2a\u597d\u7684\u8001\u5e08\uff0c\u7ed9\u4f60\u8bb2\u4e00\u95e8\u597d\u7684\u8bfe\u7a0b\u3002\u800c\u6211\uff0c\u5c06\u529b\u56fe\u6839\u636e\u6211\u4e09\u5e74\u7684\u4f53\u9a8c\uff0c\u4e3a\u4f60\u6311\u9009\u8fd9\u6837\u7684\u8bfe\u7a0b\u3002 \u81ea\u5b66\u7684\u597d\u5904 \u5bf9\u6211\u6765\u8bf4\uff0c\u81ea\u5b66\u6700\u5927\u7684\u597d\u5904\u5c31\u5728\u4e8e\u53ef\u4ee5\u5b8c\u5168\u6839\u636e\u81ea\u5df1\u7684\u8fdb\u5ea6\u6765\u8c03\u6574\u5b66\u4e60\u901f\u5ea6\u3002\u5bf9\u4e8e\u4e00\u4e9b\u7591\u96be\u77e5\u8bc6\u70b9\uff0c\u6211\u53ef\u4ee5\u53cd\u590d\u56de\u770b\u89c6\u9891\uff0c\u5728\u7f51\u4e0a\u8c37\u6b4c\u76f8\u5173\u7684\u5185\u5bb9\uff0c\u4e0aStackOverflow\u63d0\u95ee\u9898\uff0c\u76f4\u5230\u5b8c\u5168\u5c06\u5b83\u5f04\u660e\u767d\u3002\u800c\u5bf9\u4e8e\u81ea\u5df1\u638c\u63e1\u5f97\u76f8\u5bf9\u8f83\u5feb\u7684\u5185\u5bb9\uff0c\u5219\u53ef\u4ee5\u4e24\u500d\u901f\u751a\u81f3\u4e09\u500d\u901f\u7565\u8fc7\u3002 \u81ea\u5b66\u7684\u53e6\u4e00\u5927\u597d\u5904\u5c31\u662f\u535a\u91c7\u4f17\u957f\u3002\u8ba1\u7b97\u673a\u7cfb\u7684\u51e0\u5927\u6838\u5fc3\u8bfe\u7a0b\uff1a\u4f53\u7cfb\u3001\u7f51\u7edc\u3001\u64cd\u7edf\u3001\u7f16\u8bd1\uff0c\u6bcf\u4e00\u95e8\u6211\u57fa\u672c\u90fd\u4e0a\u8fc7\u4e0d\u540c\u5927\u5b66\u7684\u8bfe\u7a0b\uff0c\u4e0d\u540c\u7684\u6559\u6750\u3001\u4e0d\u540c\u7684\u77e5\u8bc6\u70b9\u4fa7\u91cd\u3001\u4e0d\u540c\u7684project\u5c06\u4f1a\u6781\u5927\u4e30\u5bcc\u4f60\u7684\u89c6\u91ce\uff0c\u4e5f\u4f1a\u8ba9\u4f60\u7406\u89e3\u9519\u8bef\u7684\u4e00\u4e9b\u5185\u5bb9\u5f97\u5230\u53ca\u65f6\u7ea0\u6b63\u3002 \u81ea\u5b66\u7684\u7b2c\u4e09\u4e2a\u597d\u5904\u662f\u65f6\u95f4\u81ea\u7531\uff0c\u5177\u4f53\u539f\u56e0\u7701\u7565\u3002 \u81ea\u5b66\u7684\u574f\u5904 \u5f53\u7136\uff0c\u4f5c\u4e3aCS\u81ea\u5b66\u4e3b\u4e49\u7684\u5fe0\u5b9e\u62e5\u8db8\u8005\uff0c\u6211\u4e0d\u5f97\u4e0d\u627f\u8ba4\u81ea\u5b66\u4e5f\u6709\u5b83\u7684\u574f\u5904\u3002 \u7b2c\u4e00\u5c31\u662f\u4ea4\u6d41\u6c9f\u901a\u7684\u4e0d\u4fbf\u3002\u6211\u5176\u5b9e\u662f\u4e00\u4e2a\u5f88\u70ed\u8877\u4e8e\u63d0\u95ee\u7684\u4eba\uff0c\u5bf9\u4e8e\u6240\u6709\u6ca1\u6709\u5f04\u660e\u767d\u7684\u70b9\uff0c\u6211\u90fd\u559c\u6b22\u7a77\u8ffd\u5230\u5e95\u3002\u4f46\u5f53\u4f60\u9762\u5bf9\u7740\u5c4f\u5e55\u542c\u5230\u8001\u5e08\u8bb2\u4e86\u4e00\u4e2a\u4f60\u6ca1\u660e\u767d\u7684\u77e5\u8bc6\u70b9\u7684\u65f6\u5019\uff0c\u4f60\u65e0\u6cd5\u987a\u7740\u7f51\u7ebf\u5230\u53e6\u4e00\u7aef\u5411\u8001\u5e08\u95ee\u4e2a\u660e\u767d\u3002\u6211\u52aa\u529b\u901a\u8fc7\u72ec\u7acb\u601d\u8003\u548c\u5584\u7528Google\u6765\u7f13\u89e3\u8fd9\u4e00\u70b9\uff0c\u4f46\u662f\uff0c\u5982\u679c\u80fd\u6709\u51e0\u4e2a\u5fd7\u540c\u9053\u5408\u7684\u4f19\u4f34\u7ed3\u4f34\u81ea\u5b66\uff0c\u90a3\u5c06\u662f\u6781\u597d\u7684\u3002\u5173\u4e8e\u4ea4\u6d41\u7fa4\u7684\u5efa\u7acb\uff0c\u5927\u5bb6\u53ef\u4ee5\u53c2\u8003\u4ed3\u5e93README\u4e2d\u7684\u6559\u7a0b\u3002 \u7b2c\u4e8c\u5c31\u662f\u8fd9\u4e9b\u81ea\u5b66\u7684\u8bfe\u7a0b\u57fa\u672c\u90fd\u662f\u82f1\u6587\u7684\u3002\u4ece\u89c6\u9891\u5230slides\u5230\u4f5c\u4e1a\u5168\u662f\u82f1\u6587\uff0c\u6240\u4ee5\u6709\u4e00\u5b9a\u7684\u95e8\u69db\u3002\u4e0d\u8fc7\u6211\u89c9\u5f97\u8fd9\u4e2a\u6311\u6218\u5982\u679c\u4f60\u514b\u670d\u4e86\u7684\u8bdd\u5bf9\u4f60\u662f\u6781\u4e3a\u6709\u5229\u7684\u3002\u56e0\u4e3a\u5728\u5f53\u4e0b\uff0c\u867d\u7136\u6211\u5f88\u4e0d\u60c5\u613f\uff0c\u4f46\u4e5f\u4e0d\u5f97\u4e0d\u627f\u8ba4\uff0c\u5728\u8ba1\u7b97\u673a\u9886\u57df\uff0c\u5f88\u591a\u4f18\u8d28\u7684\u6587\u6863\u3001\u8bba\u575b\u3001\u7f51\u7ad9\u90fd\u662f\u5168\u82f1\u6587\u7684\u3002\u517b\u6210\u82f1\u6587\u9605\u8bfb\u7684\u4e60\u60ef\uff0c\u5728\u8d64\u65d7\u63d2\u904d\u4e16\u754c\u4e4b\u524d\uff0c\u8fd8\u662f\u6709\u4e00\u5b9a\u597d\u5904\u7684\uff08\u72d7\u5934\u4fdd\u547d\uff09\u3002 \u7b2c\u4e09\uff0c\u4e5f\u662f\u6211\u89c9\u5f97\u6700\u56f0\u96be\u7684\u4e00\u70b9\uff0c\u5c31\u662f\u81ea\u5f8b\u3002\u56e0\u4e3a\u6ca1\u6709DDL\u6709\u65f6\u5019\u771f\u7684\u662f\u4e00\u4ef6\u53ef\u6015\u7684\u4e8b\u60c5\uff0c\u7279\u522b\u662f\u968f\u7740\u5b66\u4e60\u7684\u6df1\u5165\uff0c\u56fd\u5916\u7684\u5f88\u591a\u8bfe\u7a0b\u662f\u76f8\u5f53\u8650\u7684\u3002\u4f60\u5f97\u6709\u8db3\u591f\u7684\u9a71\u52a8\u529b\u5f3a\u8feb\u81ea\u5df1\u9759\u4e0b\u5fc3\u6765\uff0c\u9605\u8bfb\u51e0\u5341\u9875\u7684Project Handout\uff0c\u7406\u89e3\u4e0a\u5343\u884c\u7684\u4ee3\u7801\u6846\u67b6\uff0c\u5fcd\u53d7\u6570\u4e2a\u5c0f\u65f6\u7684debug\u65f6\u5149\u3002\u800c\u8fd9\u4e00\u5207\uff0c\u6ca1\u6709\u5b66\u5206\uff0c\u6ca1\u6709\u7ee9\u70b9\uff0c\u6ca1\u6709\u8001\u5e08\uff0c\u6ca1\u6709\u540c\u5b66\uff0c\u53ea\u6709\u4e00\u4e2a\u4fe1\u5ff5 \u2014\u2014 \u4f60\u5728\u53d8\u5f3a\u3002 \u8fd9\u672c\u4e66\u9002\u5408\u8c01 \u6b63\u5982\u6211\u5728\u524d\u8a00\u91cc\u8bf4\u7684\uff0c\u4efb\u4f55\u6709\u5fd7\u4e8e\u81ea\u5b66\u8ba1\u7b97\u673a\u7684\u670b\u53cb\u90fd\u53ef\u4ee5\u53c2\u8003\u8fd9\u672c\u4e66\u3002\u5982\u679c\u4f60\u5df2\u7ecf\u6709\u4e86\u4e00\u5b9a\u7684\u8ba1\u7b97\u673a\u57fa\u7840\uff0c\u53ea\u662f\u5bf9\u67d0\u4e2a\u7279\u5b9a\u7684\u9886\u57df\u611f\u5174\u8da3\uff0c\u53ef\u4ee5\u9009\u62e9\u6027\u5730\u6311\u9009\u4f60\u611f\u5174\u8da3\u7684\u5185\u5bb9\u8fdb\u884c\u5b66\u4e60\u3002\u5f53\u7136\uff0c\u5982\u679c\u4f60\u662f\u4e00\u4e2a\u50cf\u6211\u5f53\u5e74\u4e00\u6837\u5bf9\u8ba1\u7b97\u673a\u4e00\u65e0\u6240\u77e5\u7684\u5c0f\u767d\uff0c\u521d\u5165\u5927\u5b66\u7684\u6821\u95e8\uff0c\u6211\u5e0c\u671b\u8fd9\u672c\u4e66\u80fd\u6210\u4e3a\u4f60\u7684\u653b\u7565\uff0c\u8ba9\u4f60\u82b1\u6700\u5c11\u7684\u65f6\u95f4\u638c\u63e1\u4f60\u6240\u9700\u8981\u7684\u77e5\u8bc6\u548c\u80fd\u529b\u3002\u67d0\u79cd\u7a0b\u5ea6\u4e0a\uff0c\u8fd9\u672c\u4e66\u66f4\u50cf\u662f\u4e00\u4e2a\u6839\u636e\u6211\u7684\u4f53\u9a8c\u6765\u6392\u5e8f\u7684\u8bfe\u7a0b\u641c\u7d22\u5f15\u64ce\uff0c\u5e2e\u52a9\u5927\u5bb6\u8db3\u4e0d\u51fa\u6237\uff0c\u4f53\u9a8c\u4e16\u754c\u9876\u7ea7\u540d\u6821\u7684\u8ba1\u7b97\u673a\u4f18\u8d28\u8bfe\u7a0b\u3002 \u5f53\u7136\uff0c\u4f5c\u4e3a\u4e00\u4e2a\u8fd8\u672a\u6bd5\u4e1a\u7684\u672c\u79d1\u751f\uff0c\u6211\u6df1\u611f\u81ea\u5df1\u6ca1\u6709\u80fd\u529b\u4e5f\u6ca1\u6709\u6743\u5229\u53bb\u5ba3\u626c\u4e00\u79cd\u5b66\u4e60\u65b9\u5f0f\uff0c\u6211\u53ea\u662f\u5e0c\u671b\u8fd9\u4efd\u8d44\u6599\u80fd\u8ba9\u90a3\u4e9b\u540c\u6837\u6709\u81ea\u5b66\u4e4b\u5fc3\u548c\u6bc5\u529b\u670b\u53cb\u53ef\u4ee5\u5c11\u8d70\u4e9b\u5f2f\u8def\uff0c\u6536\u83b7\u66f4\u4e30\u5bcc\u3001\u66f4\u591a\u6837\u3001\u66f4\u6ee1\u8db3\u7684\u5b66\u4e60\u4f53\u9a8c\u3002 \u7279\u522b\u9e23\u8c22 \u5728\u8fd9\u91cc\uff0c\u6211\u6000\u7740\u5d07\u656c\u4e4b\u5fc3\u771f\u8bda\u5730\u611f\u8c22\u6240\u6709\u5c06\u8bfe\u7a0b\u8d44\u6e90\u65e0\u507f\u5f00\u6e90\u7684\u5404\u4f4d\u6559\u6388\u4eec\u3002\u8fd9\u4e9b\u8bfe\u7a0b\u503e\u6ce8\u4e86\u4ed6\u4eec\u6570\u5341\u5e74\u6559\u5b66\u751f\u6daf\u7684\u79ef\u6dc0\u548c\u5fc3\u8840\uff0c\u4ed6\u4eec\u5374\u9009\u62e9\u65e0\u79c1\u5730\u8ba9\u6240\u6709\u4eba\u4eab\u53d7\u5230\u5982\u6b64\u9ad8\u8d28\u91cf\u7684CS\u6559\u80b2\u3002\u6ca1\u6709\u4ed6\u4eec\uff0c\u6211\u7684\u5927\u5b66\u751f\u6d3b\u4e0d\u4f1a\u8fd9\u6837\u5145\u5b9e\u800c\u5feb\u4e50\u3002\u5f88\u591a\u6559\u6388\u5728\u6211\u7ed9\u4ed6\u4eec\u53d1\u4e86\u611f\u8c22\u90ae\u4ef6\u4e4b\u540e\uff0c\u751a\u81f3\u4f1a\u56de\u590d\u4e0a\u767e\u5b57\u7684\u957f\u6587\uff0c\u771f\u7684\u8ba9\u6211\u65e0\u6bd4\u611f\u52a8\u3002\u4ed6\u4eec\u4e5f\u65f6\u523b\u6fc0\u52b1\u7740\u6211\uff0c\u505a\u4e00\u4ef6\u4e8b\uff0c\u5c31\u5f97\u7528\u5fc3\u505a\u597d\uff0c\u65e0\u8bba\u662f\u79d1\u7814\uff0c\u8fd8\u662f\u4e3a\u4eba\u3002 \u4f60\u4e5f\u60f3\u52a0\u5165\u5230\u8d21\u732e\u8005\u7684\u884c\u5217 \u4e00\u4e2a\u4eba\u7684\u529b\u91cf\u7ec8\u7a76\u662f\u6709\u9650\u7684\uff0c\u8fd9\u672c\u4e66\u4e5f\u662f\u6211\u5728\u7e41\u91cd\u7684\u79d1\u7814\u4e4b\u4f59\u71ac\u591c\u62bd\u7a7a\u5199\u51fa\u6765\u7684\uff0c\u96be\u514d\u6709\u4e0d\u591f\u5b8c\u5584\u4e4b\u5904\u3002\u53e6\u5916\uff0c\u7531\u4e8e\u4e2a\u4eba\u505a\u7684\u662f\u7cfb\u7edf\u65b9\u5411\uff0c\u5f88\u591a\u8bfe\u7a0b\u4fa7\u91cd\u7cfb\u7edf\u9886\u57df\uff0c\u5bf9\u4e8e\u6570\u5b66\u3001\u7406\u8bba\u8ba1\u7b97\u673a\u3001\u9ad8\u7ea7\u7b97\u6cd5\u76f8\u5173\u7684\u5185\u5bb9\u5219\u76f8\u5bf9\u5c11\u4e9b\u3002\u5982\u679c\u6709\u5927\u4f6c\u60f3\u5728\u5176\u4ed6\u9886\u57df\u5206\u4eab\u81ea\u5df1\u7684\u81ea\u5b66\u7ecf\u5386\u4e0e\u8d44\u6e90\uff0c\u53ef\u4ee5\u76f4\u63a5\u5728\u9879\u76ee\u4e2d\u53d1\u8d77Pull Request\uff0c\u4e5f\u6b22\u8fce\u548c\u6211\u90ae\u4ef6\u8054\u7cfb\uff08zhongyinmin@pku.edu.cn\uff09\u3002 \u5173\u4e8e\u4ea4\u6d41\u7fa4\u7684\u5efa\u7acb \u65b9\u6cd5\u53c2\u89c1\u4ed3\u5e93\u7684README.","title":"\u524d\u8a00"},{"location":"#_1","text":"\u66f4\u65b0\uff1a\u672c\u4e66\u6700\u65b0\u7f51\u5740 csdiy.wiki \uff0c\u6b22\u8fce\u5927\u5bb6\u8bbf\u95ee \uff5e \u8fd9\u662f\u4e00\u672c\u8ba1\u7b97\u673a\u7684\u81ea\u5b66\u6307\u5357\uff0c\u4e5f\u662f\u5bf9\u81ea\u5df1\u5927\u5b66\u4e09\u5e74\u81ea\u5b66\u751f\u6daf\u7684\u4e00\u4e2a\u7eaa\u5ff5\u3002 \u8fd9\u540c\u65f6\u4e5f\u662f\u4e00\u4efd\u732e\u7ed9\u5317\u5927\u4fe1\u79d1\u5b66\u5f1f\u5b66\u59b9\u4eec\u7684\u793c\u7269\u3002\u5982\u679c\u8fd9\u672c\u4e66\u80fd\u5bf9\u4f60\u4eec\u7684\u4fe1\u79d1\u751f\u6daf\u6709\u54ea\u6015\u4e00\u4e1d\u4e00\u6beb\u7684\u5e2e\u52a9\uff0c\u90fd\u662f\u5bf9\u6211\u6781\u5927\u7684\u9f13\u52b1\u548c\u6170\u85c9\u3002 \u672c\u4e66\u76ee\u524d\u89c4\u5212\u4e86\u4ee5\u4e0b\u90e8\u5206(\u5982\u679c\u4f60\u6709\u5176\u4ed6\u597d\u7684\u5efa\u8bae\uff0c\u6216\u8005\u60f3\u52a0\u5165\u8d21\u732e\u8005\u7684\u884c\u5217\uff0c\u6b22\u8fce\u90ae\u4ef6zhongyinmin@pku.edu.cn\u6216\u8005\u5728issue\u91cc\u63d0\u95ee)\uff1a \u5fc5\u5b66\u5de5\u5177\uff1aIDE, \u7ffb\u5899, StackOverflow, Git, Github, Vim, Latex, Makefile, \u5b9e\u7528\u5de5\u5177 ... \u56fd\u5916\u9ad8\u8d28\u91cfCS\u8bfe\u7a0b\u6c47\u603b \uff1a\u6211\u5c06\u628a\u6211\u4e0a\u8fc7\u7684\u6240\u6709\u9ad8\u8d28\u91cf\u7684\u56fd\u5916CS\u8bfe\u7a0b\u5206\u95e8\u522b\u7c7b\u8fdb\u884c\u6c47\u603b\uff0c\u5e76\u7ed9\u51fa\u76f8\u5173\u7684\u81ea\u5b66\u5efa\u8bae\uff0c\u5927\u90e8\u5206\u8bfe\u7a0b\u90fd\u4f1a\u6709\u4e00\u4e2a\u72ec\u7acb\u7684\u4ed3\u5e93\u7ef4\u62a4\u76f8\u5173\u7684\u8d44\u6e90\u4ee5\u53ca\u6211\u7684\u4f5c\u4e1a\u5b9e\u73b0\u3002 \u73af\u5883\u914d\u7f6e\uff1aLinux\u57fa\u7840\uff0cbash\uff0c\u73af\u5883\u53d8\u91cf\uff0cAnaconda ... \u7ecf\u5178\u4e66\u7c4d\u63a8\u8350\uff1a\u770b\u8fc7CSAPP\u8fd9\u672c\u4e66\u7684\u540c\u5b66\u4e00\u5b9a\u611f\u53f9\u597d\u4e66\u7684\u91cd\u8981\uff0c\u6211\u5c06\u5217\u4e3e\u63a8\u8350\u81ea\u5df1\u770b\u8fc7\u7684\u8ba1\u7b97\u673a\u9886\u57df\u7684\u5fc5\u770b\u597d\u4e66\u4e0e\u8d44\u6e90\u94fe\u63a5\u3002","title":"\u524d\u8a00"},{"location":"#cs61a","text":"\u5927\u4e00\u5165\u5b66\u65f6\u6211\u662f\u4e00\u4e2a\u5bf9\u8ba1\u7b97\u673a\u4e00\u65e0\u6240\u77e5\u7684\u5c0f\u767d\uff0c\u88c5\u4e86\u51e0\u5341\u4e2aG\u7684Visual Studio\u5929\u5929\u548cOJ\u4f60\u6b7b\u6211\u6d3b\u3002\u51ed\u7740\u9ad8\u4e2d\u7684\u6570\u5b66\u5e95\u5b50\u6211\u6570\u5b66\u8bfe\u5b66\u5f97\u8fd8\u4e0d\u9519\uff0c\u4f46\u5728\u4e13\u4e1a\u8bfe\u4e0a\u5bf9\u7ade\u8d5b\u5927\u4f6c\u53ea\u6709\u4ef0\u671b\u3002\u63d0\u5230\u7f16\u7a0b\u6211\u53ea\u4f1a\u6253\u5f00\u90a3\u7b28\u91cd\u7684IDE\uff0c\u65b0\u5efa\u4e00\u4e2a\u6211\u4e5f\u4e0d\u77e5\u9053\u5177\u4f53\u662f\u5e72\u5565\u7684\u547d\u4ee4\u884c\u9879\u76ee\uff0c\u7136\u540e\u5c31\u662fcin\uff0ccout\uff0cfor\u5faa\u73af\uff0c\u7136\u540eCE\uff0cRE\uff0cWA\u5faa\u73af\u3002\u5f53\u65f6\u7684\u6211\u5c31\u5904\u5728\u4e00\u79cd\u62fc\u547d\u60f3\u5b66\u597d\u4f46\u4e0d\u77e5\u9053\u600e\u4e48\u5b66\uff0c\u8bfe\u4e0a\u8ba4\u771f\u542c\u8bb2\u4f46\u9898\u8fd8\u4e0d\u4f1a\u505a\uff0c\u8bfe\u540e\u505a\u4f5c\u4e1a\u5b8c\u5168\u662f\u7528\u65f6\u95f4\u548c\u5b83\u786c\u8017\u7684\u75db\u82e6\u72b6\u6001\u3002\u6211\u81f3\u4eca\u7535\u8111\u91cc\u8fd8\u5b58\u7740\u81ea\u5df1\u5927\u4e00\u4e0a\u5b66\u671f\u8ba1\u7b97\u6982\u8bba\u5927\u4f5c\u4e1a\u7684\u6e90\u4ee3\u7801 \u2014\u2014 \u4e00\u4e2a1200\u884c\u7684C++\u6587\u4ef6\uff0c\u6ca1\u6709\u5934\u6587\u4ef6\u3001\u6ca1\u6709\u7c7b\u3001\u6ca1\u6709\u5c01\u88c5\u3001\u6ca1\u6709unit test\u3001\u6ca1\u6709makefile\u3001\u6ca1\u6709git\uff0c\u552f\u4e00\u7684\u4f18\u70b9\u662f\u5b83\u786e\u5b9e\u80fd\u8dd1\uff0c\u7f3a\u70b9\u662f\u201c\u80fd\u8dd1\u201d\u7684\u8865\u96c6\u3002\u6211\u4e00\u5ea6\u6000\u7591\u6211\u662f\u4e0d\u662f\u4e0d\u9002\u5408\u5b66\u8ba1\u7b97\u673a\uff0c\u56e0\u4e3a\u7ae5\u5e74\u5bf9\u4e8e\u6781\u5ba2\u7684\u6240\u6709\u60f3\u8c61\uff0c\u5df2\u7ecf\u88ab\u6211\u7b2c\u4e00\u4e2a\u5b66\u671f\u7684\u4f53\u9a8c\u5f7b\u5e95\u7c89\u788e\u4e86\u3002 \u8fd9\u4e00\u5207\u7684\u8f6c\u673a\u53d1\u751f\u5728\u6211\u5927\u4e00\u7684\u5bd2\u5047\uff0c\u6211\u5fc3\u8840\u6765\u6f6e\u60f3\u5b66\u4e60Python\u3002\u65e0\u610f\u95f4\u770b\u5230\u77e5\u4e4e\u6709\u4eba\u63a8\u8350\u4e86CS61A\u8fd9\u95e8\u8bfe\uff0c\u8bf4\u662fUC Berkeley\u7684\u5927\u4e00\u5165\u95e8\u8bfe\u7a0b\uff0c\u8bb2\u7684\u5c31\u662fPython\u3002\u6211\u6c38\u8fdc\u4e0d\u4f1a\u5fd8\u8bb0\u90a3\u4e00\u5929\uff0c\u6253\u5f00 CS61A \u8bfe\u7a0b\u7f51\u7ad9\u7684\u90a3\u4e2a\u77ac\u95f4\uff0c\u5c31\u50cf\u54e5\u4f26\u5e03\u53d1\u73b0\u4e86\u65b0\u5927\u9646\u4e00\u6837\uff0c\u6211\u5f00\u542f\u4e86\u65b0\u4e16\u754c\u7684\u5927\u95e8\u3002 \u6211\u4e00\u53e3\u6c143\u4e2a\u661f\u671f\u4e0a\u5b8c\u4e86\u8fd9\u95e8\u8bfe\uff0c\u5b83\u8ba9\u6211\u7b2c\u4e00\u6b21\u611f\u89c9\u5230\u539f\u6765CS\u53ef\u4ee5\u5b66\u5f97\u5982\u6b64\u5145\u5b9e\u800c\u6709\u8da3\uff0c\u539f\u6765\u8fd9\u4e16\u4e0a\u7adf\u6709\u5982\u6b64\u7cbe\u534e\u7684\u8bfe\u7a0b\u3002 \u4e3a\u907f\u514d\u6709\u5d07\u6d0b\u5a9a\u5916\u4e4b\u5acc\uff0c\u6211\u5355\u7eaf\u4ece\u4e00\u4e2a\u5b66\u751f\u7684\u89c6\u89d2\u6765\u8bb2\u8bb2\u81ea\u5b66CS61A\u7684\u4f53\u9a8c\uff1a \u72ec\u7acb\u642d\u5efa\u7684\u8bfe\u7a0b\u7f51\u7ad9: \u4e00\u4e2a\u7f51\u7ad9\u5c06\u6240\u6709\u8bfe\u7a0b\u8d44\u6e90\u6574\u5408\u4e00\u4f53\uff0c\u6761\u7406\u5206\u660e\u7684\u8bfe\u7a0bschedule\u3001\u6240\u6709slides\uff0chw\uff0cdiscussion\u7684\u6587\u4ef6\u94fe\u63a5\u3001\u8be6\u7ec6\u660e\u786e\u7684\u8bfe\u7a0b\u7ed9\u5206\u8bf4\u660e\u3001\u5386\u5e74\u7684\u8003\u8bd5\u9898\u4e0e\u7b54\u6848\u3002\u8fd9\u6837\u4e00\u4e2a\u7f51\u7ad9\u629b\u5f00\u7f8e\u89c2\u7a0b\u5ea6\u4e0d\u8c08\uff0c\u65e2\u65b9\u4fbf\u5b66\u751f\uff0c\u4e5f\u8ba9\u8d44\u6e90\u516c\u6b63\u900f\u660e\u3002 \u8bfe\u7a0b\u6559\u6388\u4eb2\u81ea\u7f16\u5199\u7684\u6559\u6750\uff1aCS61A\u8fd9\u95e8\u8bfe\u7684\u5f00\u8bfe\u8001\u5e08\u5c06MIT\u7684\u7ecf\u5178\u6559\u6750 Structure and Interpretation of Computer Programs (SICP)\u7528Python\u8fd9\u95e8\u8bed\u8a00\u8fdb\u884c\u6539\u7f16\uff08\u539f\u6559\u6750\u57fa\u4e8eScheme\u8bed\u8a00\uff09\uff0c\u4fdd\u8bc1\u4e86\u8bfe\u5802\u5185\u5bb9\u4e0e\u6559\u6750\u5185\u5bb9\u7684\u4e00\u81f4\u6027\uff0c\u540c\u65f6\u8865\u5145\u4e86\u66f4\u591a\u7ec6\u8282\uff0c\u53ef\u4ee5\u8bf4\u8bda\u610f\u6ee1\u6ee1\u3002\u800c\u4e14\u5168\u4e66\u5f00\u6e90\uff0c\u53ef\u4ee5\u76f4\u63a5\u7ebf\u4e0a\u9605\u8bfb\u3002 \u4e30\u5bcc\u5230\u8ba9\u4eba\u773c\u82b1\u7f2d\u4e71\u7684\u8bfe\u7a0b\u4f5c\u4e1a\uff1a14\u4e2alab\u5de9\u56fa\u968f\u5802\u77e5\u8bc6\u70b9\uff0c10\u4e2ahomework\uff0c\u8fd8\u67094\u4e2a\u4ee3\u7801\u91cf\u5747\u4e0a\u5343\u884c\u7684project\u3002\u4e0e\u5927\u5bb6\u719f\u6089\u7684OJ\u548cword\u6587\u6863\u5f0f\u7684\u4f5c\u4e1a\u4e0d\u540c\uff0c\u6240\u6709\u4f5c\u4e1a\u5747\u6709\u5b8c\u5584\u7684\u4ee3\u7801\u6846\u67b6\uff0c\u4fdd\u59c6\u7ea7\u7684\u4f5c\u4e1a\u8bf4\u660e\u3002\u6bcf\u4e2aProject\u90fd\u6709\u8be6\u5c3d\u7684handout\u6587\u6863\u3001\u5168\u81ea\u52a8\u7684\u8bc4\u5206\u811a\u672c\u3002CS61A\u751a\u81f3\u4e13\u95e8\u5f00\u53d1\u4e86\u4e00\u4e2a \u81ea\u52a8\u5316\u7684\u4f5c\u4e1a\u63d0\u4ea4\u8bc4\u5206\u7cfb\u7edf \uff08\u636e\u8bf4\u8fd8\u53d1\u4e86\u8bba\u6587\uff09\u3002\u5f53\u7136\uff0c\u6709\u4eba\u4f1a\u8bf4\u201c\u4e00\u4e2aproject\u51e0\u5343\u884c\u4ee3\u7801\u5927\u90e8\u5206\u90fd\u662f\u52a9\u6559\u5e2e\u4f60\u5199\u597d\u7684\uff0c\u4f60\u8fd8\u80fd\u5b66\u5230\u5565\uff1f\u201d\u3002\u6b64\u8a00\u5dee\u77e3\uff0c\u4f5c\u4e3a\u4e00\u4e2a\u521a\u521a\u63a5\u89e6\u8ba1\u7b97\u673a\uff0c\u8fde\u5b89\u88c5Python\u90fd\u78d5\u78d5\u7eca\u7eca\u7684\u5c0f\u767d\u6765\u8bf4\uff0c\u8fd9\u6837\u5b8c\u5584\u7684\u4ee3\u7801\u6846\u67b6\u65e2\u53ef\u4ee5\u8ba9\u4f60\u4e13\u6ce8\u4e8e\u5de9\u56fa\u8bfe\u5802\u4e0a\u5b66\u4e60\u5230\u7684\u6838\u5fc3\u77e5\u8bc6\u70b9\uff0c\u53c8\u80fd\u6709\u201c\u6211\u624d\u5b66\u4e86\u4e00\u4e2a\u6708\u5c31\u80fd\u505a\u4e00\u4e2a\u5c0f\u6e38\u620f\u4e86\uff01\u201d\u7684\u6210\u5c31\u611f\uff0c\u8fd8\u80fd\u6709\u673a\u4f1a\u9605\u8bfb\u5b66\u4e60\u522b\u4eba\u9ad8\u8d28\u91cf\u7684\u4ee3\u7801\uff0c\u4ece\u800c\u4e3a\u81ea\u5df1\u6240\u7528\u3002\u6211\u89c9\u5f97\u5728\u4f4e\u5e74\u7ea7\uff0c\u8fd9\u79cd\u4ee3\u7801\u6846\u67b6\u53ef\u4ee5\u8bf4\u767e\u5229\u800c\u65e0\u4e00\u5bb3\u3002\u552f\u4e00\u7684\u5bb3\u4e5f\u8bb8\u662f\u82e6\u4e86\u8001\u5e08\u548c\u52a9\u6559\uff0c\u56e0\u4e3a\u5f00\u53d1\u8fd9\u6837\u7684\u4f5c\u4e1a\u53ef\u60f3\u800c\u77e5\u9700\u8981\u76f8\u5f53\u7684\u65f6\u95f4\u6295\u5165\u3002 \u6bcf\u5468Discussion\u8ba8\u8bba\u8bfe\uff0c\u52a9\u6559\u4f1a\u8bb2\u89e3\u77e5\u8bc6\u96be\u70b9\u548c\u8003\u8bd5\u4f8b\u9898\uff1a\u7c7b\u4f3c\u4e8e\u5317\u4eac\u5927\u5b66ICS\u7684\u5c0f\u73ed\u7814\u8ba8\uff0c\u4f46\u4e60\u9898\u5168\u90e8\u7528Latex\u64b0\u5199\uff0c\u76f8\u5f53\u89c4\u8303\u4e14\u4f1a\u660e\u786e\u7ed9\u51fasolution\u3002 \u8fd9\u6837\u7684\u8bfe\u7a0b\uff0c\u4f60\u5b8c\u5168\u4e0d\u9700\u8981\u4efb\u4f55\u8ba1\u7b97\u673a\u7684\u57fa\u7840\uff0c\u4f60\u53ea\u9700\u8981\u52aa\u529b\u3001\u8ba4\u771f\u3001\u82b1\u65f6\u95f4\u5c31\u591f\u4e86\u3002\u6b64\u524d\u90a3\u79cd\u6709\u52b2\u6ca1\u5904\u4f7f\u7684\u611f\u89c9\uff0c\u90a3\u79cd\u4ed8\u51fa\u518d\u591a\u65f6\u95f4\u5374\u5f97\u4e0d\u5230\u56de\u62a5\u7684\u611f\u89c9\uff0c\u4ece\u6b64\u70df\u6d88\u4e91\u6563\u3002\u8fd9\u592a\u9002\u5408\u6211\u4e86\uff0c\u6211\u4ece\u6b64\u7231\u4e0a\u4e86\u81ea\u5b66\u3002 \u8bd5\u60f3\u5982\u679c\u6709\u4eba\u80fd\u628a\u8270\u6df1\u7684\u77e5\u8bc6\u70b9\u56bc\u788e\u56bc\u70c2\uff0c\u7528\u751f\u52a8\u76f4\u767d\u7684\u65b9\u5f0f\u5448\u73b0\u7ed9\u4f60\uff0c\u8fd8\u6709\u90a3\u4e48\u591a\u542c\u8d77\u6765\u5c31\u5f88fancy\uff0c\u79cd\u7c7b\u7e41\u591a\u7684project\u6765\u5de9\u56fa\u4f60\u7684\u7406\u8bba\u77e5\u8bc6\uff0c\u4f60\u4f1a\u89c9\u5f97\u4ed6\u4eec\u771f\u7684\u662f\u5728\u503e\u5c3d\u5168\u529b\u60f3\u65b9\u8bbe\u6cd5\u5730\u8ba9\u4f60\u5b8c\u5168\u638c\u63e1\u8fd9\u95e8\u8bfe\uff0c\u4f60\u4f1a\u89c9\u5f97\u4e0d\u5b66\u597d\u5b83\u7b80\u76f4\u662f\u5bf9\u8fd9\u4e9b\u8bfe\u7a0b\u5efa\u8bbe\u8005\u7684\u4fae\u8fb1\u3002 \u5982\u679c\u4f60\u89c9\u5f97\u6211\u5728\u5938\u5927\u5176\u8bcd\uff0c\u90a3\u4e48\u4e0d\u59a8\u4ece CS61A \u5f00\u59cb\uff0c\u56e0\u4e3a\u5b83\u662f\u6211\u7684\u68a6\u5f00\u59cb\u7684\u5730\u65b9\u3002","title":"\u68a6\u5f00\u59cb\u7684\u5730\u65b9 \u2014\u2014 CS61A"},{"location":"#_2","text":"\u5728\u62112020\u5e74\u79cb\u5b63\u5b66\u671f\u62c5\u4efb\u300a\u6df1\u5165\u7406\u89e3\u8ba1\u7b97\u673a\u7cfb\u7edf\u300b\uff08CSAPP\uff09\u8fd9\u95e8\u8bfe\u7684\u52a9\u6559\u65f6\uff0c\u6211\u5df2\u7ecf\u81ea\u5b66\u4e00\u5e74\u591a\u4e86\u3002\u8fd9\u4e00\u5e74\u591a\u6765\u6211\u65e0\u6bd4\u4eab\u53d7\u8fd9\u79cd\u81ea\u5b66\u6a21\u5f0f\uff0c\u4e3a\u4e86\u5206\u4eab\u8fd9\u79cd\u5feb\u4e50\uff0c\u6211\u4e3a\u81ea\u5df1\u7684\u5c0f\u73ed\u540c\u5b66\u505a\u8fc7\u4e00\u4e2a CS\u81ea\u5b66\u8d44\u6599\u6574\u7406\u4ed3\u5e93 \u3002\u5f53\u65f6\u7eaf\u7cb9\u662f\u5fc3\u8840\u6765\u6f6e\uff0c\u56e0\u4e3a\u6211\u4e5f\u4e0d\u6562\u516c\u7136\u9f13\u52b1\u5927\u5bb6\u7fd8\u8bfe\u81ea\u5b66\u3002 \u4f46\u968f\u7740\u53c8\u4e00\u5e74\u65f6\u95f4\u7684\u7ef4\u62a4\uff0c\u8fd9\u4e2a\u4ed3\u5e93\u7684\u5185\u5bb9\u5df2\u7ecf\u76f8\u5f53\u4e30\u5bcc\uff0c\u57fa\u672c\u8986\u76d6\u4e86\u8ba1\u79d1\u3001\u667a\u80fd\u7cfb\u3001\u8f6f\u5de5\u7cfb\u7684\u7edd\u5927\u591a\u6570\u8bfe\u7a0b\uff0c\u6211\u4e5f\u4e3a\u6bcf\u4e2a\u8bfe\u7a0b\u90fd\u5efa\u4e86\u5404\u81ea\u7684Github\u4ed3\u5e93\uff0c\u6c47\u603b\u6211\u7528\u5230\u7684\u81ea\u5b66\u8d44\u6599\u4ee5\u53ca\u4f5c\u4e1a\u5b9e\u73b0\u3002 \u76f4\u5230\u5927\u56db\u5f00\u59cb\u51d1\u5b66\u5206\u6bd5\u4e1a\u7684\u65f6\u5019\uff0c\u6211\u6253\u5f00\u81ea\u5df1\u7684\u57f9\u517b\u65b9\u6848\uff0c\u6211\u53d1\u73b0\u5b83\u5df2\u7ecf\u662f\u6211\u8fd9\u4e2a\u81ea\u5b66\u4ed3\u5e93\u7684\u5b50\u96c6\u4e86\uff0c\u800c\u8fd9\u8ddd\u79bb\u6211\u5f00\u59cb\u81ea\u5b66\u4e5f\u624d\u4e24\u5e74\u534a\u800c\u5df2\u3002\u4e8e\u662f\uff0c\u4e00\u4e2a\u5927\u80c6\u7684\u60f3\u6cd5\u5728\u6211\u8111\u6d77\u4e2d\u6d6e\u73b0\uff1a\u4e5f\u8bb8\uff0c\u6211\u53ef\u4ee5\u6253\u9020\u4e00\u4e2a\u81ea\u5b66\u5f0f\u7684\u57f9\u517b\u65b9\u6848\uff0c\u628a\u6211\u8fd9\u4e09\u5e74\u81ea\u5b66\u7ecf\u5386\u4e2d\u9047\u5230\u7684\u5751\u3001\u8d70\u8fc7\u7684\u8def\u8bb0\u5f55\u4e0b\u6765\uff0c\u4ee5\u671f\u80fd\u4e3a\u540e\u6765\u7684\u5b66\u5f1f\u5b66\u59b9\u4eec\u8d21\u732e\u81ea\u5df1\u7684\u4e00\u4efd\u5fae\u8584\u4e4b\u529b\u3002 \u5982\u679c\u5927\u5bb6\u53ef\u4ee5\u5728\u4e09\u5e74\u4e0d\u5230\u7684\u65f6\u95f4\u91cc\u5c31\u80fd\u5efa\u7acb\u8d77\u6574\u5ea7CS\u7684\u57fa\u7840\u5927\u53a6\uff0c\u80fd\u6709\u76f8\u5bf9\u624e\u5b9e\u7684\u6570\u5b66\u529f\u5e95\u548c\u4ee3\u7801\u80fd\u529b\uff0c\u7ecf\u5386\u8fc7\u6570\u5341\u4e2a\u5343\u884c\u4ee3\u7801\u91cf\u7684Project\u7684\u6d17\u793c\uff0c\u638c\u63e1\u81f3\u5c11C/C++/Java/JS/Python/Go/Rust\u7b49\u4e3b\u6d41\u8bed\u8a00\uff0c\u5bf9\u7b97\u6cd5\u3001\u7535\u8def\u3001\u4f53\u7cfb\u3001\u7f51\u7edc\u3001\u64cd\u7edf\u3001\u7f16\u8bd1\u3001\u4eba\u5de5\u667a\u80fd\u3001\u673a\u5668\u5b66\u4e60\u3001\u8ba1\u7b97\u673a\u89c6\u89c9\u3001\u81ea\u7136\u8bed\u8a00\u5904\u7406\u3001\u5f3a\u5316\u5b66\u4e60\u3001\u5bc6\u7801\u5b66\u3001\u4fe1\u606f\u8bba\u3001\u535a\u5f08\u8bba\u3001\u6570\u503c\u5206\u6790\u3001\u7edf\u8ba1\u5b66\u3001\u5206\u5e03\u5f0f\u3001\u6570\u636e\u5e93\u3001\u56fe\u5f62\u5b66\u3001Web\u5f00\u53d1\u3001\u4e91\u670d\u52a1\u3001\u8d85\u7b97\u7b49\u7b49\u65b9\u9762\u5747\u6709\u6d89\u730e\u3002\u6211\u60f3\uff0c\u4f60\u5c06\u6709\u8db3\u591f\u7684\u5e95\u6c14\u548c\u81ea\u4fe1\u9009\u62e9\u81ea\u5df1\u611f\u5174\u8da3\u7684\u65b9\u5411\uff0c\u65e0\u8bba\u662f\u5c31\u4e1a\u8fd8\u662f\u79d1\u7814\uff0c\u4f60\u90fd\u5c06\u6709\u76f8\u5f53\u7684\u7ade\u4e89\u529b\u3002 \u56e0\u4e3a\u6211\u575a\u4fe1\uff0c\u65e2\u7136\u4f60\u80fd\u575a\u6301\u542c\u6211BB\u5230\u8fd9\u91cc\uff0c\u4f60\u4e00\u5b9a\u4e0d\u7f3a\u5b66\u597dCS\u7684\u80fd\u529b\uff0c\u4f60\u53ea\u662f\u6ca1\u6709\u4e00\u4e2a\u597d\u7684\u8001\u5e08\uff0c\u7ed9\u4f60\u8bb2\u4e00\u95e8\u597d\u7684\u8bfe\u7a0b\u3002\u800c\u6211\uff0c\u5c06\u529b\u56fe\u6839\u636e\u6211\u4e09\u5e74\u7684\u4f53\u9a8c\uff0c\u4e3a\u4f60\u6311\u9009\u8fd9\u6837\u7684\u8bfe\u7a0b\u3002","title":"\u4e3a\u4ec0\u4e48\u5199\u8fd9\u672c\u4e66"},{"location":"#_3","text":"\u5bf9\u6211\u6765\u8bf4\uff0c\u81ea\u5b66\u6700\u5927\u7684\u597d\u5904\u5c31\u5728\u4e8e\u53ef\u4ee5\u5b8c\u5168\u6839\u636e\u81ea\u5df1\u7684\u8fdb\u5ea6\u6765\u8c03\u6574\u5b66\u4e60\u901f\u5ea6\u3002\u5bf9\u4e8e\u4e00\u4e9b\u7591\u96be\u77e5\u8bc6\u70b9\uff0c\u6211\u53ef\u4ee5\u53cd\u590d\u56de\u770b\u89c6\u9891\uff0c\u5728\u7f51\u4e0a\u8c37\u6b4c\u76f8\u5173\u7684\u5185\u5bb9\uff0c\u4e0aStackOverflow\u63d0\u95ee\u9898\uff0c\u76f4\u5230\u5b8c\u5168\u5c06\u5b83\u5f04\u660e\u767d\u3002\u800c\u5bf9\u4e8e\u81ea\u5df1\u638c\u63e1\u5f97\u76f8\u5bf9\u8f83\u5feb\u7684\u5185\u5bb9\uff0c\u5219\u53ef\u4ee5\u4e24\u500d\u901f\u751a\u81f3\u4e09\u500d\u901f\u7565\u8fc7\u3002 \u81ea\u5b66\u7684\u53e6\u4e00\u5927\u597d\u5904\u5c31\u662f\u535a\u91c7\u4f17\u957f\u3002\u8ba1\u7b97\u673a\u7cfb\u7684\u51e0\u5927\u6838\u5fc3\u8bfe\u7a0b\uff1a\u4f53\u7cfb\u3001\u7f51\u7edc\u3001\u64cd\u7edf\u3001\u7f16\u8bd1\uff0c\u6bcf\u4e00\u95e8\u6211\u57fa\u672c\u90fd\u4e0a\u8fc7\u4e0d\u540c\u5927\u5b66\u7684\u8bfe\u7a0b\uff0c\u4e0d\u540c\u7684\u6559\u6750\u3001\u4e0d\u540c\u7684\u77e5\u8bc6\u70b9\u4fa7\u91cd\u3001\u4e0d\u540c\u7684project\u5c06\u4f1a\u6781\u5927\u4e30\u5bcc\u4f60\u7684\u89c6\u91ce\uff0c\u4e5f\u4f1a\u8ba9\u4f60\u7406\u89e3\u9519\u8bef\u7684\u4e00\u4e9b\u5185\u5bb9\u5f97\u5230\u53ca\u65f6\u7ea0\u6b63\u3002 \u81ea\u5b66\u7684\u7b2c\u4e09\u4e2a\u597d\u5904\u662f\u65f6\u95f4\u81ea\u7531\uff0c\u5177\u4f53\u539f\u56e0\u7701\u7565\u3002","title":"\u81ea\u5b66\u7684\u597d\u5904"},{"location":"#_4","text":"\u5f53\u7136\uff0c\u4f5c\u4e3aCS\u81ea\u5b66\u4e3b\u4e49\u7684\u5fe0\u5b9e\u62e5\u8db8\u8005\uff0c\u6211\u4e0d\u5f97\u4e0d\u627f\u8ba4\u81ea\u5b66\u4e5f\u6709\u5b83\u7684\u574f\u5904\u3002 \u7b2c\u4e00\u5c31\u662f\u4ea4\u6d41\u6c9f\u901a\u7684\u4e0d\u4fbf\u3002\u6211\u5176\u5b9e\u662f\u4e00\u4e2a\u5f88\u70ed\u8877\u4e8e\u63d0\u95ee\u7684\u4eba\uff0c\u5bf9\u4e8e\u6240\u6709\u6ca1\u6709\u5f04\u660e\u767d\u7684\u70b9\uff0c\u6211\u90fd\u559c\u6b22\u7a77\u8ffd\u5230\u5e95\u3002\u4f46\u5f53\u4f60\u9762\u5bf9\u7740\u5c4f\u5e55\u542c\u5230\u8001\u5e08\u8bb2\u4e86\u4e00\u4e2a\u4f60\u6ca1\u660e\u767d\u7684\u77e5\u8bc6\u70b9\u7684\u65f6\u5019\uff0c\u4f60\u65e0\u6cd5\u987a\u7740\u7f51\u7ebf\u5230\u53e6\u4e00\u7aef\u5411\u8001\u5e08\u95ee\u4e2a\u660e\u767d\u3002\u6211\u52aa\u529b\u901a\u8fc7\u72ec\u7acb\u601d\u8003\u548c\u5584\u7528Google\u6765\u7f13\u89e3\u8fd9\u4e00\u70b9\uff0c\u4f46\u662f\uff0c\u5982\u679c\u80fd\u6709\u51e0\u4e2a\u5fd7\u540c\u9053\u5408\u7684\u4f19\u4f34\u7ed3\u4f34\u81ea\u5b66\uff0c\u90a3\u5c06\u662f\u6781\u597d\u7684\u3002\u5173\u4e8e\u4ea4\u6d41\u7fa4\u7684\u5efa\u7acb\uff0c\u5927\u5bb6\u53ef\u4ee5\u53c2\u8003\u4ed3\u5e93README\u4e2d\u7684\u6559\u7a0b\u3002 \u7b2c\u4e8c\u5c31\u662f\u8fd9\u4e9b\u81ea\u5b66\u7684\u8bfe\u7a0b\u57fa\u672c\u90fd\u662f\u82f1\u6587\u7684\u3002\u4ece\u89c6\u9891\u5230slides\u5230\u4f5c\u4e1a\u5168\u662f\u82f1\u6587\uff0c\u6240\u4ee5\u6709\u4e00\u5b9a\u7684\u95e8\u69db\u3002\u4e0d\u8fc7\u6211\u89c9\u5f97\u8fd9\u4e2a\u6311\u6218\u5982\u679c\u4f60\u514b\u670d\u4e86\u7684\u8bdd\u5bf9\u4f60\u662f\u6781\u4e3a\u6709\u5229\u7684\u3002\u56e0\u4e3a\u5728\u5f53\u4e0b\uff0c\u867d\u7136\u6211\u5f88\u4e0d\u60c5\u613f\uff0c\u4f46\u4e5f\u4e0d\u5f97\u4e0d\u627f\u8ba4\uff0c\u5728\u8ba1\u7b97\u673a\u9886\u57df\uff0c\u5f88\u591a\u4f18\u8d28\u7684\u6587\u6863\u3001\u8bba\u575b\u3001\u7f51\u7ad9\u90fd\u662f\u5168\u82f1\u6587\u7684\u3002\u517b\u6210\u82f1\u6587\u9605\u8bfb\u7684\u4e60\u60ef\uff0c\u5728\u8d64\u65d7\u63d2\u904d\u4e16\u754c\u4e4b\u524d\uff0c\u8fd8\u662f\u6709\u4e00\u5b9a\u597d\u5904\u7684\uff08\u72d7\u5934\u4fdd\u547d\uff09\u3002 \u7b2c\u4e09\uff0c\u4e5f\u662f\u6211\u89c9\u5f97\u6700\u56f0\u96be\u7684\u4e00\u70b9\uff0c\u5c31\u662f\u81ea\u5f8b\u3002\u56e0\u4e3a\u6ca1\u6709DDL\u6709\u65f6\u5019\u771f\u7684\u662f\u4e00\u4ef6\u53ef\u6015\u7684\u4e8b\u60c5\uff0c\u7279\u522b\u662f\u968f\u7740\u5b66\u4e60\u7684\u6df1\u5165\uff0c\u56fd\u5916\u7684\u5f88\u591a\u8bfe\u7a0b\u662f\u76f8\u5f53\u8650\u7684\u3002\u4f60\u5f97\u6709\u8db3\u591f\u7684\u9a71\u52a8\u529b\u5f3a\u8feb\u81ea\u5df1\u9759\u4e0b\u5fc3\u6765\uff0c\u9605\u8bfb\u51e0\u5341\u9875\u7684Project Handout\uff0c\u7406\u89e3\u4e0a\u5343\u884c\u7684\u4ee3\u7801\u6846\u67b6\uff0c\u5fcd\u53d7\u6570\u4e2a\u5c0f\u65f6\u7684debug\u65f6\u5149\u3002\u800c\u8fd9\u4e00\u5207\uff0c\u6ca1\u6709\u5b66\u5206\uff0c\u6ca1\u6709\u7ee9\u70b9\uff0c\u6ca1\u6709\u8001\u5e08\uff0c\u6ca1\u6709\u540c\u5b66\uff0c\u53ea\u6709\u4e00\u4e2a\u4fe1\u5ff5 \u2014\u2014 \u4f60\u5728\u53d8\u5f3a\u3002","title":"\u81ea\u5b66\u7684\u574f\u5904"},{"location":"#_5","text":"\u6b63\u5982\u6211\u5728\u524d\u8a00\u91cc\u8bf4\u7684\uff0c\u4efb\u4f55\u6709\u5fd7\u4e8e\u81ea\u5b66\u8ba1\u7b97\u673a\u7684\u670b\u53cb\u90fd\u53ef\u4ee5\u53c2\u8003\u8fd9\u672c\u4e66\u3002\u5982\u679c\u4f60\u5df2\u7ecf\u6709\u4e86\u4e00\u5b9a\u7684\u8ba1\u7b97\u673a\u57fa\u7840\uff0c\u53ea\u662f\u5bf9\u67d0\u4e2a\u7279\u5b9a\u7684\u9886\u57df\u611f\u5174\u8da3\uff0c\u53ef\u4ee5\u9009\u62e9\u6027\u5730\u6311\u9009\u4f60\u611f\u5174\u8da3\u7684\u5185\u5bb9\u8fdb\u884c\u5b66\u4e60\u3002\u5f53\u7136\uff0c\u5982\u679c\u4f60\u662f\u4e00\u4e2a\u50cf\u6211\u5f53\u5e74\u4e00\u6837\u5bf9\u8ba1\u7b97\u673a\u4e00\u65e0\u6240\u77e5\u7684\u5c0f\u767d\uff0c\u521d\u5165\u5927\u5b66\u7684\u6821\u95e8\uff0c\u6211\u5e0c\u671b\u8fd9\u672c\u4e66\u80fd\u6210\u4e3a\u4f60\u7684\u653b\u7565\uff0c\u8ba9\u4f60\u82b1\u6700\u5c11\u7684\u65f6\u95f4\u638c\u63e1\u4f60\u6240\u9700\u8981\u7684\u77e5\u8bc6\u548c\u80fd\u529b\u3002\u67d0\u79cd\u7a0b\u5ea6\u4e0a\uff0c\u8fd9\u672c\u4e66\u66f4\u50cf\u662f\u4e00\u4e2a\u6839\u636e\u6211\u7684\u4f53\u9a8c\u6765\u6392\u5e8f\u7684\u8bfe\u7a0b\u641c\u7d22\u5f15\u64ce\uff0c\u5e2e\u52a9\u5927\u5bb6\u8db3\u4e0d\u51fa\u6237\uff0c\u4f53\u9a8c\u4e16\u754c\u9876\u7ea7\u540d\u6821\u7684\u8ba1\u7b97\u673a\u4f18\u8d28\u8bfe\u7a0b\u3002 \u5f53\u7136\uff0c\u4f5c\u4e3a\u4e00\u4e2a\u8fd8\u672a\u6bd5\u4e1a\u7684\u672c\u79d1\u751f\uff0c\u6211\u6df1\u611f\u81ea\u5df1\u6ca1\u6709\u80fd\u529b\u4e5f\u6ca1\u6709\u6743\u5229\u53bb\u5ba3\u626c\u4e00\u79cd\u5b66\u4e60\u65b9\u5f0f\uff0c\u6211\u53ea\u662f\u5e0c\u671b\u8fd9\u4efd\u8d44\u6599\u80fd\u8ba9\u90a3\u4e9b\u540c\u6837\u6709\u81ea\u5b66\u4e4b\u5fc3\u548c\u6bc5\u529b\u670b\u53cb\u53ef\u4ee5\u5c11\u8d70\u4e9b\u5f2f\u8def\uff0c\u6536\u83b7\u66f4\u4e30\u5bcc\u3001\u66f4\u591a\u6837\u3001\u66f4\u6ee1\u8db3\u7684\u5b66\u4e60\u4f53\u9a8c\u3002","title":"\u8fd9\u672c\u4e66\u9002\u5408\u8c01"},{"location":"#_6","text":"\u5728\u8fd9\u91cc\uff0c\u6211\u6000\u7740\u5d07\u656c\u4e4b\u5fc3\u771f\u8bda\u5730\u611f\u8c22\u6240\u6709\u5c06\u8bfe\u7a0b\u8d44\u6e90\u65e0\u507f\u5f00\u6e90\u7684\u5404\u4f4d\u6559\u6388\u4eec\u3002\u8fd9\u4e9b\u8bfe\u7a0b\u503e\u6ce8\u4e86\u4ed6\u4eec\u6570\u5341\u5e74\u6559\u5b66\u751f\u6daf\u7684\u79ef\u6dc0\u548c\u5fc3\u8840\uff0c\u4ed6\u4eec\u5374\u9009\u62e9\u65e0\u79c1\u5730\u8ba9\u6240\u6709\u4eba\u4eab\u53d7\u5230\u5982\u6b64\u9ad8\u8d28\u91cf\u7684CS\u6559\u80b2\u3002\u6ca1\u6709\u4ed6\u4eec\uff0c\u6211\u7684\u5927\u5b66\u751f\u6d3b\u4e0d\u4f1a\u8fd9\u6837\u5145\u5b9e\u800c\u5feb\u4e50\u3002\u5f88\u591a\u6559\u6388\u5728\u6211\u7ed9\u4ed6\u4eec\u53d1\u4e86\u611f\u8c22\u90ae\u4ef6\u4e4b\u540e\uff0c\u751a\u81f3\u4f1a\u56de\u590d\u4e0a\u767e\u5b57\u7684\u957f\u6587\uff0c\u771f\u7684\u8ba9\u6211\u65e0\u6bd4\u611f\u52a8\u3002\u4ed6\u4eec\u4e5f\u65f6\u523b\u6fc0\u52b1\u7740\u6211\uff0c\u505a\u4e00\u4ef6\u4e8b\uff0c\u5c31\u5f97\u7528\u5fc3\u505a\u597d\uff0c\u65e0\u8bba\u662f\u79d1\u7814\uff0c\u8fd8\u662f\u4e3a\u4eba\u3002","title":"\u7279\u522b\u9e23\u8c22"},{"location":"#_7","text":"\u4e00\u4e2a\u4eba\u7684\u529b\u91cf\u7ec8\u7a76\u662f\u6709\u9650\u7684\uff0c\u8fd9\u672c\u4e66\u4e5f\u662f\u6211\u5728\u7e41\u91cd\u7684\u79d1\u7814\u4e4b\u4f59\u71ac\u591c\u62bd\u7a7a\u5199\u51fa\u6765\u7684\uff0c\u96be\u514d\u6709\u4e0d\u591f\u5b8c\u5584\u4e4b\u5904\u3002\u53e6\u5916\uff0c\u7531\u4e8e\u4e2a\u4eba\u505a\u7684\u662f\u7cfb\u7edf\u65b9\u5411\uff0c\u5f88\u591a\u8bfe\u7a0b\u4fa7\u91cd\u7cfb\u7edf\u9886\u57df\uff0c\u5bf9\u4e8e\u6570\u5b66\u3001\u7406\u8bba\u8ba1\u7b97\u673a\u3001\u9ad8\u7ea7\u7b97\u6cd5\u76f8\u5173\u7684\u5185\u5bb9\u5219\u76f8\u5bf9\u5c11\u4e9b\u3002\u5982\u679c\u6709\u5927\u4f6c\u60f3\u5728\u5176\u4ed6\u9886\u57df\u5206\u4eab\u81ea\u5df1\u7684\u81ea\u5b66\u7ecf\u5386\u4e0e\u8d44\u6e90\uff0c\u53ef\u4ee5\u76f4\u63a5\u5728\u9879\u76ee\u4e2d\u53d1\u8d77Pull Request\uff0c\u4e5f\u6b22\u8fce\u548c\u6211\u90ae\u4ef6\u8054\u7cfb\uff08zhongyinmin@pku.edu.cn\uff09\u3002","title":"\u4f60\u4e5f\u60f3\u52a0\u5165\u5230\u8d21\u732e\u8005\u7684\u884c\u5217"},{"location":"#_8","text":"\u65b9\u6cd5\u53c2\u89c1\u4ed3\u5e93\u7684README.","title":"\u5173\u4e8e\u4ea4\u6d41\u7fa4\u7684\u5efa\u7acb"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/","text":"\u4e00\u4e2a\u4ec5\u4f9b\u53c2\u8003\u7684CS\u5b66\u4e60\u89c4\u5212 \u8ba1\u7b97\u673a\u9886\u57df\u65b9\u5411\u5e9e\u6742\uff0c\u77e5\u8bc6\u6d69\u5982\u70df\u6d77\uff0c\u6bcf\u4e2a\u7ec6\u5206\u9886\u57df\u5982\u679c\u6df1\u7a76\u4e0b\u53bb\u90fd\u53ef\u4ee5\u8bf4\u5b66\u65e0\u6b62\u5883\u3002\u56e0\u6b64\uff0c\u4e00\u4e2a\u6e05\u6670\u660e\u786e\u7684\u5b66\u4e60\u89c4\u5212\u662f\u975e\u5e38\u91cd\u8981\u7684\u3002\u8fd9\u4e00\u8282\u7684\u5185\u5bb9\u662f\u5bf9\u540e\u7eed\u6574\u672c\u4e66\u7684\u5185\u5bb9\u7684\u4e00\u4e2a\u6982\u89c8\uff0c\u4f60\u53ef\u4ee5\u5c06\u5176\u770b\u4f5c\u662f\u8fd9\u672c\u4e66\u7684\u76ee\u5f55\uff0c\u6309\u9700\u9009\u62e9\u81ea\u5df1\u611f\u5174\u8da3\u7684\u5185\u5bb9\u8fdb\u884c\u5b66\u4e60\u3002 \u4e0d\u8fc7\uff0c\u5728\u5f00\u59cb\u5b66\u4e60\u4e4b\u524d\uff0c\u5148\u5411\u5c0f\u767d\u4eec\u5f3a\u70c8\u63a8\u8350\u4e00\u4e2a\u79d1\u666e\u5411\u7cfb\u5217\u89c6\u9891 Crash Course: Computer Science \uff0c\u5728\u77ed\u77ed8\u4e2a\u5c0f\u65f6\u91cc\u975e\u5e38\u751f\u52a8\u4e14\u5168\u9762\u5730\u79d1\u666e\u4e86\u5173\u4e8e\u8ba1\u7b97\u673a\u79d1\u5b66\u7684\u65b9\u65b9\u9762\u9762\uff1a\u8ba1\u7b97\u673a\u7684\u5386\u53f2\u3001\u8ba1\u7b97\u673a\u662f\u5982\u4f55\u8fd0\u4f5c\u7684\u3001\u7ec4\u6210\u8ba1\u7b97\u673a\u7684\u5404\u4e2a\u91cd\u8981\u6a21\u5757\u3001\u8ba1\u7b97\u673a\u79d1\u5b66\u4e2d\u7684\u91cd\u8981\u601d\u60f3\u7b49\u7b49\u7b49\u7b49\u3002\u6b63\u5982\u5b83\u7684\u53e3\u53f7\u6240\u8bf4\u7684 Computers are not magic! \uff0c\u5e0c\u671b\u770b\u5b8c\u8fd9\u4e2a\u89c6\u9891\u4e4b\u540e\uff0c\u5927\u5bb6\u80fd\u5bf9\u8ba1\u7b97\u673a\u79d1\u5b66\u6709\u4e2a\u5168\u8c8c\u6027\u5730\u611f\u77e5\uff0c\u4ece\u800c\u6000\u7740\u5174\u8da3\u53bb\u9762\u5bf9\u4e0b\u9762\u6d69\u5982\u70df\u6d77\u7684\u66f4\u4e3a\u7ec6\u81f4\u4e14\u6df1\u5165\u7684\u5b66\u4e60\u5185\u5bb9\u3002 \u5fc5\u5b66\u5de5\u5177 \u4fd7\u8bdd\u8bf4\uff1a\u78e8\u5200\u4e0d\u8bef\u780d\u67f4\u5de5\u3002\u5982\u679c\u4f60\u662f\u4e00\u4e2a\u521a\u521a\u63a5\u89e6\u8ba1\u7b97\u673a\u768424k\u7eaf\u5c0f\u767d\uff0c\u5b66\u4f1a\u4e00\u4e9b\u5de5\u5177\u5c06\u4f1a\u8ba9\u4f60\u4e8b\u534a\u529f\u500d\u3002 MIT-Missing-Semester \u8fd9\u95e8\u8bfe\u8986\u76d6\u4e86\u8fd9\u4e9b\u5de5\u5177\u4e2d\u7edd\u5927\u90e8\u5206\uff0c\u800c\u4e14\u6709\u76f8\u5f53\u8be6\u7ec6\u7684\u4f7f\u7528\u6307\u5bfc\uff0c\u5f3a\u70c8\u5efa\u8bae\u5c0f\u767d\u5b66\u4e60\u3002 \u7ffb\u5899 \uff1a\u7531\u4e8e\u4e00\u4e9b\u4f17\u6240\u5468\u77e5\u7684\u539f\u56e0\uff0c\u8c37\u6b4c\u3001Github\u7b49\u7f51\u7ad9\u5728\u5927\u9646\u65e0\u6cd5\u8bbf\u95ee\u3002\u7136\u800c\u5f88\u591a\u65f6\u5019\uff0c\u8c37\u6b4c\u548cStackoverflow\u53ef\u4ee5\u89e3\u51b3\u4f60\u5728\u5f00\u53d1\u8fc7\u7a0b\u4e2d\u9047\u5230\u768495%\u7684\u95ee\u9898\u3002\u56e0\u6b64\uff0c\u5b66\u4f1a\u7ffb\u5899\u51e0\u4e4e\u662f\u4e00\u4e2a\u5185\u5730CSer\u7684\u5fc5\u5907\u6280\u80fd\u3002\uff08\u8003\u8651\u5230\u6cd5\u5f8b\u95ee\u9898\uff0c\u8fd9\u4e2a\u6587\u6863\u63d0\u4f9b\u7684\u7ffb\u5899\u65b9\u5f0f\u4ec5\u5bf9\u62e5\u6709\u5317\u5927\u90ae\u7bb1\u7684\u7528\u6237\u9002\u7528\uff09\u3002 IDE\uff08Integrated Development Environment\uff09\uff1a\u96c6\u6210\u5f00\u53d1\u73af\u5883\uff0c\u8bf4\u767d\u4e86\u5c31\u662f\u4f60\u5199\u4ee3\u7801\u7684\u5730\u65b9\u3002\u4f5c\u4e3a\u4e00\u4e2a\u7801\u519c\uff0cIDE\u7684\u91cd\u8981\u6027\u4e0d\u8a00\u800c\u55bb\uff0c\u4f46\u7531\u4e8e\u5f88\u591aIDE\u662f\u4e3a\u5927\u578b\u5de5\u7a0b\u9879\u76ee\u8bbe\u8ba1\u7684\uff0c\u4f53\u91cf\u8f83\u5927\uff0c\u529f\u80fd\u4e5f\u8fc7\u4e8e\u4e30\u5bcc\u3002\u5176\u5b9e\u5982\u4eca\u4e00\u4e9b\u8f7b\u4fbf\u7684\u6587\u672c\u7f16\u8f91\u5668\u914d\u5408\u4e30\u5bcc\u7684\u63d2\u4ef6\u751f\u6001\u57fa\u672c\u53ef\u4ee5\u6ee1\u8db3\u65e5\u5e38\u7684\u8f7b\u91cf\u7f16\u7a0b\u9700\u6c42\u3002\u4e2a\u4eba\u5e38\u7528\u7684\u7f16\u8f91\u5668\u662fVSCode\u548cSublime\uff08\u524d\u8005\u7684\u63d2\u4ef6\u914d\u7f6e\u975e\u5e38\u7b80\u5355\uff0c\u540e\u8005\u7565\u663e\u590d\u6742\u4f46\u989c\u503c\u5f88\u9ad8\uff09\u3002\u5f53\u7136\u5bf9\u4e8e\u5927\u578b\u9879\u76ee\u6211\u8fd8\u662f\u4f1a\u91c7\u7528\u7565\u91cd\u578b\u7684IDE\uff0c\u4f8b\u5982Pycharm\uff08Python\uff09\uff0cIDEA\uff08Java\uff09\u7b49\u7b49\uff08\u514d\u8d23\u7533\u660e\uff1a\u6240\u6709\u7684IDE\u90fd\u662f\u4e16\u754c\u4e0a\u6700\u597d\u7684IDE\uff09\u3002 Vim \uff1a\u4e00\u6b3e\u547d\u4ee4\u884c\u7f16\u8f91\u5de5\u5177\u3002\u8fd9\u662f\u4e00\u4e2a\u5b66\u4e60\u66f2\u7ebf\u6709\u4e9b\u9661\u5ced\u7684\u7f16\u8f91\u5668\uff0c\u4e0d\u8fc7\u5b66\u4f1a\u5b83\u6211\u89c9\u5f97\u662f\u975e\u5e38\u6709\u5fc5\u8981\u7684\uff0c\u56e0\u4e3a\u5b83\u5c06\u6781\u5927\u5730\u63d0\u9ad8\u4f60\u7684\u5f00\u53d1\u6548\u7387\u3002\u73b0\u5728\u7edd\u5927\u591a\u6570IDE\u4e5f\u90fd\u652f\u6301Vim\u63d2\u4ef6\uff0c\u8ba9\u4f60\u5728\u4eab\u53d7\u73b0\u4ee3\u5f00\u53d1\u73af\u5883\u7684\u540c\u65f6\u4fdd\u7559\u6781\u5ba2\u7684\u70ab\u9177\uff08yue\uff09\u3002 Git \uff1a\u4e00\u6b3e\u4ee3\u7801\u7248\u672c\u63a7\u5236\u5de5\u5177\u3002Git\u7684\u5b66\u4e60\u66f2\u7ebf\u53ef\u80fd\u66f4\u4e3a\u9661\u5ced\uff0c\u4f46\u51fa\u81eaLinux\u4e4b\u7236Linus\u4e4b\u624b\u7684Git\u7edd\u5bf9\u662f\u6bcf\u4e2a\u5b66CS\u7684\u7ae5\u978b\u5fc5\u987b\u638c\u63e1\u7684\u795e\u5668\u4e4b\u4e00\u3002 Github \uff1a\u57fa\u4e8eGit\u7684\u4ee3\u7801\u6258\u7ba1\u5e73\u53f0\u3002\u5168\u4e16\u754c\u6700\u5927\u7684\u4ee3\u7801\u5f00\u6e90\u793e\u533a\uff0c\u5927\u4f6c\u96c6\u805a\u5730\u3002 Makefile \uff1a\u4e00\u6b3e\u5de5\u7a0b\u6784\u5efa\u5de5\u5177\u3002\u5584\u7528Makefile\u4f1a\u8ba9\u4f60\u517b\u6210\u4ee3\u7801\u6a21\u5757\u5316\u7684\u4e60\u60ef\uff0c\u540c\u65f6\u4e5f\u80fd\u8ba9\u4f60\u719f\u6089\u4e00\u4e9b\u5927\u578b\u5de5\u7a0b\u7684\u7f16\u8bd1\u94fe\u63a5\u6d41\u7a0b\u3002 CMake \uff1a\u4e00\u6b3e\u529f\u80fd\u6bd4Makefile\u66f4\u4e3a\u5f3a\u5927\u7684\u6784\u5efa\u5de5\u5177\uff0c\u5efa\u8bae\u638c\u63e1Makefile\u4e4b\u540e\u518d\u52a0\u4ee5\u5b66\u4e60\u3002 LaTex \uff1a \u903c\u683c\u63d0\u5347 \u8bba\u6587\u6392\u7248\u5de5\u5177\u3002 Docker \uff1a\u4e00\u6b3e\u76f8\u8f83\u4e8e\u865a\u62df\u673a\u66f4\u8f7b\u91cf\u7ea7\u7684\u8f6f\u4ef6\u6253\u5305\u4e0e\u73af\u5883\u90e8\u7f72\u5de5\u5177\u3002 \u5b9e\u7528\u5de5\u5177\u7bb1 \uff1a\u9664\u4e86\u4e0a\u9762\u63d0\u5230\u7684\u8fd9\u4e9b\u5728\u5f00\u53d1\u4e2d\u4f7f\u7528\u9891\u7387\u6781\u9ad8\u7684\u5de5\u5177\u4e4b\u5916\uff0c\u6211\u8fd8\u6536\u96c6\u4e86\u5f88\u591a\u5b9e\u7528\u6709\u8da3\u7684\u514d\u8d39\u5de5\u5177\uff0c\u4f8b\u5982\u4e00\u4e9b\u4e0b\u8f7d\u5de5\u5177\u3001\u8bbe\u8ba1\u5de5\u5177\u3001\u5b66\u4e60\u7f51\u7ad9\u7b49\u7b49\u3002 \u597d\u4e66\u63a8\u8350 \u79c1\u4ee5\u4e3a\u4e00\u672c\u597d\u7684\u6559\u6750\u5e94\u5f53\u662f\u4ee5\u4eba\u4e3a\u672c\u7684\uff0c\u800c\u4e0d\u662f\u70ab\u6280\u5f0f\u7684\u7406\u8bba\u5806\u780c\u3002\u544a\u8bc9\u8bfb\u8005\u201c\u662f\u4ec0\u4e48\u201d\u56fa\u7136\u91cd\u8981\uff0c\u4f46\u66f4\u597d\u7684\u5e94\u5f53\u662f\u6559\u6750\u4f5c\u8005\u5c06\u5176\u5728\u8fd9\u4e2a\u9886\u57df\u6df1\u8015\u51e0\u5341\u5e74\u7684\u7ecf\u9a8c\u878d\u6c47\u8fdb\u4e66\u4e2d\uff0c\u5411\u8bfb\u8005\u5a13\u5a13\u9053\u6765\u201c\u4e3a\u4ec0\u4e48\u201d\u4ee5\u53ca\u672a\u6765\u5e94\u8be5\u201c\u600e\u4e48\u505a\u201d\u3002 \u94fe\u63a5\u6233\u8fd9\u91cc \u73af\u5883\u914d\u7f6e \u4f60\u4ee5\u4e3a\u7684\u5f00\u53d1 \u2014\u2014 \u5728IDE\u91cc\u75af\u72c2\u7801\u4ee3\u7801\u6570\u5c0f\u65f6\u3002 \u5b9e\u9645\u4e0a\u7684\u5f00\u53d1 \u2014\u2014 \u914d\u73af\u5883\u914d\u51e0\u5929\u8fd8\u6ca1\u5f00\u59cb\u5199\u4ee3\u7801\u3002 \u63a8\u8350\u4e00\u4e2a\u975e\u5e38\u4e0d\u9519\u7684Github\u9879\u76ee DevOps-Guide \uff0c\u5176\u4e2d\u6db5\u76d6\u4e86\u975e\u5e38\u591a\u7684\u8fd0\u7ef4\u65b9\u9762\u7684\u57fa\u7840\u77e5\u8bc6\u548c\u6559\u7a0b\uff0c\u4f8b\u5982Docker\uff0cK8s\uff0cLinux\uff0cCI-CD\uff0cGithub Actions\u7b49\u7b49\u3002 \u53e6\u5916\u5927\u5bb6\u53ef\u4ee5\u53c2\u8003\u4e00\u4efd\u7075\u611f\u6765\u81ea 6.NULL MIT-Missing-Semester \u7684 \u73af\u5883\u914d\u7f6e\u6307\u5357 \uff0c\u91cd\u70b9\u5728\u4e8e\u7ec8\u7aef\u7684\u7f8e\u5316\u914d\u7f6e\u3002\u6b64\u5916\u8fd8\u5305\u62ec\u5e38\u7528\u8f6f\u4ef6\u6e90\uff08\u5982 GitHub , Anaconda , pip \u7b49\uff09\u7684\u52a0\u901f\u4e0e\u66ff\u6362\u4ee5\u53ca\u4e00\u4e9bIDE\u7684\u914d\u7f6e\u4e0e\u6fc0\u6d3b\u6559\u7a0b\u3002 More contents under construction. \u8bfe\u7a0b\u5730\u56fe \u6b63\u5982\u8fd9\u7ae0\u5f00\u5934\u63d0\u5230\u7684\uff0c\u8fd9\u4efd\u8bfe\u7a0b\u5730\u56fe\u4ec5\u4ec5\u662f\u4e00\u4e2a \u4ec5\u4f9b\u53c2\u8003 \u7684\u8bfe\u7a0b\u89c4\u5212\uff0c\u6211\u4f5c\u4e3a\u4e00\u4e2a\u4e34\u8fd1\u6bd5\u4e1a\u7684\u672c\u79d1\u751f\u3002\u6df1\u611f\u81ea\u5df1\u6ca1\u6709\u6743\u5229\u4e5f\u6ca1\u6709\u80fd\u529b\u5411\u522b\u4eba\u5ba3\u626c\u201c\u5e94\u8be5\u600e\u4e48\u5b66\u201d\u3002\u56e0\u6b64\u5982\u679c\u4f60\u89c9\u5f97\u4ee5\u4e0b\u7684\u8bfe\u7a0b\u5206\u7c7b\u4e0e\u9009\u62e9\u6709\u4e0d\u5408\u7406\u4e4b\u5904\uff0c\u6211\u5168\u76d8\u63a5\u53d7\uff0c\u5e76\u6df1\u611f\u62b1\u6b49\u3002\u4f60\u53ef\u4ee5\u5728\u4e0b\u4e00\u8282 \u5b9a\u5236\u5c5e\u4e8e\u4f60\u7684\u8bfe\u7a0b\u5730\u56fe \u4ee5\u4e0b\u8bfe\u7a0b\u7c7b\u522b\u4e2d\u9664\u4e86\u542b\u6709 \u57fa\u7840 \u548c \u5165\u95e8 \u5b57\u773c\u7684\u4ee5\u5916\uff0c\u5e76\u65e0\u660e\u786e\u7684\u5148\u540e\u6b21\u5e8f\uff0c\u5927\u5bb6\u53ea\u8981\u6ee1\u8db3\u67d0\u4e2a\u8bfe\u7a0b\u7684\u5148\u4fee\u8981\u6c42\uff0c\u5b8c\u5168\u53ef\u4ee5\u6839\u636e\u81ea\u5df1\u7684\u9700\u8981\u548c\u559c\u597d\u9009\u62e9\u60f3\u8981\u5b66\u4e60\u7684\u8bfe\u7a0b\u3002 \u53e6\u5916\u7531\u4e8e\u8d21\u732e\u8005\u7684\u4e0d\u65ad\u589e\u52a0\uff0c\u8fd9\u4efd\u8bfe\u7a0b\u5730\u56fe\u5df2\u7ecf\u4ece\u6700\u521d\u6211\u7684\u5b66\u4e60\u7ecf\u5386\uff0c\u53d1\u5c55\u6210\u4e3a\u5f88\u591aCS\u81ea\u5b66\u8005\u7684\u8d44\u6e90\u5408\u96c6\uff0c\u5176\u4e2d\u96be\u514d\u6709\u5185\u5bb9\u4ea4\u53c9\u751a\u81f3\u91cd\u590d\u7684\u3002\u4f46\u4e4b\u6240\u4ee5\u90fd\u5217\u51fa\u6765\uff0c\u8fd8\u662f\u5e0c\u671b\u96c6\u767e\u5bb6\u4e4b\u957f\uff0c\u7ed9\u5927\u5bb6\u5c3d\u53ef\u80fd\u591a\u7684\u9009\u62e9\u4e0e\u53c2\u8003\u3002 \u6570\u5b66\u57fa\u7840 \u5fae\u79ef\u5206\u4e0e\u7ebf\u6027\u4ee3\u6570 \u4f5c\u4e3a\u5927\u4e00\u65b0\u751f\uff0c\u5b66\u597d\u5fae\u79ef\u5206\u7ebf\u4ee3\u662f\u548c\u5199\u4ee3\u7801\u81f3\u5c11\u540c\u7b49\u91cd\u8981\u7684\u4e8b\u60c5\uff0c\u76f8\u4fe1\u5df2\u7ecf\u6709\u65e0\u6570\u7684\u524d\u4eba\u7ecf\u9a8c\u63d0\u5230\u8fc7\u8fd9\u4e00\u70b9\uff0c\u4f46\u6211\u8fd8\u662f\u8981\u4e0d\u538c\u5176\u70e6\u5730\u518d\u5f3a\u8c03\u4e00\u904d\uff1a\u5b66\u597d\u5fae\u79ef\u5206\u7ebf\u4ee3\u771f\u7684\u5f88\u91cd\u8981\uff01\u4f60\u4e5f\u8bb8\u4f1a\u5410\u69fd\u8fd9\u4e9b\u4e1c\u897f\u5c82\u4e0d\u662f\u8003\u5b8c\u5c31\u5fd8\uff0c\u90a3\u6211\u89c9\u5f97\u4f60\u662f\u5e76\u6ca1\u6709\u628a\u63e1\u4f4f\u5b83\u4eec\u672c\u8d28\uff0c\u5bf9\u5b83\u4eec\u7684\u7406\u89e3\u8fd8\u6ca1\u6709\u8fbe\u5230\u523b\u9aa8\u94ed\u5fc3\u7684\u7a0b\u5ea6\u3002\u5982\u679c\u89c9\u5f97\u8001\u5e08\u8bfe\u4e0a\u8bb2\u7684\u5185\u5bb9\u6666\u6da9\u96be\u61c2\uff0c\u4e0d\u59a8\u53c2\u8003MIT\u7684 Calculus Course \u548c 18.06: Linear Algebra \u7684\u8bfe\u7a0bnotes\uff0c\u81f3\u5c11\u4e8e\u6211\u800c\u8a00\uff0c\u5b83\u5e2e\u52a9\u6211\u6df1\u523b\u7406\u89e3\u4e86\u5fae\u79ef\u5206\u548c\u7ebf\u6027\u4ee3\u6570\u7684\u8bb8\u591a\u672c\u8d28\u3002\u987a\u9053\u518d\u5b89\u5229\u4e00\u4e2a\u6cb9\u7ba1\u6570\u5b66\u7f51\u7ea2 3Blue1Brown \uff0c\u4ed6\u7684\u9891\u9053\u6709\u5f88\u591a\u7528\u751f\u52a8\u5f62\u8c61\u7684\u52a8\u753b\u9610\u91ca\u6570\u5b66\u672c\u8d28\u5185\u6838\u7684\u89c6\u9891\uff0c\u517c\u5177\u6df1\u5ea6\u548c\u5e7f\u5ea6\uff0c\u8d28\u91cf\u975e\u5e38\u9ad8\u3002 \u4fe1\u606f\u8bba\u5165\u95e8 \u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u53ca\u65e9\u4e86\u89e3\u4e00\u4e9b\u4fe1\u606f\u8bba\u7684\u57fa\u7840\u77e5\u8bc6\uff0c\u6211\u89c9\u5f97\u662f\u5927\u6709\u88e8\u76ca\u7684\u3002\u4f46\u5927\u591a\u4fe1\u606f\u8bba\u8bfe\u7a0b\u90fd\u9762\u5411\u9ad8\u5e74\u7ea7\u672c\u79d1\u751f\u751a\u81f3\u7814\u7a76\u751f\uff0c\u5bf9\u65b0\u624b\u6781\u4e0d\u53cb\u597d\u3002\u800cMIT\u7684 6.050J: Information theory and Entropy \u8fd9\u95e8\u8bfe\u6b63\u662f\u4e3a\u5927\u4e00\u65b0\u751f\u91cf\u8eab\u5b9a\u5236\u7684\uff0c\u51e0\u4e4e\u6ca1\u6709\u5148\u4fee\u8981\u6c42\uff0c\u6db5\u76d6\u4e86\u7f16\u7801\u3001\u538b\u7f29\u3001\u901a\u4fe1\u3001\u4fe1\u606f\u71b5\u7b49\u7b49\u5185\u5bb9\uff0c\u975e\u5e38\u6709\u8da3\u3002 \u6570\u5b66\u8fdb\u9636 \u79bb\u6563\u6570\u5b66\u4e0e\u6982\u7387\u8bba \u96c6\u5408\u8bba\u3001\u56fe\u8bba\u3001\u6982\u7387\u8bba\u7b49\u7b49\u662f\u7b97\u6cd5\u63a8\u5bfc\u4e0e\u8bc1\u660e\u7684\u91cd\u8981\u5de5\u5177\uff0c\u4e5f\u662f\u540e\u7eed\u9ad8\u9636\u6570\u5b66\u8bfe\u7a0b\u7684\u57fa\u7840\u3002\u4f46\u6211\u89c9\u5f97\u8fd9\u7c7b\u8bfe\u7a0b\u7684\u8bb2\u6388\u5f88\u5bb9\u6613\u843d\u5165\u7406\u8bba\u5316\u4e0e\u5f62\u5f0f\u5316\u7684\u7aa0\u81fc\uff0c\u8ba9\u8bfe\u5802\u6210\u4e3a\u5b9a\u7406\u7ed3\u8bba\u7684\u5806\u780c\uff0c\u800c\u65e0\u6cd5\u4f7f\u5b66\u751f\u6df1\u523b\u628a\u63e1\u7406\u8bba\u7684\u672c\u8d28\uff0c\u8fdb\u800c\u9020\u6210\u5b66\u4e86\u5c31\u80cc\uff0c\u8003\u4e86\u5c31\u5fd8\u7684\u602a\u5708\u3002\u5982\u679c\u80fd\u5728\u7406\u8bba\u6559\u5b66\u4e2d\u7a7f\u63d2\u7b97\u6cd5\u8fd0\u7528\u5b9e\u4f8b\uff0c\u5b66\u751f\u5728\u62d3\u5c55\u7b97\u6cd5\u77e5\u8bc6\u7684\u540c\u65f6\u4e5f\u80fd\u7aa5\u89c1\u7406\u8bba\u7684\u529b\u91cf\u548c\u9b45\u529b\u3002 UCB CS70 : discrete Math and probability theory \u548c UCB CS126 : Probability theory \u662fUC Berkeley\u7684\u6982\u7387\u8bba\u8bfe\u7a0b\uff0c\u524d\u8005\u8986\u76d6\u4e86\u79bb\u6563\u6570\u5b66\u548c\u6982\u7387\u8bba\u57fa\u7840\uff0c\u540e\u8005\u5219\u6d89\u53ca\u968f\u673a\u8fc7\u7a0b\u4ee5\u53ca\u6df1\u5165\u7684\u7406\u8bba\u5185\u5bb9\u3002\u4e24\u8005\u90fd\u975e\u5e38\u6ce8\u91cd\u7406\u8bba\u548c\u5b9e\u8df5\u7684\u7ed3\u5408\uff0c\u6709\u4e30\u5bcc\u7684\u7b97\u6cd5\u5b9e\u9645\u8fd0\u7528\u5b9e\u4f8b\uff0c\u540e\u8005\u8fd8\u6709\u5927\u91cf\u7684Python\u7f16\u7a0b\u4f5c\u4e1a\u6765\u8ba9\u5b66\u751f\u8fd0\u7528\u6982\u7387\u8bba\u7684\u77e5\u8bc6\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\u3002 \u6570\u503c\u5206\u6790 \u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u57f9\u517b\u8ba1\u7b97\u601d\u7ef4\u662f\u5f88\u91cd\u8981\u7684\uff0c\u5b9e\u9645\u95ee\u9898\u7684\u5efa\u6a21\u3001\u79bb\u6563\u5316\uff0c\u8ba1\u7b97\u673a\u7684\u6a21\u62df\u3001\u5206\u6790\uff0c\u662f\u4e00\u9879\u5f88\u91cd\u8981\u7684\u80fd\u529b\u3002\u800c\u8fd9\u4e24\u5e74\u5f00\u59cb\u98ce\u9761\u7684\uff0c\u7531MIT\u6253\u9020\u7684 Julia \u7f16\u7a0b\u8bed\u8a00\u4ee5\u5176C\u4e00\u6837\u7684\u901f\u5ea6\u548cPython\u4e00\u6837\u53cb\u597d\u7684\u8bed\u6cd5\u5728\u6570\u503c\u8ba1\u7b97\u9886\u57df\u6709\u4e00\u7edf\u5929\u4e0b\u4e4b\u52bf\uff0cMIT\u7684\u8bb8\u591a\u6570\u5b66\u8bfe\u7a0b\u4e5f\u5f00\u59cb\u7528Julia\u4f5c\u4e3a\u6559\u5b66\u5de5\u5177\uff0c\u628a\u8270\u6df1\u7684\u6570\u5b66\u7406\u8bba\u7528\u76f4\u89c2\u6e05\u6670\u7684\u4ee3\u7801\u5c55\u793a\u51fa\u6765\u3002 ComputationalThinking \u662fMIT\u5f00\u8bbe\u7684\u4e00\u95e8\u8ba1\u7b97\u601d\u7ef4\u5165\u95e8\u8bfe\uff0c\u6240\u6709\u8bfe\u7a0b\u5185\u5bb9\u5168\u90e8\u5f00\u6e90\uff0c\u53ef\u4ee5\u5728\u8bfe\u7a0b\u7f51\u7ad9\u76f4\u63a5\u8bbf\u95ee\u3002\u8fd9\u95e8\u8bfe\u5229\u7528Julia\u7f16\u7a0b\u8bed\u8a00\uff0c\u5728\u56fe\u50cf\u5904\u7406\u3001\u793e\u4f1a\u79d1\u5b66\u4e0e\u6570\u636e\u79d1\u5b66\u3001\u6c14\u5019\u5b66\u5efa\u6a21\u4e09\u4e2atopic\u4e0b\u5e26\u9886\u5b66\u751f\u7406\u89e3\u7b97\u6cd5\u3001\u6570\u5b66\u5efa\u6a21\u3001\u6570\u636e\u5206\u6790\u3001\u4ea4\u4e92\u8bbe\u8ba1\u3001\u56fe\u4f8b\u5c55\u793a\uff0c\u8ba9\u5b66\u751f\u4f53\u9a8c\u8ba1\u7b97\u4e0e\u79d1\u5b66\u7684\u7f8e\u5999\u7ed3\u5408\u3002\u5185\u5bb9\u867d\u7136\u4e0d\u96be\uff0c\u4f46\u7ed9\u6211\u6700\u6df1\u523b\u7684\u611f\u53d7\u5c31\u662f\uff0c\u79d1\u5b66\u7684\u9b45\u529b\u5e76\u4e0d\u662f\u6545\u5f04\u7384\u865a\u7684\u8270\u6df1\u7406\u8bba\uff0c\u4e0d\u662f\u8bd8\u5c48\u8071\u7259\u7684\u672f\u8bed\u884c\u8bdd\uff0c\u800c\u662f\u7528\u76f4\u89c2\u751f\u52a8\u7684\u6848\u4f8b\uff0c\u7528\u7b80\u7ec3\u6df1\u523b\u7684\u8bed\u8a00\uff0c\u8ba9\u6bcf\u4e2a\u666e\u901a\u4eba\u90fd\u80fd\u7406\u89e3\u3002 \u4e0a\u5b8c\u4e0a\u9762\u7684\u4f53\u9a8c\u8bfe\u4e4b\u540e\uff0c\u5982\u679c\u610f\u72b9\u672a\u5c3d\u7684\u8bdd\uff0c\u4e0d\u59a8\u8bd5\u8bd5MIT\u7684 18.330 : Introduction to numerical analysis \uff0c\u8fd9\u95e8\u8bfe\u7684\u7f16\u7a0b\u4f5c\u4e1a\u540c\u6837\u4f1a\u7528Julia\u7f16\u7a0b\u8bed\u8a00\uff0c\u4e0d\u8fc7\u96be\u5ea6\u548c\u6df1\u5ea6\u4e0a\u90fd\u4e0a\u4e86\u4e00\u4e2a\u53f0\u9636\u3002\u5185\u5bb9\u6d89\u53ca\u4e86\u6d6e\u70b9\u7f16\u7801\u3001Root finding\u3001\u7ebf\u6027\u7cfb\u7edf\u3001\u5fae\u5206\u65b9\u7a0b\u7b49\u7b49\u65b9\u9762\uff0c\u6574\u95e8\u8bfe\u7684\u4e3b\u65e8\u5c31\u662f\u8ba9\u4f60\u5229\u7528\u79bb\u6563\u5316\u7684\u8ba1\u7b97\u673a\u8868\u793a\u53bb\u4f30\u8ba1\u548c\u903c\u8fd1\u4e00\u4e2a\u6570\u5b66\u4e0a\u8fde\u7eed\u7684\u6982\u5ff5\u3002\u8fd9\u95e8\u8bfe\u7684\u6559\u6388\u8fd8\u4e13\u95e8\u64b0\u5199\u4e86\u4e00\u672c\u914d\u5957\u7684\u5f00\u6e90\u6559\u6750 Fundamentals of Numerical Computation \uff0c\u91cc\u9762\u9644\u6709\u4e30\u5bcc\u7684Julia\u4ee3\u7801\u5b9e\u4f8b\u548c\u4e25\u8c28\u7684\u516c\u5f0f\u63a8\u5bfc\u3002 \u5982\u679c\u4f60\u8fd8\u610f\u72b9\u672a\u5c3d\u7684\u8bdd\uff0c\u8fd8\u6709MIT\u7684\u7814\u7a76\u751f\u8bfe\u7a0b 18.335: Introduction to numerical method \u4f9b\u4f60\u53c2\u8003\u3002 \u5fae\u5206\u65b9\u7a0b \u5982\u679c\u4e16\u95f4\u4e07\u7269\u7684\u8fd0\u52a8\u53d1\u5c55\u90fd\u80fd\u7528\u65b9\u7a0b\u6765\u523b\u753b\u548c\u63cf\u8ff0\uff0c\u8fd9\u662f\u4e00\u4ef6\u591a\u4e48\u9177\u7684\u4e8b\u60c5\u5440\uff01\u867d\u7136\u51e0\u4e4e\u4efb\u4f55\u4e00\u6240\u5b66\u6821\u7684CS\u57f9\u517b\u65b9\u6848\u4e2d\u90fd\u6ca1\u6709\u5fae\u5206\u65b9\u7a0b\u76f8\u5173\u7684\u5fc5\u4fee\u8bfe\u7a0b\uff0c\u4f46\u6211\u8fd8\u662f\u89c9\u5f97\u638c\u63e1\u5b83\u4f1a\u8d4b\u4e88\u4f60\u4e00\u4e2a\u65b0\u7684\u89c6\u89d2\u6765\u5ba1\u89c6\u8fd9\u4e2a\u4e16\u754c\u3002 \u7531\u4e8e\u5fae\u5206\u65b9\u7a0b\u4e2d\u5f80\u5f80\u4f1a\u7528\u5230\u5f88\u591a\u590d\u53d8\u51fd\u6570\u7684\u77e5\u8bc6\uff0c\u6240\u4ee5\u5927\u5bb6\u53ef\u4ee5\u53c2\u8003 MIT18.04: Complex variables functions \u7684\u8bfe\u7a0bnotes\u6765\u8865\u9f50\u5148\u4fee\u77e5\u8bc6\u3002 MIT18.03: differential equations \u4e3b\u8981\u8986\u76d6\u4e86\u5e38\u5fae\u5206\u65b9\u7a0b\u7684\u6c42\u89e3\uff0c\u5728\u6b64\u57fa\u7840\u4e4b\u4e0a MIT18.152: Partial differential equations \u5219\u4f1a\u6df1\u5165\u504f\u5fae\u5206\u65b9\u7a0b\u7684\u5efa\u6a21\u4e0e\u6c42\u89e3\u3002\u638c\u63e1\u4e86\u5fae\u5206\u65b9\u7a0b\u8fd9\u4e00\u6709\u5229\u5de5\u5177\uff0c\u76f8\u4fe1\u5bf9\u4e8e\u4f60\u7684\u5b9e\u9645\u95ee\u9898\u7684\u5efa\u6a21\u80fd\u529b\u4ee5\u53ca\u4ece\u4f17\u591a\u566a\u58f0\u53d8\u91cf\u4e2d\u628a\u63e1\u672c\u8d28\u7684\u76f4\u89c9\u90fd\u4f1a\u6709\u5f88\u5927\u5e2e\u52a9\u3002 \u6570\u5b66\u9ad8\u9636 \u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u6211\u7ecf\u5e38\u542c\u5230\u6570\u5b66\u65e0\u7528\u8bba\u7684\u8bba\u65ad\uff0c\u5bf9\u6b64\u6211\u4e0d\u6562\u82df\u540c\u4f46\u4e5f\u65e0\u6743\u53cd\u5bf9\uff0c\u4f46\u82e5\u51e1\u4e8b\u90fd\u786c\u8981\u4e89\u51fa\u4e2a\u6709\u7528\u548c\u65e0\u7528\u7684\u533a\u522b\u6765\uff0c\u5012\u4e5f\u7740\u5b9e\u65e0\u8da3\uff0c\u56e0\u6b64\u4e0b\u9762\u8fd9\u4e9b\u9762\u5411\u9ad8\u5e74\u7ea7\u751a\u81f3\u7814\u7a76\u751f\u7684\u6570\u5b66\u8bfe\u7a0b\uff0c\u5927\u5bb6\u6309\u5174\u8da3\u81ea\u53d6\u6240\u9700\u3002 \u51f8\u4f18\u5316 Standford EE364A: Convex Optimization \u4fe1\u606f\u8bba MIT6.441: Information Theory \u5e94\u7528\u7edf\u8ba1\u5b66 MIT18.650: Statistics for Applications \u521d\u7b49\u6570\u8bba MIT18.781: Theory of Numbers \u5bc6\u7801\u5b66 Standford CS255: Cryptography \u7f16\u7a0b\u5165\u95e8 Languages are tools, you choose the right tool to do the right thing. Since there's no universally perfect tool, there's no universally perfect language. Shell MIT-Missing-Semester Python Harvard CS50: This is CS50x \u6700\u597d\u7684\u8ba1\u7b97\u673a\u57fa\u7840\u5165\u95e8\u8bfe\uff0c\u4f60\u7edd\u5bf9\u4f1a\u7231\u4e0a\u7684\u3002 UCB CS61A: Structure and Interpretation of Computer Programs C++ Stanford CS106L: Standard C++ Programming Rust Stanford CS110L: Safety in Systems Programming OCaml Cornell CS3110 textbook: Functional Programming in OCaml \u7535\u5b50\u57fa\u7840 \u7535\u8def\u57fa\u7840 \u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u4e86\u89e3\u4e00\u4e9b\u57fa\u7840\u7684\u7535\u8def\u77e5\u8bc6\uff0c\u611f\u53d7\u4ece\u4f20\u611f\u5668\u6536\u96c6\u6570\u636e\u5230\u6570\u636e\u5206\u6790\u518d\u5230\u7b97\u6cd5\u9884\u6d4b\u6574\u6761\u6d41\u6c34\u7ebf\uff0c\u5bf9\u4e8e\u540e\u7eed\u77e5\u8bc6\u7684\u5b66\u4e60\u4ee5\u53ca\u8ba1\u7b97\u601d\u7ef4\u7684\u57f9\u517b\u8fd8\u662f\u5f88\u6709\u5e2e\u52a9\u7684\u3002 EE16A&B: Designing Information Devices and Systems I&II \u662f\u4f2f\u514b\u5229EE\u5b66\u751f\u7684\u5927\u4e00\u5165\u95e8\u8bfe\uff0c\u5176\u4e2dEE16A\u6ce8\u91cd\u901a\u8fc7\u7535\u8def\u4ece\u5b9e\u9645\u73af\u5883\u4e2d\u6536\u96c6\u548c\u5206\u6790\u6570\u636e\uff0c\u800cEE16B\u5219\u4fa7\u91cd\u4ece\u8fd9\u4e9b\u6536\u96c6\u5230\u7684\u6570\u636e\u8fdb\u884c\u5206\u6790\u5e76\u505a\u51fa\u9884\u6d4b\u884c\u4e3a\u3002 \u4fe1\u53f7\u4e0e\u7cfb\u7edf \u4fe1\u53f7\u4e0e\u7cfb\u7edf\u662f\u4e00\u95e8\u6211\u89c9\u5f97\u975e\u5e38\u503c\u5f97\u4e00\u4e0a\u7684\u8bfe\uff0c\u6700\u521d\u5b66\u5b83\u53ea\u662f\u4e3a\u4e86\u6ee1\u8db3\u6211\u5bf9\u5085\u91cc\u53f6\u53d8\u6362\u7684\u597d\u5947\uff0c\u4f46\u5b66\u5b8c\u4e4b\u540e\u6211\u624d\u4e0d\u7981\u611f\u53f9\uff0c\u5085\u7acb\u53f6\u53d8\u6362\u7ed9\u6211\u63d0\u4f9b\u4e86\u4e00\u4e2a\u5168\u65b0\u7684\u89c6\u89d2\u53bb\u770b\u5f85\u8fd9\u4e2a\u4e16\u754c\uff0c\u5c31\u5982\u540c\u5fae\u5206\u65b9\u7a0b\u4e00\u6837\uff0c\u8ba9\u4f60\u6c89\u6d78\u5728\u7528\u6570\u5b66\u53bb\u7cbe\u786e\u63cf\u7ed8\u548c\u523b\u753b\u8fd9\u4e2a\u4e16\u754c\u7684\u4f18\u96c5\u4e0e\u795e\u5947\u4e4b\u4e2d\u3002 MIT 6.003 : signal and systems \u63d0\u4f9b\u4e86\u5168\u90e8\u7684\u8bfe\u7a0b\u5f55\u5f71\u3001\u4e66\u9762\u4f5c\u4e1a\u4ee5\u53ca\u7b54\u6848\u3002\u4e5f\u53ef\u4ee5\u53bb\u770b\u8fd9\u95e8\u8bfe\u7684 \u8fdc\u53e4\u7248\u672c \u800c UCB EE120 : Signal and Systems \u5173\u4e8e\u5085\u7acb\u53f6\u53d8\u6362\u7684notes\u5199\u5f97\u975e\u5e38\u597d\uff0c\u5e76\u4e14\u63d0\u4f9b\u4e866\u4e2a\u975e\u5e38\u6709\u8da3\u7684Python\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u8ba9\u4f60\u5b9e\u8df5\u4e2d\u8fd0\u7528\u4fe1\u53f7\u4e0e\u7cfb\u7edf\u7684\u7406\u8bba\u4e0e\u7b97\u6cd5\u3002 \u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5 \u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5 Stanford CS106B/X: Programming Abstractions UCB CS61B: Data Structures and Algorithms Coursera: Algorithms I & II \u7b97\u6cd5\u8bbe\u8ba1\u4e0e\u5206\u6790 UCB CS170: Efficient Algorithms and Intractable Problems \u8f6f\u4ef6\u5de5\u7a0b \u5165\u95e8\u8bfe \u4e00\u4efd\u201c\u80fd\u8dd1\u201d\u7684\u4ee3\u7801\uff0c\u548c\u4e00\u4efd\u9ad8\u8d28\u91cf\u7684\u5de5\u4e1a\u7ea7\u4ee3\u7801\u662f\u6709\u672c\u8d28\u533a\u522b\u7684\u3002\u56e0\u6b64\u6211\u975e\u5e38\u63a8\u8350\u4f4e\u5e74\u7ea7\u7684\u540c\u5b66\u5b66\u4e60\u4e00\u4e0b MIT 6.031: Software Construction \u8fd9\u95e8\u8bfe\uff0c\u5b83\u4f1a\u4ee5Java\u8bed\u8a00\u4e3a\u57fa\u7840\uff0c\u4ee5\u4e30\u5bcc\u7ec6\u81f4\u7684\u9605\u8bfb\u6750\u6599\u548c\u7cbe\u5fc3\u8bbe\u8ba1\u7684\u7f16\u7a0b\u7ec3\u4e60\u4f20\u6388\u5982\u4f55\u7f16\u5199 \u4e0d\u6613\u51fabug\u3001\u7b80\u660e\u6613\u61c2\u3001\u6613\u4e8e\u7ef4\u62a4\u4fee\u6539 \u7684\u9ad8\u8d28\u91cf\u4ee3\u7801\u3002\u5927\u5230\u5b8f\u89c2\u6570\u636e\u7ed3\u6784\u8bbe\u8ba1\uff0c\u5c0f\u5230\u5982\u4f55\u5199\u6ce8\u91ca\uff0c\u9075\u5faa\u8fd9\u4e9b\u524d\u4eba\u603b\u7ed3\u7684\u7ec6\u8282\u548c\u7ecf\u9a8c\uff0c\u5bf9\u4e8e\u4f60\u6b64\u540e\u7684\u7f16\u7a0b\u751f\u6daf\u5927\u6709\u88e8\u76ca\u3002 \u4e13\u4e1a\u8bfe \u5f53\u7136\uff0c\u5982\u679c\u4f60\u60f3\u7cfb\u7edf\u6027\u5730\u4e0a\u4e00\u95e8\u8f6f\u4ef6\u5de5\u7a0b\u7684\u8bfe\u7a0b\uff0c\u90a3\u6211\u63a8\u8350\u7684\u662f\u4f2f\u514b\u5229\u7684 UCB CS169: software engineering \u3002\u4f46\u9700\u8981\u63d0\u9192\u7684\u662f\uff0c\u548c\u5927\u591a\u5b66\u6821\uff08\u5305\u62ec\u8d35\u6821\uff09\u7684\u8f6f\u4ef6\u5de5\u7a0b\u8bfe\u7a0b\u4e0d\u540c\uff0c\u8fd9\u95e8\u8bfe\u4e0d\u4f1a\u6d89\u53ca\u4f20\u7edf\u7684 design and document \u6a21\u5f0f\uff0c\u5373\u5f3a\u8c03\u5404\u79cd\u7c7b\u56fe\u3001\u6d41\u7a0b\u56fe\u53ca\u6587\u6863\u8bbe\u8ba1\uff0c\u800c\u662f\u91c7\u7528\u8fd1\u4e9b\u5e74\u6d41\u884c\u8d77\u6765\u7684\u5c0f\u56e2\u961f\u5feb\u901f\u8fed\u4ee3 Agile Develepment \u5f00\u53d1\u6a21\u5f0f\u4ee5\u53ca\u5229\u7528\u4e91\u5e73\u53f0\u7684 Software as a service \u670d\u52a1\u6a21\u5f0f\u3002 \u4f53\u7cfb\u7ed3\u6784 \u5165\u95e8\u8bfe \u4ece\u5c0f\u6211\u5c31\u4e00\u76f4\u542c\u8bf4\uff0c\u8ba1\u7b97\u673a\u7684\u4e16\u754c\u662f\u753101\u6784\u6210\u7684\uff0c\u6211\u4e0d\u7406\u89e3\u4f46\u5927\u53d7\u9707\u64bc\u3002\u5982\u679c\u4f60\u7684\u5185\u5fc3\u4e5f\u6000\u6709\u8fd9\u4efd\u597d\u5947\uff0c\u4e0d\u59a8\u82b1\u4e00\u5230\u4e24\u4e2a\u6708\u7684\u65f6\u95f4\u5b66\u4e60 Coursera: Nand2Tetris \u8fd9\u95e8\u65e0\u95e8\u69db\u7684\u8ba1\u7b97\u673a\u8bfe\u7a0b\u3002\u8fd9\u95e8\u9ebb\u96c0\u867d\u5c0f\u4e94\u810f\u4ff1\u5168\u7684\u8bfe\u7a0b\u4f1a\u4ece01\u5f00\u59cb\u8ba9\u4f60\u4eb2\u624b\u9020\u51fa\u4e00\u53f0\u8ba1\u7b97\u673a\uff0c\u5e76\u5728\u4e0a\u9762\u8fd0\u884c\u4fc4\u7f57\u65af\u65b9\u5757\u5c0f\u6e38\u620f\u3002\u4e00\u95e8\u8bfe\u91cc\u6db5\u76d6\u4e86\u7f16\u8bd1\u3001\u865a\u62df\u673a\u3001\u6c47\u7f16\u3001\u4f53\u7cfb\u7ed3\u6784\u3001\u6570\u5b57\u7535\u8def\u3001\u903b\u8f91\u95e8\u7b49\u7b49\u4ece\u4e0a\u81f3\u4e0b\u3001\u4ece\u8f6f\u81f3\u786c\u7684\u5404\u7c7b\u77e5\u8bc6\uff0c\u975e\u5e38\u5168\u9762\u3002\u96be\u5ea6\u4e0a\u4e5f\u662f\u901a\u8fc7\u7cbe\u5fc3\u7684\u8bbe\u8ba1\uff0c\u7565\u53bb\u4e86\u4f17\u591a\u73b0\u4ee3\u8ba1\u7b97\u673a\u590d\u6742\u7684\u7ec6\u8282\uff0c\u63d0\u53d6\u51fa\u4e86\u6700\u6838\u5fc3\u672c\u8d28\u7684\u4e1c\u897f\uff0c\u529b\u56fe\u8ba9\u6bcf\u4e2a\u4eba\u90fd\u80fd\u7406\u89e3\u3002\u5728\u4f4e\u5e74\u7ea7\uff0c\u5982\u679c\u5c31\u80fd\u4ece\u5b8f\u89c2\u4e0a\u5efa\u7acb\u5bf9\u6574\u4e2a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7684\u9e1f\u77b0\u56fe\uff0c\u662f\u5927\u6709\u88e8\u76ca\u7684\u3002 \u4e13\u4e1a\u8bfe \u5f53\u7136\uff0c\u5982\u679c\u60f3\u6df1\u5165\u73b0\u4ee3\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\u7684\u590d\u6742\u7ec6\u8282\uff0c\u8fd8\u5f97\u4e0a\u4e00\u95e8\u5927\u5b66\u672c\u79d1\u96be\u5ea6\u7684\u8bfe\u7a0b UCB CS61C: Great Ideas in Computer Architecture \u3002UC Berkeley\u4f5c\u4e3aRISC-V\u67b6\u6784\u7684\u53d1\u6e90\u5730\uff0c\u5728\u4f53\u7cfb\u7ed3\u6784\u9886\u57df\u7b97\u5f97\u4e0a\u9996\u5c48\u4e00\u6307\u3002\u5176\u8bfe\u7a0b\u975e\u5e38\u6ce8\u91cd\u5b9e\u8df5\uff0c\u4f60\u4f1a\u5728Project\u4e2d\u624b\u5199\u6c47\u7f16\u6784\u9020\u795e\u7ecf\u7f51\u7edc\uff0c\u4ece\u96f6\u5f00\u59cb\u642d\u5efa\u4e00\u4e2aCPU\uff0c\u8fd9\u4e9b\u5b9e\u8df5\u90fd\u4f1a\u8ba9\u4f60\u5bf9\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\u6709\u66f4\u4e3a\u6df1\u5165\u7684\u7406\u89e3\uff0c\u800c\u4e0d\u662f\u4ec5\u505c\u7559\u4e8e\u201c\u53d6\u6307\u8bd1\u7801\u6267\u884c\u8bbf\u5b58\u5199\u56de\u201d\u7684\u5355\u8c03\u80cc\u8bf5\u91cc\u3002 \u7cfb\u7edf\u5165\u95e8 \u8ba1\u7b97\u673a\u7cfb\u7edf\u662f\u4e00\u4e2a\u5e9e\u6742\u800c\u6df1\u523b\u7684\u4e3b\u9898\uff0c\u5728\u6df1\u5165\u5b66\u4e60\u67d0\u4e2a\u7ec6\u5206\u9886\u57df\u4e4b\u524d\uff0c\u5bf9\u5404\u4e2a\u9886\u57df\u6709\u4e00\u4e2a\u5b8f\u89c2\u6982\u5ff5\u6027\u7684\u7406\u89e3\uff0c\u5bf9\u4e00\u4e9b\u901a\u7528\u6027\u7684\u8bbe\u8ba1\u539f\u5219\u6709\u6240\u77e5\u6653\uff0c\u4f1a\u8ba9\u4f60\u5728\u4e4b\u540e\u7684\u6df1\u5165\u5b66\u4e60\u4e2d\u4e0d\u65ad\u5f3a\u5316\u4e00\u4e9b\u6700\u4e3a\u6838\u5fc3\u4e43\u81f3\u54f2\u5b66\u7684\u6982\u5ff5\uff0c\u800c\u4e0d\u4f1a\u684e\u688f\u4e8e\u590d\u6742\u7684\u5185\u90e8\u7ec6\u8282\u548c\u5404\u79cdtrick\u3002\u56e0\u4e3a\u5728\u6211\u770b\u6765\uff0c\u5b66\u4e60\u7cfb\u7edf\u6700\u5173\u952e\u7684\u8fd8\u662f\u60f3\u8ba9\u4f60\u9886\u609f\u5230\u8fd9\u4e9b\u6700\u6838\u5fc3\u7684\u4e1c\u897f\uff0c\u4ece\u800c\u80fd\u591f\u8bbe\u8ba1\u548c\u5b9e\u73b0\u51fa\u5c5e\u4e8e\u81ea\u5df1\u7684\u7cfb\u7edf\u3002 MIT6.033: System Engineering \u662fMIT\u7684\u7cfb\u7edf\u5165\u95e8\u8bfe\uff0c\u4e3b\u9898\u6d89\u53ca\u4e86\u64cd\u4f5c\u7cfb\u7edf\u3001\u7f51\u7edc\u3001\u5206\u5e03\u5f0f\u548c\u7cfb\u7edf\u5b89\u5168\uff0c\u9664\u4e86\u77e5\u8bc6\u70b9\u7684\u4f20\u6388\u5916\uff0c\u8fd9\u95e8\u8bfe\u8fd8\u4f1a\u8bb2\u6388\u4e00\u4e9b\u5199\u4f5c\u548c\u8868\u8fbe\u4e0a\u7684\u6280\u5de7\uff0c\u8ba9\u4f60\u5b66\u4f1a\u5982\u4f55\u8bbe\u8ba1\u5e76\u5411\u522b\u4eba\u4ecb\u7ecd\u548c\u5206\u6790\u81ea\u5df1\u7684\u7cfb\u7edf\u3002\u8fd9\u672c\u4e66\u914d\u5957\u7684\u6559\u6750 Principles of Computer System Design: An Introduction \u4e5f\u5199\u5f97\u975e\u5e38\u597d\uff0c\u63a8\u8350\u5927\u5bb6\u9605\u8bfb\u3002 CMU 15-213: Introduction to Computer System \u662fCMU\u7684\u7cfb\u7edf\u5165\u95e8\u8bfe\uff0c\u5185\u5bb9\u8986\u76d6\u4e86\u4f53\u7cfb\u7ed3\u6784\u3001\u64cd\u4f5c\u7cfb\u7edf\u3001\u94fe\u63a5\u3001\u5e76\u884c\u3001\u7f51\u7edc\u7b49\u7b49\uff0c\u517c\u5177\u5e7f\u5ea6\u548c\u6df1\u5ea6\uff0c\u914d\u5957\u7684\u6559\u6750 Computer Systems: A Programmer's Perspective \u4e5f\u662f\u8d28\u91cf\u6781\u9ad8\uff0c\u5f3a\u70c8\u5efa\u8bae\u9605\u8bfb\u3002 \u64cd\u4f5c\u7cfb\u7edf \u64cd\u4f5c\u7cfb\u7edf\u4f5c\u4e3a\u6240\u6709\u5e94\u7528\u8f6f\u4ef6\u548c\u5e95\u5c42\u786c\u4ef6\u4ea4\u4e92\u7684\u638c\u8235\u8005\uff0c\u4e86\u89e3\u5b83\u7684\u5185\u90e8\u539f\u7406\u548c\u8bbe\u8ba1\u539f\u5219\u5bf9\u4e8e\u4e00\u4e2a\u4e0d\u6ee1\u8db3\u4e8e\u8c03\u5305\u4fa0\u7684\u7a0b\u5e8f\u5458\u6765\u8bf4\u662f\u5f88\u6709\u5e2e\u52a9\u7684\u3002\u540c\u65f6\uff0c\u56fd\u5916\u64cd\u7edf\u8bfe\u7a0b\u7684\u8d28\u91cf\u4e5f\u662f\u8ba9\u4e0a\u4e86\u591a\u5e74\u7f51\u8bfe\u7684\u6211\u4e5f\u611f\u5230\u77a0\u76ee\u7ed3\u820c\u3002 MIT 6.S081: Operating System Engineering \uff0cMIT\u8457\u540dPDOS\u5b9e\u9a8c\u5ba4\u51fa\u54c1\uff0c11\u4e2aProject\u4f1a\u8ba9\u4f60\u5728\u4e00\u4e2a2\u4e07\u591a\u884c\u7684\u6559\u5b66\u7528\u8ff7\u4f60\u64cd\u4f5c\u7cfb\u7edf\u4e0a\u589e\u52a0\u5404\u7c7b\u529f\u80fd\u6a21\u5757\u3002\u8fd9\u95e8\u8bfe\u4e5f\u8ba9\u6211\u6df1\u523b\u8ba4\u8bc6\u5230\uff0c\u505a\u7cfb\u7edf\u4e0d\u662f\u9760PPT\u5ff5\u51fa\u6765\u7684\uff0c\u662f\u5f97\u51e0\u4e07\u884c\u4ee3\u7801\u4e00\u70b9\u70b9\u7d2f\u8d77\u6765\u7684\u3002 UCB CS162: Operating System \uff0c\u4f2f\u514b\u5229\u7684\u64cd\u4f5c\u7cfb\u7edf\u8bfe\uff0c\u91c7\u7528\u548cStanford\u540c\u6837\u7684Project \u2014\u2014 \u4e00\u4e2a\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edfPintos\u3002\u6211\u4f5c\u4e3a\u4e0b\u5b66\u671f\u5317\u4eac\u5927\u5b66\u64cd\u4f5c\u7cfb\u7edf\u5b9e\u9a8c\u73ed\u7684\u52a9\u6559\uff0c\u4f1a\u5c1d\u8bd5\u5f15\u5165\u8fd9\u4e2aProject\uff0c\u6b22\u8fce\u5927\u5bb6\u9009\u8bfe\u5c1d\u8bd5\uff0c\u540c\u65f6\u8bfe\u7a0b\u8d44\u6e90\u4e5f\u4f1a\u5168\u90e8\u5f00\u6e90\uff0c\u76ee\u524d \u8bfe\u7a0b\u7f51\u7ad9 \u6b63\u5728\u5efa\u8bbe\u5f53\u4e2d\u3002 \u5e76\u884c\u4e0e\u5206\u5e03\u5f0f\u7cfb\u7edf \u60f3\u5fc5\u8fd9\u4e24\u5e74\u5404\u7c7bCS\u8bb2\u5ea7\u91cc\u6700\u5e38\u542c\u5230\u7684\u8bdd\u5c31\u662f\u201c\u6469\u5c14\u5b9a\u5f8b\u6b63\u5728\u8d70\u5411\u7ec8\u7ed3\u201d\uff0c\u6b64\u8bdd\u4e0d\u5047\u3002\u540c\u65f6\u5982\u4eca\u6df1\u5ea6\u5b66\u4e60\u7684\u5174\u8d77\u5bfc\u81f4\u5bf9\u8ba1\u7b97\u673a\u7b97\u529b\u4e0e\u5b58\u50a8\u7684\u8981\u6c42\u90fd\u8fbe\u5230\u4e86\u524d\u6240\u672a\u6709\u7684\u9ad8\u5ea6\uff0c\u56e0\u6b64\u5e76\u884c\u548c\u5206\u5e03\u5f0f\u7cfb\u7edf\u5df2\u6210\u4e3a\u4e00\u9879\u70ed\u95e8\u6280\u672f\u8bdd\u9898\u3002 \u5e76\u884c\u8ba1\u7b97 CMU 15-418/Stanford CS149: Parallel Computing \u5206\u5e03\u5f0f\u7cfb\u7edf MIT 6.824: Distributed System \u7cfb\u7edf\u5b89\u5168 \u4e0d\u77e5\u9053\u4f60\u5f53\u5e74\u9009\u62e9\u8ba1\u7b97\u673a\u662f\u4e0d\u662f\u56e0\u4e3a\u6000\u7740\u4e00\u4e2a\u4e2d\u4e8c\u7684\u9ed1\u5ba2\u68a6\u60f3\uff0c\u4f46\u73b0\u5b9e\u5374\u662f\u6210\u4e3a\u9ed1\u5ba2\u9053\u963b\u4e14\u957f\u3002 \u7406\u8bba UCB CS161: Computer Security \u662f\u4f2f\u514b\u5229\u7684\u7cfb\u7edf\u5b89\u5168\u8bfe\u7a0b\uff0c\u4f1a\u6db5\u76d6\u6808\u653b\u51fb\u3001\u5bc6\u7801\u5b66\u3001\u7f51\u7ad9\u5b89\u5168\u3001\u7f51\u7edc\u5b89\u5168\u7b49\u7b49\u5185\u5bb9\u3002 \u5b9e\u8df5 \u638c\u63e1\u8fd9\u4e9b\u7406\u8bba\u77e5\u8bc6\u4e4b\u540e\uff0c\u8fd8\u9700\u8981\u5728\u5b9e\u8df5\u4e2d\u57f9\u517b\u548c\u953b\u70bc\u8fd9\u4e9b\u201c\u5b89\u5168\u7d20\u517b\u201d\u3002 CTF\u593a\u65d7\u8d5b \u662f\u4e00\u9879\u6bd4\u8f83\u70ed\u95e8\u7684\u7cfb\u7edf\u5b89\u5168\u6bd4\u8d5b\uff0c\u8d5b\u9898\u4e2d\u4f1a\u878d\u4f1a\u8d2f\u901a\u5730\u8003\u5bdf\u4f60\u5bf9\u8ba1\u7b97\u673a\u5404\u4e2a\u9886\u57df\u77e5\u8bc6\u7684\u7406\u89e3\u548c\u8fd0\u7528\u3002\u5317\u5927\u4eca\u5e74\u4e5f\u6210\u529f\u4e3e\u529e\u4e86 \u7b2c0\u5c4a\u548c\u7b2c1\u5c4a \uff0c\u4e5f\u9f13\u52b1\u5927\u5bb6\u540e\u671f\u8e0a\u8dc3\u53c2\u4e0e\uff0c\u5728\u5b9e\u8df5\u4e2d\u63d0\u9ad8\u81ea\u5df1\u3002\u4e0b\u9762\u5217\u4e3e\u4e00\u4e9b\u6211\u5e73\u65f6\u5b66\u4e60\uff08\u6478\u9c7c\uff09\u7528\u5230\u7684\u8d44\u6e90\uff1a CTF-wiki CTF-101 Hacker-101 \u8ba1\u7b97\u673a\u7f51\u7edc \u8ba1\u7f51\u8457\u540d\u6559\u6750\u300a\u81ea\u9876\u5411\u4e0b\u65b9\u6cd5\u300b\u7684\u914d\u5957\u5b66\u4e60\u8d44\u6e90 Computer Networking: A Top-Down Approach \u3002 \u6ca1\u6709\u4ec0\u4e48\u80fd\u6bd4\u81ea\u5df1\u5199\u4e2aTCP/IP\u534f\u8bae\u6808\u66f4\u80fd\u52a0\u6df1\u81ea\u5df1\u5bf9\u8ba1\u7b97\u673a\u7f51\u7edc\u7684\u7406\u89e3\u4e86\uff0c\u6240\u4ee5\u4e0d\u59a8\u8bd5\u8bd5 Stanford CS144: Computer Network \uff0c8\u4e2aProject\u5e26\u4f60\u5b9e\u73b0\u6574\u4e2a\u534f\u8bae\u6808\u3002 \u6570\u636e\u5e93\u7cfb\u7edf \u6ca1\u6709\u4ec0\u4e48\u80fd\u6bd4\u81ea\u5df1\u5199\u4e2a\u5173\u7cfb\u578b\u6570\u636e\u5e93\u66f4\u80fd\u52a0\u6df1\u81ea\u5df1\u5bf9\u6570\u636e\u5e93\u7cfb\u7edf\u7684\u7406\u89e3\u4e86\u3002 C++\u7248 CMU 15-445: Introduction to Database System Java\u7248 UCB CS186: Introduction to Database System \u7f16\u8bd1\u539f\u7406 \u6ca1\u6709\u4ec0\u4e48\u80fd\u6bd4\u81ea\u5df1\u5199\u4e2a\u7f16\u8bd1\u5668\u66f4\u80fd\u52a0\u6df1\u81ea\u5df1\u5bf9\u7f16\u8bd1\u5668\u7684\u7406\u89e3\u4e86\u3002 Stanford CS143: Compilers \u8ba1\u7b97\u673a\u56fe\u5f62\u5b66 Games101 Web\u5f00\u53d1 \u7f51\u7ad9\u7684\u5f00\u53d1\u5f88\u5c11\u5728\u8ba1\u7b97\u673a\u7684\u57f9\u517b\u65b9\u6848\u91cc\u88ab\u91cd\u89c6\uff0c\u4f46\u5176\u5b9e\u638c\u63e1\u8fd9\u9879\u6280\u80fd\u8fd8\u662f\u597d\u5904\u591a\u591a\u7684\uff0c\u4f8b\u5982\u642d\u5efa\u81ea\u5df1\u7684\u4e2a\u4eba\u4e3b\u9875\uff0c\u6291\u6216\u662f\u7ed9\u81ea\u5df1\u7684\u8bfe\u7a0b\u9879\u76ee\u505a\u4e00\u4e2a\u7cbe\u5f69\u7684\u5c55\u793a\u7f51\u9875\u3002 \u4e24\u5468\u901f\u6210\u7248 MIT web development course \u7cfb\u7edf\u5b66\u4e60\u7248 Stanford CS142: Web Applications \u6570\u636e\u79d1\u5b66 UCB Data100: Principles and Techniques of Data Science \u4eba\u5de5\u667a\u80fd \u5165\u95e8\u8bfe Harvard CS50\u2019s Introduction to AI with Python \u4e13\u4e1a\u8bfe UCB CS188: Introduction to Artificial Intelligence \u673a\u5668\u5b66\u4e60 \u5165\u95e8\u8bfe Coursera: Machine Learning \u4e13\u4e1a\u8bfe Stanford CS229: Machine Learning UCB CS189: Introduction to Machine Learning \u6df1\u5ea6\u5b66\u4e60 \u5165\u95e8\u8bfe Coursera: Deep Learning \u53f0\u6e7e\u56fd\u7acb\u5927\u5b66\uff1a\u674e\u5b8f\u6bc5\u673a\u5668\u5b66\u4e60 \u8ba1\u7b97\u673a\u89c6\u89c9 Stanford CS231n: CNN for Visual Recognition \u81ea\u7136\u8bed\u8a00\u5904\u7406 Stanford CS224n: Natural Language Processing \u56fe\u795e\u7ecf\u7f51\u7edc Stanford CS224w: Machine Learning with Graphs \u5f3a\u5316\u5b66\u4e60 UCB CS285: Deep Reinforcement Learning \u5b9a\u5236\u5c5e\u4e8e\u4f60\u7684\u8bfe\u7a0b\u5730\u56fe \u6388\u4eba\u4ee5\u9c7c\u4e0d\u5982\u6388\u4eba\u4ee5\u6e14\u3002 \u4ee5\u4e0a\u7684\u8bfe\u7a0b\u89c4\u5212\u96be\u514d\u6709\u5f3a\u70c8\u7684\u4e2a\u4eba\u503e\u5411\u548c\u559c\u597d\uff0c\u4e0d\u4e00\u5b9a\u9002\u5408\u6240\u6709\u4eba\uff0c\u66f4\u591a\u7684\u662f\u8d77\u5230\u629b\u7816\u5f15\u7389\u7684\u4f5c\u7528\u3002\u5982\u679c\u4f60\u60f3\u6311\u9009\u81ea\u5df1\u611f\u5174\u8da3\u7684\u65b9\u5411\u548c\u5185\u5bb9\u52a0\u4ee5\u5b66\u4e60\uff0c\u53ef\u4ee5\u53c2\u8003\u6211\u5728\u4e0b\u9762\u5217\u51fa\u6765\u7684\u8d44\u6e90\u3002 MIT OpenCourseWare : \u9ebb\u7701\u7406\u5de5\u5b66\u9662\u7684\u8bfe\u7a0b\u8d44\u6e90\u5f00\u653e\u5171\u4eab\u9879\u76ee\uff0c\u6536\u5f55\u4e86\u6570\u4ee5\u5343\u8ba1\u7684\u5404\u79d1\u8bfe\u7a0b\u8d44\u6e90\uff0c\u5176\u4e2d\u8ba1\u7b97\u673a\u7c7b\u7684\u8bfe\u53f7\u662f6.xxx\u3002 MIT CS Course List \uff1a\u9ebb\u7701\u7406\u5de5\u5b66\u9662\u7684CS\u8bfe\u7a0b\u5217\u8868\u3002 UC Berkeley EECS Course Map \uff1aUC Berkeley\u7684EECS\u57f9\u517b\u65b9\u6848\uff0c\u4ee5\u8bfe\u7a0b\u5730\u56fe\u7684\u65b9\u5f0f\u5c06\u5404\u95e8\u8bfe\u7a0b\u7684\u7c7b\u522b\u548c\u5148\u4fee\u5173\u7cfb\u4e00\u76ee\u4e86\u7136\u5730\u5448\u73b0\uff0c\u5176\u4e2d\u7edd\u5927\u591a\u6570\u8bfe\u7a0b\u672c\u4e66\u4e2d\u5747\u6709\u6536\u5f55\u3002 UC Berkeley CS Course List : UC Berkeley\u7684CS\u8bfe\u7a0b\u5217\u8868\u3002 Stanford CS Course List : \u65af\u5766\u798f\u7684CS\u8bfe\u7a0b\u5217\u8868\u3002","title":"\u4e00\u4e2a\u4ec5\u4f9b\u53c2\u8003\u7684CS\u5b66\u4e60\u89c4\u5212"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#cs","text":"\u8ba1\u7b97\u673a\u9886\u57df\u65b9\u5411\u5e9e\u6742\uff0c\u77e5\u8bc6\u6d69\u5982\u70df\u6d77\uff0c\u6bcf\u4e2a\u7ec6\u5206\u9886\u57df\u5982\u679c\u6df1\u7a76\u4e0b\u53bb\u90fd\u53ef\u4ee5\u8bf4\u5b66\u65e0\u6b62\u5883\u3002\u56e0\u6b64\uff0c\u4e00\u4e2a\u6e05\u6670\u660e\u786e\u7684\u5b66\u4e60\u89c4\u5212\u662f\u975e\u5e38\u91cd\u8981\u7684\u3002\u8fd9\u4e00\u8282\u7684\u5185\u5bb9\u662f\u5bf9\u540e\u7eed\u6574\u672c\u4e66\u7684\u5185\u5bb9\u7684\u4e00\u4e2a\u6982\u89c8\uff0c\u4f60\u53ef\u4ee5\u5c06\u5176\u770b\u4f5c\u662f\u8fd9\u672c\u4e66\u7684\u76ee\u5f55\uff0c\u6309\u9700\u9009\u62e9\u81ea\u5df1\u611f\u5174\u8da3\u7684\u5185\u5bb9\u8fdb\u884c\u5b66\u4e60\u3002 \u4e0d\u8fc7\uff0c\u5728\u5f00\u59cb\u5b66\u4e60\u4e4b\u524d\uff0c\u5148\u5411\u5c0f\u767d\u4eec\u5f3a\u70c8\u63a8\u8350\u4e00\u4e2a\u79d1\u666e\u5411\u7cfb\u5217\u89c6\u9891 Crash Course: Computer Science \uff0c\u5728\u77ed\u77ed8\u4e2a\u5c0f\u65f6\u91cc\u975e\u5e38\u751f\u52a8\u4e14\u5168\u9762\u5730\u79d1\u666e\u4e86\u5173\u4e8e\u8ba1\u7b97\u673a\u79d1\u5b66\u7684\u65b9\u65b9\u9762\u9762\uff1a\u8ba1\u7b97\u673a\u7684\u5386\u53f2\u3001\u8ba1\u7b97\u673a\u662f\u5982\u4f55\u8fd0\u4f5c\u7684\u3001\u7ec4\u6210\u8ba1\u7b97\u673a\u7684\u5404\u4e2a\u91cd\u8981\u6a21\u5757\u3001\u8ba1\u7b97\u673a\u79d1\u5b66\u4e2d\u7684\u91cd\u8981\u601d\u60f3\u7b49\u7b49\u7b49\u7b49\u3002\u6b63\u5982\u5b83\u7684\u53e3\u53f7\u6240\u8bf4\u7684 Computers are not magic! \uff0c\u5e0c\u671b\u770b\u5b8c\u8fd9\u4e2a\u89c6\u9891\u4e4b\u540e\uff0c\u5927\u5bb6\u80fd\u5bf9\u8ba1\u7b97\u673a\u79d1\u5b66\u6709\u4e2a\u5168\u8c8c\u6027\u5730\u611f\u77e5\uff0c\u4ece\u800c\u6000\u7740\u5174\u8da3\u53bb\u9762\u5bf9\u4e0b\u9762\u6d69\u5982\u70df\u6d77\u7684\u66f4\u4e3a\u7ec6\u81f4\u4e14\u6df1\u5165\u7684\u5b66\u4e60\u5185\u5bb9\u3002","title":"\u4e00\u4e2a\u4ec5\u4f9b\u53c2\u8003\u7684CS\u5b66\u4e60\u89c4\u5212"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_1","text":"\u4fd7\u8bdd\u8bf4\uff1a\u78e8\u5200\u4e0d\u8bef\u780d\u67f4\u5de5\u3002\u5982\u679c\u4f60\u662f\u4e00\u4e2a\u521a\u521a\u63a5\u89e6\u8ba1\u7b97\u673a\u768424k\u7eaf\u5c0f\u767d\uff0c\u5b66\u4f1a\u4e00\u4e9b\u5de5\u5177\u5c06\u4f1a\u8ba9\u4f60\u4e8b\u534a\u529f\u500d\u3002 MIT-Missing-Semester \u8fd9\u95e8\u8bfe\u8986\u76d6\u4e86\u8fd9\u4e9b\u5de5\u5177\u4e2d\u7edd\u5927\u90e8\u5206\uff0c\u800c\u4e14\u6709\u76f8\u5f53\u8be6\u7ec6\u7684\u4f7f\u7528\u6307\u5bfc\uff0c\u5f3a\u70c8\u5efa\u8bae\u5c0f\u767d\u5b66\u4e60\u3002 \u7ffb\u5899 \uff1a\u7531\u4e8e\u4e00\u4e9b\u4f17\u6240\u5468\u77e5\u7684\u539f\u56e0\uff0c\u8c37\u6b4c\u3001Github\u7b49\u7f51\u7ad9\u5728\u5927\u9646\u65e0\u6cd5\u8bbf\u95ee\u3002\u7136\u800c\u5f88\u591a\u65f6\u5019\uff0c\u8c37\u6b4c\u548cStackoverflow\u53ef\u4ee5\u89e3\u51b3\u4f60\u5728\u5f00\u53d1\u8fc7\u7a0b\u4e2d\u9047\u5230\u768495%\u7684\u95ee\u9898\u3002\u56e0\u6b64\uff0c\u5b66\u4f1a\u7ffb\u5899\u51e0\u4e4e\u662f\u4e00\u4e2a\u5185\u5730CSer\u7684\u5fc5\u5907\u6280\u80fd\u3002\uff08\u8003\u8651\u5230\u6cd5\u5f8b\u95ee\u9898\uff0c\u8fd9\u4e2a\u6587\u6863\u63d0\u4f9b\u7684\u7ffb\u5899\u65b9\u5f0f\u4ec5\u5bf9\u62e5\u6709\u5317\u5927\u90ae\u7bb1\u7684\u7528\u6237\u9002\u7528\uff09\u3002 IDE\uff08Integrated Development Environment\uff09\uff1a\u96c6\u6210\u5f00\u53d1\u73af\u5883\uff0c\u8bf4\u767d\u4e86\u5c31\u662f\u4f60\u5199\u4ee3\u7801\u7684\u5730\u65b9\u3002\u4f5c\u4e3a\u4e00\u4e2a\u7801\u519c\uff0cIDE\u7684\u91cd\u8981\u6027\u4e0d\u8a00\u800c\u55bb\uff0c\u4f46\u7531\u4e8e\u5f88\u591aIDE\u662f\u4e3a\u5927\u578b\u5de5\u7a0b\u9879\u76ee\u8bbe\u8ba1\u7684\uff0c\u4f53\u91cf\u8f83\u5927\uff0c\u529f\u80fd\u4e5f\u8fc7\u4e8e\u4e30\u5bcc\u3002\u5176\u5b9e\u5982\u4eca\u4e00\u4e9b\u8f7b\u4fbf\u7684\u6587\u672c\u7f16\u8f91\u5668\u914d\u5408\u4e30\u5bcc\u7684\u63d2\u4ef6\u751f\u6001\u57fa\u672c\u53ef\u4ee5\u6ee1\u8db3\u65e5\u5e38\u7684\u8f7b\u91cf\u7f16\u7a0b\u9700\u6c42\u3002\u4e2a\u4eba\u5e38\u7528\u7684\u7f16\u8f91\u5668\u662fVSCode\u548cSublime\uff08\u524d\u8005\u7684\u63d2\u4ef6\u914d\u7f6e\u975e\u5e38\u7b80\u5355\uff0c\u540e\u8005\u7565\u663e\u590d\u6742\u4f46\u989c\u503c\u5f88\u9ad8\uff09\u3002\u5f53\u7136\u5bf9\u4e8e\u5927\u578b\u9879\u76ee\u6211\u8fd8\u662f\u4f1a\u91c7\u7528\u7565\u91cd\u578b\u7684IDE\uff0c\u4f8b\u5982Pycharm\uff08Python\uff09\uff0cIDEA\uff08Java\uff09\u7b49\u7b49\uff08\u514d\u8d23\u7533\u660e\uff1a\u6240\u6709\u7684IDE\u90fd\u662f\u4e16\u754c\u4e0a\u6700\u597d\u7684IDE\uff09\u3002 Vim \uff1a\u4e00\u6b3e\u547d\u4ee4\u884c\u7f16\u8f91\u5de5\u5177\u3002\u8fd9\u662f\u4e00\u4e2a\u5b66\u4e60\u66f2\u7ebf\u6709\u4e9b\u9661\u5ced\u7684\u7f16\u8f91\u5668\uff0c\u4e0d\u8fc7\u5b66\u4f1a\u5b83\u6211\u89c9\u5f97\u662f\u975e\u5e38\u6709\u5fc5\u8981\u7684\uff0c\u56e0\u4e3a\u5b83\u5c06\u6781\u5927\u5730\u63d0\u9ad8\u4f60\u7684\u5f00\u53d1\u6548\u7387\u3002\u73b0\u5728\u7edd\u5927\u591a\u6570IDE\u4e5f\u90fd\u652f\u6301Vim\u63d2\u4ef6\uff0c\u8ba9\u4f60\u5728\u4eab\u53d7\u73b0\u4ee3\u5f00\u53d1\u73af\u5883\u7684\u540c\u65f6\u4fdd\u7559\u6781\u5ba2\u7684\u70ab\u9177\uff08yue\uff09\u3002 Git \uff1a\u4e00\u6b3e\u4ee3\u7801\u7248\u672c\u63a7\u5236\u5de5\u5177\u3002Git\u7684\u5b66\u4e60\u66f2\u7ebf\u53ef\u80fd\u66f4\u4e3a\u9661\u5ced\uff0c\u4f46\u51fa\u81eaLinux\u4e4b\u7236Linus\u4e4b\u624b\u7684Git\u7edd\u5bf9\u662f\u6bcf\u4e2a\u5b66CS\u7684\u7ae5\u978b\u5fc5\u987b\u638c\u63e1\u7684\u795e\u5668\u4e4b\u4e00\u3002 Github \uff1a\u57fa\u4e8eGit\u7684\u4ee3\u7801\u6258\u7ba1\u5e73\u53f0\u3002\u5168\u4e16\u754c\u6700\u5927\u7684\u4ee3\u7801\u5f00\u6e90\u793e\u533a\uff0c\u5927\u4f6c\u96c6\u805a\u5730\u3002 Makefile \uff1a\u4e00\u6b3e\u5de5\u7a0b\u6784\u5efa\u5de5\u5177\u3002\u5584\u7528Makefile\u4f1a\u8ba9\u4f60\u517b\u6210\u4ee3\u7801\u6a21\u5757\u5316\u7684\u4e60\u60ef\uff0c\u540c\u65f6\u4e5f\u80fd\u8ba9\u4f60\u719f\u6089\u4e00\u4e9b\u5927\u578b\u5de5\u7a0b\u7684\u7f16\u8bd1\u94fe\u63a5\u6d41\u7a0b\u3002 CMake \uff1a\u4e00\u6b3e\u529f\u80fd\u6bd4Makefile\u66f4\u4e3a\u5f3a\u5927\u7684\u6784\u5efa\u5de5\u5177\uff0c\u5efa\u8bae\u638c\u63e1Makefile\u4e4b\u540e\u518d\u52a0\u4ee5\u5b66\u4e60\u3002 LaTex \uff1a \u903c\u683c\u63d0\u5347 \u8bba\u6587\u6392\u7248\u5de5\u5177\u3002 Docker \uff1a\u4e00\u6b3e\u76f8\u8f83\u4e8e\u865a\u62df\u673a\u66f4\u8f7b\u91cf\u7ea7\u7684\u8f6f\u4ef6\u6253\u5305\u4e0e\u73af\u5883\u90e8\u7f72\u5de5\u5177\u3002 \u5b9e\u7528\u5de5\u5177\u7bb1 \uff1a\u9664\u4e86\u4e0a\u9762\u63d0\u5230\u7684\u8fd9\u4e9b\u5728\u5f00\u53d1\u4e2d\u4f7f\u7528\u9891\u7387\u6781\u9ad8\u7684\u5de5\u5177\u4e4b\u5916\uff0c\u6211\u8fd8\u6536\u96c6\u4e86\u5f88\u591a\u5b9e\u7528\u6709\u8da3\u7684\u514d\u8d39\u5de5\u5177\uff0c\u4f8b\u5982\u4e00\u4e9b\u4e0b\u8f7d\u5de5\u5177\u3001\u8bbe\u8ba1\u5de5\u5177\u3001\u5b66\u4e60\u7f51\u7ad9\u7b49\u7b49\u3002","title":"\u5fc5\u5b66\u5de5\u5177"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_2","text":"\u79c1\u4ee5\u4e3a\u4e00\u672c\u597d\u7684\u6559\u6750\u5e94\u5f53\u662f\u4ee5\u4eba\u4e3a\u672c\u7684\uff0c\u800c\u4e0d\u662f\u70ab\u6280\u5f0f\u7684\u7406\u8bba\u5806\u780c\u3002\u544a\u8bc9\u8bfb\u8005\u201c\u662f\u4ec0\u4e48\u201d\u56fa\u7136\u91cd\u8981\uff0c\u4f46\u66f4\u597d\u7684\u5e94\u5f53\u662f\u6559\u6750\u4f5c\u8005\u5c06\u5176\u5728\u8fd9\u4e2a\u9886\u57df\u6df1\u8015\u51e0\u5341\u5e74\u7684\u7ecf\u9a8c\u878d\u6c47\u8fdb\u4e66\u4e2d\uff0c\u5411\u8bfb\u8005\u5a13\u5a13\u9053\u6765\u201c\u4e3a\u4ec0\u4e48\u201d\u4ee5\u53ca\u672a\u6765\u5e94\u8be5\u201c\u600e\u4e48\u505a\u201d\u3002 \u94fe\u63a5\u6233\u8fd9\u91cc","title":"\u597d\u4e66\u63a8\u8350"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_3","text":"\u4f60\u4ee5\u4e3a\u7684\u5f00\u53d1 \u2014\u2014 \u5728IDE\u91cc\u75af\u72c2\u7801\u4ee3\u7801\u6570\u5c0f\u65f6\u3002 \u5b9e\u9645\u4e0a\u7684\u5f00\u53d1 \u2014\u2014 \u914d\u73af\u5883\u914d\u51e0\u5929\u8fd8\u6ca1\u5f00\u59cb\u5199\u4ee3\u7801\u3002 \u63a8\u8350\u4e00\u4e2a\u975e\u5e38\u4e0d\u9519\u7684Github\u9879\u76ee DevOps-Guide \uff0c\u5176\u4e2d\u6db5\u76d6\u4e86\u975e\u5e38\u591a\u7684\u8fd0\u7ef4\u65b9\u9762\u7684\u57fa\u7840\u77e5\u8bc6\u548c\u6559\u7a0b\uff0c\u4f8b\u5982Docker\uff0cK8s\uff0cLinux\uff0cCI-CD\uff0cGithub Actions\u7b49\u7b49\u3002 \u53e6\u5916\u5927\u5bb6\u53ef\u4ee5\u53c2\u8003\u4e00\u4efd\u7075\u611f\u6765\u81ea 6.NULL MIT-Missing-Semester \u7684 \u73af\u5883\u914d\u7f6e\u6307\u5357 \uff0c\u91cd\u70b9\u5728\u4e8e\u7ec8\u7aef\u7684\u7f8e\u5316\u914d\u7f6e\u3002\u6b64\u5916\u8fd8\u5305\u62ec\u5e38\u7528\u8f6f\u4ef6\u6e90\uff08\u5982 GitHub , Anaconda , pip \u7b49\uff09\u7684\u52a0\u901f\u4e0e\u66ff\u6362\u4ee5\u53ca\u4e00\u4e9bIDE\u7684\u914d\u7f6e\u4e0e\u6fc0\u6d3b\u6559\u7a0b\u3002 More contents under construction.","title":"\u73af\u5883\u914d\u7f6e"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_4","text":"\u6b63\u5982\u8fd9\u7ae0\u5f00\u5934\u63d0\u5230\u7684\uff0c\u8fd9\u4efd\u8bfe\u7a0b\u5730\u56fe\u4ec5\u4ec5\u662f\u4e00\u4e2a \u4ec5\u4f9b\u53c2\u8003 \u7684\u8bfe\u7a0b\u89c4\u5212\uff0c\u6211\u4f5c\u4e3a\u4e00\u4e2a\u4e34\u8fd1\u6bd5\u4e1a\u7684\u672c\u79d1\u751f\u3002\u6df1\u611f\u81ea\u5df1\u6ca1\u6709\u6743\u5229\u4e5f\u6ca1\u6709\u80fd\u529b\u5411\u522b\u4eba\u5ba3\u626c\u201c\u5e94\u8be5\u600e\u4e48\u5b66\u201d\u3002\u56e0\u6b64\u5982\u679c\u4f60\u89c9\u5f97\u4ee5\u4e0b\u7684\u8bfe\u7a0b\u5206\u7c7b\u4e0e\u9009\u62e9\u6709\u4e0d\u5408\u7406\u4e4b\u5904\uff0c\u6211\u5168\u76d8\u63a5\u53d7\uff0c\u5e76\u6df1\u611f\u62b1\u6b49\u3002\u4f60\u53ef\u4ee5\u5728\u4e0b\u4e00\u8282 \u5b9a\u5236\u5c5e\u4e8e\u4f60\u7684\u8bfe\u7a0b\u5730\u56fe \u4ee5\u4e0b\u8bfe\u7a0b\u7c7b\u522b\u4e2d\u9664\u4e86\u542b\u6709 \u57fa\u7840 \u548c \u5165\u95e8 \u5b57\u773c\u7684\u4ee5\u5916\uff0c\u5e76\u65e0\u660e\u786e\u7684\u5148\u540e\u6b21\u5e8f\uff0c\u5927\u5bb6\u53ea\u8981\u6ee1\u8db3\u67d0\u4e2a\u8bfe\u7a0b\u7684\u5148\u4fee\u8981\u6c42\uff0c\u5b8c\u5168\u53ef\u4ee5\u6839\u636e\u81ea\u5df1\u7684\u9700\u8981\u548c\u559c\u597d\u9009\u62e9\u60f3\u8981\u5b66\u4e60\u7684\u8bfe\u7a0b\u3002 \u53e6\u5916\u7531\u4e8e\u8d21\u732e\u8005\u7684\u4e0d\u65ad\u589e\u52a0\uff0c\u8fd9\u4efd\u8bfe\u7a0b\u5730\u56fe\u5df2\u7ecf\u4ece\u6700\u521d\u6211\u7684\u5b66\u4e60\u7ecf\u5386\uff0c\u53d1\u5c55\u6210\u4e3a\u5f88\u591aCS\u81ea\u5b66\u8005\u7684\u8d44\u6e90\u5408\u96c6\uff0c\u5176\u4e2d\u96be\u514d\u6709\u5185\u5bb9\u4ea4\u53c9\u751a\u81f3\u91cd\u590d\u7684\u3002\u4f46\u4e4b\u6240\u4ee5\u90fd\u5217\u51fa\u6765\uff0c\u8fd8\u662f\u5e0c\u671b\u96c6\u767e\u5bb6\u4e4b\u957f\uff0c\u7ed9\u5927\u5bb6\u5c3d\u53ef\u80fd\u591a\u7684\u9009\u62e9\u4e0e\u53c2\u8003\u3002","title":"\u8bfe\u7a0b\u5730\u56fe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_5","text":"","title":"\u6570\u5b66\u57fa\u7840"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_6","text":"\u4f5c\u4e3a\u5927\u4e00\u65b0\u751f\uff0c\u5b66\u597d\u5fae\u79ef\u5206\u7ebf\u4ee3\u662f\u548c\u5199\u4ee3\u7801\u81f3\u5c11\u540c\u7b49\u91cd\u8981\u7684\u4e8b\u60c5\uff0c\u76f8\u4fe1\u5df2\u7ecf\u6709\u65e0\u6570\u7684\u524d\u4eba\u7ecf\u9a8c\u63d0\u5230\u8fc7\u8fd9\u4e00\u70b9\uff0c\u4f46\u6211\u8fd8\u662f\u8981\u4e0d\u538c\u5176\u70e6\u5730\u518d\u5f3a\u8c03\u4e00\u904d\uff1a\u5b66\u597d\u5fae\u79ef\u5206\u7ebf\u4ee3\u771f\u7684\u5f88\u91cd\u8981\uff01\u4f60\u4e5f\u8bb8\u4f1a\u5410\u69fd\u8fd9\u4e9b\u4e1c\u897f\u5c82\u4e0d\u662f\u8003\u5b8c\u5c31\u5fd8\uff0c\u90a3\u6211\u89c9\u5f97\u4f60\u662f\u5e76\u6ca1\u6709\u628a\u63e1\u4f4f\u5b83\u4eec\u672c\u8d28\uff0c\u5bf9\u5b83\u4eec\u7684\u7406\u89e3\u8fd8\u6ca1\u6709\u8fbe\u5230\u523b\u9aa8\u94ed\u5fc3\u7684\u7a0b\u5ea6\u3002\u5982\u679c\u89c9\u5f97\u8001\u5e08\u8bfe\u4e0a\u8bb2\u7684\u5185\u5bb9\u6666\u6da9\u96be\u61c2\uff0c\u4e0d\u59a8\u53c2\u8003MIT\u7684 Calculus Course \u548c 18.06: Linear Algebra \u7684\u8bfe\u7a0bnotes\uff0c\u81f3\u5c11\u4e8e\u6211\u800c\u8a00\uff0c\u5b83\u5e2e\u52a9\u6211\u6df1\u523b\u7406\u89e3\u4e86\u5fae\u79ef\u5206\u548c\u7ebf\u6027\u4ee3\u6570\u7684\u8bb8\u591a\u672c\u8d28\u3002\u987a\u9053\u518d\u5b89\u5229\u4e00\u4e2a\u6cb9\u7ba1\u6570\u5b66\u7f51\u7ea2 3Blue1Brown \uff0c\u4ed6\u7684\u9891\u9053\u6709\u5f88\u591a\u7528\u751f\u52a8\u5f62\u8c61\u7684\u52a8\u753b\u9610\u91ca\u6570\u5b66\u672c\u8d28\u5185\u6838\u7684\u89c6\u9891\uff0c\u517c\u5177\u6df1\u5ea6\u548c\u5e7f\u5ea6\uff0c\u8d28\u91cf\u975e\u5e38\u9ad8\u3002","title":"\u5fae\u79ef\u5206\u4e0e\u7ebf\u6027\u4ee3\u6570"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_7","text":"\u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u53ca\u65e9\u4e86\u89e3\u4e00\u4e9b\u4fe1\u606f\u8bba\u7684\u57fa\u7840\u77e5\u8bc6\uff0c\u6211\u89c9\u5f97\u662f\u5927\u6709\u88e8\u76ca\u7684\u3002\u4f46\u5927\u591a\u4fe1\u606f\u8bba\u8bfe\u7a0b\u90fd\u9762\u5411\u9ad8\u5e74\u7ea7\u672c\u79d1\u751f\u751a\u81f3\u7814\u7a76\u751f\uff0c\u5bf9\u65b0\u624b\u6781\u4e0d\u53cb\u597d\u3002\u800cMIT\u7684 6.050J: Information theory and Entropy \u8fd9\u95e8\u8bfe\u6b63\u662f\u4e3a\u5927\u4e00\u65b0\u751f\u91cf\u8eab\u5b9a\u5236\u7684\uff0c\u51e0\u4e4e\u6ca1\u6709\u5148\u4fee\u8981\u6c42\uff0c\u6db5\u76d6\u4e86\u7f16\u7801\u3001\u538b\u7f29\u3001\u901a\u4fe1\u3001\u4fe1\u606f\u71b5\u7b49\u7b49\u5185\u5bb9\uff0c\u975e\u5e38\u6709\u8da3\u3002","title":"\u4fe1\u606f\u8bba\u5165\u95e8"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_8","text":"","title":"\u6570\u5b66\u8fdb\u9636"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_9","text":"\u96c6\u5408\u8bba\u3001\u56fe\u8bba\u3001\u6982\u7387\u8bba\u7b49\u7b49\u662f\u7b97\u6cd5\u63a8\u5bfc\u4e0e\u8bc1\u660e\u7684\u91cd\u8981\u5de5\u5177\uff0c\u4e5f\u662f\u540e\u7eed\u9ad8\u9636\u6570\u5b66\u8bfe\u7a0b\u7684\u57fa\u7840\u3002\u4f46\u6211\u89c9\u5f97\u8fd9\u7c7b\u8bfe\u7a0b\u7684\u8bb2\u6388\u5f88\u5bb9\u6613\u843d\u5165\u7406\u8bba\u5316\u4e0e\u5f62\u5f0f\u5316\u7684\u7aa0\u81fc\uff0c\u8ba9\u8bfe\u5802\u6210\u4e3a\u5b9a\u7406\u7ed3\u8bba\u7684\u5806\u780c\uff0c\u800c\u65e0\u6cd5\u4f7f\u5b66\u751f\u6df1\u523b\u628a\u63e1\u7406\u8bba\u7684\u672c\u8d28\uff0c\u8fdb\u800c\u9020\u6210\u5b66\u4e86\u5c31\u80cc\uff0c\u8003\u4e86\u5c31\u5fd8\u7684\u602a\u5708\u3002\u5982\u679c\u80fd\u5728\u7406\u8bba\u6559\u5b66\u4e2d\u7a7f\u63d2\u7b97\u6cd5\u8fd0\u7528\u5b9e\u4f8b\uff0c\u5b66\u751f\u5728\u62d3\u5c55\u7b97\u6cd5\u77e5\u8bc6\u7684\u540c\u65f6\u4e5f\u80fd\u7aa5\u89c1\u7406\u8bba\u7684\u529b\u91cf\u548c\u9b45\u529b\u3002 UCB CS70 : discrete Math and probability theory \u548c UCB CS126 : Probability theory \u662fUC Berkeley\u7684\u6982\u7387\u8bba\u8bfe\u7a0b\uff0c\u524d\u8005\u8986\u76d6\u4e86\u79bb\u6563\u6570\u5b66\u548c\u6982\u7387\u8bba\u57fa\u7840\uff0c\u540e\u8005\u5219\u6d89\u53ca\u968f\u673a\u8fc7\u7a0b\u4ee5\u53ca\u6df1\u5165\u7684\u7406\u8bba\u5185\u5bb9\u3002\u4e24\u8005\u90fd\u975e\u5e38\u6ce8\u91cd\u7406\u8bba\u548c\u5b9e\u8df5\u7684\u7ed3\u5408\uff0c\u6709\u4e30\u5bcc\u7684\u7b97\u6cd5\u5b9e\u9645\u8fd0\u7528\u5b9e\u4f8b\uff0c\u540e\u8005\u8fd8\u6709\u5927\u91cf\u7684Python\u7f16\u7a0b\u4f5c\u4e1a\u6765\u8ba9\u5b66\u751f\u8fd0\u7528\u6982\u7387\u8bba\u7684\u77e5\u8bc6\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\u3002","title":"\u79bb\u6563\u6570\u5b66\u4e0e\u6982\u7387\u8bba"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_10","text":"\u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u57f9\u517b\u8ba1\u7b97\u601d\u7ef4\u662f\u5f88\u91cd\u8981\u7684\uff0c\u5b9e\u9645\u95ee\u9898\u7684\u5efa\u6a21\u3001\u79bb\u6563\u5316\uff0c\u8ba1\u7b97\u673a\u7684\u6a21\u62df\u3001\u5206\u6790\uff0c\u662f\u4e00\u9879\u5f88\u91cd\u8981\u7684\u80fd\u529b\u3002\u800c\u8fd9\u4e24\u5e74\u5f00\u59cb\u98ce\u9761\u7684\uff0c\u7531MIT\u6253\u9020\u7684 Julia \u7f16\u7a0b\u8bed\u8a00\u4ee5\u5176C\u4e00\u6837\u7684\u901f\u5ea6\u548cPython\u4e00\u6837\u53cb\u597d\u7684\u8bed\u6cd5\u5728\u6570\u503c\u8ba1\u7b97\u9886\u57df\u6709\u4e00\u7edf\u5929\u4e0b\u4e4b\u52bf\uff0cMIT\u7684\u8bb8\u591a\u6570\u5b66\u8bfe\u7a0b\u4e5f\u5f00\u59cb\u7528Julia\u4f5c\u4e3a\u6559\u5b66\u5de5\u5177\uff0c\u628a\u8270\u6df1\u7684\u6570\u5b66\u7406\u8bba\u7528\u76f4\u89c2\u6e05\u6670\u7684\u4ee3\u7801\u5c55\u793a\u51fa\u6765\u3002 ComputationalThinking \u662fMIT\u5f00\u8bbe\u7684\u4e00\u95e8\u8ba1\u7b97\u601d\u7ef4\u5165\u95e8\u8bfe\uff0c\u6240\u6709\u8bfe\u7a0b\u5185\u5bb9\u5168\u90e8\u5f00\u6e90\uff0c\u53ef\u4ee5\u5728\u8bfe\u7a0b\u7f51\u7ad9\u76f4\u63a5\u8bbf\u95ee\u3002\u8fd9\u95e8\u8bfe\u5229\u7528Julia\u7f16\u7a0b\u8bed\u8a00\uff0c\u5728\u56fe\u50cf\u5904\u7406\u3001\u793e\u4f1a\u79d1\u5b66\u4e0e\u6570\u636e\u79d1\u5b66\u3001\u6c14\u5019\u5b66\u5efa\u6a21\u4e09\u4e2atopic\u4e0b\u5e26\u9886\u5b66\u751f\u7406\u89e3\u7b97\u6cd5\u3001\u6570\u5b66\u5efa\u6a21\u3001\u6570\u636e\u5206\u6790\u3001\u4ea4\u4e92\u8bbe\u8ba1\u3001\u56fe\u4f8b\u5c55\u793a\uff0c\u8ba9\u5b66\u751f\u4f53\u9a8c\u8ba1\u7b97\u4e0e\u79d1\u5b66\u7684\u7f8e\u5999\u7ed3\u5408\u3002\u5185\u5bb9\u867d\u7136\u4e0d\u96be\uff0c\u4f46\u7ed9\u6211\u6700\u6df1\u523b\u7684\u611f\u53d7\u5c31\u662f\uff0c\u79d1\u5b66\u7684\u9b45\u529b\u5e76\u4e0d\u662f\u6545\u5f04\u7384\u865a\u7684\u8270\u6df1\u7406\u8bba\uff0c\u4e0d\u662f\u8bd8\u5c48\u8071\u7259\u7684\u672f\u8bed\u884c\u8bdd\uff0c\u800c\u662f\u7528\u76f4\u89c2\u751f\u52a8\u7684\u6848\u4f8b\uff0c\u7528\u7b80\u7ec3\u6df1\u523b\u7684\u8bed\u8a00\uff0c\u8ba9\u6bcf\u4e2a\u666e\u901a\u4eba\u90fd\u80fd\u7406\u89e3\u3002 \u4e0a\u5b8c\u4e0a\u9762\u7684\u4f53\u9a8c\u8bfe\u4e4b\u540e\uff0c\u5982\u679c\u610f\u72b9\u672a\u5c3d\u7684\u8bdd\uff0c\u4e0d\u59a8\u8bd5\u8bd5MIT\u7684 18.330 : Introduction to numerical analysis \uff0c\u8fd9\u95e8\u8bfe\u7684\u7f16\u7a0b\u4f5c\u4e1a\u540c\u6837\u4f1a\u7528Julia\u7f16\u7a0b\u8bed\u8a00\uff0c\u4e0d\u8fc7\u96be\u5ea6\u548c\u6df1\u5ea6\u4e0a\u90fd\u4e0a\u4e86\u4e00\u4e2a\u53f0\u9636\u3002\u5185\u5bb9\u6d89\u53ca\u4e86\u6d6e\u70b9\u7f16\u7801\u3001Root finding\u3001\u7ebf\u6027\u7cfb\u7edf\u3001\u5fae\u5206\u65b9\u7a0b\u7b49\u7b49\u65b9\u9762\uff0c\u6574\u95e8\u8bfe\u7684\u4e3b\u65e8\u5c31\u662f\u8ba9\u4f60\u5229\u7528\u79bb\u6563\u5316\u7684\u8ba1\u7b97\u673a\u8868\u793a\u53bb\u4f30\u8ba1\u548c\u903c\u8fd1\u4e00\u4e2a\u6570\u5b66\u4e0a\u8fde\u7eed\u7684\u6982\u5ff5\u3002\u8fd9\u95e8\u8bfe\u7684\u6559\u6388\u8fd8\u4e13\u95e8\u64b0\u5199\u4e86\u4e00\u672c\u914d\u5957\u7684\u5f00\u6e90\u6559\u6750 Fundamentals of Numerical Computation \uff0c\u91cc\u9762\u9644\u6709\u4e30\u5bcc\u7684Julia\u4ee3\u7801\u5b9e\u4f8b\u548c\u4e25\u8c28\u7684\u516c\u5f0f\u63a8\u5bfc\u3002 \u5982\u679c\u4f60\u8fd8\u610f\u72b9\u672a\u5c3d\u7684\u8bdd\uff0c\u8fd8\u6709MIT\u7684\u7814\u7a76\u751f\u8bfe\u7a0b 18.335: Introduction to numerical method \u4f9b\u4f60\u53c2\u8003\u3002","title":"\u6570\u503c\u5206\u6790"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_11","text":"\u5982\u679c\u4e16\u95f4\u4e07\u7269\u7684\u8fd0\u52a8\u53d1\u5c55\u90fd\u80fd\u7528\u65b9\u7a0b\u6765\u523b\u753b\u548c\u63cf\u8ff0\uff0c\u8fd9\u662f\u4e00\u4ef6\u591a\u4e48\u9177\u7684\u4e8b\u60c5\u5440\uff01\u867d\u7136\u51e0\u4e4e\u4efb\u4f55\u4e00\u6240\u5b66\u6821\u7684CS\u57f9\u517b\u65b9\u6848\u4e2d\u90fd\u6ca1\u6709\u5fae\u5206\u65b9\u7a0b\u76f8\u5173\u7684\u5fc5\u4fee\u8bfe\u7a0b\uff0c\u4f46\u6211\u8fd8\u662f\u89c9\u5f97\u638c\u63e1\u5b83\u4f1a\u8d4b\u4e88\u4f60\u4e00\u4e2a\u65b0\u7684\u89c6\u89d2\u6765\u5ba1\u89c6\u8fd9\u4e2a\u4e16\u754c\u3002 \u7531\u4e8e\u5fae\u5206\u65b9\u7a0b\u4e2d\u5f80\u5f80\u4f1a\u7528\u5230\u5f88\u591a\u590d\u53d8\u51fd\u6570\u7684\u77e5\u8bc6\uff0c\u6240\u4ee5\u5927\u5bb6\u53ef\u4ee5\u53c2\u8003 MIT18.04: Complex variables functions \u7684\u8bfe\u7a0bnotes\u6765\u8865\u9f50\u5148\u4fee\u77e5\u8bc6\u3002 MIT18.03: differential equations \u4e3b\u8981\u8986\u76d6\u4e86\u5e38\u5fae\u5206\u65b9\u7a0b\u7684\u6c42\u89e3\uff0c\u5728\u6b64\u57fa\u7840\u4e4b\u4e0a MIT18.152: Partial differential equations \u5219\u4f1a\u6df1\u5165\u504f\u5fae\u5206\u65b9\u7a0b\u7684\u5efa\u6a21\u4e0e\u6c42\u89e3\u3002\u638c\u63e1\u4e86\u5fae\u5206\u65b9\u7a0b\u8fd9\u4e00\u6709\u5229\u5de5\u5177\uff0c\u76f8\u4fe1\u5bf9\u4e8e\u4f60\u7684\u5b9e\u9645\u95ee\u9898\u7684\u5efa\u6a21\u80fd\u529b\u4ee5\u53ca\u4ece\u4f17\u591a\u566a\u58f0\u53d8\u91cf\u4e2d\u628a\u63e1\u672c\u8d28\u7684\u76f4\u89c9\u90fd\u4f1a\u6709\u5f88\u5927\u5e2e\u52a9\u3002","title":"\u5fae\u5206\u65b9\u7a0b"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_12","text":"\u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u6211\u7ecf\u5e38\u542c\u5230\u6570\u5b66\u65e0\u7528\u8bba\u7684\u8bba\u65ad\uff0c\u5bf9\u6b64\u6211\u4e0d\u6562\u82df\u540c\u4f46\u4e5f\u65e0\u6743\u53cd\u5bf9\uff0c\u4f46\u82e5\u51e1\u4e8b\u90fd\u786c\u8981\u4e89\u51fa\u4e2a\u6709\u7528\u548c\u65e0\u7528\u7684\u533a\u522b\u6765\uff0c\u5012\u4e5f\u7740\u5b9e\u65e0\u8da3\uff0c\u56e0\u6b64\u4e0b\u9762\u8fd9\u4e9b\u9762\u5411\u9ad8\u5e74\u7ea7\u751a\u81f3\u7814\u7a76\u751f\u7684\u6570\u5b66\u8bfe\u7a0b\uff0c\u5927\u5bb6\u6309\u5174\u8da3\u81ea\u53d6\u6240\u9700\u3002","title":"\u6570\u5b66\u9ad8\u9636"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_13","text":"Standford EE364A: Convex Optimization","title":"\u51f8\u4f18\u5316"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_14","text":"MIT6.441: Information Theory","title":"\u4fe1\u606f\u8bba"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_15","text":"MIT18.650: Statistics for Applications","title":"\u5e94\u7528\u7edf\u8ba1\u5b66"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_16","text":"MIT18.781: Theory of Numbers","title":"\u521d\u7b49\u6570\u8bba"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_17","text":"Standford CS255: Cryptography","title":"\u5bc6\u7801\u5b66"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_18","text":"Languages are tools, you choose the right tool to do the right thing. Since there's no universally perfect tool, there's no universally perfect language.","title":"\u7f16\u7a0b\u5165\u95e8"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#shell","text":"MIT-Missing-Semester","title":"Shell"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#python","text":"Harvard CS50: This is CS50x \u6700\u597d\u7684\u8ba1\u7b97\u673a\u57fa\u7840\u5165\u95e8\u8bfe\uff0c\u4f60\u7edd\u5bf9\u4f1a\u7231\u4e0a\u7684\u3002 UCB CS61A: Structure and Interpretation of Computer Programs","title":"Python"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#c","text":"Stanford CS106L: Standard C++ Programming","title":"C++"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#rust","text":"Stanford CS110L: Safety in Systems Programming","title":"Rust"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#ocaml","text":"Cornell CS3110 textbook: Functional Programming in OCaml","title":"OCaml"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_19","text":"","title":"\u7535\u5b50\u57fa\u7840"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_20","text":"\u4f5c\u4e3a\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\uff0c\u4e86\u89e3\u4e00\u4e9b\u57fa\u7840\u7684\u7535\u8def\u77e5\u8bc6\uff0c\u611f\u53d7\u4ece\u4f20\u611f\u5668\u6536\u96c6\u6570\u636e\u5230\u6570\u636e\u5206\u6790\u518d\u5230\u7b97\u6cd5\u9884\u6d4b\u6574\u6761\u6d41\u6c34\u7ebf\uff0c\u5bf9\u4e8e\u540e\u7eed\u77e5\u8bc6\u7684\u5b66\u4e60\u4ee5\u53ca\u8ba1\u7b97\u601d\u7ef4\u7684\u57f9\u517b\u8fd8\u662f\u5f88\u6709\u5e2e\u52a9\u7684\u3002 EE16A&B: Designing Information Devices and Systems I&II \u662f\u4f2f\u514b\u5229EE\u5b66\u751f\u7684\u5927\u4e00\u5165\u95e8\u8bfe\uff0c\u5176\u4e2dEE16A\u6ce8\u91cd\u901a\u8fc7\u7535\u8def\u4ece\u5b9e\u9645\u73af\u5883\u4e2d\u6536\u96c6\u548c\u5206\u6790\u6570\u636e\uff0c\u800cEE16B\u5219\u4fa7\u91cd\u4ece\u8fd9\u4e9b\u6536\u96c6\u5230\u7684\u6570\u636e\u8fdb\u884c\u5206\u6790\u5e76\u505a\u51fa\u9884\u6d4b\u884c\u4e3a\u3002","title":"\u7535\u8def\u57fa\u7840"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_21","text":"\u4fe1\u53f7\u4e0e\u7cfb\u7edf\u662f\u4e00\u95e8\u6211\u89c9\u5f97\u975e\u5e38\u503c\u5f97\u4e00\u4e0a\u7684\u8bfe\uff0c\u6700\u521d\u5b66\u5b83\u53ea\u662f\u4e3a\u4e86\u6ee1\u8db3\u6211\u5bf9\u5085\u91cc\u53f6\u53d8\u6362\u7684\u597d\u5947\uff0c\u4f46\u5b66\u5b8c\u4e4b\u540e\u6211\u624d\u4e0d\u7981\u611f\u53f9\uff0c\u5085\u7acb\u53f6\u53d8\u6362\u7ed9\u6211\u63d0\u4f9b\u4e86\u4e00\u4e2a\u5168\u65b0\u7684\u89c6\u89d2\u53bb\u770b\u5f85\u8fd9\u4e2a\u4e16\u754c\uff0c\u5c31\u5982\u540c\u5fae\u5206\u65b9\u7a0b\u4e00\u6837\uff0c\u8ba9\u4f60\u6c89\u6d78\u5728\u7528\u6570\u5b66\u53bb\u7cbe\u786e\u63cf\u7ed8\u548c\u523b\u753b\u8fd9\u4e2a\u4e16\u754c\u7684\u4f18\u96c5\u4e0e\u795e\u5947\u4e4b\u4e2d\u3002 MIT 6.003 : signal and systems \u63d0\u4f9b\u4e86\u5168\u90e8\u7684\u8bfe\u7a0b\u5f55\u5f71\u3001\u4e66\u9762\u4f5c\u4e1a\u4ee5\u53ca\u7b54\u6848\u3002\u4e5f\u53ef\u4ee5\u53bb\u770b\u8fd9\u95e8\u8bfe\u7684 \u8fdc\u53e4\u7248\u672c \u800c UCB EE120 : Signal and Systems \u5173\u4e8e\u5085\u7acb\u53f6\u53d8\u6362\u7684notes\u5199\u5f97\u975e\u5e38\u597d\uff0c\u5e76\u4e14\u63d0\u4f9b\u4e866\u4e2a\u975e\u5e38\u6709\u8da3\u7684Python\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u8ba9\u4f60\u5b9e\u8df5\u4e2d\u8fd0\u7528\u4fe1\u53f7\u4e0e\u7cfb\u7edf\u7684\u7406\u8bba\u4e0e\u7b97\u6cd5\u3002","title":"\u4fe1\u53f7\u4e0e\u7cfb\u7edf"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_22","text":"","title":"\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_23","text":"Stanford CS106B/X: Programming Abstractions UCB CS61B: Data Structures and Algorithms Coursera: Algorithms I & II","title":"\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_24","text":"UCB CS170: Efficient Algorithms and Intractable Problems","title":"\u7b97\u6cd5\u8bbe\u8ba1\u4e0e\u5206\u6790"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_25","text":"","title":"\u8f6f\u4ef6\u5de5\u7a0b"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_26","text":"\u4e00\u4efd\u201c\u80fd\u8dd1\u201d\u7684\u4ee3\u7801\uff0c\u548c\u4e00\u4efd\u9ad8\u8d28\u91cf\u7684\u5de5\u4e1a\u7ea7\u4ee3\u7801\u662f\u6709\u672c\u8d28\u533a\u522b\u7684\u3002\u56e0\u6b64\u6211\u975e\u5e38\u63a8\u8350\u4f4e\u5e74\u7ea7\u7684\u540c\u5b66\u5b66\u4e60\u4e00\u4e0b MIT 6.031: Software Construction \u8fd9\u95e8\u8bfe\uff0c\u5b83\u4f1a\u4ee5Java\u8bed\u8a00\u4e3a\u57fa\u7840\uff0c\u4ee5\u4e30\u5bcc\u7ec6\u81f4\u7684\u9605\u8bfb\u6750\u6599\u548c\u7cbe\u5fc3\u8bbe\u8ba1\u7684\u7f16\u7a0b\u7ec3\u4e60\u4f20\u6388\u5982\u4f55\u7f16\u5199 \u4e0d\u6613\u51fabug\u3001\u7b80\u660e\u6613\u61c2\u3001\u6613\u4e8e\u7ef4\u62a4\u4fee\u6539 \u7684\u9ad8\u8d28\u91cf\u4ee3\u7801\u3002\u5927\u5230\u5b8f\u89c2\u6570\u636e\u7ed3\u6784\u8bbe\u8ba1\uff0c\u5c0f\u5230\u5982\u4f55\u5199\u6ce8\u91ca\uff0c\u9075\u5faa\u8fd9\u4e9b\u524d\u4eba\u603b\u7ed3\u7684\u7ec6\u8282\u548c\u7ecf\u9a8c\uff0c\u5bf9\u4e8e\u4f60\u6b64\u540e\u7684\u7f16\u7a0b\u751f\u6daf\u5927\u6709\u88e8\u76ca\u3002","title":"\u5165\u95e8\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_27","text":"\u5f53\u7136\uff0c\u5982\u679c\u4f60\u60f3\u7cfb\u7edf\u6027\u5730\u4e0a\u4e00\u95e8\u8f6f\u4ef6\u5de5\u7a0b\u7684\u8bfe\u7a0b\uff0c\u90a3\u6211\u63a8\u8350\u7684\u662f\u4f2f\u514b\u5229\u7684 UCB CS169: software engineering \u3002\u4f46\u9700\u8981\u63d0\u9192\u7684\u662f\uff0c\u548c\u5927\u591a\u5b66\u6821\uff08\u5305\u62ec\u8d35\u6821\uff09\u7684\u8f6f\u4ef6\u5de5\u7a0b\u8bfe\u7a0b\u4e0d\u540c\uff0c\u8fd9\u95e8\u8bfe\u4e0d\u4f1a\u6d89\u53ca\u4f20\u7edf\u7684 design and document \u6a21\u5f0f\uff0c\u5373\u5f3a\u8c03\u5404\u79cd\u7c7b\u56fe\u3001\u6d41\u7a0b\u56fe\u53ca\u6587\u6863\u8bbe\u8ba1\uff0c\u800c\u662f\u91c7\u7528\u8fd1\u4e9b\u5e74\u6d41\u884c\u8d77\u6765\u7684\u5c0f\u56e2\u961f\u5feb\u901f\u8fed\u4ee3 Agile Develepment \u5f00\u53d1\u6a21\u5f0f\u4ee5\u53ca\u5229\u7528\u4e91\u5e73\u53f0\u7684 Software as a service \u670d\u52a1\u6a21\u5f0f\u3002","title":"\u4e13\u4e1a\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_28","text":"","title":"\u4f53\u7cfb\u7ed3\u6784"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_29","text":"\u4ece\u5c0f\u6211\u5c31\u4e00\u76f4\u542c\u8bf4\uff0c\u8ba1\u7b97\u673a\u7684\u4e16\u754c\u662f\u753101\u6784\u6210\u7684\uff0c\u6211\u4e0d\u7406\u89e3\u4f46\u5927\u53d7\u9707\u64bc\u3002\u5982\u679c\u4f60\u7684\u5185\u5fc3\u4e5f\u6000\u6709\u8fd9\u4efd\u597d\u5947\uff0c\u4e0d\u59a8\u82b1\u4e00\u5230\u4e24\u4e2a\u6708\u7684\u65f6\u95f4\u5b66\u4e60 Coursera: Nand2Tetris \u8fd9\u95e8\u65e0\u95e8\u69db\u7684\u8ba1\u7b97\u673a\u8bfe\u7a0b\u3002\u8fd9\u95e8\u9ebb\u96c0\u867d\u5c0f\u4e94\u810f\u4ff1\u5168\u7684\u8bfe\u7a0b\u4f1a\u4ece01\u5f00\u59cb\u8ba9\u4f60\u4eb2\u624b\u9020\u51fa\u4e00\u53f0\u8ba1\u7b97\u673a\uff0c\u5e76\u5728\u4e0a\u9762\u8fd0\u884c\u4fc4\u7f57\u65af\u65b9\u5757\u5c0f\u6e38\u620f\u3002\u4e00\u95e8\u8bfe\u91cc\u6db5\u76d6\u4e86\u7f16\u8bd1\u3001\u865a\u62df\u673a\u3001\u6c47\u7f16\u3001\u4f53\u7cfb\u7ed3\u6784\u3001\u6570\u5b57\u7535\u8def\u3001\u903b\u8f91\u95e8\u7b49\u7b49\u4ece\u4e0a\u81f3\u4e0b\u3001\u4ece\u8f6f\u81f3\u786c\u7684\u5404\u7c7b\u77e5\u8bc6\uff0c\u975e\u5e38\u5168\u9762\u3002\u96be\u5ea6\u4e0a\u4e5f\u662f\u901a\u8fc7\u7cbe\u5fc3\u7684\u8bbe\u8ba1\uff0c\u7565\u53bb\u4e86\u4f17\u591a\u73b0\u4ee3\u8ba1\u7b97\u673a\u590d\u6742\u7684\u7ec6\u8282\uff0c\u63d0\u53d6\u51fa\u4e86\u6700\u6838\u5fc3\u672c\u8d28\u7684\u4e1c\u897f\uff0c\u529b\u56fe\u8ba9\u6bcf\u4e2a\u4eba\u90fd\u80fd\u7406\u89e3\u3002\u5728\u4f4e\u5e74\u7ea7\uff0c\u5982\u679c\u5c31\u80fd\u4ece\u5b8f\u89c2\u4e0a\u5efa\u7acb\u5bf9\u6574\u4e2a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7684\u9e1f\u77b0\u56fe\uff0c\u662f\u5927\u6709\u88e8\u76ca\u7684\u3002","title":"\u5165\u95e8\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_30","text":"\u5f53\u7136\uff0c\u5982\u679c\u60f3\u6df1\u5165\u73b0\u4ee3\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\u7684\u590d\u6742\u7ec6\u8282\uff0c\u8fd8\u5f97\u4e0a\u4e00\u95e8\u5927\u5b66\u672c\u79d1\u96be\u5ea6\u7684\u8bfe\u7a0b UCB CS61C: Great Ideas in Computer Architecture \u3002UC Berkeley\u4f5c\u4e3aRISC-V\u67b6\u6784\u7684\u53d1\u6e90\u5730\uff0c\u5728\u4f53\u7cfb\u7ed3\u6784\u9886\u57df\u7b97\u5f97\u4e0a\u9996\u5c48\u4e00\u6307\u3002\u5176\u8bfe\u7a0b\u975e\u5e38\u6ce8\u91cd\u5b9e\u8df5\uff0c\u4f60\u4f1a\u5728Project\u4e2d\u624b\u5199\u6c47\u7f16\u6784\u9020\u795e\u7ecf\u7f51\u7edc\uff0c\u4ece\u96f6\u5f00\u59cb\u642d\u5efa\u4e00\u4e2aCPU\uff0c\u8fd9\u4e9b\u5b9e\u8df5\u90fd\u4f1a\u8ba9\u4f60\u5bf9\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\u6709\u66f4\u4e3a\u6df1\u5165\u7684\u7406\u89e3\uff0c\u800c\u4e0d\u662f\u4ec5\u505c\u7559\u4e8e\u201c\u53d6\u6307\u8bd1\u7801\u6267\u884c\u8bbf\u5b58\u5199\u56de\u201d\u7684\u5355\u8c03\u80cc\u8bf5\u91cc\u3002","title":"\u4e13\u4e1a\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_31","text":"\u8ba1\u7b97\u673a\u7cfb\u7edf\u662f\u4e00\u4e2a\u5e9e\u6742\u800c\u6df1\u523b\u7684\u4e3b\u9898\uff0c\u5728\u6df1\u5165\u5b66\u4e60\u67d0\u4e2a\u7ec6\u5206\u9886\u57df\u4e4b\u524d\uff0c\u5bf9\u5404\u4e2a\u9886\u57df\u6709\u4e00\u4e2a\u5b8f\u89c2\u6982\u5ff5\u6027\u7684\u7406\u89e3\uff0c\u5bf9\u4e00\u4e9b\u901a\u7528\u6027\u7684\u8bbe\u8ba1\u539f\u5219\u6709\u6240\u77e5\u6653\uff0c\u4f1a\u8ba9\u4f60\u5728\u4e4b\u540e\u7684\u6df1\u5165\u5b66\u4e60\u4e2d\u4e0d\u65ad\u5f3a\u5316\u4e00\u4e9b\u6700\u4e3a\u6838\u5fc3\u4e43\u81f3\u54f2\u5b66\u7684\u6982\u5ff5\uff0c\u800c\u4e0d\u4f1a\u684e\u688f\u4e8e\u590d\u6742\u7684\u5185\u90e8\u7ec6\u8282\u548c\u5404\u79cdtrick\u3002\u56e0\u4e3a\u5728\u6211\u770b\u6765\uff0c\u5b66\u4e60\u7cfb\u7edf\u6700\u5173\u952e\u7684\u8fd8\u662f\u60f3\u8ba9\u4f60\u9886\u609f\u5230\u8fd9\u4e9b\u6700\u6838\u5fc3\u7684\u4e1c\u897f\uff0c\u4ece\u800c\u80fd\u591f\u8bbe\u8ba1\u548c\u5b9e\u73b0\u51fa\u5c5e\u4e8e\u81ea\u5df1\u7684\u7cfb\u7edf\u3002 MIT6.033: System Engineering \u662fMIT\u7684\u7cfb\u7edf\u5165\u95e8\u8bfe\uff0c\u4e3b\u9898\u6d89\u53ca\u4e86\u64cd\u4f5c\u7cfb\u7edf\u3001\u7f51\u7edc\u3001\u5206\u5e03\u5f0f\u548c\u7cfb\u7edf\u5b89\u5168\uff0c\u9664\u4e86\u77e5\u8bc6\u70b9\u7684\u4f20\u6388\u5916\uff0c\u8fd9\u95e8\u8bfe\u8fd8\u4f1a\u8bb2\u6388\u4e00\u4e9b\u5199\u4f5c\u548c\u8868\u8fbe\u4e0a\u7684\u6280\u5de7\uff0c\u8ba9\u4f60\u5b66\u4f1a\u5982\u4f55\u8bbe\u8ba1\u5e76\u5411\u522b\u4eba\u4ecb\u7ecd\u548c\u5206\u6790\u81ea\u5df1\u7684\u7cfb\u7edf\u3002\u8fd9\u672c\u4e66\u914d\u5957\u7684\u6559\u6750 Principles of Computer System Design: An Introduction \u4e5f\u5199\u5f97\u975e\u5e38\u597d\uff0c\u63a8\u8350\u5927\u5bb6\u9605\u8bfb\u3002 CMU 15-213: Introduction to Computer System \u662fCMU\u7684\u7cfb\u7edf\u5165\u95e8\u8bfe\uff0c\u5185\u5bb9\u8986\u76d6\u4e86\u4f53\u7cfb\u7ed3\u6784\u3001\u64cd\u4f5c\u7cfb\u7edf\u3001\u94fe\u63a5\u3001\u5e76\u884c\u3001\u7f51\u7edc\u7b49\u7b49\uff0c\u517c\u5177\u5e7f\u5ea6\u548c\u6df1\u5ea6\uff0c\u914d\u5957\u7684\u6559\u6750 Computer Systems: A Programmer's Perspective \u4e5f\u662f\u8d28\u91cf\u6781\u9ad8\uff0c\u5f3a\u70c8\u5efa\u8bae\u9605\u8bfb\u3002","title":"\u7cfb\u7edf\u5165\u95e8"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_32","text":"\u64cd\u4f5c\u7cfb\u7edf\u4f5c\u4e3a\u6240\u6709\u5e94\u7528\u8f6f\u4ef6\u548c\u5e95\u5c42\u786c\u4ef6\u4ea4\u4e92\u7684\u638c\u8235\u8005\uff0c\u4e86\u89e3\u5b83\u7684\u5185\u90e8\u539f\u7406\u548c\u8bbe\u8ba1\u539f\u5219\u5bf9\u4e8e\u4e00\u4e2a\u4e0d\u6ee1\u8db3\u4e8e\u8c03\u5305\u4fa0\u7684\u7a0b\u5e8f\u5458\u6765\u8bf4\u662f\u5f88\u6709\u5e2e\u52a9\u7684\u3002\u540c\u65f6\uff0c\u56fd\u5916\u64cd\u7edf\u8bfe\u7a0b\u7684\u8d28\u91cf\u4e5f\u662f\u8ba9\u4e0a\u4e86\u591a\u5e74\u7f51\u8bfe\u7684\u6211\u4e5f\u611f\u5230\u77a0\u76ee\u7ed3\u820c\u3002 MIT 6.S081: Operating System Engineering \uff0cMIT\u8457\u540dPDOS\u5b9e\u9a8c\u5ba4\u51fa\u54c1\uff0c11\u4e2aProject\u4f1a\u8ba9\u4f60\u5728\u4e00\u4e2a2\u4e07\u591a\u884c\u7684\u6559\u5b66\u7528\u8ff7\u4f60\u64cd\u4f5c\u7cfb\u7edf\u4e0a\u589e\u52a0\u5404\u7c7b\u529f\u80fd\u6a21\u5757\u3002\u8fd9\u95e8\u8bfe\u4e5f\u8ba9\u6211\u6df1\u523b\u8ba4\u8bc6\u5230\uff0c\u505a\u7cfb\u7edf\u4e0d\u662f\u9760PPT\u5ff5\u51fa\u6765\u7684\uff0c\u662f\u5f97\u51e0\u4e07\u884c\u4ee3\u7801\u4e00\u70b9\u70b9\u7d2f\u8d77\u6765\u7684\u3002 UCB CS162: Operating System \uff0c\u4f2f\u514b\u5229\u7684\u64cd\u4f5c\u7cfb\u7edf\u8bfe\uff0c\u91c7\u7528\u548cStanford\u540c\u6837\u7684Project \u2014\u2014 \u4e00\u4e2a\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edfPintos\u3002\u6211\u4f5c\u4e3a\u4e0b\u5b66\u671f\u5317\u4eac\u5927\u5b66\u64cd\u4f5c\u7cfb\u7edf\u5b9e\u9a8c\u73ed\u7684\u52a9\u6559\uff0c\u4f1a\u5c1d\u8bd5\u5f15\u5165\u8fd9\u4e2aProject\uff0c\u6b22\u8fce\u5927\u5bb6\u9009\u8bfe\u5c1d\u8bd5\uff0c\u540c\u65f6\u8bfe\u7a0b\u8d44\u6e90\u4e5f\u4f1a\u5168\u90e8\u5f00\u6e90\uff0c\u76ee\u524d \u8bfe\u7a0b\u7f51\u7ad9 \u6b63\u5728\u5efa\u8bbe\u5f53\u4e2d\u3002","title":"\u64cd\u4f5c\u7cfb\u7edf"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_33","text":"\u60f3\u5fc5\u8fd9\u4e24\u5e74\u5404\u7c7bCS\u8bb2\u5ea7\u91cc\u6700\u5e38\u542c\u5230\u7684\u8bdd\u5c31\u662f\u201c\u6469\u5c14\u5b9a\u5f8b\u6b63\u5728\u8d70\u5411\u7ec8\u7ed3\u201d\uff0c\u6b64\u8bdd\u4e0d\u5047\u3002\u540c\u65f6\u5982\u4eca\u6df1\u5ea6\u5b66\u4e60\u7684\u5174\u8d77\u5bfc\u81f4\u5bf9\u8ba1\u7b97\u673a\u7b97\u529b\u4e0e\u5b58\u50a8\u7684\u8981\u6c42\u90fd\u8fbe\u5230\u4e86\u524d\u6240\u672a\u6709\u7684\u9ad8\u5ea6\uff0c\u56e0\u6b64\u5e76\u884c\u548c\u5206\u5e03\u5f0f\u7cfb\u7edf\u5df2\u6210\u4e3a\u4e00\u9879\u70ed\u95e8\u6280\u672f\u8bdd\u9898\u3002","title":"\u5e76\u884c\u4e0e\u5206\u5e03\u5f0f\u7cfb\u7edf"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_34","text":"CMU 15-418/Stanford CS149: Parallel Computing","title":"\u5e76\u884c\u8ba1\u7b97"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_35","text":"MIT 6.824: Distributed System","title":"\u5206\u5e03\u5f0f\u7cfb\u7edf"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_36","text":"\u4e0d\u77e5\u9053\u4f60\u5f53\u5e74\u9009\u62e9\u8ba1\u7b97\u673a\u662f\u4e0d\u662f\u56e0\u4e3a\u6000\u7740\u4e00\u4e2a\u4e2d\u4e8c\u7684\u9ed1\u5ba2\u68a6\u60f3\uff0c\u4f46\u73b0\u5b9e\u5374\u662f\u6210\u4e3a\u9ed1\u5ba2\u9053\u963b\u4e14\u957f\u3002","title":"\u7cfb\u7edf\u5b89\u5168"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_37","text":"UCB CS161: Computer Security \u662f\u4f2f\u514b\u5229\u7684\u7cfb\u7edf\u5b89\u5168\u8bfe\u7a0b\uff0c\u4f1a\u6db5\u76d6\u6808\u653b\u51fb\u3001\u5bc6\u7801\u5b66\u3001\u7f51\u7ad9\u5b89\u5168\u3001\u7f51\u7edc\u5b89\u5168\u7b49\u7b49\u5185\u5bb9\u3002","title":"\u7406\u8bba"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_38","text":"\u638c\u63e1\u8fd9\u4e9b\u7406\u8bba\u77e5\u8bc6\u4e4b\u540e\uff0c\u8fd8\u9700\u8981\u5728\u5b9e\u8df5\u4e2d\u57f9\u517b\u548c\u953b\u70bc\u8fd9\u4e9b\u201c\u5b89\u5168\u7d20\u517b\u201d\u3002 CTF\u593a\u65d7\u8d5b \u662f\u4e00\u9879\u6bd4\u8f83\u70ed\u95e8\u7684\u7cfb\u7edf\u5b89\u5168\u6bd4\u8d5b\uff0c\u8d5b\u9898\u4e2d\u4f1a\u878d\u4f1a\u8d2f\u901a\u5730\u8003\u5bdf\u4f60\u5bf9\u8ba1\u7b97\u673a\u5404\u4e2a\u9886\u57df\u77e5\u8bc6\u7684\u7406\u89e3\u548c\u8fd0\u7528\u3002\u5317\u5927\u4eca\u5e74\u4e5f\u6210\u529f\u4e3e\u529e\u4e86 \u7b2c0\u5c4a\u548c\u7b2c1\u5c4a \uff0c\u4e5f\u9f13\u52b1\u5927\u5bb6\u540e\u671f\u8e0a\u8dc3\u53c2\u4e0e\uff0c\u5728\u5b9e\u8df5\u4e2d\u63d0\u9ad8\u81ea\u5df1\u3002\u4e0b\u9762\u5217\u4e3e\u4e00\u4e9b\u6211\u5e73\u65f6\u5b66\u4e60\uff08\u6478\u9c7c\uff09\u7528\u5230\u7684\u8d44\u6e90\uff1a CTF-wiki CTF-101 Hacker-101","title":"\u5b9e\u8df5"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_39","text":"\u8ba1\u7f51\u8457\u540d\u6559\u6750\u300a\u81ea\u9876\u5411\u4e0b\u65b9\u6cd5\u300b\u7684\u914d\u5957\u5b66\u4e60\u8d44\u6e90 Computer Networking: A Top-Down Approach \u3002 \u6ca1\u6709\u4ec0\u4e48\u80fd\u6bd4\u81ea\u5df1\u5199\u4e2aTCP/IP\u534f\u8bae\u6808\u66f4\u80fd\u52a0\u6df1\u81ea\u5df1\u5bf9\u8ba1\u7b97\u673a\u7f51\u7edc\u7684\u7406\u89e3\u4e86\uff0c\u6240\u4ee5\u4e0d\u59a8\u8bd5\u8bd5 Stanford CS144: Computer Network \uff0c8\u4e2aProject\u5e26\u4f60\u5b9e\u73b0\u6574\u4e2a\u534f\u8bae\u6808\u3002","title":"\u8ba1\u7b97\u673a\u7f51\u7edc"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_40","text":"\u6ca1\u6709\u4ec0\u4e48\u80fd\u6bd4\u81ea\u5df1\u5199\u4e2a\u5173\u7cfb\u578b\u6570\u636e\u5e93\u66f4\u80fd\u52a0\u6df1\u81ea\u5df1\u5bf9\u6570\u636e\u5e93\u7cfb\u7edf\u7684\u7406\u89e3\u4e86\u3002","title":"\u6570\u636e\u5e93\u7cfb\u7edf"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#c_1","text":"CMU 15-445: Introduction to Database System","title":"C++\u7248"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#java","text":"UCB CS186: Introduction to Database System","title":"Java\u7248"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_41","text":"\u6ca1\u6709\u4ec0\u4e48\u80fd\u6bd4\u81ea\u5df1\u5199\u4e2a\u7f16\u8bd1\u5668\u66f4\u80fd\u52a0\u6df1\u81ea\u5df1\u5bf9\u7f16\u8bd1\u5668\u7684\u7406\u89e3\u4e86\u3002 Stanford CS143: Compilers","title":"\u7f16\u8bd1\u539f\u7406"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_42","text":"Games101","title":"\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#web","text":"\u7f51\u7ad9\u7684\u5f00\u53d1\u5f88\u5c11\u5728\u8ba1\u7b97\u673a\u7684\u57f9\u517b\u65b9\u6848\u91cc\u88ab\u91cd\u89c6\uff0c\u4f46\u5176\u5b9e\u638c\u63e1\u8fd9\u9879\u6280\u80fd\u8fd8\u662f\u597d\u5904\u591a\u591a\u7684\uff0c\u4f8b\u5982\u642d\u5efa\u81ea\u5df1\u7684\u4e2a\u4eba\u4e3b\u9875\uff0c\u6291\u6216\u662f\u7ed9\u81ea\u5df1\u7684\u8bfe\u7a0b\u9879\u76ee\u505a\u4e00\u4e2a\u7cbe\u5f69\u7684\u5c55\u793a\u7f51\u9875\u3002","title":"Web\u5f00\u53d1"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_43","text":"MIT web development course","title":"\u4e24\u5468\u901f\u6210\u7248"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_44","text":"Stanford CS142: Web Applications","title":"\u7cfb\u7edf\u5b66\u4e60\u7248"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_45","text":"UCB Data100: Principles and Techniques of Data Science","title":"\u6570\u636e\u79d1\u5b66"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_46","text":"","title":"\u4eba\u5de5\u667a\u80fd"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_47","text":"Harvard CS50\u2019s Introduction to AI with Python","title":"\u5165\u95e8\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_48","text":"UCB CS188: Introduction to Artificial Intelligence","title":"\u4e13\u4e1a\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_49","text":"","title":"\u673a\u5668\u5b66\u4e60"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_50","text":"Coursera: Machine Learning","title":"\u5165\u95e8\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_51","text":"Stanford CS229: Machine Learning UCB CS189: Introduction to Machine Learning","title":"\u4e13\u4e1a\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_52","text":"","title":"\u6df1\u5ea6\u5b66\u4e60"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_53","text":"Coursera: Deep Learning \u53f0\u6e7e\u56fd\u7acb\u5927\u5b66\uff1a\u674e\u5b8f\u6bc5\u673a\u5668\u5b66\u4e60","title":"\u5165\u95e8\u8bfe"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_54","text":"Stanford CS231n: CNN for Visual Recognition","title":"\u8ba1\u7b97\u673a\u89c6\u89c9"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_55","text":"Stanford CS224n: Natural Language Processing","title":"\u81ea\u7136\u8bed\u8a00\u5904\u7406"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_56","text":"Stanford CS224w: Machine Learning with Graphs","title":"\u56fe\u795e\u7ecf\u7f51\u7edc"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_57","text":"UCB CS285: Deep Reinforcement Learning","title":"\u5f3a\u5316\u5b66\u4e60"},{"location":"CS%E5%AD%A6%E4%B9%A0%E8%A7%84%E5%88%92/#_58","text":"\u6388\u4eba\u4ee5\u9c7c\u4e0d\u5982\u6388\u4eba\u4ee5\u6e14\u3002 \u4ee5\u4e0a\u7684\u8bfe\u7a0b\u89c4\u5212\u96be\u514d\u6709\u5f3a\u70c8\u7684\u4e2a\u4eba\u503e\u5411\u548c\u559c\u597d\uff0c\u4e0d\u4e00\u5b9a\u9002\u5408\u6240\u6709\u4eba\uff0c\u66f4\u591a\u7684\u662f\u8d77\u5230\u629b\u7816\u5f15\u7389\u7684\u4f5c\u7528\u3002\u5982\u679c\u4f60\u60f3\u6311\u9009\u81ea\u5df1\u611f\u5174\u8da3\u7684\u65b9\u5411\u548c\u5185\u5bb9\u52a0\u4ee5\u5b66\u4e60\uff0c\u53ef\u4ee5\u53c2\u8003\u6211\u5728\u4e0b\u9762\u5217\u51fa\u6765\u7684\u8d44\u6e90\u3002 MIT OpenCourseWare : \u9ebb\u7701\u7406\u5de5\u5b66\u9662\u7684\u8bfe\u7a0b\u8d44\u6e90\u5f00\u653e\u5171\u4eab\u9879\u76ee\uff0c\u6536\u5f55\u4e86\u6570\u4ee5\u5343\u8ba1\u7684\u5404\u79d1\u8bfe\u7a0b\u8d44\u6e90\uff0c\u5176\u4e2d\u8ba1\u7b97\u673a\u7c7b\u7684\u8bfe\u53f7\u662f6.xxx\u3002 MIT CS Course List \uff1a\u9ebb\u7701\u7406\u5de5\u5b66\u9662\u7684CS\u8bfe\u7a0b\u5217\u8868\u3002 UC Berkeley EECS Course Map \uff1aUC Berkeley\u7684EECS\u57f9\u517b\u65b9\u6848\uff0c\u4ee5\u8bfe\u7a0b\u5730\u56fe\u7684\u65b9\u5f0f\u5c06\u5404\u95e8\u8bfe\u7a0b\u7684\u7c7b\u522b\u548c\u5148\u4fee\u5173\u7cfb\u4e00\u76ee\u4e86\u7136\u5730\u5448\u73b0\uff0c\u5176\u4e2d\u7edd\u5927\u591a\u6570\u8bfe\u7a0b\u672c\u4e66\u4e2d\u5747\u6709\u6536\u5f55\u3002 UC Berkeley CS Course List : UC Berkeley\u7684CS\u8bfe\u7a0b\u5217\u8868\u3002 Stanford CS Course List : \u65af\u5766\u798f\u7684CS\u8bfe\u7a0b\u5217\u8868\u3002","title":"\u5b9a\u5236\u5c5e\u4e8e\u4f60\u7684\u8bfe\u7a0b\u5730\u56fe"},{"location":"%E5%90%8E%E8%AE%B0/","text":"\u4ece\u6700\u521d\u7684\u60f3\u6cd5\u5f00\u59cb\uff0c\u5230\u65ad\u65ad\u7eed\u7eed\u5b8c\u6210\u8fd9\u672c\u4e66\uff0c\u518d\u5230\u6811\u6d1e\u7684\u70ed\u70c8\u53cd\u54cd\uff0c\u6211\u5f88\u6fc0\u52a8\uff0c\u4f46\u4e5f\u4e94\u5473\u6742\u9648\u3002\u539f\u6765\u5728\u5317\u5927\u8fd9\u4e2a\u56ed\u5b50\u91cc\uff0c\u4e5f\u6709\u90a3\u4e48\u591a\u4eba\uff0c\u5bf9\u81ea\u5df1\u7684\u672c\u79d1\u751f\u6daf\u5e76\u4e0d\u6ee1\u610f\u3002\u800c\u8fd9\u91cc\uff0c\u53ef\u662f\u56ca\u62ec\u4e86\u4e2d\u56fd\u975e\u5e38\u4f18\u79c0\u7684\u4e00\u5e2e\u5e74\u8f7b\u4eba\u3002\u6240\u4ee5\u95ee\u9898\u51fa\u5728\u54ea\u91cc\uff1f\u6211\u4e0d\u77e5\u9053\u3002 \u6211\u53ea\u662f\u4e2a\u7c4d\u7c4d\u65e0\u540d\u7684\u672c\u79d1\u751f\u5440\uff0c\u53ea\u662f\u4e00\u4e2a\u5355\u7eaf\u7684\u6c42\u5b66\u8005\uff0c\u6211\u7684\u76ee\u6807\u53ea\u662f\u60f3\u5feb\u4e50\u5730\u3001\u81ea\u7531\u5730\u3001\u9ad8\u8d28\u91cf\u5730\u638c\u63e1\u90a3\u4e9b\u4e13\u4e1a\u77e5\u8bc6\uff0c\u6211\u60f3\uff0c\u6b63\u5728\u770b\u8fd9\u672c\u4e66\u7684\u5927\u591a\u6570\u672c\u79d1\u751f\u4e5f\u662f\u5982\u6b64\uff0c\u8c01\u60f3\u4ed8\u51fa\u65f6\u95f4\u4f46\u5374\u6536\u6548\u751a\u5fae\u5462\uff1f\u53c8\u662f\u8c01\u8feb\u4f7f\u5927\u5bb6\u5e26\u7740\u75db\u82e6\u53bb\u5e94\u4ed8\u5462\uff1f\u6211\u4e0d\u77e5\u9053\u3002 \u6211\u5199\u8fd9\u672c\u4e66\u7edd\u4e0d\u662f\u4e3a\u4e86\u9f13\u52b1\u5927\u5bb6\u7fd8\u8bfe\u81ea\u5b66\uff0c\u8bd5\u95ee\u8c01\u4e0d\u60f3\u5728\u8bfe\u5802\u4e0a\u548c\u90a3\u4e48\u591a\u4f18\u79c0\u7684\u540c\u5b66\u6d4e\u6d4e\u4e00\u5802\uff0c\u70ed\u70c8\u8ba8\u8bba\u5462\uff1f\u8c01\u4e0d\u60f3\u9047\u5230\u95ee\u9898\u76f4\u63a5\u627e\u8001\u5e08\u7b54\u7591\u89e3\u60d1\u5462\uff1f\u8c01\u4e0d\u60f3\u8f9b\u82e6\u5b66\u4e60\u7684\u6210\u679c\u53ef\u4ee5\u76f4\u63a5\u5316\u4f5c\u5b66\u6821\u627f\u8ba4\u7684\u5b66\u5206\u7ee9\u70b9\u5462\uff1f\u53ef\u5982\u679c\u4e00\u4e2a\u5162\u5162\u4e1a\u4e1a\u3001\u6309\u65f6\u5230\u5802\u7684\u5b66\u751f\u6536\u83b7\u7684\u5374\u662f\u75db\u82e6\uff0c\u800c\u90a3\u4e2a\u4e00\u5b66\u671f\u53ea\u6709\u8003\u8bd5\u4f1a\u51fa\u5e2d\u7684\u5b66\u751f\u5374\u5b66\u5f97\u81ea\u5f97\u5176\u4e50\uff0c\u8fd9\u516c\u5e73\u5417\uff1f\u6211\u4e0d\u77e5\u9053\u3002 \u6211\u53ea\u662f\u4e0d\u7518\uff0c\u4e0d\u7518\u5fc3\u8fd9\u4e9b\u901a\u8fc7\u9ad8\u8003\u6218\u80dc\u65e0\u6570\u4eba\u8fdb\u5165\u9ad8\u6821\u7684\u5b66\u5b50\u672c\u53ef\u4ee5\u6536\u83b7\u4e00\u4e2a\u66f4\u5feb\u4e50\u7684\u672c\u79d1\u751f\u6daf\uff0c\u4f46\u73b0\u5b9e\u5374\u7559\u7ed9\u4e86\u4ed6\u4eec\u9057\u61be\u3002\u6211\u53cd\u95ee\u81ea\u5df1\uff0c\u672c\u79d1\u6559\u80b2\u7a76\u7adf\u5e94\u8be5\u5e26\u7ed9\u6211\u4eec\u4ec0\u4e48\u5462\uff1f\u662f\u5b66\u5b8c\u6240\u6709\u8fd9\u4e9b\u8bfe\u7a0b\u5417\uff1f\u5012\u4e5f\u672a\u5fc5\uff0c\u5b83\u4e5f\u8bb8\u53ea\u9002\u5408\u6211\u8fd9\u79cdnerd\u3002\u4f46\u6211\u89c9\u5f97\uff0c\u672c\u79d1\u6559\u80b2\u81f3\u5c11\u5f97\u5c55\u73b0\u5b83\u5e94\u6709\u7684\u8bda\u610f\uff0c\u4e00\u79cd\u5206\u4eab\u77e5\u8bc6\u7684\u8bda\u610f\uff0c\u4e00\u79cd\u4ee5\u4eba\u4e3a\u672c\u7684\u8bda\u610f\uff0c\u4e00\u79cd\u6ce8\u91cd\u5b66\u751f\u4f53\u9a8c\u7684\u8bda\u610f\u3002\u5b83\u81f3\u5c11\u4e0d\u5e94\u8be5\u662f\u4e00\u79cd\u6076\u610f\uff0c\u4e00\u79cd\u62fc\u6bd4\u77e5\u8bc6\u7684\u6076\u610f\uff0c\u4e00\u79cd\u80dc\u8005\u4e3a\u738b\u7684\u6076\u610f\uff0c\u4e00\u79cd\u8ba9\u4eba\u5b66\u65e0\u6240\u5f97\u7684\u6076\u610f\u3002\u4f46\u8fd9\u4e00\u5207\u80fd\u6539\u53d8\u5417\uff1f\u6211\u4e0d\u77e5\u9053\u3002 \u6211\u53ea\u77e5\u9053\u6211\u505a\u4e86\u5e94\u8be5\u505a\u7684\u4e8b\u60c5\uff0c\u5b66\u751f\u4eec\u4f1a\u7528\u811a\u6295\u7968\uff0c\u6811\u6d1e\u7684\u5173\u6ce8\u91cf\u548c\u56de\u5e16\u6570\u8bc1\u660e\u4e86\u8fd9\u6837\u4e00\u4efd\u8d44\u6599\u662f\u6709\u4ef7\u503c\u7684\uff0c\u4e5f\u9053\u51fa\u4e86\u56fd\u5185CS\u672c\u79d1\u6559\u80b2\u548c\u56fd\u5916\u7684\u5dee\u8ddd\u3002\u4e5f\u8bb8\u8fd9\u6837\u7684\u6539\u53d8\u662f\u5fae\u4e4e\u5176\u5fae\u7684\uff0c\u4f46\u522b\u5fd8\u4e86\u6211\u53ea\u662f\u4e00\u4e2a\u7c4d\u7c4d\u65e0\u540d\u7684\u672c\u79d1\u751f\uff0c\u662f\u5317\u5927\u4fe1\u79d1\u4e00\u5343\u591a\u540d\u672c\u79d1\u751f\u4e2d\u7684\u666e\u901a\u4e00\u5458\uff0c\u662f\u4e2d\u56fd\u51e0\u767e\u4e07\u5728\u8bfb\u672c\u79d1\u751f\u4e2d\u7684\u4e00\u5206\u5b50\uff0c\u5982\u679c\u6709\u66f4\u591a\u7684\u4eba\u7ad9\u51fa\u6765\uff0c\u6bcf\u4e2a\u4eba\u505a\u4e00\u70b9\u70b9\uff0c\u4e5f\u8bb8\u662f\u5206\u4eab\u4e00\u4e2a\u5e16\u5b50\uff0c\u4e5f\u8bb8\u662f\u5f53\u4e00\u95e8\u8bfe\u7684\u52a9\u6559\uff0c\u4e5f\u8bb8\u662f\u7cbe\u5fc3\u8bbe\u8ba1\u4e00\u95e8\u8bfe\u7684lab\uff0c\u66f4\u6216\u8bb8\u662f\u5c06\u6765\u83b7\u5f97\u6559\u804c\u4e4b\u540e\u5f00\u8bbe\u4e00\u95e8\u9ad8\u8d28\u91cf\u7684\u8bfe\u7a0b\uff0c\u51fa\u7248\u4e00\u672c\u7ecf\u5178\u7684\u6559\u6750\u3002\u672c\u79d1\u6559\u80b2\u771f\u7684\u6709\u4ec0\u4e48\u6280\u672f\u58c1\u5792\u5417\uff1f\u6211\u770b\u672a\u5fc5\uff0c\u6559\u80b2\u9760\u7684\u662f\u8bda\u610f\uff0c\u9760\u7684\u662f\u80b2\u4eba\u4e4b\u5fc3\u3002 \u4eca\u5929\u662f2021\u5e7412\u670812\u65e5\uff0c\u6211\u671f\u5f85\u5728\u4e0d\u4e45\u7684\u5c06\u6765\u8fd9\u4e2a\u5e16\u5b50\u4f1a\u88ab\u9057\u5fd8\uff0c\u5927\u5bb6\u53ef\u4ee5\u6ee1\u5fc3\u6b22\u559c\u5730\u9009\u7740\u81ea\u5df1\u57f9\u517b\u65b9\u6848\u4e0a\u7684\u8bfe\u7a0b\uff0c\u505a\u7740\u5b66\u6821\u81ea\u884c\u8bbe\u8ba1\u7684\u5404\u7c7b\u7f16\u7a0b\u5b9e\u9a8c\uff0c\u8bfe\u5802\u6ca1\u6709\u7b7e\u5230\u4e5f\u80fd\u6d4e\u6d4e\u4e00\u5802\uff0c\u5b66\u751f\u8e0a\u8dc3\u5730\u53d1\u8a00\u4e92\u52a8\uff0c\u5927\u5bb6\u7684\u6536\u83b7\u53ef\u4ee5\u548c\u52aa\u529b\u6210\u6b63\u6bd4\uff0c\u90a3\u4e9b\u66fe\u7ecf\u7684\u9057\u61be\u548c\u75db\u82e6\u53ef\u4ee5\u6c38\u8fdc\u6210\u4e3a\u5386\u53f2\u3002\u6211\u771f\u7684\u5f88\u671f\u5f85\u90a3\u4e00\u5929\uff0c\u771f\u7684\u771f\u7684\u771f\u7684\u5f88\u671f\u5f85\u3002 PKUFlyingPig 2021\u5e7412\u670812\u65e5\u5199\u4e8e\u71d5\u56ed","title":"\u540e\u8bb0"},{"location":"%E5%9F%B9%E5%85%BB%E6%96%B9%E6%A1%88Pro/","text":"under construction.","title":"\u57f9\u517b\u65b9\u6848Pro"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/","text":"\u597d\u4e66\u63a8\u8350 \u7531\u4e8e\u7248\u6743\u539f\u56e0\uff0c\u4e0b\u9762\u5217\u4e3e\u7684\u56fe\u4e66\u4e2d\u9664\u4e86\u5f00\u6e90\u4e66\u7c4d\u63d0\u4f9b\u4e86\u94fe\u63a5\uff0c\u5176\u4ed6\u7684\u8d44\u6e90\u8bf7\u5927\u5bb6\u81ea\u884c\u901a\u8fc7 libgen \u67e5\u627e\u3002 \u53e6\u5916\u518d\u5b89\u5229\u4e00\u4e2aGithub\u9876\u6d41\u70ed\u95e8\u9879\u76ee free-programming-books \uff0c\u6536\u96c6\u4e86\u975e\u5e38\u591a\u7684\u514d\u8d39\u5f00\u6e90\u7f16\u7a0b\u4e66\u7c4d\u3002 \u7cfb\u7edf\u5165\u95e8 Principles of Computer System Design: An Introduction Computer Systems: A Programmer's Perspective \u64cd\u4f5c\u7cfb\u7edf Operating Systems: Three Easy Pieces Operating Systems: Principles and Practice (2nd Edition) \u73b0\u4ee3\u64cd\u4f5c\u7cfb\u7edf: \u539f\u7406\u4e0e\u5b9e\u73b0 (\u94f6\u674f\u4e66) \u8ba1\u7b97\u673a\u7f51\u7edc Computer Networks: A Systems Approach Computer Networking: A Top-Down Approach \u7f16\u8bd1\u539f\u7406 My First Language Frontend with LLVM Tutorial Compilers: Principles, Techniques, and Tools (Dragon Book) \u8ba1\u7b97\u673a\u8bed\u8a00\uff08PL\uff09 Essentials of Programming Languages (EOPL) Types and Programming Languages (TAPL) ( \u5317\u5927\u76f8\u5173\u8bfe\u7a0b ) Practical Foundations for Programming Languages (PFPL) Software Foundations (SF) ( \u5317\u5927\u76f8\u5173\u8bfe\u7a0b ) \u4f53\u7cfb\u7ed3\u6784 Computer Architecture: A Quantitative Approach 5th Edition \u5206\u5e03\u5f0f\u7cfb\u7edf Patterns of Distributed System Distributed Systems for fun and profit \u6570\u636e\u5bc6\u96c6\u578b\u7cfb\u7edf\u8bbe\u8ba1 Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems ( \u5f00\u6e90\u4e2d\u6587\u7ffb\u8bd1 ) \u5bc6\u7801\u5b66 Cryptography Engineering: Design Principles and Practical Applications Introduction to modern cryptography (second edition) By Jonathon Katz & Yehuda Lindell \u4ece\u5bc6\u7801\u5b66\u7684\u6700\u57fa\u7840\u5f00\u59cb\u8bb2\u8d77\uff0c\u5bf9\u4f20\u7edf\u5bc6\u7801\u5b66\u7684\u5404\u65b9\u9762\u90fd\u6709\u6d89\u53ca\uff0c\u8bfe\u7a0b\u5185\u5bb9\u5168\u9762\uff0c\u662f\u5bc6\u7801\u5b66\u5165\u95e8\u5f88\u597d\u7684\u4e00\u672c\u4e66 \u6570\u636e\u5e93\u7cfb\u7edf Database System Concepts Architecture of a Database System \u8ba1\u7b97\u673a\u56fe\u5f62\u5b66 Fundamentals of Computer Graphics \u6df1\u5ea6\u5b66\u4e60 \u52a8\u624b\u5b66\u6df1\u5ea6\u5b66\u4e60","title":"\u597d\u4e66\u63a8\u8350"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_1","text":"\u7531\u4e8e\u7248\u6743\u539f\u56e0\uff0c\u4e0b\u9762\u5217\u4e3e\u7684\u56fe\u4e66\u4e2d\u9664\u4e86\u5f00\u6e90\u4e66\u7c4d\u63d0\u4f9b\u4e86\u94fe\u63a5\uff0c\u5176\u4ed6\u7684\u8d44\u6e90\u8bf7\u5927\u5bb6\u81ea\u884c\u901a\u8fc7 libgen \u67e5\u627e\u3002 \u53e6\u5916\u518d\u5b89\u5229\u4e00\u4e2aGithub\u9876\u6d41\u70ed\u95e8\u9879\u76ee free-programming-books \uff0c\u6536\u96c6\u4e86\u975e\u5e38\u591a\u7684\u514d\u8d39\u5f00\u6e90\u7f16\u7a0b\u4e66\u7c4d\u3002","title":"\u597d\u4e66\u63a8\u8350"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_2","text":"Principles of Computer System Design: An Introduction Computer Systems: A Programmer's Perspective","title":"\u7cfb\u7edf\u5165\u95e8"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_3","text":"Operating Systems: Three Easy Pieces Operating Systems: Principles and Practice (2nd Edition) \u73b0\u4ee3\u64cd\u4f5c\u7cfb\u7edf: \u539f\u7406\u4e0e\u5b9e\u73b0 (\u94f6\u674f\u4e66)","title":"\u64cd\u4f5c\u7cfb\u7edf"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_4","text":"Computer Networks: A Systems Approach Computer Networking: A Top-Down Approach","title":"\u8ba1\u7b97\u673a\u7f51\u7edc"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_5","text":"My First Language Frontend with LLVM Tutorial Compilers: Principles, Techniques, and Tools (Dragon Book)","title":"\u7f16\u8bd1\u539f\u7406"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#pl","text":"Essentials of Programming Languages (EOPL) Types and Programming Languages (TAPL) ( \u5317\u5927\u76f8\u5173\u8bfe\u7a0b ) Practical Foundations for Programming Languages (PFPL) Software Foundations (SF) ( \u5317\u5927\u76f8\u5173\u8bfe\u7a0b )","title":"\u8ba1\u7b97\u673a\u8bed\u8a00\uff08PL\uff09"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_6","text":"Computer Architecture: A Quantitative Approach 5th Edition","title":"\u4f53\u7cfb\u7ed3\u6784"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_7","text":"Patterns of Distributed System Distributed Systems for fun and profit","title":"\u5206\u5e03\u5f0f\u7cfb\u7edf"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_8","text":"Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems ( \u5f00\u6e90\u4e2d\u6587\u7ffb\u8bd1 )","title":"\u6570\u636e\u5bc6\u96c6\u578b\u7cfb\u7edf\u8bbe\u8ba1"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_9","text":"Cryptography Engineering: Design Principles and Practical Applications Introduction to modern cryptography (second edition) By Jonathon Katz & Yehuda Lindell \u4ece\u5bc6\u7801\u5b66\u7684\u6700\u57fa\u7840\u5f00\u59cb\u8bb2\u8d77\uff0c\u5bf9\u4f20\u7edf\u5bc6\u7801\u5b66\u7684\u5404\u65b9\u9762\u90fd\u6709\u6d89\u53ca\uff0c\u8bfe\u7a0b\u5185\u5bb9\u5168\u9762\uff0c\u662f\u5bc6\u7801\u5b66\u5165\u95e8\u5f88\u597d\u7684\u4e00\u672c\u4e66","title":"\u5bc6\u7801\u5b66"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_10","text":"Database System Concepts Architecture of a Database System","title":"\u6570\u636e\u5e93\u7cfb\u7edf"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_11","text":"Fundamentals of Computer Graphics","title":"\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66"},{"location":"%E5%A5%BD%E4%B9%A6%E6%8E%A8%E8%8D%90/#_12","text":"\u52a8\u624b\u5b66\u6df1\u5ea6\u5b66\u4e60","title":"\u6df1\u5ea6\u5b66\u4e60"},{"location":"Web%E5%BC%80%E5%8F%91/CS142/","text":"Stanford CS142: Web Applications \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6709\u4e00\u5b9a\u7684\u7f16\u7a0b\u7ecf\u9a8c \u7f16\u7a0b\u8bed\u8a00\uff1aJavaScript/HTML/CSS \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u65af\u5766\u798f\u7684Web\u5e94\u7528\u5f00\u53d1\u8bfe\u7a0b\uff0c\u5185\u5bb9\u8986\u76d6\u4e86HTML\u3001CSS\u3001JavaScript\u3001ReactJs\u3001NodeJS\u3001ExpressJS\u3001Web\u5b89\u5168\u7b49\u7b49\u30028\u4e2aProject\u4f1a\u8ba9\u4f60\u5728\u5b9e\u6218\u4e2d\u953b\u70bc\u81ea\u5df1\u7684Web\u5f00\u53d1\u6280\u5de7\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a","title":"Stanford CS142: Web Applications"},{"location":"Web%E5%BC%80%E5%8F%91/CS142/#stanford-cs142-web-applications","text":"","title":"Stanford CS142: Web Applications"},{"location":"Web%E5%BC%80%E5%8F%91/CS142/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6709\u4e00\u5b9a\u7684\u7f16\u7a0b\u7ecf\u9a8c \u7f16\u7a0b\u8bed\u8a00\uff1aJavaScript/HTML/CSS \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u65af\u5766\u798f\u7684Web\u5e94\u7528\u5f00\u53d1\u8bfe\u7a0b\uff0c\u5185\u5bb9\u8986\u76d6\u4e86HTML\u3001CSS\u3001JavaScript\u3001ReactJs\u3001NodeJS\u3001ExpressJS\u3001Web\u5b89\u5168\u7b49\u7b49\u30028\u4e2aProject\u4f1a\u8ba9\u4f60\u5728\u5b9e\u6218\u4e2d\u953b\u70bc\u81ea\u5df1\u7684Web\u5f00\u53d1\u6280\u5de7\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"Web%E5%BC%80%E5%8F%91/CS142/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"Web%E5%BC%80%E5%8F%91/mitweb/","text":"MIT Web Development Crash Course \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u638c\u63e1\u81f3\u5c11\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aJavaScript/HTML/CSS/NoSQL \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a\u56e0\u4eba\u800c\u5f02 MIT\u5728\u6bcf\u5e741\u6708\u4efd\u4f1a\u6709\u4e00\u4e2a\u4e3a\u671f4\u5468\u7684 Independent Activities Period (IAP)\uff0c\u5728\u8fd9\u4e2a\u6708\u91cc\uff0cMIT\u7684\u5b66\u751f\u548c\u8001\u5e08\u53ef\u4ee5\u81ea\u7531\u5730\u5f00\u8bbe\u5f88\u591a\u6709\u8da3\u7684\u8bfe\u7a0b\uff0c\u800c\u8fd9\u95e8\u7f51\u7ad9\u5f00\u53d1\u8bfe\u7a0b\u5c31\u662f\u5176\u4e2d\u4e4b\u4e00\u3002 \u5728\u4e00\u4e2a\u6708\u7684\u65f6\u95f4\u91cc\uff0c\u4f60\u4f1a\u4ece\u96f6\u5f00\u59cb\u638c\u63e1\u4e00\u4e2a\u7f51\u7ad9\u7684\u8bbe\u8ba1\u3001\u642d\u5efa\u3001\u7f8e\u5316\u3001\u4ea4\u4e92\u7b49\u7b49\u6838\u5fc3\u5185\u5bb9\uff0c\u57fa\u672c\u8986\u76d6\u4e86Web\u5f00\u53d1\u7684\u524d\u540e\u7aef\u5927\u90e8\u5206\u6280\u672f\u6808\u3002\u5982\u679c\u4f60\u4e0d\u9700\u8981\u7cfb\u7edf\u5730\u5b66\u4e60\u7f51\u7edc\u5f00\u53d1\uff0c\u800c\u53ea\u662f\u51fa\u4e8e\u5174\u8da3\u60f3\u628a\u5b83\u52a0\u5165\u81ea\u5df1\u7684\u6280\u80fd\u5305\u91cc\uff0c\u90a3\u4e48\u8fd9\u95e8\u8bfe\u5c06\u975e\u5e38\u9002\u5408\u4f60\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0bschedule","title":"MIT web development course"},{"location":"Web%E5%BC%80%E5%8F%91/mitweb/#mit-web-development-crash-course","text":"","title":"MIT Web Development Crash Course"},{"location":"Web%E5%BC%80%E5%8F%91/mitweb/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u638c\u63e1\u81f3\u5c11\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aJavaScript/HTML/CSS/NoSQL \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a\u56e0\u4eba\u800c\u5f02 MIT\u5728\u6bcf\u5e741\u6708\u4efd\u4f1a\u6709\u4e00\u4e2a\u4e3a\u671f4\u5468\u7684 Independent Activities Period (IAP)\uff0c\u5728\u8fd9\u4e2a\u6708\u91cc\uff0cMIT\u7684\u5b66\u751f\u548c\u8001\u5e08\u53ef\u4ee5\u81ea\u7531\u5730\u5f00\u8bbe\u5f88\u591a\u6709\u8da3\u7684\u8bfe\u7a0b\uff0c\u800c\u8fd9\u95e8\u7f51\u7ad9\u5f00\u53d1\u8bfe\u7a0b\u5c31\u662f\u5176\u4e2d\u4e4b\u4e00\u3002 \u5728\u4e00\u4e2a\u6708\u7684\u65f6\u95f4\u91cc\uff0c\u4f60\u4f1a\u4ece\u96f6\u5f00\u59cb\u638c\u63e1\u4e00\u4e2a\u7f51\u7ad9\u7684\u8bbe\u8ba1\u3001\u642d\u5efa\u3001\u7f8e\u5316\u3001\u4ea4\u4e92\u7b49\u7b49\u6838\u5fc3\u5185\u5bb9\uff0c\u57fa\u672c\u8986\u76d6\u4e86Web\u5f00\u53d1\u7684\u524d\u540e\u7aef\u5927\u90e8\u5206\u6280\u672f\u6808\u3002\u5982\u679c\u4f60\u4e0d\u9700\u8981\u7cfb\u7edf\u5730\u5b66\u4e60\u7f51\u7edc\u5f00\u53d1\uff0c\u800c\u53ea\u662f\u51fa\u4e8e\u5174\u8da3\u60f3\u628a\u5b83\u52a0\u5165\u81ea\u5df1\u7684\u6280\u80fd\u5305\u91cc\uff0c\u90a3\u4e48\u8fd9\u95e8\u8bfe\u5c06\u975e\u5e38\u9002\u5408\u4f60\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"Web%E5%BC%80%E5%8F%91/mitweb/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0bschedule","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS188/","text":"CS188: Introduction to Artificial Intelligence \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS70 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u4eba\u5de5\u667a\u80fd\u5165\u95e8\u8bfe\uff0c\u8bfe\u7a0bnotes\u5199\u5f97\u975e\u5e38\u6df1\u5165\u6d45\u51fa\uff0c\u57fa\u672c\u4e0d\u9700\u8981\u89c2\u770b\u8bfe\u7a0b\u89c6\u9891\u3002\u8bfe\u7a0b\u5185\u5bb9\u7684\u5b89\u6392\u57fa\u672c\u6309\u7167\u4eba\u5de5\u667a\u80fd\u7684\u7ecf\u5178\u6559\u6750 Artificial intelligence: A Modern Approach \u7684\u7ae0\u8282\u987a\u5e8f\uff0c\u8986\u76d6\u4e86\u641c\u7d22\u526a\u679d\u3001\u7ea6\u675f\u6ee1\u8db3\u95ee\u9898\u3001\u9a6c\u5c14\u53ef\u592b\u51b3\u7b56\u8fc7\u7a0b\u3001\u5f3a\u5316\u5b66\u4e60\u3001\u8d1d\u53f6\u65af\u7f51\u7edc\u3001\u9690\u9a6c\u5c14\u53ef\u592b\u6a21\u578b\u4ee5\u53ca\u57fa\u7840\u7684\u673a\u5668\u5b66\u4e60\u548c\u795e\u7ecf\u7f51\u7edc\u7684\u76f8\u5173\u5185\u5bb9\u3002 2018\u5e74\u79cb\u5b63\u5b66\u671f\u7684\u7248\u672c\u514d\u8d39\u5f00\u653e\u4e86gradescope\uff0c\u5927\u5bb6\u53ef\u4ee5\u5728\u7ebf\u5b8c\u6210\u4e66\u9762\u4f5c\u4e1a\u5e76\u5b9e\u65f6\u5f97\u5230\u6d4b\u8bc4\u7ed3\u679c\u3002\u540c\u65f6\u8bfe\u7a0b\u76846\u4e2aProject\u4e5f\u662f\u8d28\u91cf\u7206\u70b8\uff0c\u590d\u73b0\u4e86\u7ecf\u5178\u7684Packman\uff08\u5403\u8c46\u4eba\uff09\u5c0f\u6e38\u620f\uff0c\u4f1a\u8ba9\u4f60\u5229\u7528\u5b66\u5230\u7684AI\u77e5\u8bc6\uff0c\u53bb\u5b9e\u73b0\u76f8\u5173\u7b97\u6cd5\uff0c\u8ba9\u4f60\u7684\u5403\u8c46\u4eba\u5728\u8ff7\u5bab\u91cc\u81ea\u7531\u7a7f\u68ad\uff0c\u8eb2\u907f\u9b3c\u602a\uff0c\u6536\u96c6\u8c46\u5b50\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1aArtificial intelligence: A Modern Approach \u8bfe\u7a0b\u4f5c\u4e1a \uff1a14\u4e2a\u5728\u7ebf\u6d4b\u8bc4\u4e66\u9762\u4f5c\u4e1a\u548c6\u4e2aProject","title":"UCB CS188: Introduction to Artificial Intelligence"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS188/#cs188-introduction-to-artificial-intelligence","text":"","title":"CS188: Introduction to Artificial Intelligence"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS188/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS70 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u4eba\u5de5\u667a\u80fd\u5165\u95e8\u8bfe\uff0c\u8bfe\u7a0bnotes\u5199\u5f97\u975e\u5e38\u6df1\u5165\u6d45\u51fa\uff0c\u57fa\u672c\u4e0d\u9700\u8981\u89c2\u770b\u8bfe\u7a0b\u89c6\u9891\u3002\u8bfe\u7a0b\u5185\u5bb9\u7684\u5b89\u6392\u57fa\u672c\u6309\u7167\u4eba\u5de5\u667a\u80fd\u7684\u7ecf\u5178\u6559\u6750 Artificial intelligence: A Modern Approach \u7684\u7ae0\u8282\u987a\u5e8f\uff0c\u8986\u76d6\u4e86\u641c\u7d22\u526a\u679d\u3001\u7ea6\u675f\u6ee1\u8db3\u95ee\u9898\u3001\u9a6c\u5c14\u53ef\u592b\u51b3\u7b56\u8fc7\u7a0b\u3001\u5f3a\u5316\u5b66\u4e60\u3001\u8d1d\u53f6\u65af\u7f51\u7edc\u3001\u9690\u9a6c\u5c14\u53ef\u592b\u6a21\u578b\u4ee5\u53ca\u57fa\u7840\u7684\u673a\u5668\u5b66\u4e60\u548c\u795e\u7ecf\u7f51\u7edc\u7684\u76f8\u5173\u5185\u5bb9\u3002 2018\u5e74\u79cb\u5b63\u5b66\u671f\u7684\u7248\u672c\u514d\u8d39\u5f00\u653e\u4e86gradescope\uff0c\u5927\u5bb6\u53ef\u4ee5\u5728\u7ebf\u5b8c\u6210\u4e66\u9762\u4f5c\u4e1a\u5e76\u5b9e\u65f6\u5f97\u5230\u6d4b\u8bc4\u7ed3\u679c\u3002\u540c\u65f6\u8bfe\u7a0b\u76846\u4e2aProject\u4e5f\u662f\u8d28\u91cf\u7206\u70b8\uff0c\u590d\u73b0\u4e86\u7ecf\u5178\u7684Packman\uff08\u5403\u8c46\u4eba\uff09\u5c0f\u6e38\u620f\uff0c\u4f1a\u8ba9\u4f60\u5229\u7528\u5b66\u5230\u7684AI\u77e5\u8bc6\uff0c\u53bb\u5b9e\u73b0\u76f8\u5173\u7b97\u6cd5\uff0c\u8ba9\u4f60\u7684\u5403\u8c46\u4eba\u5728\u8ff7\u5bab\u91cc\u81ea\u7531\u7a7f\u68ad\uff0c\u8eb2\u907f\u9b3c\u602a\uff0c\u6536\u96c6\u8c46\u5b50\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS188/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1aArtificial intelligence: A Modern Approach \u8bfe\u7a0b\u4f5c\u4e1a \uff1a14\u4e2a\u5728\u7ebf\u6d4b\u8bc4\u4e66\u9762\u4f5c\u4e1a\u548c6\u4e2aProject","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS50/","text":"CS50\u2019s Introduction to AI with Python \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aHarvard \u5148\u4fee\u8981\u6c42\uff1a\u57fa\u672c\u6982\u7387\u8bba + Python\u57fa\u7840 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a30\u5c0f\u65f6 \u4e00\u95e8\u975e\u5e38\u57fa\u7840\u7684AI\u5165\u95e8\u8bfe\uff0c\u8ba9\u4eba\u773c\u524d\u4e00\u4eae\u7684\u662f12\u4e2a\u8bbe\u8ba1\u7cbe\u5de7\u7684\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u90fd\u4f1a\u7528\u5b66\u5230\u7684AI\u77e5\u8bc6\u53bb\u5b9e\u73b0\u4e00\u4e2a\u7b80\u6613\u7684\u6e38\u620fAI\uff0c\u6bd4\u5982\u7528\u5f3a\u5316\u5b66\u4e60\u8bad\u7ec3\u4e00\u4e2aNim\u6e38\u620f\u7684AI\uff0c\u7528alpha-beta\u526a\u679d\u53bb\u626b\u96f7\u7b49\u7b49\uff0c\u975e\u5e38\u9002\u5408\u65b0\u624b\u5165\u95e8\u6216\u8005\u5927\u4f6c\u4f11\u95f2\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a12\u4e2a\u7cbe\u5de7\u7684\u7f16\u7a0b\u4f5c\u4e1a \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Harvard CS50\u2019s Introduction to AI with Python"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS50/#cs50s-introduction-to-ai-with-python","text":"","title":"CS50\u2019s Introduction to AI with Python"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS50/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aHarvard \u5148\u4fee\u8981\u6c42\uff1a\u57fa\u672c\u6982\u7387\u8bba + Python\u57fa\u7840 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a30\u5c0f\u65f6 \u4e00\u95e8\u975e\u5e38\u57fa\u7840\u7684AI\u5165\u95e8\u8bfe\uff0c\u8ba9\u4eba\u773c\u524d\u4e00\u4eae\u7684\u662f12\u4e2a\u8bbe\u8ba1\u7cbe\u5de7\u7684\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u90fd\u4f1a\u7528\u5b66\u5230\u7684AI\u77e5\u8bc6\u53bb\u5b9e\u73b0\u4e00\u4e2a\u7b80\u6613\u7684\u6e38\u620fAI\uff0c\u6bd4\u5982\u7528\u5f3a\u5316\u5b66\u4e60\u8bad\u7ec3\u4e00\u4e2aNim\u6e38\u620f\u7684AI\uff0c\u7528alpha-beta\u526a\u679d\u53bb\u626b\u96f7\u7b49\u7b49\uff0c\u975e\u5e38\u9002\u5408\u65b0\u624b\u5165\u95e8\u6216\u8005\u5927\u4f6c\u4f11\u95f2\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS50/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a12\u4e2a\u7cbe\u5de7\u7684\u7f16\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CS50/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CYJ/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1a\u4e2d\u56fd\u79d1\u5b66\u9662\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u4f53\u7cfb\u7ed3\u6784\uff0c\u6df1\u5ea6\u5b66\u4e60 \u7f16\u7a0b\u8bed\u8a00\uff1aPython\uff0cC++\uff0cBCL \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6+ \u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u662f\u667a\u80fd\u7684\u6838\u5fc3\u7269\u8d28\u8f7d\u4f53\uff0c\u6bcf\u5e74\u5168\u7403\u8981\u5236\u9020\u6570\u4ee5\u5341\u4ebf\u8ba1\u7684\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\uff08\u5305\u62ec\u667a\u80fd\u624b\u673a\u3001\u667a\u80fd\u670d\u52a1\u5668\u3001\u667a\u80fd\u53ef\u7a7f\u6234\u8bbe\u5907\u7b49\uff09\uff0c\u9700\u8981\u5927\u91cf\u7684\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u7684\u8bbe\u8ba1\u8005\u548c\u5f00\u53d1\u8005\u3002\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u4eba\u624d\u7684\u57f9\u517b\u76f4\u63a5\u5173\u7cfb\u5230\u6211\u56fd\u667a\u80fd\u4ea7\u4e1a\u7684\u6838\u5fc3\u7ade\u4e89\u529b\u3002\u56e0\u6b64\uff0c\u5bf9\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u7684\u8ba4\u8bc6\u548c\u7406\u89e3\u662f\u667a\u80fd\u65f6\u4ee3\u8ba1\u7b97\u673a\u7c7b\u4e13\u4e1a\u5b66\u751f\u57f9\u517b\u65b9\u6848\u4e2d\u4e0d\u53ef\u6216\u7f3a\u7684\u91cd\u8981\u7ec4\u6210\u90e8\u5206\uff0c\u662f\u8ba1\u7b97\u673a\u7c7b\u4e13\u4e1a\u5b66\u751f\u7684\u6838\u5fc3\u7ade\u4e89\u529b\u3002 \u56fd\u5185\u7684\u9648\u4e91\u9701\u8001\u5e08\u5f00\u7684\u8bfe\uff0c\u5728\u5176\u4ed6\u82e5\u5e72\u4e2a\u5927\u5b66\u4e5f\u90fd\u6709\u5f00\u5bf9\u5e94\u7684\u8bfe\u7a0b\uff08\u6bd4\u5982\u6211\u4eec\u8fd9\u91cc\uff09\u3002\u8fd9\u95e8\u8bfe\u7528\u4e00\u4e2a\u4e2a\u5b9e\u9a8c\u5e26\u5927\u5bb6\u4ee5\u4e00\u4e2a\u5b8c\u6574\u7684\u89c6\u91ce\u7406\u89e3\u4eba\u5de5\u667a\u80fd\u7684\u6280\u672f\u6808\u3002\u4ece\u4e0a\u5c42\u7684\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\uff0c\u5230\u7528\u5e95\u5c42\u8bed\u8a00\u7f16\u5199\u7b97\u5b50\uff0c\u518d\u5230\u786c\u4ef6\u4e2dMLU\u7684\u8bbe\u8ba1\uff0c\u8ba9\u5927\u5bb6\u5f62\u6210\u7cfb\u7edf\u601d\u7ef4\uff0c\u4f53\u4f1a\u81ea\u4e0a\u800c\u4e0b\uff0c\u878d\u4f1a\u8d2f\u901a\u7684\u4e50\u8da3\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a \u5b98\u7f51 \u8bfe\u7a0b\u89c6\u9891\uff1a bilibili \u8bfe\u7a0b\u6559\u6750\uff1a\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\uff08\u9648\u4e91\u9701\uff09 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a6\u4e2a\u5b9e\u9a8c(\u5305\u62ec\u7f16\u5199\u5377\u79ef\u7b97\u5b50\uff0c\u4e3atensorflow\u6dfb\u52a0\u7b97\u5b50\uff0c\u7528BCL\u7f16\u5199\u7b97\u5b50\u5e76\u96c6\u6210\u5230tensorflow\u4e2d\u7b49)(\u5177\u4f53\u5185\u5bb9\u5728\u5b98\u7f51\u53ef\u4ee5\u627e\u5230) \u5b9e\u9a8c\u624b\u518c \uff1a\u5b9e\u9a8c2.0\u6307\u5bfc\u624b\u518c \u5b66\u4e60\u7b14\u8bb0 \uff1a\u53c2\u8003\u5b9e\u9a8c\u624b\u518c\u603b\u7ed3\u7684\u7b14\u8bb0 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002 \u6211\u505a\u4e86\u5176\u4e2d\u76842,3,4,5\u8fd9\u51e0\u4e2a\u5b9e\u9a8c\uff0c\u5176\u4e2d\u7efc\u5408\u5b9e\u9a8c\u548c\u786c\u4ef6\u5b9e\u9a8c\u6ca1\u6709\u505a\uff0c\u5982\u679c\u6709\u505a\u4e86\u7684\u540c\u5b66\u6b22\u8fce\u5927\u5bb6\u8865\u4e0a\u4f60\u7684\u94fe\u63a5 \u4e2a\u4eba\u4f53\u4f1a\u662f\u7b2c\u4e09\u7ae0\u5b9e\u73b0\u7b97\u5b50\u7684\u5b9e\u9a8c\u8ba9\u6211\u5bf9\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\u7684\u4e86\u89e3\u52a0\u6df1\u4e86\u5f88\u591a\u3002\u7b2c\u4e94\u7ae0\u7684\u5b9e\u9a8cBCL\u8bed\u8a00\u7f16\u5199\u7b97\u5b50\u5982\u679c\u4e86\u89e3CUDA\u7684\u8bdd\u4f1a\u611f\u89c9\u5f88\u719f\u6089\u3002 \u63a8\u8350\u53bb\u4e70\u4e00\u672c\u6559\u6750\u770b\u4e00\u770b\uff0c\u4f1a\u8ba9\u6211\u4eec\u7406\u89e3\u6574\u4f53\u7684\u6280\u672f\u6808\u3002\u719f\u6089\u6df1\u5ea6\u5b66\u4e60\u7684\u540c\u5b66\u53ef\u4ee5\u76f4\u63a5\u4ece\u7b2c\u4e94\u7ae0\u5f00\u59cb\u770b\uff0c\u770b\u770b\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\u5e95\u5c42\u5230\u5e95\u662f\u4ec0\u4e48\u6837\u7684\u3002 \u6211\u56e0\u4e3a\u8fd9\u95e8\u8bfe\u7684\u542f\u53d1\uff0c\u53c2\u8003\u4e00\u672c\u4e66\uff08\u4e66\u540d\u5728\u4ed3\u5e93\u4e2d\uff09\u5199\u4e86\u4e00\u4e2a\u7b80\u6613\u7684 \u6df1\u5ea6\u5b66\u4e60\u6846\u67b6 \u3002\u5728\u8fd9\u4e2a\u6846\u67b6\u91cc\u53ef\u4ee5\u770b\u5230\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u5b9e\u9a8c\u4e2d\u7684\u4e00\u4e9b\u5f71\u5b50\u3002\u540c\u65f6\u53d7\u5230build-your-own-x\u7cfb\u5217\u7684\u542f\u53d1\uff0c\u6211\u4e5f\u6253\u7b97\u5199\u4e00\u4e0b\u6559\u7a0b\uff0c\u6559\u5927\u5bb6\u5199\u4e00\u4e2a\u81ea\u5df1\u7684\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\u3002\u4ee3\u7801\u7528python\u5199\u7684\uff0c\u4ee3\u7801\u91cf\u8f83\u5c11\uff0c\u9002\u5408\u6709\u4e00\u5b9a\u57fa\u7840\u7684\u540c\u5b66\u9605\u8bfb\u3002\u4e4b\u540e\u6253\u7b97\u6dfb\u52a0\u66f4\u591a\u7684\u7b97\u5b50\uff0c\u6709\u671b\u5b9e\u73b0\u4e00\u4e2a\u8f83\u4e3a\u5168\u9762\u7684\u6846\u67b6\uff0c\u5e76\u5e0c\u671b\u79fb\u690d\u5230C++\u4e2d\uff0c\u4ee5\u517c\u987e\u6027\u80fd\u4e0e\u5f00\u53d1\u6548\u7387\u3002","title":"\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CYJ/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1a\u4e2d\u56fd\u79d1\u5b66\u9662\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u4f53\u7cfb\u7ed3\u6784\uff0c\u6df1\u5ea6\u5b66\u4e60 \u7f16\u7a0b\u8bed\u8a00\uff1aPython\uff0cC++\uff0cBCL \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6+ \u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u662f\u667a\u80fd\u7684\u6838\u5fc3\u7269\u8d28\u8f7d\u4f53\uff0c\u6bcf\u5e74\u5168\u7403\u8981\u5236\u9020\u6570\u4ee5\u5341\u4ebf\u8ba1\u7684\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\uff08\u5305\u62ec\u667a\u80fd\u624b\u673a\u3001\u667a\u80fd\u670d\u52a1\u5668\u3001\u667a\u80fd\u53ef\u7a7f\u6234\u8bbe\u5907\u7b49\uff09\uff0c\u9700\u8981\u5927\u91cf\u7684\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u7684\u8bbe\u8ba1\u8005\u548c\u5f00\u53d1\u8005\u3002\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u4eba\u624d\u7684\u57f9\u517b\u76f4\u63a5\u5173\u7cfb\u5230\u6211\u56fd\u667a\u80fd\u4ea7\u4e1a\u7684\u6838\u5fc3\u7ade\u4e89\u529b\u3002\u56e0\u6b64\uff0c\u5bf9\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u7684\u8ba4\u8bc6\u548c\u7406\u89e3\u662f\u667a\u80fd\u65f6\u4ee3\u8ba1\u7b97\u673a\u7c7b\u4e13\u4e1a\u5b66\u751f\u57f9\u517b\u65b9\u6848\u4e2d\u4e0d\u53ef\u6216\u7f3a\u7684\u91cd\u8981\u7ec4\u6210\u90e8\u5206\uff0c\u662f\u8ba1\u7b97\u673a\u7c7b\u4e13\u4e1a\u5b66\u751f\u7684\u6838\u5fc3\u7ade\u4e89\u529b\u3002 \u56fd\u5185\u7684\u9648\u4e91\u9701\u8001\u5e08\u5f00\u7684\u8bfe\uff0c\u5728\u5176\u4ed6\u82e5\u5e72\u4e2a\u5927\u5b66\u4e5f\u90fd\u6709\u5f00\u5bf9\u5e94\u7684\u8bfe\u7a0b\uff08\u6bd4\u5982\u6211\u4eec\u8fd9\u91cc\uff09\u3002\u8fd9\u95e8\u8bfe\u7528\u4e00\u4e2a\u4e2a\u5b9e\u9a8c\u5e26\u5927\u5bb6\u4ee5\u4e00\u4e2a\u5b8c\u6574\u7684\u89c6\u91ce\u7406\u89e3\u4eba\u5de5\u667a\u80fd\u7684\u6280\u672f\u6808\u3002\u4ece\u4e0a\u5c42\u7684\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\uff0c\u5230\u7528\u5e95\u5c42\u8bed\u8a00\u7f16\u5199\u7b97\u5b50\uff0c\u518d\u5230\u786c\u4ef6\u4e2dMLU\u7684\u8bbe\u8ba1\uff0c\u8ba9\u5927\u5bb6\u5f62\u6210\u7cfb\u7edf\u601d\u7ef4\uff0c\u4f53\u4f1a\u81ea\u4e0a\u800c\u4e0b\uff0c\u878d\u4f1a\u8d2f\u901a\u7684\u4e50\u8da3\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CYJ/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a \u5b98\u7f51 \u8bfe\u7a0b\u89c6\u9891\uff1a bilibili \u8bfe\u7a0b\u6559\u6750\uff1a\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\uff08\u9648\u4e91\u9701\uff09 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a6\u4e2a\u5b9e\u9a8c(\u5305\u62ec\u7f16\u5199\u5377\u79ef\u7b97\u5b50\uff0c\u4e3atensorflow\u6dfb\u52a0\u7b97\u5b50\uff0c\u7528BCL\u7f16\u5199\u7b97\u5b50\u5e76\u96c6\u6210\u5230tensorflow\u4e2d\u7b49)(\u5177\u4f53\u5185\u5bb9\u5728\u5b98\u7f51\u53ef\u4ee5\u627e\u5230) \u5b9e\u9a8c\u624b\u518c \uff1a\u5b9e\u9a8c2.0\u6307\u5bfc\u624b\u518c \u5b66\u4e60\u7b14\u8bb0 \uff1a\u53c2\u8003\u5b9e\u9a8c\u624b\u518c\u603b\u7ed3\u7684\u7b14\u8bb0","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD/CYJ/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002 \u6211\u505a\u4e86\u5176\u4e2d\u76842,3,4,5\u8fd9\u51e0\u4e2a\u5b9e\u9a8c\uff0c\u5176\u4e2d\u7efc\u5408\u5b9e\u9a8c\u548c\u786c\u4ef6\u5b9e\u9a8c\u6ca1\u6709\u505a\uff0c\u5982\u679c\u6709\u505a\u4e86\u7684\u540c\u5b66\u6b22\u8fce\u5927\u5bb6\u8865\u4e0a\u4f60\u7684\u94fe\u63a5 \u4e2a\u4eba\u4f53\u4f1a\u662f\u7b2c\u4e09\u7ae0\u5b9e\u73b0\u7b97\u5b50\u7684\u5b9e\u9a8c\u8ba9\u6211\u5bf9\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\u7684\u4e86\u89e3\u52a0\u6df1\u4e86\u5f88\u591a\u3002\u7b2c\u4e94\u7ae0\u7684\u5b9e\u9a8cBCL\u8bed\u8a00\u7f16\u5199\u7b97\u5b50\u5982\u679c\u4e86\u89e3CUDA\u7684\u8bdd\u4f1a\u611f\u89c9\u5f88\u719f\u6089\u3002 \u63a8\u8350\u53bb\u4e70\u4e00\u672c\u6559\u6750\u770b\u4e00\u770b\uff0c\u4f1a\u8ba9\u6211\u4eec\u7406\u89e3\u6574\u4f53\u7684\u6280\u672f\u6808\u3002\u719f\u6089\u6df1\u5ea6\u5b66\u4e60\u7684\u540c\u5b66\u53ef\u4ee5\u76f4\u63a5\u4ece\u7b2c\u4e94\u7ae0\u5f00\u59cb\u770b\uff0c\u770b\u770b\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\u5e95\u5c42\u5230\u5e95\u662f\u4ec0\u4e48\u6837\u7684\u3002 \u6211\u56e0\u4e3a\u8fd9\u95e8\u8bfe\u7684\u542f\u53d1\uff0c\u53c2\u8003\u4e00\u672c\u4e66\uff08\u4e66\u540d\u5728\u4ed3\u5e93\u4e2d\uff09\u5199\u4e86\u4e00\u4e2a\u7b80\u6613\u7684 \u6df1\u5ea6\u5b66\u4e60\u6846\u67b6 \u3002\u5728\u8fd9\u4e2a\u6846\u67b6\u91cc\u53ef\u4ee5\u770b\u5230\u667a\u80fd\u8ba1\u7b97\u7cfb\u7edf\u5b9e\u9a8c\u4e2d\u7684\u4e00\u4e9b\u5f71\u5b50\u3002\u540c\u65f6\u53d7\u5230build-your-own-x\u7cfb\u5217\u7684\u542f\u53d1\uff0c\u6211\u4e5f\u6253\u7b97\u5199\u4e00\u4e0b\u6559\u7a0b\uff0c\u6559\u5927\u5bb6\u5199\u4e00\u4e2a\u81ea\u5df1\u7684\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6\u3002\u4ee3\u7801\u7528python\u5199\u7684\uff0c\u4ee3\u7801\u91cf\u8f83\u5c11\uff0c\u9002\u5408\u6709\u4e00\u5b9a\u57fa\u7840\u7684\u540c\u5b66\u9605\u8bfb\u3002\u4e4b\u540e\u6253\u7b97\u6dfb\u52a0\u66f4\u591a\u7684\u7b97\u5b50\uff0c\u6709\u671b\u5b9e\u73b0\u4e00\u4e2a\u8f83\u4e3a\u5168\u9762\u7684\u6846\u67b6\uff0c\u5e76\u5e0c\u671b\u79fb\u690d\u5230C++\u4e2d\uff0c\u4ee5\u517c\u987e\u6027\u80fd\u4e0e\u5f00\u53d1\u6548\u7387\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CS61C/","text":"CS61C: Great Ideas in Computer Architecture \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B \u7f16\u7a0b\u8bed\u8a00\uff1aC \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f2f\u514b\u5229CS61\u7cfb\u5217\u7684\u6700\u540e\u4e00\u95e8\u8bfe\u7a0b\uff0c\u6df1\u5165\u8ba1\u7b97\u673a\u7684\u786c\u4ef6\u7ec6\u8282\uff0c\u5e26\u9886\u5b66\u751f\u9010\u6b65\u7406\u89e3C\u8bed\u8a00\u662f\u5982\u4f55\u4e00\u6b65\u6b65\u8f6c\u5316\u4e3aRISC-V\u6c47\u7f16\u5e76\u5728CPU\u4e0a\u6267\u884c\u7684\u3002\u548c \bNand2Tetris \u4e0d\u540c\uff0c\u8fd9\u95e8\u8bfe \u5728\u96be\u5ea6\u548c\u6df1\u5ea6\u4e0a\u90fd\u4f1a\u5927\u5f88\u591a\uff0c\u5177\u4f53\u4f1a\u6d89\u53ca\u5230\u6d41\u6c34\u7ebf\u3001Cache\u3001\u865a\u5b58\u4ee5\u53ca\u5e76\u53d1\u76f8\u5173\u7684\u5185\u5bb9\u3002 \u8fd9\u95e8\u8bfe\u7684Project\u4e5f\u975e\u5e38\u65b0\u9896\u6709\u8da3\u3002Project1\u4f1a\u8ba9\u4f60\u7528C\u8bed\u8a00\u5199\u4e00\u4e2a\u5c0f\u7a0b\u5e8f\uff0c20\u5e74\u79cb\u5b63\u5b66\u671f\u662f\u8457\u540d\u7684\u6e38\u620f Game of Life \u3002Project2\u4f1a\u8ba9\u4f60\u7528RISC-V\u6c47\u7f16\u7f16\u5199\u4e00\u4e2a\u795e\u7ecf\u7f51\u7edc\uff0c\u7528\u6765 \u8bc6\u522bMNIST\u624b\u5199\u6570\u5b57\uff0c\u975e\u5e38\u953b\u70bc\u4f60\u5bf9\u6c47\u7f16\u4ee3\u7801\u7684\u7406\u89e3\u548c\u8fd0\u7528\u3002Project3\u4e2d\u4f60\u4f1a\u7528Logism\u8fd9\u4e2a\u6570\u5b57\u7535\u8def\u6a21\u62df\u8f6f\u4ef6\u642d\u5efa\u51fa\u4e00\u4e2a\u4e8c\u7ea7\u6d41\u6c34\u7ebf\u7684CPU\uff0c\u5e76\u5728\u4e0a\u9762\u8fd0\u884cRISC-V\u6c47\u7f16\u4ee3\u7801\u3002Project4 \u4f1a\u8ba9\u4f60\u4f7f\u7528OpenMP\uff0cSIMD\u7b49\u65b9\u6cd5\u5e76\u884c\u4f18\u5316\u77e9\u9635\u8fd0\u7b97\uff0c\u5b9e\u73b0\u4e00\u4e2a\u7b80\u6613\u7684Numpy\u3002 \u603b\u800c\u8a00\u4e4b\uff0c\u8fd9\u662f\u4e2a\u4eba\u4e0a\u8fc7\u7684\u6700\u597d\u7684\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\u7684\u8bfe\u7a0b\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a B\u7ad9 , Youtube \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a11\u4e2alab\uff0c4\u4e2aproject\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS61C: Great Ideas in Computer Architecture"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CS61C/#cs61c-great-ideas-in-computer-architecture","text":"","title":"CS61C: Great Ideas in Computer Architecture"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CS61C/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B \u7f16\u7a0b\u8bed\u8a00\uff1aC \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f2f\u514b\u5229CS61\u7cfb\u5217\u7684\u6700\u540e\u4e00\u95e8\u8bfe\u7a0b\uff0c\u6df1\u5165\u8ba1\u7b97\u673a\u7684\u786c\u4ef6\u7ec6\u8282\uff0c\u5e26\u9886\u5b66\u751f\u9010\u6b65\u7406\u89e3C\u8bed\u8a00\u662f\u5982\u4f55\u4e00\u6b65\u6b65\u8f6c\u5316\u4e3aRISC-V\u6c47\u7f16\u5e76\u5728CPU\u4e0a\u6267\u884c\u7684\u3002\u548c \bNand2Tetris \u4e0d\u540c\uff0c\u8fd9\u95e8\u8bfe \u5728\u96be\u5ea6\u548c\u6df1\u5ea6\u4e0a\u90fd\u4f1a\u5927\u5f88\u591a\uff0c\u5177\u4f53\u4f1a\u6d89\u53ca\u5230\u6d41\u6c34\u7ebf\u3001Cache\u3001\u865a\u5b58\u4ee5\u53ca\u5e76\u53d1\u76f8\u5173\u7684\u5185\u5bb9\u3002 \u8fd9\u95e8\u8bfe\u7684Project\u4e5f\u975e\u5e38\u65b0\u9896\u6709\u8da3\u3002Project1\u4f1a\u8ba9\u4f60\u7528C\u8bed\u8a00\u5199\u4e00\u4e2a\u5c0f\u7a0b\u5e8f\uff0c20\u5e74\u79cb\u5b63\u5b66\u671f\u662f\u8457\u540d\u7684\u6e38\u620f Game of Life \u3002Project2\u4f1a\u8ba9\u4f60\u7528RISC-V\u6c47\u7f16\u7f16\u5199\u4e00\u4e2a\u795e\u7ecf\u7f51\u7edc\uff0c\u7528\u6765 \u8bc6\u522bMNIST\u624b\u5199\u6570\u5b57\uff0c\u975e\u5e38\u953b\u70bc\u4f60\u5bf9\u6c47\u7f16\u4ee3\u7801\u7684\u7406\u89e3\u548c\u8fd0\u7528\u3002Project3\u4e2d\u4f60\u4f1a\u7528Logism\u8fd9\u4e2a\u6570\u5b57\u7535\u8def\u6a21\u62df\u8f6f\u4ef6\u642d\u5efa\u51fa\u4e00\u4e2a\u4e8c\u7ea7\u6d41\u6c34\u7ebf\u7684CPU\uff0c\u5e76\u5728\u4e0a\u9762\u8fd0\u884cRISC-V\u6c47\u7f16\u4ee3\u7801\u3002Project4 \u4f1a\u8ba9\u4f60\u4f7f\u7528OpenMP\uff0cSIMD\u7b49\u65b9\u6cd5\u5e76\u884c\u4f18\u5316\u77e9\u9635\u8fd0\u7b97\uff0c\u5b9e\u73b0\u4e00\u4e2a\u7b80\u6613\u7684Numpy\u3002 \u603b\u800c\u8a00\u4e4b\uff0c\u8fd9\u662f\u4e2a\u4eba\u4e0a\u8fc7\u7684\u6700\u597d\u7684\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\u7684\u8bfe\u7a0b\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CS61C/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a B\u7ad9 , Youtube \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a11\u4e2alab\uff0c4\u4e2aproject\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CS61C/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CSAPP/","text":"CMU CS15213: CSAPP \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aCMU \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B \u7f16\u7a0b\u8bed\u8a00\uff1aC \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 CMU\u5927\u540d\u9f0e\u9f0e\u7684\u9547\u7cfb\u795e\u8bfe\uff0c\u4ee5\u5176\u5185\u5bb9\u5e9e\u6742\uff0cproject\u5de8\u96be\u800c\u95fb\u540d\u9050\u8fe9\u3002\u8bfe\u7a0b\u5185\u5bb9\u8986\u76d6\u4e86\u6c47\u7f16\u8bed\u8a00\u3001\u4f53\u7cfb\u7ed3\u6784\u3001\u64cd\u4f5c\u7cfb\u7edf\u3001\u7f16\u8bd1\u94fe\u63a5\u3001\u5e76\u884c\u3001\u7f51\u7edc\u7b49\uff0c\u4f5c\u4e3a\u7cfb\u7edf\u5165\u95e8\u8bfe\uff0c\u517c\u5177\u6df1\u5ea6\u548c\u5e7f\u5ea6\uff0c\u5982\u679c\u81ea\u5b66\u786e\u5b9e\u9700\u8981\u76f8\u5f53\u7684\u6bc5\u529b\u548c\u4ee3\u7801\u529f\u5e95\u3002 \u8fd9\u95e8\u8bfe\u914d\u5408\u7684\u6559\u6750\u7531CMU\u8ba1\u7b97\u673a\u7cfb\u4e3b\u4efbBryant\u6559\u6388\u6267\u7b14\uff0c\u4e5f\u5373\u6240\u8c13\u7684CSAPP\u3002\u8fd9\u4e5f\u662f\u6211\u7b2c\u4e00\u672c\u8ba4\u8ba4\u771f\u771f\u4e00\u9875\u4e00\u9875\u8bfb\u8fc7\u53bb\u7684\u8ba1\u7b97\u673a\u6559\u6750\uff0c\u867d\u7136\u5f88\u96be\u5543\uff0c\u4f46\u7740\u5b9e\u6536\u83b7\u826f\u591a\u3002 \u5317\u5927\u8d2d\u4e70\u4e86\u8fd9\u95e8\u8bfe\u7684\u7248\u6743\u5e76\u5f00\u8bbe\u4e86Introduction to Computer System\u8fd9\u95e8\u8bfe\uff0c\u4f46\u5176\u5b9eCSAPP\u6240\u6709\u7684\u8bfe\u7a0b\u8d44\u6e90\u548c\u5b9e\u9a8c\u4ee3\u7801\u90fd\u80fd\u5728\u5b83\u7684\u5b98\u65b9\u4e3b\u9875\u4e0a\u8bbf\u95ee\u5230\uff08\u5177\u4f53\u53c2\u89c1\u4e0b\u65b9\u94fe\u63a5\uff09\u3002 \u8fd9\u95e8\u8bfe\u7531\u4e8e\u8fc7\u4e8e\u51fa\u540d\uff0c\u5168\u4e16\u754c\u7684\u7801\u519c\u4e89\u76f8\u5b66\u4e60\uff0c\u5bfc\u81f4\u5176Project\u7684\u7b54\u6848\u5728\u7f51\u4e0a\u51e0\u4e4e\u553e\u624b\u53ef\u5f97\u3002\u4f46\u5982\u679c\u4f60\u771f\u7684\u60f3\u953b\u70bc\u81ea\u5df1\u7684\u4ee3\u7801\u80fd\u529b\uff0c\u5e0c\u671b\u4f60\u4e0d\u8981\u501f\u9274\u4efb\u4f55\u7b2c\u4e09\u65b9\u4ee3\u7801\u3002 \u8ba4\u771f\u5b66\u5b8c\u8fd9\u4e00\u95e8\u8bfe\uff0c\u4f60\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u7684\u7406\u89e3\u7edd\u5bf9\u4f1a\u4e0a\u5347\u4e00\u4e2a\u53f0\u9636\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aComputer Systems: A Programmer's Perspective, 3/E \u8bfe\u7a0b\u4f5c\u4e1a\uff1a11\u4e2aProject\uff0c \u4ee3\u7801\u6846\u67b6\u5168\u90e8\u5f00\u6e90 \u8865\u5145\uff1a\u76f8\u4fe1\u5927\u5bb6\u5728\u770b\u5b8cCSAPP\u8fd9\u672c\u4e66\u4ee5\u540e\uff0c\u53ef\u80fd\u4f1a\u5bf9\u4e66\u4e2d\u7684\u7b2c\u4e03\u7ae0\u94fe\u63a5\u6709\u4e00\u5b9a\u7684\u7591\u95ee\u3002\u8fd9\u91cc\u63a8\u8350\u4e00\u672c\u4e66\u300a\u7a0b\u5e8f\u5458\u7684\u81ea\u6211\u4fee\u517b\u300b\uff0c\u4e66\u7684\u526f\u6807\u9898\u662f\u94fe\u63a5\uff0c\u88c5\u8f7d\u4e0e\u5e93\u3002\u8fd9\u672c\u4e66\u80fd\u591f\u5e2e\u52a9\u6211\u4eec\u5b8c\u5584\u5bf9\u7a0b\u5e8f\u94fe\u63a5\u7684\u7406\u89e3\uff0c\u4ee5\u53ca\u5bf9CSAPP\u7b2c\u4e03\u7ae0\u90e8\u5206\u77e5\u8bc6\u70b9\u7684\u4e00\u4e2a\u8be6\u7ec6\u7684\u9610\u8ff0\u3002\u76f8\u4fe1\u4f60\u5728\u770b\u5b8c\u8fd9\u672c\u4e66\u4ee5\u540e\u53ef\u4ee5\u5bf9\u7a0b\u5e8f\u7684\u94fe\u63a5\uff0cELF\u6587\u4ef6\uff0c\u52a8\u6001\u5e93\u6709\u4e00\u4e2a\u66f4\u52a0\u6df1\u5165\u7684\u7406\u89e3\u3002\u5341\u5206\u63a8\u8350\u5728\u8bfb\u5b8cCSAPP\uff0c\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u6709\u4e00\u5b9a\u7684\u4e86\u89e3\u4ee5\u540e\u4f5c\u4e3a\u8865\u5145\u8d44\u6599\u6765\u9605\u8bfb\u3002","title":"CMU 15-213: CSAPP"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CSAPP/#cmu-cs15213-csapp","text":"","title":"CMU CS15213: CSAPP"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CSAPP/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aCMU \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B \u7f16\u7a0b\u8bed\u8a00\uff1aC \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 CMU\u5927\u540d\u9f0e\u9f0e\u7684\u9547\u7cfb\u795e\u8bfe\uff0c\u4ee5\u5176\u5185\u5bb9\u5e9e\u6742\uff0cproject\u5de8\u96be\u800c\u95fb\u540d\u9050\u8fe9\u3002\u8bfe\u7a0b\u5185\u5bb9\u8986\u76d6\u4e86\u6c47\u7f16\u8bed\u8a00\u3001\u4f53\u7cfb\u7ed3\u6784\u3001\u64cd\u4f5c\u7cfb\u7edf\u3001\u7f16\u8bd1\u94fe\u63a5\u3001\u5e76\u884c\u3001\u7f51\u7edc\u7b49\uff0c\u4f5c\u4e3a\u7cfb\u7edf\u5165\u95e8\u8bfe\uff0c\u517c\u5177\u6df1\u5ea6\u548c\u5e7f\u5ea6\uff0c\u5982\u679c\u81ea\u5b66\u786e\u5b9e\u9700\u8981\u76f8\u5f53\u7684\u6bc5\u529b\u548c\u4ee3\u7801\u529f\u5e95\u3002 \u8fd9\u95e8\u8bfe\u914d\u5408\u7684\u6559\u6750\u7531CMU\u8ba1\u7b97\u673a\u7cfb\u4e3b\u4efbBryant\u6559\u6388\u6267\u7b14\uff0c\u4e5f\u5373\u6240\u8c13\u7684CSAPP\u3002\u8fd9\u4e5f\u662f\u6211\u7b2c\u4e00\u672c\u8ba4\u8ba4\u771f\u771f\u4e00\u9875\u4e00\u9875\u8bfb\u8fc7\u53bb\u7684\u8ba1\u7b97\u673a\u6559\u6750\uff0c\u867d\u7136\u5f88\u96be\u5543\uff0c\u4f46\u7740\u5b9e\u6536\u83b7\u826f\u591a\u3002 \u5317\u5927\u8d2d\u4e70\u4e86\u8fd9\u95e8\u8bfe\u7684\u7248\u6743\u5e76\u5f00\u8bbe\u4e86Introduction to Computer System\u8fd9\u95e8\u8bfe\uff0c\u4f46\u5176\u5b9eCSAPP\u6240\u6709\u7684\u8bfe\u7a0b\u8d44\u6e90\u548c\u5b9e\u9a8c\u4ee3\u7801\u90fd\u80fd\u5728\u5b83\u7684\u5b98\u65b9\u4e3b\u9875\u4e0a\u8bbf\u95ee\u5230\uff08\u5177\u4f53\u53c2\u89c1\u4e0b\u65b9\u94fe\u63a5\uff09\u3002 \u8fd9\u95e8\u8bfe\u7531\u4e8e\u8fc7\u4e8e\u51fa\u540d\uff0c\u5168\u4e16\u754c\u7684\u7801\u519c\u4e89\u76f8\u5b66\u4e60\uff0c\u5bfc\u81f4\u5176Project\u7684\u7b54\u6848\u5728\u7f51\u4e0a\u51e0\u4e4e\u553e\u624b\u53ef\u5f97\u3002\u4f46\u5982\u679c\u4f60\u771f\u7684\u60f3\u953b\u70bc\u81ea\u5df1\u7684\u4ee3\u7801\u80fd\u529b\uff0c\u5e0c\u671b\u4f60\u4e0d\u8981\u501f\u9274\u4efb\u4f55\u7b2c\u4e09\u65b9\u4ee3\u7801\u3002 \u8ba4\u771f\u5b66\u5b8c\u8fd9\u4e00\u95e8\u8bfe\uff0c\u4f60\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u7684\u7406\u89e3\u7edd\u5bf9\u4f1a\u4e0a\u5347\u4e00\u4e2a\u53f0\u9636\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/CSAPP/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aComputer Systems: A Programmer's Perspective, 3/E \u8bfe\u7a0b\u4f5c\u4e1a\uff1a11\u4e2aProject\uff0c \u4ee3\u7801\u6846\u67b6\u5168\u90e8\u5f00\u6e90 \u8865\u5145\uff1a\u76f8\u4fe1\u5927\u5bb6\u5728\u770b\u5b8cCSAPP\u8fd9\u672c\u4e66\u4ee5\u540e\uff0c\u53ef\u80fd\u4f1a\u5bf9\u4e66\u4e2d\u7684\u7b2c\u4e03\u7ae0\u94fe\u63a5\u6709\u4e00\u5b9a\u7684\u7591\u95ee\u3002\u8fd9\u91cc\u63a8\u8350\u4e00\u672c\u4e66\u300a\u7a0b\u5e8f\u5458\u7684\u81ea\u6211\u4fee\u517b\u300b\uff0c\u4e66\u7684\u526f\u6807\u9898\u662f\u94fe\u63a5\uff0c\u88c5\u8f7d\u4e0e\u5e93\u3002\u8fd9\u672c\u4e66\u80fd\u591f\u5e2e\u52a9\u6211\u4eec\u5b8c\u5584\u5bf9\u7a0b\u5e8f\u94fe\u63a5\u7684\u7406\u89e3\uff0c\u4ee5\u53ca\u5bf9CSAPP\u7b2c\u4e03\u7ae0\u90e8\u5206\u77e5\u8bc6\u70b9\u7684\u4e00\u4e2a\u8be6\u7ec6\u7684\u9610\u8ff0\u3002\u76f8\u4fe1\u4f60\u5728\u770b\u5b8c\u8fd9\u672c\u4e66\u4ee5\u540e\u53ef\u4ee5\u5bf9\u7a0b\u5e8f\u7684\u94fe\u63a5\uff0cELF\u6587\u4ef6\uff0c\u52a8\u6001\u5e93\u6709\u4e00\u4e2a\u66f4\u52a0\u6df1\u5165\u7684\u7406\u89e3\u3002\u5341\u5206\u63a8\u8350\u5728\u8bfb\u5b8cCSAPP\uff0c\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u6709\u4e00\u5b9a\u7684\u4e86\u89e3\u4ee5\u540e\u4f5c\u4e3a\u8865\u5145\u8d44\u6599\u6765\u9605\u8bfb\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/N2T/","text":"Coursera: Nand2Tetris \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1a\u5e0c\u4f2f\u6765\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1a\u4efb\u9009\u4e00\u4e2a\u7f16\u7a0b\u8bed\u8a00 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a40\u5c0f\u65f6 Coursera \u4e0a\u88ab\u6570\u4e07\u4eba\u8bc4\u4e3a\u6ee1\u5206\uff0c\u5728\u5168\u7403\u56db\u767e\u591a\u6240\u9ad8\u6821\u3001\u9ad8\u4e2d\u88ab\u91c7\u7528\uff0c\u8ba9\u4e00\u4e2a\u5b8c\u5168\u6ca1\u6709\u8ba1\u7b97\u673a\u57fa\u7840\u7684\u4eba\u4ece\u4e0e\u975e\u95e8\u5f00\u59cb \u9020\u4e00\u53f0\u8ba1\u7b97\u673a\uff0c\u5e76\u5728\u4e0a\u9762\u8fd0\u884c\u4fc4\u7f57\u65af\u65b9\u5757\u5c0f\u6e38\u620f\u3002 \u542c\u8d77\u6765\u5c31\u5f88\u9177\u5bf9\u4e0d\u5bf9\uff1f\u5b9e\u73b0\u8d77\u6765\u66f4\u9177\uff01\u8fd9\u95e8\u8bfe\u5206\u4e3a\u786c\u4ef6\u548c\u8f6f\u4ef6\u4e24\u4e2a\u90e8\u5206\u3002\u5728\u786c\u4ef6\u90e8\u5206\uff0c\u4f60\u5c06\u8fdb\u516501\u7684\u4e16\u754c\uff0c\u7528\u4e0e\u975e\u95e8\u6784\u9020\u51fa\u903b\u8f91\u7535\u8def\uff0c\u5e76\u9010\u6b65\u642d\u5efa\u51fa\u4e00\u4e2aCPU \u6765\u8fd0\u884c\u4e00\u5957\u8bfe\u7a0b\u4f5c\u8005\u5b9a\u4e49\u7684\u7b80\u6613\u6c47\u7f16\u4ee3\u7801\u3002\u5728\u8f6f\u4ef6\u90e8\u5206\uff0c\u4f60\u5c06\u7f16\u5199\u4e00\u4e2a\u7f16\u8bd1\u5668\uff0c\u5c06\u4f5c\u8005\u5f00\u53d1\u7684\u4e00\u4e2a\u540d\u4e3aJack\u7684\u9ad8\u7ea7\u8bed\u8a00\u7f16\u8bd1\u4e3a\u53ef\u4ee5\u8fd0\u884c\u5728\u865a\u62df\u673a\u4e0a\u7684\u5b57\u8282\u7801\uff0c\u7136\u540e\u8fdb\u4e00\u6b65\u7ffb\u8bd1 \u4e3a\u6c47\u7f16\u4ee3\u7801\u3002\u4f60\u8fd8\u5c06\u5f00\u53d1\u4e00\u4e2a\u7b80\u6613\u7684OS\uff0c\u8ba9\u4f60\u7684\u8ba1\u7b97\u673a\u652f\u6301\u8f93\u5165\u8f93\u51fa\u56fe\u5f62\u754c\u9762\u3002\u81f3\u6b64\uff0c\u4f60\u53ef\u4ee5\u7528Jack\u5f00\u53d1\u4e00\u4e2a\u4fc4\u7f57\u65af\u65b9\u5757\u7684\u5c0f\u6e38\u620f\uff0c\u5c06\u5b83 \u7f16\u8bd1\u4e3a\u6c47\u7f16\u4ee3\u7801\uff0c\u8fd0\u884c\u5728\u4f60\u7528\u4e0e\u975e\u95e8\u642d\u5efa\u51fa\u7684CPU\u4e0a\uff0c\u901a\u8fc7\u4f60\u5f00\u53d1\u7684OS\u8fdb\u884c\u4ea4\u4e92\u3002\u5b66\u5b8c\u8fd9\u95e8\u8bfe\u7a0b\uff0c\u4f60\u5c06\u5bf9\u6574\u4e2a\u8ba1\u7b97\u673a\u7684\u4f53\u7cfb\u7ed3\u6784\u6709\u4e00\u4e2a\u5168\u5c40 \u4e14\u6df1\u523b\u7684\u7406\u89e3\uff0c\u5bf9\u4e8e\u4f60\u540e\u7eed\u8bfe\u7a0b\u7684\u5b66\u4e60\u6709\u7740\u83ab\u5927\u7684\u5e2e\u52a9\u3002 \u4f60\u4e5f\u8bb8\u4f1a\u62c5\u5fc3\u8bfe\u7a0b\u4f1a\u4e0d\u4f1a\u5f88\u96be\uff0c\u4f46\u8fd9\u95e8\u8bfe\u9762\u5411\u7684\u4eba\u7fa4\u662f\u5b8c\u5168\u6ca1\u6709\u8ba1\u7b97\u673a\u57fa\u7840\u7684\u4eba\uff0c\u8bfe\u7a0b\u4f5c\u8005\u7684\u76ee\u6807\u662f\u8ba9\u9ad8\u4e2d\u751f\u90fd\u80fd\u7406\u89e3\u3002\u56e0\u6b64\uff0c\u53ea\u8981\u4f60\u6309\u90e8\u5c31\u73ed\u8ddf\u7740 \u8bfe\u7a0b\u89c4\u5212\u8d70\uff0c\u4e00\u4e2a\u6708\u5185\u5b66\u5b8c\u5e94\u8be5\u7ef0\u7ef0\u6709\u4f59\u3002\u9ebb\u96c0\u867d\u5c0f\u4f46\u662f\u4e94\u810f\u4ff1\u5168\uff0c\u8fd9\u95e8\u8bfe\u5f88\u597d\u5730\u63d0\u53d6\u51fa\u4e86\u8ba1\u7b97\u673a\u7684\u672c\u8d28\uff0c\u800c\u4e0d\u8fc7\u591a\u5730\u9677\u4e8e\u73b0\u4ee3\u8ba1\u7b97\u673a\u4e3a\u4e86\u6027\u80fd\u800c \u8bbe\u8ba1\u51fa\u7684\u4f17\u591a\u590d\u6742\u7ec6\u8282\u3002\u8ba9\u5b66\u4e60\u8005\u80fd\u5728\u8f7b\u677e\u6109\u5feb\u7684\u5b66\u4e60\u4f53\u9a8c\u4e2d\u611f\u53d7\u8ba1\u7b97\u673a\u7684\u4f18\u96c5\u4e0e\u795e\u5947\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a Nand2Tetris I , Nand2Tetris II \u8bfe\u7a0b\u89c6\u9891\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a10\u4e2aproject\u5e26\u4f60\u9020\u53f0\u8ba1\u7b97\u673a\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Coursera: Nand2Tetris"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/N2T/#coursera-nand2tetris","text":"","title":"Coursera: Nand2Tetris"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/N2T/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1a\u5e0c\u4f2f\u6765\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1a\u4efb\u9009\u4e00\u4e2a\u7f16\u7a0b\u8bed\u8a00 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a40\u5c0f\u65f6 Coursera \u4e0a\u88ab\u6570\u4e07\u4eba\u8bc4\u4e3a\u6ee1\u5206\uff0c\u5728\u5168\u7403\u56db\u767e\u591a\u6240\u9ad8\u6821\u3001\u9ad8\u4e2d\u88ab\u91c7\u7528\uff0c\u8ba9\u4e00\u4e2a\u5b8c\u5168\u6ca1\u6709\u8ba1\u7b97\u673a\u57fa\u7840\u7684\u4eba\u4ece\u4e0e\u975e\u95e8\u5f00\u59cb \u9020\u4e00\u53f0\u8ba1\u7b97\u673a\uff0c\u5e76\u5728\u4e0a\u9762\u8fd0\u884c\u4fc4\u7f57\u65af\u65b9\u5757\u5c0f\u6e38\u620f\u3002 \u542c\u8d77\u6765\u5c31\u5f88\u9177\u5bf9\u4e0d\u5bf9\uff1f\u5b9e\u73b0\u8d77\u6765\u66f4\u9177\uff01\u8fd9\u95e8\u8bfe\u5206\u4e3a\u786c\u4ef6\u548c\u8f6f\u4ef6\u4e24\u4e2a\u90e8\u5206\u3002\u5728\u786c\u4ef6\u90e8\u5206\uff0c\u4f60\u5c06\u8fdb\u516501\u7684\u4e16\u754c\uff0c\u7528\u4e0e\u975e\u95e8\u6784\u9020\u51fa\u903b\u8f91\u7535\u8def\uff0c\u5e76\u9010\u6b65\u642d\u5efa\u51fa\u4e00\u4e2aCPU \u6765\u8fd0\u884c\u4e00\u5957\u8bfe\u7a0b\u4f5c\u8005\u5b9a\u4e49\u7684\u7b80\u6613\u6c47\u7f16\u4ee3\u7801\u3002\u5728\u8f6f\u4ef6\u90e8\u5206\uff0c\u4f60\u5c06\u7f16\u5199\u4e00\u4e2a\u7f16\u8bd1\u5668\uff0c\u5c06\u4f5c\u8005\u5f00\u53d1\u7684\u4e00\u4e2a\u540d\u4e3aJack\u7684\u9ad8\u7ea7\u8bed\u8a00\u7f16\u8bd1\u4e3a\u53ef\u4ee5\u8fd0\u884c\u5728\u865a\u62df\u673a\u4e0a\u7684\u5b57\u8282\u7801\uff0c\u7136\u540e\u8fdb\u4e00\u6b65\u7ffb\u8bd1 \u4e3a\u6c47\u7f16\u4ee3\u7801\u3002\u4f60\u8fd8\u5c06\u5f00\u53d1\u4e00\u4e2a\u7b80\u6613\u7684OS\uff0c\u8ba9\u4f60\u7684\u8ba1\u7b97\u673a\u652f\u6301\u8f93\u5165\u8f93\u51fa\u56fe\u5f62\u754c\u9762\u3002\u81f3\u6b64\uff0c\u4f60\u53ef\u4ee5\u7528Jack\u5f00\u53d1\u4e00\u4e2a\u4fc4\u7f57\u65af\u65b9\u5757\u7684\u5c0f\u6e38\u620f\uff0c\u5c06\u5b83 \u7f16\u8bd1\u4e3a\u6c47\u7f16\u4ee3\u7801\uff0c\u8fd0\u884c\u5728\u4f60\u7528\u4e0e\u975e\u95e8\u642d\u5efa\u51fa\u7684CPU\u4e0a\uff0c\u901a\u8fc7\u4f60\u5f00\u53d1\u7684OS\u8fdb\u884c\u4ea4\u4e92\u3002\u5b66\u5b8c\u8fd9\u95e8\u8bfe\u7a0b\uff0c\u4f60\u5c06\u5bf9\u6574\u4e2a\u8ba1\u7b97\u673a\u7684\u4f53\u7cfb\u7ed3\u6784\u6709\u4e00\u4e2a\u5168\u5c40 \u4e14\u6df1\u523b\u7684\u7406\u89e3\uff0c\u5bf9\u4e8e\u4f60\u540e\u7eed\u8bfe\u7a0b\u7684\u5b66\u4e60\u6709\u7740\u83ab\u5927\u7684\u5e2e\u52a9\u3002 \u4f60\u4e5f\u8bb8\u4f1a\u62c5\u5fc3\u8bfe\u7a0b\u4f1a\u4e0d\u4f1a\u5f88\u96be\uff0c\u4f46\u8fd9\u95e8\u8bfe\u9762\u5411\u7684\u4eba\u7fa4\u662f\u5b8c\u5168\u6ca1\u6709\u8ba1\u7b97\u673a\u57fa\u7840\u7684\u4eba\uff0c\u8bfe\u7a0b\u4f5c\u8005\u7684\u76ee\u6807\u662f\u8ba9\u9ad8\u4e2d\u751f\u90fd\u80fd\u7406\u89e3\u3002\u56e0\u6b64\uff0c\u53ea\u8981\u4f60\u6309\u90e8\u5c31\u73ed\u8ddf\u7740 \u8bfe\u7a0b\u89c4\u5212\u8d70\uff0c\u4e00\u4e2a\u6708\u5185\u5b66\u5b8c\u5e94\u8be5\u7ef0\u7ef0\u6709\u4f59\u3002\u9ebb\u96c0\u867d\u5c0f\u4f46\u662f\u4e94\u810f\u4ff1\u5168\uff0c\u8fd9\u95e8\u8bfe\u5f88\u597d\u5730\u63d0\u53d6\u51fa\u4e86\u8ba1\u7b97\u673a\u7684\u672c\u8d28\uff0c\u800c\u4e0d\u8fc7\u591a\u5730\u9677\u4e8e\u73b0\u4ee3\u8ba1\u7b97\u673a\u4e3a\u4e86\u6027\u80fd\u800c \u8bbe\u8ba1\u51fa\u7684\u4f17\u591a\u590d\u6742\u7ec6\u8282\u3002\u8ba9\u5b66\u4e60\u8005\u80fd\u5728\u8f7b\u677e\u6109\u5feb\u7684\u5b66\u4e60\u4f53\u9a8c\u4e2d\u611f\u53d7\u8ba1\u7b97\u673a\u7684\u4f18\u96c5\u4e0e\u795e\u5947\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/N2T/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a Nand2Tetris I , Nand2Tetris II \u8bfe\u7a0b\u89c6\u9891\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a10\u4e2aproject\u5e26\u4f60\u9020\u53f0\u8ba1\u7b97\u673a\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E4%BD%93%E7%B3%BB%E7%BB%93%E6%9E%84/N2T/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/CS149/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aCMU \u548c Stanford \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u719f\u6089C++ \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 Kayvon Fatahalian \u6559\u6388\u6b64\u524d\u5728CMU\u5f00\u4e8615-418\u8fd9\u95e8\u8bfe\uff0c\u540e\u6765\u4ed6\u6210\u4e3aStanford\u7684\u52a9\u7406\u6559\u6388\u540e\u53c8\u5f00\u4e86\u7c7b\u4f3c\u7684\u8bfe\u7a0bCS149\u3002\u4f46\u603b\u4f53\u6765\u8bf4\uff0c15-418\u5305\u542b\u7684\u8bfe\u7a0b\u5185\u5bb9\u66f4\u4e30\u5bcc\uff0c\u5e76\u4e14\u6709\u8bfe\u7a0b\u56de\u653e\uff0c\u4f46CS149\u7684\u7f16\u7a0b\u4f5c\u4e1a\u66f4fashion\u4e00\u4e9b\u3002\u6211\u4e2a\u4eba\u662f\u89c2\u770b\u768415-418\u7684\u8bfe\u7a0b\u5f55\u5f71\u4f46\u5b8c\u6210\u7684CS149\u7684\u4f5c\u4e1a\u3002 \u8fd9\u95e8\u8bfe\u4f1a\u5e26\u4f60\u6df1\u5165\u7406\u89e3\u73b0\u4ee3\u5e76\u884c\u8ba1\u7b97\u67b6\u6784\u7684\u8bbe\u8ba1\u539f\u5219\u4e0e\u5fc5\u8981\u6743\u8861\uff0c\u5e76\u5b66\u4f1a\u5982\u4f55\u5145\u5206\u5229\u7528\u786c\u4ef6\u8d44\u6e90\u4ee5\u53ca\u8f6f\u4ef6\u7f16\u7a0b\u6846\u67b6\uff08\u4f8b\u5982CUDA\uff0cMPI\uff0cOpenMP\u7b49\uff09\u7f16\u5199\u9ad8\u6027\u80fd\u7684\u5e76\u884c\u7a0b\u5e8f\u3002\u7531\u4e8e\u5e76\u884c\u8ba1\u7b97\u67b6\u6784\u7684\u590d\u6742\u6027\uff0c\u8fd9\u95e8\u8bfe\u4f1a\u6d89\u53ca\u8bf8\u591a\u9ad8\u7ea7\u4f53\u7cfb\u7ed3\u6784\u4e0e\u7f51\u7edc\u901a\u4fe1\u7684\u5185\u5bb9\uff0c\u77e5\u8bc6\u70b9\u76f8\u5f53\u5e95\u5c42\u4e14\u786c\u6838\u3002\u4e0e\u6b64\u540c\u65f6\uff0c5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u5219\u662f\u4ece\u8f6f\u4ef6\u7684\u5c42\u9762\u57f9\u517b\u5b66\u751f\u5bf9\u4e0a\u5c42\u62bd\u8c61\u7684\u7406\u89e3\u4e0e\u8fd0\u7528\uff0c\u5177\u4f53\u4f1a\u8ba9\u4f60\u5206\u6790\u5e76\u884c\u7a0b\u5e8f\u7684\u74f6\u9888\u3001\u7f16\u5199\u591a\u7ebf\u7a0b\u540c\u6b65\u4ee3\u7801\u3001\u5b66\u4e60CUDA\u7f16\u7a0b\u3001OpenMP\u7f16\u7a0b\u4ee5\u53ca\u524d\u6bb5\u65f6\u95f4\u5927\u70ed\u7684Spark\u6846\u67b6\u7b49\u7b49\u3002\u771f\u6b63\u610f\u4e49\u4e0a\u5c06\u7406\u8bba\u4e0e\u5b9e\u8df5\u5b8c\u7f8e\u5730\u7ed3\u5408\u5728\u4e86\u4e00\u8d77\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a CMU15418 \uff0c CS149 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"CMU 15-418/Stanford CS149: Parallel Computing"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/CS149/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aCMU \u548c Stanford \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u719f\u6089C++ \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 Kayvon Fatahalian \u6559\u6388\u6b64\u524d\u5728CMU\u5f00\u4e8615-418\u8fd9\u95e8\u8bfe\uff0c\u540e\u6765\u4ed6\u6210\u4e3aStanford\u7684\u52a9\u7406\u6559\u6388\u540e\u53c8\u5f00\u4e86\u7c7b\u4f3c\u7684\u8bfe\u7a0bCS149\u3002\u4f46\u603b\u4f53\u6765\u8bf4\uff0c15-418\u5305\u542b\u7684\u8bfe\u7a0b\u5185\u5bb9\u66f4\u4e30\u5bcc\uff0c\u5e76\u4e14\u6709\u8bfe\u7a0b\u56de\u653e\uff0c\u4f46CS149\u7684\u7f16\u7a0b\u4f5c\u4e1a\u66f4fashion\u4e00\u4e9b\u3002\u6211\u4e2a\u4eba\u662f\u89c2\u770b\u768415-418\u7684\u8bfe\u7a0b\u5f55\u5f71\u4f46\u5b8c\u6210\u7684CS149\u7684\u4f5c\u4e1a\u3002 \u8fd9\u95e8\u8bfe\u4f1a\u5e26\u4f60\u6df1\u5165\u7406\u89e3\u73b0\u4ee3\u5e76\u884c\u8ba1\u7b97\u67b6\u6784\u7684\u8bbe\u8ba1\u539f\u5219\u4e0e\u5fc5\u8981\u6743\u8861\uff0c\u5e76\u5b66\u4f1a\u5982\u4f55\u5145\u5206\u5229\u7528\u786c\u4ef6\u8d44\u6e90\u4ee5\u53ca\u8f6f\u4ef6\u7f16\u7a0b\u6846\u67b6\uff08\u4f8b\u5982CUDA\uff0cMPI\uff0cOpenMP\u7b49\uff09\u7f16\u5199\u9ad8\u6027\u80fd\u7684\u5e76\u884c\u7a0b\u5e8f\u3002\u7531\u4e8e\u5e76\u884c\u8ba1\u7b97\u67b6\u6784\u7684\u590d\u6742\u6027\uff0c\u8fd9\u95e8\u8bfe\u4f1a\u6d89\u53ca\u8bf8\u591a\u9ad8\u7ea7\u4f53\u7cfb\u7ed3\u6784\u4e0e\u7f51\u7edc\u901a\u4fe1\u7684\u5185\u5bb9\uff0c\u77e5\u8bc6\u70b9\u76f8\u5f53\u5e95\u5c42\u4e14\u786c\u6838\u3002\u4e0e\u6b64\u540c\u65f6\uff0c5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u5219\u662f\u4ece\u8f6f\u4ef6\u7684\u5c42\u9762\u57f9\u517b\u5b66\u751f\u5bf9\u4e0a\u5c42\u62bd\u8c61\u7684\u7406\u89e3\u4e0e\u8fd0\u7528\uff0c\u5177\u4f53\u4f1a\u8ba9\u4f60\u5206\u6790\u5e76\u884c\u7a0b\u5e8f\u7684\u74f6\u9888\u3001\u7f16\u5199\u591a\u7ebf\u7a0b\u540c\u6b65\u4ee3\u7801\u3001\u5b66\u4e60CUDA\u7f16\u7a0b\u3001OpenMP\u7f16\u7a0b\u4ee5\u53ca\u524d\u6bb5\u65f6\u95f4\u5927\u70ed\u7684Spark\u6846\u67b6\u7b49\u7b49\u3002\u771f\u6b63\u610f\u4e49\u4e0a\u5c06\u7406\u8bba\u4e0e\u5b9e\u8df5\u5b8c\u7f8e\u5730\u7ed3\u5408\u5728\u4e86\u4e00\u8d77\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/CS149/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a CMU15418 \uff0c CS149 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/CS149/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/MIT6.824/","text":"MIT6.824: Distributed System \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u5e76\u884c\u7f16\u7a0b \u7f16\u7a0b\u8bed\u8a00\uff1aGo \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a200\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u548cMIT6.S081\u4e00\u6837\uff0c\u51fa\u54c1\u81eaMIT\u5927\u540d\u9f0e\u9f0e\u7684PDOS\u5b9e\u9a8c\u5ba4\uff0c\u6388\u8bfe\u8001\u5e08Robert Morris\u6559\u6388\u66fe\u662f\u4e00\u4f4d\u9876\u5c16\u9ed1\u5ba2\uff0c\u4e16\u754c\u4e0a\u7b2c\u4e00\u4e2a\u8815\u866b\u75c5\u6bd2Morris\u75c5\u6bd2\u5c31\u662f\u51fa\u81ea\u4ed6\u4e4b\u624b\u3002 \u8fd9\u95e8\u8bfe\u6bcf\u8282\u8bfe\u90fd\u4f1a\u7cbe\u8bfb\u4e00\u7bc7\u5206\u5e03\u5f0f\u7cfb\u7edf\u9886\u57df\u7684\u7ecf\u5178\u8bba\u6587\uff0c\u5e76\u7531\u6b64\u4f20\u6388\u5206\u5e03\u5f0f\u7cfb\u7edf\u8bbe\u8ba1\u4e0e\u5b9e\u73b0\u7684\u91cd\u8981\u539f\u5219\u548c\u5173\u952e\u6280\u672f\u3002\u540c\u65f6\u5176\u8bfe\u7a0bProject\u4e5f\u662f\u4ee5\u5176\u96be\u5ea6\u4e4b\u5927\u800c\u95fb\u540d\u9050\u8fe9\uff0c4\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u5faa\u5e8f\u6e10\u8fdb\u5e26\u4f60\u5b9e\u73b0\u4e00\u4e2a\u57fa\u4e8eRaft\u5171\u8bc6\u7b97\u6cd5\u7684KV-store\u6846\u67b6\uff0c\u8ba9\u4f60\u5728\u75db\u82e6\u7684debug\u4e2d\u4f53\u4f1a\u5e76\u884c\u4e0e\u5206\u5e03\u5f0f\u5e26\u6765\u7684\u968f\u673a\u6027\u548c\u590d\u6742\u6027\u3002 \u540c\u6837\uff0c\u8fd9\u95e8\u8bfe\u7531\u4e8e\u592a\u8fc7\u51fa\u540d\uff0c\u7f51\u4e0a\u7b54\u6848\u65e0\u6570\uff0c\u5e0c\u671b\u5927\u5bb6\u4e0d\u8981\u53c2\u8003\uff0c\u800c\u662f\u529b\u56fe\u81ea\u4e3b\u5b9e\u73b0\u6574\u4e2aProject\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0\uff0c\u4ee5\u9605\u8bfb\u8bba\u6587\u4e3a\u4e3b \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2a\u975e\u5e38\u8650\u7684Project\uff0c\u5177\u4f53\u8981\u6c42\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002\u6b64\u5916\u4e5f\u53ef\u4ee5\u53c2\u8003 OneSizeFitsQuorum \u7684 lab \u6587\u6863 \uff0c\u5176\u8f83\u4e3a\u6e05\u6670\u5730\u4ecb\u7ecd\u4e86\u5b9e\u73b0 lab1-4 \u548c challenge1-2 \u9700\u8981\u8003\u8651\u7684\u8bb8\u591a\u7ec6\u8282\uff0c\u5728\u9047\u5230\u74f6\u9888\u671f\u65f6\u53ef\u4ee5\u9605\u8bfb\u4e00\u4e0b~","title":"MIT 6.824: Distributed System"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/MIT6.824/#mit6824-distributed-system","text":"","title":"MIT6.824: Distributed System"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/MIT6.824/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u5e76\u884c\u7f16\u7a0b \u7f16\u7a0b\u8bed\u8a00\uff1aGo \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a200\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u548cMIT6.S081\u4e00\u6837\uff0c\u51fa\u54c1\u81eaMIT\u5927\u540d\u9f0e\u9f0e\u7684PDOS\u5b9e\u9a8c\u5ba4\uff0c\u6388\u8bfe\u8001\u5e08Robert Morris\u6559\u6388\u66fe\u662f\u4e00\u4f4d\u9876\u5c16\u9ed1\u5ba2\uff0c\u4e16\u754c\u4e0a\u7b2c\u4e00\u4e2a\u8815\u866b\u75c5\u6bd2Morris\u75c5\u6bd2\u5c31\u662f\u51fa\u81ea\u4ed6\u4e4b\u624b\u3002 \u8fd9\u95e8\u8bfe\u6bcf\u8282\u8bfe\u90fd\u4f1a\u7cbe\u8bfb\u4e00\u7bc7\u5206\u5e03\u5f0f\u7cfb\u7edf\u9886\u57df\u7684\u7ecf\u5178\u8bba\u6587\uff0c\u5e76\u7531\u6b64\u4f20\u6388\u5206\u5e03\u5f0f\u7cfb\u7edf\u8bbe\u8ba1\u4e0e\u5b9e\u73b0\u7684\u91cd\u8981\u539f\u5219\u548c\u5173\u952e\u6280\u672f\u3002\u540c\u65f6\u5176\u8bfe\u7a0bProject\u4e5f\u662f\u4ee5\u5176\u96be\u5ea6\u4e4b\u5927\u800c\u95fb\u540d\u9050\u8fe9\uff0c4\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u5faa\u5e8f\u6e10\u8fdb\u5e26\u4f60\u5b9e\u73b0\u4e00\u4e2a\u57fa\u4e8eRaft\u5171\u8bc6\u7b97\u6cd5\u7684KV-store\u6846\u67b6\uff0c\u8ba9\u4f60\u5728\u75db\u82e6\u7684debug\u4e2d\u4f53\u4f1a\u5e76\u884c\u4e0e\u5206\u5e03\u5f0f\u5e26\u6765\u7684\u968f\u673a\u6027\u548c\u590d\u6742\u6027\u3002 \u540c\u6837\uff0c\u8fd9\u95e8\u8bfe\u7531\u4e8e\u592a\u8fc7\u51fa\u540d\uff0c\u7f51\u4e0a\u7b54\u6848\u65e0\u6570\uff0c\u5e0c\u671b\u5927\u5bb6\u4e0d\u8981\u53c2\u8003\uff0c\u800c\u662f\u529b\u56fe\u81ea\u4e3b\u5b9e\u73b0\u6574\u4e2aProject\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/MIT6.824/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0\uff0c\u4ee5\u9605\u8bfb\u8bba\u6587\u4e3a\u4e3b \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2a\u975e\u5e38\u8650\u7684Project\uff0c\u5177\u4f53\u8981\u6c42\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E5%B9%B6%E8%A1%8C%E4%B8%8E%E5%88%86%E5%B8%83%E5%BC%8F%E7%B3%BB%E7%BB%9F/MIT6.824/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002\u6b64\u5916\u4e5f\u53ef\u4ee5\u53c2\u8003 OneSizeFitsQuorum \u7684 lab \u6587\u6863 \uff0c\u5176\u8f83\u4e3a\u6e05\u6670\u5730\u4ecb\u7ecd\u4e86\u5b9e\u73b0 lab1-4 \u548c challenge1-2 \u9700\u8981\u8003\u8651\u7684\u8bb8\u591a\u7ec6\u8282\uff0c\u5728\u9047\u5230\u74f6\u9888\u671f\u65f6\u53ef\u4ee5\u9605\u8bfb\u4e00\u4e0b~","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/CMake/","text":"\u4e3a\u4ec0\u4e48\u5b66\u4e60CMake CMake \u662f\u7c7b\u4f3c\u4e8e GNU make \u7684\u8de8\u5e73\u53f0\u81ea\u52a8\u8f6f\u4ef6\u6784\u4ef6\u5de5\u5177\uff0c\u4f7f\u7528 CMakeLists.txt \u5b9a\u4e49\u6784\u5efa\u89c4\u5219\uff0c\u76f8\u6bd4\u4e8e make \u5b83\u63d0\u4f9b\u4e86\u66f4\u591a\u7684\u529f\u80fd\uff0c\u5728\u5404\u79cd\u8f6f\u4ef6\u6784\u5efa\u4e0a\u5e7f\u6cdb\u4f7f\u7528\u3002 \u5f3a\u70c8\u5efa\u8bae\u5b66\u4e60\u4f7f\u7528 make \u548c\u719f\u6089 Makefile \u540e\u518d\u5b66\u4e60CMake \u3002 \u5982\u4f55\u5b66\u4e60CMake CMakeLists.txt \u6bd4 Makefile \u66f4\u4e3a\u62bd\u8c61\uff0c\u7406\u89e3\u548c\u4f7f\u7528\u96be\u5ea6\u4e5f\u66f4\u5927\u3002\u73b0\u9636\u6bb5\u5f88\u591a IDE (\u5982 Visual Studio, CLion)\u63d0\u4f9b\u4e86\u81ea\u52a8\u751f\u6210 CMakeLists.txt \u7684\u529f\u80fd\uff0c\u4f46\u638c\u63e1 CMakeLists.txt \u7684\u57fa\u672c\u7528\u6cd5\u4ecd\u7136\u5f88\u6709\u5fc5\u8981\u3002\u9664\u4e86 CMake \u5b98\u65b9 Tutorial \u5916\uff0c\u4e0a\u6d77\u4ea4\u901a\u5927\u5b66 IPADS \u7ec4\u65b0\u4eba\u57f9\u8bad\u4e5f\u63d0\u4f9b\u4e86 \u5927\u7ea6\u4e00\u5c0f\u65f6\u7684\u89c6\u9891\u6559\u7a0b","title":"CMake"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/CMake/#cmake","text":"CMake \u662f\u7c7b\u4f3c\u4e8e GNU make \u7684\u8de8\u5e73\u53f0\u81ea\u52a8\u8f6f\u4ef6\u6784\u4ef6\u5de5\u5177\uff0c\u4f7f\u7528 CMakeLists.txt \u5b9a\u4e49\u6784\u5efa\u89c4\u5219\uff0c\u76f8\u6bd4\u4e8e make \u5b83\u63d0\u4f9b\u4e86\u66f4\u591a\u7684\u529f\u80fd\uff0c\u5728\u5404\u79cd\u8f6f\u4ef6\u6784\u5efa\u4e0a\u5e7f\u6cdb\u4f7f\u7528\u3002 \u5f3a\u70c8\u5efa\u8bae\u5b66\u4e60\u4f7f\u7528 make \u548c\u719f\u6089 Makefile \u540e\u518d\u5b66\u4e60CMake \u3002","title":"\u4e3a\u4ec0\u4e48\u5b66\u4e60CMake"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/CMake/#cmake_1","text":"CMakeLists.txt \u6bd4 Makefile \u66f4\u4e3a\u62bd\u8c61\uff0c\u7406\u89e3\u548c\u4f7f\u7528\u96be\u5ea6\u4e5f\u66f4\u5927\u3002\u73b0\u9636\u6bb5\u5f88\u591a IDE (\u5982 Visual Studio, CLion)\u63d0\u4f9b\u4e86\u81ea\u52a8\u751f\u6210 CMakeLists.txt \u7684\u529f\u80fd\uff0c\u4f46\u638c\u63e1 CMakeLists.txt \u7684\u57fa\u672c\u7528\u6cd5\u4ecd\u7136\u5f88\u6709\u5fc5\u8981\u3002\u9664\u4e86 CMake \u5b98\u65b9 Tutorial \u5916\uff0c\u4e0a\u6d77\u4ea4\u901a\u5927\u5b66 IPADS \u7ec4\u65b0\u4eba\u57f9\u8bad\u4e5f\u63d0\u4f9b\u4e86 \u5927\u7ea6\u4e00\u5c0f\u65f6\u7684\u89c6\u9891\u6559\u7a0b","title":"\u5982\u4f55\u5b66\u4e60CMake"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Docker/","text":"\u4e3a\u4ec0\u4e48\u4f7f\u7528 Docker \u4f7f\u7528\u522b\u4eba\u5199\u597d\u7684\u8f6f\u4ef6/\u5de5\u5177\u6700\u5927\u7684\u969c\u788d\u662f\u4ec0\u4e48\u2014\u2014\u5fc5\u7136\u662f\u914d\u73af\u5883\u3002\u914d\u73af\u5883\u5e26\u6765\u7684\u6298\u78e8\u4f1a\u6781\u5927\u5730\u6d88\u89e3\u4f60\u5bf9\u8f6f\u4ef6\u3001\u7f16\u7a0b\u672c\u8eab\u7684\u5174\u8da3\u3002\u865a\u62df\u673a\u53ef\u4ee5\u89e3\u51b3\u914d\u73af\u5883\u7684\u4e00\u90e8\u5206\u95ee\u9898\uff0c\u4f46\u5b83\u5e9e\u5927\u7b28\u91cd\uff0c\u4e14\u4e3a\u4e86\u67d0\u4e2a\u5e94\u7528\u7684\u73af\u5883\u914d\u7f6e\u597d\u50cf\u4e5f\u4e0d\u503c\u5f97\u6a21\u62df\u4e00\u4e2a\u5168\u65b0\u7684\u64cd\u4f5c\u7cfb\u7edf\u3002 Docker \u7684\u51fa\u73b0\u8ba9\u73af\u5883\u914d\u7f6e\u53d8\u5f97\uff08\u6216\u8bb8\uff09\u4e0d\u518d\u6298\u78e8\u3002\u7b80\u5355\u6765\u8bf4Docker\u4f7f\u7528\u8f7b\u91cf\u7ea7\u7684\u201c\u5bb9\u5668\u201d\uff08container\uff09\u800c\u4e0d\u662f\u6574\u4e2a\u64cd\u4f5c\u7cfb\u7edf\u53bb\u652f\u6301\u4e00\u4e2a\u5e94\u7528\u7684\u914d\u7f6e\u3002\u5e94\u7528\u81ea\u8eab\u8fde\u540c\u5b83\u7684\u73af\u5883\u914d\u7f6e\u88ab\u6253\u5305\u4e3a\u4e00\u4e2a\u4e2aimage\u53ef\u4ee5\u81ea\u7531\u8fd0\u884c\u5728\u4e0d\u540c\u5e73\u53f0\u7684\u4e00\u4e2a\u4e2acontainer\u4e2d\uff0c\u8fd9\u6781\u5927\u5730\u8282\u7701\u4e86\u6240\u6709\u4eba\u7684\u65f6\u95f4\u6210\u672c\u3002 \u5982\u4f55\u5b66\u4e60Docker Docker \u5b98\u65b9\u6587\u6863 \u5f53\u7136\u662f\u6700\u597d\u7684\u521d\u5b66\u6559\u6750\uff0c\u4f46\u6700\u597d\u7684\u5bfc\u5e08\u4e00\u5b9a\u662f\u4f60\u81ea\u5df1\u2014\u2014\u5c1d\u8bd5\u53bb\u4f7f\u7528Docker\u624d\u80fd\u4eab\u53d7\u5b83\u5e26\u6765\u7684\u4fbf\u5229\u3002Docker\u5728\u5de5\u4e1a\u754c\u53d1\u5c55\u8fc5\u731b\u5e76\u5df2\u7ecf\u975e\u5e38\u6210\u719f\uff0c\u4f60\u53ef\u4ee5\u4e0b\u8f7d\u5b83\u7684\u684c\u9762\u7aef\u5e76\u4f7f\u7528\u56fe\u5f62\u754c\u9762\u3002 \u5f53\u7136\uff0c\u5982\u679c\u4f60\u50cf\u6211\u4e00\u6837\uff0c\u662f\u4e00\u4e2a\u75af\u72c2\u7684\u9020\u8f6e\u5b50\u7231\u597d\u8005\uff0c\u90a3\u4e0d\u59a8\u81ea\u5df1\u4eb2\u624b\u5199\u4e00\u4e2a \u8ff7\u4f60Docker \u6765\u52a0\u6df1\u7406\u89e3\u3002 KodeKloud Docker for the Absolute Beginner \u5168\u9762\u7684\u4ecb\u7ecd\u4e86Docker\u7684\u57fa\u7840\u529f\u80fd\uff0c\u5e76\u4e14\u6709\u5927\u91cf\u7684\u914d\u5957\u7ec3\u4e60\uff0c\u540c\u65f6\u63d0\u4f9b\u514d\u8d39\u7684\u4e91\u73af\u5883\u6765\u5b8c\u6210\u7ec3\u4e60\u3002\u5176\u4f59\u7684\u4e91\u76f8\u5173\u7684\u8bfe\u7a0b\u5982Kubernetes\u9700\u8981\u4ed8\u8d39\uff0c\u4f46\u4e2a\u4eba\u5f3a\u70c8\u63a8\u8350\uff1a\u8bb2\u89e3\u975e\u5e38\u4ed4\u7ec6\uff0c\u9002\u5408\u4ece0\u5f00\u59cb\u7684\u65b0\u624b\uff1b\u6709\u914d\u5957\u7684Kubernetes\u7684\u5b9e\u9a8c\u73af\u5883\uff0c\u4e0d\u7528\u88ab\u642d\u5efa\u73af\u5883\u529d\u9000\u3002","title":"Docker"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Docker/#docker","text":"\u4f7f\u7528\u522b\u4eba\u5199\u597d\u7684\u8f6f\u4ef6/\u5de5\u5177\u6700\u5927\u7684\u969c\u788d\u662f\u4ec0\u4e48\u2014\u2014\u5fc5\u7136\u662f\u914d\u73af\u5883\u3002\u914d\u73af\u5883\u5e26\u6765\u7684\u6298\u78e8\u4f1a\u6781\u5927\u5730\u6d88\u89e3\u4f60\u5bf9\u8f6f\u4ef6\u3001\u7f16\u7a0b\u672c\u8eab\u7684\u5174\u8da3\u3002\u865a\u62df\u673a\u53ef\u4ee5\u89e3\u51b3\u914d\u73af\u5883\u7684\u4e00\u90e8\u5206\u95ee\u9898\uff0c\u4f46\u5b83\u5e9e\u5927\u7b28\u91cd\uff0c\u4e14\u4e3a\u4e86\u67d0\u4e2a\u5e94\u7528\u7684\u73af\u5883\u914d\u7f6e\u597d\u50cf\u4e5f\u4e0d\u503c\u5f97\u6a21\u62df\u4e00\u4e2a\u5168\u65b0\u7684\u64cd\u4f5c\u7cfb\u7edf\u3002 Docker \u7684\u51fa\u73b0\u8ba9\u73af\u5883\u914d\u7f6e\u53d8\u5f97\uff08\u6216\u8bb8\uff09\u4e0d\u518d\u6298\u78e8\u3002\u7b80\u5355\u6765\u8bf4Docker\u4f7f\u7528\u8f7b\u91cf\u7ea7\u7684\u201c\u5bb9\u5668\u201d\uff08container\uff09\u800c\u4e0d\u662f\u6574\u4e2a\u64cd\u4f5c\u7cfb\u7edf\u53bb\u652f\u6301\u4e00\u4e2a\u5e94\u7528\u7684\u914d\u7f6e\u3002\u5e94\u7528\u81ea\u8eab\u8fde\u540c\u5b83\u7684\u73af\u5883\u914d\u7f6e\u88ab\u6253\u5305\u4e3a\u4e00\u4e2a\u4e2aimage\u53ef\u4ee5\u81ea\u7531\u8fd0\u884c\u5728\u4e0d\u540c\u5e73\u53f0\u7684\u4e00\u4e2a\u4e2acontainer\u4e2d\uff0c\u8fd9\u6781\u5927\u5730\u8282\u7701\u4e86\u6240\u6709\u4eba\u7684\u65f6\u95f4\u6210\u672c\u3002","title":"\u4e3a\u4ec0\u4e48\u4f7f\u7528 Docker"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Docker/#docker_1","text":"Docker \u5b98\u65b9\u6587\u6863 \u5f53\u7136\u662f\u6700\u597d\u7684\u521d\u5b66\u6559\u6750\uff0c\u4f46\u6700\u597d\u7684\u5bfc\u5e08\u4e00\u5b9a\u662f\u4f60\u81ea\u5df1\u2014\u2014\u5c1d\u8bd5\u53bb\u4f7f\u7528Docker\u624d\u80fd\u4eab\u53d7\u5b83\u5e26\u6765\u7684\u4fbf\u5229\u3002Docker\u5728\u5de5\u4e1a\u754c\u53d1\u5c55\u8fc5\u731b\u5e76\u5df2\u7ecf\u975e\u5e38\u6210\u719f\uff0c\u4f60\u53ef\u4ee5\u4e0b\u8f7d\u5b83\u7684\u684c\u9762\u7aef\u5e76\u4f7f\u7528\u56fe\u5f62\u754c\u9762\u3002 \u5f53\u7136\uff0c\u5982\u679c\u4f60\u50cf\u6211\u4e00\u6837\uff0c\u662f\u4e00\u4e2a\u75af\u72c2\u7684\u9020\u8f6e\u5b50\u7231\u597d\u8005\uff0c\u90a3\u4e0d\u59a8\u81ea\u5df1\u4eb2\u624b\u5199\u4e00\u4e2a \u8ff7\u4f60Docker \u6765\u52a0\u6df1\u7406\u89e3\u3002 KodeKloud Docker for the Absolute Beginner \u5168\u9762\u7684\u4ecb\u7ecd\u4e86Docker\u7684\u57fa\u7840\u529f\u80fd\uff0c\u5e76\u4e14\u6709\u5927\u91cf\u7684\u914d\u5957\u7ec3\u4e60\uff0c\u540c\u65f6\u63d0\u4f9b\u514d\u8d39\u7684\u4e91\u73af\u5883\u6765\u5b8c\u6210\u7ec3\u4e60\u3002\u5176\u4f59\u7684\u4e91\u76f8\u5173\u7684\u8bfe\u7a0b\u5982Kubernetes\u9700\u8981\u4ed8\u8d39\uff0c\u4f46\u4e2a\u4eba\u5f3a\u70c8\u63a8\u8350\uff1a\u8bb2\u89e3\u975e\u5e38\u4ed4\u7ec6\uff0c\u9002\u5408\u4ece0\u5f00\u59cb\u7684\u65b0\u624b\uff1b\u6709\u914d\u5957\u7684Kubernetes\u7684\u5b9e\u9a8c\u73af\u5883\uff0c\u4e0d\u7528\u88ab\u642d\u5efa\u73af\u5883\u529d\u9000\u3002","title":"\u5982\u4f55\u5b66\u4e60Docker"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Git/","text":"\u4e3a\u4ec0\u4e48\u4f7f\u7528Git Git\u662f\u4e00\u6b3e\u5206\u5e03\u5f0f\u7684\u4ee3\u7801\u7248\u672c\u63a7\u5236\u5de5\u5177\uff0cLinux\u4e4b\u7236Linus\u5acc\u5f03\u5f53\u65f6\u4e3b\u6d41\u7684\u4e2d\u5fc3\u5f0f\u7684\u7248\u672c\u63a7\u5236\u5de5\u5177\u592a\u96be\u7528\u8fd8\u8981\u82b1\u94b1\uff0c\u5c31\u81ea\u5df1\u5f00\u53d1\u51fa\u4e86Git\u7528\u6765\u7ef4\u62a4Linux\u7684\u7248\u672c\uff08\u7ed9\u5927\u4f6c\u8dea\u4e86\uff09\u3002 Git\u7684\u8bbe\u8ba1\u975e\u5e38\u4f18\u96c5\uff0c\u4f46\u521d\u5b66\u8005\u901a\u5e38\u56e0\u4e3a\u5f88\u96be\u7406\u89e3\u5176\u5185\u90e8\u903b\u8f91\u56e0\u6b64\u4f1a\u89c9\u5f97\u975e\u5e38\u96be\u7528\u3002\u5bf9Git\u4e0d\u719f\u6089\u7684\u521d\u5b66\u8005\u5f88\u5bb9\u6613\u51fa\u73b0\u56e0\u4e3a\u8bef\u7528\u547d\u4ee4\u5c06\u4ee3\u7801\u7ed9\u63a7\u5236\u7248\u672c\u63a7\u5236\u6ca1\u4e86\u7684\u72b6\u51b5\uff08\u597d\u5427\u662f\u6211\uff09\u3002 \u4f46\u76f8\u4fe1\u6211\uff0c\u548cVim\u4e00\u6837\uff0cGit\u662f\u4e00\u6b3e\u4f60\u6700\u7ec8\u638c\u63e1\u4e4b\u540e\u4f1a\u611f\u53f9\u201c\u5b83\u503c\u5f97\uff01\u201d\u7684\u795e\u5668\u3002 \u5982\u4f55\u5b66\u4e60Git \u548cVim\u4e0d\u540c\uff0c\u6211\u4e0d\u5efa\u8bae\u521d\u5b66\u8005\u5728\u4e00\u77e5\u534a\u89e3\u7684\u60c5\u51b5\u4e0b\u8d38\u7136\u4f7f\u7528Git\uff0c\u56e0\u4e3a\u5b83\u7684\u5185\u90e8\u903b\u8f91\u5e76\u4e0d\u80fd\u719f\u80fd\u751f\u5de7\uff0c\u800c\u662f\u9700\u8981\u82b1\u65f6\u95f4\u53bb\u7406\u89e3\u3002\u6211\u63a8\u8350\u7684\u5b66\u4e60\u8def\u7ebf\u5982\u4e0b\uff1a \u9605\u8bfb\u8fd9\u7bc7 Git tutorial \u3002 \u9605\u8bfb\u8fd9\u672c\u5f00\u6e90\u4e66\u7c4d Pro Git \u7684Chapter1 - Chapter5\uff0c\u662f\u7684\u6ca1\u9519\uff0c\u5b66Git\u9700\u8981\u8bfb\u4e00\u672c\u4e66\uff08\u6342\u8138\uff09\u3002 \u6b64\u65f6\u4f60\u5df2\u7ecf\u638c\u63e1\u4e86Git\u7684\u539f\u7406\u548c\u7edd\u5927\u90e8\u5206\u7528\u6cd5\uff0c\u63a5\u4e0b\u6765\u5c31\u53ef\u4ee5\u5728\u5b9e\u8df5\u4e2d\u53cd\u590d\u5de9\u56faGit\u7684\u547d\u4ee4\u4e86\u3002\u4f46\u7528\u597d\u5b83\u540c\u6837\u662f\u4e00\u95e8\u54f2\u5b66\uff0c\u6211\u4e2a\u4eba\u89c9\u5f97\u8fd9\u7bc7 \u5982\u4f55\u5199\u597d Commit Message \u7684\u535a\u5ba2\u975e\u5e38\u503c\u5f97\u4e00\u8bfb\u3002 \u597d\u7684\u6b64\u65f6\u4f60\u5df2\u7ecf\u7231\u4e0a\u4e86Git\uff0c\u4f60\u5df2\u7ecf\u4e0d\u6ee1\u8db3\u4e8e\u5b66\u4f1a\u5b83\u4e86\uff0c\u4f60\u60f3\u81ea\u5df1\u5b9e\u73b0\u4e00\u4e2aGit\uff01\u5de7\u4e86\uff0c\u6211\u5f53\u5e74\u4e5f\u6709\u8fd9\u6837\u7684\u60f3\u6cd5\uff0c \u8fd9\u7bc7tutorial \u53ef\u4ee5\u6ee1\u8db3\u4f60\uff01 \u4ec0\u4e48\uff1f\u5149\u5b9e\u73b0\u4e00\u4e2aGit\u65e0\u6cd5\u6ee1\u8db3\u4f60\uff1f\u5c0f\u4f19\u5b50/\u5c0f\u4ed9\u5973\u6709\u524d\u9014\uff0c\u5de7\u7684\u662f\u6211\u4e5f\u559c\u6b22\u9020\u8f6e\u5b50\uff0c\u8fd9\u4e24\u4e2aGithub\u9879\u76ee build-your-own-x \u548c project-based-learning \u6536\u5f55\u4e86\u4f60\u80fd\u60f3\u5230\u7684\u5404\u79cd\u9020\u8f6e\u5b50\u6559\u7a0b\uff0c\u6bd4\u5982\uff1a\u81ea\u5df1\u9020\u4e2a\u7f16\u8f91\u5668\u3001\u81ea\u5df1\u5199\u4e2a\u865a\u62df\u673a\u3001\u81ea\u5df1\u5199\u4e2adocker\u3001\u81ea\u5df1\u5199\u4e2aTCP\u7b49\u7b49\u7b49\u7b49\u3002","title":"Git"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Git/#git","text":"Git\u662f\u4e00\u6b3e\u5206\u5e03\u5f0f\u7684\u4ee3\u7801\u7248\u672c\u63a7\u5236\u5de5\u5177\uff0cLinux\u4e4b\u7236Linus\u5acc\u5f03\u5f53\u65f6\u4e3b\u6d41\u7684\u4e2d\u5fc3\u5f0f\u7684\u7248\u672c\u63a7\u5236\u5de5\u5177\u592a\u96be\u7528\u8fd8\u8981\u82b1\u94b1\uff0c\u5c31\u81ea\u5df1\u5f00\u53d1\u51fa\u4e86Git\u7528\u6765\u7ef4\u62a4Linux\u7684\u7248\u672c\uff08\u7ed9\u5927\u4f6c\u8dea\u4e86\uff09\u3002 Git\u7684\u8bbe\u8ba1\u975e\u5e38\u4f18\u96c5\uff0c\u4f46\u521d\u5b66\u8005\u901a\u5e38\u56e0\u4e3a\u5f88\u96be\u7406\u89e3\u5176\u5185\u90e8\u903b\u8f91\u56e0\u6b64\u4f1a\u89c9\u5f97\u975e\u5e38\u96be\u7528\u3002\u5bf9Git\u4e0d\u719f\u6089\u7684\u521d\u5b66\u8005\u5f88\u5bb9\u6613\u51fa\u73b0\u56e0\u4e3a\u8bef\u7528\u547d\u4ee4\u5c06\u4ee3\u7801\u7ed9\u63a7\u5236\u7248\u672c\u63a7\u5236\u6ca1\u4e86\u7684\u72b6\u51b5\uff08\u597d\u5427\u662f\u6211\uff09\u3002 \u4f46\u76f8\u4fe1\u6211\uff0c\u548cVim\u4e00\u6837\uff0cGit\u662f\u4e00\u6b3e\u4f60\u6700\u7ec8\u638c\u63e1\u4e4b\u540e\u4f1a\u611f\u53f9\u201c\u5b83\u503c\u5f97\uff01\u201d\u7684\u795e\u5668\u3002","title":"\u4e3a\u4ec0\u4e48\u4f7f\u7528Git"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Git/#git_1","text":"\u548cVim\u4e0d\u540c\uff0c\u6211\u4e0d\u5efa\u8bae\u521d\u5b66\u8005\u5728\u4e00\u77e5\u534a\u89e3\u7684\u60c5\u51b5\u4e0b\u8d38\u7136\u4f7f\u7528Git\uff0c\u56e0\u4e3a\u5b83\u7684\u5185\u90e8\u903b\u8f91\u5e76\u4e0d\u80fd\u719f\u80fd\u751f\u5de7\uff0c\u800c\u662f\u9700\u8981\u82b1\u65f6\u95f4\u53bb\u7406\u89e3\u3002\u6211\u63a8\u8350\u7684\u5b66\u4e60\u8def\u7ebf\u5982\u4e0b\uff1a \u9605\u8bfb\u8fd9\u7bc7 Git tutorial \u3002 \u9605\u8bfb\u8fd9\u672c\u5f00\u6e90\u4e66\u7c4d Pro Git \u7684Chapter1 - Chapter5\uff0c\u662f\u7684\u6ca1\u9519\uff0c\u5b66Git\u9700\u8981\u8bfb\u4e00\u672c\u4e66\uff08\u6342\u8138\uff09\u3002 \u6b64\u65f6\u4f60\u5df2\u7ecf\u638c\u63e1\u4e86Git\u7684\u539f\u7406\u548c\u7edd\u5927\u90e8\u5206\u7528\u6cd5\uff0c\u63a5\u4e0b\u6765\u5c31\u53ef\u4ee5\u5728\u5b9e\u8df5\u4e2d\u53cd\u590d\u5de9\u56faGit\u7684\u547d\u4ee4\u4e86\u3002\u4f46\u7528\u597d\u5b83\u540c\u6837\u662f\u4e00\u95e8\u54f2\u5b66\uff0c\u6211\u4e2a\u4eba\u89c9\u5f97\u8fd9\u7bc7 \u5982\u4f55\u5199\u597d Commit Message \u7684\u535a\u5ba2\u975e\u5e38\u503c\u5f97\u4e00\u8bfb\u3002 \u597d\u7684\u6b64\u65f6\u4f60\u5df2\u7ecf\u7231\u4e0a\u4e86Git\uff0c\u4f60\u5df2\u7ecf\u4e0d\u6ee1\u8db3\u4e8e\u5b66\u4f1a\u5b83\u4e86\uff0c\u4f60\u60f3\u81ea\u5df1\u5b9e\u73b0\u4e00\u4e2aGit\uff01\u5de7\u4e86\uff0c\u6211\u5f53\u5e74\u4e5f\u6709\u8fd9\u6837\u7684\u60f3\u6cd5\uff0c \u8fd9\u7bc7tutorial \u53ef\u4ee5\u6ee1\u8db3\u4f60\uff01 \u4ec0\u4e48\uff1f\u5149\u5b9e\u73b0\u4e00\u4e2aGit\u65e0\u6cd5\u6ee1\u8db3\u4f60\uff1f\u5c0f\u4f19\u5b50/\u5c0f\u4ed9\u5973\u6709\u524d\u9014\uff0c\u5de7\u7684\u662f\u6211\u4e5f\u559c\u6b22\u9020\u8f6e\u5b50\uff0c\u8fd9\u4e24\u4e2aGithub\u9879\u76ee build-your-own-x \u548c project-based-learning \u6536\u5f55\u4e86\u4f60\u80fd\u60f3\u5230\u7684\u5404\u79cd\u9020\u8f6e\u5b50\u6559\u7a0b\uff0c\u6bd4\u5982\uff1a\u81ea\u5df1\u9020\u4e2a\u7f16\u8f91\u5668\u3001\u81ea\u5df1\u5199\u4e2a\u865a\u62df\u673a\u3001\u81ea\u5df1\u5199\u4e2adocker\u3001\u81ea\u5df1\u5199\u4e2aTCP\u7b49\u7b49\u7b49\u7b49\u3002","title":"\u5982\u4f55\u5b66\u4e60Git"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Github/","text":"Github\u662f\u4ec0\u4e48 \u4ece\u529f\u80fd\u4e0a\u6765\u8bf4\uff0cGithub\u662f\u4e00\u4e2a\u5728\u7ebf\u4ee3\u7801\u6258\u7ba1\u5e73\u53f0\u3002\u4f60\u53ef\u4ee5\u5c06\u4f60\u7684\u672c\u5730Git\u4ed3\u5e93\u6258\u7ba1\u5230Github\u4e0a\uff0c\u4f9b\u591a\u4eba\u540c\u65f6\u5f00\u53d1\u6d4f\u89c8\u3002\u4f46\u73b0\u5982\u4ecaGithub\u7684\u610f\u4e49\u5df2\u8fdc\u4e0d\u6b62\u5982\u6b64\uff0c\u5b83\u5df2\u7ecf\u6f14\u53d8\u4e3a\u4e00\u4e2a\u975e\u5e38\u6d3b\u8dc3\u4e14\u8d44\u6e90\u6781\u4e3a\u4e30\u5bcc\u7684\u5f00\u6e90\u4ea4\u6d41\u793e\u533a\u3002\u5168\u4e16\u754c\u7684\u8f6f\u4ef6\u5f00\u53d1\u8005\u5728Github\u4e0a\u5206\u4eab\u5404\u5f0f\u5404\u6837\u79cd\u7c7b\u7e41\u591a\u7684\u5f00\u6e90\u8f6f\u4ef6\u3002\u5927\u5230\u5de5\u4e1a\u7ea7\u7684\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6pytorch\u3001tensorflow\uff0c\u5c0f\u5230\u51e0\u5341\u884c\u7684\u5b9e\u7528\u811a\u672c\uff0c\u65e2\u6709\u786c\u6838\u7684\u77e5\u8bc6\u5206\u4eab\uff0c\u4e5f\u6709\u4fdd\u59c6\u7ea7\u7684\u6559\u7a0b\u6307\u5bfc\uff0c\u751a\u81f3\u5f88\u591a\u6280\u672f\u4e66\u7c4d\u4e5f\u5728github\u4e0a\u5f00\u6e90\uff08\u4f8b\u5982\u8bf8\u4f4d\u6b63\u5728\u770b\u7684\u8fd9\u672c\u2014\u2014\u5982\u679c\u6211\u539a\u7740\u8138\u76ae\u52c9\u5f3a\u79f0\u4e4b\u4e3a\u4e66\u7684\u8bdd\uff09\u3002\u95f2\u6765\u65e0\u4e8b\u901b\u901bGithub\u5df2\u7ecf\u6210\u4e3a\u4e86\u6211\u65e5\u5e38\u751f\u6d3b\u7684\u4e00\u90e8\u5206\u3002 \u5728Github\u91cc\uff0c\u661f\u661f\u662f\u5bf9\u4e00\u4e2a\u9879\u76ee\u81f3\u9ad8\u65e0\u4e0a\u7684\u80af\u5b9a\uff0c\u5982\u679c\u4f60\u89c9\u5f97\u8fd9\u672c\u4e66\u5bf9\u4f60\u6709\u7528\u7684\u8bdd\uff0c\u6b22\u8fce\u901a\u8fc7\u53f3\u4e0a\u89d2\u7684\u94fe\u63a5\u8fdb\u5165\u4ed3\u5e93\u4e3b\u9875\u732e\u51fa\u4f60\u5b9d\u8d35\u7684\u661f\u661f\u2728\u3002 \u5982\u4f55\u4f7f\u7528Github \u5982\u679c\u4f60\u8fd8\u4ece\u672a\u5728Github\u4e0a\u5efa\u7acb\u8fc7\u81ea\u5df1\u7684\u8fdc\u7a0b\u4ed3\u5e93\uff0c\u4e5f\u6ca1\u6709\u514b\u9686\u8fc7\u522b\u4eba\u7684\u4ee3\u7801\uff0c\u90a3\u4e48\u6211\u5efa\u8bae\u4f60\u4ece Github\u7684\u5b98\u65b9\u6559\u7a0b \u5f00\u59cb\u81ea\u5df1\u7684\u5f00\u6e90\u4e4b\u65c5\u3002 \u5982\u679c\u4f60\u60f3\u65f6\u523b\u5173\u6ce8Github\u4e0a\u4e00\u4e9b\u6709\u8da3\u7684\u5f00\u6e90\u9879\u76ee\uff0c\u90a3\u4e48\u6211\u5411\u4f60\u91cd\u78c5\u63a8\u8350 HelloGithub \u8fd9\u4e2a\u7f51\u7ad9\u4ee5\u53ca\u5b83\u7684\u540c\u540d\u5fae\u4fe1\u516c\u4f17\u53f7\u3002\u5b83\u4f1a\u5b9a\u671f\u6536\u5f55Github\u4e0a\u8fd1\u671f\u5f00\u59cb\u6d41\u884c\u7684\u6216\u8005\u975e\u5e38\u6709\u8da3\u7684\u5f00\u6e90\u9879\u76ee\uff0c\u8ba9\u4f60\u6709\u673a\u4f1a\u7b2c\u4e00\u65f6\u95f4\u63a5\u89e6\u5404\u7c7b\u4f18\u8d28\u8d44\u6e90\u3002 Github\u4e4b\u6240\u4ee5\u6210\u529f\uff0c\u6211\u60f3\u662f\u5f97\u76ca\u4e8e\u201c\u6211\u4e3a\u4eba\u4eba\uff0c\u4eba\u4eba\u4e3a\u6211\u201d\u7684\u5f00\u6e90\u7cbe\u795e\uff0c\u5f97\u76ca\u4e8e\u77e5\u8bc6\u5206\u4eab\u7684\u5feb\u4e50\u3002\u5982\u679c\u4f60\u4e5f\u60f3\u6210\u4e3a\u4e0b\u4e00\u4e2a\u4e07\u4eba\u656c\u4ef0\u7684\u5f00\u6e90\u5927\u4f6c\uff0c\u6216\u8005\u4e0b\u4e00\u4e2astar\u7834\u4e07\u7684\u9879\u76ee\u4f5c\u8005\u3002\u90a3\u5c31\u628a\u4f60\u5728\u5f00\u53d1\u8fc7\u7a0b\u4e2d\u7075\u611f\u4e00\u73b0\u7684idea\u5316\u4f5c\u4ee3\u7801\uff0c\u5c55\u793a\u5728Github\u4e0a\u5427\uff5e \u4e0d\u8fc7\u9700\u8981\u63d0\u9192\u7684\u662f\uff0c\u5f00\u6e90\u793e\u533a\u4e0d\u662f\u6cd5\u5916\u4e4b\u5730\uff0c\u5f88\u591a\u5f00\u6e90\u8f6f\u4ef6\u5e76\u4e0d\u662f\u53ef\u4ee5\u968f\u610f\u590d\u5236\u5206\u53d1\u751a\u81f3\u8d29\u5356\u7684\uff0c\u4e86\u89e3\u5404\u7c7b \u5f00\u6e90\u534f\u8bae \u5e76\u9075\u5b88\uff0c\u4e0d\u4ec5\u662f\u6cd5\u5f8b\u7684\u8981\u6c42\uff0c\u66f4\u662f\u6bcf\u4e2a\u5f00\u6e90\u793e\u533a\u6210\u5458\u7684\u8d23\u4efb\u3002","title":"Github"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Github/#github","text":"\u4ece\u529f\u80fd\u4e0a\u6765\u8bf4\uff0cGithub\u662f\u4e00\u4e2a\u5728\u7ebf\u4ee3\u7801\u6258\u7ba1\u5e73\u53f0\u3002\u4f60\u53ef\u4ee5\u5c06\u4f60\u7684\u672c\u5730Git\u4ed3\u5e93\u6258\u7ba1\u5230Github\u4e0a\uff0c\u4f9b\u591a\u4eba\u540c\u65f6\u5f00\u53d1\u6d4f\u89c8\u3002\u4f46\u73b0\u5982\u4ecaGithub\u7684\u610f\u4e49\u5df2\u8fdc\u4e0d\u6b62\u5982\u6b64\uff0c\u5b83\u5df2\u7ecf\u6f14\u53d8\u4e3a\u4e00\u4e2a\u975e\u5e38\u6d3b\u8dc3\u4e14\u8d44\u6e90\u6781\u4e3a\u4e30\u5bcc\u7684\u5f00\u6e90\u4ea4\u6d41\u793e\u533a\u3002\u5168\u4e16\u754c\u7684\u8f6f\u4ef6\u5f00\u53d1\u8005\u5728Github\u4e0a\u5206\u4eab\u5404\u5f0f\u5404\u6837\u79cd\u7c7b\u7e41\u591a\u7684\u5f00\u6e90\u8f6f\u4ef6\u3002\u5927\u5230\u5de5\u4e1a\u7ea7\u7684\u6df1\u5ea6\u5b66\u4e60\u6846\u67b6pytorch\u3001tensorflow\uff0c\u5c0f\u5230\u51e0\u5341\u884c\u7684\u5b9e\u7528\u811a\u672c\uff0c\u65e2\u6709\u786c\u6838\u7684\u77e5\u8bc6\u5206\u4eab\uff0c\u4e5f\u6709\u4fdd\u59c6\u7ea7\u7684\u6559\u7a0b\u6307\u5bfc\uff0c\u751a\u81f3\u5f88\u591a\u6280\u672f\u4e66\u7c4d\u4e5f\u5728github\u4e0a\u5f00\u6e90\uff08\u4f8b\u5982\u8bf8\u4f4d\u6b63\u5728\u770b\u7684\u8fd9\u672c\u2014\u2014\u5982\u679c\u6211\u539a\u7740\u8138\u76ae\u52c9\u5f3a\u79f0\u4e4b\u4e3a\u4e66\u7684\u8bdd\uff09\u3002\u95f2\u6765\u65e0\u4e8b\u901b\u901bGithub\u5df2\u7ecf\u6210\u4e3a\u4e86\u6211\u65e5\u5e38\u751f\u6d3b\u7684\u4e00\u90e8\u5206\u3002 \u5728Github\u91cc\uff0c\u661f\u661f\u662f\u5bf9\u4e00\u4e2a\u9879\u76ee\u81f3\u9ad8\u65e0\u4e0a\u7684\u80af\u5b9a\uff0c\u5982\u679c\u4f60\u89c9\u5f97\u8fd9\u672c\u4e66\u5bf9\u4f60\u6709\u7528\u7684\u8bdd\uff0c\u6b22\u8fce\u901a\u8fc7\u53f3\u4e0a\u89d2\u7684\u94fe\u63a5\u8fdb\u5165\u4ed3\u5e93\u4e3b\u9875\u732e\u51fa\u4f60\u5b9d\u8d35\u7684\u661f\u661f\u2728\u3002","title":"Github\u662f\u4ec0\u4e48"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Github/#github_1","text":"\u5982\u679c\u4f60\u8fd8\u4ece\u672a\u5728Github\u4e0a\u5efa\u7acb\u8fc7\u81ea\u5df1\u7684\u8fdc\u7a0b\u4ed3\u5e93\uff0c\u4e5f\u6ca1\u6709\u514b\u9686\u8fc7\u522b\u4eba\u7684\u4ee3\u7801\uff0c\u90a3\u4e48\u6211\u5efa\u8bae\u4f60\u4ece Github\u7684\u5b98\u65b9\u6559\u7a0b \u5f00\u59cb\u81ea\u5df1\u7684\u5f00\u6e90\u4e4b\u65c5\u3002 \u5982\u679c\u4f60\u60f3\u65f6\u523b\u5173\u6ce8Github\u4e0a\u4e00\u4e9b\u6709\u8da3\u7684\u5f00\u6e90\u9879\u76ee\uff0c\u90a3\u4e48\u6211\u5411\u4f60\u91cd\u78c5\u63a8\u8350 HelloGithub \u8fd9\u4e2a\u7f51\u7ad9\u4ee5\u53ca\u5b83\u7684\u540c\u540d\u5fae\u4fe1\u516c\u4f17\u53f7\u3002\u5b83\u4f1a\u5b9a\u671f\u6536\u5f55Github\u4e0a\u8fd1\u671f\u5f00\u59cb\u6d41\u884c\u7684\u6216\u8005\u975e\u5e38\u6709\u8da3\u7684\u5f00\u6e90\u9879\u76ee\uff0c\u8ba9\u4f60\u6709\u673a\u4f1a\u7b2c\u4e00\u65f6\u95f4\u63a5\u89e6\u5404\u7c7b\u4f18\u8d28\u8d44\u6e90\u3002 Github\u4e4b\u6240\u4ee5\u6210\u529f\uff0c\u6211\u60f3\u662f\u5f97\u76ca\u4e8e\u201c\u6211\u4e3a\u4eba\u4eba\uff0c\u4eba\u4eba\u4e3a\u6211\u201d\u7684\u5f00\u6e90\u7cbe\u795e\uff0c\u5f97\u76ca\u4e8e\u77e5\u8bc6\u5206\u4eab\u7684\u5feb\u4e50\u3002\u5982\u679c\u4f60\u4e5f\u60f3\u6210\u4e3a\u4e0b\u4e00\u4e2a\u4e07\u4eba\u656c\u4ef0\u7684\u5f00\u6e90\u5927\u4f6c\uff0c\u6216\u8005\u4e0b\u4e00\u4e2astar\u7834\u4e07\u7684\u9879\u76ee\u4f5c\u8005\u3002\u90a3\u5c31\u628a\u4f60\u5728\u5f00\u53d1\u8fc7\u7a0b\u4e2d\u7075\u611f\u4e00\u73b0\u7684idea\u5316\u4f5c\u4ee3\u7801\uff0c\u5c55\u793a\u5728Github\u4e0a\u5427\uff5e \u4e0d\u8fc7\u9700\u8981\u63d0\u9192\u7684\u662f\uff0c\u5f00\u6e90\u793e\u533a\u4e0d\u662f\u6cd5\u5916\u4e4b\u5730\uff0c\u5f88\u591a\u5f00\u6e90\u8f6f\u4ef6\u5e76\u4e0d\u662f\u53ef\u4ee5\u968f\u610f\u590d\u5236\u5206\u53d1\u751a\u81f3\u8d29\u5356\u7684\uff0c\u4e86\u89e3\u5404\u7c7b \u5f00\u6e90\u534f\u8bae \u5e76\u9075\u5b88\uff0c\u4e0d\u4ec5\u662f\u6cd5\u5f8b\u7684\u8981\u6c42\uff0c\u66f4\u662f\u6bcf\u4e2a\u5f00\u6e90\u793e\u533a\u6210\u5458\u7684\u8d23\u4efb\u3002","title":"\u5982\u4f55\u4f7f\u7528Github"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Latex/","text":"\u4e3a\u4ec0\u4e48\u5b66Latex \u5982\u679c\u4f60\u9700\u8981\u5199\u8bba\u6587\uff0c\u90a3\u4e48\u8bf7\u76f4\u63a5\u8df3\u5230\u4e0b\u4e00\u8282\uff0c\u56e0\u4e3a\u4f60\u4e0d\u5b66\u4e5f\u5f97\u5b66\u3002 LaTex\u662f\u4e00\u79cd\u57fa\u4e8eTex\u7684\u6392\u7248\u7cfb\u7edf\uff0c\u7531\u56fe\u7075\u5956\u5f97\u4e3bLamport\u5f00\u53d1\uff0c\u800cTex\u5219\u662f\u7531Knuth\u6700\u521d\u5f00\u53d1\uff0c\u8fd9\u4e24\u4f4d\u90fd\u662f\u8ba1\u7b97\u673a\u754c\u7684\u5de8\u64d8\u3002\u5f53\u7136\u5f00\u53d1\u8005\u5f3a\u5e76\u4e0d\u662f\u6211\u4eec\u5b66\u4e60LaTex\u7684\u7406\u7531\uff0cLaTex\u548c\u5e38\u89c1\u7684\u6240\u89c1\u5373\u6240\u5f97\u7684Word\u6587\u6863\u6700\u5927\u7684\u533a\u522b\u5c31\u662f\u7528\u6237\u53ea\u9700\u8981\u5173\u6ce8\u5199\u4f5c\u7684\u5185\u5bb9\uff0c\u800c\u6392\u7248\u5219\u5b8c\u5168\u4ea4\u7ed9\u8f6f\u4ef6\u81ea\u52a8\u5b8c\u6210\u3002\u8fd9\u8ba9\u6ca1\u6709\u4efb\u4f55\u6392\u7248\u7ecf\u9a8c\u7684\u666e\u901a\u4eba\u5f97\u4ee5\u5199\u51fa\u6392\u7248\u975e\u5e38\u4e13\u4e1a\u7684\u8bba\u6587\u6216\u6587\u7ae0\u3002 Berkeley\u8ba1\u7b97\u673a\u7cfb\u6559\u6388Christos Papadimitriou\u66fe\u8bf4\u8fc7\u4e00\u53e5\u534a\u5f00\u73a9\u7b11\u7684\u8bdd\uff1a Every time I read a LaTeX document, I think, wow, this must be correct! \u5982\u4f55\u5b66\u4e60LaTex \u63a8\u8350\u7684\u5b66\u4e60\u8def\u7ebf\u5982\u4e0b\uff1a LaTex\u7684\u73af\u5883\u914d\u7f6e\u662f\u4e2a\u6bd4\u8f83\u5934\u75bc\u7684\u95ee\u9898\u3002\u5982\u679c\u4f60\u672c\u5730\u914d\u7f6eLaTex\u73af\u5883\u51fa\u73b0\u4e86\u95ee\u9898\uff0c\u53ef\u4ee5\u8003\u8651\u4f7f\u7528 Overleaf \u8fd9\u4e2a\u5728\u7ebfLaTex\u7f16\u8f91\u7f51\u7ad9\u3002\u7ad9\u5185\u4e0d\u4ec5\u6709\u5404\u79cd\u5404\u6837\u7684LaTex\u6a21\u7248\u4f9b\u4f60\u9009\u62e9\u8fd8\u514d\u53bb\u4e86\u73af\u5883\u914d\u7f6e\u7684\u96be\u9898\u3002 \u9605\u8bfb\u4e0b\u9762\u4e09\u7bc7Tutorial: Part-1 , Part-2 , Part-3 . \u5b66\u4e60LaTex\u6700\u597d\u7684\u65b9\u5f0f\u5f53\u7136\u662f\u5199\u8bba\u6587\uff0c\u4e0d\u8fc7\u4ece\u4e00\u95e8\u6570\u5b66\u8bfe\u5165\u624b\u7528LaTex\u5199\u4f5c\u4e1a\u4e5f\u662f\u4e00\u4e2a\u4e0d\u9519\u7684\u9009\u62e9\u3002","title":"Latex"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Latex/#latex","text":"\u5982\u679c\u4f60\u9700\u8981\u5199\u8bba\u6587\uff0c\u90a3\u4e48\u8bf7\u76f4\u63a5\u8df3\u5230\u4e0b\u4e00\u8282\uff0c\u56e0\u4e3a\u4f60\u4e0d\u5b66\u4e5f\u5f97\u5b66\u3002 LaTex\u662f\u4e00\u79cd\u57fa\u4e8eTex\u7684\u6392\u7248\u7cfb\u7edf\uff0c\u7531\u56fe\u7075\u5956\u5f97\u4e3bLamport\u5f00\u53d1\uff0c\u800cTex\u5219\u662f\u7531Knuth\u6700\u521d\u5f00\u53d1\uff0c\u8fd9\u4e24\u4f4d\u90fd\u662f\u8ba1\u7b97\u673a\u754c\u7684\u5de8\u64d8\u3002\u5f53\u7136\u5f00\u53d1\u8005\u5f3a\u5e76\u4e0d\u662f\u6211\u4eec\u5b66\u4e60LaTex\u7684\u7406\u7531\uff0cLaTex\u548c\u5e38\u89c1\u7684\u6240\u89c1\u5373\u6240\u5f97\u7684Word\u6587\u6863\u6700\u5927\u7684\u533a\u522b\u5c31\u662f\u7528\u6237\u53ea\u9700\u8981\u5173\u6ce8\u5199\u4f5c\u7684\u5185\u5bb9\uff0c\u800c\u6392\u7248\u5219\u5b8c\u5168\u4ea4\u7ed9\u8f6f\u4ef6\u81ea\u52a8\u5b8c\u6210\u3002\u8fd9\u8ba9\u6ca1\u6709\u4efb\u4f55\u6392\u7248\u7ecf\u9a8c\u7684\u666e\u901a\u4eba\u5f97\u4ee5\u5199\u51fa\u6392\u7248\u975e\u5e38\u4e13\u4e1a\u7684\u8bba\u6587\u6216\u6587\u7ae0\u3002 Berkeley\u8ba1\u7b97\u673a\u7cfb\u6559\u6388Christos Papadimitriou\u66fe\u8bf4\u8fc7\u4e00\u53e5\u534a\u5f00\u73a9\u7b11\u7684\u8bdd\uff1a Every time I read a LaTeX document, I think, wow, this must be correct!","title":"\u4e3a\u4ec0\u4e48\u5b66Latex"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Latex/#latex_1","text":"\u63a8\u8350\u7684\u5b66\u4e60\u8def\u7ebf\u5982\u4e0b\uff1a LaTex\u7684\u73af\u5883\u914d\u7f6e\u662f\u4e2a\u6bd4\u8f83\u5934\u75bc\u7684\u95ee\u9898\u3002\u5982\u679c\u4f60\u672c\u5730\u914d\u7f6eLaTex\u73af\u5883\u51fa\u73b0\u4e86\u95ee\u9898\uff0c\u53ef\u4ee5\u8003\u8651\u4f7f\u7528 Overleaf \u8fd9\u4e2a\u5728\u7ebfLaTex\u7f16\u8f91\u7f51\u7ad9\u3002\u7ad9\u5185\u4e0d\u4ec5\u6709\u5404\u79cd\u5404\u6837\u7684LaTex\u6a21\u7248\u4f9b\u4f60\u9009\u62e9\u8fd8\u514d\u53bb\u4e86\u73af\u5883\u914d\u7f6e\u7684\u96be\u9898\u3002 \u9605\u8bfb\u4e0b\u9762\u4e09\u7bc7Tutorial: Part-1 , Part-2 , Part-3 . \u5b66\u4e60LaTex\u6700\u597d\u7684\u65b9\u5f0f\u5f53\u7136\u662f\u5199\u8bba\u6587\uff0c\u4e0d\u8fc7\u4ece\u4e00\u95e8\u6570\u5b66\u8bfe\u5165\u624b\u7528LaTex\u5199\u4f5c\u4e1a\u4e5f\u662f\u4e00\u4e2a\u4e0d\u9519\u7684\u9009\u62e9\u3002","title":"\u5982\u4f55\u5b66\u4e60LaTex"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Makefile/","text":"\u4e3a\u4ec0\u4e48\u5b66Makefile \u5927\u5bb6\u7b2c\u4e00\u6b21\u5199hello world\u7a0b\u5e8f\u7684\u65f6\u5019\u4e00\u5b9a\u90fd\u8bb0\u5f97\uff0c\u5728\u7f16\u8f91\u5b8c helloworld.c \u4e4b\u540e\uff0c\u9700\u8981\u7528 gcc \u7f16\u8bd1\u751f\u6210\u53ef\u6267\u884c\u6587\u4ef6\uff0c\u7136\u540e\u518d\u6267\u884c\uff08\u5982\u679c\u4f60\u4e0d\u7406\u89e3\u524d\u9762\u8fd9\u6bb5\u8bdd\uff0c\u8bf7\u5148\u81ea\u884c\u8c37\u6b4c gcc \u7f16\u8bd1 \u5e76\u7406\u89e3\u76f8\u5173\u5185\u5bb9\uff09\u3002\u4f46\u5982\u679c\u4f60\u7684\u9879\u76ee\u7531\u6210\u767e\u4e0a\u5343\u4e2aC\u6e90\u6587\u4ef6\u7ec4\u6210\uff0c\u5e76\u4e14\u661f\u7f57\u68cb\u5e03\u5728\u5404\u4e2a\u5b50\u76ee\u5f55\u4e0b\uff0c\u4f60\u8be5\u5982\u4f55\u5c06\u5b83\u4eec\u7f16\u8bd1\u94fe\u63a5\u5230\u4e00\u8d77\u5462\uff1f\u5047\u5982\u4f60\u7684\u9879\u76ee\u7f16\u8bd1\u4e00\u6b21\u9700\u8981\u534a\u4e2a\u5c0f\u65f6\uff08\u5927\u578b\u9879\u76ee\u76f8\u5f53\u5e38\u89c1\uff09\uff0c\u800c\u4f60\u53ea\u4fee\u6539\u4e86\u4e00\u4e2a\u5206\u53f7\uff0c\u662f\u4e0d\u662f\u8fd8\u9700\u8981\u518d\u7b49\u534a\u4e2a\u5c0f\u65f6\u5462\uff1f \u8fd9\u65f6\u5019Makefile\u5c31\u95ea\u4eae\u767b\u573a\u4e86\uff0c\u5b83\u80fd\u8ba9\u4f60\u5728\u4e00\u4e2a\u811a\u672c\u91cc\uff08\u5373\u6240\u8c13\u7684Makefile\uff09\u5b9a\u4e49\u6574\u4e2a\u7f16\u8bd1\u6d41\u7a0b\u4ee5\u53ca\u5404\u4e2a\u76ee\u6807\u6587\u4ef6\u4e0e\u6e90\u6587\u4ef6\u4e4b\u95f4\u7684\u4f9d\u8d56\u5173\u7cfb\uff0c\u5e76\u4e14\u53ea\u91cd\u65b0\u7f16\u8bd1\u4f60\u7684\u4fee\u6539\u4f1a\u5f71\u54cd\u5230\u7684\u90e8\u5206\uff0c\u4ece\u800c\u964d\u4f4e\u7f16\u8bd1\u7684\u65f6\u95f4\u3002 \u5982\u4f55\u5b66\u4e60Makefile \u8fd9\u91cc\u6709\u4e00\u7bc7\u5199\u5f97\u6df1\u5165\u6d45\u51fa\u7684 \u6587\u6863 \u4f9b\u5927\u5bb6\u53c2\u8003\u3002 Makefile\u638c\u63e1\u8d77\u6765\u76f8\u5bf9\u5bb9\u6613\uff0c\u4f46\u7528\u597d\u5b83\u9700\u8981\u4e0d\u65ad\u7684\u7ec3\u4e60\u3002\u5c06\u5b83\u878d\u5165\u5230\u81ea\u5df1\u7684\u65e5\u5e38\u5f00\u53d1\u4e2d\uff0c\u52e4\u4e8e\u5b66\u4e60\u548c\u6a21\u4eff\u5176\u4ed6\u4f18\u79c0\u5f00\u6e90\u9879\u76ee\u91cc\u7684Makefile\u7684\u5199\u6cd5\uff0c\u603b\u7ed3\u51fa\u9002\u5408\u81ea\u5df1\u7684template\uff0c\u4e45\u800c\u4e45\u4e4b\uff0c\u4f60\u5bf9Makefile\u7684\u4f7f\u7528\u4f1a\u6108\u52a0\u7eaf\u719f\u3002","title":"Makefile"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Makefile/#makefile","text":"\u5927\u5bb6\u7b2c\u4e00\u6b21\u5199hello world\u7a0b\u5e8f\u7684\u65f6\u5019\u4e00\u5b9a\u90fd\u8bb0\u5f97\uff0c\u5728\u7f16\u8f91\u5b8c helloworld.c \u4e4b\u540e\uff0c\u9700\u8981\u7528 gcc \u7f16\u8bd1\u751f\u6210\u53ef\u6267\u884c\u6587\u4ef6\uff0c\u7136\u540e\u518d\u6267\u884c\uff08\u5982\u679c\u4f60\u4e0d\u7406\u89e3\u524d\u9762\u8fd9\u6bb5\u8bdd\uff0c\u8bf7\u5148\u81ea\u884c\u8c37\u6b4c gcc \u7f16\u8bd1 \u5e76\u7406\u89e3\u76f8\u5173\u5185\u5bb9\uff09\u3002\u4f46\u5982\u679c\u4f60\u7684\u9879\u76ee\u7531\u6210\u767e\u4e0a\u5343\u4e2aC\u6e90\u6587\u4ef6\u7ec4\u6210\uff0c\u5e76\u4e14\u661f\u7f57\u68cb\u5e03\u5728\u5404\u4e2a\u5b50\u76ee\u5f55\u4e0b\uff0c\u4f60\u8be5\u5982\u4f55\u5c06\u5b83\u4eec\u7f16\u8bd1\u94fe\u63a5\u5230\u4e00\u8d77\u5462\uff1f\u5047\u5982\u4f60\u7684\u9879\u76ee\u7f16\u8bd1\u4e00\u6b21\u9700\u8981\u534a\u4e2a\u5c0f\u65f6\uff08\u5927\u578b\u9879\u76ee\u76f8\u5f53\u5e38\u89c1\uff09\uff0c\u800c\u4f60\u53ea\u4fee\u6539\u4e86\u4e00\u4e2a\u5206\u53f7\uff0c\u662f\u4e0d\u662f\u8fd8\u9700\u8981\u518d\u7b49\u534a\u4e2a\u5c0f\u65f6\u5462\uff1f \u8fd9\u65f6\u5019Makefile\u5c31\u95ea\u4eae\u767b\u573a\u4e86\uff0c\u5b83\u80fd\u8ba9\u4f60\u5728\u4e00\u4e2a\u811a\u672c\u91cc\uff08\u5373\u6240\u8c13\u7684Makefile\uff09\u5b9a\u4e49\u6574\u4e2a\u7f16\u8bd1\u6d41\u7a0b\u4ee5\u53ca\u5404\u4e2a\u76ee\u6807\u6587\u4ef6\u4e0e\u6e90\u6587\u4ef6\u4e4b\u95f4\u7684\u4f9d\u8d56\u5173\u7cfb\uff0c\u5e76\u4e14\u53ea\u91cd\u65b0\u7f16\u8bd1\u4f60\u7684\u4fee\u6539\u4f1a\u5f71\u54cd\u5230\u7684\u90e8\u5206\uff0c\u4ece\u800c\u964d\u4f4e\u7f16\u8bd1\u7684\u65f6\u95f4\u3002","title":"\u4e3a\u4ec0\u4e48\u5b66Makefile"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Makefile/#makefile_1","text":"\u8fd9\u91cc\u6709\u4e00\u7bc7\u5199\u5f97\u6df1\u5165\u6d45\u51fa\u7684 \u6587\u6863 \u4f9b\u5927\u5bb6\u53c2\u8003\u3002 Makefile\u638c\u63e1\u8d77\u6765\u76f8\u5bf9\u5bb9\u6613\uff0c\u4f46\u7528\u597d\u5b83\u9700\u8981\u4e0d\u65ad\u7684\u7ec3\u4e60\u3002\u5c06\u5b83\u878d\u5165\u5230\u81ea\u5df1\u7684\u65e5\u5e38\u5f00\u53d1\u4e2d\uff0c\u52e4\u4e8e\u5b66\u4e60\u548c\u6a21\u4eff\u5176\u4ed6\u4f18\u79c0\u5f00\u6e90\u9879\u76ee\u91cc\u7684Makefile\u7684\u5199\u6cd5\uff0c\u603b\u7ed3\u51fa\u9002\u5408\u81ea\u5df1\u7684template\uff0c\u4e45\u800c\u4e45\u4e4b\uff0c\u4f60\u5bf9Makefile\u7684\u4f7f\u7528\u4f1a\u6108\u52a0\u7eaf\u719f\u3002","title":"\u5982\u4f55\u5b66\u4e60Makefile"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Vim/","text":"\u4e3a\u4ec0\u4e48\u5b66\u4e60Vim \u5728\u6211\u770b\u6765Vim\u7f16\u8f91\u5668\u6709\u5982\u4e0b\u7684\u597d\u5904\uff1a \u8ba9\u4f60\u7684\u6574\u4e2a\u5f00\u53d1\u8fc7\u7a0b\u624b\u6307\u4e0d\u9700\u8981\u79bb\u5f00\u952e\u76d8\uff0c\u800c\u4e14\u5149\u6807\u7684\u79fb\u52a8\u4e0d\u9700\u8981\u65b9\u5411\u952e\u4f7f\u5f97\u4f60\u7684\u624b\u6307\u4e00\u76f4\u5904\u5728\u6253\u5b57\u7684\u6700\u4f73\u4f4d\u7f6e\u3002 \u65b9\u4fbf\u7684\u6587\u4ef6\u5207\u6362\u4ee5\u53ca\u9762\u677f\u63a7\u5236\u53ef\u4ee5\u8ba9\u4f60\u540c\u65f6\u5f00\u53d1\u591a\u4efd\u6587\u4ef6\u751a\u81f3\u540c\u4e00\u4e2a\u6587\u4ef6\u7684\u4e0d\u540c\u4f4d\u7f6e\u3002 Vim\u7684\u5b8f\u64cd\u4f5c\u53ef\u4ee5\u6279\u91cf\u5316\u5904\u7406\u91cd\u590d\u64cd\u4f5c\uff08\u4f8b\u5982\u591a\u884ctab\uff0c\u6279\u91cf\u52a0\u53cc\u5f15\u53f7\u7b49\u7b49\uff09 Vim\u662f\u5f88\u591a\u670d\u52a1\u5668\u81ea\u5e26\u7684\u547d\u4ee4\u884c\u7f16\u8f91\u5668\uff0c\u5f53\u4f60\u901a\u8fc7ssh\u8fde\u63a5\u8fdc\u7a0b\u670d\u52a1\u5668\u4e4b\u540e\uff0c\u7531\u4e8e\u6ca1\u6709\u56fe\u5f62\u754c\u9762\uff0c\u53ea\u80fd\u5728\u547d\u4ee4\u884c\u91cc\u8fdb\u884c\u5f00\u53d1\uff08\u5f53\u7136\u73b0\u5728\u5f88\u591aIDE\u5982vscode\u63d0\u4f9b\u4e86ssh\u63d2\u4ef6\u53ef\u4ee5\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\uff09\u3002 \u5f02\u5e38\u4e30\u5bcc\u7684\u63d2\u4ef6\u751f\u6001\uff0c\u8ba9\u4f60\u62e5\u6709\u4e16\u754c\u4e0a\u6700\u82b1\u91cc\u80e1\u54e8\u7684\u547d\u4ee4\u884c\u7f16\u8f91\u5668\u3002 \u5982\u4f55\u5b66\u4e60Vim \u4e0d\u5e78\u7684\u662fVim\u7684\u5b66\u4e60\u66f2\u7ebf\u786e\u5b9e\u76f8\u5f53\u9661\u5ced\uff0c\u6211\u82b1\u4e86\u597d\u51e0\u4e2a\u661f\u671f\u624d\u6162\u6162\u9002\u5e94\u4e86\u7528Vim\u8fdb\u884c\u5f00\u53d1\u7684\u8fc7\u7a0b\u3002\u6700\u5f00\u59cb\u4f60\u4f1a\u89c9\u5f97\u975e\u5e38\u4e0d\u9002\u5e94\uff0c\u4f46\u4e00\u65e6\u71ac\u8fc7\u4e86\u521d\u59cb\u9636\u6bb5\uff0c\u76f8\u4fe1\u6211\uff0c\u4f60\u4f1a\u7231\u4e0aVim\u3002 Vim\u7684\u5b66\u4e60\u8d44\u6599\u6d69\u5982\u70df\u6d77\uff0c\u4f46\u638c\u63e1\u5b83\u6700\u597d\u7684\u65b9\u5f0f\u8fd8\u662f\u5c06\u5b83\u7528\u5728\u65e5\u5e38\u7684\u5f00\u53d1\u8fc7\u7a0b\u4e2d\uff0c\u800c\u4e0d\u662f\u4e00\u4e0a\u6765\u5c31\u53bb\u5b66\u5404\u79cd\u82b1\u91cc\u80e1\u54e8\u7684\u9ad8\u7ea7Vim\u6280\u5de7\u3002\u4e2a\u4eba\u63a8\u8350\u7684\u5b66\u4e60\u8def\u7ebf\u5982\u4e0b\uff1a \u5148\u9605\u8bfb \u8fd9\u7bc7tutorial \uff0c\u638c\u63e1\u57fa\u672c\u7684Vim\u6982\u5ff5\u548c\u4f7f\u7528\u65b9\u5f0f\u3002 \u7528Vim\u81ea\u5e26\u7684vimtutor\u8fdb\u884c\u7ec3\u4e60\uff0c\u5b89\u88c5\u5b8cVim\u4e4b\u540e\u76f4\u63a5\u5728\u547d\u4ee4\u884c\u91cc\u8f93\u5165vimtutor\u5373\u53ef\u8fdb\u5165\u7ec3\u4e60\u7a0b\u5e8f\u3002 \u6700\u540e\u5c31\u662f\u5f3a\u8feb\u81ea\u5df1\u4f7f\u7528Vim\u8fdb\u884c\u5f00\u53d1\uff0cIDE\u91cc\u53ef\u4ee5\u5b89\u88c5Vim\u63d2\u4ef6\u3002 \u7b49\u4f60\u5b8c\u5168\u9002\u5e94Vim\u4e4b\u540e\u65b0\u7684\u4e16\u754c\u4fbf\u5411\u4f60\u655e\u5f00\u4e86\u5927\u95e8\uff0c\u4f60\u53ef\u4ee5\u6309\u9700\u914d\u7f6e\u81ea\u5df1\u7684Vim\uff08\u4fee\u6539.vimrc\u6587\u4ef6\uff09\uff0c\u7f51\u4e0a\u6709\u6570\u4e0d\u80dc\u6570\u7684\u8d44\u6e90\u53ef\u4ee5\u501f\u9274\u3002 \u63a8\u8350\u53c2\u8003\u8d44\u6599 Neil, Drew. Practical Vim: Edit Text at the Speed of Thought. N.p., Pragmatic Bookshelf, 2015. Neil, Drew. Modern Vim: Craft Your Development Environment with Vim 8 and Neovim. United States, Pragmatic Bookshelf.","title":"Vim"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Vim/#vim","text":"\u5728\u6211\u770b\u6765Vim\u7f16\u8f91\u5668\u6709\u5982\u4e0b\u7684\u597d\u5904\uff1a \u8ba9\u4f60\u7684\u6574\u4e2a\u5f00\u53d1\u8fc7\u7a0b\u624b\u6307\u4e0d\u9700\u8981\u79bb\u5f00\u952e\u76d8\uff0c\u800c\u4e14\u5149\u6807\u7684\u79fb\u52a8\u4e0d\u9700\u8981\u65b9\u5411\u952e\u4f7f\u5f97\u4f60\u7684\u624b\u6307\u4e00\u76f4\u5904\u5728\u6253\u5b57\u7684\u6700\u4f73\u4f4d\u7f6e\u3002 \u65b9\u4fbf\u7684\u6587\u4ef6\u5207\u6362\u4ee5\u53ca\u9762\u677f\u63a7\u5236\u53ef\u4ee5\u8ba9\u4f60\u540c\u65f6\u5f00\u53d1\u591a\u4efd\u6587\u4ef6\u751a\u81f3\u540c\u4e00\u4e2a\u6587\u4ef6\u7684\u4e0d\u540c\u4f4d\u7f6e\u3002 Vim\u7684\u5b8f\u64cd\u4f5c\u53ef\u4ee5\u6279\u91cf\u5316\u5904\u7406\u91cd\u590d\u64cd\u4f5c\uff08\u4f8b\u5982\u591a\u884ctab\uff0c\u6279\u91cf\u52a0\u53cc\u5f15\u53f7\u7b49\u7b49\uff09 Vim\u662f\u5f88\u591a\u670d\u52a1\u5668\u81ea\u5e26\u7684\u547d\u4ee4\u884c\u7f16\u8f91\u5668\uff0c\u5f53\u4f60\u901a\u8fc7ssh\u8fde\u63a5\u8fdc\u7a0b\u670d\u52a1\u5668\u4e4b\u540e\uff0c\u7531\u4e8e\u6ca1\u6709\u56fe\u5f62\u754c\u9762\uff0c\u53ea\u80fd\u5728\u547d\u4ee4\u884c\u91cc\u8fdb\u884c\u5f00\u53d1\uff08\u5f53\u7136\u73b0\u5728\u5f88\u591aIDE\u5982vscode\u63d0\u4f9b\u4e86ssh\u63d2\u4ef6\u53ef\u4ee5\u89e3\u51b3\u8fd9\u4e2a\u95ee\u9898\uff09\u3002 \u5f02\u5e38\u4e30\u5bcc\u7684\u63d2\u4ef6\u751f\u6001\uff0c\u8ba9\u4f60\u62e5\u6709\u4e16\u754c\u4e0a\u6700\u82b1\u91cc\u80e1\u54e8\u7684\u547d\u4ee4\u884c\u7f16\u8f91\u5668\u3002","title":"\u4e3a\u4ec0\u4e48\u5b66\u4e60Vim"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Vim/#vim_1","text":"\u4e0d\u5e78\u7684\u662fVim\u7684\u5b66\u4e60\u66f2\u7ebf\u786e\u5b9e\u76f8\u5f53\u9661\u5ced\uff0c\u6211\u82b1\u4e86\u597d\u51e0\u4e2a\u661f\u671f\u624d\u6162\u6162\u9002\u5e94\u4e86\u7528Vim\u8fdb\u884c\u5f00\u53d1\u7684\u8fc7\u7a0b\u3002\u6700\u5f00\u59cb\u4f60\u4f1a\u89c9\u5f97\u975e\u5e38\u4e0d\u9002\u5e94\uff0c\u4f46\u4e00\u65e6\u71ac\u8fc7\u4e86\u521d\u59cb\u9636\u6bb5\uff0c\u76f8\u4fe1\u6211\uff0c\u4f60\u4f1a\u7231\u4e0aVim\u3002 Vim\u7684\u5b66\u4e60\u8d44\u6599\u6d69\u5982\u70df\u6d77\uff0c\u4f46\u638c\u63e1\u5b83\u6700\u597d\u7684\u65b9\u5f0f\u8fd8\u662f\u5c06\u5b83\u7528\u5728\u65e5\u5e38\u7684\u5f00\u53d1\u8fc7\u7a0b\u4e2d\uff0c\u800c\u4e0d\u662f\u4e00\u4e0a\u6765\u5c31\u53bb\u5b66\u5404\u79cd\u82b1\u91cc\u80e1\u54e8\u7684\u9ad8\u7ea7Vim\u6280\u5de7\u3002\u4e2a\u4eba\u63a8\u8350\u7684\u5b66\u4e60\u8def\u7ebf\u5982\u4e0b\uff1a \u5148\u9605\u8bfb \u8fd9\u7bc7tutorial \uff0c\u638c\u63e1\u57fa\u672c\u7684Vim\u6982\u5ff5\u548c\u4f7f\u7528\u65b9\u5f0f\u3002 \u7528Vim\u81ea\u5e26\u7684vimtutor\u8fdb\u884c\u7ec3\u4e60\uff0c\u5b89\u88c5\u5b8cVim\u4e4b\u540e\u76f4\u63a5\u5728\u547d\u4ee4\u884c\u91cc\u8f93\u5165vimtutor\u5373\u53ef\u8fdb\u5165\u7ec3\u4e60\u7a0b\u5e8f\u3002 \u6700\u540e\u5c31\u662f\u5f3a\u8feb\u81ea\u5df1\u4f7f\u7528Vim\u8fdb\u884c\u5f00\u53d1\uff0cIDE\u91cc\u53ef\u4ee5\u5b89\u88c5Vim\u63d2\u4ef6\u3002 \u7b49\u4f60\u5b8c\u5168\u9002\u5e94Vim\u4e4b\u540e\u65b0\u7684\u4e16\u754c\u4fbf\u5411\u4f60\u655e\u5f00\u4e86\u5927\u95e8\uff0c\u4f60\u53ef\u4ee5\u6309\u9700\u914d\u7f6e\u81ea\u5df1\u7684Vim\uff08\u4fee\u6539.vimrc\u6587\u4ef6\uff09\uff0c\u7f51\u4e0a\u6709\u6570\u4e0d\u80dc\u6570\u7684\u8d44\u6e90\u53ef\u4ee5\u501f\u9274\u3002","title":"\u5982\u4f55\u5b66\u4e60Vim"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/Vim/#_1","text":"Neil, Drew. Practical Vim: Edit Text at the Speed of Thought. N.p., Pragmatic Bookshelf, 2015. Neil, Drew. Modern Vim: Craft Your Development Environment with Vim 8 and Neovim. United States, Pragmatic Bookshelf.","title":"\u63a8\u8350\u53c2\u8003\u8d44\u6599"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/tools/","text":"\u4e0b\u8f7d\u5de5\u5177 MacWk \uff1aMac\u8f6f\u4ef6\u7834\u89e3\u7248\u4e0b\u8f7d\u7f51\u7ad9\u3002 Libgen \uff1aPDF\u7535\u5b50\u4e66\u4e0b\u8f7d\u7f51\u7ad9\u3002 z-epub \uff1aePub\u7535\u5b50\u4e66\u4e0b\u8f7d\u7f51\u7ad9\u3002 bitdownloader \uff1a\u6cb9\u7ba1\u89c6\u9891\u4e0b\u8f7d\u5668\u3002 zlibrary \uff1a\u7535\u5b50\u4e66\u4e0b\u8f7d\u7f51\u7ad9(\u53ef\u80fd\u9700\u8981\u7ffb\u5899)\u3002 \u8bbe\u8ba1\u5de5\u5177 excalidraw \uff1a\u4e00\u6b3e\u624b\u7ed8\u98ce\u683c\u7684\u7ed8\u56fe\u5de5\u5177\uff0c\u975e\u5e38\u9002\u5408\u7ed8\u5236\u8bfe\u7a0b\u62a5\u544a\u6216\u8005PPT\u5185\u7684\u793a\u610f\u56fe\u3002 origamiway \uff1a\u624b\u628a\u624b\u6559\u4f60\u600e\u4e48\u6298\u7eb8\u3002 thingiverse \uff1a\u56ca\u62ec\u5404\u7c7b2D/3D\u8bbe\u8ba1\u8d44\u6e90\uff0c\u5176STL\u6587\u4ef6\u4e0b\u8f7d\u53ef\u76f4\u63a53D\u6253\u5370\u3002 \u5b66\u4e60\u7f51\u7ad9 HFS \uff1a\u5404\u7c7b\u8f6f\u4ef6\u6559\u7a0b\u3002 os-wiki \uff1a\b\u64cd\u4f5c\u7cfb\u7edf\u6280\u672f\u8d44\u6e90\u767e\u79d1\u5168\u4e66\u3002","title":"\u5b9e\u7528\u5de5\u5177\u7bb1"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/tools/#_1","text":"MacWk \uff1aMac\u8f6f\u4ef6\u7834\u89e3\u7248\u4e0b\u8f7d\u7f51\u7ad9\u3002 Libgen \uff1aPDF\u7535\u5b50\u4e66\u4e0b\u8f7d\u7f51\u7ad9\u3002 z-epub \uff1aePub\u7535\u5b50\u4e66\u4e0b\u8f7d\u7f51\u7ad9\u3002 bitdownloader \uff1a\u6cb9\u7ba1\u89c6\u9891\u4e0b\u8f7d\u5668\u3002 zlibrary \uff1a\u7535\u5b50\u4e66\u4e0b\u8f7d\u7f51\u7ad9(\u53ef\u80fd\u9700\u8981\u7ffb\u5899)\u3002","title":"\u4e0b\u8f7d\u5de5\u5177"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/tools/#_2","text":"excalidraw \uff1a\u4e00\u6b3e\u624b\u7ed8\u98ce\u683c\u7684\u7ed8\u56fe\u5de5\u5177\uff0c\u975e\u5e38\u9002\u5408\u7ed8\u5236\u8bfe\u7a0b\u62a5\u544a\u6216\u8005PPT\u5185\u7684\u793a\u610f\u56fe\u3002 origamiway \uff1a\u624b\u628a\u624b\u6559\u4f60\u600e\u4e48\u6298\u7eb8\u3002 thingiverse \uff1a\u56ca\u62ec\u5404\u7c7b2D/3D\u8bbe\u8ba1\u8d44\u6e90\uff0c\u5176STL\u6587\u4ef6\u4e0b\u8f7d\u53ef\u76f4\u63a53D\u6253\u5370\u3002","title":"\u8bbe\u8ba1\u5de5\u5177"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/tools/#_3","text":"HFS \uff1a\u5404\u7c7b\u8f6f\u4ef6\u6559\u7a0b\u3002 os-wiki \uff1a\b\u64cd\u4f5c\u7cfb\u7edf\u6280\u672f\u8d44\u6e90\u767e\u79d1\u5168\u4e66\u3002","title":"\u5b66\u4e60\u7f51\u7ad9"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/%E7%BF%BB%E5%A2%99/","text":"\u7ffb\u5899 \u6b64\u94fe\u63a5 \u51fa\u73b0\u5728\u8fd9\u91cc\u7eaf\u5c5e\u4e8c\u8fdb\u5236bit\u7684\u968f\u610f\u7ec4\u5408\uff0c\u4e0e\u672c\u4eba\u6beb\u65e0\u5173\u7cfb\u3002","title":"\u7ffb\u5899"},{"location":"%E5%BF%85%E5%AD%A6%E5%B7%A5%E5%85%B7/%E7%BF%BB%E5%A2%99/#_1","text":"\u6b64\u94fe\u63a5 \u51fa\u73b0\u5728\u8fd9\u91cc\u7eaf\u5c5e\u4e8c\u8fdb\u5236bit\u7684\u968f\u610f\u7ec4\u5408\uff0c\u4e0e\u672c\u4eba\u6beb\u65e0\u5173\u7cfb\u3002","title":"\u7ffb\u5899"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/CS162/","text":"CS162: Operating System \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B, CS61C \u7f16\u7a0b\u8bed\u8a00\uff1a\bC\uff0cX86\u6c47\u7f16 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a200\u5c0f\u65f6+\uff0c\u4e0a\u4e0d\u5c01\u9876 \u8fd9\u95e8\u8bfe\u8ba9\u6211\u8bb0\u5fc6\u72b9\u65b0\u7684\u6709\u4e24\u4e2a\u90e8\u5206\uff1a \u9996\u5148\u662f\u6559\u6750\uff0c\u8fd9\u672c\u4e66\u7528\u7684\u6559\u6750 Operating Systems: Principles and Practice (2nd Edition) \u4e00\u5171\u56db\u5377\uff0c\u5199\u5f97 \u975e\u5e38\u6df1\u5165\u6d45\u51fa\uff0c\u5f88\u597d\u5730\u5f25\u8865\u4e86MIT6.S081\u5728\u7406\u8bba\u77e5\u8bc6\u4e0a\u4e9b\u8bb8\u7a7a\u767d\uff0c\u975e\u5e38\u5efa\u8bae\u5927\u5bb6\u9605\u8bfb\u3002\u76f8\u5173\u8d44\u6e90\u4f1a\u5206\u4eab\u5728\u672c\u4e66\u7684\u7ecf\u5178\u4e66\u7c4d\u63a8\u8350\u6a21\u5757\u3002 \u5176\u6b21\u662f\u8fd9\u95e8\u8bfe\u7684Project \u2014\u2014 Pintos\u3002Pintos\u662f\u7531Ben Pfaff\u7b49\u4eba\u57fa\u4e8eX86\u7f16\u5199\u7684\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edf\uff0cBen Pfaff\u751a\u81f3\u4e13\u95e8\u53d1\u4e86\u7bc7 paper \u6765\u9610\u8ff0Pintos\u7684\u8bbe\u8ba1\u601d\u60f3\u3002\u548cMIT\u7684xv6\u5c0f\u800c\u7cbe\u7684lab\u8bbe\u8ba1\u7406\u5ff5\u4e0d\u540c\uff0c Pintos\u66f4\u6ce8\u91cd\u7cfb\u7edf\u7684Design and Implementation\u3002Pintos\u672c\u8eab\u4ec5\u4e00\u4e07\u884c\u5de6\u53f3\uff0c\u53ea\u63d0\u4f9b\u4e86\u64cd\u4f5c\u7cfb\u7edf\u6700\u57fa\u672c\u7684\u529f\u80fd\u3002\u800c4\u4e2aProject\uff0c\u5c31\u662f\u8ba9\u4f60\u5728\u8fd9\u4e2a\u6781\u4e3a\u7cbe\u7b80\u7684\u64cd\u4f5c\u7cfb\u7edf\u4e4b\u4e0a\uff0c\u5206\u522b\u4e3a\u5176\u589e\u52a0\u7ebf\u7a0b\u8c03\u5ea6\u673a\u5236\uff08Project1\uff09\uff0c\u7cfb\u7edf\u8c03\u7528\uff08Project2\uff09\uff0c\u865a\u62df\u5185\u5b58\uff08Project3\uff09\u4ee5\u53ca\u6587\u4ef6\u7cfb\u7edf\uff08Project4\uff09\u3002\u6240\u6709\u7684Project\u90fd\u7ed9\u5b66\u751f\u7559\u6709\u5f88\u5927\u7684\u8bbe\u8ba1\u7a7a\u95f4\uff0c\u603b\u4ee3\u7801\u91cf\u57285000\u884c\u4ee5\u4e0a\u3002\u6839\u636eStanford\u5b66\u751f \u81ea\u5df1\u7684\u53cd\u9988 \uff0c\u57283-4\u4eba\u7ec4\u961f\u7684\u60c5\u51b5\u4e0b\uff0c\u540e\u4e24\u4e2aProject\u7684\u4eba\u5747\u8017\u65f6\u4e5f\u572840\u4e2a\u5c0f\u65f6\u4ee5\u4e0a\u3002 \u867d\u7136\u5176\u96be\u5ea6\u5f88\u5927\uff0c\u4f46Stanford\uff0cBerkeley\uff0cJHU\u7b49\u591a\u6240\u7f8e\u56fd\u9876\u5c16\u540d\u6821\u7684\u64cd\u7edf\u8bfe\u7a0b\u5747\u91c7\u7528\u4e86Pintos\u3002\u56e0\u4e3a\u5982\u679c\u4f60\u771f\u7684\u5bf9\u64cd\u4f5c\u7cfb\u7edf\u5f88\u611f\u5174\u8da3\uff0cPintos\u4f1a\u6781\u5927\u5730\u63d0\u9ad8\u4f60\u7f16\u5199\u548cdebug\u5e95\u5c42\u7cfb\u7edf\u4ee3\u7801\u7684\u80fd\u529b\u3002\u5728\u672c\u79d1\u9636\u6bb5\uff0c\u80fd\u81ea\u5df1\u8bbe\u8ba1\u3001\u5b9e\u73b0\u5e76debug\u4e00\u4e2a\u5927\u578b\u7cfb\u7edf\uff0c\u662f\u4e00\u6bb5\u975e\u5e38\u73cd\u8d35\u7684\u7ecf\u5386\u3002 \u5317\u59272022\u5e74\u6625\u5b63\u5b66\u671f\u7684\u64cd\u4f5c\u7cfb\u7edf\u5b9e\u9a8c\u73ed\u4e5f\u5c06\u4f1a\u9996\u6b21\u5f15\u5165Pintos\u4f5c\u4e3a\u8bfe\u7a0bproject\uff0c\u6211\u4f5c\u4e3a\u8fd9\u95e8\u8bfe\u7684TA\uff0c\u9876\u7740\u88ab\u53e3\u6c34\u6df9\u6ca1\u7684\u98ce\u9669\uff0c\u4f9d\u65e7\u5e0c\u671b\u80fd\u7528\u8fd9\u6837\u7684\u5c1d\u8bd5\uff0c\u8ba9\u66f4\u591a\u4eba\u7231\u4e0a\u7cfb\u7edf\u9886\u57df\uff0c\u4e3a\u56fd\u5185\u7684\u7cfb\u7edf\u7814\u7a76\u6dfb\u7816\u52a0\u74e6\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a Operating Systems: Principles and Practice (2nd Edition) \u8bfe\u7a0b\u4f5c\u4e1a \uff1a6\u4e2ahomework\uff0c3\u4e2aproject\uff0c\u5177\u4f53\u8981\u6c42\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8d44\u6e90\u6c47\u603b \u7531\u4e8e\u5317\u5927\u7684\u64cd\u7edf\u5b9e\u9a8c\u73ed\u91c7\u7528\u4e86\u8be5\u8bfe\u7a0b\u7684project\uff0c\u4e3a\u4e86\u9632\u6b62\u4ee3\u7801\u6284\u88ad\uff0c\u6211\u7684\u4ee3\u7801\u5b9e\u73b0\u6ca1\u6709\u5f00\u6e90\u3002","title":"UCB CS162: Operating System"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/CS162/#cs162-operating-system","text":"","title":"CS162: Operating System"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/CS162/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B, CS61C \u7f16\u7a0b\u8bed\u8a00\uff1a\bC\uff0cX86\u6c47\u7f16 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a200\u5c0f\u65f6+\uff0c\u4e0a\u4e0d\u5c01\u9876 \u8fd9\u95e8\u8bfe\u8ba9\u6211\u8bb0\u5fc6\u72b9\u65b0\u7684\u6709\u4e24\u4e2a\u90e8\u5206\uff1a \u9996\u5148\u662f\u6559\u6750\uff0c\u8fd9\u672c\u4e66\u7528\u7684\u6559\u6750 Operating Systems: Principles and Practice (2nd Edition) \u4e00\u5171\u56db\u5377\uff0c\u5199\u5f97 \u975e\u5e38\u6df1\u5165\u6d45\u51fa\uff0c\u5f88\u597d\u5730\u5f25\u8865\u4e86MIT6.S081\u5728\u7406\u8bba\u77e5\u8bc6\u4e0a\u4e9b\u8bb8\u7a7a\u767d\uff0c\u975e\u5e38\u5efa\u8bae\u5927\u5bb6\u9605\u8bfb\u3002\u76f8\u5173\u8d44\u6e90\u4f1a\u5206\u4eab\u5728\u672c\u4e66\u7684\u7ecf\u5178\u4e66\u7c4d\u63a8\u8350\u6a21\u5757\u3002 \u5176\u6b21\u662f\u8fd9\u95e8\u8bfe\u7684Project \u2014\u2014 Pintos\u3002Pintos\u662f\u7531Ben Pfaff\u7b49\u4eba\u57fa\u4e8eX86\u7f16\u5199\u7684\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edf\uff0cBen Pfaff\u751a\u81f3\u4e13\u95e8\u53d1\u4e86\u7bc7 paper \u6765\u9610\u8ff0Pintos\u7684\u8bbe\u8ba1\u601d\u60f3\u3002\u548cMIT\u7684xv6\u5c0f\u800c\u7cbe\u7684lab\u8bbe\u8ba1\u7406\u5ff5\u4e0d\u540c\uff0c Pintos\u66f4\u6ce8\u91cd\u7cfb\u7edf\u7684Design and Implementation\u3002Pintos\u672c\u8eab\u4ec5\u4e00\u4e07\u884c\u5de6\u53f3\uff0c\u53ea\u63d0\u4f9b\u4e86\u64cd\u4f5c\u7cfb\u7edf\u6700\u57fa\u672c\u7684\u529f\u80fd\u3002\u800c4\u4e2aProject\uff0c\u5c31\u662f\u8ba9\u4f60\u5728\u8fd9\u4e2a\u6781\u4e3a\u7cbe\u7b80\u7684\u64cd\u4f5c\u7cfb\u7edf\u4e4b\u4e0a\uff0c\u5206\u522b\u4e3a\u5176\u589e\u52a0\u7ebf\u7a0b\u8c03\u5ea6\u673a\u5236\uff08Project1\uff09\uff0c\u7cfb\u7edf\u8c03\u7528\uff08Project2\uff09\uff0c\u865a\u62df\u5185\u5b58\uff08Project3\uff09\u4ee5\u53ca\u6587\u4ef6\u7cfb\u7edf\uff08Project4\uff09\u3002\u6240\u6709\u7684Project\u90fd\u7ed9\u5b66\u751f\u7559\u6709\u5f88\u5927\u7684\u8bbe\u8ba1\u7a7a\u95f4\uff0c\u603b\u4ee3\u7801\u91cf\u57285000\u884c\u4ee5\u4e0a\u3002\u6839\u636eStanford\u5b66\u751f \u81ea\u5df1\u7684\u53cd\u9988 \uff0c\u57283-4\u4eba\u7ec4\u961f\u7684\u60c5\u51b5\u4e0b\uff0c\u540e\u4e24\u4e2aProject\u7684\u4eba\u5747\u8017\u65f6\u4e5f\u572840\u4e2a\u5c0f\u65f6\u4ee5\u4e0a\u3002 \u867d\u7136\u5176\u96be\u5ea6\u5f88\u5927\uff0c\u4f46Stanford\uff0cBerkeley\uff0cJHU\u7b49\u591a\u6240\u7f8e\u56fd\u9876\u5c16\u540d\u6821\u7684\u64cd\u7edf\u8bfe\u7a0b\u5747\u91c7\u7528\u4e86Pintos\u3002\u56e0\u4e3a\u5982\u679c\u4f60\u771f\u7684\u5bf9\u64cd\u4f5c\u7cfb\u7edf\u5f88\u611f\u5174\u8da3\uff0cPintos\u4f1a\u6781\u5927\u5730\u63d0\u9ad8\u4f60\u7f16\u5199\u548cdebug\u5e95\u5c42\u7cfb\u7edf\u4ee3\u7801\u7684\u80fd\u529b\u3002\u5728\u672c\u79d1\u9636\u6bb5\uff0c\u80fd\u81ea\u5df1\u8bbe\u8ba1\u3001\u5b9e\u73b0\u5e76debug\u4e00\u4e2a\u5927\u578b\u7cfb\u7edf\uff0c\u662f\u4e00\u6bb5\u975e\u5e38\u73cd\u8d35\u7684\u7ecf\u5386\u3002 \u5317\u59272022\u5e74\u6625\u5b63\u5b66\u671f\u7684\u64cd\u4f5c\u7cfb\u7edf\u5b9e\u9a8c\u73ed\u4e5f\u5c06\u4f1a\u9996\u6b21\u5f15\u5165Pintos\u4f5c\u4e3a\u8bfe\u7a0bproject\uff0c\u6211\u4f5c\u4e3a\u8fd9\u95e8\u8bfe\u7684TA\uff0c\u9876\u7740\u88ab\u53e3\u6c34\u6df9\u6ca1\u7684\u98ce\u9669\uff0c\u4f9d\u65e7\u5e0c\u671b\u80fd\u7528\u8fd9\u6837\u7684\u5c1d\u8bd5\uff0c\u8ba9\u66f4\u591a\u4eba\u7231\u4e0a\u7cfb\u7edf\u9886\u57df\uff0c\u4e3a\u56fd\u5185\u7684\u7cfb\u7edf\u7814\u7a76\u6dfb\u7816\u52a0\u74e6\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/CS162/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a Operating Systems: Principles and Practice (2nd Edition) \u8bfe\u7a0b\u4f5c\u4e1a \uff1a6\u4e2ahomework\uff0c3\u4e2aproject\uff0c\u5177\u4f53\u8981\u6c42\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/CS162/#_3","text":"\u7531\u4e8e\u5317\u5927\u7684\u64cd\u7edf\u5b9e\u9a8c\u73ed\u91c7\u7528\u4e86\u8be5\u8bfe\u7a0b\u7684project\uff0c\u4e3a\u4e86\u9632\u6b62\u4ee3\u7801\u6284\u88ad\uff0c\u6211\u7684\u4ee3\u7801\u5b9e\u73b0\u6ca1\u6709\u5f00\u6e90\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/MIT6.S081/","text":"MIT 6.S081: Operating System Engineering \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1a\u9ebb\u7701\u7406\u5de5\u5b66\u9662 \u5148\u4fee\u8981\u6c42\uff1a\u4f53\u7cfb\u7ed3\u6784 + \u624e\u5b9e\u7684C\u8bed\u8a00\u529f\u5e95 + RISC-V\u6c47\u7f16\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aC\uff0cRISC-V \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u9ebb\u7701\u7406\u5de5\u5b66\u9662\u5927\u540d\u9f0e\u9f0e\u7684PDOS\u5b9e\u9a8c\u5ba4\u5f00\u8bbe\u7684\u9762\u5411MIT\u672c\u79d1\u751f\u7684\u64cd\u4f5c\u7cfb\u7edf\u8bfe\u7a0b\u3002\u5f00\u8bbe\u8fd9\u95e8\u8bfe\u7684\u6559\u6388\u4e4b\u4e00 \u2014\u2014 Robert Morris\u6559\u6388\u66fe\u662f\u4e00\u4f4d\u9876\u5c16\u9ed1\u5ba2\uff0c\u4e16\u754c\u4e0a\u7b2c\u4e00\u4e2a\u8815\u866b\u75c5\u6bd2Morris\u5c31\u662f\u51fa\u81ea\u4ed6\u4e4b\u624b\u3002 \u8fd9\u95e8\u8bfe\u7684\u524d\u8eab\u662fMIT\u8457\u540d\u7684\u8bfe\u7a0b6.828\uff0cMIT\u7684\u51e0\u4f4d\u6559\u6388\u4e3a\u4e86\u8fd9\u95e8\u8bfe\u66fe\u4e13\u95e8\u5f00\u53d1\u4e86\u4e00\u4e2a\u57fa\u4e8eX86\u7684\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edfJOS\uff0c\u88ab\u4f17\u591a\u540d\u6821\u4f5c\u4e3a\u81ea\u5df1\u7684\u64cd\u7edf\u8bfe\u7a0b\u5b9e\u9a8c\u3002\u4f46\u968f\u7740RISC-V\u7684\u6a2a\u7a7a\u51fa\u4e16\uff0c\u8fd9\u51e0\u4f4d\u6559\u6388\u53c8\u57fa\u4e8eRISC-V\u5f00\u53d1\u4e86\u4e00\u4e2a\u65b0\u7684\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edfxv6\uff0c\u5e76\u5f00\u8bbe\u4e86MIT6.S081\u8fd9\u95e8\u8bfe\u3002\u7531\u4e8eRISC-V\u8f7b\u4fbf\u6613\u5b66\u7684\u7279\u70b9\uff0c\u5b66\u751f\u4e0d\u9700\u8981\u50cf\u6b64\u524dJOS\u4e00\u6837\u7ea0\u7ed3\u4e8e\u4f17\u591aX86\u201c\u7279\u6709\u7684\u201d\u4e3a\u4e86\u517c\u5bb9\u800c\u9057\u7559\u4e0b\u6765\u7684\u590d\u6742\u673a\u5236\uff0c\u800c \u53ef\u4ee5\u4e13\u6ce8\u4e8e\u64cd\u4f5c\u7cfb\u7edf\u5c42\u9762\u7684\u5f00\u53d1\u3002 \u8fd9\u51e0\u4f4d\u6559\u6388\u8fd8\u4e13\u95e8\u5199\u4e86\u4e00\u672c \u6559\u7a0b \uff0c\u8be6\u7ec6\u8bb2\u89e3\u4e86xv6\u7684\u8bbe\u8ba1\u601d\u60f3\u548c\u5b9e\u73b0\u7ec6\u8282\u3002 \u8fd9\u95e8\u8bfe\u7684\u8bb2\u6388\u4e5f\u5f88\u6709\u610f\u601d\uff0c\u8001\u5e08\u4f1a\u5e26\u7740\u5b66\u751f\u4f9d\u7167xv6\u7684\u6e90\u4ee3\u7801\u53bb\u7406\u89e3\u64cd\u4f5c\u7cfb\u7edf\u7684\u4f17\u591a\u673a\u5236\u548c\u8bbe\u8ba1\u7ec6\u8282\uff0c\u800c\u4e0d\u662f\u505c\u7559\u4e8e\u7406\u8bba\u77e5\u8bc6\u3002\u6bcf\u5468\u90fd\u4f1a\u6709\u4e00\u4e2alab\uff0c\u8ba9\u4f60\u5728xv6\u4e0a\u589e\u52a0\u4e00\u4e9b\u65b0\u7684\u673a\u5236\u548c\u7279\u6027\uff0c\u975e\u5e38\u6ce8\u91cd\u5b66\u751f\u52a8\u624b\u80fd\u529b\u7684\u57f9\u517b\u3002\u6574\u4e2a\u5b66\u671f\u4e00\u5171\u670911\u4e2alab\uff0c\u8ba9\u4f60\u5168\u65b9\u4f4d\u5730\u6df1\u523b\u7406\u89e3\u64cd\u4f5c\u7cfb\u7edf\u7684\u6bcf\u4e2a\u90e8\u5206\uff0c\u975e\u5e38\u6709\u6210\u5c31\u611f\u3002\u800c\u4e14\u6240\u6709\u7684lab\u90fd\u6709\u7740\u975e\u5e38\u5b8c\u5584\u7684\u6d4b\u8bd5\u6846\u67b6\uff0c\u6709\u7684\u6d4b\u8bd5\u4ee3\u7801\u751a\u81f3\u4e0a\u5343\u884c\uff0c\u8ba9\u4eba\u4e0d\u5f97\u4e0d\u4f69\u670dMIT\u7684\u51e0\u4f4d\u6559\u6388\u4e3a\u4e86\u6559\u597d\u8fd9\u95e8\u8bfe\u6240\u4ed8\u51fa\u7684\u5fc3\u8840\u3002 \u8fd9\u95e8\u8bfe\u7684\u540e\u534a\u7a0b\u4f1a\u8bb2\u6388\u64cd\u4f5c\u7cfb\u7edf\u9886\u57df\u7684\u591a\u7bc7\u7ecf\u5178\u8bba\u6587\uff0c\u6d89\u53ca\u6587\u4ef6\u7cfb\u7edf\u3001\u7cfb\u7edf\u5b89\u5168\u3001\u7f51\u7edc\u3001\u865a\u62df\u5316\u7b49\u7b49\u591a\u4e2a\u4e3b\u9898\uff0c\u8ba9\u4f60\u6709\u673a\u4f1a\u63a5\u89e6\u5230\u5b66\u754c \u6700\u524d\u6cbf\u7684\u7814\u7a76\u65b9\u5411\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a11\u4e2alab\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"MIT 6.S081: Operating System Engineering"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/MIT6.S081/#mit-6s081-operating-system-engineering","text":"","title":"MIT 6.S081: Operating System Engineering"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/MIT6.S081/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1a\u9ebb\u7701\u7406\u5de5\u5b66\u9662 \u5148\u4fee\u8981\u6c42\uff1a\u4f53\u7cfb\u7ed3\u6784 + \u624e\u5b9e\u7684C\u8bed\u8a00\u529f\u5e95 + RISC-V\u6c47\u7f16\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aC\uff0cRISC-V \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u9ebb\u7701\u7406\u5de5\u5b66\u9662\u5927\u540d\u9f0e\u9f0e\u7684PDOS\u5b9e\u9a8c\u5ba4\u5f00\u8bbe\u7684\u9762\u5411MIT\u672c\u79d1\u751f\u7684\u64cd\u4f5c\u7cfb\u7edf\u8bfe\u7a0b\u3002\u5f00\u8bbe\u8fd9\u95e8\u8bfe\u7684\u6559\u6388\u4e4b\u4e00 \u2014\u2014 Robert Morris\u6559\u6388\u66fe\u662f\u4e00\u4f4d\u9876\u5c16\u9ed1\u5ba2\uff0c\u4e16\u754c\u4e0a\u7b2c\u4e00\u4e2a\u8815\u866b\u75c5\u6bd2Morris\u5c31\u662f\u51fa\u81ea\u4ed6\u4e4b\u624b\u3002 \u8fd9\u95e8\u8bfe\u7684\u524d\u8eab\u662fMIT\u8457\u540d\u7684\u8bfe\u7a0b6.828\uff0cMIT\u7684\u51e0\u4f4d\u6559\u6388\u4e3a\u4e86\u8fd9\u95e8\u8bfe\u66fe\u4e13\u95e8\u5f00\u53d1\u4e86\u4e00\u4e2a\u57fa\u4e8eX86\u7684\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edfJOS\uff0c\u88ab\u4f17\u591a\u540d\u6821\u4f5c\u4e3a\u81ea\u5df1\u7684\u64cd\u7edf\u8bfe\u7a0b\u5b9e\u9a8c\u3002\u4f46\u968f\u7740RISC-V\u7684\u6a2a\u7a7a\u51fa\u4e16\uff0c\u8fd9\u51e0\u4f4d\u6559\u6388\u53c8\u57fa\u4e8eRISC-V\u5f00\u53d1\u4e86\u4e00\u4e2a\u65b0\u7684\u6559\u5b66\u7528\u64cd\u4f5c\u7cfb\u7edfxv6\uff0c\u5e76\u5f00\u8bbe\u4e86MIT6.S081\u8fd9\u95e8\u8bfe\u3002\u7531\u4e8eRISC-V\u8f7b\u4fbf\u6613\u5b66\u7684\u7279\u70b9\uff0c\u5b66\u751f\u4e0d\u9700\u8981\u50cf\u6b64\u524dJOS\u4e00\u6837\u7ea0\u7ed3\u4e8e\u4f17\u591aX86\u201c\u7279\u6709\u7684\u201d\u4e3a\u4e86\u517c\u5bb9\u800c\u9057\u7559\u4e0b\u6765\u7684\u590d\u6742\u673a\u5236\uff0c\u800c \u53ef\u4ee5\u4e13\u6ce8\u4e8e\u64cd\u4f5c\u7cfb\u7edf\u5c42\u9762\u7684\u5f00\u53d1\u3002 \u8fd9\u51e0\u4f4d\u6559\u6388\u8fd8\u4e13\u95e8\u5199\u4e86\u4e00\u672c \u6559\u7a0b \uff0c\u8be6\u7ec6\u8bb2\u89e3\u4e86xv6\u7684\u8bbe\u8ba1\u601d\u60f3\u548c\u5b9e\u73b0\u7ec6\u8282\u3002 \u8fd9\u95e8\u8bfe\u7684\u8bb2\u6388\u4e5f\u5f88\u6709\u610f\u601d\uff0c\u8001\u5e08\u4f1a\u5e26\u7740\u5b66\u751f\u4f9d\u7167xv6\u7684\u6e90\u4ee3\u7801\u53bb\u7406\u89e3\u64cd\u4f5c\u7cfb\u7edf\u7684\u4f17\u591a\u673a\u5236\u548c\u8bbe\u8ba1\u7ec6\u8282\uff0c\u800c\u4e0d\u662f\u505c\u7559\u4e8e\u7406\u8bba\u77e5\u8bc6\u3002\u6bcf\u5468\u90fd\u4f1a\u6709\u4e00\u4e2alab\uff0c\u8ba9\u4f60\u5728xv6\u4e0a\u589e\u52a0\u4e00\u4e9b\u65b0\u7684\u673a\u5236\u548c\u7279\u6027\uff0c\u975e\u5e38\u6ce8\u91cd\u5b66\u751f\u52a8\u624b\u80fd\u529b\u7684\u57f9\u517b\u3002\u6574\u4e2a\u5b66\u671f\u4e00\u5171\u670911\u4e2alab\uff0c\u8ba9\u4f60\u5168\u65b9\u4f4d\u5730\u6df1\u523b\u7406\u89e3\u64cd\u4f5c\u7cfb\u7edf\u7684\u6bcf\u4e2a\u90e8\u5206\uff0c\u975e\u5e38\u6709\u6210\u5c31\u611f\u3002\u800c\u4e14\u6240\u6709\u7684lab\u90fd\u6709\u7740\u975e\u5e38\u5b8c\u5584\u7684\u6d4b\u8bd5\u6846\u67b6\uff0c\u6709\u7684\u6d4b\u8bd5\u4ee3\u7801\u751a\u81f3\u4e0a\u5343\u884c\uff0c\u8ba9\u4eba\u4e0d\u5f97\u4e0d\u4f69\u670dMIT\u7684\u51e0\u4f4d\u6559\u6388\u4e3a\u4e86\u6559\u597d\u8fd9\u95e8\u8bfe\u6240\u4ed8\u51fa\u7684\u5fc3\u8840\u3002 \u8fd9\u95e8\u8bfe\u7684\u540e\u534a\u7a0b\u4f1a\u8bb2\u6388\u64cd\u4f5c\u7cfb\u7edf\u9886\u57df\u7684\u591a\u7bc7\u7ecf\u5178\u8bba\u6587\uff0c\u6d89\u53ca\u6587\u4ef6\u7cfb\u7edf\u3001\u7cfb\u7edf\u5b89\u5168\u3001\u7f51\u7edc\u3001\u865a\u62df\u5316\u7b49\u7b49\u591a\u4e2a\u4e3b\u9898\uff0c\u8ba9\u4f60\u6709\u673a\u4f1a\u63a5\u89e6\u5230\u5b66\u754c \u6700\u524d\u6cbf\u7684\u7814\u7a76\u65b9\u5411\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/MIT6.S081/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a11\u4e2alab\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%93%8D%E4%BD%9C%E7%B3%BB%E7%BB%9F/MIT6.S081/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITLA/","text":"MIT18.06: Linear Algebra \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u82f1\u6587 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a\u56e0\u4eba\u800c\u5f02 \u6570\u5b66\u5927\u725b Gilbert Strang \u8001\u5148\u751f\u5e74\u903e\u53e4\u7a00\u4ecd\u575a\u6301\u6388\u8bfe\uff0c\u5176\u7ecf\u5178\u6559\u6750 Introduction to Linear Algebra \u5df2\u88ab\u6e05\u534e\u91c7\u7528\u4e3a\u5b98\u65b9\u6559\u6750\u3002\u6211\u5f53\u65f6\u770b\u5b8c\u76d7\u7248PDF\u4e4b\u540e\u6df1\u611f\u6127\u759a\uff0c\u542b\u6cea\u82b1\u4e86\u4e24\u767e\u591a\u4e70\u4e86\u4e00\u672c\u82f1\u6587\u6b63\u7248\u6536\u85cf\u3002\u4e0b\u9762\u9644\u4e0a\u6b64\u4e66\u5c01\u9762\uff0c\u5982\u679c\u4f60\u80fd\u5b8c\u5168\u7406\u89e3\u5c01\u9762\u56fe\u7684\u6570\u5b66\u542b\u4e49\uff0c\u90a3\u4f60\u5bf9\u7ebf\u6027\u4ee3\u6570\u7684\u7406\u89e3\u4e00\u5b9a\u4f1a\u8fbe\u5230\u65b0\u7684\u9ad8\u5ea6\u3002 \u914d\u5408\u6cb9\u7ba1\u6570\u5b66\u7f51\u7ea2 3Blue1Brown \u7684 \u7ebf\u6027\u4ee3\u6570\u7684\u672c\u8d28 \u7cfb\u5217\u89c6\u9891\u98df\u7528\u66f4\u4f73\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1aIntroduction to Linear Algebra. Gilbert Strang \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"MIT18.06: Linear Algebra"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITLA/#mit1806-linear-algebra","text":"","title":"MIT18.06: Linear Algebra"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITLA/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u82f1\u6587 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a\u56e0\u4eba\u800c\u5f02 \u6570\u5b66\u5927\u725b Gilbert Strang \u8001\u5148\u751f\u5e74\u903e\u53e4\u7a00\u4ecd\u575a\u6301\u6388\u8bfe\uff0c\u5176\u7ecf\u5178\u6559\u6750 Introduction to Linear Algebra \u5df2\u88ab\u6e05\u534e\u91c7\u7528\u4e3a\u5b98\u65b9\u6559\u6750\u3002\u6211\u5f53\u65f6\u770b\u5b8c\u76d7\u7248PDF\u4e4b\u540e\u6df1\u611f\u6127\u759a\uff0c\u542b\u6cea\u82b1\u4e86\u4e24\u767e\u591a\u4e70\u4e86\u4e00\u672c\u82f1\u6587\u6b63\u7248\u6536\u85cf\u3002\u4e0b\u9762\u9644\u4e0a\u6b64\u4e66\u5c01\u9762\uff0c\u5982\u679c\u4f60\u80fd\u5b8c\u5168\u7406\u89e3\u5c01\u9762\u56fe\u7684\u6570\u5b66\u542b\u4e49\uff0c\u90a3\u4f60\u5bf9\u7ebf\u6027\u4ee3\u6570\u7684\u7406\u89e3\u4e00\u5b9a\u4f1a\u8fbe\u5230\u65b0\u7684\u9ad8\u5ea6\u3002 \u914d\u5408\u6cb9\u7ba1\u6570\u5b66\u7f51\u7ea2 3Blue1Brown \u7684 \u7ebf\u6027\u4ee3\u6570\u7684\u672c\u8d28 \u7cfb\u5217\u89c6\u9891\u98df\u7528\u66f4\u4f73\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITLA/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1aIntroduction to Linear Algebra. Gilbert Strang \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITmaths/","text":"MIT Calculus Course \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u82f1\u8bed \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a\u56e0\u4eba\u800c\u5f02 MIT\u7684\u5fae\u79ef\u5206\u8bfe\u7531 MIT18.01: Single variable calculus \u548c MIT18.02: Multi variable calculus \u4e24\u95e8\u8bfe\u7ec4\u6210\u3002\u5bf9\u81ea\u5df1\u6570\u5b66\u57fa\u7840\u6bd4\u8f83\u81ea\u4fe1\u7684\u540c\u5b66\u53ef\u4ee5\u53ea\u770b\u8bfe\u7a0bnotes\uff0c\u5199\u5f97\u975e\u5e38\u6d45\u663e\u751f\u52a8\u5e76\u4e14\u6293\u4f4f\u672c\u8d28\uff0c\u8ba9\u4f60\u4e0d\u518d\u75b2\u4e8e\u505a\u9898\u800c\u662f\u80fd\u591f\u771f\u6b63\u7aa5\u89c1\u5fae\u79ef\u5206\u7684\u672c\u8d28\u9b45\u529b\u3002 \u914d\u5408\u6cb9\u7ba1\u6570\u5b66\u7f51\u7ea2 3Blue1Brown \u7684 \u5fae\u79ef\u5206\u7684\u672c\u8d28 \u7cfb\u5217\u89c6\u9891\u98df\u7528\u66f4\u4f73\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a 18.01 \uff0c 18.02 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u4e66\u9762\u4f5c\u4e1a\u53ca\u7b54\u6848\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"MIT18.01/18.02: Calculus"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITmaths/#mit-calculus-course","text":"","title":"MIT Calculus Course"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITmaths/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u82f1\u8bed \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a\u56e0\u4eba\u800c\u5f02 MIT\u7684\u5fae\u79ef\u5206\u8bfe\u7531 MIT18.01: Single variable calculus \u548c MIT18.02: Multi variable calculus \u4e24\u95e8\u8bfe\u7ec4\u6210\u3002\u5bf9\u81ea\u5df1\u6570\u5b66\u57fa\u7840\u6bd4\u8f83\u81ea\u4fe1\u7684\u540c\u5b66\u53ef\u4ee5\u53ea\u770b\u8bfe\u7a0bnotes\uff0c\u5199\u5f97\u975e\u5e38\u6d45\u663e\u751f\u52a8\u5e76\u4e14\u6293\u4f4f\u672c\u8d28\uff0c\u8ba9\u4f60\u4e0d\u518d\u75b2\u4e8e\u505a\u9898\u800c\u662f\u80fd\u591f\u771f\u6b63\u7aa5\u89c1\u5fae\u79ef\u5206\u7684\u672c\u8d28\u9b45\u529b\u3002 \u914d\u5408\u6cb9\u7ba1\u6570\u5b66\u7f51\u7ea2 3Blue1Brown \u7684 \u5fae\u79ef\u5206\u7684\u672c\u8d28 \u7cfb\u5217\u89c6\u9891\u98df\u7528\u66f4\u4f73\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/MITmaths/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a 18.01 \uff0c 18.02 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u4e66\u9762\u4f5c\u4e1a\u53ca\u7b54\u6848\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/information/","text":"MIT6.050J: Information theory and Entropy \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 MIT\u9762\u5411\u5927\u4e00\u65b0\u751f\u7684\u4fe1\u606f\u8bba\u5165\u95e8\u8bfe\u7a0b\uff0cPenfield\u6559\u6388\u4e13\u95e8\u4e3a\u8fd9\u95e8\u8bfe\u5199\u4e86\u4e00\u672c \u6559\u6750 \u4f5c\u4e3a\u8bfe\u7a0bnotes\uff0c\u5185\u5bb9\u6df1\u5165\u6d45\u51fa\uff0c\u751f\u52a8\u6709\u8da3\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9\uff0c\u5305\u542b\u4e66\u9762\u4f5c\u4e1a\u4e0ematlab\u7f16\u7a0b\u4f5c\u4e1a\u3002","title":"MIT6.050J: Information theory and Entropy"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/information/#mit6050j-information-theory-and-entropy","text":"","title":"MIT6.050J: Information theory and Entropy"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/information/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 MIT\u9762\u5411\u5927\u4e00\u65b0\u751f\u7684\u4fe1\u606f\u8bba\u5165\u95e8\u8bfe\u7a0b\uff0cPenfield\u6559\u6388\u4e13\u95e8\u4e3a\u8fd9\u95e8\u8bfe\u5199\u4e86\u4e00\u672c \u6559\u6750 \u4f5c\u4e3a\u8bfe\u7a0bnotes\uff0c\u5185\u5bb9\u6df1\u5165\u6d45\u51fa\uff0c\u751f\u52a8\u6709\u8da3\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E5%9F%BA%E7%A1%80/information/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9\uff0c\u5305\u542b\u4e66\u9762\u4f5c\u4e1a\u4e0ematlab\u7f16\u7a0b\u4f5c\u4e1a\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/6.042J/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1aCalculus, Linear Algebra \u7f16\u7a0b\u8bed\u8a00\uff1aPython preferred \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50-70 \u5c0f\u65f6 MIT \u7684\u79bb\u6563\u6570\u5b66\u4ee5\u53ca\u6982\u7387\u7efc\u5408\u8bfe\u7a0b\uff0c\u5bfc\u5e08\u662f\u5927\u540d\u9f0e\u9f0e\u7684 Tom Leighton ( Akamai \u7684\u8054\u5408\u521b\u59cb\u4eba\u4e4b\u4e00)\u3002\u5b66\u5b8c\u4e4b\u540e\u5bf9\u4e8e\u540e\u7eed\u7684\u7b97\u6cd5\u5b66\u4e60\u5927\u6709\u88e8\u76ca\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u4f5c\u4e1a","title":"MIT 6.042J: Mathematics for Computer Science"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/6.042J/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1aCalculus, Linear Algebra \u7f16\u7a0b\u8bed\u8a00\uff1aPython preferred \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50-70 \u5c0f\u65f6 MIT \u7684\u79bb\u6563\u6570\u5b66\u4ee5\u53ca\u6982\u7387\u7efc\u5408\u8bfe\u7a0b\uff0c\u5bfc\u5e08\u662f\u5927\u540d\u9f0e\u9f0e\u7684 Tom Leighton ( Akamai \u7684\u8054\u5408\u521b\u59cb\u4eba\u4e4b\u4e00)\u3002\u5b66\u5b8c\u4e4b\u540e\u5bf9\u4e8e\u540e\u7eed\u7684\u7b97\u6cd5\u5b66\u4e60\u5927\u6709\u88e8\u76ca\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/6.042J/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS126/","text":"UCB CS126 : Probability theory \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS70\u3001\u5fae\u79ef\u5206\u3001\u7ebf\u6027\u4ee3\u6570 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u6982\u7387\u8bba\u8fdb\u9636\u8bfe\u7a0b\uff0c\u6d89\u53ca\u5230\u7edf\u8ba1\u5b66\u3001\u968f\u673a\u8fc7\u7a0b\u7b49\u7406\u8bba\u76f8\u5bf9\u6df1\u5165\u7684\u5185\u5bb9\uff0c\u9700\u8981\u76f8\u5f53\u7684\u6570\u5b66\u57fa\u7840\uff0c\u6211\u5728\u4e0a\u8fd9\u95e8\u8bfe\u7684\u65f6\u5019\u4e5f\u611f\u5230\u6709\u4e9b\u5403\u529b\uff0c\u4e0d\u8fc7\u575a\u6301\u4e0b\u6765\u4e00\u5b9a\u4f1a\u8ba9\u4f60\u5bf9\u6982\u7387\u8bba\u7684\u638c\u63e1\u8fbe\u5230\u4e00\u4e2a\u65b0\u7684\u9ad8\u5ea6\u3002 \u540c\u65f6\u8fd9\u95e8\u8bfe\u975e\u5e38\u5f3a\u8c03\u7406\u8bba\u4e0e\u5b9e\u8df5\u7684\u7ed3\u5408\uff0c\u8bfe\u7a0b\u8bbe\u8ba1\u8005Jean Walrand\u6559\u6388\u4e13\u95e8\u5199\u4e86\u4e00\u672c\u914d\u5957\u7684\u6559\u6750 Probability in Electrical Engineering and Computer Science \uff0c\u4e66\u4e2d\u6bcf\u4e2a\u7ae0\u8282\u90fd\u4f1a\u4ee5\u4e00\u4e2a\u5177\u4f53\u7684\u7b97\u6cd5\u5b9e\u8df5\u4f5c\u4e3a\u4f8b\u5b50\u6765\u5c55\u793a\u7406\u8bba\u5728\u5b9e\u9645\u5f53\u4e2d\u7684\u8fd0\u7528\uff0c\u4f8b\u5982PageRank\uff0cRoute Planing\uff0cSpeech Recognition\u7b49\u7b49\uff0c\u5e76\u4e14\u5168\u4e66\u5f00\u6e90\uff0c\u53ef\u4ee5\u514d\u8d39\u4e0b\u8f7dPDF\u6216\u8005Epub\u7248\u3002 \u8fd9\u8fd8\u4e0d\u7b97\u5b8c\uff0cJean Walrand\u8fd8\u4e3a\u6574\u672c\u4e66\u91cc\u7684\u4f8b\u5b50\u8bbe\u8ba1\u4e86\u914d\u5957\u7684Python\u5b9e\u73b0\uff0c\u4ee5 Jupyter Notebook \u7684\u5f62\u5f0f\u5728\u7ebf\u53d1\u5e03\uff0c\u8bfb\u8005\u53ef\u4ee5\u5728\u7ebf\u4fee\u6539\u3001\u8c03\u8bd5\u548c\u8fd0\u884c\u3002 \u4e0e\u6b64\u540c\u65f6\uff0c\u8fd9\u95e8\u8bfe\u9664\u4e86\u7406\u8bba\u4f5c\u4e1a\u4e4b\u5916\uff0c\u8fd8\u67099\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u4f1a\u8ba9\u4f60\u7528\u6982\u7387\u8bba\u7684\u77e5\u8bc6\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a PDF , Epub , Jupyter Notebook \u8bfe\u7a0b\u4f5c\u4e1a\uff1a14\u4e2a\u4e66\u9762\u4f5c\u4e1a + 9\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u5177\u4f53\u8981\u6c42\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS126: probability theory"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS126/#ucb-cs126-probability-theory","text":"","title":"UCB CS126 : Probability theory"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS126/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS70\u3001\u5fae\u79ef\u5206\u3001\u7ebf\u6027\u4ee3\u6570 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u6982\u7387\u8bba\u8fdb\u9636\u8bfe\u7a0b\uff0c\u6d89\u53ca\u5230\u7edf\u8ba1\u5b66\u3001\u968f\u673a\u8fc7\u7a0b\u7b49\u7406\u8bba\u76f8\u5bf9\u6df1\u5165\u7684\u5185\u5bb9\uff0c\u9700\u8981\u76f8\u5f53\u7684\u6570\u5b66\u57fa\u7840\uff0c\u6211\u5728\u4e0a\u8fd9\u95e8\u8bfe\u7684\u65f6\u5019\u4e5f\u611f\u5230\u6709\u4e9b\u5403\u529b\uff0c\u4e0d\u8fc7\u575a\u6301\u4e0b\u6765\u4e00\u5b9a\u4f1a\u8ba9\u4f60\u5bf9\u6982\u7387\u8bba\u7684\u638c\u63e1\u8fbe\u5230\u4e00\u4e2a\u65b0\u7684\u9ad8\u5ea6\u3002 \u540c\u65f6\u8fd9\u95e8\u8bfe\u975e\u5e38\u5f3a\u8c03\u7406\u8bba\u4e0e\u5b9e\u8df5\u7684\u7ed3\u5408\uff0c\u8bfe\u7a0b\u8bbe\u8ba1\u8005Jean Walrand\u6559\u6388\u4e13\u95e8\u5199\u4e86\u4e00\u672c\u914d\u5957\u7684\u6559\u6750 Probability in Electrical Engineering and Computer Science \uff0c\u4e66\u4e2d\u6bcf\u4e2a\u7ae0\u8282\u90fd\u4f1a\u4ee5\u4e00\u4e2a\u5177\u4f53\u7684\u7b97\u6cd5\u5b9e\u8df5\u4f5c\u4e3a\u4f8b\u5b50\u6765\u5c55\u793a\u7406\u8bba\u5728\u5b9e\u9645\u5f53\u4e2d\u7684\u8fd0\u7528\uff0c\u4f8b\u5982PageRank\uff0cRoute Planing\uff0cSpeech Recognition\u7b49\u7b49\uff0c\u5e76\u4e14\u5168\u4e66\u5f00\u6e90\uff0c\u53ef\u4ee5\u514d\u8d39\u4e0b\u8f7dPDF\u6216\u8005Epub\u7248\u3002 \u8fd9\u8fd8\u4e0d\u7b97\u5b8c\uff0cJean Walrand\u8fd8\u4e3a\u6574\u672c\u4e66\u91cc\u7684\u4f8b\u5b50\u8bbe\u8ba1\u4e86\u914d\u5957\u7684Python\u5b9e\u73b0\uff0c\u4ee5 Jupyter Notebook \u7684\u5f62\u5f0f\u5728\u7ebf\u53d1\u5e03\uff0c\u8bfb\u8005\u53ef\u4ee5\u5728\u7ebf\u4fee\u6539\u3001\u8c03\u8bd5\u548c\u8fd0\u884c\u3002 \u4e0e\u6b64\u540c\u65f6\uff0c\u8fd9\u95e8\u8bfe\u9664\u4e86\u7406\u8bba\u4f5c\u4e1a\u4e4b\u5916\uff0c\u8fd8\u67099\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u4f1a\u8ba9\u4f60\u7528\u6982\u7387\u8bba\u7684\u77e5\u8bc6\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS126/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a PDF , Epub , Jupyter Notebook \u8bfe\u7a0b\u4f5c\u4e1a\uff1a14\u4e2a\u4e66\u9762\u4f5c\u4e1a + 9\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u5177\u4f53\u8981\u6c42\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS126/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS70/","text":"UCB CS70 : discrete Math and probability theory \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u79bb\u6563\u6570\u5b66\u5165\u95e8\u8bfe\u7a0b\uff0c\u4e2a\u4eba\u89c9\u5f97\u8fd9\u95e8\u8bfe\u6700\u5927\u7684\u4eae\u70b9\u5728\u4e8e\u5e76\u4e0d\u662f\u5355\u7eaf\u7684\u7406\u8bba\u77e5\u8bc6\u7684\u8bb2\u6388\uff0c\u800c\u662f\u5728\u6bcf\u4e2a\u6a21\u5757\u90fd\u4f1a\u4ecb\u7ecd\u7406\u8bba\u77e5\u8bc6\u5728\u5b9e\u9645\u7b97\u6cd5\u4e2d\u7684\u8fd0\u7528\uff0c\u8ba9\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\u5728\u592f\u5b9e\u7406\u8bba\u57fa\u7840\u7684\u540c\u65f6\uff0c\u8df3\u8131\u51fa\u51b0\u51b7\u5f62\u5f0f\u5316\u7684\u6570\u5b66\u7b26\u53f7\uff0c\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\u611f\u53d7\u548c\u4f53\u4f1a\u7406\u8bba\u7684\u672c\u8d28\u3002 \u5177\u4f53\u7684\u7406\u8bba\u4e0e\u7b97\u6cd5\u7684\u5bf9\u5e94\u5173\u7cfb\u5217\u4e3e\u5982\u4e0b\uff1a \u903b\u8f91\u8bc1\u660e\uff1a\u7a33\u5b9a\u5339\u914d\u7b97\u6cd5 \u56fe\u8bba\uff1a\u7f51\u7edc\u62d3\u6251\u8bbe\u8ba1 \u57fa\u7840\u6570\u8bba\uff1aRSA\u7b97\u6cd5 \u591a\u9879\u5f0f\u73af\uff1a\u7ea0\u9519\u7801\u8bbe\u8ba1 \u6982\u7387\u8bba\uff1a\u54c8\u5e0c\u8868\u8bbe\u8ba1\u3001\u8d1f\u8f7d\u5747\u8861\u7b49\u7b49 \u8bfe\u7a0bnotes\u4e5f\u5199\u5f97\u975e\u5e38\u6df1\u5165\u6d45\u51fa\uff0c\u516c\u5f0f\u63a8\u5bfc\u4e0e\u5b9e\u9645\u4f8b\u5b50\u661f\u7f57\u68cb\u5e03\uff0c\u9605\u8bfb\u4f53\u9a8c\u5f88\u597d\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0bschedule \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS70: discrete Math and probability theory"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS70/#ucb-cs70-discrete-math-and-probability-theory","text":"","title":"UCB CS70 : discrete Math and probability theory"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS70/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u79bb\u6563\u6570\u5b66\u5165\u95e8\u8bfe\u7a0b\uff0c\u4e2a\u4eba\u89c9\u5f97\u8fd9\u95e8\u8bfe\u6700\u5927\u7684\u4eae\u70b9\u5728\u4e8e\u5e76\u4e0d\u662f\u5355\u7eaf\u7684\u7406\u8bba\u77e5\u8bc6\u7684\u8bb2\u6388\uff0c\u800c\u662f\u5728\u6bcf\u4e2a\u6a21\u5757\u90fd\u4f1a\u4ecb\u7ecd\u7406\u8bba\u77e5\u8bc6\u5728\u5b9e\u9645\u7b97\u6cd5\u4e2d\u7684\u8fd0\u7528\uff0c\u8ba9\u8ba1\u7b97\u673a\u7cfb\u7684\u5b66\u751f\u5728\u592f\u5b9e\u7406\u8bba\u57fa\u7840\u7684\u540c\u65f6\uff0c\u8df3\u8131\u51fa\u51b0\u51b7\u5f62\u5f0f\u5316\u7684\u6570\u5b66\u7b26\u53f7\uff0c\u5728\u5b9e\u9645\u5e94\u7528\u4e2d\u611f\u53d7\u548c\u4f53\u4f1a\u7406\u8bba\u7684\u672c\u8d28\u3002 \u5177\u4f53\u7684\u7406\u8bba\u4e0e\u7b97\u6cd5\u7684\u5bf9\u5e94\u5173\u7cfb\u5217\u4e3e\u5982\u4e0b\uff1a \u903b\u8f91\u8bc1\u660e\uff1a\u7a33\u5b9a\u5339\u914d\u7b97\u6cd5 \u56fe\u8bba\uff1a\u7f51\u7edc\u62d3\u6251\u8bbe\u8ba1 \u57fa\u7840\u6570\u8bba\uff1aRSA\u7b97\u6cd5 \u591a\u9879\u5f0f\u73af\uff1a\u7ea0\u9519\u7801\u8bbe\u8ba1 \u6982\u7387\u8bba\uff1a\u54c8\u5e0c\u8868\u8bbe\u8ba1\u3001\u8d1f\u8f7d\u5747\u8861\u7b49\u7b49 \u8bfe\u7a0bnotes\u4e5f\u5199\u5f97\u975e\u5e38\u6df1\u5165\u6d45\u51fa\uff0c\u516c\u5f0f\u63a8\u5bfc\u4e0e\u5b9e\u9645\u4f8b\u5b50\u661f\u7f57\u68cb\u5e03\uff0c\u9605\u8bfb\u4f53\u9a8c\u5f88\u597d\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS70/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0bschedule","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/CS70/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/The%20Information%20Theory%2C%20Pattern%20Recognition%2C%20and%20Neural%20Networks/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aCambridge \u5148\u4fee\u8981\u6c42\uff1aCalculus, Linear Algebra, Probabilities and Statistics \u7f16\u7a0b\u8bed\u8a00\uff1aAnything would be OK, Python preferred \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a30-50 \u5c0f\u65f6 \u5251\u6865\u5927\u5b66 Sir David MacKay \u6559\u6388\u7684\u4fe1\u606f\u8bba\u8bfe\u7a0b\u3002\u6559\u6388\u662f\u4e00\u4f4d\u5341\u5206\u7cbe\u901a\u4fe1\u606f\u8bba\u4e0e\u795e\u7ecf\u7f51\u7edc\u7684\u5b66\u8005\uff0c\u8bfe\u7a0b\u5bf9\u5e94\u6559\u6750\u4e5f\u662f\u4fe1\u606f\u8bba\u9886\u57df\u7684\u4e00\u90e8\u7ecf\u5178\u8457\u4f5c\u3002\u53ef\u60dc\u5929\u5992\u82f1\u624d... \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aInformation Theory, Inference, and Learning Algorithms \u5728\u8bfe\u7a0b\u7f51\u7ad9\u53ef\u4ee5\u4e0b\u8f7d\u5230\u514d\u8d39\u7684\u7535\u5b50\u7248 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u5728\u6bcf\u4e00\u8282\u8bfe\u89c6\u9891\u7684\u6700\u540e\u4f1a\u7559\u6559\u6750\u4e0a\u7684\u8bfe\u540e\u4e60\u9898 R.I.P Prof. David MacKay","title":"The Information Theory, Patter Recognition, and Neural Networks"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/The%20Information%20Theory%2C%20Pattern%20Recognition%2C%20and%20Neural%20Networks/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aCambridge \u5148\u4fee\u8981\u6c42\uff1aCalculus, Linear Algebra, Probabilities and Statistics \u7f16\u7a0b\u8bed\u8a00\uff1aAnything would be OK, Python preferred \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a30-50 \u5c0f\u65f6 \u5251\u6865\u5927\u5b66 Sir David MacKay \u6559\u6388\u7684\u4fe1\u606f\u8bba\u8bfe\u7a0b\u3002\u6559\u6388\u662f\u4e00\u4f4d\u5341\u5206\u7cbe\u901a\u4fe1\u606f\u8bba\u4e0e\u795e\u7ecf\u7f51\u7edc\u7684\u5b66\u8005\uff0c\u8bfe\u7a0b\u5bf9\u5e94\u6559\u6750\u4e5f\u662f\u4fe1\u606f\u8bba\u9886\u57df\u7684\u4e00\u90e8\u7ecf\u5178\u8457\u4f5c\u3002\u53ef\u60dc\u5929\u5992\u82f1\u624d...","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/The%20Information%20Theory%2C%20Pattern%20Recognition%2C%20and%20Neural%20Networks/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aInformation Theory, Inference, and Learning Algorithms \u5728\u8bfe\u7a0b\u7f51\u7ad9\u53ef\u4ee5\u4e0b\u8f7d\u5230\u514d\u8d39\u7684\u7535\u5b50\u7248 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u5728\u6bcf\u4e00\u8282\u8bfe\u89c6\u9891\u7684\u6700\u540e\u4f1a\u7559\u6559\u6750\u4e0a\u7684\u8bfe\u540e\u4e60\u9898","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/The%20Information%20Theory%2C%20Pattern%20Recognition%2C%20and%20Neural%20Networks/#rip-prof-david-mackay","text":"","title":"R.I.P Prof. David MacKay"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/convex/","text":"Standford EE364A: Convex Optimization \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1aPython\uff0c\u5fae\u79ef\u5206\uff0c\u7ebf\u6027\u4ee3\u6570\uff0c\u6982\u7387\u8bba\uff0c\u6570\u503c\u5206\u6790 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 Stephen Boyd \u6559\u6388\u662f\u51f8\u4f18\u5316\u9886\u57df\u7684\u5927\u725b\uff0c\u5176\u7f16\u5199\u7684 Convex Optimization \u8fd9\u672c\u6559\u6750\u88ab\u4f17\u591a\u540d\u6821\u91c7\u7528\u3002\u53e6\u5916\u5176\u7814\u7a76\u56e2\u961f\u8fd8\u4e13\u95e8\u5f00\u53d1\u4e86\u4e00\u4e2a\u7528\u4e8e\u6c42\u89e3\u5e38\u89c1\u51f8\u4f18\u5316\u95ee\u9898\u7684\u7f16\u7a0b\u6846\u67b6\uff0c\u652f\u6301Python\uff0cJulia\u7b49\u4e3b\u6d41\u7f16\u7a0b\u8bed\u8a00\uff0c\u5176\u8bfe\u7a0b\u4f5c\u4e1a\u4e5f\u662f\u91c7\u7528\u8fd9\u4e2a\u7f16\u7a0b\u6846\u67b6\u53bb\u89e3\u51b3\u5b9e\u9645\u751f\u6d3b\u5f53\u4e2d\u7684\u51f8\u4f18\u5316\u95ee\u9898\u3002 \u5728\u5b9e\u9645\u8fd0\u7528\u5f53\u4e2d\uff0c\u4f60\u4f1a\u6df1\u523b\u4f53\u4f1a\u5230\u5bf9\u4e8e\u540c\u4e00\u4e2a\u95ee\u9898\uff0c\u5efa\u6a21\u8fc7\u7a0b\u4e2d\u4e00\u4e2a\u7ec6\u5c0f\u7684\u6539\u53d8\uff0c\u5176\u65b9\u7a0b\u7684\u6c42\u89e3\u96be\u5ea6\u4f1a\u6709\u5929\u58e4\u4e4b\u522b\uff0c\u5982\u4f55\u8ba9\u4f60\u5efa\u6a21\u7684\u65b9\u7a0b\u662f\u201c\u51f8\u201d\u7684\uff0c\u662f\u4e00\u95e8\u827a\u672f\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a Convex Optimization \u8bfe\u7a0b\u4f5c\u4e1a\uff1a9\u4e2aPython\u7f16\u7a0b\u4f5c\u4e1a \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Standford EE364A: Convex Optimization"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/convex/#standford-ee364a-convex-optimization","text":"","title":"Standford EE364A: Convex Optimization"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/convex/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1aPython\uff0c\u5fae\u79ef\u5206\uff0c\u7ebf\u6027\u4ee3\u6570\uff0c\u6982\u7387\u8bba\uff0c\u6570\u503c\u5206\u6790 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 Stephen Boyd \u6559\u6388\u662f\u51f8\u4f18\u5316\u9886\u57df\u7684\u5927\u725b\uff0c\u5176\u7f16\u5199\u7684 Convex Optimization \u8fd9\u672c\u6559\u6750\u88ab\u4f17\u591a\u540d\u6821\u91c7\u7528\u3002\u53e6\u5916\u5176\u7814\u7a76\u56e2\u961f\u8fd8\u4e13\u95e8\u5f00\u53d1\u4e86\u4e00\u4e2a\u7528\u4e8e\u6c42\u89e3\u5e38\u89c1\u51f8\u4f18\u5316\u95ee\u9898\u7684\u7f16\u7a0b\u6846\u67b6\uff0c\u652f\u6301Python\uff0cJulia\u7b49\u4e3b\u6d41\u7f16\u7a0b\u8bed\u8a00\uff0c\u5176\u8bfe\u7a0b\u4f5c\u4e1a\u4e5f\u662f\u91c7\u7528\u8fd9\u4e2a\u7f16\u7a0b\u6846\u67b6\u53bb\u89e3\u51b3\u5b9e\u9645\u751f\u6d3b\u5f53\u4e2d\u7684\u51f8\u4f18\u5316\u95ee\u9898\u3002 \u5728\u5b9e\u9645\u8fd0\u7528\u5f53\u4e2d\uff0c\u4f60\u4f1a\u6df1\u523b\u4f53\u4f1a\u5230\u5bf9\u4e8e\u540c\u4e00\u4e2a\u95ee\u9898\uff0c\u5efa\u6a21\u8fc7\u7a0b\u4e2d\u4e00\u4e2a\u7ec6\u5c0f\u7684\u6539\u53d8\uff0c\u5176\u65b9\u7a0b\u7684\u6c42\u89e3\u96be\u5ea6\u4f1a\u6709\u5929\u58e4\u4e4b\u522b\uff0c\u5982\u4f55\u8ba9\u4f60\u5efa\u6a21\u7684\u65b9\u7a0b\u662f\u201c\u51f8\u201d\u7684\uff0c\u662f\u4e00\u95e8\u827a\u672f\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/convex/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a Convex Optimization \u8bfe\u7a0b\u4f5c\u4e1a\uff1a9\u4e2aPython\u7f16\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/convex/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/numerical/","text":"MIT18.330 : Introduction to numerical analysis \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u5fae\u79ef\u5206\uff0c\u7ebf\u6027\u4ee3\u6570\uff0c\u6982\u7387\u8bba \u7f16\u7a0b\u8bed\u8a00\uff1aJulia \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u8ba1\u7b97\u673a\u5f3a\u5927\u7684\u8ba1\u7b97\u80fd\u529b\u5e2e\u52a9\u4eba\u4eec\u5728\u79d1\u5b66\u9886\u57df\u4e0d\u65ad\u7a81\u7834\u8fb9\u754c\uff0c\u4e0d\u8fc7\u8ba1\u7b97\u673a\u7684\u79bb\u6563\u672c\u8d28\u548c\u8fd9\u4e2a\u8fde\u7eed\u7684\u4e16\u754c\u6709\u7740\u5929\u7136\u9e3f\u6c9f\uff0c\u800c\u5982\u4f55\u7528\u79bb\u6563\u7684\u8868\u793a\u53bb\u4f30\u8ba1\u548c\u903c\u8fd1\u90a3\u4e9b\u6570\u5b66\u4e0a\u8fde\u7eed\u7684\u6982\u5ff5\uff0c\u5219\u662f\u6570\u503c\u5206\u6790\u7684\u91cd\u8981\u4e3b\u9898\u3002 \u8fd9\u95e8\u8bfe\u4f1a\u5728\u6d6e\u70b9\u8868\u793a\u3001\u65b9\u7a0b\u6c42\u89e3\u3001\u7ebf\u6027\u4ee3\u6570\u3001\u5fae\u79ef\u5206\u3001\u7ebf\u6027\u4ee3\u6570\u3001\u5fae\u5206\u65b9\u7a0b\u7b49\u9886\u57df\u63a2\u8ba8\u5404\u7c7b\u6570\u503c\u5206\u6790\u65b9\u6cd5\uff0c\u8ba9\u4f60\u5728Julia\u7684\u7f16\u7a0b\u5b9e\u8df5\u4e2d\u53cd\u590d\u4f53\u609f\uff081\uff09\u5982\u4f55\u5efa\u7acb\u4f30\u8ba1\uff082\uff09\u5982\u4f55\u4f30\u8ba1\u8bef\u5dee\uff083\uff09\u5982\u4f55\u7528\u7b97\u6cd5\u5b9e\u73b0\u4f30\u8ba1 \u8fd9\u4e00\u7cfb\u5217\u6b65\u9aa4\u3002 \u8fd9\u95e8\u8bfe\u7684\u8bbe\u8ba1\u8005\u8fd8\u7f16\u5199\u4e86\u914d\u5957\u7684\u5f00\u6e90\u6559\u6750\uff08\u53c2\u89c1\u4e0b\u65b9\u94fe\u63a5\uff09\uff0c\u91cc\u9762\u6709\u4e30\u5bcc\u7684Julia\u5b9e\u4f8b\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a10\u4e2aJulia\u7f16\u7a0b\u4f5c\u4e1a \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"MIT18.330: Introduction to numerical analysis"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/numerical/#mit18330-introduction-to-numerical-analysis","text":"","title":"MIT18.330 : Introduction to numerical analysis"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/numerical/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u5fae\u79ef\u5206\uff0c\u7ebf\u6027\u4ee3\u6570\uff0c\u6982\u7387\u8bba \u7f16\u7a0b\u8bed\u8a00\uff1aJulia \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u8ba1\u7b97\u673a\u5f3a\u5927\u7684\u8ba1\u7b97\u80fd\u529b\u5e2e\u52a9\u4eba\u4eec\u5728\u79d1\u5b66\u9886\u57df\u4e0d\u65ad\u7a81\u7834\u8fb9\u754c\uff0c\u4e0d\u8fc7\u8ba1\u7b97\u673a\u7684\u79bb\u6563\u672c\u8d28\u548c\u8fd9\u4e2a\u8fde\u7eed\u7684\u4e16\u754c\u6709\u7740\u5929\u7136\u9e3f\u6c9f\uff0c\u800c\u5982\u4f55\u7528\u79bb\u6563\u7684\u8868\u793a\u53bb\u4f30\u8ba1\u548c\u903c\u8fd1\u90a3\u4e9b\u6570\u5b66\u4e0a\u8fde\u7eed\u7684\u6982\u5ff5\uff0c\u5219\u662f\u6570\u503c\u5206\u6790\u7684\u91cd\u8981\u4e3b\u9898\u3002 \u8fd9\u95e8\u8bfe\u4f1a\u5728\u6d6e\u70b9\u8868\u793a\u3001\u65b9\u7a0b\u6c42\u89e3\u3001\u7ebf\u6027\u4ee3\u6570\u3001\u5fae\u79ef\u5206\u3001\u7ebf\u6027\u4ee3\u6570\u3001\u5fae\u5206\u65b9\u7a0b\u7b49\u9886\u57df\u63a2\u8ba8\u5404\u7c7b\u6570\u503c\u5206\u6790\u65b9\u6cd5\uff0c\u8ba9\u4f60\u5728Julia\u7684\u7f16\u7a0b\u5b9e\u8df5\u4e2d\u53cd\u590d\u4f53\u609f\uff081\uff09\u5982\u4f55\u5efa\u7acb\u4f30\u8ba1\uff082\uff09\u5982\u4f55\u4f30\u8ba1\u8bef\u5dee\uff083\uff09\u5982\u4f55\u7528\u7b97\u6cd5\u5b9e\u73b0\u4f30\u8ba1 \u8fd9\u4e00\u7cfb\u5217\u6b65\u9aa4\u3002 \u8fd9\u95e8\u8bfe\u7684\u8bbe\u8ba1\u8005\u8fd8\u7f16\u5199\u4e86\u914d\u5957\u7684\u5f00\u6e90\u6559\u6750\uff08\u53c2\u89c1\u4e0b\u65b9\u94fe\u63a5\uff09\uff0c\u91cc\u9762\u6709\u4e30\u5bcc\u7684Julia\u5b9e\u4f8b\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/numerical/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a10\u4e2aJulia\u7f16\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E5%AD%A6%E8%BF%9B%E9%98%B6/numerical/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/15445/","text":"CMU 15-445: Database Systems \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aCMU \u5148\u4fee\u8981\u6c42\uff1aC++\uff0c\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5 \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f5c\u4e3aCMU\u6570\u636e\u5e93\u7684\u5165\u95e8\u8bfe\uff0c\u8fd9\u95e8\u8bfe\u7531\u6570\u636e\u5e93\u9886\u57df\u7684\u5927\u725b Andy Pavlo\u8bb2\u6388\uff08\u201c\u8fd9\u4e2a\u4e16\u754c\u4e0a\u6211\u53ea\u5728\u4e4e\u4e24\u4ef6\u4e8b\uff0c\u4e00\u662f\u6211\u7684\u8001\u5a46\uff0c\u4e8c\u5c31\u662f\u6570\u636e\u5e93\u201d\uff09\u300215-445\u4f1a\u81ea\u5e95\u5411\u4e0a\u5730\u6559\u4f60\u6570\u636e\u5e93\u7cfb\u7edf\u7684\u57fa\u672c\u7ec4\u6210\u90e8\u5206\uff1a\u5b58\u50a8\u3001\u7d22\u5f15\u3001\u67e5\u8be2\uff0c\u4ee5\u53ca\u5e76\u53d1\u4e8b\u52a1\u63a7\u5236\u3002 \u8fd9\u95e8\u8bfe\u7684\u4eae\u70b9\u5728\u4e8eCMU db\u4e13\u95e8\u4e3a\u6b64\u8bfe\u5f00\u53d1\u4e86\u4e00\u4e2a\u6559\u5b66\u7528\u7684\u5173\u7cfb\u578b\u6570\u636e\u5e93 bustub \uff0c\u5e76\u8981\u6c42\u4f60\u5bf9\u8fd9\u4e2a\u6570\u636e\u5e93\u7684\u7ec4\u6210\u90e8\u5206\u8fdb\u884c\u4fee\u6539\uff0c\u5b9e\u73b0\u4e0a\u8ff0\u90e8\u4ef6\u7684\u529f\u80fd\u3002\u6b64\u5916 bustub\u4f5c\u4e3a\u4e00\u4e2aC++\u7f16\u5199\u7684\u4e2d\u5c0f\u578b\u9879\u76ee\u6db5\u76d6\u4e86\u7a0b\u5e8f\u6784\u5efa\u3001\u4ee3\u7801\u89c4\u8303\u3001\u5355\u5143\u6d4b\u8bd5\u7b49\u4f17\u591a\u8981\u6c42\uff0c\u53ef\u4ee5\u4f5c\u4e3a\u4e00\u4e2a\u4f18\u79c0\u7684\u5f00\u6e90\u9879\u76ee\u5b66\u4e60\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9(Fall2019) , \u8bfe\u7a0b\u7f51\u7ad9(Fall2020) \u8bfe\u7a0b\u89c6\u9891\uff1a\u8bfe\u7a0b\u7f51\u7ad9\u514d\u8d39\u89c2\u770b \u8bfe\u7a0b\u6559\u6750\uff1aDatabase System Concepts \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2aProject \u5728Fall2019\u4e2d\uff0c\u7b2c\u4e8c\u4e2aproject\u662f\u505a\u54c8\u5e0c\u7d22\u5f15\uff0c\u7b2c\u56db\u4e2aproject\u662f\u505a\u65e5\u5fd7\u4e0e\u6062\u590d \u5728Fall2020\u4e2d\uff0c\u7b2c\u4e8c\u4e2aproject\u662f\u505aB\u6811\uff0c\u7b2c\u56db\u4e2aproject\u662f\u505a\u5e76\u53d1\u63a7\u5236 \u5982\u679c\u5927\u5bb6\u6709\u7cbe\u529b\u7684\u8bdd\u53ef\u4ee5\u90fd\u53bb\u5c1d\u8bd5\u4e00\u4e0b\uff0c\u6216\u8005\u5728\u5bf9\u4e66\u4e2d\u5185\u5bb9\u7406\u89e3\u4e0d\u662f\u5f88\u900f\u5f7b\u7684\u65f6\u5019\uff0c\u5c1d\u8bd5\u7528\u4ee3\u7801\u5199\u4e00\u4e2a\u4f1a\u52a0\u6df1\u4f60\u7684\u7406\u89e3\u3002 \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002 \u7531\u4e8eAndy\u7684\u8981\u6c42\uff0c\u4ed3\u5e93\u4e2d\u6ca1\u6709project\u7684\u5b9e\u73b0\uff0c\u53ea\u6709homework\u7684solution\u3002\u7279\u522b\u7684\uff0c\u5bf9\u4e8ehomework1\uff0c\u6211\u8fd8\u5199\u4e86\u4e00\u4e2ashell\u811a\u672c\u6765\u5e2e\u5927\u5bb6\u6267\u884c\u81ea\u52a8\u5224\u5206 \u53e6\u5916\u5728\u8bfe\u7a0b\u7ed3\u675f\u540e\uff0c\u6211\u5341\u5206\u63a8\u8350\u9605\u8bfb\u4e00\u7bc7\u8bba\u6587 Architecture Of a Database System \uff0c\u5bf9\u5e94\u7684\u4e2d\u6587\u7248\u6211\u4e0a\u4f20\u5230\u4e86\u94fe\u63a5\u4e2d\u7684\u4ed3\u5e93\u3002\u8bba\u6587\u91cc\u7efc\u8ff0\u4e86\u6570\u636e\u5e93\u7cfb\u7edf\u7684\u6574\u4f53\u67b6\u6784\uff0c\u8ba9\u5927\u5bb6\u53ef\u4ee5\u5bf9\u6570\u636e\u5e93\u6709\u4e00\u4e2a\u66f4\u52a0\u5168\u9762\u7684\u89c6\u91ce\u3002 \u540e\u7eed\u8bfe\u7a0b CMU15-721 \u4e3b\u8981\u8bb2\u4e3b\u5b58\u6570\u636e\u5e93\u6709\u5173\u7684\u5185\u5bb9\uff0c\u6bcf\u8282\u8bfe\u90fd\u6709\u5bf9\u5e94\u7684paper\u8981\u8bfb\uff0c\u63a8\u8350\u7ed9\u5e0c\u671b\u8fdb\u9636\u6570\u636e\u5e93\u7684\u5c0f\u4f19\u4f34 \u6211\u76ee\u524d\u4e5f\u5728\u8ddf\u8fdb\u8fd9\u95e8\u8bfe\uff0c\u5b8c\u6210\u540e\u4f1a\u5728\u8fd9\u91cc\u63d0PR\u4ee5\u63d0\u4f9b\u8fdb\u9636\u7684\u6307\u5bfc","title":"CMU 15-445: Database Systems"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/15445/#cmu-15-445-database-systems","text":"","title":"CMU 15-445: Database Systems"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/15445/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aCMU \u5148\u4fee\u8981\u6c42\uff1aC++\uff0c\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5 \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f5c\u4e3aCMU\u6570\u636e\u5e93\u7684\u5165\u95e8\u8bfe\uff0c\u8fd9\u95e8\u8bfe\u7531\u6570\u636e\u5e93\u9886\u57df\u7684\u5927\u725b Andy Pavlo\u8bb2\u6388\uff08\u201c\u8fd9\u4e2a\u4e16\u754c\u4e0a\u6211\u53ea\u5728\u4e4e\u4e24\u4ef6\u4e8b\uff0c\u4e00\u662f\u6211\u7684\u8001\u5a46\uff0c\u4e8c\u5c31\u662f\u6570\u636e\u5e93\u201d\uff09\u300215-445\u4f1a\u81ea\u5e95\u5411\u4e0a\u5730\u6559\u4f60\u6570\u636e\u5e93\u7cfb\u7edf\u7684\u57fa\u672c\u7ec4\u6210\u90e8\u5206\uff1a\u5b58\u50a8\u3001\u7d22\u5f15\u3001\u67e5\u8be2\uff0c\u4ee5\u53ca\u5e76\u53d1\u4e8b\u52a1\u63a7\u5236\u3002 \u8fd9\u95e8\u8bfe\u7684\u4eae\u70b9\u5728\u4e8eCMU db\u4e13\u95e8\u4e3a\u6b64\u8bfe\u5f00\u53d1\u4e86\u4e00\u4e2a\u6559\u5b66\u7528\u7684\u5173\u7cfb\u578b\u6570\u636e\u5e93 bustub \uff0c\u5e76\u8981\u6c42\u4f60\u5bf9\u8fd9\u4e2a\u6570\u636e\u5e93\u7684\u7ec4\u6210\u90e8\u5206\u8fdb\u884c\u4fee\u6539\uff0c\u5b9e\u73b0\u4e0a\u8ff0\u90e8\u4ef6\u7684\u529f\u80fd\u3002\u6b64\u5916 bustub\u4f5c\u4e3a\u4e00\u4e2aC++\u7f16\u5199\u7684\u4e2d\u5c0f\u578b\u9879\u76ee\u6db5\u76d6\u4e86\u7a0b\u5e8f\u6784\u5efa\u3001\u4ee3\u7801\u89c4\u8303\u3001\u5355\u5143\u6d4b\u8bd5\u7b49\u4f17\u591a\u8981\u6c42\uff0c\u53ef\u4ee5\u4f5c\u4e3a\u4e00\u4e2a\u4f18\u79c0\u7684\u5f00\u6e90\u9879\u76ee\u5b66\u4e60\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/15445/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9(Fall2019) , \u8bfe\u7a0b\u7f51\u7ad9(Fall2020) \u8bfe\u7a0b\u89c6\u9891\uff1a\u8bfe\u7a0b\u7f51\u7ad9\u514d\u8d39\u89c2\u770b \u8bfe\u7a0b\u6559\u6750\uff1aDatabase System Concepts \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2aProject \u5728Fall2019\u4e2d\uff0c\u7b2c\u4e8c\u4e2aproject\u662f\u505a\u54c8\u5e0c\u7d22\u5f15\uff0c\u7b2c\u56db\u4e2aproject\u662f\u505a\u65e5\u5fd7\u4e0e\u6062\u590d \u5728Fall2020\u4e2d\uff0c\u7b2c\u4e8c\u4e2aproject\u662f\u505aB\u6811\uff0c\u7b2c\u56db\u4e2aproject\u662f\u505a\u5e76\u53d1\u63a7\u5236 \u5982\u679c\u5927\u5bb6\u6709\u7cbe\u529b\u7684\u8bdd\u53ef\u4ee5\u90fd\u53bb\u5c1d\u8bd5\u4e00\u4e0b\uff0c\u6216\u8005\u5728\u5bf9\u4e66\u4e2d\u5185\u5bb9\u7406\u89e3\u4e0d\u662f\u5f88\u900f\u5f7b\u7684\u65f6\u5019\uff0c\u5c1d\u8bd5\u7528\u4ee3\u7801\u5199\u4e00\u4e2a\u4f1a\u52a0\u6df1\u4f60\u7684\u7406\u89e3\u3002 \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002 \u7531\u4e8eAndy\u7684\u8981\u6c42\uff0c\u4ed3\u5e93\u4e2d\u6ca1\u6709project\u7684\u5b9e\u73b0\uff0c\u53ea\u6709homework\u7684solution\u3002\u7279\u522b\u7684\uff0c\u5bf9\u4e8ehomework1\uff0c\u6211\u8fd8\u5199\u4e86\u4e00\u4e2ashell\u811a\u672c\u6765\u5e2e\u5927\u5bb6\u6267\u884c\u81ea\u52a8\u5224\u5206 \u53e6\u5916\u5728\u8bfe\u7a0b\u7ed3\u675f\u540e\uff0c\u6211\u5341\u5206\u63a8\u8350\u9605\u8bfb\u4e00\u7bc7\u8bba\u6587 Architecture Of a Database System \uff0c\u5bf9\u5e94\u7684\u4e2d\u6587\u7248\u6211\u4e0a\u4f20\u5230\u4e86\u94fe\u63a5\u4e2d\u7684\u4ed3\u5e93\u3002\u8bba\u6587\u91cc\u7efc\u8ff0\u4e86\u6570\u636e\u5e93\u7cfb\u7edf\u7684\u6574\u4f53\u67b6\u6784\uff0c\u8ba9\u5927\u5bb6\u53ef\u4ee5\u5bf9\u6570\u636e\u5e93\u6709\u4e00\u4e2a\u66f4\u52a0\u5168\u9762\u7684\u89c6\u91ce\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/15445/#_3","text":"CMU15-721 \u4e3b\u8981\u8bb2\u4e3b\u5b58\u6570\u636e\u5e93\u6709\u5173\u7684\u5185\u5bb9\uff0c\u6bcf\u8282\u8bfe\u90fd\u6709\u5bf9\u5e94\u7684paper\u8981\u8bfb\uff0c\u63a8\u8350\u7ed9\u5e0c\u671b\u8fdb\u9636\u6570\u636e\u5e93\u7684\u5c0f\u4f19\u4f34 \u6211\u76ee\u524d\u4e5f\u5728\u8ddf\u8fdb\u8fd9\u95e8\u8bfe\uff0c\u5b8c\u6210\u540e\u4f1a\u5728\u8fd9\u91cc\u63d0PR\u4ee5\u63d0\u4f9b\u8fdb\u9636\u7684\u6307\u5bfc","title":"\u540e\u7eed\u8bfe\u7a0b"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/CS186/","text":"UCB CS186: Introduction to Database System \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B, CS61C \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u5982\u4f55\u7f16\u5199SQL\u67e5\u8be2\uff1fSQL\u547d\u4ee4\u662f\u5982\u4f55\u88ab\u4e00\u6b65\u6b65\u62c6\u89e3\u3001\u4f18\u5316\u3001\u8f6c\u53d8\u4e3a\u4e00\u4e2a\u4e2a\u78c1\u76d8\u67e5\u8be2\u6307\u4ee4\u7684\uff1f\u5982\u4f55\u5b9e\u73b0\u9ad8\u5e76\u53d1\u7684\u6570\u636e\u5e93\uff1f\u5982\u4f55\u5b9e\u73b0\u6570\u636e\u5e93\u7684\u6545\u969c\u6062\u590d\uff1f\u4ec0\u4e48\u53c8\u662f\u975e\u5173\u7cfb\u578b\u6570\u636e\u5e93\uff1f\u8fd9\u95e8\u8bfe\u4f1a\u5e26\u4f60\u6df1\u5165\u7406\u89e3\u5173\u7cfb\u578b\u6570\u636e\u5e93\u7684\u5185\u90e8\u7ec6\u8282\uff0c\u5e76\u5728\u638c\u63e1\u7406\u8bba\u77e5\u8bc6\u4e4b\u540e\uff0c\u52a8\u624b\u7528Java\u5b9e\u73b0\u4e00\u4e2a\u652f\u6301SQL\u5e76\u53d1\u67e5\u8be2\u3001B+\u6811Index\u548c\u6545\u969c\u6062\u590d\u7684\u5173\u7cfb\u578b\u6570\u636e\u5e93\u3002 \u4ece\u5b9e\u7528\u89d2\u5ea6\u6765\u8bf4\uff0c\u8fd9\u95e8\u8bfe\u8fd8\u4f1a\u5728\u7f16\u7a0b\u4f5c\u4e1a\u4e2d\u953b\u70bc\u4f60\u7f16\u5199SQL\u67e5\u8be2\u4ee5\u53caNoSQL\u67e5\u8be2\u7684\u80fd\u529b\uff0c\u5bf9\u4e8e\u6784\u5efa\u4e00\u4e9b\u5168\u6808\u7684\u5de5\u7a0b\u9879\u76ee\u5f88\u6709\u5e2e\u52a9\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a6\u4e2aProject \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS186: Introduction to Database System"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/CS186/#ucb-cs186-introduction-to-database-system","text":"","title":"UCB CS186: Introduction to Database System"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/CS186/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B, CS61C \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u5982\u4f55\u7f16\u5199SQL\u67e5\u8be2\uff1fSQL\u547d\u4ee4\u662f\u5982\u4f55\u88ab\u4e00\u6b65\u6b65\u62c6\u89e3\u3001\u4f18\u5316\u3001\u8f6c\u53d8\u4e3a\u4e00\u4e2a\u4e2a\u78c1\u76d8\u67e5\u8be2\u6307\u4ee4\u7684\uff1f\u5982\u4f55\u5b9e\u73b0\u9ad8\u5e76\u53d1\u7684\u6570\u636e\u5e93\uff1f\u5982\u4f55\u5b9e\u73b0\u6570\u636e\u5e93\u7684\u6545\u969c\u6062\u590d\uff1f\u4ec0\u4e48\u53c8\u662f\u975e\u5173\u7cfb\u578b\u6570\u636e\u5e93\uff1f\u8fd9\u95e8\u8bfe\u4f1a\u5e26\u4f60\u6df1\u5165\u7406\u89e3\u5173\u7cfb\u578b\u6570\u636e\u5e93\u7684\u5185\u90e8\u7ec6\u8282\uff0c\u5e76\u5728\u638c\u63e1\u7406\u8bba\u77e5\u8bc6\u4e4b\u540e\uff0c\u52a8\u624b\u7528Java\u5b9e\u73b0\u4e00\u4e2a\u652f\u6301SQL\u5e76\u53d1\u67e5\u8be2\u3001B+\u6811Index\u548c\u6545\u969c\u6062\u590d\u7684\u5173\u7cfb\u578b\u6570\u636e\u5e93\u3002 \u4ece\u5b9e\u7528\u89d2\u5ea6\u6765\u8bf4\uff0c\u8fd9\u95e8\u8bfe\u8fd8\u4f1a\u5728\u7f16\u7a0b\u4f5c\u4e1a\u4e2d\u953b\u70bc\u4f60\u7f16\u5199SQL\u67e5\u8be2\u4ee5\u53caNoSQL\u67e5\u8be2\u7684\u80fd\u529b\uff0c\u5bf9\u4e8e\u6784\u5efa\u4e00\u4e9b\u5168\u6808\u7684\u5de5\u7a0b\u9879\u76ee\u5f88\u6709\u5e2e\u52a9\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/CS186/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a6\u4e2aProject","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E6%8D%AE%E5%BA%93%E7%B3%BB%E7%BB%9F/CS186/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/Data100/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A\uff0c\u7ebf\u6027\u4ee3\u6570 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u6570\u636e\u79d1\u5b66\u5165\u95e8\u8bfe\u7a0b\uff0c\u5185\u5bb9\u76f8\u5bf9\u57fa\u7840\uff0c\u8986\u76d6\u4e86\u6570\u636e\u6e05\u6d17\u3001\u7279\u5f81\u63d0\u53d6\u3001\u6570\u636e\u53ef\u89c6\u5316\u4ee5\u53ca\u673a\u5668\u5b66\u4e60\u548c\u63a8\u7406\u7684\u57fa\u7840\u5185\u5bb9\uff0c\u4e5f\u4f1a\u8bb2\u6388Pandas\uff0cNumpy\uff0cMatplotlib\u7b49\u6570\u636e\u79d1\u5b66\u5e38\u7528\u5de5\u5177\u3002\u5176\u4e30\u5bcc\u6709\u8da3\u7684\u7f16\u7a0b\u4f5c\u4e1a\u4e5f\u662f\u8fd9\u95e8\u8bfe\u7684\u4e00\u5927\u4eae\u70b9\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"UCB Data100: Principles and Techniques of Data Science"},{"location":"%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/Data100/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A\uff0c\u7ebf\u6027\u4ee3\u6570 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u6570\u636e\u79d1\u5b66\u5165\u95e8\u8bfe\u7a0b\uff0c\u5185\u5bb9\u76f8\u5bf9\u57fa\u7840\uff0c\u8986\u76d6\u4e86\u6570\u636e\u6e05\u6d17\u3001\u7279\u5f81\u63d0\u53d6\u3001\u6570\u636e\u53ef\u89c6\u5316\u4ee5\u53ca\u673a\u5668\u5b66\u4e60\u548c\u63a8\u7406\u7684\u57fa\u7840\u5185\u5bb9\uff0c\u4e5f\u4f1a\u8bb2\u6388Pandas\uff0cNumpy\uff0cMatplotlib\u7b49\u6570\u636e\u79d1\u5b66\u5e38\u7528\u5de5\u5177\u3002\u5176\u4e30\u5bcc\u6709\u8da3\u7684\u7f16\u7a0b\u4f5c\u4e1a\u4e5f\u662f\u8fd9\u95e8\u8bfe\u7684\u4e00\u5927\u4eae\u70b9\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E6%8D%AE%E7%A7%91%E5%AD%A6/Data100/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/Algo/","text":"Coursera: Algorithms I & II \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aPrinceton \u5148\u4fee\u8981\u6c42\uff1aCS61A \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u8fd9\u662f Coursera \u4e0a\u8bc4\u5206\u6700\u9ad8\u7684\u7b97\u6cd5\u8bfe\u7a0b\u3002Robert Sedgewick\u6559\u6388\u6709\u4e00\u79cd\u9b54\u529b\uff0c\u53ef\u4ee5\u5c06\u65e0\u8bba\u591a\u4e48\u590d\u6742\u7684\u7b97\u6cd5\u8bb2\u5f97\u6781\u4e3a\u751f\u52a8\u6d45\u663e\u3002\u5b9e\u4e0d\u76f8\u7792\uff0c\u56f0\u6270\u6211 \u591a\u5e74\u7684KMP\u4ee5\u53ca\u7f51\u7edc\u6d41\u7b97\u6cd5\u90fd\u662f\u5728\u8fd9\u95e8\u8bfe\u4e0a\u8ba9\u6211\u8305\u585e\u987f\u5f00\u7684\uff0c\u65f6\u9694\u4e24\u5e74\u6211\u751a\u81f3\u8fd8\u80fd\u5199\u51fa\u8fd9\u4e24\u4e2a\u7b97\u6cd5\u7684\u63a8\u5bfc\u4e0e\u8bc1\u660e\u3002 \u4f60\u662f\u5426\u89c9\u5f97\u7b97\u6cd5\u5b66\u4e86\u5c31\u5fd8\u5462\uff1f\u6211\u89c9\u5f97\u8ba9\u4f60\u5b8c\u5168\u638c\u63e1\u4e00\u4e2a\u7b97\u6cd5\u7684\u6838\u5fc3\u5728\u4e8e\u7406\u89e3\u4e09\u70b9\uff1a \u4e3a\u4ec0\u4e48\u8fd9\u4e48\u505a\uff1f\uff08\u6b63\u786e\u6027\u63a8\u5bfc\uff0c\u6291\u6216\u662f\u6574\u4e2a\u7b97\u6cd5\u7684\u6838\u5fc3\u672c\u8d28\uff09 \u5982\u4f55\u5b9e\u73b0\u5b83\uff1f\uff08\u5149\u5b66\u4e0d\u7528\u5047\u628a\u5f0f\uff09 \u7528\u5b83\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\uff08\u5b66\u4ee5\u81f4\u7528\u624d\u662f\u771f\u672c\u4e8b\uff09 \u8fd9\u95e8\u8bfe\u7684\u6784\u6210\u5c31\u975e\u5e38\u597d\u5730\u5951\u5408\u4e86\u4e0a\u8ff0\u4e09\u4e2a\u6b65\u9aa4\u3002\u89c2\u770b\u8bfe\u7a0b\u89c6\u9891\u5e76\u4e14\u9605\u8bfb\u6559\u6388\u7684 \u5f00\u6e90\u8bfe\u672c \u6709\u52a9\u4e8e\u4f60\u7406\u89e3\u7b97\u6cd5\u7684\u672c\u8d28\uff0c\u8ba9\u4f60\u4e5f\u53ef\u4ee5\u7528\u975e\u5e38 \u751f\u52a8\u6d45\u663e\u7684\u8bdd\u8bed\u5411\u522b\u4eba\u8bb2\u8ff0\u4e3a\u4ec0\u4e48\u8fd9\u4e2a\u7b97\u6cd5\u5f97\u957f\u8fd9\u4e2a\u6837\u5b50\u3002 \u5728\u7406\u89e3\u7b97\u6cd5\u4e4b\u540e\uff0c\u4f60\u53ef\u4ee5\u9605\u8bfb\u6559\u6388\u5bf9\u4e8e\u8bfe\u7a0b\u4e2d\u8bb2\u6388\u7684\u6240\u6709\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5\u7684 \u4ee3\u7801\u5b9e\u73b0 \u3002 \u6ce8\u610f\uff0c\u8fd9\u4e9b\u5b9e\u73b0\u53ef\u4e0d\u662fdemo\u6027\u8d28\u7684\uff0c\u800c\u662f\u5de5\u4e1a\u7ea7\u7684\u9ad8\u6548\u5b9e\u73b0\uff0c\u4ece\u6ce8\u91ca\u5230\u53d8\u91cf\u547d\u540d\u90fd\u975e\u5e38\u4e25\u8c28\uff0c\u6a21\u5757\u5316\u4e5f\u505a\u5f97\u76f8\u5f53\u597d\uff0c\u662f\u8d28\u91cf\u5f88\u9ad8\u7684\u4ee3\u7801\u3002\u6211\u4ece\u8fd9\u4e9b\u4ee3\u7801\u4e2d\u6536\u83b7\u826f\u591a\u3002 \u6700\u540e\uff0c\u5c31\u662f\u8fd9\u95e8\u8bfe\u6700\u6fc0\u52a8\u4eba\u5fc3\u7684\u90e8\u5206\u4e86\uff0c10\u4e2a\u9ad8\u8d28\u91cf\u7684Project\uff0c\u5e76\u4e14\u5168\u90fd\u6709\u5b9e\u9645\u95ee\u9898\u7684\u80cc\u666f\u63cf\u8ff0\uff0c\u4e30\u5bcc\u7684\u6d4b\u8bd5\u6837\u4f8b\uff0c\u81ea\u52a8\u7684\u8bc4\u5206\u7cfb\u7edf\uff08\u4ee3\u7801\u98ce\u683c\u4e5f\u662f\u8bc4\u5206\u7684\u4e00\u73af\uff09\u3002\u8ba9\u4f60\u5728\u5b9e\u9645\u751f\u6d3b\u4e2d \u9886\u7565\u7b97\u6cd5\u7684\u9b45\u529b\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a Algorithm I , Algorithm II \u8bfe\u7a0b\u89c6\u9891\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a10\u4e2aProject\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Coursera: Algorithms I & II"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/Algo/#coursera-algorithms-i-ii","text":"","title":"Coursera: Algorithms I & II"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/Algo/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aPrinceton \u5148\u4fee\u8981\u6c42\uff1aCS61A \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u8fd9\u662f Coursera \u4e0a\u8bc4\u5206\u6700\u9ad8\u7684\u7b97\u6cd5\u8bfe\u7a0b\u3002Robert Sedgewick\u6559\u6388\u6709\u4e00\u79cd\u9b54\u529b\uff0c\u53ef\u4ee5\u5c06\u65e0\u8bba\u591a\u4e48\u590d\u6742\u7684\u7b97\u6cd5\u8bb2\u5f97\u6781\u4e3a\u751f\u52a8\u6d45\u663e\u3002\u5b9e\u4e0d\u76f8\u7792\uff0c\u56f0\u6270\u6211 \u591a\u5e74\u7684KMP\u4ee5\u53ca\u7f51\u7edc\u6d41\u7b97\u6cd5\u90fd\u662f\u5728\u8fd9\u95e8\u8bfe\u4e0a\u8ba9\u6211\u8305\u585e\u987f\u5f00\u7684\uff0c\u65f6\u9694\u4e24\u5e74\u6211\u751a\u81f3\u8fd8\u80fd\u5199\u51fa\u8fd9\u4e24\u4e2a\u7b97\u6cd5\u7684\u63a8\u5bfc\u4e0e\u8bc1\u660e\u3002 \u4f60\u662f\u5426\u89c9\u5f97\u7b97\u6cd5\u5b66\u4e86\u5c31\u5fd8\u5462\uff1f\u6211\u89c9\u5f97\u8ba9\u4f60\u5b8c\u5168\u638c\u63e1\u4e00\u4e2a\u7b97\u6cd5\u7684\u6838\u5fc3\u5728\u4e8e\u7406\u89e3\u4e09\u70b9\uff1a \u4e3a\u4ec0\u4e48\u8fd9\u4e48\u505a\uff1f\uff08\u6b63\u786e\u6027\u63a8\u5bfc\uff0c\u6291\u6216\u662f\u6574\u4e2a\u7b97\u6cd5\u7684\u6838\u5fc3\u672c\u8d28\uff09 \u5982\u4f55\u5b9e\u73b0\u5b83\uff1f\uff08\u5149\u5b66\u4e0d\u7528\u5047\u628a\u5f0f\uff09 \u7528\u5b83\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\uff08\u5b66\u4ee5\u81f4\u7528\u624d\u662f\u771f\u672c\u4e8b\uff09 \u8fd9\u95e8\u8bfe\u7684\u6784\u6210\u5c31\u975e\u5e38\u597d\u5730\u5951\u5408\u4e86\u4e0a\u8ff0\u4e09\u4e2a\u6b65\u9aa4\u3002\u89c2\u770b\u8bfe\u7a0b\u89c6\u9891\u5e76\u4e14\u9605\u8bfb\u6559\u6388\u7684 \u5f00\u6e90\u8bfe\u672c \u6709\u52a9\u4e8e\u4f60\u7406\u89e3\u7b97\u6cd5\u7684\u672c\u8d28\uff0c\u8ba9\u4f60\u4e5f\u53ef\u4ee5\u7528\u975e\u5e38 \u751f\u52a8\u6d45\u663e\u7684\u8bdd\u8bed\u5411\u522b\u4eba\u8bb2\u8ff0\u4e3a\u4ec0\u4e48\u8fd9\u4e2a\u7b97\u6cd5\u5f97\u957f\u8fd9\u4e2a\u6837\u5b50\u3002 \u5728\u7406\u89e3\u7b97\u6cd5\u4e4b\u540e\uff0c\u4f60\u53ef\u4ee5\u9605\u8bfb\u6559\u6388\u5bf9\u4e8e\u8bfe\u7a0b\u4e2d\u8bb2\u6388\u7684\u6240\u6709\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5\u7684 \u4ee3\u7801\u5b9e\u73b0 \u3002 \u6ce8\u610f\uff0c\u8fd9\u4e9b\u5b9e\u73b0\u53ef\u4e0d\u662fdemo\u6027\u8d28\u7684\uff0c\u800c\u662f\u5de5\u4e1a\u7ea7\u7684\u9ad8\u6548\u5b9e\u73b0\uff0c\u4ece\u6ce8\u91ca\u5230\u53d8\u91cf\u547d\u540d\u90fd\u975e\u5e38\u4e25\u8c28\uff0c\u6a21\u5757\u5316\u4e5f\u505a\u5f97\u76f8\u5f53\u597d\uff0c\u662f\u8d28\u91cf\u5f88\u9ad8\u7684\u4ee3\u7801\u3002\u6211\u4ece\u8fd9\u4e9b\u4ee3\u7801\u4e2d\u6536\u83b7\u826f\u591a\u3002 \u6700\u540e\uff0c\u5c31\u662f\u8fd9\u95e8\u8bfe\u6700\u6fc0\u52a8\u4eba\u5fc3\u7684\u90e8\u5206\u4e86\uff0c10\u4e2a\u9ad8\u8d28\u91cf\u7684Project\uff0c\u5e76\u4e14\u5168\u90fd\u6709\u5b9e\u9645\u95ee\u9898\u7684\u80cc\u666f\u63cf\u8ff0\uff0c\u4e30\u5bcc\u7684\u6d4b\u8bd5\u6837\u4f8b\uff0c\u81ea\u52a8\u7684\u8bc4\u5206\u7cfb\u7edf\uff08\u4ee3\u7801\u98ce\u683c\u4e5f\u662f\u8bc4\u5206\u7684\u4e00\u73af\uff09\u3002\u8ba9\u4f60\u5728\u5b9e\u9645\u751f\u6d3b\u4e2d \u9886\u7565\u7b97\u6cd5\u7684\u9b45\u529b\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/Algo/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a Algorithm I , Algorithm II \u8bfe\u7a0b\u89c6\u9891\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a10\u4e2aProject\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/Algo/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS106B_CS106X/","text":"Stanford CS106B/X: Programming Abstractions in C++ \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u57fa\u7840(CS50/CS106A/CS61A or equivalent) \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50-70 \u5c0f\u65f6 Stanford\u7684\u8fdb\u9636\u7f16\u7a0b\u8bfe\uff0cCS106X\u5728\u96be\u5ea6\u548c\u6df1\u5ea6\u4e0a\u4f1a\u6bd4CS106B\u6709\u6240\u63d0\u9ad8\uff0c\u4f46\u4e3b\u4f53\u5185\u5bb9\u7c7b\u4f3c\u3002\u4e3b\u8981\u901a\u8fc7C++\u8bed\u8a00\u8ba9\u5b66\u751f\u5728\u5b9e\u9645\u7684\u7f16\u7a0b\u4f5c\u4e1a\u91cc\u57f9\u517b\u901a\u8fc7\u7f16\u7a0b\u62bd\u8c61\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\u7684\u80fd\u529b\uff0c\u540c\u65f6\u4e5f\u4f1a\u6d89\u53ca\u4e00\u4e9b\u7b80\u5355\u7684\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u7684\u77e5\u8bc6\uff0c\u4f46\u603b\u4f53\u6765\u8bf4\u6ca1\u6709\u4e00\u95e8\u4e13\u95e8\u7684\u6570\u636e\u7ed3\u6784\u8bfe\u90a3\u4e48\u7cfb\u7edf\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a CS106B , CS106X \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u89c6\u9891","title":"Stanford CS106B/X"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS106B_CS106X/#stanford-cs106bx-programming-abstractions-in-c","text":"","title":"Stanford CS106B/X: Programming Abstractions in C++"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS106B_CS106X/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u57fa\u7840(CS50/CS106A/CS61A or equivalent) \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50-70 \u5c0f\u65f6 Stanford\u7684\u8fdb\u9636\u7f16\u7a0b\u8bfe\uff0cCS106X\u5728\u96be\u5ea6\u548c\u6df1\u5ea6\u4e0a\u4f1a\u6bd4CS106B\u6709\u6240\u63d0\u9ad8\uff0c\u4f46\u4e3b\u4f53\u5185\u5bb9\u7c7b\u4f3c\u3002\u4e3b\u8981\u901a\u8fc7C++\u8bed\u8a00\u8ba9\u5b66\u751f\u5728\u5b9e\u9645\u7684\u7f16\u7a0b\u4f5c\u4e1a\u91cc\u57f9\u517b\u901a\u8fc7\u7f16\u7a0b\u62bd\u8c61\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\u7684\u80fd\u529b\uff0c\u540c\u65f6\u4e5f\u4f1a\u6d89\u53ca\u4e00\u4e9b\u7b80\u5355\u7684\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u7684\u77e5\u8bc6\uff0c\u4f46\u603b\u4f53\u6765\u8bf4\u6ca1\u6709\u4e00\u95e8\u4e13\u95e8\u7684\u6570\u636e\u7ed3\u6784\u8bfe\u90a3\u4e48\u7cfb\u7edf\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS106B_CS106X/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a CS106B , CS106X \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u89c6\u9891","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS170/","text":"CS170: Efficient Algorithms and Intractable Problems \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61B, CS70 \u7f16\u7a0b\u8bed\u8a00\uff1aLatex \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u7b97\u6cd5\u8bbe\u8ba1\u8bfe\uff0c\u66f4\u6ce8\u91cd\u7b97\u6cd5\u7684\u7406\u8bba\u57fa\u7840\u4e0e\u590d\u6742\u5ea6\u5206\u6790\u3002\u8bfe\u7a0b\u5185\u5bb9\u6db5\u76d6\u4e86\u5206\u6cbb\u3001\u56fe\u7b97\u6cd5\u3001\u6700\u77ed\u8def\u3001\u751f\u6210\u6811\u3001\u8d2a\u5fc3\u3001\u52a8\u89c4\u3001\u5e76\u67e5\u96c6\u3001\u7ebf\u6027\u89c4\u5212\u3001\u7f51\u7edc\u6d41\u3001 NP\u95ee\u9898\u3001\u968f\u673a\u7b97\u6cd5\u3001\u54c8\u5e0c\u7b97\u6cd5\u7b49\u7b49\u3002 \u8fd9\u95e8\u8bfe\u7684\u6559\u6750\u5199\u7684\u5f88\u597d\uff0c\u8bc1\u660e\u6d45\u663e\u6613\u61c2\uff0c\u975e\u5e38\u9002\u5408\u4f5c\u4e3a\u5de5\u5177\u4e66\u67e5\u9605\u3002\u53e6\u5916\uff0c\u8fd9\u95e8\u8bfe\u53ea\u6709\u4e66\u9762\u4f5c\u4e1a\uff0c\u5e76\u4e14\u63a8\u8350\u7528Latex\u7f16\u5199\uff0c\u5927\u5bb6\u53ef\u4ee5\u501f\u6b64\u673a\u4f1a\u953b\u70bc\u81ea\u5df1\u7684 Latex\u6280\u5de7\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9notes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a13\u6b21\u4e66\u9762\u4f5c\u4e1a\uff0c\u7528Latex\u7f16\u5199 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS170: Efficient Algorithms and Intractable Problems"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS170/#cs170-efficient-algorithms-and-intractable-problems","text":"","title":"CS170: Efficient Algorithms and Intractable Problems"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS170/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61B, CS70 \u7f16\u7a0b\u8bed\u8a00\uff1aLatex \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u7b97\u6cd5\u8bbe\u8ba1\u8bfe\uff0c\u66f4\u6ce8\u91cd\u7b97\u6cd5\u7684\u7406\u8bba\u57fa\u7840\u4e0e\u590d\u6742\u5ea6\u5206\u6790\u3002\u8bfe\u7a0b\u5185\u5bb9\u6db5\u76d6\u4e86\u5206\u6cbb\u3001\u56fe\u7b97\u6cd5\u3001\u6700\u77ed\u8def\u3001\u751f\u6210\u6811\u3001\u8d2a\u5fc3\u3001\u52a8\u89c4\u3001\u5e76\u67e5\u96c6\u3001\u7ebf\u6027\u89c4\u5212\u3001\u7f51\u7edc\u6d41\u3001 NP\u95ee\u9898\u3001\u968f\u673a\u7b97\u6cd5\u3001\u54c8\u5e0c\u7b97\u6cd5\u7b49\u7b49\u3002 \u8fd9\u95e8\u8bfe\u7684\u6559\u6750\u5199\u7684\u5f88\u597d\uff0c\u8bc1\u660e\u6d45\u663e\u6613\u61c2\uff0c\u975e\u5e38\u9002\u5408\u4f5c\u4e3a\u5de5\u5177\u4e66\u67e5\u9605\u3002\u53e6\u5916\uff0c\u8fd9\u95e8\u8bfe\u53ea\u6709\u4e66\u9762\u4f5c\u4e1a\uff0c\u5e76\u4e14\u63a8\u8350\u7528Latex\u7f16\u5199\uff0c\u5927\u5bb6\u53ef\u4ee5\u501f\u6b64\u673a\u4f1a\u953b\u70bc\u81ea\u5df1\u7684 Latex\u6280\u5de7\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS170/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9notes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a13\u6b21\u4e66\u9762\u4f5c\u4e1a\uff0c\u7528Latex\u7f16\u5199","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS170/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS61B/","text":"CS61B: Data Structures and Algorithms \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u4f2f\u514b\u5229CS61\u7cfb\u5217\u7684\u7b2c\u4e8c\u95e8\u8bfe\u7a0b\uff0c\u6ce8\u91cd\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5\u7684\u8bbe\u8ba1\uff0c\u540c\u65f6\u8ba9\u5b66\u751f\u6709\u673a\u4f1a\u63a5\u89e6\u4e0a\u5343\u884c\u7684\u5de5\u7a0b\u4ee3\u7801\uff0c\u901a\u8fc7Java\u521d\u6b65\u9886\u4f1a\u8f6f\u4ef6\u5de5\u7a0b\u7684\u601d\u60f3\u3002 \u6211\u4e0a\u7684\u662f2018\u5e74\u6625\u5b63\u5b66\u671f\u7684\u7248\u672c\uff0c\u8be5\u8bfe\u7684\u5f00\u8bfe\u8001\u5e08Josh Hug\u6559\u6388\u6177\u6168\u5730\u5c06autograder\u5f00\u6e90\u4e86\uff0c\u5927\u5bb6\u53ef\u4ee5\u901a\u8fc7\u7f51\u7ad9\u516c\u5f00\u7684\u9080\u8bf7\u7801\u5728 gradescope \u514d\u8d39\u52a0\u5165\u8bfe\u7a0b\uff0c\u4ece\u800c\u65b9\u4fbf\u5730\u6d4b\u8bc4\u81ea\u5df1\u7684\u4ee3\u7801\u3002 \u8fd9\u95e8\u8bfe\u6240\u6709\u7684\u7f16\u7a0b\u4f5c\u4e1a\u90fd\u662f\u4f7f\u7528Java\u5b8c\u6210\u7684\u3002\u6ca1\u6709Java\u57fa\u7840\u7684\u540c\u5b66\u4e5f\u4e0d\u7528\u62c5\u5fc3\uff0c\u8bfe\u7a0b\u4f1a\u6709\u4fdd\u59c6\u7ea7\u7684\u6559\u7a0b\uff0c\u4eceIDEA\uff08\u4e00\u6b3e\u4e3b\u6d41\u7684Java\u7f16\u7a0b\u73af\u5883\uff09 \u7684\u914d\u7f6e\u8bb2\u8d77\uff0c\u628aJava\u7684\u6838\u5fc3\u8bed\u6cd5\u4e0e\u7279\u6027\u4e8b\u65e0\u5de8\u7ec6\u5730\u8bb2\u6388\uff0c\u5927\u5bb6\u5b8c\u5168\u4e0d\u7528\u62c5\u5fc3\u8ddf\u4e0d\u4e0a\u7684\u95ee\u9898\u3002 \u8fd9\u95e8\u8bfe\u7684\u4f5c\u4e1a\u8d28\u91cf\u4e5f\u662f\u7edd\u7edd\u5b50\u300214\u4e2alab\u4f1a\u8ba9\u4f60\u81ea\u5df1\u5b9e\u73b0\u8bfe\u4e0a\u6240\u8bb2\u7684\u7edd\u5927\u90e8\u5206\u6570\u636e\u7ed3\u6784\uff0c10\u4e2ahomework\u4f1a\u8ba9\u4f60\u8fd0\u7528\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\uff0c \u53e6\u5916\u8fd8\u67093\u4e2aProject\u66f4\u662f\u8ba9\u4f60\u6709\u673a\u4f1a\u63a5\u89e6\u4e0a\u5343\u884c\u7684\u5de5\u7a0b\u4ee3\u7801\uff0c\u5728\u5b9e\u6218\u4e2d\u78e8\u7ec3\u81ea\u5df1\u7684Java\u80fd\u529b\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u6bcf\u5e74\u7565\u6709\u4e0d\u540c\uff0c18\u5e74\u6625\u5b63\u5b66\u671f\u670914\u4e2alab\uff0c10\u4e2ahomework\u4ee5\u53ca3\u4e2aproject\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS61B: Data Structures and Algorithms"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS61B/#cs61b-data-structures-and-algorithms","text":"","title":"CS61B: Data Structures and Algorithms"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS61B/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a60\u5c0f\u65f6 \u4f2f\u514b\u5229CS61\u7cfb\u5217\u7684\u7b2c\u4e8c\u95e8\u8bfe\u7a0b\uff0c\u6ce8\u91cd\u6570\u636e\u7ed3\u6784\u4e0e\u7b97\u6cd5\u7684\u8bbe\u8ba1\uff0c\u540c\u65f6\u8ba9\u5b66\u751f\u6709\u673a\u4f1a\u63a5\u89e6\u4e0a\u5343\u884c\u7684\u5de5\u7a0b\u4ee3\u7801\uff0c\u901a\u8fc7Java\u521d\u6b65\u9886\u4f1a\u8f6f\u4ef6\u5de5\u7a0b\u7684\u601d\u60f3\u3002 \u6211\u4e0a\u7684\u662f2018\u5e74\u6625\u5b63\u5b66\u671f\u7684\u7248\u672c\uff0c\u8be5\u8bfe\u7684\u5f00\u8bfe\u8001\u5e08Josh Hug\u6559\u6388\u6177\u6168\u5730\u5c06autograder\u5f00\u6e90\u4e86\uff0c\u5927\u5bb6\u53ef\u4ee5\u901a\u8fc7\u7f51\u7ad9\u516c\u5f00\u7684\u9080\u8bf7\u7801\u5728 gradescope \u514d\u8d39\u52a0\u5165\u8bfe\u7a0b\uff0c\u4ece\u800c\u65b9\u4fbf\u5730\u6d4b\u8bc4\u81ea\u5df1\u7684\u4ee3\u7801\u3002 \u8fd9\u95e8\u8bfe\u6240\u6709\u7684\u7f16\u7a0b\u4f5c\u4e1a\u90fd\u662f\u4f7f\u7528Java\u5b8c\u6210\u7684\u3002\u6ca1\u6709Java\u57fa\u7840\u7684\u540c\u5b66\u4e5f\u4e0d\u7528\u62c5\u5fc3\uff0c\u8bfe\u7a0b\u4f1a\u6709\u4fdd\u59c6\u7ea7\u7684\u6559\u7a0b\uff0c\u4eceIDEA\uff08\u4e00\u6b3e\u4e3b\u6d41\u7684Java\u7f16\u7a0b\u73af\u5883\uff09 \u7684\u914d\u7f6e\u8bb2\u8d77\uff0c\u628aJava\u7684\u6838\u5fc3\u8bed\u6cd5\u4e0e\u7279\u6027\u4e8b\u65e0\u5de8\u7ec6\u5730\u8bb2\u6388\uff0c\u5927\u5bb6\u5b8c\u5168\u4e0d\u7528\u62c5\u5fc3\u8ddf\u4e0d\u4e0a\u7684\u95ee\u9898\u3002 \u8fd9\u95e8\u8bfe\u7684\u4f5c\u4e1a\u8d28\u91cf\u4e5f\u662f\u7edd\u7edd\u5b50\u300214\u4e2alab\u4f1a\u8ba9\u4f60\u81ea\u5df1\u5b9e\u73b0\u8bfe\u4e0a\u6240\u8bb2\u7684\u7edd\u5927\u90e8\u5206\u6570\u636e\u7ed3\u6784\uff0c10\u4e2ahomework\u4f1a\u8ba9\u4f60\u8fd0\u7528\u6570\u636e\u7ed3\u6784\u548c\u7b97\u6cd5\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\uff0c \u53e6\u5916\u8fd8\u67093\u4e2aProject\u66f4\u662f\u8ba9\u4f60\u6709\u673a\u4f1a\u63a5\u89e6\u4e0a\u5343\u884c\u7684\u5de5\u7a0b\u4ee3\u7801\uff0c\u5728\u5b9e\u6218\u4e2d\u78e8\u7ec3\u81ea\u5df1\u7684Java\u80fd\u529b\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS61B/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u6bcf\u5e74\u7565\u6709\u4e0d\u540c\uff0c18\u5e74\u6625\u5b63\u5b66\u671f\u670914\u4e2alab\uff0c10\u4e2ahomework\u4ee5\u53ca3\u4e2aproject\uff0c\u5177\u4f53\u8981\u6c42\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%E4%B8%8E%E7%AE%97%E6%B3%95/CS61B/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS189/","text":"CS189: Introduction to Machine Learning \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS188, CS70 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u6211\u6ca1\u6709\u7cfb\u7edf\u4e0a\u8fc7\uff0c\u53ea\u662f\u628a\u5b83\u7684\u8bfe\u7a0bnotes\u4f5c\u4e3a\u5de5\u5177\u4e66\u67e5\u9605\u3002\u4e0d\u8fc7\u4ece\u8bfe\u7a0b\u7f51\u7ad9\u4e0a\u6765\u770b\uff0c\u5b83\u6bd4CS229\u597d\u7684\u662f\u5f00\u6e90\u4e86\u6240\u6709homeword\u7684\u4ee3\u7801\u4ee5\u53cagradescope\u7684autograder\u3002\u540c\u6837\uff0c\u8fd9\u95e8\u8bfe\u8bb2\u5f97\u76f8\u5f53\u7406\u8bba\u4e14\u6df1\u5165\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a","title":"UCB CS189: Introduction to Machine Learning"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS189/#cs189-introduction-to-machine-learning","text":"","title":"CS189: Introduction to Machine Learning"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS189/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS188, CS70 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u6211\u6ca1\u6709\u7cfb\u7edf\u4e0a\u8fc7\uff0c\u53ea\u662f\u628a\u5b83\u7684\u8bfe\u7a0bnotes\u4f5c\u4e3a\u5de5\u5177\u4e66\u67e5\u9605\u3002\u4e0d\u8fc7\u4ece\u8bfe\u7a0b\u7f51\u7ad9\u4e0a\u6765\u770b\uff0c\u5b83\u6bd4CS229\u597d\u7684\u662f\u5f00\u6e90\u4e86\u6240\u6709homeword\u7684\u4ee3\u7801\u4ee5\u53cagradescope\u7684autograder\u3002\u540c\u6837\uff0c\u8fd9\u95e8\u8bfe\u8bb2\u5f97\u76f8\u5f53\u7406\u8bba\u4e14\u6df1\u5165\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS189/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS229/","text":"CS229: Machine Learning \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u9ad8\u6570\uff0c\u6982\u7387\u8bba\uff0cPython\uff0c\u9700\u8981\u8f83\u6df1\u539a\u7684\u6570\u5b66\u529f\u5e95 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u540c\u6837\u662f\u5434\u6069\u8fbe\u8bb2\u6388\uff0c\u4f46\u662f\u8fd9\u662f\u4e00\u95e8\u7814\u7a76\u751f\u8bfe\u7a0b\uff0c\u6240\u4ee5\u66f4\u504f\u91cd\u6570\u5b66\u7406\u8bba\uff0c\u4e0d\u6ee1\u8db3\u4e8e\u8c03\u5305\u800c\u60f3\u6df1\u5165\u7406\u89e3\u7b97\u6cd5\u672c\u8d28\uff0c\u6216\u8005\u6709\u5fd7\u4e8e\u4ece\u4e8b\u673a\u5668\u5b66\u4e60\u7406\u8bba\u7814\u7a76\u7684\u540c\u5b66\u53ef\u4ee5\u5b66\u4e60\u8fd9\u95e8\u8bfe\u7a0b\u3002\u8bfe\u7a0b\u7f51\u7ad9\u4e0a\u63d0\u4f9b\u4e86\u6240\u6709\u7684\u8bfe\u7a0bnotes\uff0c\u5199\u5f97\u975e\u5e38\u4e13\u4e1a\u4e14\u7406\u8bba\uff0c\u9700\u8981\u4e00\u5b9a\u7684\u6570\u5b66\u529f\u5e95\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0\uff0c\u8bfe\u7a0bnotes\u5199\u5f97\u975e\u5e38\u597d \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u4e0d\u5bf9\u516c\u4f17\u5f00\u653e \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Stanford CS229: Machine Learning"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS229/#cs229-machine-learning","text":"","title":"CS229: Machine Learning"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS229/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u9ad8\u6570\uff0c\u6982\u7387\u8bba\uff0cPython\uff0c\u9700\u8981\u8f83\u6df1\u539a\u7684\u6570\u5b66\u529f\u5e95 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u540c\u6837\u662f\u5434\u6069\u8fbe\u8bb2\u6388\uff0c\u4f46\u662f\u8fd9\u662f\u4e00\u95e8\u7814\u7a76\u751f\u8bfe\u7a0b\uff0c\u6240\u4ee5\u66f4\u504f\u91cd\u6570\u5b66\u7406\u8bba\uff0c\u4e0d\u6ee1\u8db3\u4e8e\u8c03\u5305\u800c\u60f3\u6df1\u5165\u7406\u89e3\u7b97\u6cd5\u672c\u8d28\uff0c\u6216\u8005\u6709\u5fd7\u4e8e\u4ece\u4e8b\u673a\u5668\u5b66\u4e60\u7406\u8bba\u7814\u7a76\u7684\u540c\u5b66\u53ef\u4ee5\u5b66\u4e60\u8fd9\u95e8\u8bfe\u7a0b\u3002\u8bfe\u7a0b\u7f51\u7ad9\u4e0a\u63d0\u4f9b\u4e86\u6240\u6709\u7684\u8bfe\u7a0bnotes\uff0c\u5199\u5f97\u975e\u5e38\u4e13\u4e1a\u4e14\u7406\u8bba\uff0c\u9700\u8981\u4e00\u5b9a\u7684\u6570\u5b66\u529f\u5e95\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS229/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0\uff0c\u8bfe\u7a0bnotes\u5199\u5f97\u975e\u5e38\u597d \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u4e0d\u5bf9\u516c\u4f17\u5f00\u653e","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/CS229/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/ML/","text":"Coursera: Machine Learning \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1aAI\u5165\u95e8 + \u719f\u7ec3\u4f7f\u7528Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8bf4\u8d77\u5434\u6069\u8fbe\uff0c\u5728AI\u5c4a\u5e94\u8be5\u65e0\u4eba\u4e0d\u6653\u3002\u4ed6\u662f\u8457\u540d\u5728\u7ebf\u6559\u80b2\u5e73\u53f0 Coursera \u7684\u521b\u59cb\u4eba\u4e4b\u4e00\uff0c\u540c\u65f6\u4e5f\u662fStanford\u7684\u7f51\u7ea2\u6559\u6388\u3002\u8fd9\u95e8\u673a\u5668\u5b66\u4e60\u5165\u95e8\u8bfe\u5e94\u8be5\u7b97\u5f97\u4e0a\u662f\u4ed6\u7684\u6210\u540d\u4f5c\u4e4b\u4e00\uff08\u53e6\u4e00\u4e2a\u662f\u6df1\u5ea6\u5b66\u4e60\u8bfe\u7a0b\uff09\uff0c\u5728Coursera\u4e0a\u62e5\u6709\u6570\u5341\u4e07\u7684\u5b66\u4e60\u8005\uff08\u6ce8\u610f\u8fd9\u662f\u82b1\u94b1\u4e70\u4e86\u8bc1\u4e66\u7684\u4eba\uff0c\u4e00\u4e2a\u8bc1\u4e66\u51e0\u767e\u5200\uff09\uff0c\u767d\u5ad6\u5b66\u4e60\u8005\u6570\u91cf\u5e94\u8be5\u662f\u53e6\u4e00\u4e2a\u6570\u91cf\u7ea7\u4e86\u3002 \u8fd9\u95e8\u8bfe\u5bf9\u65b0\u624b\u6781\u5176\u53cb\u597d\uff0c\u5434\u6069\u8fbe\u62e5\u6709\u628a\u673a\u5668\u5b66\u4e60\u8bb2\u62101+1=2\u4e00\u6837\u76f4\u767d\u7684\u80fd\u529b\u3002\u4f60\u5c06\u4f1a\u5b66\u4e60\u5230\u7ebf\u6027\u56de\u5f52\u3001\u903b\u8f91\u56de\u5f52\u3001\u652f\u6301\u5411\u91cf\u673a\u3001\u65e0\u76d1\u7763\u5b66\u4e60\u3001\u964d\u7ef4\u3001\u5f02\u5e38\u68c0\u6d4b\u548c\u63a8\u8350\u7cfb\u7edf\u7b49\u7b49\u77e5\u8bc6\uff0c\u5e76\u4e14\u5728\u7f16\u7a0b\u5b9e\u8df5\u4e2d\u592f\u5b9e\u81ea\u5df1\u7684\u7406\u89e3\u3002\u4f5c\u4e1a\u8d28\u91cf\u81ea\u7136\u4e0d\u5fc5\u591a\u8a00\uff0c\u4fdd\u59c6\u7ea7\u4ee3\u7801\u6846\u67b6\uff0c\u4f5c\u4e1a\u80cc\u666f\u4e5f\u591a\u53d6\u81ea\u751f\u6d3b\uff0c\u8ba9\u4eba\u5b66\u4ee5\u81f4\u7528\u3002 \u5f53\u7136\uff0c\u8fd9\u95e8\u8bfe\u4f5c\u4e3a\u4e00\u4e2a\u516c\u5f00\u6155\u8bfe\uff0c\u96be\u5ea6\u4e0a\u523b\u610f\u653e\u4f4e\u4e86\u4e9b\uff0c\u5f88\u591a\u6570\u5b66\u63a8\u5bfc\u5927\u591a\u4e00\u5e26\u800c\u8fc7\uff0c\u5982\u679c\u4f60\u6709\u5fd7\u4e8e\u4ece\u4e8b\u673a\u5668\u5b66\u4e60\u7406\u8bba\u7814\u7a76\uff0c\u60f3\u8981\u6df1\u7a76\u8fd9\u4e9b\u7b97\u6cd5\u80cc\u540e\u7684\u6570\u5b66\u7406\u8bba\uff0c\u53ef\u4ee5\u53c2\u8003 CS229 \u548c CS189 \u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8d44\u6e90\u6c47\u603b \u5f53\u65f6\u91cd\u88c5\u7cfb\u7edf\u8bef\u5220\u4e86\u6587\u4ef6\uff0c\u6211\u7684\u4ee3\u7801\u5b9e\u73b0\u6d88\u5931\u5728\u4e86\u78c1\u76d8\u768401\u4e32\u4e2d\u3002\u4e0d\u8fc7\u8fd9\u95e8\u8bfe\u7531\u4e8e\u592a\u8fc7\u51fa\u540d\uff0c\u7f51\u4e0a\u60f3\u641c\u4e0d\u5230\u7b54\u6848\u90fd\u96be\uff0c\u76f8\u5173\u8bfe\u7a0b\u8d44\u6599Coursera\u4e0a\u4e5f\u4e00\u5e94\u4ff1\u5168\u3002","title":"Coursera: Machine Learning"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/ML/#coursera-machine-learning","text":"","title":"Coursera: Machine Learning"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/ML/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1aAI\u5165\u95e8 + \u719f\u7ec3\u4f7f\u7528Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8bf4\u8d77\u5434\u6069\u8fbe\uff0c\u5728AI\u5c4a\u5e94\u8be5\u65e0\u4eba\u4e0d\u6653\u3002\u4ed6\u662f\u8457\u540d\u5728\u7ebf\u6559\u80b2\u5e73\u53f0 Coursera \u7684\u521b\u59cb\u4eba\u4e4b\u4e00\uff0c\u540c\u65f6\u4e5f\u662fStanford\u7684\u7f51\u7ea2\u6559\u6388\u3002\u8fd9\u95e8\u673a\u5668\u5b66\u4e60\u5165\u95e8\u8bfe\u5e94\u8be5\u7b97\u5f97\u4e0a\u662f\u4ed6\u7684\u6210\u540d\u4f5c\u4e4b\u4e00\uff08\u53e6\u4e00\u4e2a\u662f\u6df1\u5ea6\u5b66\u4e60\u8bfe\u7a0b\uff09\uff0c\u5728Coursera\u4e0a\u62e5\u6709\u6570\u5341\u4e07\u7684\u5b66\u4e60\u8005\uff08\u6ce8\u610f\u8fd9\u662f\u82b1\u94b1\u4e70\u4e86\u8bc1\u4e66\u7684\u4eba\uff0c\u4e00\u4e2a\u8bc1\u4e66\u51e0\u767e\u5200\uff09\uff0c\u767d\u5ad6\u5b66\u4e60\u8005\u6570\u91cf\u5e94\u8be5\u662f\u53e6\u4e00\u4e2a\u6570\u91cf\u7ea7\u4e86\u3002 \u8fd9\u95e8\u8bfe\u5bf9\u65b0\u624b\u6781\u5176\u53cb\u597d\uff0c\u5434\u6069\u8fbe\u62e5\u6709\u628a\u673a\u5668\u5b66\u4e60\u8bb2\u62101+1=2\u4e00\u6837\u76f4\u767d\u7684\u80fd\u529b\u3002\u4f60\u5c06\u4f1a\u5b66\u4e60\u5230\u7ebf\u6027\u56de\u5f52\u3001\u903b\u8f91\u56de\u5f52\u3001\u652f\u6301\u5411\u91cf\u673a\u3001\u65e0\u76d1\u7763\u5b66\u4e60\u3001\u964d\u7ef4\u3001\u5f02\u5e38\u68c0\u6d4b\u548c\u63a8\u8350\u7cfb\u7edf\u7b49\u7b49\u77e5\u8bc6\uff0c\u5e76\u4e14\u5728\u7f16\u7a0b\u5b9e\u8df5\u4e2d\u592f\u5b9e\u81ea\u5df1\u7684\u7406\u89e3\u3002\u4f5c\u4e1a\u8d28\u91cf\u81ea\u7136\u4e0d\u5fc5\u591a\u8a00\uff0c\u4fdd\u59c6\u7ea7\u4ee3\u7801\u6846\u67b6\uff0c\u4f5c\u4e1a\u80cc\u666f\u4e5f\u591a\u53d6\u81ea\u751f\u6d3b\uff0c\u8ba9\u4eba\u5b66\u4ee5\u81f4\u7528\u3002 \u5f53\u7136\uff0c\u8fd9\u95e8\u8bfe\u4f5c\u4e3a\u4e00\u4e2a\u516c\u5f00\u6155\u8bfe\uff0c\u96be\u5ea6\u4e0a\u523b\u610f\u653e\u4f4e\u4e86\u4e9b\uff0c\u5f88\u591a\u6570\u5b66\u63a8\u5bfc\u5927\u591a\u4e00\u5e26\u800c\u8fc7\uff0c\u5982\u679c\u4f60\u6709\u5fd7\u4e8e\u4ece\u4e8b\u673a\u5668\u5b66\u4e60\u7406\u8bba\u7814\u7a76\uff0c\u60f3\u8981\u6df1\u7a76\u8fd9\u4e9b\u7b97\u6cd5\u80cc\u540e\u7684\u6570\u5b66\u7406\u8bba\uff0c\u53ef\u4ee5\u53c2\u8003 CS229 \u548c CS189 \u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/ML/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0/ML/#_3","text":"\u5f53\u65f6\u91cd\u88c5\u7cfb\u7edf\u8bef\u5220\u4e86\u6587\u4ef6\uff0c\u6211\u7684\u4ee3\u7801\u5b9e\u73b0\u6d88\u5931\u5728\u4e86\u78c1\u76d8\u768401\u4e32\u4e2d\u3002\u4e0d\u8fc7\u8fd9\u95e8\u8bfe\u7531\u4e8e\u592a\u8fc7\u51fa\u540d\uff0c\u7f51\u4e0a\u60f3\u641c\u4e0d\u5230\u7b54\u6848\u90fd\u96be\uff0c\u76f8\u5173\u8bfe\u7a0b\u8d44\u6599Coursera\u4e0a\u4e5f\u4e00\u5e94\u4ff1\u5168\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/CMU10-708/","text":"CMU 10-708: Probabilistic Graphical Models \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aCMU \u5148\u4fee\u8981\u6c42\uff1aMachine Learning, Deep Learning, Reinforcement Learning \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttps://sailinglab.github.io/pgm-spring-2019/ \u8fd9\u4e2a\u7f51\u7ad9\u5305\u542b\u4e86\u6240\u6709\u7684\u8d44\u6e90\uff1aslides, nots, video, homework, project \u8fd9\u95e8\u8bfe\u7a0b\u662f CMU \u7684\u56fe\u6a21\u578b\u57fa\u7840 + \u8fdb\u9636\u8bfe\uff0c\u6388\u8bfe\u8001\u5e08\u4e3a Eric P. Xing\uff0c\u6db5\u76d6\u4e86\u56fe\u6a21\u578b\u57fa\u7840\uff0c\u4e0e\u795e\u7ecf\u7f51\u7edc\u7684\u7ed3\u5408\uff0c\u5728\u5f3a\u5316\u5b66\u4e60\u4e2d\u7684\u5e94\u7528\uff0c\u4ee5\u53ca\u975e\u53c2\u6570\u65b9\u6cd5\u3002\u76f8\u5f53\u786c\u6838","title":"CMU 10-708: Probabilistic Graphical Models"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/CMU10-708/#cmu-10-708-probabilistic-graphical-models","text":"","title":"CMU 10-708: Probabilistic Graphical Models"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/CMU10-708/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aCMU \u5148\u4fee\u8981\u6c42\uff1aMachine Learning, Deep Learning, Reinforcement Learning \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttps://sailinglab.github.io/pgm-spring-2019/ \u8fd9\u4e2a\u7f51\u7ad9\u5305\u542b\u4e86\u6240\u6709\u7684\u8d44\u6e90\uff1aslides, nots, video, homework, project \u8fd9\u95e8\u8bfe\u7a0b\u662f CMU \u7684\u56fe\u6a21\u578b\u57fa\u7840 + \u8fdb\u9636\u8bfe\uff0c\u6388\u8bfe\u8001\u5e08\u4e3a Eric P. Xing\uff0c\u6db5\u76d6\u4e86\u56fe\u6a21\u578b\u57fa\u7840\uff0c\u4e0e\u795e\u7ecf\u7f51\u7edc\u7684\u7ed3\u5408\uff0c\u5728\u5f3a\u5316\u5b66\u4e60\u4e2d\u7684\u5e94\u7528\uff0c\u4ee5\u53ca\u975e\u53c2\u6570\u65b9\u6cd5\u3002\u76f8\u5f53\u786c\u6838","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/CS229M/","text":"STATS214 / CS229M: Machine Learning Theory \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1aMachine Learning, Deep Learning, Statistics \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttp://web.stanford.edu/class/stats214/ \u7ecf\u5178\u5b66\u4e60\u7406\u8bba + \u6700\u65b0\u6df1\u5ea6\u5b66\u4e60\u7406\u8bba\uff0c\u975e\u5e38\u786c\u6838\u3002\u6388\u8bfe\u8001\u5e08\u4e4b\u524d\u662f Percy Liang\uff0c\u73b0\u5728\u662f Tengyu Ma","title":"Stanford STATS214 / CS229M: Machine Learning Theory"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/CS229M/#stats214-cs229m-machine-learning-theory","text":"","title":"STATS214 / CS229M: Machine Learning Theory"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/CS229M/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1aMachine Learning, Deep Learning, Statistics \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttp://web.stanford.edu/class/stats214/ \u7ecf\u5178\u5b66\u4e60\u7406\u8bba + \u6700\u65b0\u6df1\u5ea6\u5b66\u4e60\u7406\u8bba\uff0c\u975e\u5e38\u786c\u6838\u3002\u6388\u8bfe\u8001\u5e08\u4e4b\u524d\u662f Percy Liang\uff0c\u73b0\u5728\u662f Tengyu Ma","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/STA4273/","text":"STA 4273 Winter 2021: Minimizing Expectations \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aU Toronto \u5148\u4fee\u8981\u6c42\uff1aBayesian Inference, Reinforcement Learning \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttps://www.cs.toronto.edu/~cmaddis/courses/sta4273_w21/ \u8fd9\u662f\u4e00\u95e8\u8f83\u4e3a\u8fdb\u9636\u7684 Ph.D. \u7814\u7a76\u8bfe\u7a0b\uff0c\u6838\u5fc3\u5185\u5bb9\u662f inference \u548c control \u4e4b\u95f4\u7684\u5173\u7cfb\u3002\u6388\u8bfe\u8001\u5e08\u4e3a Chris Maddison (AlphaGo founding member, NeurIPS 14 best paper)","title":"U Toronto STA 4273 Winter 2021: Minimizing Expectations"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/STA4273/#sta-4273-winter-2021-minimizing-expectations","text":"","title":"STA 4273 Winter 2021: Minimizing Expectations"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/STA4273/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aU Toronto \u5148\u4fee\u8981\u6c42\uff1aBayesian Inference, Reinforcement Learning \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttps://www.cs.toronto.edu/~cmaddis/courses/sta4273_w21/ \u8fd9\u662f\u4e00\u95e8\u8f83\u4e3a\u8fdb\u9636\u7684 Ph.D. \u7814\u7a76\u8bfe\u7a0b\uff0c\u6838\u5fc3\u5185\u5bb9\u662f inference \u548c control \u4e4b\u95f4\u7684\u5173\u7cfb\u3002\u6388\u8bfe\u8001\u5e08\u4e3a Chris Maddison (AlphaGo founding member, NeurIPS 14 best paper)","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/STAT8201/","text":"Columbia STAT 8201: Deep Generative Models \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aColumbia University \u5148\u4fee\u8981\u6c42\uff1aMachine Learning, Deep Learning, Graphical Models \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttp://stat.columbia.edu/~cunningham/teaching/GR8201/ \u8fd9\u95e8\u8bfe\u662f\u4e00\u95e8 PhD \u8ba8\u8bba\u73ed\uff0c\u6bcf\u5468\u7684\u5185\u5bb9\u662f\u5c55\u793a + \u8ba8\u8bba\u8bba\u6587\uff0c\u6388\u8bfe\u8001\u5e08\u662f John Cunningham\u3002Deep Generative Models \uff08\u6df1\u5ea6\u751f\u6210\u6a21\u578b\uff09 \u662f\u56fe\u6a21\u578b\u4e0e\u795e\u7ecf\u7f51\u7edc\u7684\u7ed3\u5408\uff0c\u4e5f\u662f\u73b0\u4ee3\u673a\u5668\u5b66\u4e60\u6700\u91cd\u8981\u7684\u65b9\u5411\u4e4b\u4e00","title":"Columbia STAT 8201: Deep Generative Models"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/STAT8201/#columbia-stat-8201-deep-generative-models","text":"","title":"Columbia STAT 8201: Deep Generative Models"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/STAT8201/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aColumbia University \u5148\u4fee\u8981\u6c42\uff1aMachine Learning, Deep Learning, Graphical Models \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u8bfe\u7a0b\u7f51\u7ad9\uff1ahttp://stat.columbia.edu/~cunningham/teaching/GR8201/ \u8fd9\u95e8\u8bfe\u662f\u4e00\u95e8 PhD \u8ba8\u8bba\u73ed\uff0c\u6bcf\u5468\u7684\u5185\u5bb9\u662f\u5c55\u793a + \u8ba8\u8bba\u8bba\u6587\uff0c\u6388\u8bfe\u8001\u5e08\u662f John Cunningham\u3002Deep Generative Models \uff08\u6df1\u5ea6\u751f\u6210\u6a21\u578b\uff09 \u662f\u56fe\u6a21\u578b\u4e0e\u795e\u7ecf\u7f51\u7edc\u7684\u7ed3\u5408\uff0c\u4e5f\u662f\u73b0\u4ee3\u673a\u5668\u5b66\u4e60\u6700\u91cd\u8981\u7684\u65b9\u5411\u4e4b\u4e00","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/","text":"\u673a\u5668\u5b66\u4e60\u8fdb\u9636 \u6b64\u8def\u7ebf\u56fe\u9002\u7528\u4e8e\u5df2\u7ecf\u5b66\u8fc7\u4e86\u57fa\u7840\u673a\u5668\u5b66\u4e60 (ML, NLP, CV, RL) \u7684\u540c\u5b66 (\u9ad8\u5e74\u7ea7\u672c\u79d1\u751f\u6216\u4f4e\u5e74\u7ea7\u7814\u7a76\u751f)\uff0c\u5df2\u7ecf\u53d1\u8868\u8fc7\u81f3\u5c11\u4e00\u7bc7\u9876\u4f1a\u8bba\u6587 (NeurIPS, ICML, ICLR, ACL, EMNLP, NAACL, CVPR, ICCV) \u60f3\u8981\u8d70\u673a\u5668\u5b66\u4e60\u79d1\u7814\u8def\u7ebf\u7684\u9009\u624b\u3002 \u6b64\u8def\u7ebf\u7684\u76ee\u6807\u662f\u4e3a\u8bfb\u61c2\u4e0e\u53d1\u8868\u673a\u5668\u5b66\u4e60\u9876\u4f1a\u8bba\u6587\u6253\u4e0b\u7406\u8bba\u57fa\u7840\uff0c\u7279\u522b\u662f Probabilistic Methods \u8fd9\u4e2a track \u4e0b\u7684\u6587\u7ae0 \u673a\u5668\u5b66\u4e60\u8fdb\u9636\u53ef\u80fd\u5b58\u5728\u591a\u79cd\u4e0d\u540c\u7684\u5b66\u4e60\u8def\u7ebf\uff0c\u6b64\u8def\u7ebf\u53ea\u80fd\u4ee3\u8868\u4f5c\u8005 Yao Fu \u6240\u7406\u89e3\u7684\u6700\u4f73\u8def\u5f84\uff0c\u4fa7\u91cd\u4e8e\u8d1d\u53f6\u65af\u5b66\u6d3e\u4e0b\u7684\u6982\u7387\u5efa\u6a21\u65b9\u6cd5\uff0c\u4e5f\u4f1a\u6d89\u53ca\u5230\u5404\u9879\u76f8\u5173\u5b66\u79d1\u7684\u4ea4\u53c9\u77e5\u8bc6\u3002 \u5fc5\u8bfb\u6559\u6750 PRML: Pattern Recognition and Machine Learning. Christopher Bishop \u7ecf\u5178\u8d1d\u53f6\u65af\u5b66\u6d3e\u6559\u6750 AoS: All of Statistics. Larry Wasserman \u7ecf\u5178\u9891\u7387\u5b66\u6d3e\u6559\u6750 \u6240\u4ee5\u8fd9\u4e24\u672c\u4e66\u521a\u597d\u76f8\u8f85\u76f8\u6210 \u5b57\u5178 MLAPP: Machine Learning: A Probabilistic Perspective. Kevin Murphy Convex Optimization. Stephen Boyd and Lieven Vandenberghe \u8fdb\u9636\u4e66\u7c4d W&J: Graphical Models, Exponential Families, and Variational Inference. Martin Wainwright and Michael Jordan Theory of Point Estimation. E. L. Lehmann and George Casella \u5982\u4f55\u9605\u8bfb Guidelines \u5fc5\u8bfb\u6559\u6750\u5c31\u662f\u4e00\u5b9a\u8981\u8bfb\u7684\u6559\u6750 \u5b57\u5178\u7684\u610f\u601d\u662f\uff0c\u4e00\u822c\u60c5\u51b5\u4e0b\u4e0d\u7ba1\u5b83\uff0c\u4f46\u5f53\u9047\u5230\u4e86\u4e0d\u61c2\u7684\u6982\u5ff5\u7684\u65f6\u5019\uff0c\u5c31\u53bb\u5b57\u5178\u91cc\u9762\u67e5\uff08\u800c\u4e0d\u662f\u7ef4\u57fa\u767e\u79d1\uff09 \u8fdb\u9636\u4e66\u7c4d\u5148\u4e0d\u8bfb\uff0c\u5148\u8bfb\u5b8c\u5fc5\u8bfb\u4e66\u7c4d\u3002\u5fc5\u8bfb\u4e66\u7c4d\u4e00\u822c\u90fd\u662f\u8981\u524d\u524d\u540e\u540e\u53cd\u590d\u770b\u8fc7 N \u904d\u624d\u7b97\u8bfb\u5b8c \u8bfb\u7684\u8fc7\u7a0b\u4e2d\uff0c\u6700\u91cd\u8981\u7684\u8bfb\u6cd5\u5c31\u662f\u5bf9\u6bd4\u9605\u8bfb (contrastive-comparative reading)\uff1a\u540c\u65f6\u6253\u5f00\u4e24\u672c\u4e66\u8bb2\u540c\u4e00\u4e3b\u9898\u7684\u7ae0\u8282\uff0c\u7136\u540e\u5bf9\u6bd4\u76f8\u540c\u70b9\u548c\u4e0d\u540c\u70b9\u548c\u8054\u7cfb \u8bfb\u7684\u8fc7\u7a0b\u4e2d\uff0c\u5c3d\u91cf\u53bb\u56de\u60f3\u4e4b\u524d\u8bfb\u8fc7\u7684\u8bba\u6587\uff0c\u6bd4\u8f83\u8bba\u6587\u548c\u6559\u6750\u7684\u76f8\u540c\u70b9\u4e0e\u4e0d\u540c\u70b9 \u57fa\u7840\u8def\u5f84 \u5148\u8bfb AoS \u7b2c\u516d\u7ae0: Models, Statistical Inference and Learning\uff0c\u8fd9\u4e00\u90e8\u5206\u662f\u6700\u57fa\u7840\u7684\u79d1\u666e \u7136\u540e\u8bfb PRML \u7b2c 10, 11 \u7ae0 \u7b2c 10 \u7ae0\u7684\u5185\u5bb9\u662f Variational Inference, \u7b2c 11 \u7ae0\u7684\u5185\u5bb9\u662f MCMC, \u8fd9\u4e24\u79cd\u65b9\u6cd5\u662f\u8d1d\u53f6\u65af\u63a8\u65ad\u7684\u4e24\u6761\u6700\u4e3b\u8981\u8def\u7ebf \u5982\u679c\u5728\u8bfb PRML \u7684\u8fc7\u7a0b\u4e2d\u53d1\u73b0\u6709\u4efb\u4f55\u4e0d\u61c2\u7684\u540d\u8bcd\uff0c\u5c31\u53bb\u7ffb\u524d\u9762\u7684\u7ae0\u8282\u3002\u5f88\u5927\u6982\u7387\u80fd\u591f\u5728\u7b2c 3\uff0c4 \u7ae0\u627e\u5230\u76f8\u5bf9\u5e94\u7684\u5b9a\u4e49\uff1b\u5982\u679c\u627e\u4e0d\u5230\u6216\u8005\u4e0d\u591f\u8be6\u7ec6\uff0c\u5c31\u53bb\u67e5 MLAPP AoS \u7b2c 8 \u7ae0 (Parametric Inference) \u548c\u7b2c 11 \u7ae0 (Bayesian Inference) \u4e5f\u53ef\u4ee5\u4f5c\u4e3a\u53c2\u8003\u3002\u6700\u597d\u7684\u65b9\u6cd5\u662f\u591a\u672c\u4e66\u5bf9\u6bd4\u9605\u8bfb\uff0c\u6d41\u7a0b\u5982\u4e0b \u5047\u8bbe\u6211\u5728\u8bfb PRML \u7b2c 10 \u7ae0\u7684\u65f6\u5019\u53d1\u73b0\u4e86\u4e00\u4e2a\u4e0d\u61c2\u7684\u8bcd\uff1aposterior inference \u4e8e\u662f\u6211\u5f80\u524d\u7ffb\uff0c\u7ffb\u5230\u4e86\u7b2c 3 \u7ae0 (Linear Model for Regression)\uff0c\u770b\u5230\u4e86\u6700\u7b80\u5355\u7684 posterior \u7136\u540e\u6211\u63a5\u7740\u7ffb AoS\uff0c\u7ffb\u5230\u4e86\u7b2c 11 \u7ae0\uff0c\u4e5f\u6709\u5bf9 posterior \u7684\u63cf\u8ff0 \u7136\u540e\u6211\u5bf9\u6bd4 PRML \u7b2c 10 \u7ae0\uff0c\u7b2c 3 \u7ae0\uff0cAoS \u7b2c 11 \u7ae0\uff0c\u4e09\u5904\u4e0d\u540c\u5730\u65b9\u5bf9 posterior \u7684\u89e3\u8bfb\uff0c\u6bd4\u8f83\u5176\u76f8\u540c\u70b9\u548c\u4e0d\u540c\u70b9\u548c\u8054\u7cfb \u8bfb\u5b8c PRML \u7b2c 10 \u548c 11 \u7ae0\u4e4b\u540e\uff0c\u63a5\u7740\u8bfb AoS \u7b2c 24 \u7ae0 (Simulation Methods)\uff0c\u7136\u540e\u628a\u5b83\u548c PRML \u7b2c 11 \u7ae0\u5bf9\u6bd4\u9605\u8bfb -- \u8fd9\u4fe9\u90fd\u662f\u8bb2 MCMC \u5982\u679c\u5230\u6b64\u5904\u53d1\u73b0\u8fd8\u6709\u57fa\u7840\u6982\u5ff5\u8bfb\u4e0d\u61c2\uff0c\u5c31\u56de\u5230 PRML \u7b2c 3 \u7ae0\uff0c\u628a\u5b83\u548c AoS \u7b2c 11 \u7ae0\u5bf9\u6bd4\u9605\u8bfb Again\uff0c\u5bf9\u6bd4\u9605\u8bfb\u975e\u5e38\u91cd\u8981\uff0c\u4e00\u5b9a\u8981\u628a\u4e0d\u540c\u672c\u4e66\u7684\u7c7b\u4f3c\u5185\u5bb9\u540c\u65f6\u6446\u5728\u9762\u524d\u76f8\u4e92\u5bf9\u6bd4\uff0c\u8fd9\u6837\u53ef\u4ee5\u663e\u8457\u589e\u5f3a\u8bb0\u5fc6 \u7136\u540e\u8bfb PRML \u7b2c 13 \u7ae0\uff08\u8df3\u8fc7\u7b2c 12 \u7ae0\uff09\uff0c\u8fd9\u4e00\u7ae0\u53ef\u4ee5\u548c MLAPP \u7684\u7b2c 17, 18 \u7ae0\u5bf9\u6bd4\u9605\u8bfb MLAPP \u7b2c 17 \u7ae0\u662f PRML \u7b2c 13.2 \u7ae0\u7684\u8be6\u7ec6\u7248\uff0c\u4e3b\u8981\u8bb2 HMM MLAPP \u7b2c 18 \u7ae0\u662f PRML \u7b2c 13.3 \u7ae0\u7684\u8be6\u7ec6\u7248\uff0c\u4e3b\u8981\u8bb2 LDS \u8bfb\u5b8c PRML \u7b2c 13 \u7ae0\u4e4b\u540e\uff0c\u518d\u53bb\u8bfb PRML \u7b2c 8 \u7ae0 (Graphical Models) -- \u6b64\u65f6\u8fd9\u90e8\u5206\u5e94\u8be5\u4f1a\u8bfb\u5f97\u5f88\u8f7b\u677e \u4ee5\u4e0a\u7684\u5185\u5bb9\u53ef\u4ee5\u8fdb\u4e00\u6b65\u5bf9\u7167 CMU 10-708 PGM \u8bfe\u7a0b\u6750\u6599 \u5230\u76ee\u524d\u4e3a\u6b62\uff0c\u5e94\u8be5\u80fd\u591f\u638c\u63e1 - \u6982\u7387\u6a21\u578b\u7684\u57fa\u7840\u5b9a\u4e49 - \u7cbe\u51c6\u63a8\u65ad - Sum-Product - \u8fd1\u4f3c\u63a8\u65ad - MCMC - \u8fd1\u4f3c\u63a8\u65ad - VI \u7136\u540e\u5c31\u53ef\u4ee5\u53bb\u505a\u66f4\u8fdb\u9636\u7684\u5185\u5bb9","title":"\u8fdb\u9636\u8def\u7ebf\u56fe"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/#_1","text":"\u6b64\u8def\u7ebf\u56fe\u9002\u7528\u4e8e\u5df2\u7ecf\u5b66\u8fc7\u4e86\u57fa\u7840\u673a\u5668\u5b66\u4e60 (ML, NLP, CV, RL) \u7684\u540c\u5b66 (\u9ad8\u5e74\u7ea7\u672c\u79d1\u751f\u6216\u4f4e\u5e74\u7ea7\u7814\u7a76\u751f)\uff0c\u5df2\u7ecf\u53d1\u8868\u8fc7\u81f3\u5c11\u4e00\u7bc7\u9876\u4f1a\u8bba\u6587 (NeurIPS, ICML, ICLR, ACL, EMNLP, NAACL, CVPR, ICCV) \u60f3\u8981\u8d70\u673a\u5668\u5b66\u4e60\u79d1\u7814\u8def\u7ebf\u7684\u9009\u624b\u3002 \u6b64\u8def\u7ebf\u7684\u76ee\u6807\u662f\u4e3a\u8bfb\u61c2\u4e0e\u53d1\u8868\u673a\u5668\u5b66\u4e60\u9876\u4f1a\u8bba\u6587\u6253\u4e0b\u7406\u8bba\u57fa\u7840\uff0c\u7279\u522b\u662f Probabilistic Methods \u8fd9\u4e2a track \u4e0b\u7684\u6587\u7ae0 \u673a\u5668\u5b66\u4e60\u8fdb\u9636\u53ef\u80fd\u5b58\u5728\u591a\u79cd\u4e0d\u540c\u7684\u5b66\u4e60\u8def\u7ebf\uff0c\u6b64\u8def\u7ebf\u53ea\u80fd\u4ee3\u8868\u4f5c\u8005 Yao Fu \u6240\u7406\u89e3\u7684\u6700\u4f73\u8def\u5f84\uff0c\u4fa7\u91cd\u4e8e\u8d1d\u53f6\u65af\u5b66\u6d3e\u4e0b\u7684\u6982\u7387\u5efa\u6a21\u65b9\u6cd5\uff0c\u4e5f\u4f1a\u6d89\u53ca\u5230\u5404\u9879\u76f8\u5173\u5b66\u79d1\u7684\u4ea4\u53c9\u77e5\u8bc6\u3002","title":"\u673a\u5668\u5b66\u4e60\u8fdb\u9636"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/#_2","text":"PRML: Pattern Recognition and Machine Learning. Christopher Bishop \u7ecf\u5178\u8d1d\u53f6\u65af\u5b66\u6d3e\u6559\u6750 AoS: All of Statistics. Larry Wasserman \u7ecf\u5178\u9891\u7387\u5b66\u6d3e\u6559\u6750 \u6240\u4ee5\u8fd9\u4e24\u672c\u4e66\u521a\u597d\u76f8\u8f85\u76f8\u6210","title":"\u5fc5\u8bfb\u6559\u6750"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/#_3","text":"MLAPP: Machine Learning: A Probabilistic Perspective. Kevin Murphy Convex Optimization. Stephen Boyd and Lieven Vandenberghe","title":"\u5b57\u5178"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/#_4","text":"W&J: Graphical Models, Exponential Families, and Variational Inference. Martin Wainwright and Michael Jordan Theory of Point Estimation. E. L. Lehmann and George Casella","title":"\u8fdb\u9636\u4e66\u7c4d"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/#_5","text":"","title":"\u5982\u4f55\u9605\u8bfb"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/#guidelines","text":"\u5fc5\u8bfb\u6559\u6750\u5c31\u662f\u4e00\u5b9a\u8981\u8bfb\u7684\u6559\u6750 \u5b57\u5178\u7684\u610f\u601d\u662f\uff0c\u4e00\u822c\u60c5\u51b5\u4e0b\u4e0d\u7ba1\u5b83\uff0c\u4f46\u5f53\u9047\u5230\u4e86\u4e0d\u61c2\u7684\u6982\u5ff5\u7684\u65f6\u5019\uff0c\u5c31\u53bb\u5b57\u5178\u91cc\u9762\u67e5\uff08\u800c\u4e0d\u662f\u7ef4\u57fa\u767e\u79d1\uff09 \u8fdb\u9636\u4e66\u7c4d\u5148\u4e0d\u8bfb\uff0c\u5148\u8bfb\u5b8c\u5fc5\u8bfb\u4e66\u7c4d\u3002\u5fc5\u8bfb\u4e66\u7c4d\u4e00\u822c\u90fd\u662f\u8981\u524d\u524d\u540e\u540e\u53cd\u590d\u770b\u8fc7 N \u904d\u624d\u7b97\u8bfb\u5b8c \u8bfb\u7684\u8fc7\u7a0b\u4e2d\uff0c\u6700\u91cd\u8981\u7684\u8bfb\u6cd5\u5c31\u662f\u5bf9\u6bd4\u9605\u8bfb (contrastive-comparative reading)\uff1a\u540c\u65f6\u6253\u5f00\u4e24\u672c\u4e66\u8bb2\u540c\u4e00\u4e3b\u9898\u7684\u7ae0\u8282\uff0c\u7136\u540e\u5bf9\u6bd4\u76f8\u540c\u70b9\u548c\u4e0d\u540c\u70b9\u548c\u8054\u7cfb \u8bfb\u7684\u8fc7\u7a0b\u4e2d\uff0c\u5c3d\u91cf\u53bb\u56de\u60f3\u4e4b\u524d\u8bfb\u8fc7\u7684\u8bba\u6587\uff0c\u6bd4\u8f83\u8bba\u6587\u548c\u6559\u6750\u7684\u76f8\u540c\u70b9\u4e0e\u4e0d\u540c\u70b9","title":"Guidelines"},{"location":"%E6%9C%BA%E5%99%A8%E5%AD%A6%E4%B9%A0%E8%BF%9B%E9%98%B6/roadmap/#_6","text":"\u5148\u8bfb AoS \u7b2c\u516d\u7ae0: Models, Statistical Inference and Learning\uff0c\u8fd9\u4e00\u90e8\u5206\u662f\u6700\u57fa\u7840\u7684\u79d1\u666e \u7136\u540e\u8bfb PRML \u7b2c 10, 11 \u7ae0 \u7b2c 10 \u7ae0\u7684\u5185\u5bb9\u662f Variational Inference, \u7b2c 11 \u7ae0\u7684\u5185\u5bb9\u662f MCMC, \u8fd9\u4e24\u79cd\u65b9\u6cd5\u662f\u8d1d\u53f6\u65af\u63a8\u65ad\u7684\u4e24\u6761\u6700\u4e3b\u8981\u8def\u7ebf \u5982\u679c\u5728\u8bfb PRML \u7684\u8fc7\u7a0b\u4e2d\u53d1\u73b0\u6709\u4efb\u4f55\u4e0d\u61c2\u7684\u540d\u8bcd\uff0c\u5c31\u53bb\u7ffb\u524d\u9762\u7684\u7ae0\u8282\u3002\u5f88\u5927\u6982\u7387\u80fd\u591f\u5728\u7b2c 3\uff0c4 \u7ae0\u627e\u5230\u76f8\u5bf9\u5e94\u7684\u5b9a\u4e49\uff1b\u5982\u679c\u627e\u4e0d\u5230\u6216\u8005\u4e0d\u591f\u8be6\u7ec6\uff0c\u5c31\u53bb\u67e5 MLAPP AoS \u7b2c 8 \u7ae0 (Parametric Inference) \u548c\u7b2c 11 \u7ae0 (Bayesian Inference) \u4e5f\u53ef\u4ee5\u4f5c\u4e3a\u53c2\u8003\u3002\u6700\u597d\u7684\u65b9\u6cd5\u662f\u591a\u672c\u4e66\u5bf9\u6bd4\u9605\u8bfb\uff0c\u6d41\u7a0b\u5982\u4e0b \u5047\u8bbe\u6211\u5728\u8bfb PRML \u7b2c 10 \u7ae0\u7684\u65f6\u5019\u53d1\u73b0\u4e86\u4e00\u4e2a\u4e0d\u61c2\u7684\u8bcd\uff1aposterior inference \u4e8e\u662f\u6211\u5f80\u524d\u7ffb\uff0c\u7ffb\u5230\u4e86\u7b2c 3 \u7ae0 (Linear Model for Regression)\uff0c\u770b\u5230\u4e86\u6700\u7b80\u5355\u7684 posterior \u7136\u540e\u6211\u63a5\u7740\u7ffb AoS\uff0c\u7ffb\u5230\u4e86\u7b2c 11 \u7ae0\uff0c\u4e5f\u6709\u5bf9 posterior \u7684\u63cf\u8ff0 \u7136\u540e\u6211\u5bf9\u6bd4 PRML \u7b2c 10 \u7ae0\uff0c\u7b2c 3 \u7ae0\uff0cAoS \u7b2c 11 \u7ae0\uff0c\u4e09\u5904\u4e0d\u540c\u5730\u65b9\u5bf9 posterior \u7684\u89e3\u8bfb\uff0c\u6bd4\u8f83\u5176\u76f8\u540c\u70b9\u548c\u4e0d\u540c\u70b9\u548c\u8054\u7cfb \u8bfb\u5b8c PRML \u7b2c 10 \u548c 11 \u7ae0\u4e4b\u540e\uff0c\u63a5\u7740\u8bfb AoS \u7b2c 24 \u7ae0 (Simulation Methods)\uff0c\u7136\u540e\u628a\u5b83\u548c PRML \u7b2c 11 \u7ae0\u5bf9\u6bd4\u9605\u8bfb -- \u8fd9\u4fe9\u90fd\u662f\u8bb2 MCMC \u5982\u679c\u5230\u6b64\u5904\u53d1\u73b0\u8fd8\u6709\u57fa\u7840\u6982\u5ff5\u8bfb\u4e0d\u61c2\uff0c\u5c31\u56de\u5230 PRML \u7b2c 3 \u7ae0\uff0c\u628a\u5b83\u548c AoS \u7b2c 11 \u7ae0\u5bf9\u6bd4\u9605\u8bfb Again\uff0c\u5bf9\u6bd4\u9605\u8bfb\u975e\u5e38\u91cd\u8981\uff0c\u4e00\u5b9a\u8981\u628a\u4e0d\u540c\u672c\u4e66\u7684\u7c7b\u4f3c\u5185\u5bb9\u540c\u65f6\u6446\u5728\u9762\u524d\u76f8\u4e92\u5bf9\u6bd4\uff0c\u8fd9\u6837\u53ef\u4ee5\u663e\u8457\u589e\u5f3a\u8bb0\u5fc6 \u7136\u540e\u8bfb PRML \u7b2c 13 \u7ae0\uff08\u8df3\u8fc7\u7b2c 12 \u7ae0\uff09\uff0c\u8fd9\u4e00\u7ae0\u53ef\u4ee5\u548c MLAPP \u7684\u7b2c 17, 18 \u7ae0\u5bf9\u6bd4\u9605\u8bfb MLAPP \u7b2c 17 \u7ae0\u662f PRML \u7b2c 13.2 \u7ae0\u7684\u8be6\u7ec6\u7248\uff0c\u4e3b\u8981\u8bb2 HMM MLAPP \u7b2c 18 \u7ae0\u662f PRML \u7b2c 13.3 \u7ae0\u7684\u8be6\u7ec6\u7248\uff0c\u4e3b\u8981\u8bb2 LDS \u8bfb\u5b8c PRML \u7b2c 13 \u7ae0\u4e4b\u540e\uff0c\u518d\u53bb\u8bfb PRML \u7b2c 8 \u7ae0 (Graphical Models) -- \u6b64\u65f6\u8fd9\u90e8\u5206\u5e94\u8be5\u4f1a\u8bfb\u5f97\u5f88\u8f7b\u677e \u4ee5\u4e0a\u7684\u5185\u5bb9\u53ef\u4ee5\u8fdb\u4e00\u6b65\u5bf9\u7167 CMU 10-708 PGM \u8bfe\u7a0b\u6750\u6599 \u5230\u76ee\u524d\u4e3a\u6b62\uff0c\u5e94\u8be5\u80fd\u591f\u638c\u63e1 - \u6982\u7387\u6a21\u578b\u7684\u57fa\u7840\u5b9a\u4e49 - \u7cbe\u51c6\u63a8\u65ad - Sum-Product - \u8fd1\u4f3c\u63a8\u65ad - MCMC - \u8fd1\u4f3c\u63a8\u65ad - VI \u7136\u540e\u5c31\u53ef\u4ee5\u53bb\u505a\u66f4\u8fdb\u9636\u7684\u5185\u5bb9","title":"\u57fa\u7840\u8def\u5f84"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224n/","text":"CS224n: Natural Language Processing \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6df1\u5ea6\u5b66\u4e60\u57fa\u7840 + Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 Stanford\u7684NLP\u5165\u95e8\u8bfe\u7a0b\uff0c\u7531\u81ea\u7136\u8bed\u8a00\u5904\u7406\u9886\u57df\u7684\u5de8\u4f6cChris Manning\u9886\u8854\u6559\u6388\uff08word2vec\u7b97\u6cd5\u7684\u5f00\u521b\u8005\uff09\u3002\u5185\u5bb9\u8986\u76d6\u4e86\u8bcd\u5411\u91cf\u3001RNN\u3001LSTM\u3001Seq2Seq\u6a21\u578b\u3001\u673a\u5668\u7ffb\u8bd1\u3001\u6ce8\u610f\u529b\u673a\u5236\u3001Transformer\u7b49\u7b49NLP\u9886\u57df\u7684\u6838\u5fc3\u77e5\u8bc6\u70b9\u3002 5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u96be\u5ea6\u5faa\u5e8f\u6e10\u8fdb\uff0c\u5206\u522b\u662f\u8bcd\u5411\u91cf\u3001word2vec\u7b97\u6cd5\u3001Dependency parsing\u3001\u673a\u5668\u7ffb\u8bd1\u4ee5\u53caTransformer\u7684fine-tune\u3002 \u6700\u7ec8\u7684\u5927\u4f5c\u4e1a\u662f\u5728Stanford\u8457\u540d\u7684SQuAD\u6570\u636e\u96c6\u4e0a\u8bad\u7ec3QA\u6a21\u578b\uff0c\u6709\u5b66\u751f\u7684\u5927\u4f5c\u4e1a\u751a\u81f3\u76f4\u63a5\u53d1\u8868\u4e86\u9876\u4f1a\u8bba\u6587\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1aB\u7ad9\u641c\u7d22CS224n \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a + 1\u4e2aFinal Project \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Stanford CS224n: Natural Language Processing"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224n/#cs224n-natural-language-processing","text":"","title":"CS224n: Natural Language Processing"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224n/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6df1\u5ea6\u5b66\u4e60\u57fa\u7840 + Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 Stanford\u7684NLP\u5165\u95e8\u8bfe\u7a0b\uff0c\u7531\u81ea\u7136\u8bed\u8a00\u5904\u7406\u9886\u57df\u7684\u5de8\u4f6cChris Manning\u9886\u8854\u6559\u6388\uff08word2vec\u7b97\u6cd5\u7684\u5f00\u521b\u8005\uff09\u3002\u5185\u5bb9\u8986\u76d6\u4e86\u8bcd\u5411\u91cf\u3001RNN\u3001LSTM\u3001Seq2Seq\u6a21\u578b\u3001\u673a\u5668\u7ffb\u8bd1\u3001\u6ce8\u610f\u529b\u673a\u5236\u3001Transformer\u7b49\u7b49NLP\u9886\u57df\u7684\u6838\u5fc3\u77e5\u8bc6\u70b9\u3002 5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u96be\u5ea6\u5faa\u5e8f\u6e10\u8fdb\uff0c\u5206\u522b\u662f\u8bcd\u5411\u91cf\u3001word2vec\u7b97\u6cd5\u3001Dependency parsing\u3001\u673a\u5668\u7ffb\u8bd1\u4ee5\u53caTransformer\u7684fine-tune\u3002 \u6700\u7ec8\u7684\u5927\u4f5c\u4e1a\u662f\u5728Stanford\u8457\u540d\u7684SQuAD\u6570\u636e\u96c6\u4e0a\u8bad\u7ec3QA\u6a21\u578b\uff0c\u6709\u5b66\u751f\u7684\u5927\u4f5c\u4e1a\u751a\u81f3\u76f4\u63a5\u53d1\u8868\u4e86\u9876\u4f1a\u8bba\u6587\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224n/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1aB\u7ad9\u641c\u7d22CS224n \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a + 1\u4e2aFinal Project","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224n/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224w/","text":"CS224w: Machine Learning with Graphs \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6df1\u5ea6\u5b66\u4e60\u57fa\u7840 + Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython, Latex \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 Stanford\u7684\u56fe\u795e\u7ecf\u7f51\u7edc\u5165\u95e8\u8bfe\uff0c\u8fd9\u95e8\u8bfe\u6211\u6ca1\u6709\u4e0a\u8fc7\uff0c\u4f46\u4f17\u591a\u505aGNN\u7684\u670b\u53cb\u90fd\u5411\u6211\u529b\u8350\u8fc7\u8fd9\u95e8\u8bfe\uff0c\u60f3\u5fc5Stanford\u7684\u8bfe\u8d28\u91cf\u8fd8\u662f\u4e00\u5982\u65e2\u5f80\u5730\u6709\u4fdd\u8bc1\u7684\u3002\u53e6\u5916\u5c31\u662f\u8fd9\u95e8\u8bfe\u7684\u6388\u8bfe\u8001\u5e08\u975e\u5e38\u5e74\u8f7b\u5e05\u6c14:) \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a6\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\uff0c3\u4e2aLatex\u4e66\u9762\u4f5c\u4e1a","title":"Stanford CS224w: Machine Learning with Graphs"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224w/#cs224w-machine-learning-with-graphs","text":"","title":"CS224w: Machine Learning with Graphs"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224w/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6df1\u5ea6\u5b66\u4e60\u57fa\u7840 + Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython, Latex \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 Stanford\u7684\u56fe\u795e\u7ecf\u7f51\u7edc\u5165\u95e8\u8bfe\uff0c\u8fd9\u95e8\u8bfe\u6211\u6ca1\u6709\u4e0a\u8fc7\uff0c\u4f46\u4f17\u591a\u505aGNN\u7684\u670b\u53cb\u90fd\u5411\u6211\u529b\u8350\u8fc7\u8fd9\u95e8\u8bfe\uff0c\u60f3\u5fc5Stanford\u7684\u8bfe\u8d28\u91cf\u8fd8\u662f\u4e00\u5982\u65e2\u5f80\u5730\u6709\u4fdd\u8bc1\u7684\u3002\u53e6\u5916\u5c31\u662f\u8fd9\u95e8\u8bfe\u7684\u6388\u8bfe\u8001\u5e08\u975e\u5e38\u5e74\u8f7b\u5e05\u6c14:)","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS224w/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a6\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\uff0c3\u4e2aLatex\u4e66\u9762\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS230/","text":"Coursera: Deep Learning \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u673a\u5668\u5b66\u4e60\u57fa\u7840 + Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u5434\u6069\u8fbe\u5728Coursera\u5f00\u8bbe\u7684\u53e6\u4e00\u95e8\u7f51\u7ea2\u8bfe\u7a0b\uff0c\u5b66\u4e60\u8005\u65e0\u6570\uff0c\u582a\u79f0\u5723\u7ecf\u7ea7\u7684\u6df1\u5ea6\u5b66\u4e60\u5165\u95e8\u8bfe\u3002\u6df1\u5165\u6d45\u51fa\u7684\u8bb2\u89e3\uff0c\u773c\u82b1\u7f2d\u4e71\u7684Project\u3002\u4ece\u6700\u57fa\u7840\u7684\u795e\u7ecf\u7f51\u7edc\uff0c\u5230CNN\uff0cRNN\uff0c\u518d\u5230\u6700\u8fd1\u5927\u70ed\u7684Transformer\u3002\u5b66\u5b8c\u8fd9\u95e8\u8bfe\uff0c\u4f60\u5c06\u521d\u6b65\u638c\u63e1\u6df1\u5ea6\u5b66\u4e60\u9886\u57df\u5fc5\u5907\u7684\u77e5\u8bc6\u548c\u6280\u80fd\uff0c\u5e76\u4e14\u53ef\u4ee5\u5728 Kaggle \u4e2d\u53c2\u52a0\u81ea\u5df1\u611f\u5174\u8da3\u7684\u6bd4\u8d5b\uff0c\u5728\u5b9e\u8df5\u4e2d\u953b\u70bc\u81ea\u5df1\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1aB\u7ad9\u6709\u642c\u8fd0 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a","title":"Coursera: Deep Learning"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS230/#coursera-deep-learning","text":"","title":"Coursera: Deep Learning"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS230/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u673a\u5668\u5b66\u4e60\u57fa\u7840 + Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u5434\u6069\u8fbe\u5728Coursera\u5f00\u8bbe\u7684\u53e6\u4e00\u95e8\u7f51\u7ea2\u8bfe\u7a0b\uff0c\u5b66\u4e60\u8005\u65e0\u6570\uff0c\u582a\u79f0\u5723\u7ecf\u7ea7\u7684\u6df1\u5ea6\u5b66\u4e60\u5165\u95e8\u8bfe\u3002\u6df1\u5165\u6d45\u51fa\u7684\u8bb2\u89e3\uff0c\u773c\u82b1\u7f2d\u4e71\u7684Project\u3002\u4ece\u6700\u57fa\u7840\u7684\u795e\u7ecf\u7f51\u7edc\uff0c\u5230CNN\uff0cRNN\uff0c\u518d\u5230\u6700\u8fd1\u5927\u70ed\u7684Transformer\u3002\u5b66\u5b8c\u8fd9\u95e8\u8bfe\uff0c\u4f60\u5c06\u521d\u6b65\u638c\u63e1\u6df1\u5ea6\u5b66\u4e60\u9886\u57df\u5fc5\u5907\u7684\u77e5\u8bc6\u548c\u6280\u80fd\uff0c\u5e76\u4e14\u53ef\u4ee5\u5728 Kaggle \u4e2d\u53c2\u52a0\u81ea\u5df1\u611f\u5174\u8da3\u7684\u6bd4\u8d5b\uff0c\u5728\u5b9e\u8df5\u4e2d\u953b\u70bc\u81ea\u5df1\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS230/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1aB\u7ad9\u6709\u642c\u8fd0 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS231/","text":"CS231n: CNN for Visual Recognition \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u673a\u5668\u5b66\u4e60\u57fa\u7840 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 Stanford\u7684CV\u5165\u95e8\u8bfe\uff0c\u7531\u8ba1\u7b97\u673a\u9886\u57df\u7684\u5de8\u4f6c\u674e\u98de\u98de\u9662\u58eb\u9886\u8854\u6559\u6388\uff08CV\u9886\u57df\u5212\u65f6\u4ee3\u7684\u8457\u540d\u6570\u636e\u96c6ImageNet\u7684\u7814\u7a76\u56e2\u961f\uff09\uff0c\u4f46\u5176\u5185\u5bb9\u76f8\u5bf9\u57fa\u7840\u4e14\u53cb\u597d\uff0c\u5982\u679c\u4e0a\u8fc7CS230\u7684\u8bdd\u53ef\u4ee5\u76f4\u63a5\u4e0a\u624bProject\u4f5c\u4e3a\u7ec3\u4e60\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a3\u4e2a\u7f16\u7a0b\u4f5c\u4e1a","title":"Stanford CS231n: CNN for Visual Recognition"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS231/#cs231n-cnn-for-visual-recognition","text":"","title":"CS231n: CNN for Visual Recognition"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS231/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u673a\u5668\u5b66\u4e60\u57fa\u7840 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 Stanford\u7684CV\u5165\u95e8\u8bfe\uff0c\u7531\u8ba1\u7b97\u673a\u9886\u57df\u7684\u5de8\u4f6c\u674e\u98de\u98de\u9662\u58eb\u9886\u8854\u6559\u6388\uff08CV\u9886\u57df\u5212\u65f6\u4ee3\u7684\u8457\u540d\u6570\u636e\u96c6ImageNet\u7684\u7814\u7a76\u56e2\u961f\uff09\uff0c\u4f46\u5176\u5185\u5bb9\u76f8\u5bf9\u57fa\u7840\u4e14\u53cb\u597d\uff0c\u5982\u679c\u4e0a\u8fc7CS230\u7684\u8bdd\u53ef\u4ee5\u76f4\u63a5\u4e0a\u624bProject\u4f5c\u4e3a\u7ec3\u4e60\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS231/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a3\u4e2a\u7f16\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS285/","text":"CS285: Deep Reinforcement Learning \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS188, CS189 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u5f3a\u5316\u5b66\u4e60\u7814\u7a76\u751f\u8bfe\u7a0b\uff0c\u6240\u6709\u8bfe\u7a0b\u5f55\u5f71\u3001slides\u3001\u4f5c\u4e1a\u4ee3\u7801\u5747\u5728\u7f51\u7ad9\u5f00\u6e90\u3002\u5728\u6211\u7684\u6536\u85cf\u5939\u91cc\u5403\u7070\u5f88\u4e45\u4e86\uff0c\u4e00\u76f4\u60f3\u627e\u673a\u4f1a\u5b66\u4e60\u4e00\u4e0b\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a","title":"UCB CS285: Deep Reinforcement Learning"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS285/#cs285-deep-reinforcement-learning","text":"","title":"CS285: Deep Reinforcement Learning"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS285/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS188, CS189 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u5f3a\u5316\u5b66\u4e60\u7814\u7a76\u751f\u8bfe\u7a0b\uff0c\u6240\u6709\u8bfe\u7a0b\u5f55\u5f71\u3001slides\u3001\u4f5c\u4e1a\u4ee3\u7801\u5747\u5728\u7f51\u7ad9\u5f00\u6e90\u3002\u5728\u6211\u7684\u6536\u85cf\u5939\u91cc\u5403\u7070\u5f88\u4e45\u4e86\uff0c\u4e00\u76f4\u60f3\u627e\u673a\u4f1a\u5b66\u4e60\u4e00\u4e0b\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/CS285/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/LHY/","text":"\u53f0\u6e7e\u56fd\u7acb\u5927\u5b66\uff1a\u674e\u5b8f\u6bc5\u673a\u5668\u5b66\u4e60 \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1a\u53f0\u6e7e\u56fd\u7acb\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u719f\u7ec3\u638c\u63e1Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u674e\u5b8f\u6bc5\u8001\u5e08\u662f\u53f0\u6e7e\u56fd\u7acb\u5927\u5b66\u7684\u6559\u6388\uff0c\u5176\u98ce\u8da3\u5e7d\u9ed8\u7684\u6388\u8bfe\u98ce\u683c\u6df1\u53d7\u5927\u5bb6\u559c\u7231\uff0c\u5e76\u4e14\u5c24\u5176\u559c\u6b22\u5728PPT\u4e2d\u63d2\u5165\u5b9d\u53ef\u68a6\u7b49\u52a8\u6f2b\u5143\u7d20\uff0c\u662f\u4e2a\u975e\u5e38\u53ef\u7231\u7684\u8001\u5e08\u3002 \u8fd9\u95e8\u8bfe\u6302\u7740\u673a\u5668\u5b66\u4e60\u7684\u724c\u5b50\uff0c\u4f46\u5176\u8bfe\u7a0b\u5185\u5bb9\u4e4b\u5e7f\u5b9e\u5728\u4ee4\u4eba\u548b\u820c\uff0c\u5176\u4f5c\u4e1a\u4e00\u5171\u5305\u542b15\u4e2alab\uff0c\u5206\u522b\u662fRegression\u3001Classification\u3001CNN\u3001Self-Attention\u3001Transformer\u3001GAN\u3001BERT\u3001Anomaly Detection\u3001Explainable AI\u3001Attack\u3001Adaptation\u3001 RL\u3001Compression\u3001Life-Long Learning\u4ee5\u53caMeta Learning\u3002\u53ef\u8c13\u662f\u5305\u7f57\u4e07\u8c61\uff0c\u80fd\u8ba9\u5b66\u751f\u5bf9\u4e8e\u6df1\u5ea6\u5b66\u4e60\u7684\u7edd\u5927\u591a\u6570\u9886\u57df\u90fd\u6709\u4e00\u5b9a\u4e86\u89e3\uff0c\u4ece\u800c\u53ef\u4ee5\u8fdb\u4e00\u6b65\u9009\u62e9\u60f3\u8981\u6df1\u5165\u7684\u65b9\u5411\u8fdb\u884c\u5b66\u4e60\u3002 \u5927\u5bb6\u4e5f\u5927\u53ef\u4e0d\u5fc5\u62c5\u5fc3\u4f5c\u4e1a\u7684\u96be\u5ea6\uff0c\u56e0\u4e3a\u6240\u6709\u4f5c\u4e1a\u90fd\u4f1a\u63d0\u4f9b\u52a9\u6559\u7684\u793a\u4f8b\u4ee3\u7801\uff0c\u5e2e\u4f60\u5b8c\u6210\u6570\u636e\u5904\u7406\u3001\u6a21\u578b\u642d\u5efa\u7b49\uff0c\u4f60\u53ea\u9700\u8981\u5728\u5176\u57fa\u7840\u4e0a\u8fdb\u884c\u9002\u91cf\u7684\u4fee\u6539\u5373\u53ef\u3002\u8fd9\u4e5f\u662f\u4e00\u4e2a\u5b66\u4e60\u522b\u4eba\u4f18\u8d28\u4ee3\u7801\u7684\u6781\u597d\u673a\u4f1a\uff0c\u5927\u5bb6\u9700\u8981\u6c34\u8bfe\u7a0b\u5927\u4f5c\u4e1a\u7684\u8bdd\uff0c\u8fd9\u91cc\u4e5f\u662f\u4e00\u4e2a\u4e0d\u9519\u7684\u8d44\u6599\u6765\u6e90\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a15\u4e2alab\uff0c\u51e0\u4e4e\u8986\u76d6\u4e86\u4e3b\u6d41\u6df1\u5ea6\u5b66\u4e60\u7684\u6240\u6709\u9886\u57df","title":"\u53f0\u6e7e\u56fd\u7acb\u5927\u5b66\uff1a\u674e\u5b8f\u6bc5\u673a\u5668\u5b66\u4e60"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/LHY/#_1","text":"","title":"\u53f0\u6e7e\u56fd\u7acb\u5927\u5b66\uff1a\u674e\u5b8f\u6bc5\u673a\u5668\u5b66\u4e60"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/LHY/#_2","text":"\u6240\u5c5e\u5927\u5b66\uff1a\u53f0\u6e7e\u56fd\u7acb\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u719f\u7ec3\u638c\u63e1Python \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u674e\u5b8f\u6bc5\u8001\u5e08\u662f\u53f0\u6e7e\u56fd\u7acb\u5927\u5b66\u7684\u6559\u6388\uff0c\u5176\u98ce\u8da3\u5e7d\u9ed8\u7684\u6388\u8bfe\u98ce\u683c\u6df1\u53d7\u5927\u5bb6\u559c\u7231\uff0c\u5e76\u4e14\u5c24\u5176\u559c\u6b22\u5728PPT\u4e2d\u63d2\u5165\u5b9d\u53ef\u68a6\u7b49\u52a8\u6f2b\u5143\u7d20\uff0c\u662f\u4e2a\u975e\u5e38\u53ef\u7231\u7684\u8001\u5e08\u3002 \u8fd9\u95e8\u8bfe\u6302\u7740\u673a\u5668\u5b66\u4e60\u7684\u724c\u5b50\uff0c\u4f46\u5176\u8bfe\u7a0b\u5185\u5bb9\u4e4b\u5e7f\u5b9e\u5728\u4ee4\u4eba\u548b\u820c\uff0c\u5176\u4f5c\u4e1a\u4e00\u5171\u5305\u542b15\u4e2alab\uff0c\u5206\u522b\u662fRegression\u3001Classification\u3001CNN\u3001Self-Attention\u3001Transformer\u3001GAN\u3001BERT\u3001Anomaly Detection\u3001Explainable AI\u3001Attack\u3001Adaptation\u3001 RL\u3001Compression\u3001Life-Long Learning\u4ee5\u53caMeta Learning\u3002\u53ef\u8c13\u662f\u5305\u7f57\u4e07\u8c61\uff0c\u80fd\u8ba9\u5b66\u751f\u5bf9\u4e8e\u6df1\u5ea6\u5b66\u4e60\u7684\u7edd\u5927\u591a\u6570\u9886\u57df\u90fd\u6709\u4e00\u5b9a\u4e86\u89e3\uff0c\u4ece\u800c\u53ef\u4ee5\u8fdb\u4e00\u6b65\u9009\u62e9\u60f3\u8981\u6df1\u5165\u7684\u65b9\u5411\u8fdb\u884c\u5b66\u4e60\u3002 \u5927\u5bb6\u4e5f\u5927\u53ef\u4e0d\u5fc5\u62c5\u5fc3\u4f5c\u4e1a\u7684\u96be\u5ea6\uff0c\u56e0\u4e3a\u6240\u6709\u4f5c\u4e1a\u90fd\u4f1a\u63d0\u4f9b\u52a9\u6559\u7684\u793a\u4f8b\u4ee3\u7801\uff0c\u5e2e\u4f60\u5b8c\u6210\u6570\u636e\u5904\u7406\u3001\u6a21\u578b\u642d\u5efa\u7b49\uff0c\u4f60\u53ea\u9700\u8981\u5728\u5176\u57fa\u7840\u4e0a\u8fdb\u884c\u9002\u91cf\u7684\u4fee\u6539\u5373\u53ef\u3002\u8fd9\u4e5f\u662f\u4e00\u4e2a\u5b66\u4e60\u522b\u4eba\u4f18\u8d28\u4ee3\u7801\u7684\u6781\u597d\u673a\u4f1a\uff0c\u5927\u5bb6\u9700\u8981\u6c34\u8bfe\u7a0b\u5927\u4f5c\u4e1a\u7684\u8bdd\uff0c\u8fd9\u91cc\u4e5f\u662f\u4e00\u4e2a\u4e0d\u9519\u7684\u8d44\u6599\u6765\u6e90\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/LHY/#_3","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \uff1a\u6bcf\u8282\u8bfe\u7684\u94fe\u63a5\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a15\u4e2alab\uff0c\u51e0\u4e4e\u8986\u76d6\u4e86\u4e3b\u6d41\u6df1\u5ea6\u5b66\u4e60\u7684\u6240\u6709\u9886\u57df","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/EE16/","text":"UCB EE16A&B: Designing Information Devices and Systems I&II \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 UC Berkeley\u7535\u5b50\u7cfb\u5b66\u751f\u7684\u5927\u4e00\u5165\u95e8\u8bfe\uff0c\u901a\u8fc7\u7535\u8def\u57fa\u7840\u77e5\u8bc6\u7684\u8bb2\u6388\uff0c\u914d\u5408\u5404\u7c7b\u52a8\u624b\u5b9e\u64cd\u7684lab\uff0c\u8ba9\u5b66\u751f\u4f53\u9a8c\u901a\u8fc7\u7535\u8def\u4ece\u73af\u5883\u4e2d\u6536\u96c6\u4fe1\u606f\u5e76\u8fdb\u884c\u5206\u6790\uff0c\u4f5c\u51fa\u9884\u6d4b\u548c\u53cd\u9988\u3002\u7531\u4e8e\u75ab\u60c5\u7684\u7f18\u6545\uff0c\u6240\u6709lab\u90fd\u6709\u8fdc\u7a0b\u5728\u7ebf\u7248\uff0c\u975e\u5e38\u9002\u5408\u5927\u5bb6\u5728\u5bb6\u81ea\u5b66\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a EE16A , EE16B \u8bfe\u7a0b\u89c6\u9891\uff1aB\u7ad9\u641c\u7d22 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u4e3b\u9875 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"EE16A&B: Designing Information Devices and Systems I&II"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/EE16/#ucb-ee16ab-designing-information-devices-and-systems-iii","text":"","title":"UCB EE16A&B: Designing Information Devices and Systems I&II"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/EE16/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 UC Berkeley\u7535\u5b50\u7cfb\u5b66\u751f\u7684\u5927\u4e00\u5165\u95e8\u8bfe\uff0c\u901a\u8fc7\u7535\u8def\u57fa\u7840\u77e5\u8bc6\u7684\u8bb2\u6388\uff0c\u914d\u5408\u5404\u7c7b\u52a8\u624b\u5b9e\u64cd\u7684lab\uff0c\u8ba9\u5b66\u751f\u4f53\u9a8c\u901a\u8fc7\u7535\u8def\u4ece\u73af\u5883\u4e2d\u6536\u96c6\u4fe1\u606f\u5e76\u8fdb\u884c\u5206\u6790\uff0c\u4f5c\u51fa\u9884\u6d4b\u548c\u53cd\u9988\u3002\u7531\u4e8e\u75ab\u60c5\u7684\u7f18\u6545\uff0c\u6240\u6709lab\u90fd\u6709\u8fdc\u7a0b\u5728\u7ebf\u7248\uff0c\u975e\u5e38\u9002\u5408\u5927\u5bb6\u5728\u5bb6\u81ea\u5b66\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/EE16/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a EE16A , EE16B \u8bfe\u7a0b\u89c6\u9891\uff1aB\u7ad9\u641c\u7d22 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1\u8bfe\u7a0b\u4e3b\u9875","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/EE16/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/Signals%20and%20Systems_AVO/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1aCalculus, Linear Algebra \u7f16\u7a0b\u8bed\u8a00\uff1aMatlab Preferred \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50-70 \u5c0f\u65f6 \u770b\u5230\u8bfe\u7a0b\u8001\u5e08\u7684\u540d\u5b57\uff1aProf. Alan V. Oppenheim \u597d\u7684\uff0c\u4e0a\u8fd9\u95e8\u8bfe\u7684\u7406\u7531\u5df2\u7ecf\u8db3\u591f\u4e86\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aSignals and Systems, 2nd Edition \u8bfe\u7a0b\u4f5c\u4e1a","title":"MIT 6.007 Signals and Systems"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/Signals%20and%20Systems_AVO/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1aCalculus, Linear Algebra \u7f16\u7a0b\u8bed\u8a00\uff1aMatlab Preferred \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50-70 \u5c0f\u65f6 \u770b\u5230\u8bfe\u7a0b\u8001\u5e08\u7684\u540d\u5b57\uff1aProf. Alan V. Oppenheim \u597d\u7684\uff0c\u4e0a\u8fd9\u95e8\u8bfe\u7684\u7406\u7531\u5df2\u7ecf\u8db3\u591f\u4e86\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/Signals%20and%20Systems_AVO/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aSignals and Systems, 2nd Edition \u8bfe\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/signal/","text":"UCB EE120 : Signal and Systems \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A\uff0cCS70\uff0c\u5fae\u79ef\u5206\uff0c\u7ebf\u6027\u4ee3\u6570 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u6700\u7cbe\u534e\u7684\u90e8\u5206\u5c31\u662f6\u4e2a\u8d85\u6709\u8da3\u7684\u7f16\u7a0b\u4f5c\u4e1a\u4e86\uff0c\u4f1a\u8ba9\u4f60\u7528Python\u901a\u8fc7\u5b66\u4e60\u5230\u7684\u4fe1\u53f7\u4e0e\u7cfb\u7edf\u7684\u7406\u8bba\u77e5\u8bc6\uff0c\u89e3\u51b3\u5404\u7c7b\u5b9e\u9645\u95ee\u9898\u3002\u4f8b\u5982lab3\u4f1a\u8ba9\u4f60\u5b9e\u73b0FFT\u7b97\u6cd5\uff0c\u5e76\u548cNumpy\u7684\u5b98\u65b9\u5b9e\u73b0\u8fdb\u884c\u6027\u80fd\u5bf9\u6bd4\uff1blab4\u4f1a\u901a\u8fc7\u5206\u6790\u624b\u6307\u5934\u7684\u5f71\u50cf\u6570\u636e\u63a8\u65ad\u5fc3\u7387\uff1blab5\u5c31\u66f4\u725b\u4e86\uff0c\u4f1a\u8ba9\u4f60\u7ed9\u54c8\u52c3\u671b\u8fdc\u955c\u62cd\u5230\u7684\u7167\u7247\u8fdb\u884c\u964d\u566a\u5904\u7406\uff0c\u6062\u590d\u7eda\u70c2\u6e05\u6670\u7684\u661f\u7a7a\uff1blab6\u4f1a\u8ba9\u4f60\u6784\u9020\u4e00\u4e2a\u53cd\u9988\u7cfb\u7edf\uff0c\u5e73\u8861\u5c0f\u8f66\u4e0a\u7684\u7ec6\u6746\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a5\u4e2a\u4e66\u9762\u4f5c\u4e1a + 6\u4e2a\u7f16\u7a0b\u4f5c\u4e1a \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB EE120 : Signal and Systems"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/signal/#ucb-ee120-signal-and-systems","text":"","title":"UCB EE120 : Signal and Systems"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/signal/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A\uff0cCS70\uff0c\u5fae\u79ef\u5206\uff0c\u7ebf\u6027\u4ee3\u6570 \u7f16\u7a0b\u8bed\u8a00\uff1aPython \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u6700\u7cbe\u534e\u7684\u90e8\u5206\u5c31\u662f6\u4e2a\u8d85\u6709\u8da3\u7684\u7f16\u7a0b\u4f5c\u4e1a\u4e86\uff0c\u4f1a\u8ba9\u4f60\u7528Python\u901a\u8fc7\u5b66\u4e60\u5230\u7684\u4fe1\u53f7\u4e0e\u7cfb\u7edf\u7684\u7406\u8bba\u77e5\u8bc6\uff0c\u89e3\u51b3\u5404\u7c7b\u5b9e\u9645\u95ee\u9898\u3002\u4f8b\u5982lab3\u4f1a\u8ba9\u4f60\u5b9e\u73b0FFT\u7b97\u6cd5\uff0c\u5e76\u548cNumpy\u7684\u5b98\u65b9\u5b9e\u73b0\u8fdb\u884c\u6027\u80fd\u5bf9\u6bd4\uff1blab4\u4f1a\u901a\u8fc7\u5206\u6790\u624b\u6307\u5934\u7684\u5f71\u50cf\u6570\u636e\u63a8\u65ad\u5fc3\u7387\uff1blab5\u5c31\u66f4\u725b\u4e86\uff0c\u4f1a\u8ba9\u4f60\u7ed9\u54c8\u52c3\u671b\u8fdc\u955c\u62cd\u5230\u7684\u7167\u7247\u8fdb\u884c\u964d\u566a\u5904\u7406\uff0c\u6062\u590d\u7eda\u70c2\u6e05\u6670\u7684\u661f\u7a7a\uff1blab6\u4f1a\u8ba9\u4f60\u6784\u9020\u4e00\u4e2a\u53cd\u9988\u7cfb\u7edf\uff0c\u5e73\u8861\u5c0f\u8f66\u4e0a\u7684\u7ec6\u6746\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/signal/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a5\u4e2a\u4e66\u9762\u4f5c\u4e1a + 6\u4e2a\u7f16\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%94%B5%E5%AD%90%E5%9F%BA%E7%A1%80/signal/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E7%A8%8B%E5%BA%8F%E8%AF%AD%E8%A8%80%E8%AE%BE%E8%AE%A1/CS242/","text":"","title":"CS242"},{"location":"%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8/CS161/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B, CS61C \u7f16\u7a0b\u8bed\u8a00\uff1aC, Go \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u5b89\u5168\u8bfe\u7a0b\uff0c\u8bfe\u7a0b\u5185\u5bb9\u5206\u4e3a5\u4e2a\u90e8\u5206\uff1a Security principles : how to design a secure system Memory safety : buffer overflow attack Cryptography : symmetric encryption, asymmetric encryption, MAC, digital signature ......... Web : SQL-injection, XSS, XSRF ....... Networking : attacks for each layer \u8fd9\u95e8\u8bfe\u8ba9\u6211\u5370\u8c61\u6700\u4e3a\u6df1\u523b\u7684\u90e8\u5206\u662fProject2\uff0c\u8ba9\u4f60\u7528Go\u8bed\u8a00\u8bbe\u8ba1\u548c\u5b9e\u73b0\u4e00\u4e2a\u5b89\u5168\u7684\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf\u3002\u6211\u82b1\u4e86\u6574\u6574\u4e09\u5929\u624d\u5b8c\u6210\u4e86\u8fd9\u4e2a\u975e\u5e38\u8650\u7684Project\uff0c\u603b\u4ee3\u7801\u91cf\u8d85\u8fc73k\u884c\u3002\u5728\u8fd9\u6837\u5bc6\u96c6\u578b\u7684\u5f00\u53d1\u8fc7\u7a0b\u4e2d\uff0c\u80fd\u6781\u5927\u5730\u953b\u70bc\u4f60\u8bbe\u8ba1\u548c\u5b9e\u73b0\u4e00\u4e2a\u5b89\u5168\u7cfb\u7edf\u7684\u80fd\u529b\u3002 2020\u5e74\u590f\u5b63\u5b66\u671f\u7684\u7248\u672c\u5f00\u6e90\u4e86\u8bfe\u7a0b\u5f55\u5f71\uff0c\u5927\u5bb6\u53ef\u4ee5\u5728\u4e0b\u9762\u7684\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5\u91cc\u627e\u5230\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a7\u4e2a\u5728\u7ebfHW + 3\u4e2alab + 3\u4e2aProject \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS161: Computer Security"},{"location":"%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8/CS161/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1aCS61A, CS61B, CS61C \u7f16\u7a0b\u8bed\u8a00\uff1aC, Go \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u5b89\u5168\u8bfe\u7a0b\uff0c\u8bfe\u7a0b\u5185\u5bb9\u5206\u4e3a5\u4e2a\u90e8\u5206\uff1a Security principles : how to design a secure system Memory safety : buffer overflow attack Cryptography : symmetric encryption, asymmetric encryption, MAC, digital signature ......... Web : SQL-injection, XSS, XSRF ....... Networking : attacks for each layer \u8fd9\u95e8\u8bfe\u8ba9\u6211\u5370\u8c61\u6700\u4e3a\u6df1\u523b\u7684\u90e8\u5206\u662fProject2\uff0c\u8ba9\u4f60\u7528Go\u8bed\u8a00\u8bbe\u8ba1\u548c\u5b9e\u73b0\u4e00\u4e2a\u5b89\u5168\u7684\u6587\u4ef6\u5206\u4eab\u7cfb\u7edf\u3002\u6211\u82b1\u4e86\u6574\u6574\u4e09\u5929\u624d\u5b8c\u6210\u4e86\u8fd9\u4e2a\u975e\u5e38\u8650\u7684Project\uff0c\u603b\u4ee3\u7801\u91cf\u8d85\u8fc73k\u884c\u3002\u5728\u8fd9\u6837\u5bc6\u96c6\u578b\u7684\u5f00\u53d1\u8fc7\u7a0b\u4e2d\uff0c\u80fd\u6781\u5927\u5730\u953b\u70bc\u4f60\u8bbe\u8ba1\u548c\u5b9e\u73b0\u4e00\u4e2a\u5b89\u5168\u7cfb\u7edf\u7684\u80fd\u529b\u3002 2020\u5e74\u590f\u5b63\u5b66\u671f\u7684\u7248\u672c\u5f00\u6e90\u4e86\u8bfe\u7a0b\u5f55\u5f71\uff0c\u5927\u5bb6\u53ef\u4ee5\u5728\u4e0b\u9762\u7684\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5\u91cc\u627e\u5230\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8/CS161/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a7\u4e2a\u5728\u7ebfHW + 3\u4e2alab + 3\u4e2aProject","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8/CS161/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8/MIT6.858/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u6709\u521d\u6b65\u4e86\u89e3 \u7f16\u7a0b\u8bed\u8a00\uff1aC, Python \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 MIT\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u5b89\u5168\u8bfe\u7a0b\uff0c\u5b9e\u9a8c\u73af\u5883\u662f\u4e00\u4e2aWeb Application Zoobar. \u5b66\u751f\u5b66\u4e60\u653b\u9632\u6280\u672f\u5e76\u5e94\u7528\u4e8e\u8be5Web Application. Lab 1: you will explore the zoobar web application, and use buffer overflow attacks to break its security properties. Lab 2: you will improve the zoobar web application by using privilege separation, so that if one component is compromised, the adversary doesn't get control over the whole web application. Lab 3: you will build a program analysis tool based on symbolic execution to find bugs in Python code such as the zoobar web application. Lab 4: you will improve the zoobar application against browser attacks. \u8fd9\u4e2a\u8bfe\u6211\u4e3b\u8981\u662f\u505a\u4e86lab3\u3002lab3\u662f\u901a\u8fc7\u6df7\u5408\u7b26\u53f7\u6267\u884c\u6765\u904d\u5386\u7a0b\u5e8f\u7684\u6240\u6709\u5206\u652f\uff0c\u7406\u89e3\u4e86\u7b26\u53f7\u6267\u884c\u7684\u601d\u60f3\u540elab\u5e76\u4e0d\u96be\u505a\u3002\u8fd9\u4e2alab\u76f4\u89c2\u5c55\u793a\u7b26\u53f7\u6267\u884c\u8fd9\u79cd\u6280\u672f\u7684\u4f7f\u7528\u65b9\u6cd5\u3002 \u8fd9\u4e2a\u8bfe\u7684Final Project\u662f\u5b9e\u73b0 SecFS \uff0c\u4e00\u4e2a\u8fdc\u7aef\u6587\u4ef6\u7cfb\u7edf\uff0c\u9762\u5bf9\u5b8c\u5168\u4e0d\u53ef\u4fe1\u7684\u670d\u52a1\u5668\uff0c\u63d0\u4f9b\u673a\u5bc6\u6027\u548c\u5b8c\u6574\u6027\u3002\u53c2\u8003\u8bba\u6587\u4e3a SUNDR \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2alab + Final Project / Lab5","title":"MIT 6.858: Computer System Security"},{"location":"%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8/MIT6.858/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u6709\u521d\u6b65\u4e86\u89e3 \u7f16\u7a0b\u8bed\u8a00\uff1aC, Python \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 MIT\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u5b89\u5168\u8bfe\u7a0b\uff0c\u5b9e\u9a8c\u73af\u5883\u662f\u4e00\u4e2aWeb Application Zoobar. \u5b66\u751f\u5b66\u4e60\u653b\u9632\u6280\u672f\u5e76\u5e94\u7528\u4e8e\u8be5Web Application. Lab 1: you will explore the zoobar web application, and use buffer overflow attacks to break its security properties. Lab 2: you will improve the zoobar web application by using privilege separation, so that if one component is compromised, the adversary doesn't get control over the whole web application. Lab 3: you will build a program analysis tool based on symbolic execution to find bugs in Python code such as the zoobar web application. Lab 4: you will improve the zoobar application against browser attacks. \u8fd9\u4e2a\u8bfe\u6211\u4e3b\u8981\u662f\u505a\u4e86lab3\u3002lab3\u662f\u901a\u8fc7\u6df7\u5408\u7b26\u53f7\u6267\u884c\u6765\u904d\u5386\u7a0b\u5e8f\u7684\u6240\u6709\u5206\u652f\uff0c\u7406\u89e3\u4e86\u7b26\u53f7\u6267\u884c\u7684\u601d\u60f3\u540elab\u5e76\u4e0d\u96be\u505a\u3002\u8fd9\u4e2alab\u76f4\u89c2\u5c55\u793a\u7b26\u53f7\u6267\u884c\u8fd9\u79cd\u6280\u672f\u7684\u4f7f\u7528\u65b9\u6cd5\u3002 \u8fd9\u4e2a\u8bfe\u7684Final Project\u662f\u5b9e\u73b0 SecFS \uff0c\u4e00\u4e2a\u8fdc\u7aef\u6587\u4ef6\u7cfb\u7edf\uff0c\u9762\u5bf9\u5b8c\u5168\u4e0d\u53ef\u4fe1\u7684\u670d\u52a1\u5668\uff0c\u63d0\u4f9b\u673a\u5bc6\u6027\u548c\u5b8c\u6574\u6027\u3002\u53c2\u8003\u8bba\u6587\u4e3a SUNDR","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%B3%BB%E7%BB%9F%E5%AE%89%E5%85%A8/MIT6.858/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2alab + Final Project / Lab5","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS106L/","text":"CS106L: Standard C++ Programming \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6700\u597d\u638c\u63e1\u81f3\u5c11\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a20\u5c0f\u65f6 \u6211\u4ece\u5927\u4e00\u5f00\u59cb\u4e00\u76f4\u90fd\u662f\u5199\u7684C++\u4ee3\u7801\uff0c\u76f4\u5230\u5b66\u5b8c\u8fd9\u95e8\u8bfe\u6211\u624d\u610f\u8bc6\u5230\uff0c\u6211\u5199\u7684C++\u4ee3\u7801\u5927\u6982\u53ea\u662fC\u8bed\u8a00 + cin/cout\u800c\u5df2\u3002 \u8fd9\u95e8\u8bfe\u4f1a\u6df1\u5165\u5230\u5f88\u591a\u6807\u51c6C++\u7684\u7279\u6027\u548c\u8bed\u6cd5\uff0c\u8ba9\u4f60\u7f16\u5199\u51fa\u9ad8\u8d28\u91cf\u7684C++\u4ee3\u7801\u3002\u4f8b\u5982auto binding\uff0cuniform initialization\uff0clambda function\uff0cmove semantics\uff0cRAII\u7b49\u6280\u5de7\u90fd\u5728\u6211\u6b64\u540e\u7684\u4ee3\u7801\u751f\u6daf\u4e2d\u88ab\u53cd\u590d\u7528\u5230\uff0c\u975e\u5e38\u5b9e\u7528\u3002 \u503c\u5f97\u4e00\u63d0\u7684\u662f\uff0c\u8fd9\u95e8\u8bfe\u7684\u4f5c\u4e1a\u91cc\u4f60\u4f1a\u5b9e\u73b0\u4e00\u4e2aHashMap\uff08\u7c7b\u4f3c\u4e8eSTL\u4e2d\u7684unordered map), \u8fd9\u4e2a\u4f5c\u4e1a\u51e0\u4e4e\u628a\u6574\u4e2a\u8bfe\u7a0b\u4e32\u8054\u4e86\u8d77\u6765\uff0c\u975e\u5e38\u8003\u9a8c\u4ee3\u7801\u80fd\u529b\u3002\u7279\u522b\u662fiterator\u7684\u5b9e\u73b0\uff0c\u505a\u5b8c\u8fd9\u4e2a\u4f5c\u4e1a\u6211\u5f00\u59cb\u7406\u89e3\u4e3a\u4ec0\u4e48Linus\u5bf9C/C++\u55e4\u4e4b\u4ee5\u9f3b\u4e86\uff0c\u56e0\u4e3a\u771f\u7684\u5f88\u96be\u5199\u5bf9\u3002 \u603b\u7684\u6765\u8bb2\u8fd9\u95e8\u8bfe\u5e76\u4e0d\u96be\uff0c\u4f46\u662f\u4fe1\u606f\u91cf\u5f88\u5927\uff0c\u9700\u8981\u4f60\u5728\u4e4b\u540e\u7684\u5f00\u53d1\u5b9e\u8df5\u4e2d\u53cd\u590d\u5de9\u56fa\u3002Stanford\u4e4b\u6240\u4ee5\u5355\u5f00\u4e00\u95e8C++\u7684\u7f16\u7a0b\u8bfe\uff0c\u662f\u56e0\u4e3a\u5b83\u540e\u7eed\u7684\u5f88\u591aCS\u8bfe\u7a0bProject\u90fd\u662f\u57fa\u4e8eC++\u7684\u3002\u4f8b\u5982CS144\u8ba1\u7b97\u673a\u7f51\u7edc\u548cCS143\u7f16\u8bd1\u5668\u3002\u8fd9\u4e24\u95e8\u8bfe\u5728\u672c\u4e66\u4e2d\u5747\u6709\u6536\u5f55\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u5177\u4f53\u5185\u5bb9\u89c1\u8bfe\u7a0b\u7f51\u7ad9\uff0c\u6211\u505a\u7684\u65f6\u5019\u4e00\u5171\u662f\u4e24\u4e2a\uff1a (1\uff09\u5b9e\u73b0\u4e00\u4e2aWikiRacer\u7684\u5c0f\u6e38\u620f (2\uff09\u5b9e\u73b0\u4e00\u4e2a\u7c7b\u4f3cSTL\u5e93\u7684HashMap \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Stanford CS106L: Standard C++ Programming"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS106L/#cs106l-standard-c-programming","text":"","title":"CS106L: Standard C++ Programming"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS106L/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6700\u597d\u638c\u63e1\u81f3\u5c11\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a20\u5c0f\u65f6 \u6211\u4ece\u5927\u4e00\u5f00\u59cb\u4e00\u76f4\u90fd\u662f\u5199\u7684C++\u4ee3\u7801\uff0c\u76f4\u5230\u5b66\u5b8c\u8fd9\u95e8\u8bfe\u6211\u624d\u610f\u8bc6\u5230\uff0c\u6211\u5199\u7684C++\u4ee3\u7801\u5927\u6982\u53ea\u662fC\u8bed\u8a00 + cin/cout\u800c\u5df2\u3002 \u8fd9\u95e8\u8bfe\u4f1a\u6df1\u5165\u5230\u5f88\u591a\u6807\u51c6C++\u7684\u7279\u6027\u548c\u8bed\u6cd5\uff0c\u8ba9\u4f60\u7f16\u5199\u51fa\u9ad8\u8d28\u91cf\u7684C++\u4ee3\u7801\u3002\u4f8b\u5982auto binding\uff0cuniform initialization\uff0clambda function\uff0cmove semantics\uff0cRAII\u7b49\u6280\u5de7\u90fd\u5728\u6211\u6b64\u540e\u7684\u4ee3\u7801\u751f\u6daf\u4e2d\u88ab\u53cd\u590d\u7528\u5230\uff0c\u975e\u5e38\u5b9e\u7528\u3002 \u503c\u5f97\u4e00\u63d0\u7684\u662f\uff0c\u8fd9\u95e8\u8bfe\u7684\u4f5c\u4e1a\u91cc\u4f60\u4f1a\u5b9e\u73b0\u4e00\u4e2aHashMap\uff08\u7c7b\u4f3c\u4e8eSTL\u4e2d\u7684unordered map), \u8fd9\u4e2a\u4f5c\u4e1a\u51e0\u4e4e\u628a\u6574\u4e2a\u8bfe\u7a0b\u4e32\u8054\u4e86\u8d77\u6765\uff0c\u975e\u5e38\u8003\u9a8c\u4ee3\u7801\u80fd\u529b\u3002\u7279\u522b\u662fiterator\u7684\u5b9e\u73b0\uff0c\u505a\u5b8c\u8fd9\u4e2a\u4f5c\u4e1a\u6211\u5f00\u59cb\u7406\u89e3\u4e3a\u4ec0\u4e48Linus\u5bf9C/C++\u55e4\u4e4b\u4ee5\u9f3b\u4e86\uff0c\u56e0\u4e3a\u771f\u7684\u5f88\u96be\u5199\u5bf9\u3002 \u603b\u7684\u6765\u8bb2\u8fd9\u95e8\u8bfe\u5e76\u4e0d\u96be\uff0c\u4f46\u662f\u4fe1\u606f\u91cf\u5f88\u5927\uff0c\u9700\u8981\u4f60\u5728\u4e4b\u540e\u7684\u5f00\u53d1\u5b9e\u8df5\u4e2d\u53cd\u590d\u5de9\u56fa\u3002Stanford\u4e4b\u6240\u4ee5\u5355\u5f00\u4e00\u95e8C++\u7684\u7f16\u7a0b\u8bfe\uff0c\u662f\u56e0\u4e3a\u5b83\u540e\u7eed\u7684\u5f88\u591aCS\u8bfe\u7a0bProject\u90fd\u662f\u57fa\u4e8eC++\u7684\u3002\u4f8b\u5982CS144\u8ba1\u7b97\u673a\u7f51\u7edc\u548cCS143\u7f16\u8bd1\u5668\u3002\u8fd9\u4e24\u95e8\u8bfe\u5728\u672c\u4e66\u4e2d\u5747\u6709\u6536\u5f55\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS106L/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u5177\u4f53\u5185\u5bb9\u89c1\u8bfe\u7a0b\u7f51\u7ad9\uff0c\u6211\u505a\u7684\u65f6\u5019\u4e00\u5171\u662f\u4e24\u4e2a\uff1a (1\uff09\u5b9e\u73b0\u4e00\u4e2aWikiRacer\u7684\u5c0f\u6e38\u620f (2\uff09\u5b9e\u73b0\u4e00\u4e2a\u7c7b\u4f3cSTL\u5e93\u7684HashMap","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS106L/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS110L/","text":"CS110L: Safety in Systems Programming \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6700\u597d\u6709\u4e00\u5b9a\u7684\u7f16\u7a0b\u80cc\u666f\u5e76\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u6709\u521d\u6b65\u7684\u8ba4\u8bc6\u3002 \u7f16\u7a0b\u8bed\u8a00\uff1aRust \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a30\u5c0f\u65f6 \u5728\u8fd9\u95e8\u8bfe\u4e2d\u4f60\u5c06\u4f1a\u5b66\u4e60Rust\u8fd9\u95e8\u795e\u5947\u7684\u8bed\u8a00\u3002 \u5982\u679c\u4f60\u5b66\u8fc7C\u5e76\u63a5\u89e6\u8fc7\u4e00\u4e9b\u7cfb\u7edf\u7f16\u7a0b\u7684\u8bdd\uff0c\u5e94\u8be5\u5bf9C\u7684\u5185\u5b58\u6cc4\u6f0f\u4ee5\u53ca\u6307\u9488\u7684\u5371\u9669\u6709\u6240\u8033\u95fb\uff0c\u4f46C\u7684\u5e95\u5c42\u7279\u6027\u4ee5\u53ca\u9ad8\u6548\u4ecd\u7136\u8ba9\u5b83\u5728\u7cfb\u7edf\u7ea7\u7f16\u7a0b\u4e2d\u65e0\u6cd5\u88ab\u4f8b\u5982Java\u7b49\u81ea\u5e26\u5783\u573e\u6536\u96c6\u673a\u5236\u7684\u9ad8\u7ea7\u8bed\u8a00\u6240\u66ff\u4ee3\u3002\u800cRust\u7684\u76ee\u6807\u5219\u662f\u5e0c\u671b\u5728C\u7684\u9ad8\u6548\u57fa\u7840\u4e0a\uff0c\u5f25\u8865\u5176\u5b89\u5168\u4e0d\u8db3\u7684\u7f3a\u70b9\u3002\u56e0\u6b64Rust\u5728\u8bbe\u8ba1\u4e4b\u521d\uff0c\u5c31\u6709\u5e26\u6709\u5f88\u591a\u7cfb\u7edf\u7f16\u7a0b\u7684\u89c2\u70b9\u3002\u5b66\u4e60Rust\uff0c\u4e5f\u80fd\u8ba9\u4f60\u4e4b\u540e\u80fd\u7528C\u8bed\u8a00\u7f16\u5199\u51fa\u66f4\u5b89\u5168\u66f4\u4f18\u96c5\u7684\u7cfb\u7edf\u7ea7\u4ee3\u7801\uff08\u4f8b\u5982\u64cd\u4f5c\u7cfb\u7edf\u7b49\uff09\u3002 \u8fd9\u95e8\u8bfe\u7684\u540e\u534a\u90e8\u5206\u5173\u6ce8\u5728\u5e76\u53d1\uff08concurrency\uff09\u8fd9\u4e00\u4e3b\u9898\u4e0a\uff0c\u4f60\u5c06\u4f1a\u7cfb\u7edf\u5730\u638c\u63e1\u591a\u8fdb\u7a0b\u3001\u591a\u7ebf\u7a0b\u3001\u57fa\u4e8e\u4e8b\u4ef6\u9a71\u52a8\u7684\u5e76\u53d1\u7b49\u82e5\u5e72\u5e76\u53d1\u6280\u672f\uff0c\u5e76\u5728\u7b2c\u4e8c\u4e2aproject\u4e2d\u6bd4\u8f83\u5b83\u4eec\u5404\u81ea\u7684\u4f18\u52a3\u3002Rust\u4e2d\u201cfutures\u201d\u7684\u6982\u5ff5\u975e\u5e38\u6709\u8da3\u548c\u4f18\u96c5\uff0c\u8fd9\u4e9b\u57fa\u7840\u77e5\u8bc6\u5bf9\u4f60\u540e\u7eed\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u76f8\u5173\u8bfe\u7a0b\u7684\u5b66\u4e60\u5f88\u6709\u5e2e\u52a9\u3002\u53e6\u5916\uff0c\u6e05\u534e\u5927\u5b66\u7684\u64cd\u7edf\u5b9e\u9a8crCore\u5c31\u662f\u57fa\u4e8eRust\u7f16\u5199\u7684\uff0c\u5177\u4f53\u53c2\u89c1 \u6587\u6863 \u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u51716\u4e2alab\u548c2\u4e2aproject\uff0c\u4f5c\u4e1a\u6587\u6863\u548c\u4ee3\u7801\u6846\u67b6\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002\u5176\u4e2d\u4e24\u4e2aproject\u975e\u5e38\u6709\u8da3\uff0c\u5206\u522b\u662f\uff1a \uff081\uff09\u7528Rust\u5b9e\u73b0\u4e00\u4e2a\u7c7b\u4f3c\u4e8egdb\u7684debugger \uff082\uff09\u7528Rust\u5b9e\u73b0\u4e00\u4e2a\u8d1f\u8f7d\u5747\u8861\u5668 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Stanford CS110L: Safety in Systems Programming"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS110L/#cs110l-safety-in-systems-programming","text":"","title":"CS110L: Safety in Systems Programming"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS110L/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u6700\u597d\u6709\u4e00\u5b9a\u7684\u7f16\u7a0b\u80cc\u666f\u5e76\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u6709\u521d\u6b65\u7684\u8ba4\u8bc6\u3002 \u7f16\u7a0b\u8bed\u8a00\uff1aRust \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a30\u5c0f\u65f6 \u5728\u8fd9\u95e8\u8bfe\u4e2d\u4f60\u5c06\u4f1a\u5b66\u4e60Rust\u8fd9\u95e8\u795e\u5947\u7684\u8bed\u8a00\u3002 \u5982\u679c\u4f60\u5b66\u8fc7C\u5e76\u63a5\u89e6\u8fc7\u4e00\u4e9b\u7cfb\u7edf\u7f16\u7a0b\u7684\u8bdd\uff0c\u5e94\u8be5\u5bf9C\u7684\u5185\u5b58\u6cc4\u6f0f\u4ee5\u53ca\u6307\u9488\u7684\u5371\u9669\u6709\u6240\u8033\u95fb\uff0c\u4f46C\u7684\u5e95\u5c42\u7279\u6027\u4ee5\u53ca\u9ad8\u6548\u4ecd\u7136\u8ba9\u5b83\u5728\u7cfb\u7edf\u7ea7\u7f16\u7a0b\u4e2d\u65e0\u6cd5\u88ab\u4f8b\u5982Java\u7b49\u81ea\u5e26\u5783\u573e\u6536\u96c6\u673a\u5236\u7684\u9ad8\u7ea7\u8bed\u8a00\u6240\u66ff\u4ee3\u3002\u800cRust\u7684\u76ee\u6807\u5219\u662f\u5e0c\u671b\u5728C\u7684\u9ad8\u6548\u57fa\u7840\u4e0a\uff0c\u5f25\u8865\u5176\u5b89\u5168\u4e0d\u8db3\u7684\u7f3a\u70b9\u3002\u56e0\u6b64Rust\u5728\u8bbe\u8ba1\u4e4b\u521d\uff0c\u5c31\u6709\u5e26\u6709\u5f88\u591a\u7cfb\u7edf\u7f16\u7a0b\u7684\u89c2\u70b9\u3002\u5b66\u4e60Rust\uff0c\u4e5f\u80fd\u8ba9\u4f60\u4e4b\u540e\u80fd\u7528C\u8bed\u8a00\u7f16\u5199\u51fa\u66f4\u5b89\u5168\u66f4\u4f18\u96c5\u7684\u7cfb\u7edf\u7ea7\u4ee3\u7801\uff08\u4f8b\u5982\u64cd\u4f5c\u7cfb\u7edf\u7b49\uff09\u3002 \u8fd9\u95e8\u8bfe\u7684\u540e\u534a\u90e8\u5206\u5173\u6ce8\u5728\u5e76\u53d1\uff08concurrency\uff09\u8fd9\u4e00\u4e3b\u9898\u4e0a\uff0c\u4f60\u5c06\u4f1a\u7cfb\u7edf\u5730\u638c\u63e1\u591a\u8fdb\u7a0b\u3001\u591a\u7ebf\u7a0b\u3001\u57fa\u4e8e\u4e8b\u4ef6\u9a71\u52a8\u7684\u5e76\u53d1\u7b49\u82e5\u5e72\u5e76\u53d1\u6280\u672f\uff0c\u5e76\u5728\u7b2c\u4e8c\u4e2aproject\u4e2d\u6bd4\u8f83\u5b83\u4eec\u5404\u81ea\u7684\u4f18\u52a3\u3002Rust\u4e2d\u201cfutures\u201d\u7684\u6982\u5ff5\u975e\u5e38\u6709\u8da3\u548c\u4f18\u96c5\uff0c\u8fd9\u4e9b\u57fa\u7840\u77e5\u8bc6\u5bf9\u4f60\u540e\u7eed\u5bf9\u8ba1\u7b97\u673a\u7cfb\u7edf\u76f8\u5173\u8bfe\u7a0b\u7684\u5b66\u4e60\u5f88\u6709\u5e2e\u52a9\u3002\u53e6\u5916\uff0c\u6e05\u534e\u5927\u5b66\u7684\u64cd\u7edf\u5b9e\u9a8crCore\u5c31\u662f\u57fa\u4e8eRust\u7f16\u5199\u7684\uff0c\u5177\u4f53\u53c2\u89c1 \u6587\u6863 \u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS110L/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u51716\u4e2alab\u548c2\u4e2aproject\uff0c\u4f5c\u4e1a\u6587\u6863\u548c\u4ee3\u7801\u6846\u67b6\u8be6\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002\u5176\u4e2d\u4e24\u4e2aproject\u975e\u5e38\u6709\u8da3\uff0c\u5206\u522b\u662f\uff1a \uff081\uff09\u7528Rust\u5b9e\u73b0\u4e00\u4e2a\u7c7b\u4f3c\u4e8egdb\u7684debugger \uff082\uff09\u7528Rust\u5b9e\u73b0\u4e00\u4e2a\u8d1f\u8f7d\u5747\u8861\u5668","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS110L/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS50/","text":"CS50: This is CS50x \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1a\u54c8\u4f5b\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aC\uff0cPython\uff0cSQL\uff0cHTML\uff0cCSS\uff0cJavaScript \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a20\u5c0f\u65f6 \u8fde\u7eed\u591a\u5e74\u88ab\u54c8\u4f5b\u5927\u5b66\u5b66\u751f\u8bc4\u4e3a\u6700\u53d7\u6b22\u8fce\u7684\u516c\u9009\u8bfe\u7a0b\u3002Malan\u6559\u6388\u4e0a\u8bfe\u975e\u5e38\u6709\u6fc0\u60c5\uff0c\u6495\u9ec4\u9875\u8bb2\u4e8c\u5206\u6cd5\u7684\u573a\u9762\u8ba9\u4eba\u8bb0\u5fc6\u72b9\u65b0\uff08\u7b11\uff09\u3002\u4f46\u56e0\u4e3a\u5b83\u7684\u5165\u95e8\u4ee5\u53ca\u5168\u6821\u516c\u9009\u7684\u5c5e\u6027\uff0c\u8bfe\u7a0b\u5185\u5bb9\u96be\u5ea6\u6bd4\u8f83\u6e29\u548c\uff0c\u4f46\u662f\u8bfe\u7a0b\u4f5c\u4e1a\u8d28\u91cf\u975e\u5e38\u9ad8\u800c\u4e14\u5168\u90e8\u514d\u8d39\u5f00\u6e90\uff0c\u975e\u5e38\u9002\u5408\u5c0f\u767d\u5165\u95e8\uff0c\u6216\u8005\u5927\u4f6c\u4f11\u95f2\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a","title":"Harvard CS50: This is CS50x"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS50/#cs50-this-is-cs50x","text":"","title":"CS50: This is CS50x"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS50/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1a\u54c8\u4f5b\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aC\uff0cPython\uff0cSQL\uff0cHTML\uff0cCSS\uff0cJavaScript \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a20\u5c0f\u65f6 \u8fde\u7eed\u591a\u5e74\u88ab\u54c8\u4f5b\u5927\u5b66\u5b66\u751f\u8bc4\u4e3a\u6700\u53d7\u6b22\u8fce\u7684\u516c\u9009\u8bfe\u7a0b\u3002Malan\u6559\u6388\u4e0a\u8bfe\u975e\u5e38\u6709\u6fc0\u60c5\uff0c\u6495\u9ec4\u9875\u8bb2\u4e8c\u5206\u6cd5\u7684\u573a\u9762\u8ba9\u4eba\u8bb0\u5fc6\u72b9\u65b0\uff08\u7b11\uff09\u3002\u4f46\u56e0\u4e3a\u5b83\u7684\u5165\u95e8\u4ee5\u53ca\u5168\u6821\u516c\u9009\u7684\u5c5e\u6027\uff0c\u8bfe\u7a0b\u5185\u5bb9\u96be\u5ea6\u6bd4\u8f83\u6e29\u548c\uff0c\u4f46\u662f\u8bfe\u7a0b\u4f5c\u4e1a\u8d28\u91cf\u975e\u5e38\u9ad8\u800c\u4e14\u5168\u90e8\u514d\u8d39\u5f00\u6e90\uff0c\u975e\u5e38\u9002\u5408\u5c0f\u767d\u5165\u95e8\uff0c\u6216\u8005\u5927\u4f6c\u4f11\u95f2\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS50/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS61A/","text":"CS61A: Structure and Interpretation of Computer Programs \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aPython\uff0cScheme\uff0cSQL \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50\u5c0f\u65f6 \u4f2f\u514b\u5229CS61\u7cfb\u5217\u7684\u7b2c\u4e00\u95e8\u8bfe\u7a0b\uff0c\u4e5f\u662f\u6211\u7684Python\u5165\u95e8\u8bfe\u3002 CS61\u7cfb\u5217\u662f\u4f2f\u514b\u5229CS\u4e13\u4e1a\u7684\u5165\u95e8\u8bfe\uff0c\u5176\u4e2d\uff1a CS61A\uff1a\u5f3a\u8c03\u62bd\u8c61\uff0c\u8ba9\u5b66\u751f\u638c\u63e1\u7528\u7a0b\u5e8f\u6765\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\uff0c\u800c\u4e0d\u5173\u6ce8\u5e95\u5c42\u7684\u786c\u4ef6\u7ec6\u8282\u3002 CS61B\uff1a\u6ce8\u91cd\u7b97\u6cd5\u4e0e\u6570\u636e\u7ed3\u6784\u4ee5\u53ca\u5927\u89c4\u6a21\u7a0b\u5e8f\u7684\u6784\u5efa\uff0c\u5b66\u751f\u4f1a\u7528Java\u8bed\u8a00\u7ed3\u5408\u7b97\u6cd5\u4e0e\u6570\u636e\u7ed3\u6784\u7684\u77e5\u8bc6\u6765\u6784\u5efa\u5343\u884c\u4ee3\u7801\u7ea7\u522b\u7684\u5927\u578b\u9879\u76ee\uff08\u4e00\u4e2a\u7b80\u6613\u7684\u8c37\u6b4c\u5730\u56fe\uff0c\u4e00\u4e2a\u4e8c\u7ef4\u7248\u7684Minecraft\uff09\u3002 CS61C\uff1a\u5173\u6ce8\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u8ba9\u5b66\u751f\u7406\u89e3\u9ad8\u7ea7\u8bed\u8a00\uff08\u4f8b\u5982C\uff09\u662f\u5982\u4f55\u4e00\u6b65\u6b65\u8f6c\u6362\u4e3a\u673a\u5668\u53ef\u4ee5\u7406\u89e3\u768401\u4e32\u5e76\u5728CPU\u6267\u884c\u7684\uff0c\u5b66\u751f\u5c06\u4f1a\u5b66\u4e60RISC-V\u67b6\u6784\u5e76\u81ea\u5df1\u7528Logism\u5b9e\u73b0\u4e00\u4e2aCPU\u3002 CS61B\u548cCS61C\u5728\u672c\u4e66\u4e2d\u5747\u6709\u6536\u5f55\u3002 \u56de\u5230CS61A\uff0c\u6ce8\u610f\u8fd9\u4e0d\u4ec5\u4ec5\u662f\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00\u8bfe\uff0c\u800c\u662f\u4f1a\u6df1\u5165\u5230\u7a0b\u5e8f\u6784\u9020\u4e0e\u8fd0\u884c\u7684\u539f\u7406\u3002\u6700\u540e\u4f60\u5c06\u5728\u7b2c4\u4e2aProject\u4e2d\u7528Python\u5b9e\u73b0\u4e00\u4e2aScheme\u7684\u89e3\u91ca\u5668\u3002\u6b64\u5916\uff0c\u62bd\u8c61\u5c06\u662f\u8fd9\u95e8\u8bfe\u7684\u4e00\u5927\u4e3b\u9898\uff0c\u4f60\u5c06\u5b66\u4e60\u5230\u51fd\u6570\u5f0f\u7f16\u7a0b\u3001\u6570\u636e\u62bd\u8c61\u3001\u9762\u5411\u5bf9\u8c61\u7b49\u7b49\u77e5\u8bc6\u6765\u8ba9\u4f60\u7684\u4ee3\u7801\u66f4\u6613\u8bfb\uff0c\u66f4\u6a21\u5757\u5316\u3002\u5f53\u7136\uff0c\u5b66\u4e60\u7f16\u7a0b\u8bed\u8a00\u4e5f\u662f\u8fd9\u95e8\u8bfe\u7684\u4e00\u5927\u5185\u5bb9\uff0c\u4f60\u5c06\u4f1a\u638c\u63e1Python\u3001Scheme\u548cSQL\u8fd9\u4e09\u79cd\u7f16\u7a0b\u8bed\u8a00\uff0c\u5728\u5b83\u4eec\u7684\u5b66\u4e60\u548c\u6bd4\u8f83\u4e2d\uff0c\u76f8\u4fe1\u4f60\u4f1a\u62e5\u6709\u5feb\u901f\u638c\u63e1\u4e00\u95e8\u65b0\u7684\u7f16\u7a0b\u8bed\u8a00\u7684\u80fd\u529b\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891: \u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u8bfe\u7a0b\u7f51\u7ad9\u4f1a\u6709\u6bcf\u4e2a\u4f5c\u4e1a\u5bf9\u5e94\u7684\u6587\u6863\u94fe\u63a5\u4ee5\u53ca\u4ee3\u7801\u6846\u67b6\u7684\u4e0b\u8f7d\u94fe\u63a5\u3002 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS61A: Structure and Interpretation of Computer Programs"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS61A/#cs61a-structure-and-interpretation-of-computer-programs","text":"","title":"CS61A: Structure and Interpretation of Computer Programs"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS61A/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aPython\uff0cScheme\uff0cSQL \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a50\u5c0f\u65f6 \u4f2f\u514b\u5229CS61\u7cfb\u5217\u7684\u7b2c\u4e00\u95e8\u8bfe\u7a0b\uff0c\u4e5f\u662f\u6211\u7684Python\u5165\u95e8\u8bfe\u3002 CS61\u7cfb\u5217\u662f\u4f2f\u514b\u5229CS\u4e13\u4e1a\u7684\u5165\u95e8\u8bfe\uff0c\u5176\u4e2d\uff1a CS61A\uff1a\u5f3a\u8c03\u62bd\u8c61\uff0c\u8ba9\u5b66\u751f\u638c\u63e1\u7528\u7a0b\u5e8f\u6765\u89e3\u51b3\u5b9e\u9645\u95ee\u9898\uff0c\u800c\u4e0d\u5173\u6ce8\u5e95\u5c42\u7684\u786c\u4ef6\u7ec6\u8282\u3002 CS61B\uff1a\u6ce8\u91cd\u7b97\u6cd5\u4e0e\u6570\u636e\u7ed3\u6784\u4ee5\u53ca\u5927\u89c4\u6a21\u7a0b\u5e8f\u7684\u6784\u5efa\uff0c\u5b66\u751f\u4f1a\u7528Java\u8bed\u8a00\u7ed3\u5408\u7b97\u6cd5\u4e0e\u6570\u636e\u7ed3\u6784\u7684\u77e5\u8bc6\u6765\u6784\u5efa\u5343\u884c\u4ee3\u7801\u7ea7\u522b\u7684\u5927\u578b\u9879\u76ee\uff08\u4e00\u4e2a\u7b80\u6613\u7684\u8c37\u6b4c\u5730\u56fe\uff0c\u4e00\u4e2a\u4e8c\u7ef4\u7248\u7684Minecraft\uff09\u3002 CS61C\uff1a\u5173\u6ce8\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784\uff0c\u8ba9\u5b66\u751f\u7406\u89e3\u9ad8\u7ea7\u8bed\u8a00\uff08\u4f8b\u5982C\uff09\u662f\u5982\u4f55\u4e00\u6b65\u6b65\u8f6c\u6362\u4e3a\u673a\u5668\u53ef\u4ee5\u7406\u89e3\u768401\u4e32\u5e76\u5728CPU\u6267\u884c\u7684\uff0c\u5b66\u751f\u5c06\u4f1a\u5b66\u4e60RISC-V\u67b6\u6784\u5e76\u81ea\u5df1\u7528Logism\u5b9e\u73b0\u4e00\u4e2aCPU\u3002 CS61B\u548cCS61C\u5728\u672c\u4e66\u4e2d\u5747\u6709\u6536\u5f55\u3002 \u56de\u5230CS61A\uff0c\u6ce8\u610f\u8fd9\u4e0d\u4ec5\u4ec5\u662f\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00\u8bfe\uff0c\u800c\u662f\u4f1a\u6df1\u5165\u5230\u7a0b\u5e8f\u6784\u9020\u4e0e\u8fd0\u884c\u7684\u539f\u7406\u3002\u6700\u540e\u4f60\u5c06\u5728\u7b2c4\u4e2aProject\u4e2d\u7528Python\u5b9e\u73b0\u4e00\u4e2aScheme\u7684\u89e3\u91ca\u5668\u3002\u6b64\u5916\uff0c\u62bd\u8c61\u5c06\u662f\u8fd9\u95e8\u8bfe\u7684\u4e00\u5927\u4e3b\u9898\uff0c\u4f60\u5c06\u5b66\u4e60\u5230\u51fd\u6570\u5f0f\u7f16\u7a0b\u3001\u6570\u636e\u62bd\u8c61\u3001\u9762\u5411\u5bf9\u8c61\u7b49\u7b49\u77e5\u8bc6\u6765\u8ba9\u4f60\u7684\u4ee3\u7801\u66f4\u6613\u8bfb\uff0c\u66f4\u6a21\u5757\u5316\u3002\u5f53\u7136\uff0c\u5b66\u4e60\u7f16\u7a0b\u8bed\u8a00\u4e5f\u662f\u8fd9\u95e8\u8bfe\u7684\u4e00\u5927\u5185\u5bb9\uff0c\u4f60\u5c06\u4f1a\u638c\u63e1Python\u3001Scheme\u548cSQL\u8fd9\u4e09\u79cd\u7f16\u7a0b\u8bed\u8a00\uff0c\u5728\u5b83\u4eec\u7684\u5b66\u4e60\u548c\u6bd4\u8f83\u4e2d\uff0c\u76f8\u4fe1\u4f60\u4f1a\u62e5\u6709\u5feb\u901f\u638c\u63e1\u4e00\u95e8\u65b0\u7684\u7f16\u7a0b\u8bed\u8a00\u7684\u80fd\u529b\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS61A/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891: \u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u94fe\u63a5 \u8bfe\u7a0b\u6559\u6750 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u8bfe\u7a0b\u7f51\u7ad9\u4f1a\u6709\u6bcf\u4e2a\u4f5c\u4e1a\u5bf9\u5e94\u7684\u6587\u6863\u94fe\u63a5\u4ee5\u53ca\u4ee3\u7801\u6846\u67b6\u7684\u4e0b\u8f7d\u94fe\u63a5\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/CS61A/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/MIT-Missing-Semester/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1ashell \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a10\u5c0f\u65f6 \u6b63\u5982\u8bfe\u7a0b\u540d\u5b57\u6240\u8a00\uff1a\u201c\u8ba1\u7b97\u673a\u6559\u5b66\u4e2d\u6d88\u5931\u7684\u4e00\u4e2a\u5b66\u671f\u201d\uff0c\u8fd9\u95e8\u8bfe\u5c06\u4f1a\u6559\u4f1a\u4f60\u8bb8\u591a\u5927\u5b66\u7684\u8bfe\u5802\u4e0a\u4e0d\u4f1a\u6d89\u53ca\u4f46\u5374\u5bf9\u6bcf\u4e2aCSer\u65e0\u6bd4\u91cd\u8981\u7684\u5de5\u5177\u6216\u8005\u77e5\u8bc6\u70b9\u3002\u4f8b\u5982Shell\u7f16\u7a0b\u3001\u547d\u4ee4\u884c\u914d\u7f6e\u3001Git\u3001Vim\u3001tmux\u3001ssh\u7b49\u7b49\u3002\u5982\u679c\u4f60\u662f\u4e00\u4e2a\u8ba1\u7b97\u673a\u5c0f\u767d\uff0c\u90a3\u4e48\u6211\u975e\u5e38\u5efa\u8bae\u4f60\u5b66\u4e60\u4e00\u4e0b\u8fd9\u95e8\u8bfe\uff0c\u56e0\u4e3a\u5b83\u57fa\u672c\u6d89\u53ca\u4e86\u672c\u4e66\u5fc5\u5b66\u5de5\u5177\u4e2d\u7684\u7edd\u5927\u90e8\u5206\u5185\u5bb9\u3002 \u9664\u4e86MIT\u5b98\u65b9\u7684\u5b66\u4e60\u8d44\u6599\u5916\uff0c\u5317\u4eac\u5927\u5b66\u56fe\u7075\u73ed\u5f00\u8bbe\u7684\u524d\u6cbf\u8ba1\u7b97\u5b9e\u8df5\u4e2d\u4e5f\u5f00\u8bbe\u4e86\u76f8\u5173\u8bfe\u7a0b\uff0c\u8d44\u6599\u4f4d\u4e8e \u8fd9\u4e2a\u7f51\u7ad9 \u4e0b\uff0c\u4f9b\u5927\u5bb6\u53c2\u8003\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u4e00\u4e9b\u968f\u5802\u5c0f\u7ec3\u4e60\uff0c\u5177\u4f53\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002","title":"MIT-Missing-Semester"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/MIT-Missing-Semester/#_1","text":"\u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1ashell \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a10\u5c0f\u65f6 \u6b63\u5982\u8bfe\u7a0b\u540d\u5b57\u6240\u8a00\uff1a\u201c\u8ba1\u7b97\u673a\u6559\u5b66\u4e2d\u6d88\u5931\u7684\u4e00\u4e2a\u5b66\u671f\u201d\uff0c\u8fd9\u95e8\u8bfe\u5c06\u4f1a\u6559\u4f1a\u4f60\u8bb8\u591a\u5927\u5b66\u7684\u8bfe\u5802\u4e0a\u4e0d\u4f1a\u6d89\u53ca\u4f46\u5374\u5bf9\u6bcf\u4e2aCSer\u65e0\u6bd4\u91cd\u8981\u7684\u5de5\u5177\u6216\u8005\u77e5\u8bc6\u70b9\u3002\u4f8b\u5982Shell\u7f16\u7a0b\u3001\u547d\u4ee4\u884c\u914d\u7f6e\u3001Git\u3001Vim\u3001tmux\u3001ssh\u7b49\u7b49\u3002\u5982\u679c\u4f60\u662f\u4e00\u4e2a\u8ba1\u7b97\u673a\u5c0f\u767d\uff0c\u90a3\u4e48\u6211\u975e\u5e38\u5efa\u8bae\u4f60\u5b66\u4e60\u4e00\u4e0b\u8fd9\u95e8\u8bfe\uff0c\u56e0\u4e3a\u5b83\u57fa\u672c\u6d89\u53ca\u4e86\u672c\u4e66\u5fc5\u5b66\u5de5\u5177\u4e2d\u7684\u7edd\u5927\u90e8\u5206\u5185\u5bb9\u3002 \u9664\u4e86MIT\u5b98\u65b9\u7684\u5b66\u4e60\u8d44\u6599\u5916\uff0c\u5317\u4eac\u5927\u5b66\u56fe\u7075\u73ed\u5f00\u8bbe\u7684\u524d\u6cbf\u8ba1\u7b97\u5b9e\u8df5\u4e2d\u4e5f\u5f00\u8bbe\u4e86\u76f8\u5173\u8bfe\u7a0b\uff0c\u8d44\u6599\u4f4d\u4e8e \u8fd9\u4e2a\u7f51\u7ad9 \u4e0b\uff0c\u4f9b\u5927\u5bb6\u53c2\u8003\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%BC%96%E7%A8%8B%E5%85%A5%E9%97%A8/MIT-Missing-Semester/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u4e00\u4e9b\u968f\u5802\u5c0f\u7ec3\u4e60\uff0c\u5177\u4f53\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%BC%96%E8%AF%91%E5%8E%9F%E7%90%86/6035/","text":"","title":"6035"},{"location":"%E7%BC%96%E8%AF%91%E5%8E%9F%E7%90%86/CS143/","text":"Stanford CS143: Compilers \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784 \u7f16\u7a0b\u8bed\u8a00\uff1aJava\u6216C++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u65af\u5766\u798f\u7684\u7f16\u8bd1\u539f\u7406\u8bfe\u7a0b\uff0c\u8bbe\u8ba1\u8005\u5f00\u53d1\u4e86\u4e00\u4e2aClass-Object-Oriented-Language\uff0c\u7b80\u79f0COOL\u8bed\u8a00\u3002\u8fd9\u95e8\u8bfe\u7684\u6838\u5fc3\u5c31\u662f\u901a\u8fc7\u7406\u8bba\u77e5\u8bc6\u7684\u5b66\u4e60\uff0c\u4e3aCOOL\u8bed\u8a00\u5b9e\u73b0\u4e00\u4e2a\u7f16\u8bd1\u5668\uff0c\u5c06COOL\u9ad8\u7ea7\u8bed\u8a00\u7f16\u8bd1\u4e3aMIPS\u6c47\u7f16\u5e76\u5728Spim\u8fd9\u4e2aMIPS\u6a21\u62df\u5668\u4e0a\u6210\u529f\u6267\u884c\u3002 \u7406\u8bba\u90e8\u5206\u57fa\u672c\u6309\u7167\u9f99\u4e66\u7684\u987a\u5e8f\u8986\u76d6\u4e86\u8bcd\u6cd5\u5206\u6790\u3001\u8bed\u6cd5\u5206\u6790\u3001\u8bed\u4e49\u5206\u6790\u3001\u8fd0\u884c\u65f6\u73af\u5883\u3001\u5bc4\u5b58\u5668\u5206\u914d\u3001\u4ee3\u7801\u4f18\u5316\u4e0e\u751f\u6210\u7b49\u5185\u5bb9\uff0c\u5b9e\u8df5\u90e8\u5206\u5219\u76f8\u5e94\u5730\u5206\u4e3a\u8bcd\u6cd5\u5206\u6790\u3001\u8bed\u6cd5\u5206\u6790\u3001\u8bed\u4e49\u5206\u6790\u3001\u4ee3\u7801\u751f\u6210\u56db\u4e2a\u9636\u6bb5\uff0c\u96be\u5ea6\u5faa\u5e8f\u6e10\u8fdb\uff0c\u5e76\u5728\u4f18\u5316\u90e8\u5206\u7ed9\u5b66\u751f\u7559\u4e0b\u4e86\u5f88\u5927\u7684\u8bbe\u8ba1\u7a7a\u95f4\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u9f99\u4e66 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a5\u4e2a\u4e66\u9762\u4f5c\u4e1a + 5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u5e26\u4f60\u5b9e\u73b0\u4e00\u4e2a\u7f16\u8bd1\u5668 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Stanford CS143: Compilers"},{"location":"%E7%BC%96%E8%AF%91%E5%8E%9F%E7%90%86/CS143/#stanford-cs143-compilers","text":"","title":"Stanford CS143: Compilers"},{"location":"%E7%BC%96%E8%AF%91%E5%8E%9F%E7%90%86/CS143/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u8ba1\u7b97\u673a\u4f53\u7cfb\u7ed3\u6784 \u7f16\u7a0b\u8bed\u8a00\uff1aJava\u6216C++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a150\u5c0f\u65f6 \u65af\u5766\u798f\u7684\u7f16\u8bd1\u539f\u7406\u8bfe\u7a0b\uff0c\u8bbe\u8ba1\u8005\u5f00\u53d1\u4e86\u4e00\u4e2aClass-Object-Oriented-Language\uff0c\u7b80\u79f0COOL\u8bed\u8a00\u3002\u8fd9\u95e8\u8bfe\u7684\u6838\u5fc3\u5c31\u662f\u901a\u8fc7\u7406\u8bba\u77e5\u8bc6\u7684\u5b66\u4e60\uff0c\u4e3aCOOL\u8bed\u8a00\u5b9e\u73b0\u4e00\u4e2a\u7f16\u8bd1\u5668\uff0c\u5c06COOL\u9ad8\u7ea7\u8bed\u8a00\u7f16\u8bd1\u4e3aMIPS\u6c47\u7f16\u5e76\u5728Spim\u8fd9\u4e2aMIPS\u6a21\u62df\u5668\u4e0a\u6210\u529f\u6267\u884c\u3002 \u7406\u8bba\u90e8\u5206\u57fa\u672c\u6309\u7167\u9f99\u4e66\u7684\u987a\u5e8f\u8986\u76d6\u4e86\u8bcd\u6cd5\u5206\u6790\u3001\u8bed\u6cd5\u5206\u6790\u3001\u8bed\u4e49\u5206\u6790\u3001\u8fd0\u884c\u65f6\u73af\u5883\u3001\u5bc4\u5b58\u5668\u5206\u914d\u3001\u4ee3\u7801\u4f18\u5316\u4e0e\u751f\u6210\u7b49\u5185\u5bb9\uff0c\u5b9e\u8df5\u90e8\u5206\u5219\u76f8\u5e94\u5730\u5206\u4e3a\u8bcd\u6cd5\u5206\u6790\u3001\u8bed\u6cd5\u5206\u6790\u3001\u8bed\u4e49\u5206\u6790\u3001\u4ee3\u7801\u751f\u6210\u56db\u4e2a\u9636\u6bb5\uff0c\u96be\u5ea6\u5faa\u5e8f\u6e10\u8fdb\uff0c\u5e76\u5728\u4f18\u5316\u90e8\u5206\u7ed9\u5b66\u751f\u7559\u4e0b\u4e86\u5f88\u5927\u7684\u8bbe\u8ba1\u7a7a\u95f4\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E7%BC%96%E8%AF%91%E5%8E%9F%E7%90%86/CS143/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u9f99\u4e66 \u8bfe\u7a0b\u4f5c\u4e1a\uff1a5\u4e2a\u4e66\u9762\u4f5c\u4e1a + 5\u4e2a\u7f16\u7a0b\u4f5c\u4e1a\u5e26\u4f60\u5b9e\u73b0\u4e00\u4e2a\u7f16\u8bd1\u5668","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E7%BC%96%E8%AF%91%E5%8E%9F%E7%90%86/CS143/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%9B%BE%E5%BD%A2%E5%AD%A6/CS184/","text":"","title":"CS184"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%9B%BE%E5%BD%A2%E5%AD%A6/GAMES101/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUCSB \u5148\u4fee\u8981\u6c42\uff1a\u7ebf\u6027\u4ee3\u6570\uff0c\u9ad8\u7b49\u6570\u5b66\uff0cC++ \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u5b98\u65b9\u4ecb\u7ecd: \u672c\u8bfe\u7a0b\u5c06\u5168\u9762\u800c\u7cfb\u7edf\u5730\u4ecb\u7ecd\u73b0\u4ee3\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66\u7684\u56db\u5927\u7ec4\u6210\u90e8\u5206\uff1a\uff081\uff09\u5149\u6805\u5316\u6210\u50cf\uff0c\uff082\uff09\u51e0\u4f55\u8868\u793a\uff0c\uff083\uff09\u5149\u7684\u4f20\u64ad\u7406\u8bba\uff0c\u4ee5\u53ca\uff084\uff09\u52a8\u753b\u4e0e\u6a21\u62df\u3002\u6bcf\u4e2a\u65b9\u9762\u90fd\u4f1a\u4ece\u57fa\u7840\u539f\u7406\u51fa\u53d1\u8bb2\u89e3\u5230\u5b9e\u9645\u5e94\u7528\uff0c\u5e76\u4ecb\u7ecd\u524d\u6cbf\u7684\u7406\u8bba\u7814\u7a76\u3002\u901a\u8fc7\u672c\u8bfe\u7a0b\uff0c\u4f60\u53ef\u4ee5\u5b66\u4e60\u5230\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66\u80cc\u540e\u7684\u6570\u5b66\u548c\u7269\u7406\u77e5\u8bc6\uff0c\u5e76\u953b\u70bc\u5b9e\u9645\u7684\u7f16\u7a0b\u80fd\u529b\u3002 \u987e\u540d\u601d\u4e49\uff0c\u4f5c\u4e3a\u5165\u95e8\uff0c\u672c\u8bfe\u7a0b\u4f1a\u5c3d\u53ef\u80fd\u7684\u8986\u76d6\u56fe\u5f62\u5b66\u7684\u65b9\u65b9\u9762\u9762\uff0c\u628a\u6bcf\u4e00\u90e8\u5206\u7684\u57fa\u672c\u6982\u5ff5\u90fd\u5c3d\u53ef\u80fd\u8bf4\u6e05\u695a\uff0c\u8ba9\u5927\u5bb6\u5bf9\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66\u6709\u4e00\u4e2a\u5b8c\u6574\u7684\u3001\u81ea\u4e0a\u800c\u4e0b\u7684\u5168\u5c40\u628a\u63e1\u3002\u5168\u5c40\u7684\u7406\u89e3\u5f88\u91cd\u8981\uff0c\u5b66\u5b8c\u672c\u8bfe\u7a0b\u540e\uff0c\u4f60\u4f1a\u4e86\u89e3\u5230\u56fe\u5f62\u5b66\u4e0d\u7b49\u4e8e OpenGL\uff0c\u4e0d\u7b49\u4e8e\u5149\u7ebf\u8ffd\u8e2a\uff0c\u800c\u662f\u4e00\u5957\u751f\u6210\u6574\u4e2a\u865a\u62df\u4e16\u754c\u7684\u65b9\u6cd5\u3002\u4ece\u672c\u8bfe\u7a0b\u7684\u6807\u9898\uff0c\u5927\u5bb6\u8fd8\u53ef\u4ee5\u770b\u5230\u201c\u73b0\u4ee3\u201d\u4e8c\u5b57\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c\u8fd9\u95e8\u8bfe\u6240\u8981\u7ed9\u5927\u5bb6\u4ecb\u7ecd\u7684\u90fd\u662f\u73b0\u4ee3\u5316\u7684\u77e5\u8bc6\uff0c\u4e5f\u90fd\u662f\u73b0\u4ee3\u56fe\u5f62\u5b66\u5de5\u4e1a\u754c\u9700\u8981\u7684\u56fe\u5f62\u5b66\u57fa\u7840\u3002 \u56fd\u5185\u76f8\u5f53\u6709\u540d\u7684\u56fe\u5f62\u5b66\u516c\u5f00\u8bfe\u3002\u548c\u5927\u5bb6\u5370\u8c61\u4e2d\u7684\u56fe\u5f62\u5b66\u91cc\u5168\u90fd\u662f\u6570\u5b66\u548c\u5947\u602a\u7684\u7b97\u6cd5\u4e0d\u540c\uff0c\u8fd9\u95e8\u8bfe\u4ee5\u5341\u5206\u751f\u52a8\u7684\u65b9\u5f0f\u5e26\u6211\u4eec\u8fdb\u5165\u4e86\u56fe\u5f62\u5b66\u8fd9\u4e2a\u9886\u57df\u7684\u5927\u95e8\u3002 \u6bcf\u4e2aproject\u4ee3\u7801\u91cf\u90fd\u4e0d\u4f1a\u5f88\u591a\uff0c\u4f46\u662f\u5374\u90fd\u5341\u5206\u6709\u8da3\u3002\u5728\u505a\u8fd9\u4e9bproject\u7684\u8fc7\u7a0b\u4e2d\uff0c\u6211\u4eec\u4f1a\u5b9e\u73b0\u7b80\u5355\u7684\u5149\u6805\u5316\uff0c\u5e76\u6e32\u67d3\u4e00\u4e2a\u7b80\u6613\u7684\u6a21\u578b\uff0c\u6211\u4eec\u8fd8\u4f1a\u5b9e\u73b0\u5149\u7ebf\u8ffd\u8e2a\uff0c\u4ee5\u8ffd\u6c42\u6e32\u67d3\u66f4\u597d\u7684\u8d28\u91cf\u3002\u6bcf\u4e2aproject\u4e2d\u8fd8\u6709\u9009\u505a\u7b49\u62d3\u5c55\u4f5c\u4e1a\uff0c\u53ef\u4ee5\u8ba9\u6211\u4eec\u6e32\u67d3\u7684\u6a21\u578b\u5177\u6709\u66f4\u597d\u7684\u8d28\u91cf\uff0c\u66f4\u5feb\u7684\u6e32\u67d3\u901f\u5ea6\u3002 \u559c\u6b22\u73a9\u6e38\u620f\u7684\u540c\u5b66\u5e94\u8be5\u5bf9\u5b9e\u65f6\u5149\u7ebf\u8ffd\u8e2a\u6709\u4e00\u5b9a\u7684\u4e86\u89e3\uff0c\u8fd9\u95e8\u8bfe\u7684\u8001\u5e08\u95eb\u4ee4\u742a\u5c31\u5bf9\u8fd9\u4e00\u6280\u672f\u6709\u76f4\u63a5\u7684\u63a8\u52a8\u4f5c\u7528\u3002 \u8ddf\u7740\u8bfe\u7a0b\u7684\u89c6\u9891\uff0c\u505a\u5b8c\u6bcf\u4e00\u4e2aproject\uff0c\u76f8\u4fe1\u4f60\u4f1a\u548c\u6211\u4e00\u6837\u5bf9\u56fe\u5f62\u5b66\uff0c\u4ee5\u53ca\u73b0\u4ee3\u7684\u6e32\u67d3\u6280\u672f\u4ea7\u751f\u6d53\u539a\u7684\u5174\u8da3\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a GAMES101 \uff0c GAMES101 \u8bfe\u7a0b\u89c6\u9891\uff1a bilibili \uff0c \u5b98\u7f51 \u8bfe\u7a0b\u6559\u6750\uff1aFundamentals of Computer Graphics \u8bfe\u7a0b\u4f5c\u4e1a\uff1a 8\u4e2aproject \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"GAMES101"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%9B%BE%E5%BD%A2%E5%AD%A6/GAMES101/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUCSB \u5148\u4fee\u8981\u6c42\uff1a\u7ebf\u6027\u4ee3\u6570\uff0c\u9ad8\u7b49\u6570\u5b66\uff0cC++ \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a80\u5c0f\u65f6 \u5b98\u65b9\u4ecb\u7ecd: \u672c\u8bfe\u7a0b\u5c06\u5168\u9762\u800c\u7cfb\u7edf\u5730\u4ecb\u7ecd\u73b0\u4ee3\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66\u7684\u56db\u5927\u7ec4\u6210\u90e8\u5206\uff1a\uff081\uff09\u5149\u6805\u5316\u6210\u50cf\uff0c\uff082\uff09\u51e0\u4f55\u8868\u793a\uff0c\uff083\uff09\u5149\u7684\u4f20\u64ad\u7406\u8bba\uff0c\u4ee5\u53ca\uff084\uff09\u52a8\u753b\u4e0e\u6a21\u62df\u3002\u6bcf\u4e2a\u65b9\u9762\u90fd\u4f1a\u4ece\u57fa\u7840\u539f\u7406\u51fa\u53d1\u8bb2\u89e3\u5230\u5b9e\u9645\u5e94\u7528\uff0c\u5e76\u4ecb\u7ecd\u524d\u6cbf\u7684\u7406\u8bba\u7814\u7a76\u3002\u901a\u8fc7\u672c\u8bfe\u7a0b\uff0c\u4f60\u53ef\u4ee5\u5b66\u4e60\u5230\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66\u80cc\u540e\u7684\u6570\u5b66\u548c\u7269\u7406\u77e5\u8bc6\uff0c\u5e76\u953b\u70bc\u5b9e\u9645\u7684\u7f16\u7a0b\u80fd\u529b\u3002 \u987e\u540d\u601d\u4e49\uff0c\u4f5c\u4e3a\u5165\u95e8\uff0c\u672c\u8bfe\u7a0b\u4f1a\u5c3d\u53ef\u80fd\u7684\u8986\u76d6\u56fe\u5f62\u5b66\u7684\u65b9\u65b9\u9762\u9762\uff0c\u628a\u6bcf\u4e00\u90e8\u5206\u7684\u57fa\u672c\u6982\u5ff5\u90fd\u5c3d\u53ef\u80fd\u8bf4\u6e05\u695a\uff0c\u8ba9\u5927\u5bb6\u5bf9\u8ba1\u7b97\u673a\u56fe\u5f62\u5b66\u6709\u4e00\u4e2a\u5b8c\u6574\u7684\u3001\u81ea\u4e0a\u800c\u4e0b\u7684\u5168\u5c40\u628a\u63e1\u3002\u5168\u5c40\u7684\u7406\u89e3\u5f88\u91cd\u8981\uff0c\u5b66\u5b8c\u672c\u8bfe\u7a0b\u540e\uff0c\u4f60\u4f1a\u4e86\u89e3\u5230\u56fe\u5f62\u5b66\u4e0d\u7b49\u4e8e OpenGL\uff0c\u4e0d\u7b49\u4e8e\u5149\u7ebf\u8ffd\u8e2a\uff0c\u800c\u662f\u4e00\u5957\u751f\u6210\u6574\u4e2a\u865a\u62df\u4e16\u754c\u7684\u65b9\u6cd5\u3002\u4ece\u672c\u8bfe\u7a0b\u7684\u6807\u9898\uff0c\u5927\u5bb6\u8fd8\u53ef\u4ee5\u770b\u5230\u201c\u73b0\u4ee3\u201d\u4e8c\u5b57\uff0c\u4e5f\u5c31\u662f\u8bf4\uff0c\u8fd9\u95e8\u8bfe\u6240\u8981\u7ed9\u5927\u5bb6\u4ecb\u7ecd\u7684\u90fd\u662f\u73b0\u4ee3\u5316\u7684\u77e5\u8bc6\uff0c\u4e5f\u90fd\u662f\u73b0\u4ee3\u56fe\u5f62\u5b66\u5de5\u4e1a\u754c\u9700\u8981\u7684\u56fe\u5f62\u5b66\u57fa\u7840\u3002 \u56fd\u5185\u76f8\u5f53\u6709\u540d\u7684\u56fe\u5f62\u5b66\u516c\u5f00\u8bfe\u3002\u548c\u5927\u5bb6\u5370\u8c61\u4e2d\u7684\u56fe\u5f62\u5b66\u91cc\u5168\u90fd\u662f\u6570\u5b66\u548c\u5947\u602a\u7684\u7b97\u6cd5\u4e0d\u540c\uff0c\u8fd9\u95e8\u8bfe\u4ee5\u5341\u5206\u751f\u52a8\u7684\u65b9\u5f0f\u5e26\u6211\u4eec\u8fdb\u5165\u4e86\u56fe\u5f62\u5b66\u8fd9\u4e2a\u9886\u57df\u7684\u5927\u95e8\u3002 \u6bcf\u4e2aproject\u4ee3\u7801\u91cf\u90fd\u4e0d\u4f1a\u5f88\u591a\uff0c\u4f46\u662f\u5374\u90fd\u5341\u5206\u6709\u8da3\u3002\u5728\u505a\u8fd9\u4e9bproject\u7684\u8fc7\u7a0b\u4e2d\uff0c\u6211\u4eec\u4f1a\u5b9e\u73b0\u7b80\u5355\u7684\u5149\u6805\u5316\uff0c\u5e76\u6e32\u67d3\u4e00\u4e2a\u7b80\u6613\u7684\u6a21\u578b\uff0c\u6211\u4eec\u8fd8\u4f1a\u5b9e\u73b0\u5149\u7ebf\u8ffd\u8e2a\uff0c\u4ee5\u8ffd\u6c42\u6e32\u67d3\u66f4\u597d\u7684\u8d28\u91cf\u3002\u6bcf\u4e2aproject\u4e2d\u8fd8\u6709\u9009\u505a\u7b49\u62d3\u5c55\u4f5c\u4e1a\uff0c\u53ef\u4ee5\u8ba9\u6211\u4eec\u6e32\u67d3\u7684\u6a21\u578b\u5177\u6709\u66f4\u597d\u7684\u8d28\u91cf\uff0c\u66f4\u5feb\u7684\u6e32\u67d3\u901f\u5ea6\u3002 \u559c\u6b22\u73a9\u6e38\u620f\u7684\u540c\u5b66\u5e94\u8be5\u5bf9\u5b9e\u65f6\u5149\u7ebf\u8ffd\u8e2a\u6709\u4e00\u5b9a\u7684\u4e86\u89e3\uff0c\u8fd9\u95e8\u8bfe\u7684\u8001\u5e08\u95eb\u4ee4\u742a\u5c31\u5bf9\u8fd9\u4e00\u6280\u672f\u6709\u76f4\u63a5\u7684\u63a8\u52a8\u4f5c\u7528\u3002 \u8ddf\u7740\u8bfe\u7a0b\u7684\u89c6\u9891\uff0c\u505a\u5b8c\u6bcf\u4e00\u4e2aproject\uff0c\u76f8\u4fe1\u4f60\u4f1a\u548c\u6211\u4e00\u6837\u5bf9\u56fe\u5f62\u5b66\uff0c\u4ee5\u53ca\u73b0\u4ee3\u7684\u6e32\u67d3\u6280\u672f\u4ea7\u751f\u6d53\u539a\u7684\u5174\u8da3\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%9B%BE%E5%BD%A2%E5%AD%A6/GAMES101/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a GAMES101 \uff0c GAMES101 \u8bfe\u7a0b\u89c6\u9891\uff1a bilibili \uff0c \u5b98\u7f51 \u8bfe\u7a0b\u6559\u6750\uff1aFundamentals of Computer Graphics \u8bfe\u7a0b\u4f5c\u4e1a\uff1a 8\u4e2aproject","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E5%9B%BE%E5%BD%A2%E5%AD%A6/GAMES101/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/CS144/","text":"CS144: Computer Network \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u4e00\u5b9a\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u57fa\u7840\uff0cCS106L \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u7684\u4e3b\u8bb2\u4eba\u4e4b\u4e00\u662f\u7f51\u7edc\u9886\u57df\u7684\u5de8\u64d8 Nick McKeown \u6559\u6388\u3002\u8fd9\u4f4d\u62e5\u6709\u81ea\u5df1\u521b\u4e1a\u516c\u53f8\u7684\u5b66\u754c\u4e1a\u754c\u53cc\u5de8\u4f6c\u4f1a\u5728\u4ed6\u6155\u8bfe\u6bcf\u4e00\u7ae0\u8282\u7684\u6700\u540e\u91c7\u8bbf\u4e00\u4f4d\u4e1a\u754c\u7684\u9ad8\u7ba1\u6216\u8005\u5b66\u754c\u7684\u9ad8\u4eba\uff0c\u975e\u5e38\u5f00\u9614\u773c\u754c\u3002 \u5728\u8fd9\u95e8\u8bfe\u7684Project\u4e2d\uff0c\u4f60\u5c06\u7528C++\u5faa\u5e8f\u6e10\u8fdb\u5730\u642d\u5efa\u51fa\u6574\u4e2aTCP/IP\u534f\u8bae\u6808\uff0c\u5b9e\u73b0IP\u8def\u7531\u4ee5\u53caARP\u534f\u8bae\uff0c\u6700\u540e\u5229\u7528\u4f60\u81ea\u5df1\u7684\u534f\u8bae\u6808\u4ee3\u66ffLinux Kernel\u7684\u7f51\u7edc\u534f\u8bae\u6808\u548c\u5176\u4ed6\u5b66\u751f\u7684\u8ba1\u7b97\u673a\u8fdb\u884c\u901a\u4fe1\uff0c\u975e\u5e38amazing\uff01 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a8\u4e2aProject\u5e26\u4f60\u5b9e\u73b0\u6574\u4e2aTCP/IP\u534f\u8bae\u6808 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Stanford CS144: Computer Network"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/CS144/#cs144-computer-network","text":"","title":"CS144: Computer Network"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/CS144/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aStanford \u5148\u4fee\u8981\u6c42\uff1a\u4e00\u5b9a\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u57fa\u7840\uff0cCS106L \u7f16\u7a0b\u8bed\u8a00\uff1aC++ \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u7684\u4e3b\u8bb2\u4eba\u4e4b\u4e00\u662f\u7f51\u7edc\u9886\u57df\u7684\u5de8\u64d8 Nick McKeown \u6559\u6388\u3002\u8fd9\u4f4d\u62e5\u6709\u81ea\u5df1\u521b\u4e1a\u516c\u53f8\u7684\u5b66\u754c\u4e1a\u754c\u53cc\u5de8\u4f6c\u4f1a\u5728\u4ed6\u6155\u8bfe\u6bcf\u4e00\u7ae0\u8282\u7684\u6700\u540e\u91c7\u8bbf\u4e00\u4f4d\u4e1a\u754c\u7684\u9ad8\u7ba1\u6216\u8005\u5b66\u754c\u7684\u9ad8\u4eba\uff0c\u975e\u5e38\u5f00\u9614\u773c\u754c\u3002 \u5728\u8fd9\u95e8\u8bfe\u7684Project\u4e2d\uff0c\u4f60\u5c06\u7528C++\u5faa\u5e8f\u6e10\u8fdb\u5730\u642d\u5efa\u51fa\u6574\u4e2aTCP/IP\u534f\u8bae\u6808\uff0c\u5b9e\u73b0IP\u8def\u7531\u4ee5\u53caARP\u534f\u8bae\uff0c\u6700\u540e\u5229\u7528\u4f60\u81ea\u5df1\u7684\u534f\u8bae\u6808\u4ee3\u66ffLinux Kernel\u7684\u7f51\u7edc\u534f\u8bae\u6808\u548c\u5176\u4ed6\u5b66\u751f\u7684\u8ba1\u7b97\u673a\u8fdb\u884c\u901a\u4fe1\uff0c\u975e\u5e38amazing\uff01","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/CS144/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1a\u65e0 \u8bfe\u7a0b\u4f5c\u4e1a \uff1a8\u4e2aProject\u5e26\u4f60\u5b9e\u73b0\u6574\u4e2aTCP/IP\u534f\u8bae\u6808","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/CS144/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/topdown/","text":"Computer Networking: A Top-Down Approach \u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1a\u9a6c\u8428\u8bf8\u585e\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u6709\u4e00\u5b9a\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u57fa\u7840 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a40\u5c0f\u65f6 \u300a\u81ea\u9876\u5411\u4e0b\u65b9\u6cd5\u300b\u662f\u8ba1\u7b97\u673a\u7f51\u7edc\u9886\u57df\u7684\u4e00\u672c\u7ecf\u5178\u6559\u6750\uff0c\u4e24\u4f4d\u4f5c\u8005Jim Kurose\u548cKeith Ross\u7cbe\u5fc3\u5236\u4f5c\u4e86\u6559\u6750\u914d\u5957\u7684\u8bfe\u7a0b\u7f51\u7ad9\uff0c\u5e76\u4e14\u516c\u5f00\u4e86\u81ea\u5df1\u5f55\u5236\u7684\u7f51\u8bfe\u89c6\u9891\uff0c\u4ea4\u4e92\u5f0f\u7684\u5728\u7ebf\u7ae0\u8282\u6d4b\u8bd5\uff0c\u4ee5\u53ca\u5229\u7528wireshark\u8fdb\u884c\u6293\u5305\u5206\u6790\u7684lab\u3002\u552f\u4e00\u9057\u61be\u7684\u662f\u8fd9\u95e8\u8bfe\u5e76\u6ca1\u6709\u786c\u6838\u7684\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u800cStanford\u7684 CS144 \u80fd\u5f88\u597d\u5730\u5f25\u8865\u8fd9\u4e00\u70b9\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aComputer Networking: A Top-Down Approach \u8bfe\u7a0b\u4f5c\u4e1a \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"Computer Networking: A Top-Down Approach"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/topdown/#computer-networking-a-top-down-approach","text":"","title":"Computer Networking: A Top-Down Approach"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/topdown/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1a\u9a6c\u8428\u8bf8\u585e\u5927\u5b66 \u5148\u4fee\u8981\u6c42\uff1a\u6709\u4e00\u5b9a\u7684\u8ba1\u7b97\u673a\u7cfb\u7edf\u57fa\u7840 \u7f16\u7a0b\u8bed\u8a00\uff1a\u65e0 \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a40\u5c0f\u65f6 \u300a\u81ea\u9876\u5411\u4e0b\u65b9\u6cd5\u300b\u662f\u8ba1\u7b97\u673a\u7f51\u7edc\u9886\u57df\u7684\u4e00\u672c\u7ecf\u5178\u6559\u6750\uff0c\u4e24\u4f4d\u4f5c\u8005Jim Kurose\u548cKeith Ross\u7cbe\u5fc3\u5236\u4f5c\u4e86\u6559\u6750\u914d\u5957\u7684\u8bfe\u7a0b\u7f51\u7ad9\uff0c\u5e76\u4e14\u516c\u5f00\u4e86\u81ea\u5df1\u5f55\u5236\u7684\u7f51\u8bfe\u89c6\u9891\uff0c\u4ea4\u4e92\u5f0f\u7684\u5728\u7ebf\u7ae0\u8282\u6d4b\u8bd5\uff0c\u4ee5\u53ca\u5229\u7528wireshark\u8fdb\u884c\u6293\u5305\u5206\u6790\u7684lab\u3002\u552f\u4e00\u9057\u61be\u7684\u662f\u8fd9\u95e8\u8bfe\u5e76\u6ca1\u6709\u786c\u6838\u7684\u7f16\u7a0b\u4f5c\u4e1a\uff0c\u800cStanford\u7684 CS144 \u80fd\u5f88\u597d\u5730\u5f25\u8865\u8fd9\u4e00\u70b9\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/topdown/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891 \u8bfe\u7a0b\u6559\u6750\uff1aComputer Networking: A Top-Down Approach \u8bfe\u7a0b\u4f5c\u4e1a","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E8%AE%A1%E7%AE%97%E6%9C%BA%E7%BD%91%E7%BB%9C/topdown/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/6031/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u638c\u63e1\u81f3\u5c11\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u7684\u76ee\u6807\u5c31\u662f\u8ba9\u5b66\u751f\u5b66\u4f1a\u5982\u4f55\u5199\u51fa\u9ad8\u8d28\u91cf\u7684\u4ee3\u7801\uff0c\u6240\u8c13\u9ad8\u8d28\u91cf\uff0c\u5219\u662f\u6ee1\u8db3\u4e0b\u9762\u4e09\u4e2a\u76ee\u6807\uff08\u8bfe\u7a0b\u8bbe\u8ba1\u8005\u539f\u8bdd\u590d\u5236\uff0c\u4ee5\u9632\u81ea\u5df1\u7ffb\u8bd1\u66f2\u89e3\u672c\u610f\uff09\uff1a Safe from bugs. Correctness (correct behavior right now) and defensiveness (correct behavior in the future) are required in any software we build. Easy to understand. The code has to communicate to future programmers who need to understand it and make changes in it (fixing bugs or adding new features). That future programmer might be you, months or years from now. You\u2019ll be surprised how much you forget if you don\u2019t write it down, and how much it helps your own future self to have a good design. Ready for change. Software always changes. Some designs make it easy to make changes; others require throwing away and rewriting a lot of code. \u4e3a\u6b64\uff0c\u8fd9\u95e8\u8bfe\u7684\u8bbe\u8ba1\u8005\u4eec\u7cbe\u5fc3\u7f16\u5199\u4e86\u4e00\u672c\u4e66\u6765\u9610\u91ca\u8bf8\u591a\u8f6f\u4ef6\u6784\u5efa\u7684\u6838\u5fc3\u539f\u5219\u4e0e\u524d\u4eba\u603b\u7ed3\u4e0b\u6765\u7684\u5b9d\u8d35\u7ecf\u9a8c\uff0c\u5185\u5bb9\u7ec6\u8282\u5230\u5982\u4f55\u7f16\u5199\u6ce8\u91ca\u548c\u51fd\u6570Specification\uff0c\u5982\u4f55\u8bbe\u8ba1\u62bd\u8c61\u6570\u636e\u7ed3\u6784\u4ee5\u53ca\u8bf8\u591a\u5e76\u884c\u7f16\u7a0b\u7684\u5185\u5bb9\uff0c\u5e76\u4e14\u4f1a\u8ba9\u4f60\u5728\u7cbe\u5fc3\u8bbe\u8ba1\u7684Java\u7f16\u7a0b\u9879\u76ee\u91cc\u4f53\u9a8c\u548c\u7ec3\u4e60\u8fd9\u4e9b\u7f16\u7a0b\u6a21\u5f0f\u3002 2016\u5e74\u6625\u5b63\u5b66\u671f\u8fd9\u95e8\u8bfe\u5f00\u6e90\u4e86\u5176\u6240\u6709\u7f16\u7a0b\u4f5c\u4e1a\u7684\u4ee3\u7801\u6846\u67b6\uff0c\u800c\u6700\u65b0\u7684\u8bfe\u7a0b\u6559\u6750\u53ef\u4ee5\u5728\u5176\u6700\u65b0\u7684\u6559\u5b66\u7f51\u7ad9\u4e0a\u627e\u5230\uff0c\u5177\u4f53\u94fe\u63a5\u53c2\u89c1\u4e0b\u65b9\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9\uff1a 2021spring \uff0c 2016spring \u8bfe\u7a0b\u89c6\u9891\uff1a\u65e0 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u7684\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2a\u7f16\u7a0b\u4f5c\u4e1a + 1\u4e2aProject \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"MIT 6.031: Software Construction"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/6031/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aMIT \u5148\u4fee\u8981\u6c42\uff1a\u638c\u63e1\u81f3\u5c11\u4e00\u95e8\u7f16\u7a0b\u8bed\u8a00 \u7f16\u7a0b\u8bed\u8a00\uff1aJava \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u8fd9\u95e8\u8bfe\u7684\u76ee\u6807\u5c31\u662f\u8ba9\u5b66\u751f\u5b66\u4f1a\u5982\u4f55\u5199\u51fa\u9ad8\u8d28\u91cf\u7684\u4ee3\u7801\uff0c\u6240\u8c13\u9ad8\u8d28\u91cf\uff0c\u5219\u662f\u6ee1\u8db3\u4e0b\u9762\u4e09\u4e2a\u76ee\u6807\uff08\u8bfe\u7a0b\u8bbe\u8ba1\u8005\u539f\u8bdd\u590d\u5236\uff0c\u4ee5\u9632\u81ea\u5df1\u7ffb\u8bd1\u66f2\u89e3\u672c\u610f\uff09\uff1a Safe from bugs. Correctness (correct behavior right now) and defensiveness (correct behavior in the future) are required in any software we build. Easy to understand. The code has to communicate to future programmers who need to understand it and make changes in it (fixing bugs or adding new features). That future programmer might be you, months or years from now. You\u2019ll be surprised how much you forget if you don\u2019t write it down, and how much it helps your own future self to have a good design. Ready for change. Software always changes. Some designs make it easy to make changes; others require throwing away and rewriting a lot of code. \u4e3a\u6b64\uff0c\u8fd9\u95e8\u8bfe\u7684\u8bbe\u8ba1\u8005\u4eec\u7cbe\u5fc3\u7f16\u5199\u4e86\u4e00\u672c\u4e66\u6765\u9610\u91ca\u8bf8\u591a\u8f6f\u4ef6\u6784\u5efa\u7684\u6838\u5fc3\u539f\u5219\u4e0e\u524d\u4eba\u603b\u7ed3\u4e0b\u6765\u7684\u5b9d\u8d35\u7ecf\u9a8c\uff0c\u5185\u5bb9\u7ec6\u8282\u5230\u5982\u4f55\u7f16\u5199\u6ce8\u91ca\u548c\u51fd\u6570Specification\uff0c\u5982\u4f55\u8bbe\u8ba1\u62bd\u8c61\u6570\u636e\u7ed3\u6784\u4ee5\u53ca\u8bf8\u591a\u5e76\u884c\u7f16\u7a0b\u7684\u5185\u5bb9\uff0c\u5e76\u4e14\u4f1a\u8ba9\u4f60\u5728\u7cbe\u5fc3\u8bbe\u8ba1\u7684Java\u7f16\u7a0b\u9879\u76ee\u91cc\u4f53\u9a8c\u548c\u7ec3\u4e60\u8fd9\u4e9b\u7f16\u7a0b\u6a21\u5f0f\u3002 2016\u5e74\u6625\u5b63\u5b66\u671f\u8fd9\u95e8\u8bfe\u5f00\u6e90\u4e86\u5176\u6240\u6709\u7f16\u7a0b\u4f5c\u4e1a\u7684\u4ee3\u7801\u6846\u67b6\uff0c\u800c\u6700\u65b0\u7684\u8bfe\u7a0b\u6559\u6750\u53ef\u4ee5\u5728\u5176\u6700\u65b0\u7684\u6559\u5b66\u7f51\u7ad9\u4e0a\u627e\u5230\uff0c\u5177\u4f53\u94fe\u63a5\u53c2\u89c1\u4e0b\u65b9\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/6031/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9\uff1a 2021spring \uff0c 2016spring \u8bfe\u7a0b\u89c6\u9891\uff1a\u65e0 \u8bfe\u7a0b\u6559\u6750\uff1a\u53c2\u89c1\u8bfe\u7a0b\u7f51\u7ad9\u7684\u8bfe\u7a0bnotes \u8bfe\u7a0b\u4f5c\u4e1a\uff1a4\u4e2a\u7f16\u7a0b\u4f5c\u4e1a + 1\u4e2aProject","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/6031/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/CS169/","text":"\u8bfe\u7a0b\u7b80\u4ecb \u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aRuby/JavaScript \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u8f6f\u4ef6\u5de5\u7a0b\u8bfe\u7a0b\uff0c\u4e0d\u540c\u4e8e\u5f88\u591a\u4f20\u7edf\u7684\u8f6f\u4ef6\u5de5\u7a0b\u8bfe\u5f3a\u8c03\u5404\u79cd\u7c7b\u56fe\u3001\u6587\u6863\u8bbe\u8ba1(plan and document\u6a21\u5f0f)\uff0c\u8fd9\u95e8\u8bfe\u4e13\u6ce8\u4e8e\u6700\u8fd1\u9010\u6e10\u6d41\u884c\u8d77\u6765\u7684\u654f\u6377\u5f00\u53d1(Agile Development)\u6a21\u5f0f\uff0c\u5229\u7528\u4e91\u5e73\u53f0\u63d0\u4f9b\u8f6f\u4ef6\u5373\u670d\u52a1(software as a service)\u3002\u4e3a\u6b64\uff0c\u8bfe\u7a0b\u8bbe\u8ba1\u8005\u7f16\u5199\u4e86 Software as a service \u8fd9\u672c\u6559\u6750\uff0c\u901a\u8fc7Ruby/Rails\u6846\u67b6\u6765\u9610\u91casaas\u8fd9\u4e2a\u6982\u5ff5\uff0c\u5e76\u4e14\u6709\u4e30\u5bcc\u7684\u914d\u5957\u7f16\u7a0b\u7ec3\u4e60\u3002 \u8fd9\u95e8\u8bfe\u5728 Edx \u8fd9\u4e2a\u7531MIT\u548cHavard\u5927\u5b66\u53d1\u8d77\u7684\u5728\u7ebf\u6559\u80b2\u5e73\u53f0\u5168\u8d44\u6599\u5f00\u6e90\uff0c\u5927\u5bb6\u53ef\u4ee5\u5728Edx\u81ea\u884c\u641c\u7d22 Agile SaaS Development \u8fd9\u95e8\u8bfe\u7a0b\u8fdb\u884c\u5b66\u4e60\u3002\u8bfe\u7a0b\u5185\u5bb9\u57fa\u672c\u6309\u7167\u6559\u6750\u7684\u987a\u5e8f\u5e26\u4f60\u4e00\u6b65\u6b65\u4ee5\u654f\u6377\u5f00\u53d1\u7684\u65b9\u5f0f\u642d\u5efa\u4e00\u4e2a\u8f6f\u4ef6\u5e76\u514d\u8d39\u90e8\u7f72\u5728\u4e91\u5e73\u53f0\u4e0a\u3002 \u8bfe\u7a0b\u8d44\u6e90 \u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1Edx\u8bfe\u7a0b\u4e3b\u9875\u3002 \u8bfe\u7a0b\u6559\u6750\uff1a Software as a service \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1Edx\u8bfe\u7a0b\u4e3b\u9875\u3002 \u8d44\u6e90\u6c47\u603b \u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"UCB CS169: software engineering"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/CS169/#_1","text":"\u6240\u5c5e\u5927\u5b66\uff1aUC Berkeley \u5148\u4fee\u8981\u6c42\uff1a\u65e0 \u7f16\u7a0b\u8bed\u8a00\uff1aRuby/JavaScript \u8bfe\u7a0b\u96be\u5ea6\uff1a\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f\ud83c\udf1f \u9884\u8ba1\u5b66\u65f6\uff1a100\u5c0f\u65f6 \u4f2f\u514b\u5229\u7684\u8f6f\u4ef6\u5de5\u7a0b\u8bfe\u7a0b\uff0c\u4e0d\u540c\u4e8e\u5f88\u591a\u4f20\u7edf\u7684\u8f6f\u4ef6\u5de5\u7a0b\u8bfe\u5f3a\u8c03\u5404\u79cd\u7c7b\u56fe\u3001\u6587\u6863\u8bbe\u8ba1(plan and document\u6a21\u5f0f)\uff0c\u8fd9\u95e8\u8bfe\u4e13\u6ce8\u4e8e\u6700\u8fd1\u9010\u6e10\u6d41\u884c\u8d77\u6765\u7684\u654f\u6377\u5f00\u53d1(Agile Development)\u6a21\u5f0f\uff0c\u5229\u7528\u4e91\u5e73\u53f0\u63d0\u4f9b\u8f6f\u4ef6\u5373\u670d\u52a1(software as a service)\u3002\u4e3a\u6b64\uff0c\u8bfe\u7a0b\u8bbe\u8ba1\u8005\u7f16\u5199\u4e86 Software as a service \u8fd9\u672c\u6559\u6750\uff0c\u901a\u8fc7Ruby/Rails\u6846\u67b6\u6765\u9610\u91casaas\u8fd9\u4e2a\u6982\u5ff5\uff0c\u5e76\u4e14\u6709\u4e30\u5bcc\u7684\u914d\u5957\u7f16\u7a0b\u7ec3\u4e60\u3002 \u8fd9\u95e8\u8bfe\u5728 Edx \u8fd9\u4e2a\u7531MIT\u548cHavard\u5927\u5b66\u53d1\u8d77\u7684\u5728\u7ebf\u6559\u80b2\u5e73\u53f0\u5168\u8d44\u6599\u5f00\u6e90\uff0c\u5927\u5bb6\u53ef\u4ee5\u5728Edx\u81ea\u884c\u641c\u7d22 Agile SaaS Development \u8fd9\u95e8\u8bfe\u7a0b\u8fdb\u884c\u5b66\u4e60\u3002\u8bfe\u7a0b\u5185\u5bb9\u57fa\u672c\u6309\u7167\u6559\u6750\u7684\u987a\u5e8f\u5e26\u4f60\u4e00\u6b65\u6b65\u4ee5\u654f\u6377\u5f00\u53d1\u7684\u65b9\u5f0f\u642d\u5efa\u4e00\u4e2a\u8f6f\u4ef6\u5e76\u514d\u8d39\u90e8\u7f72\u5728\u4e91\u5e73\u53f0\u4e0a\u3002","title":"\u8bfe\u7a0b\u7b80\u4ecb"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/CS169/#_2","text":"\u8bfe\u7a0b\u7f51\u7ad9 \u8bfe\u7a0b\u89c6\u9891\uff1a\u53c2\u89c1Edx\u8bfe\u7a0b\u4e3b\u9875\u3002 \u8bfe\u7a0b\u6559\u6750\uff1a Software as a service \u8bfe\u7a0b\u4f5c\u4e1a\uff1a\u53c2\u89c1Edx\u8bfe\u7a0b\u4e3b\u9875\u3002","title":"\u8bfe\u7a0b\u8d44\u6e90"},{"location":"%E8%BD%AF%E4%BB%B6%E5%B7%A5%E7%A8%8B/CS169/#_3","text":"\u6211\u5728\u5b66\u4e60\u8fd9\u95e8\u8bfe\u4e2d\u7528\u5230\u7684\u6240\u6709\u8d44\u6e90\u548c\u4f5c\u4e1a\u5b9e\u73b0\u90fd\u6c47\u603b\u5728 \u8fd9\u4e2aGithub\u4ed3\u5e93 \u4e2d\u3002","title":"\u8d44\u6e90\u6c47\u603b"}]} \ No newline at end of file diff --git a/sitemap.xml b/sitemap.xml new file mode 100644 index 00000000..80d24237 --- /dev/null +++ b/sitemap.xml @@ -0,0 +1,378 @@ + + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + + None + 2022-02-15 + daily + + \ No newline at end of file diff --git a/sitemap.xml.gz b/sitemap.xml.gz new file mode 100644 index 00000000..f98c6aa9 Binary files /dev/null and b/sitemap.xml.gz differ diff --git a/人工智能/CS188/index.html b/人工智能/CS188/index.html new file mode 100644 index 00000000..036e809e --- /dev/null +++ b/人工智能/CS188/index.html @@ -0,0 +1,2105 @@ + + + + + + + + + + + + + + + + UCB CS188: Introduction to Artificial Intelligence - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS188: Introduction to Artificial Intelligence

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS70
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:50小时
    • +
    +

    伯克利的人工智能入门课,课程notes写得非常深入浅出,基本不需要观看课程视频。课程内容的安排基本按照人工智能的经典教材Artificial intelligence: A Modern Approach的章节顺序,覆盖了搜索剪枝、约束满足问题、马尔可夫决策过程、强化学习、贝叶斯网络、隐马尔可夫模型以及基础的机器学习和神经网络的相关内容。

    +

    2018年秋季学期的版本免费开放了gradescope,大家可以在线完成书面作业并实时得到测评结果。同时课程的6个Project也是质量爆炸,复现了经典的Packman(吃豆人)小游戏,会让你利用学到的AI知识,去实现相关算法,让你的吃豆人在迷宫里自由穿梭,躲避鬼怪,收集豆子。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:每节课的链接详见课程网站
    • +
    • 课程教材:Artificial intelligence: A Modern Approach
    • +
    • 课程作业:14个在线测评书面作业和6个Project
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/人工智能/CS50/index.html b/人工智能/CS50/index.html new file mode 100644 index 00000000..35cb64db --- /dev/null +++ b/人工智能/CS50/index.html @@ -0,0 +1,2120 @@ + + + + + + + + + + + + + + + + Harvard CS50’s Introduction to AI with Python - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS50’s Introduction to AI with Python

    +

    课程简介

    +
      +
    • 所属大学:Harvard
    • +
    • 先修要求:基本概率论 + Python基础
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:30小时
    • +
    +

    一门非常基础的AI入门课,让人眼前一亮的是12个设计精巧的编程作业,都会用学到的AI知识去实现一个简易的游戏AI,比如用强化学习训练一个Nim游戏的AI,用alpha-beta剪枝去扫雷等等,非常适合新手入门或者大佬休闲。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/人工智能/CYJ/index.html b/人工智能/CYJ/index.html new file mode 100644 index 00000000..6d60de7a --- /dev/null +++ b/人工智能/CYJ/index.html @@ -0,0 +1,2122 @@ + + + + + + + + + + + + + + + + 智能计算系统 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    智能计算系统

    + +

    课程简介

    +
      +
    • 所属大学:中国科学院大学
    • +
    • 先修要求:体系结构,深度学习
    • +
    • 编程语言:Python,C++,BCL
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:100小时+
    • +
    +

    智能计算系统是智能的核心物质载体,每年全球要制造数以十亿计的智能计算系统(包括智能手机、智能服务器、智能可穿戴设备等),需要大量的智能计算系统的设计者和开发者。智能计算系统人才的培养直接关系到我国智能产业的核心竞争力。因此,对智能计算系统的认识和理解是智能时代计算机类专业学生培养方案中不可或缺的重要组成部分,是计算机类专业学生的核心竞争力。

    +

    国内的陈云霁老师开的课,在其他若干个大学也都有开对应的课程(比如我们这里)。这门课用一个个实验带大家以一个完整的视野理解人工智能的技术栈。从上层的深度学习框架,到用底层语言编写算子,再到硬件中MLU的设计,让大家形成系统思维,体会自上而下,融会贯通的乐趣。

    +

    课程资源

    +
      +
    • 课程网站:官网
    • +
    • 课程视频:bilibili
    • +
    • 课程教材:智能计算系统(陈云霁)
    • +
    • 课程作业:6个实验(包括编写卷积算子,为tensorflow添加算子,用BCL编写算子并集成到tensorflow中等)(具体内容在官网可以找到)
    • +
    • 实验手册:实验2.0指导手册
    • +
    • 学习笔记:参考实验手册总结的笔记
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    +

    我做了其中的2,3,4,5这几个实验,其中综合实验和硬件实验没有做,如果有做了的同学欢迎大家补上你的链接

    +

    个人体会是第三章实现算子的实验让我对深度学习框架的了解加深了很多。第五章的实验BCL语言编写算子如果了解CUDA的话会感觉很熟悉。

    +

    推荐去买一本教材看一看,会让我们理解整体的技术栈。熟悉深度学习的同学可以直接从第五章开始看,看看深度学习框架底层到底是什么样的。

    +

    我因为这门课的启发,参考一本书(书名在仓库中)写了一个简易的深度学习框架。在这个框架里可以看到智能计算系统实验中的一些影子。同时受到build-your-own-x系列的启发,我也打算写一下教程,教大家写一个自己的深度学习框架。代码用python写的,代码量较少,适合有一定基础的同学阅读。之后打算添加更多的算子,有望实现一个较为全面的框架,并希望移植到C++中,以兼顾性能与开发效率。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/体系结构/CS61C/index.html b/体系结构/CS61C/index.html new file mode 100644 index 00000000..3022478b --- /dev/null +++ b/体系结构/CS61C/index.html @@ -0,0 +1,2125 @@ + + + + + + + + + + + + + + + + UCB CS61C: Great Ideas in Computer Architecture - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS61C: Great Ideas in Computer Architecture

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61A, CS61B
    • +
    • 编程语言:C
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    伯克利CS61系列的最后一门课程,深入计算机的硬件细节,带领学生逐步理解C语言是如何一步步转化为RISC-V汇编并在CPU上执行的。和Nand2Tetris不同,这门课 +在难度和深度上都会大很多,具体会涉及到流水线、Cache、虚存以及并发相关的内容。

    +

    这门课的Project也非常新颖有趣。Project1会让你用C语言写一个小程序,20年秋季学期是著名的游戏Game of Life。Project2会让你用RISC-V汇编编写一个神经网络,用来 +识别MNIST手写数字,非常锻炼你对汇编代码的理解和运用。Project3中你会用Logism这个数字电路模拟软件搭建出一个二级流水线的CPU,并在上面运行RISC-V汇编代码。Project4 +会让你使用OpenMP,SIMD等方法并行优化矩阵运算,实现一个简易的Numpy。

    +

    总而言之,这是个人上过的最好的计算机体系结构的课程。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:B站, Youtube
    • +
    • 课程教材:无
    • +
    • 课程作业:11个lab,4个project,具体要求详见课程网站
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/体系结构/CSAPP/index.html b/体系结构/CSAPP/index.html new file mode 100644 index 00000000..e5f01c68 --- /dev/null +++ b/体系结构/CSAPP/index.html @@ -0,0 +1,2109 @@ + + + + + + + + + + + + + + + + CMU 15-213: CSAPP - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CMU CS15213: CSAPP

    +

    课程简介

    +
      +
    • 所属大学:CMU
    • +
    • 先修要求:CS61A, CS61B
    • +
    • 编程语言:C
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    CMU大名鼎鼎的镇系神课,以其内容庞杂,project巨难而闻名遐迩。课程内容覆盖了汇编语言、体系结构、操作系统、编译链接、并行、网络等,作为系统入门课,兼具深度和广度,如果自学确实需要相当的毅力和代码功底。

    +

    这门课配合的教材由CMU计算机系主任Bryant教授执笔,也即所谓的CSAPP。这也是我第一本认认真真一页一页读过去的计算机教材,虽然很难啃,但着实收获良多。

    +

    北大购买了这门课的版权并开设了Introduction to Computer System这门课,但其实CSAPP所有的课程资源和实验代码都能在它的官方主页上访问到(具体参见下方链接)。

    +

    这门课由于过于出名,全世界的码农争相学习,导致其Project的答案在网上几乎唾手可得。但如果你真的想锻炼自己的代码能力,希望你不要借鉴任何第三方代码。

    +

    认真学完这一门课,你对计算机系统的理解绝对会上升一个台阶。

    +

    课程资源

    + +

    补充:相信大家在看完CSAPP这本书以后,可能会对书中的第七章链接有一定的疑问。这里推荐一本书《程序员的自我修养》,书的副标题是链接,装载与库。这本书能够帮助我们完善对程序链接的理解,以及对CSAPP第七章部分知识点的一个详细的阐述。相信你在看完这本书以后可以对程序的链接,ELF文件,动态库有一个更加深入的理解。十分推荐在读完CSAPP,对计算机系统有一定的了解以后作为补充资料来阅读。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/体系结构/N2T/index.html b/体系结构/N2T/index.html new file mode 100644 index 00000000..02568212 --- /dev/null +++ b/体系结构/N2T/index.html @@ -0,0 +1,2129 @@ + + + + + + + + + + + + + + + + Coursera: Nand2Tetris - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Coursera: Nand2Tetris

    +

    课程简介

    +
      +
    • 所属大学:希伯来大学
    • +
    • 先修要求:无
    • +
    • 编程语言:任选一个编程语言
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:40小时
    • +
    +

    Coursera上被数万人评为满分,在全球四百多所高校、高中被采用,让一个完全没有计算机基础的人从与非门开始 +造一台计算机,并在上面运行俄罗斯方块小游戏。

    +

    听起来就很酷对不对?实现起来更酷!这门课分为硬件和软件两个部分。在硬件部分,你将进入01的世界,用与非门构造出逻辑电路,并逐步搭建出一个CPU +来运行一套课程作者定义的简易汇编代码。在软件部分,你将编写一个编译器,将作者开发的一个名为Jack的高级语言编译为可以运行在虚拟机上的字节码,然后进一步翻译 +为汇编代码。你还将开发一个简易的OS,让你的计算机支持输入输出图形界面。至此,你可以用Jack开发一个俄罗斯方块的小游戏,将它 +编译为汇编代码,运行在你用与非门搭建出的CPU上,通过你开发的OS进行交互。学完这门课程,你将对整个计算机的体系结构有一个全局 +且深刻的理解,对于你后续课程的学习有着莫大的帮助。

    +

    你也许会担心课程会不会很难,但这门课面向的人群是完全没有计算机基础的人,课程作者的目标是让高中生都能理解。因此,只要你按部就班跟着 +课程规划走,一个月内学完应该绰绰有余。麻雀虽小但是五脏俱全,这门课很好地提取出了计算机的本质,而不过多地陷于现代计算机为了性能而 +设计出的众多复杂细节。让学习者能在轻松愉快的学习体验中感受计算机的优雅与神奇。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/后记/index.html b/后记/index.html new file mode 100644 index 00000000..a10ad5d5 --- /dev/null +++ b/后记/index.html @@ -0,0 +1,1995 @@ + + + + + + + + + + + + + + + + 后记 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    + + + + + + + +

    后记

    + +

    从最初的想法开始,到断断续续完成这本书,再到树洞的热烈反响,我很激动,但也五味杂陈。原来在北大这个园子里,也有那么多人,对自己的本科生涯并不满意。而这里,可是囊括了中国非常优秀的一帮年轻人。所以问题出在哪里?我不知道。

    +

    我只是个籍籍无名的本科生呀,只是一个单纯的求学者,我的目标只是想快乐地、自由地、高质量地掌握那些专业知识,我想,正在看这本书的大多数本科生也是如此,谁想付出时间但却收效甚微呢?又是谁迫使大家带着痛苦去应付呢?我不知道。

    +

    我写这本书绝不是为了鼓励大家翘课自学,试问谁不想在课堂上和那么多优秀的同学济济一堂,热烈讨论呢?谁不想遇到问题直接找老师答疑解惑呢?谁不想辛苦学习的成果可以直接化作学校承认的学分绩点呢?可如果一个兢兢业业、按时到堂的学生收获的却是痛苦,而那个一学期只有考试会出席的学生却学得自得其乐,这公平吗?我不知道。

    +

    我只是不甘,不甘心这些通过高考战胜无数人进入高校的学子本可以收获一个更快乐的本科生涯,但现实却留给了他们遗憾。我反问自己,本科教育究竟应该带给我们什么呢?是学完所有这些课程吗?倒也未必,它也许只适合我这种nerd。但我觉得,本科教育至少得展现它应有的诚意,一种分享知识的诚意,一种以人为本的诚意,一种注重学生体验的诚意。它至少不应该是一种恶意,一种拼比知识的恶意,一种胜者为王的恶意,一种让人学无所得的恶意。但这一切能改变吗?我不知道。

    +

    我只知道我做了应该做的事情,学生们会用脚投票,树洞的关注量和回帖数证明了这样一份资料是有价值的,也道出了国内CS本科教育和国外的差距。也许这样的改变是微乎其微的,但别忘了我只是一个籍籍无名的本科生,是北大信科一千多名本科生中的普通一员,是中国几百万在读本科生中的一分子,如果有更多的人站出来,每个人做一点点,也许是分享一个帖子,也许是当一门课的助教,也许是精心设计一门课的lab,更或许是将来获得教职之后开设一门高质量的课程,出版一本经典的教材。本科教育真的有什么技术壁垒吗?我看未必,教育靠的是诚意,靠的是育人之心。

    +

    今天是2021年12月12日,我期待在不久的将来这个帖子会被遗忘,大家可以满心欢喜地选着自己培养方案上的课程,做着学校自行设计的各类编程实验,课堂没有签到也能济济一堂,学生踊跃地发言互动,大家的收获可以和努力成正比,那些曾经的遗憾和痛苦可以永远成为历史。我真的很期待那一天,真的真的真的很期待。

    +

    PKUFlyingPig

    +

    2021年12月12日写于燕园

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/培养方案Pro/index.html b/培养方案Pro/index.html new file mode 100644 index 00000000..ed56e16c --- /dev/null +++ b/培养方案Pro/index.html @@ -0,0 +1,1960 @@ + + + + + + + + + + + + + + + + 培养方案Pro - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    + + + + + + + +

    培养方案Pro

    + +

    under construction.

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/好书推荐/index.html b/好书推荐/index.html new file mode 100644 index 00000000..155fcf1d --- /dev/null +++ b/好书推荐/index.html @@ -0,0 +1,2289 @@ + + + + + + + + + + + + + + + + 好书推荐 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    + +
    + + +
    +
    + + + + + + + +

    好书推荐

    +

    由于版权原因,下面列举的图书中除了开源书籍提供了链接,其他的资源请大家自行通过libgen查找。

    +

    另外再安利一个Github顶流热门项目free-programming-books,收集了非常多的免费开源编程书籍。

    +

    系统入门

    +
      +
    • Principles of Computer System Design: An Introduction
    • +
    • Computer Systems: A Programmer's Perspective
    • +
    +

    操作系统

    + +

    计算机网络

    + +

    编译原理

    + +

    计算机语言(PL)

    + +

    体系结构

    +
      +
    • Computer Architecture: A Quantitative Approach 5th Edition
    • +
    +

    分布式系统

    + +

    数据密集型系统设计

    +
      +
    • Designing Data-Intensive Applications: The Big Ideas Behind Reliable, Scalable, and Maintainable Systems (开源中文翻译)
    • +
    +

    密码学

    +
      +
    • Cryptography Engineering: Design Principles and Practical Applications
    • +
    • Introduction to modern cryptography (second edition) + By Jonathon Katz & Yehuda Lindell + 从密码学的最基础开始讲起,对传统密码学的各方面都有涉及,课程内容全面,是密码学入门很好的一本书
    • +
    +

    数据库系统

    + +

    计算机图形学

    +
      +
    • Fundamentals of Computer Graphics
    • +
    +

    深度学习

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/并行与分布式系统/CS149/index.html b/并行与分布式系统/CS149/index.html new file mode 100644 index 00000000..9727195c --- /dev/null +++ b/并行与分布式系统/CS149/index.html @@ -0,0 +1,2116 @@ + + + + + + + + + + + + + + + + CMU 15-418/Stanford CS149: Parallel Computing - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CMU 15-418/Stanford CS149: Parallel Computing

    + +

    课程简介

    +
      +
    • 所属大学:CMU 和 Stanford
    • +
    • 先修要求:计算机体系结构,熟悉C++
    • +
    • 编程语言:C++
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    Kayvon Fatahalian教授此前在CMU开了15-418这门课,后来他成为Stanford的助理教授后又开了类似的课程CS149。但总体来说,15-418包含的课程内容更丰富,并且有课程回放,但CS149的编程作业更fashion一些。我个人是观看的15-418的课程录影但完成的CS149的作业。

    +

    这门课会带你深入理解现代并行计算架构的设计原则与必要权衡,并学会如何充分利用硬件资源以及软件编程框架(例如CUDA,MPI,OpenMP等)编写高性能的并行程序。由于并行计算架构的复杂性,这门课会涉及诸多高级体系结构与网络通信的内容,知识点相当底层且硬核。与此同时,5个编程作业则是从软件的层面培养学生对上层抽象的理解与运用,具体会让你分析并行程序的瓶颈、编写多线程同步代码、学习CUDA编程、OpenMP编程以及前段时间大热的Spark框架等等。真正意义上将理论与实践完美地结合在了一起。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/并行与分布式系统/MIT6.824/index.html b/并行与分布式系统/MIT6.824/index.html new file mode 100644 index 00000000..61b70f6a --- /dev/null +++ b/并行与分布式系统/MIT6.824/index.html @@ -0,0 +1,2122 @@ + + + + + + + + + + + + + + + + MIT 6.824: Distributed System - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT6.824: Distributed System

    +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:计算机体系结构,并行编程
    • +
    • 编程语言:Go
    • +
    • 课程难度:🌟🌟🌟🌟🌟🌟
    • +
    • 预计学时:200小时
    • +
    +

    这门课和MIT6.S081一样,出品自MIT大名鼎鼎的PDOS实验室,授课老师Robert Morris教授曾是一位顶尖黑客,世界上第一个蠕虫病毒Morris病毒就是出自他之手。

    +

    这门课每节课都会精读一篇分布式系统领域的经典论文,并由此传授分布式系统设计与实现的重要原则和关键技术。同时其课程Project也是以其难度之大而闻名遐迩,4个编程作业循序渐进带你实现一个基于Raft共识算法的KV-store框架,让你在痛苦的debug中体会并行与分布式带来的随机性和复杂性。

    +

    同样,这门课由于太过出名,网上答案无数,希望大家不要参考,而是力图自主实现整个Project。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:参见课程网站链接
    • +
    • 课程教材:无,以阅读论文为主
    • +
    • 课程作业:4个非常虐的Project,具体要求参见课程网站
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。此外也可以参考 OneSizeFitsQuorumlab 文档,其较为清晰地介绍了实现 lab1-4 和 challenge1-2 需要考虑的许多细节,在遇到瓶颈期时可以阅读一下~

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/CMake/index.html b/必学工具/CMake/index.html new file mode 100644 index 00000000..f1c37ba6 --- /dev/null +++ b/必学工具/CMake/index.html @@ -0,0 +1,2087 @@ + + + + + + + + + + + + + + + + CMake - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CMake

    + +

    为什么学习CMake

    +

    CMake 是类似于 GNU make 的跨平台自动软件构件工具,使用 CMakeLists.txt 定义构建规则,相比于 make 它提供了更多的功能,在各种软件构建上广泛使用。强烈建议学习使用 make 和熟悉 Makefile 后再学习CMake

    +

    如何学习CMake

    +

    CMakeLists.txt 比 Makefile 更为抽象,理解和使用难度也更大。现阶段很多 IDE (如 Visual Studio, CLion)提供了自动生成 CMakeLists.txt 的功能,但掌握 CMakeLists.txt 的基本用法仍然很有必要。除了CMake 官方 Tutorial外,上海交通大学 IPADS 组新人培训也提供了大约一小时的视频教程

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/Docker/index.html b/必学工具/Docker/index.html new file mode 100644 index 00000000..d6ed39b2 --- /dev/null +++ b/必学工具/Docker/index.html @@ -0,0 +1,2090 @@ + + + + + + + + + + + + + + + + Docker - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Docker

    + +

    为什么使用 Docker

    +

    使用别人写好的软件/工具最大的障碍是什么——必然是配环境。配环境带来的折磨会极大地消解你对软件、编程本身的兴趣。虚拟机可以解决配环境的一部分问题,但它庞大笨重,且为了某个应用的环境配置好像也不值得模拟一个全新的操作系统。

    +

    Docker的出现让环境配置变得(或许)不再折磨。简单来说Docker使用轻量级的“容器”(container)而不是整个操作系统去支持一个应用的配置。应用自身连同它的环境配置被打包为一个个image可以自由运行在不同平台的一个个container中,这极大地节省了所有人的时间成本。

    +

    如何学习Docker

    +

    Docker 官方文档当然是最好的初学教材,但最好的导师一定是你自己——尝试去使用Docker才能享受它带来的便利。Docker在工业界发展迅猛并已经非常成熟,你可以下载它的桌面端并使用图形界面。

    +

    当然,如果你像我一样,是一个疯狂的造轮子爱好者,那不妨自己亲手写一个迷你Docker来加深理解。

    +

    KodeKloud Docker for the Absolute Beginner 全面的介绍了Docker的基础功能,并且有大量的配套练习,同时提供免费的云环境来完成练习。其余的云相关的课程如Kubernetes需要付费,但个人强烈推荐:讲解非常仔细,适合从0开始的新手;有配套的Kubernetes的实验环境,不用被搭建环境劝退。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/Git/index.html b/必学工具/Git/index.html new file mode 100644 index 00000000..1a53819d --- /dev/null +++ b/必学工具/Git/index.html @@ -0,0 +1,2096 @@ + + + + + + + + + + + + + + + + Git - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Git

    + +

    为什么使用Git

    +

    Git是一款分布式的代码版本控制工具,Linux之父Linus嫌弃当时主流的中心式的版本控制工具太难用还要花钱,就自己开发出了Git用来维护Linux的版本(给大佬跪了)。

    +

    Git的设计非常优雅,但初学者通常因为很难理解其内部逻辑因此会觉得非常难用。对Git不熟悉的初学者很容易出现因为误用命令将代码给控制版本控制没了的状况(好吧是我)。

    +

    但相信我,和Vim一样,Git是一款你最终掌握之后会感叹“它值得!”的神器。

    +

    如何学习Git

    +

    和Vim不同,我不建议初学者在一知半解的情况下贸然使用Git,因为它的内部逻辑并不能熟能生巧,而是需要花时间去理解。我推荐的学习路线如下:

    +
      +
    • 阅读这篇Git tutorial
    • +
    • 阅读这本开源书籍Pro Git的Chapter1 - Chapter5,是的没错,学Git需要读一本书(捂脸)。
    • +
    • 此时你已经掌握了Git的原理和绝大部分用法,接下来就可以在实践中反复巩固Git的命令了。但用好它同样是一门哲学,我个人觉得这篇如何写好 Commit Message的博客非常值得一读。
    • +
    • 好的此时你已经爱上了Git,你已经不满足于学会它了,你想自己实现一个Git!巧了,我当年也有这样的想法,这篇tutorial可以满足你!
    • +
    • 什么?光实现一个Git无法满足你?小伙子/小仙女有前途,巧的是我也喜欢造轮子,这两个Github项目build-your-own-xproject-based-learning收录了你能想到的各种造轮子教程,比如:自己造个编辑器、自己写个虚拟机、自己写个docker、自己写个TCP等等等等。
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/Github/index.html b/必学工具/Github/index.html new file mode 100644 index 00000000..acdbb485 --- /dev/null +++ b/必学工具/Github/index.html @@ -0,0 +1,2091 @@ + + + + + + + + + + + + + + + + Github - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Github

    + +

    Github是什么

    +

    从功能上来说,Github是一个在线代码托管平台。你可以将你的本地Git仓库托管到Github上,供多人同时开发浏览。但现如今Github的意义已远不止如此,它已经演变为一个非常活跃且资源极为丰富的开源交流社区。全世界的软件开发者在Github上分享各式各样种类繁多的开源软件。大到工业级的深度学习框架pytorch、tensorflow,小到几十行的实用脚本,既有硬核的知识分享,也有保姆级的教程指导,甚至很多技术书籍也在github上开源(例如诸位正在看的这本——如果我厚着脸皮勉强称之为书的话)。闲来无事逛逛Github已经成为了我日常生活的一部分。

    +

    在Github里,星星是对一个项目至高无上的肯定,如果你觉得这本书对你有用的话,欢迎通过右上角的链接进入仓库主页献出你宝贵的星星✨。

    +

    如何使用Github

    +

    如果你还从未在Github上建立过自己的远程仓库,也没有克隆过别人的代码,那么我建议你从Github的官方教程开始自己的开源之旅。

    +

    如果你想时刻关注Github上一些有趣的开源项目,那么我向你重磅推荐HelloGithub这个网站以及它的同名微信公众号。它会定期收录Github上近期开始流行的或者非常有趣的开源项目,让你有机会第一时间接触各类优质资源。

    +

    Github之所以成功,我想是得益于“我为人人,人人为我”的开源精神,得益于知识分享的快乐。如果你也想成为下一个万人敬仰的开源大佬,或者下一个star破万的项目作者。那就把你在开发过程中灵感一现的idea化作代码,展示在Github上吧~

    +

    不过需要提醒的是,开源社区不是法外之地,很多开源软件并不是可以随意复制分发甚至贩卖的,了解各类开源协议并遵守,不仅是法律的要求,更是每个开源社区成员的责任。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/Latex/index.html b/必学工具/Latex/index.html new file mode 100644 index 00000000..f1d38d8a --- /dev/null +++ b/必学工具/Latex/index.html @@ -0,0 +1,2097 @@ + + + + + + + + + + + + + + + + Latex - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Latex

    + +

    为什么学Latex

    +

    如果你需要写论文,那么请直接跳到下一节,因为你不学也得学。

    +

    LaTex是一种基于Tex的排版系统,由图灵奖得主Lamport开发,而Tex则是由Knuth最初开发,这两位都是计算机界的巨擘。当然开发者强并不是我们学习LaTex的理由,LaTex和常见的所见即所得的Word文档最大的区别就是用户只需要关注写作的内容,而排版则完全交给软件自动完成。这让没有任何排版经验的普通人得以写出排版非常专业的论文或文章。

    +

    Berkeley计算机系教授Christos Papadimitriou曾说过一句半开玩笑的话:

    +
    +

    Every time I read a LaTeX document, I think, wow, this must be correct!

    +
    +

    如何学习LaTex

    +

    推荐的学习路线如下:

    +
      +
    • LaTex的环境配置是个比较头疼的问题。如果你本地配置LaTex环境出现了问题,可以考虑使用Overleaf这个在线LaTex编辑网站。站内不仅有各种各样的LaTex模版供你选择还免去了环境配置的难题。
    • +
    • 阅读下面三篇Tutorial: Part-1, Part-2, Part-3.
    • +
    • 学习LaTex最好的方式当然是写论文,不过从一门数学课入手用LaTex写作业也是一个不错的选择。
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/Makefile/index.html b/必学工具/Makefile/index.html new file mode 100644 index 00000000..5520d30e --- /dev/null +++ b/必学工具/Makefile/index.html @@ -0,0 +1,2089 @@ + + + + + + + + + + + + + + + + Makefile - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Makefile

    + +

    为什么学Makefile

    +

    大家第一次写hello world程序的时候一定都记得,在编辑完helloworld.c之后,需要用gcc编译生成可执行文件,然后再执行(如果你不理解前面这段话,请先自行谷歌gcc 编译并理解相关内容)。但如果你的项目由成百上千个C源文件组成,并且星罗棋布在各个子目录下,你该如何将它们编译链接到一起呢?假如你的项目编译一次需要半个小时(大型项目相当常见),而你只修改了一个分号,是不是还需要再等半个小时呢?

    +

    这时候Makefile就闪亮登场了,它能让你在一个脚本里(即所谓的Makefile)定义整个编译流程以及各个目标文件与源文件之间的依赖关系,并且只重新编译你的修改会影响到的部分,从而降低编译的时间。

    +

    如何学习Makefile

    +

    这里有一篇写得深入浅出的文档供大家参考。

    +

    Makefile掌握起来相对容易,但用好它需要不断的练习。将它融入到自己的日常开发中,勤于学习和模仿其他优秀开源项目里的Makefile的写法,总结出适合自己的template,久而久之,你对Makefile的使用会愈加纯熟。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/Vim/index.html b/必学工具/Vim/index.html new file mode 100644 index 00000000..ea27f26d --- /dev/null +++ b/必学工具/Vim/index.html @@ -0,0 +1,2120 @@ + + + + + + + + + + + + + + + + Vim - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Vim

    + +

    为什么学习Vim

    +

    在我看来Vim编辑器有如下的好处:

    +
      +
    • 让你的整个开发过程手指不需要离开键盘,而且光标的移动不需要方向键使得你的手指一直处在打字的最佳位置。
    • +
    • 方便的文件切换以及面板控制可以让你同时开发多份文件甚至同一个文件的不同位置。
    • +
    • Vim的宏操作可以批量化处理重复操作(例如多行tab,批量加双引号等等)
    • +
    • Vim是很多服务器自带的命令行编辑器,当你通过ssh连接远程服务器之后,由于没有图形界面,只能在命令行里进行开发(当然现在很多IDE如vscode提供了ssh插件可以解决这个问题)。
    • +
    • 异常丰富的插件生态,让你拥有世界上最花里胡哨的命令行编辑器。
    • +
    +

    如何学习Vim

    +

    不幸的是Vim的学习曲线确实相当陡峭,我花了好几个星期才慢慢适应了用Vim进行开发的过程。最开始你会觉得非常不适应,但一旦熬过了初始阶段,相信我,你会爱上Vim。

    +

    Vim的学习资料浩如烟海,但掌握它最好的方式还是将它用在日常的开发过程中,而不是一上来就去学各种花里胡哨的高级Vim技巧。个人推荐的学习路线如下:

    +
      +
    • 先阅读这篇tutorial,掌握基本的Vim概念和使用方式。
    • +
    • 用Vim自带的vimtutor进行练习,安装完Vim之后直接在命令行里输入vimtutor即可进入练习程序。
    • +
    • 最后就是强迫自己使用Vim进行开发,IDE里可以安装Vim插件。
    • +
    • 等你完全适应Vim之后新的世界便向你敞开了大门,你可以按需配置自己的Vim(修改.vimrc文件),网上有数不胜数的资源可以借鉴。
    • +
    +

    推荐参考资料

    +
      +
    • Neil, Drew. Practical Vim: Edit Text at the Speed of Thought. N.p., Pragmatic Bookshelf, 2015.
    • +
    • Neil, Drew. Modern Vim: Craft Your Development Environment with Vim 8 and Neovim. United States, Pragmatic Bookshelf.
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/tools/index.html b/必学工具/tools/index.html new file mode 100644 index 00000000..9fef65d6 --- /dev/null +++ b/必学工具/tools/index.html @@ -0,0 +1,2116 @@ + + + + + + + + + + + + + + + + 实用工具箱 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    实用工具箱

    + +

    下载工具

    +
      +
    • MacWk:Mac软件破解版下载网站。
    • +
    • Libgen:PDF电子书下载网站。
    • +
    • z-epub:ePub电子书下载网站。
    • +
    • bitdownloader:油管视频下载器。
    • +
    • zlibrary:电子书下载网站(可能需要翻墙)。
    • +
    +

    设计工具

    +
      +
    • excalidraw:一款手绘风格的绘图工具,非常适合绘制课程报告或者PPT内的示意图。
    • +
    • origamiway:手把手教你怎么折纸。
    • +
    • thingiverse:囊括各类2D/3D设计资源,其STL文件下载可直接3D打印。
    • +
    +

    学习网站

    +
      +
    • HFS:各类软件教程。
    • +
    • os-wiki:操作系统技术资源百科全书。
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/必学工具/翻墙/index.html b/必学工具/翻墙/index.html new file mode 100644 index 00000000..b200dd42 --- /dev/null +++ b/必学工具/翻墙/index.html @@ -0,0 +1,2029 @@ + + + + + + + + + + + + + + + + 翻墙 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    翻墙

    +

    此链接出现在这里纯属二进制bit的随意组合,与本人毫无关系。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/操作系统/CS162/index.html b/操作系统/CS162/index.html new file mode 100644 index 00000000..bf59f120 --- /dev/null +++ b/操作系统/CS162/index.html @@ -0,0 +1,2127 @@ + + + + + + + + + + + + + + + + UCB CS162: Operating System - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS162: Operating System

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61A, CS61B, CS61C
    • +
    • 编程语言:C,X86汇编
    • +
    • 课程难度:🌟🌟🌟🌟🌟🌟
    • +
    • 预计学时:200小时+,上不封顶
    • +
    +

    这门课让我记忆犹新的有两个部分:

    +

    首先是教材,这本书用的教材Operating Systems: Principles and Practice (2nd Edition)一共四卷,写得 +非常深入浅出,很好地弥补了MIT6.S081在理论知识上些许空白,非常建议大家阅读。相关资源会分享在本书的经典书籍推荐模块。

    +

    其次是这门课的Project —— Pintos。Pintos是由Ben Pfaff等人基于X86编写的教学用操作系统,Ben Pfaff甚至专门发了篇 +paper来阐述Pintos的设计思想。和MIT的xv6小而精的lab设计理念不同, +Pintos更注重系统的Design and Implementation。Pintos本身仅一万行左右,只提供了操作系统最基本的功能。而4个Project,就是让你在这个极为精简的操作系统之上,分别为其增加线程调度机制(Project1),系统调用(Project2),虚拟内存(Project3)以及文件系统(Project4)。所有的Project都给学生留有很大的设计空间,总代码量在5000行以上。根据Stanford学生自己的反馈,在3-4人组队的情况下,后两个Project的人均耗时也在40个小时以上。

    +

    虽然其难度很大,但Stanford,Berkeley,JHU等多所美国顶尖名校的操统课程均采用了Pintos。因为如果你真的对操作系统很感兴趣,Pintos会极大地提高你编写和debug底层系统代码的能力。在本科阶段,能自己设计、实现并debug一个大型系统,是一段非常珍贵的经历。

    +

    北大2022年春季学期的操作系统实验班也将会首次引入Pintos作为课程project,我作为这门课的TA,顶着被口水淹没的风险,依旧希望能用这样的尝试,让更多人爱上系统领域,为国内的系统研究添砖加瓦。

    +

    课程资源

    + +

    资源汇总

    +

    由于北大的操统实验班采用了该课程的project,为了防止代码抄袭,我的代码实现没有开源。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/操作系统/MIT6.S081/index.html b/操作系统/MIT6.S081/index.html new file mode 100644 index 00000000..6b1bb931 --- /dev/null +++ b/操作系统/MIT6.S081/index.html @@ -0,0 +1,2126 @@ + + + + + + + + + + + + + + + + MIT 6.S081: Operating System Engineering - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT 6.S081: Operating System Engineering

    +

    课程简介

    +
      +
    • 所属大学:麻省理工学院
    • +
    • 先修要求:体系结构 + 扎实的C语言功底 + RISC-V汇编语言
    • +
    • 编程语言:C,RISC-V
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    麻省理工学院大名鼎鼎的PDOS实验室开设的面向MIT本科生的操作系统课程。开设这门课的教授之一 —— Robert Morris教授曾是一位顶尖黑客,世界上第一个蠕虫病毒Morris就是出自他之手。

    +

    这门课的前身是MIT著名的课程6.828,MIT的几位教授为了这门课曾专门开发了一个基于X86的教学用操作系统JOS,被众多名校作为自己的操统课程实验。但随着RISC-V的横空出世,这几位教授又基于RISC-V开发了一个新的教学用操作系统xv6,并开设了MIT6.S081这门课。由于RISC-V轻便易学的特点,学生不需要像此前JOS一样纠结于众多X86“特有的”为了兼容而遗留下来的复杂机制,而 +可以专注于操作系统层面的开发。

    +

    这几位教授还专门写了一本教程,详细讲解了xv6的设计思想和实现细节。

    +

    这门课的讲授也很有意思,老师会带着学生依照xv6的源代码去理解操作系统的众多机制和设计细节,而不是停留于理论知识。每周都会有一个lab,让你在xv6上增加一些新的机制和特性,非常注重学生动手能力的培养。整个学期一共有11个lab,让你全方位地深刻理解操作系统的每个部分,非常有成就感。而且所有的lab都有着非常完善的测试框架,有的测试代码甚至上千行,让人不得不佩服MIT的几位教授为了教好这门课所付出的心血。

    +

    这门课的后半程会讲授操作系统领域的多篇经典论文,涉及文件系统、系统安全、网络、虚拟化等等多个主题,让你有机会接触到学界 +最前沿的研究方向。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学基础/MITLA/index.html b/数学基础/MITLA/index.html new file mode 100644 index 00000000..0d5336e7 --- /dev/null +++ b/数学基础/MITLA/index.html @@ -0,0 +1,2106 @@ + + + + + + + + + + + + + + + + MIT18.06: Linear Algebra - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT18.06: Linear Algebra

    +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:英文
    • +
    • 编程语言:无
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:因人而异
    • +
    +

    数学大牛Gilbert Strang老先生年逾古稀仍坚持授课,其经典教材Introduction to Linear Algebra已被清华采用为官方教材。我当时看完盗版PDF之后深感愧疚,含泪花了两百多买了一本英文正版收藏。下面附上此书封面,如果你能完全理解封面图的数学含义,那你对线性代数的理解一定会达到新的高度。 +image

    +

    配合油管数学网红3Blue1Brown线性代数的本质系列视频食用更佳。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:参见课程网站
    • +
    • 课程教材:Introduction to Linear Algebra. Gilbert Strang
    • +
    • 课程作业:参见课程网站
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学基础/MITmaths/index.html b/数学基础/MITmaths/index.html new file mode 100644 index 00000000..ed0f1629 --- /dev/null +++ b/数学基础/MITmaths/index.html @@ -0,0 +1,2105 @@ + + + + + + + + + + + + + + + + MIT18.01/18.02: Calculus - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT Calculus Course

    +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:英语
    • +
    • 编程语言:无
    • +
    • 课程难度:🌟🌟
    • +
    • 预计学时:因人而异
    • +
    +

    MIT的微积分课由MIT18.01: Single variable calculusMIT18.02: Multi variable calculus两门课组成。对自己数学基础比较自信的同学可以只看课程notes,写得非常浅显生动并且抓住本质,让你不再疲于做题而是能够真正窥见微积分的本质魅力。

    +

    配合油管数学网红3Blue1Brown微积分的本质系列视频食用更佳。

    +

    课程资源

    +
      +
    • 课程网站:18.0118.02
    • +
    • 课程视频:参见课程网站
    • +
    • 课程教材:参见课程notes
    • +
    • 课程作业:书面作业及答案参见课程网站
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学基础/information/index.html b/数学基础/information/index.html new file mode 100644 index 00000000..fc81a574 --- /dev/null +++ b/数学基础/information/index.html @@ -0,0 +1,2103 @@ + + + + + + + + + + + + + + + + MIT6.050J: Information theory and Entropy - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT6.050J: Information theory and Entropy

    +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:无
    • +
    • 编程语言:无
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    MIT面向大一新生的信息论入门课程,Penfield教授专门为这门课写了一本教材作为课程notes,内容深入浅出,生动有趣。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学进阶/6.042J/index.html b/数学进阶/6.042J/index.html new file mode 100644 index 00000000..435672f8 --- /dev/null +++ b/数学进阶/6.042J/index.html @@ -0,0 +1,2098 @@ + + + + + + + + + + + + + + + + MIT 6.042J: Mathematics for Computer Science - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT 6.042J: Mathematics for Computer Science

    + +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:Calculus, Linear Algebra
    • +
    • 编程语言:Python preferred
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:50-70 小时
    • +
    +

    MIT 的离散数学以及概率综合课程,导师是大名鼎鼎的 Tom Leighton (Akamai的联合创始人之一)。学完之后对于后续的算法学习大有裨益。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学进阶/CS126/index.html b/数学进阶/CS126/index.html new file mode 100644 index 00000000..05f948dc --- /dev/null +++ b/数学进阶/CS126/index.html @@ -0,0 +1,2122 @@ + + + + + + + + + + + + + + + + UCB CS126: probability theory - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB CS126 : Probability theory

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS70、微积分、线性代数
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    伯克利的概率论进阶课程,涉及到统计学、随机过程等理论相对深入的内容,需要相当的数学基础,我在上这门课的时候也感到有些吃力,不过坚持下来一定会让你对概率论的掌握达到一个新的高度。

    +

    同时这门课非常强调理论与实践的结合,课程设计者Jean Walrand教授专门写了一本配套的教材Probability in Electrical Engineering and Computer Science,书中每个章节都会以一个具体的算法实践作为例子来展示理论在实际当中的运用,例如PageRank,Route Planing,Speech Recognition等等,并且全书开源,可以免费下载PDF或者Epub版。

    +

    这还不算完,Jean Walrand还为整本书里的例子设计了配套的Python实现,以Jupyter Notebook的形式在线发布,读者可以在线修改、调试和运行。

    +

    与此同时,这门课除了理论作业之外,还有9个编程作业,会让你用概率论的知识解决实际问题。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学进阶/CS70/index.html b/数学进阶/CS70/index.html new file mode 100644 index 00000000..2694b870 --- /dev/null +++ b/数学进阶/CS70/index.html @@ -0,0 +1,2128 @@ + + + + + + + + + + + + + + + + UCB CS70: discrete Math and probability theory - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB CS70 : discrete Math and probability theory

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:无
    • +
    • 编程语言:无
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:60小时
    • +
    +

    伯克利的离散数学入门课程,个人觉得这门课最大的亮点在于并不是单纯的理论知识的讲授,而是在每个模块都会介绍理论知识在实际算法中的运用,让计算机系的学生在夯实理论基础的同时,跳脱出冰冷形式化的数学符号,在实际应用中感受和体会理论的本质。

    +

    具体的理论与算法的对应关系列举如下:

    +
      +
    • 逻辑证明:稳定匹配算法
    • +
    • 图论:网络拓扑设计
    • +
    • 基础数论:RSA算法
    • +
    • 多项式环:纠错码设计
    • +
    • 概率论:哈希表设计、负载均衡等等
    • +
    +

    课程notes也写得非常深入浅出,公式推导与实际例子星罗棋布,阅读体验很好。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程教材:参见课程notes
    • +
    • 课程作业:参见课程schedule
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学进阶/The Information Theory, Pattern Recognition, and Neural Networks/index.html b/数学进阶/The Information Theory, Pattern Recognition, and Neural Networks/index.html new file mode 100644 index 00000000..77c6acc4 --- /dev/null +++ b/数学进阶/The Information Theory, Pattern Recognition, and Neural Networks/index.html @@ -0,0 +1,2114 @@ + + + + + + + + + + + + + + + + The Information Theory, Patter Recognition, and Neural Networks - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    The Information Theory, Patter Recognition, and Neural Networks

    + +

    课程简介

    +
      +
    • 所属大学:Cambridge
    • +
    • 先修要求:Calculus, Linear Algebra, Probabilities and Statistics
    • +
    • 编程语言:Anything would be OK, Python preferred
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:30-50 小时
    • +
    +

    剑桥大学 Sir David MacKay 教授的信息论课程。教授是一位十分精通信息论与神经网络的学者,课程对应教材也是信息论领域的一部经典著作。可惜天妒英才...

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频
    • +
    • 课程教材:Information Theory, Inference, and Learning Algorithms 在课程网站可以下载到免费的电子版
    • +
    • 课程作业:在每一节课视频的最后会留教材上的课后习题
    • +
    +

    R.I.P Prof. David MacKay

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学进阶/convex/index.html b/数学进阶/convex/index.html new file mode 100644 index 00000000..35adf449 --- /dev/null +++ b/数学进阶/convex/index.html @@ -0,0 +1,2121 @@ + + + + + + + + + + + + + + + + Standford EE364A: Convex Optimization - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Standford EE364A: Convex Optimization

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:Python,微积分,线性代数,概率论,数值分析
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    Stephen Boyd教授是凸优化领域的大牛,其编写的Convex Optimization这本教材被众多名校采用。另外其研究团队还专门开发了一个用于求解常见凸优化问题的编程框架,支持Python,Julia等主流编程语言,其课程作业也是采用这个编程框架去解决实际生活当中的凸优化问题。

    +

    在实际运用当中,你会深刻体会到对于同一个问题,建模过程中一个细小的改变,其方程的求解难度会有天壤之别,如何让你建模的方程是“凸”的,是一门艺术。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数学进阶/numerical/index.html b/数学进阶/numerical/index.html new file mode 100644 index 00000000..39c275e6 --- /dev/null +++ b/数学进阶/numerical/index.html @@ -0,0 +1,2121 @@ + + + + + + + + + + + + + + + + MIT18.330: Introduction to numerical analysis - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT18.330 : Introduction to numerical analysis

    +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:微积分,线性代数,概率论
    • +
    • 编程语言:Julia
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    计算机强大的计算能力帮助人们在科学领域不断突破边界,不过计算机的离散本质和这个连续的世界有着天然鸿沟,而如何用离散的表示去估计和逼近那些数学上连续的概念,则是数值分析的重要主题。

    +

    这门课会在浮点表示、方程求解、线性代数、微积分、线性代数、微分方程等领域探讨各类数值分析方法,让你在Julia的编程实践中反复体悟(1)如何建立估计(2)如何估计误差(3)如何用算法实现估计 这一系列步骤。

    +

    这门课的设计者还编写了配套的开源教材(参见下方链接),里面有丰富的Julia实例。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数据库系统/15445/index.html b/数据库系统/15445/index.html new file mode 100644 index 00000000..0683a973 --- /dev/null +++ b/数据库系统/15445/index.html @@ -0,0 +1,2129 @@ + + + + + + + + + + + + + + + + CMU 15-445: Database Systems - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CMU 15-445: Database Systems

    +

    课程简介

    +
      +
    • 所属大学:CMU
    • +
    • 先修要求:C++,数据结构与算法
    • +
    • 编程语言:C++
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    作为CMU数据库的入门课,这门课由数据库领域的大牛 Andy Pavlo讲授(“这个世界上我只在乎两件事,一是我的老婆,二就是数据库”)。15-445会自底向上地教你数据库系统的基本组成部分:存储、索引、查询,以及并发事务控制。 +这门课的亮点在于CMU db专门为此课开发了一个教学用的关系型数据库bustub,并要求你对这个数据库的组成部分进行修改,实现上述部件的功能。此外 bustub作为一个C++编写的中小型项目涵盖了程序构建、代码规范、单元测试等众多要求,可以作为一个优秀的开源项目学习。

    +

    课程资源

    + +

    在Fall2019中,第二个project是做哈希索引,第四个project是做日志与恢复

    +

    在Fall2020中,第二个project是做B树,第四个project是做并发控制

    +

    如果大家有精力的话可以都去尝试一下,或者在对书中内容理解不是很透彻的时候,尝试用代码写一个会加深你的理解。

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    +

    由于Andy的要求,仓库中没有project的实现,只有homework的solution。特别的,对于homework1,我还写了一个shell脚本来帮大家执行自动判分

    +

    另外在课程结束后,我十分推荐阅读一篇论文Architecture Of a Database System,对应的中文版我上传到了链接中的仓库。论文里综述了数据库系统的整体架构,让大家可以对数据库有一个更加全面的视野。

    +

    后续课程

    +

    CMU15-721

    +

    主要讲主存数据库有关的内容,每节课都有对应的paper要读,推荐给希望进阶数据库的小伙伴

    +

    我目前也在跟进这门课,完成后会在这里提PR以提供进阶的指导

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数据库系统/CS186/index.html b/数据库系统/CS186/index.html new file mode 100644 index 00000000..6f894fd6 --- /dev/null +++ b/数据库系统/CS186/index.html @@ -0,0 +1,2121 @@ + + + + + + + + + + + + + + + + UCB CS186: Introduction to Database System - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB CS186: Introduction to Database System

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61A, CS61B, CS61C
    • +
    • 编程语言:Java
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    如何编写SQL查询?SQL命令是如何被一步步拆解、优化、转变为一个个磁盘查询指令的?如何实现高并发的数据库?如何实现数据库的故障恢复?什么又是非关系型数据库?这门课会带你深入理解关系型数据库的内部细节,并在掌握理论知识之后,动手用Java实现一个支持SQL并发查询、B+树Index和故障恢复的关系型数据库。

    +

    从实用角度来说,这门课还会在编程作业中锻炼你编写SQL查询以及NoSQL查询的能力,对于构建一些全栈的工程项目很有帮助。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数据科学/Data100/index.html b/数据科学/Data100/index.html new file mode 100644 index 00000000..949dd5d8 --- /dev/null +++ b/数据科学/Data100/index.html @@ -0,0 +1,2099 @@ + + + + + + + + + + + + + + + + UCB Data100: Principles and Techniques of Data Science - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB Data100: Principles and Techniques of Data Science

    + +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61A,线性代数
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    伯克利的数据科学入门课程,内容相对基础,覆盖了数据清洗、特征提取、数据可视化以及机器学习和推理的基础内容,也会讲授Pandas,Numpy,Matplotlib等数据科学常用工具。其丰富有趣的编程作业也是这门课的一大亮点。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数据结构与算法/Algo/index.html b/数据结构与算法/Algo/index.html new file mode 100644 index 00000000..f484c17f --- /dev/null +++ b/数据结构与算法/Algo/index.html @@ -0,0 +1,2133 @@ + + + + + + + + + + + + + + + + Coursera: Algorithms I & II - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Coursera: Algorithms I & II

    +

    课程简介

    +
      +
    • 所属大学:Princeton
    • +
    • 先修要求:CS61A
    • +
    • 编程语言:Java
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:60小时
    • +
    +

    这是Coursera上评分最高的算法课程。Robert Sedgewick教授有一种魔力,可以将无论多么复杂的算法讲得极为生动浅显。实不相瞒,困扰我 +多年的KMP以及网络流算法都是在这门课上让我茅塞顿开的,时隔两年我甚至还能写出这两个算法的推导与证明。

    +

    你是否觉得算法学了就忘呢?我觉得让你完全掌握一个算法的核心在于理解三点:

    +
      +
    • 为什么这么做?(正确性推导,抑或是整个算法的核心本质)
    • +
    • 如何实现它?(光学不用假把式)
    • +
    • 用它解决实际问题(学以致用才是真本事)
    • +
    +

    这门课的构成就非常好地契合了上述三个步骤。观看课程视频并且阅读教授的开源课本有助于你理解算法的本质,让你也可以用非常 +生动浅显的话语向别人讲述为什么这个算法得长这个样子。

    +

    在理解算法之后,你可以阅读教授对于课程中讲授的所有数据结构与算法的代码实现。 +注意,这些实现可不是demo性质的,而是工业级的高效实现,从注释到变量命名都非常严谨,模块化也做得相当好,是质量很高的代码。我从这些代码中收获良多。

    +

    最后,就是这门课最激动人心的部分了,10个高质量的Project,并且全都有实际问题的背景描述,丰富的测试样例,自动的评分系统(代码风格也是评分的一环)。让你在实际生活中 +领略算法的魅力。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数据结构与算法/CS106B_CS106X/index.html b/数据结构与算法/CS106B_CS106X/index.html new file mode 100644 index 00000000..e9c3f4ef --- /dev/null +++ b/数据结构与算法/CS106B_CS106X/index.html @@ -0,0 +1,2103 @@ + + + + + + + + + + + + + + + + Stanford CS106B/X - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Stanford CS106B/X: Programming Abstractions in C++

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:计算机基础(CS50/CS106A/CS61A or equivalent)
    • +
    • 编程语言:C++
    • +
    • 课程难度:🌟🌟
    • +
    • 预计学时:50-70 小时
    • +
    +

    Stanford的进阶编程课,CS106X在难度和深度上会比CS106B有所提高,但主体内容类似。主要通过C++语言让学生在实际的编程作业里培养通过编程抽象解决实际问题的能力,同时也会涉及一些简单的数据结构和算法的知识,但总体来说没有一门专门的数据结构课那么系统。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数据结构与算法/CS170/index.html b/数据结构与算法/CS170/index.html new file mode 100644 index 00000000..d2e0e3ae --- /dev/null +++ b/数据结构与算法/CS170/index.html @@ -0,0 +1,2123 @@ + + + + + + + + + + + + + + + + UCB CS170: Efficient Algorithms and Intractable Problems - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS170: Efficient Algorithms and Intractable Problems

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61B, CS70
    • +
    • 编程语言:Latex
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:60小时
    • +
    +

    伯克利的算法设计课,更注重算法的理论基础与复杂度分析。课程内容涵盖了分治、图算法、最短路、生成树、贪心、动规、并查集、线性规划、网络流、 +NP问题、随机算法、哈希算法等等。

    +

    这门课的教材写的很好,证明浅显易懂,非常适合作为工具书查阅。另外,这门课只有书面作业,并且推荐用Latex编写,大家可以借此机会锻炼自己的 +Latex技巧。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频
    • +
    • 课程教材:详见课程网站notes
    • +
    • 课程作业:13次书面作业,用Latex编写
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/数据结构与算法/CS61B/index.html b/数据结构与算法/CS61B/index.html new file mode 100644 index 00000000..ab637290 --- /dev/null +++ b/数据结构与算法/CS61B/index.html @@ -0,0 +1,2126 @@ + + + + + + + + + + + + + + + + UCB CS61B: Data Structures and Algorithms - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS61B: Data Structures and Algorithms

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61A
    • +
    • 编程语言:Java
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:60小时
    • +
    +

    伯克利CS61系列的第二门课程,注重数据结构与算法的设计,同时让学生有机会接触上千行的工程代码,通过Java初步领会软件工程的思想。

    +

    我上的是2018年春季学期的版本,该课的开课老师Josh Hug教授慷慨地将autograder开源了,大家可以通过网站公开的邀请码在gradescope +免费加入课程,从而方便地测评自己的代码。

    +

    这门课所有的编程作业都是使用Java完成的。没有Java基础的同学也不用担心,课程会有保姆级的教程,从IDEA(一款主流的Java编程环境) +的配置讲起,把Java的核心语法与特性事无巨细地讲授,大家完全不用担心跟不上的问题。

    +

    这门课的作业质量也是绝绝子。14个lab会让你自己实现课上所讲的绝大部分数据结构,10个homework会让你运用数据结构和算法解决实际问题, +另外还有3个Project更是让你有机会接触上千行的工程代码,在实战中磨练自己的Java能力。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:每节课的链接详见课程网站
    • +
    • 课程教材:无
    • +
    • 课程作业:每年略有不同,18年春季学期有14个lab,10个homework以及3个project,具体要求详见课程网站。
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习/CS189/index.html b/机器学习/CS189/index.html new file mode 100644 index 00000000..b6fd8a36 --- /dev/null +++ b/机器学习/CS189/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + UCB CS189: Introduction to Machine Learning - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS189: Introduction to Machine Learning

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS188, CS70
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    这门课我没有系统上过,只是把它的课程notes作为工具书查阅。不过从课程网站上来看,它比CS229好的是开源了所有homeword的代码以及gradescope的autograder。同样,这门课讲得相当理论且深入。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习/CS229/index.html b/机器学习/CS229/index.html new file mode 100644 index 00000000..c7e45bfc --- /dev/null +++ b/机器学习/CS229/index.html @@ -0,0 +1,2120 @@ + + + + + + + + + + + + + + + + Stanford CS229: Machine Learning - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS229: Machine Learning

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:高数,概率论,Python,需要较深厚的数学功底
    • +
    • 编程语言:无
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    同样是吴恩达讲授,但是这是一门研究生课程,所以更偏重数学理论,不满足于调包而想深入理解算法本质,或者有志于从事机器学习理论研究的同学可以学习这门课程。课程网站上提供了所有的课程notes,写得非常专业且理论,需要一定的数学功底。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习/ML/index.html b/机器学习/ML/index.html new file mode 100644 index 00000000..119cdece --- /dev/null +++ b/机器学习/ML/index.html @@ -0,0 +1,2122 @@ + + + + + + + + + + + + + + + + Coursera: Machine Learning - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Coursera: Machine Learning

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:AI入门 + 熟练使用Python
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    说起吴恩达,在AI届应该无人不晓。他是著名在线教育平台Coursera的创始人之一,同时也是Stanford的网红教授。这门机器学习入门课应该算得上是他的成名作之一(另一个是深度学习课程),在Coursera上拥有数十万的学习者(注意这是花钱买了证书的人,一个证书几百刀),白嫖学习者数量应该是另一个数量级了。

    +

    这门课对新手极其友好,吴恩达拥有把机器学习讲成1+1=2一样直白的能力。你将会学习到线性回归、逻辑回归、支持向量机、无监督学习、降维、异常检测和推荐系统等等知识,并且在编程实践中夯实自己的理解。作业质量自然不必多言,保姆级代码框架,作业背景也多取自生活,让人学以致用。

    +

    当然,这门课作为一个公开慕课,难度上刻意放低了些,很多数学推导大多一带而过,如果你有志于从事机器学习理论研究,想要深究这些算法背后的数学理论,可以参考CS229CS189

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:参见课程网站
    • +
    • 课程教材:无
    • +
    • 课程作业:参见课程网站
    • +
    +

    资源汇总

    +

    当时重装系统误删了文件,我的代码实现消失在了磁盘的01串中。不过这门课由于太过出名,网上想搜不到答案都难,相关课程资料Coursera上也一应俱全。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习进阶/CMU10-708/index.html b/机器学习进阶/CMU10-708/index.html new file mode 100644 index 00000000..2262367d --- /dev/null +++ b/机器学习进阶/CMU10-708/index.html @@ -0,0 +1,2083 @@ + + + + + + + + + + + + + + + + CMU 10-708: Probabilistic Graphical Models - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CMU 10-708: Probabilistic Graphical Models

    +

    课程简介

    +
      +
    • 所属大学:CMU
    • +
    • 先修要求:Machine Learning, Deep Learning, Reinforcement Learning
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 课程网站:https://sailinglab.github.io/pgm-spring-2019/
    • +
    • 这个网站包含了所有的资源:slides, nots, video, homework, project
    • +
    +

    这门课程是 CMU 的图模型基础 + 进阶课,授课老师为 Eric P. Xing,涵盖了图模型基础,与神经网络的结合,在强化学习中的应用,以及非参数方法。相当硬核

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习进阶/CS229M/index.html b/机器学习进阶/CS229M/index.html new file mode 100644 index 00000000..8cf8ffbf --- /dev/null +++ b/机器学习进阶/CS229M/index.html @@ -0,0 +1,2082 @@ + + + + + + + + + + + + + + + + Stanford STATS214 / CS229M: Machine Learning Theory - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    STATS214 / CS229M: Machine Learning Theory

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:Machine Learning, Deep Learning, Statistics
    • +
    • 课程难度:🌟🌟🌟🌟🌟🌟
    • +
    • 课程网站:http://web.stanford.edu/class/stats214/
    • +
    +

    经典学习理论 + 最新深度学习理论,非常硬核。授课老师之前是 Percy Liang,现在是 Tengyu Ma

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习进阶/STA4273/index.html b/机器学习进阶/STA4273/index.html new file mode 100644 index 00000000..60fa0343 --- /dev/null +++ b/机器学习进阶/STA4273/index.html @@ -0,0 +1,2082 @@ + + + + + + + + + + + + + + + + U Toronto STA 4273 Winter 2021: Minimizing Expectations - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    STA 4273 Winter 2021: Minimizing Expectations

    +

    课程简介

    +
      +
    • 所属大学:U Toronto
    • +
    • 先修要求:Bayesian Inference, Reinforcement Learning
    • +
    • 课程难度:🌟🌟🌟🌟🌟🌟🌟
    • +
    • 课程网站:https://www.cs.toronto.edu/~cmaddis/courses/sta4273_w21/
    • +
    +

    这是一门较为进阶的 Ph.D. 研究课程,核心内容是 inference 和 control 之间的关系。授课老师为 Chris Maddison (AlphaGo founding member, NeurIPS 14 best paper)

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习进阶/STAT8201/index.html b/机器学习进阶/STAT8201/index.html new file mode 100644 index 00000000..94502ba4 --- /dev/null +++ b/机器学习进阶/STAT8201/index.html @@ -0,0 +1,2082 @@ + + + + + + + + + + + + + + + + Columbia STAT 8201: Deep Generative Models - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Columbia STAT 8201: Deep Generative Models

    +

    课程简介

    +
      +
    • 所属大学:Columbia University
    • +
    • 先修要求:Machine Learning, Deep Learning, Graphical Models
    • +
    • 课程难度:🌟🌟🌟🌟🌟🌟
    • +
    • 课程网站:http://stat.columbia.edu/~cunningham/teaching/GR8201/
    • +
    +

    这门课是一门 PhD 讨论班,每周的内容是展示 + 讨论论文,授课老师是 John Cunningham。Deep Generative Models (深度生成模型) 是图模型与神经网络的结合,也是现代机器学习最重要的方向之一

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/机器学习进阶/roadmap/index.html b/机器学习进阶/roadmap/index.html new file mode 100644 index 00000000..533b45a3 --- /dev/null +++ b/机器学习进阶/roadmap/index.html @@ -0,0 +1,2214 @@ + + + + + + + + + + + + + + + + 进阶路线图 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    机器学习进阶

    +

    此路线图适用于已经学过了基础机器学习 (ML, NLP, CV, RL) 的同学 (高年级本科生或低年级研究生),已经发表过至少一篇顶会论文 (NeurIPS, ICML, ICLR, ACL, EMNLP, NAACL, CVPR, ICCV) 想要走机器学习科研路线的选手。

    +

    此路线的目标是为读懂与发表机器学习顶会论文打下理论基础,特别是 Probabilistic Methods 这个 track 下的文章

    +

    机器学习进阶可能存在多种不同的学习路线,此路线只能代表作者 Yao Fu 所理解的最佳路径,侧重于贝叶斯学派下的概率建模方法,也会涉及到各项相关学科的交叉知识。

    +

    必读教材

    +
      +
    • PRML: Pattern Recognition and Machine Learning. Christopher Bishop
    • +
    • 经典贝叶斯学派教材
    • +
    • AoS: All of Statistics. Larry Wasserman
    • +
    • 经典频率学派教材
    • +
    +

    所以这两本书刚好相辅相成

    +

    字典

    +
      +
    • MLAPP: Machine Learning: A Probabilistic Perspective. Kevin Murphy
    • +
    • Convex Optimization. Stephen Boyd and Lieven Vandenberghe
    • +
    +

    进阶书籍

    +
      +
    • W&J: Graphical Models, Exponential Families, and Variational Inference. Martin Wainwright and Michael Jordan
    • +
    • Theory of Point Estimation. E. L. Lehmann and George Casella
    • +
    +

    如何阅读

    +

    Guidelines

    +
      +
    • 必读教材就是一定要读的教材
    • +
    • 字典的意思是,一般情况下不管它,但当遇到了不懂的概念的时候,就去字典里面查(而不是维基百科)
    • +
    • 进阶书籍先不读,先读完必读书籍。必读书籍一般都是要前前后后反复看过 N 遍才算读完
    • +
    • 读的过程中,最重要的读法就是对比阅读 (contrastive-comparative reading):同时打开两本书讲同一主题的章节,然后对比相同点和不同点和联系
    • +
    • 读的过程中,尽量去回想之前读过的论文,比较论文和教材的相同点与不同点
    • +
    +

    基础路径

    +
      +
    • 先读 AoS 第六章: Models, Statistical Inference and Learning,这一部分是最基础的科普
    • +
    • 然后读 PRML 第 10, 11 章
    • +
    • 第 10 章的内容是 Variational Inference, 第 11 章的内容是 MCMC, 这两种方法是贝叶斯推断的两条最主要路线
    • +
    • 如果在读 PRML 的过程中发现有任何不懂的名词,就去翻前面的章节。很大概率能够在第 3,4 章找到相对应的定义;如果找不到或者不够详细,就去查 MLAPP
    • +
    • AoS 第 8 章 (Parametric Inference) 和第 11 章 (Bayesian Inference) 也可以作为参考。最好的方法是多本书对比阅读,流程如下
        +
      • 假设我在读 PRML 第 10 章的时候发现了一个不懂的词:posterior inference
      • +
      • 于是我往前翻,翻到了第 3 章 (Linear Model for Regression),看到了最简单的 posterior
      • +
      • 然后我接着翻 AoS,翻到了第 11 章,也有对 posterior 的描述
      • +
      • 然后我对比 PRML 第 10 章,第 3 章,AoS 第 11 章,三处不同地方对 posterior 的解读,比较其相同点和不同点和联系
      • +
      +
    • +
    • 读完 PRML 第 10 和 11 章之后,接着读 AoS 第 24 章 (Simulation Methods),然后把它和 PRML 第 11 章对比阅读 -- 这俩都是讲 MCMC
    • +
    • 如果到此处发现还有基础概念读不懂,就回到 PRML 第 3 章,把它和 AoS 第 11 章对比阅读
    • +
    • Again,对比阅读非常重要,一定要把不同本书的类似内容同时摆在面前相互对比,这样可以显著增强记忆
    • +
    • 然后读 PRML 第 13 章(跳过第 12 章),这一章可以和 MLAPP 的第 17, 18 章对比阅读
    • +
    • MLAPP 第 17 章是 PRML 第 13.2 章的详细版,主要讲 HMM
    • +
    • MLAPP 第 18 章是 PRML 第 13.3 章的详细版,主要讲 LDS
    • +
    • 读完 PRML 第 13 章之后,再去读 PRML 第 8 章 (Graphical Models) -- 此时这部分应该会读得很轻松
    • +
    • 以上的内容可以进一步对照 CMU 10-708 PGM 课程材料
    • +
    +

    到目前为止,应该能够掌握 +- 概率模型的基础定义 +- 精准推断 - Sum-Product +- 近似推断 - MCMC +- 近似推断 - VI

    +

    然后就可以去做更进阶的内容

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/深度学习/CS224n/index.html b/深度学习/CS224n/index.html new file mode 100644 index 00000000..8462267d --- /dev/null +++ b/深度学习/CS224n/index.html @@ -0,0 +1,2122 @@ + + + + + + + + + + + + + + + + Stanford CS224n: Natural Language Processing - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS224n: Natural Language Processing

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:深度学习基础 + Python
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    Stanford的NLP入门课程,由自然语言处理领域的巨佬Chris Manning领衔教授(word2vec算法的开创者)。内容覆盖了词向量、RNN、LSTM、Seq2Seq模型、机器翻译、注意力机制、Transformer等等NLP领域的核心知识点。

    +

    5个编程作业难度循序渐进,分别是词向量、word2vec算法、Dependency parsing、机器翻译以及Transformer的fine-tune。

    +

    最终的大作业是在Stanford著名的SQuAD数据集上训练QA模型,有学生的大作业甚至直接发表了顶会论文。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:B站搜索CS224n
    • +
    • 课程教材:无
    • +
    • 课程作业:5个编程作业 + 1个Final Project
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/深度学习/CS224w/index.html b/深度学习/CS224w/index.html new file mode 100644 index 00000000..40aa15d0 --- /dev/null +++ b/深度学习/CS224w/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + Stanford CS224w: Machine Learning with Graphs - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS224w: Machine Learning with Graphs

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:深度学习基础 + Python
    • +
    • 编程语言:Python, Latex
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    Stanford的图神经网络入门课,这门课我没有上过,但众多做GNN的朋友都向我力荐过这门课,想必Stanford的课质量还是一如既往地有保证的。另外就是这门课的授课老师非常年轻帅气:)

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/深度学习/CS230/index.html b/深度学习/CS230/index.html new file mode 100644 index 00000000..19bbde61 --- /dev/null +++ b/深度学习/CS230/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + Coursera: Deep Learning - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Coursera: Deep Learning

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:机器学习基础 + Python
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    吴恩达在Coursera开设的另一门网红课程,学习者无数,堪称圣经级的深度学习入门课。深入浅出的讲解,眼花缭乱的Project。从最基础的神经网络,到CNN,RNN,再到最近大热的Transformer。学完这门课,你将初步掌握深度学习领域必备的知识和技能,并且可以在Kaggle中参加自己感兴趣的比赛,在实践中锻炼自己。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/深度学习/CS231/index.html b/深度学习/CS231/index.html new file mode 100644 index 00000000..4dfb0274 --- /dev/null +++ b/深度学习/CS231/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + Stanford CS231n: CNN for Visual Recognition - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS231n: CNN for Visual Recognition

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:机器学习基础
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    Stanford的CV入门课,由计算机领域的巨佬李飞飞院士领衔教授(CV领域划时代的著名数据集ImageNet的研究团队),但其内容相对基础且友好,如果上过CS230的话可以直接上手Project作为练习。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/深度学习/CS285/index.html b/深度学习/CS285/index.html new file mode 100644 index 00000000..ff261c41 --- /dev/null +++ b/深度学习/CS285/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + UCB CS285: Deep Reinforcement Learning - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS285: Deep Reinforcement Learning

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS188, CS189
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    伯克利的强化学习研究生课程,所有课程录影、slides、作业代码均在网站开源。在我的收藏夹里吃灰很久了,一直想找机会学习一下。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/深度学习/LHY/index.html b/深度学习/LHY/index.html new file mode 100644 index 00000000..f7ead215 --- /dev/null +++ b/深度学习/LHY/index.html @@ -0,0 +1,2107 @@ + + + + + + + + + + + + + + + + 台湾国立大学:李宏毅机器学习 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    台湾国立大学:李宏毅机器学习

    +

    课程简介

    +
      +
    • 所属大学:台湾国立大学
    • +
    • 先修要求:熟练掌握Python
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    李宏毅老师是台湾国立大学的教授,其风趣幽默的授课风格深受大家喜爱,并且尤其喜欢在PPT中插入宝可梦等动漫元素,是个非常可爱的老师。

    +

    这门课挂着机器学习的牌子,但其课程内容之广实在令人咋舌,其作业一共包含15个lab,分别是Regression、Classification、CNN、Self-Attention、Transformer、GAN、BERT、Anomaly Detection、Explainable AI、Attack、Adaptation、 +RL、Compression、Life-Long Learning以及Meta Learning。可谓是包罗万象,能让学生对于深度学习的绝大多数领域都有一定了解,从而可以进一步选择想要深入的方向进行学习。

    +

    大家也大可不必担心作业的难度,因为所有作业都会提供助教的示例代码,帮你完成数据处理、模型搭建等,你只需要在其基础上进行适量的修改即可。这也是一个学习别人优质代码的极好机会,大家需要水课程大作业的话,这里也是一个不错的资料来源。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/电子基础/EE16/index.html b/电子基础/EE16/index.html new file mode 100644 index 00000000..465e6437 --- /dev/null +++ b/电子基础/EE16/index.html @@ -0,0 +1,2120 @@ + + + + + + + + + + + + + + + + EE16A&B: Designing Information Devices and Systems I&II - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB EE16A&B: Designing Information Devices and Systems I&II

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:无
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    UC Berkeley电子系学生的大一入门课,通过电路基础知识的讲授,配合各类动手实操的lab,让学生体验通过电路从环境中收集信息并进行分析,作出预测和反馈。由于疫情的缘故,所有lab都有远程在线版,非常适合大家在家自学。

    +

    课程资源

    +
      +
    • 课程网站:EE16A, EE16B
    • +
    • 课程视频:B站搜索
    • +
    • 课程教材:参见课程notes
    • +
    • 课程作业:参见课程主页
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/电子基础/Signals and Systems_AVO/index.html b/电子基础/Signals and Systems_AVO/index.html new file mode 100644 index 00000000..d5cba61f --- /dev/null +++ b/电子基础/Signals and Systems_AVO/index.html @@ -0,0 +1,2100 @@ + + + + + + + + + + + + + + + + MIT 6.007 Signals and Systems - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT 6.007 Signals and Systems

    + +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:Calculus, Linear Algebra
    • +
    • 编程语言:Matlab Preferred
    • +
    • 课程难度:🌟🌟
    • +
    • 预计学时:50-70 小时
    • +
    +

    看到课程老师的名字:Prof. Alan V. Oppenheim

    +

    好的,上这门课的理由已经足够了。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/电子基础/signal/index.html b/电子基础/signal/index.html new file mode 100644 index 00000000..e371544f --- /dev/null +++ b/电子基础/signal/index.html @@ -0,0 +1,2119 @@ + + + + + + + + + + + + + + + + UCB EE120 : Signal and Systems - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB EE120 : Signal and Systems

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61A,CS70,微积分,线性代数
    • +
    • 编程语言:Python
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    这门课最精华的部分就是6个超有趣的编程作业了,会让你用Python通过学习到的信号与系统的理论知识,解决各类实际问题。例如lab3会让你实现FFT算法,并和Numpy的官方实现进行性能对比;lab4会通过分析手指头的影像数据推断心率;lab5就更牛了,会让你给哈勃望远镜拍到的照片进行降噪处理,恢复绚烂清晰的星空;lab6会让你构造一个反馈系统,平衡小车上的细杆。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程教材:参见课程notes
    • +
    • 课程作业:5个书面作业 + 6个编程作业
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/程序语言设计/CS242/index.html b/程序语言设计/CS242/index.html new file mode 100644 index 00000000..2a895f30 --- /dev/null +++ b/程序语言设计/CS242/index.html @@ -0,0 +1,1960 @@ + + + + + + + + + + + + + + + + CS242 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    + + + + + + + +

    CS242

    + + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/系统安全/CS161/index.html b/系统安全/CS161/index.html new file mode 100644 index 00000000..9d3cb701 --- /dev/null +++ b/系统安全/CS161/index.html @@ -0,0 +1,2124 @@ + + + + + + + + + + + + + + + + UCB CS161: Computer Security - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB CS161: Computer Security

    + +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:CS61A, CS61B, CS61C
    • +
    • 编程语言:C, Go
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    伯克利的计算机系统安全课程,课程内容分为5个部分:

    +
      +
    • Security principles : how to design a secure system
    • +
    • Memory safety : buffer overflow attack
    • +
    • Cryptography : symmetric encryption, asymmetric encryption, MAC, digital signature .........
    • +
    • Web : SQL-injection, XSS, XSRF .......
    • +
    • Networking : attacks for each layer
    • +
    +

    这门课让我印象最为深刻的部分是Project2,让你用Go语言设计和实现一个安全的文件分享系统。我花了整整三天才完成了这个非常虐的Project,总代码量超过3k行。在这样密集型的开发过程中,能极大地锻炼你设计和实现一个安全系统的能力。

    +

    2020年夏季学期的版本开源了课程录影,大家可以在下面的课程网站链接里找到。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:参见课程网站
    • +
    • 课程教材:无
    • +
    • 课程作业:7个在线HW + 3个lab + 3个Project
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/系统安全/MIT6.858/index.html b/系统安全/MIT6.858/index.html new file mode 100644 index 00000000..d12a0d44 --- /dev/null +++ b/系统安全/MIT6.858/index.html @@ -0,0 +1,2107 @@ + + + + + + + + + + + + + + + + MIT 6.858: Computer System Security - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT 6.858: Computer System Security

    + +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:计算机体系结构,对计算机系统有初步了解
    • +
    • 编程语言:C, Python
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    MIT的计算机系统安全课程,实验环境是一个Web Application Zoobar. 学生学习攻防技术并应用于该Web Application.

    +
      +
    • Lab 1: you will explore the zoobar web application, and use buffer overflow attacks to break its security properties.
    • +
    • Lab 2: you will improve the zoobar web application by using privilege separation, so that if one component is compromised, the adversary doesn't get control over the whole web application.
    • +
    • Lab 3: you will build a program analysis tool based on symbolic execution to find bugs in Python code such as the zoobar web application.
    • +
    • Lab 4: you will improve the zoobar application against browser attacks.
    • +
    +

    这个课我主要是做了lab3。lab3是通过混合符号执行来遍历程序的所有分支,理解了符号执行的思想后lab并不难做。这个lab直观展示符号执行这种技术的使用方法。

    +

    这个课的Final Project是实现SecFS,一个远端文件系统,面对完全不可信的服务器,提供机密性和完整性。参考论文为SUNDR

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频:参见课程网站
    • +
    • 课程教材:无
    • +
    • 课程作业:4个lab + Final Project / Lab5
    • +
    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/编程入门/CS106L/index.html b/编程入门/CS106L/index.html new file mode 100644 index 00000000..503f0c20 --- /dev/null +++ b/编程入门/CS106L/index.html @@ -0,0 +1,2127 @@ + + + + + + + + + + + + + + + + Stanford CS106L: Standard C++ Programming - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS106L: Standard C++ Programming

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:最好掌握至少一门编程语言
    • +
    • 编程语言:C++
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:20小时
    • +
    +

    我从大一开始一直都是写的C++代码,直到学完这门课我才意识到,我写的C++代码大概只是C语言 + cin/cout而已。

    +

    这门课会深入到很多标准C++的特性和语法,让你编写出高质量的C++代码。例如auto binding,uniform initialization,lambda function,move semantics,RAII等技巧都在我此后的代码生涯中被反复用到,非常实用。

    +

    值得一提的是,这门课的作业里你会实现一个HashMap(类似于STL中的unordered map), 这个作业几乎把整个课程串联了起来,非常考验代码能力。特别是iterator的实现,做完这个作业我开始理解为什么Linus对C/C++嗤之以鼻了,因为真的很难写对。

    +

    总的来讲这门课并不难,但是信息量很大,需要你在之后的开发实践中反复巩固。Stanford之所以单开一门C++的编程课,是因为它后续的很多CS课程Project都是基于C++的。例如CS144计算机网络和CS143编译器。这两门课在本书中均有收录。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频
    • +
    • 课程教材
    • +
    • 课程作业:具体内容见课程网站,我做的时候一共是两个:
        +
      • (1)实现一个WikiRacer的小游戏
      • +
      • (2)实现一个类似STL库的HashMap
      • +
      +
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/编程入门/CS110L/index.html b/编程入门/CS110L/index.html new file mode 100644 index 00000000..9b0932fc --- /dev/null +++ b/编程入门/CS110L/index.html @@ -0,0 +1,2126 @@ + + + + + + + + + + + + + + + + Stanford CS110L: Safety in Systems Programming - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS110L: Safety in Systems Programming

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:最好有一定的编程背景并对计算机系统有初步的认识。
    • +
    • 编程语言:Rust
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:30小时
    • +
    +

    在这门课中你将会学习Rust这门神奇的语言。

    +

    如果你学过C并接触过一些系统编程的话,应该对C的内存泄漏以及指针的危险有所耳闻,但C的底层特性以及高效仍然让它在系统级编程中无法被例如Java等自带垃圾收集机制的高级语言所替代。而Rust的目标则是希望在C的高效基础上,弥补其安全不足的缺点。因此Rust在设计之初,就有带有很多系统编程的观点。学习Rust,也能让你之后能用C语言编写出更安全更优雅的系统级代码(例如操作系统等)。

    +

    这门课的后半部分关注在并发(concurrency)这一主题上,你将会系统地掌握多进程、多线程、基于事件驱动的并发等若干并发技术,并在第二个project中比较它们各自的优劣。Rust中“futures”的概念非常有趣和优雅,这些基础知识对你后续对计算机系统相关课程的学习很有帮助。另外,清华大学的操统实验rCore就是基于Rust编写的,具体参见文档

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频
    • +
    • 课程教材:无
    • +
    • 课程作业:共6个lab和2个project,作业文档和代码框架详见课程网站。其中两个project非常有趣,分别是:
        +
      • (1)用Rust实现一个类似于gdb的debugger
      • +
      • (2)用Rust实现一个负载均衡器
      • +
      +
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/编程入门/CS50/index.html b/编程入门/CS50/index.html new file mode 100644 index 00000000..ce0390d8 --- /dev/null +++ b/编程入门/CS50/index.html @@ -0,0 +1,2104 @@ + + + + + + + + + + + + + + + + Harvard CS50: This is CS50x - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS50: This is CS50x

    +

    课程简介

    +
      +
    • 所属大学:哈佛大学
    • +
    • 先修要求:无
    • +
    • 编程语言:C,Python,SQL,HTML,CSS,JavaScript
    • +
    • 课程难度:🌟🌟
    • +
    • 预计学时:20小时
    • +
    +

    连续多年被哈佛大学学生评为最受欢迎的公选课程。Malan教授上课非常有激情,撕黄页讲二分法的场面让人记忆犹新(笑)。但因为它的入门以及全校公选的属性,课程内容难度比较温和,但是课程作业质量非常高而且全部免费开源,非常适合小白入门,或者大佬休闲。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/编程入门/CS61A/index.html b/编程入门/CS61A/index.html new file mode 100644 index 00000000..7c071c35 --- /dev/null +++ b/编程入门/CS61A/index.html @@ -0,0 +1,2128 @@ + + + + + + + + + + + + + + + + UCB CS61A: Structure and Interpretation of Computer Programs - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS61A: Structure and Interpretation of Computer Programs

    +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:无
    • +
    • 编程语言:Python,Scheme,SQL
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:50小时
    • +
    +

    伯克利CS61系列的第一门课程,也是我的Python入门课。

    +

    CS61系列是伯克利CS专业的入门课,其中:

    +
      +
    • CS61A:强调抽象,让学生掌握用程序来解决实际问题,而不关注底层的硬件细节。
    • +
    • CS61B:注重算法与数据结构以及大规模程序的构建,学生会用Java语言结合算法与数据结构的知识来构建千行代码级别的大型项目(一个简易的谷歌地图,一个二维版的Minecraft)。
    • +
    • CS61C:关注计算机体系结构,让学生理解高级语言(例如C)是如何一步步转换为机器可以理解的01串并在CPU执行的,学生将会学习RISC-V架构并自己用Logism实现一个CPU。
    • +
    +

    CS61B和CS61C在本书中均有收录。

    +

    回到CS61A,注意这不仅仅是一门编程语言课,而是会深入到程序构造与运行的原理。最后你将在第4个Project中用Python实现一个Scheme的解释器。此外,抽象将是这门课的一大主题,你将学习到函数式编程、数据抽象、面向对象等等知识来让你的代码更易读,更模块化。当然,学习编程语言也是这门课的一大内容,你将会掌握Python、Scheme和SQL这三种编程语言,在它们的学习和比较中,相信你会拥有快速掌握一门新的编程语言的能力。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频: 参见课程网站链接
    • +
    • 课程教材
    • +
    • 课程作业:课程网站会有每个作业对应的文档链接以及代码框架的下载链接。
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/编程入门/MIT-Missing-Semester/index.html b/编程入门/MIT-Missing-Semester/index.html new file mode 100644 index 00000000..400983a4 --- /dev/null +++ b/编程入门/MIT-Missing-Semester/index.html @@ -0,0 +1,2098 @@ + + + + + + + + + + + + + + + + MIT-Missing-Semester - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT-Missing-Semester

    + +

    课程简介

    +
      +
    • 先修要求:无
    • +
    • 编程语言:shell
    • +
    • 课程难度:🌟🌟
    • +
    • 预计学时:10小时
    • +
    +

    正如课程名字所言:“计算机教学中消失的一个学期”,这门课将会教会你许多大学的课堂上不会涉及但却对每个CSer无比重要的工具或者知识点。例如Shell编程、命令行配置、Git、Vim、tmux、ssh等等。如果你是一个计算机小白,那么我非常建议你学习一下这门课,因为它基本涉及了本书必学工具中的绝大部分内容。

    +

    除了MIT官方的学习资料外,北京大学图灵班开设的前沿计算实践中也开设了相关课程,资料位于这个网站下,供大家参考。

    +

    课程资源

    + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/编译原理/6035/index.html b/编译原理/6035/index.html new file mode 100644 index 00000000..a2641c97 --- /dev/null +++ b/编译原理/6035/index.html @@ -0,0 +1,1960 @@ + + + + + + + + + + + + + + + + 6035 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    + + + + + + + +

    6035

    + + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/编译原理/CS143/index.html b/编译原理/CS143/index.html new file mode 100644 index 00000000..606618b3 --- /dev/null +++ b/编译原理/CS143/index.html @@ -0,0 +1,2121 @@ + + + + + + + + + + + + + + + + Stanford CS143: Compilers - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Stanford CS143: Compilers

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:计算机体系结构
    • +
    • 编程语言:Java或C++
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:150小时
    • +
    +

    斯坦福的编译原理课程,设计者开发了一个Class-Object-Oriented-Language,简称COOL语言。这门课的核心就是通过理论知识的学习,为COOL语言实现一个编译器,将COOL高级语言编译为MIPS汇编并在Spim这个MIPS模拟器上成功执行。

    +

    理论部分基本按照龙书的顺序覆盖了词法分析、语法分析、语义分析、运行时环境、寄存器分配、代码优化与生成等内容,实践部分则相应地分为词法分析、语法分析、语义分析、代码生成四个阶段,难度循序渐进,并在优化部分给学生留下了很大的设计空间。

    +

    课程资源

    +
      +
    • 课程网站
    • +
    • 课程视频
    • +
    • 课程教材:龙书
    • +
    • 课程作业:5个书面作业 + 5个编程作业带你实现一个编译器
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/计算机图形学/CS184/index.html b/计算机图形学/CS184/index.html new file mode 100644 index 00000000..4966d7d6 --- /dev/null +++ b/计算机图形学/CS184/index.html @@ -0,0 +1,1960 @@ + + + + + + + + + + + + + + + + CS184 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    + + + + + + + +

    CS184

    + + + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/计算机图形学/GAMES101/index.html b/计算机图形学/GAMES101/index.html new file mode 100644 index 00000000..59fa9cd2 --- /dev/null +++ b/计算机图形学/GAMES101/index.html @@ -0,0 +1,2121 @@ + + + + + + + + + + + + + + + + GAMES101 - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    GAMES101

    + +

    课程简介

    +
      +
    • 所属大学:UCSB
    • +
    • 先修要求:线性代数,高等数学,C++
    • +
    • 编程语言:C++
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:80小时
    • +
    +

    官方介绍:

    +

    本课程将全面而系统地介绍现代计算机图形学的四大组成部分:(1)光栅化成像,(2)几何表示,(3)光的传播理论,以及(4)动画与模拟。每个方面都会从基础原理出发讲解到实际应用,并介绍前沿的理论研究。通过本课程,你可以学习到计算机图形学背后的数学和物理知识,并锻炼实际的编程能力。

    +

    顾名思义,作为入门,本课程会尽可能的覆盖图形学的方方面面,把每一部分的基本概念都尽可能说清楚,让大家对计算机图形学有一个完整的、自上而下的全局把握。全局的理解很重要,学完本课程后,你会了解到图形学不等于 OpenGL,不等于光线追踪,而是一套生成整个虚拟世界的方法。从本课程的标题,大家还可以看到“现代”二字,也就是说,这门课所要给大家介绍的都是现代化的知识,也都是现代图形学工业界需要的图形学基础。

    +

    国内相当有名的图形学公开课。和大家印象中的图形学里全都是数学和奇怪的算法不同,这门课以十分生动的方式带我们进入了图形学这个领域的大门。

    +

    每个project代码量都不会很多,但是却都十分有趣。在做这些project的过程中,我们会实现简单的光栅化,并渲染一个简易的模型,我们还会实现光线追踪,以追求渲染更好的质量。每个project中还有选做等拓展作业,可以让我们渲染的模型具有更好的质量,更快的渲染速度。

    +

    喜欢玩游戏的同学应该对实时光线追踪有一定的了解,这门课的老师闫令琪就对这一技术有直接的推动作用。

    +

    跟着课程的视频,做完每一个project,相信你会和我一样对图形学,以及现代的渲染技术产生浓厚的兴趣。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/计算机网络/CS144/index.html b/计算机网络/CS144/index.html new file mode 100644 index 00000000..d97a79a5 --- /dev/null +++ b/计算机网络/CS144/index.html @@ -0,0 +1,2121 @@ + + + + + + + + + + + + + + + + Stanford CS144: Computer Network - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    CS144: Computer Network

    +

    课程简介

    +
      +
    • 所属大学:Stanford
    • +
    • 先修要求:一定的计算机系统基础,CS106L
    • +
    • 编程语言:C++
    • +
    • 课程难度:🌟🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    这门课的主讲人之一是网络领域的巨擘Nick McKeown教授。这位拥有自己创业公司的学界业界双巨佬会在他慕课每一章节的最后采访一位业界的高管或者学界的高人,非常开阔眼界。

    +

    在这门课的Project中,你将用C++循序渐进地搭建出整个TCP/IP协议栈,实现IP路由以及ARP协议,最后利用你自己的协议栈代替Linux Kernel的网络协议栈和其他学生的计算机进行通信,非常amazing!

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/计算机网络/topdown/index.html b/计算机网络/topdown/index.html new file mode 100644 index 00000000..7d68fad0 --- /dev/null +++ b/计算机网络/topdown/index.html @@ -0,0 +1,2120 @@ + + + + + + + + + + + + + + + + Computer Networking: A Top-Down Approach - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    Computer Networking: A Top-Down Approach

    +

    课程简介

    +
      +
    • 所属大学:马萨诸塞大学
    • +
    • 先修要求:有一定的计算机系统基础
    • +
    • 编程语言:无
    • +
    • 课程难度:🌟🌟🌟
    • +
    • 预计学时:40小时
    • +
    +

    《自顶向下方法》是计算机网络领域的一本经典教材,两位作者Jim Kurose和Keith Ross精心制作了教材配套的课程网站,并且公开了自己录制的网课视频,交互式的在线章节测试,以及利用wireshark进行抓包分析的lab。唯一遗憾的是这门课并没有硬核的编程作业,而Stanford的CS144能很好地弥补这一点。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/软件工程/6031/index.html b/软件工程/6031/index.html new file mode 100644 index 00000000..1e3f0ab5 --- /dev/null +++ b/软件工程/6031/index.html @@ -0,0 +1,2122 @@ + + + + + + + + + + + + + + + + MIT 6.031: Software Construction - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    MIT 6.031: Software Construction

    + +

    课程简介

    +
      +
    • 所属大学:MIT
    • +
    • 先修要求:掌握至少一门编程语言
    • +
    • 编程语言:Java
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    这门课的目标就是让学生学会如何写出高质量的代码,所谓高质量,则是满足下面三个目标(课程设计者原话复制,以防自己翻译曲解本意):

    +
      +
    • Safe from bugs. Correctness (correct behavior right now) and defensiveness (correct behavior in the future) are required in any software we build.
    • +
    • Easy to understand. The code has to communicate to future programmers who need to understand it and make changes in it (fixing bugs or adding new features). That future programmer might be you, months or years from now. You’ll be surprised how much you forget if you don’t write it down, and how much it helps your own future self to have a good design.
    • +
    • Ready for change. Software always changes. Some designs make it easy to make changes; others require throwing away and rewriting a lot of code.
    • +
    +

    为此,这门课的设计者们精心编写了一本书来阐释诸多软件构建的核心原则与前人总结下来的宝贵经验,内容细节到如何编写注释和函数Specification,如何设计抽象数据结构以及诸多并行编程的内容,并且会让你在精心设计的Java编程项目里体验和练习这些编程模式。

    +

    2016年春季学期这门课开源了其所有编程作业的代码框架,而最新的课程教材可以在其最新的教学网站上找到,具体链接参见下方。

    +

    课程资源

    +
      +
    • 课程网站:2021spring2016spring
    • +
    • 课程视频:无
    • +
    • 课程教材:参见课程网站的课程notes
    • +
    • 课程作业:4个编程作业 + 1个Project
    • +
    +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file diff --git a/软件工程/CS169/index.html b/软件工程/CS169/index.html new file mode 100644 index 00000000..3fc7d008 --- /dev/null +++ b/软件工程/CS169/index.html @@ -0,0 +1,2116 @@ + + + + + + + + + + + + + + + + UCB CS169: software engineering - CS自学指南 + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    + +
    + + + + +
    + + +
    + +
    + + + + + + +
    +
    + + + +
    +
    +
    + + + + +
    +
    +
    + + + +
    +
    +
    + + + +
    +
    +
    + + +
    +
    + + + + + + + +

    UCB CS169: software engineering

    + +

    课程简介

    +
      +
    • 所属大学:UC Berkeley
    • +
    • 先修要求:无
    • +
    • 编程语言:Ruby/JavaScript
    • +
    • 课程难度:🌟🌟🌟🌟
    • +
    • 预计学时:100小时
    • +
    +

    伯克利的软件工程课程,不同于很多传统的软件工程课强调各种类图、文档设计(plan and document模式),这门课专注于最近逐渐流行起来的敏捷开发(Agile Development)模式,利用云平台提供软件即服务(software as a service)。为此,课程设计者编写了Software as a service这本教材,通过Ruby/Rails框架来阐释saas这个概念,并且有丰富的配套编程练习。

    +

    这门课在Edx这个由MIT和Havard大学发起的在线教育平台全资料开源,大家可以在Edx自行搜索Agile SaaS Development这门课程进行学习。课程内容基本按照教材的顺序带你一步步以敏捷开发的方式搭建一个软件并免费部署在云平台上。

    +

    课程资源

    + +

    资源汇总

    +

    我在学习这门课中用到的所有资源和作业实现都汇总在这个Github仓库中。

    + + +
    +
    +
    + +
    + + + +
    +
    +
    +
    + + + + + + + + \ No newline at end of file