SFS: Smart OS Scheduling for Serverless Functions Yuqi Fu, Li Liu, Haoliang Wang, Yue Cheng, Songqing Chen The International Conference for High Performance Computing, Networking, Storage and Analysis 2022 (SC’22) Best Student Paper Award Finalist
BESPOKV: Application Tailored Scale-Out Key-Value Stores Ali Anwar, Yue Cheng, Hai Huang, Jingoo Han, Hyogi Sim, Dongyoon Lee, Fred Douglis, Ali R. Butt The International Conference for High Performance Computing, Networking, Storage, and Analysis (SC’18) [Acceptance rate = 23.6%]
Improving Docker Registry Design based on Production Workload Analysis Ali Anwar, Mohamed Mohamed, Vasily Tarasov, Michael Littley, Lukas Rupprecht, Yue Cheng, Nannan Zhao, Dimitrios Skourtis, Amit S. Warke, Heiko Ludwig, Dean Hildebrand, Ali R. Butt USENIX Conference on File and Storage Techniques 2018 (USENIX FAST’18) [Acceptance rate = 16.4%]
Course evaluation (Note that prior to Fall 2020, all GMU teaching evaluation reports were in archived paper format; since Spring 2021, all teaching evaluation forms are in E form.)
\ No newline at end of file
diff --git a/_bibliography/papers.bib b/_bibliography/papers.bib
deleted file mode 100644
index 6cdb630c..00000000
--- a/_bibliography/papers.bib
+++ /dev/null
@@ -1,717 +0,0 @@
----
----
-
-
-@inproceedings{ptm_vldb24,
-author = {Zhaoyuan Su and Ammar Ahmed and Zirui Wang and Ali Anwar and Yue Cheng},
-title = {Everything You Always Wanted to Know About Storage Compressibility of Pre-Trained ML Models but Were Afraid to Ask},
-year = {2024},
-booktitle = {50th International Conference on Very Large Data Bases},
-abbr = {arXiv},
-arxiv = {https://arxiv.org/abs/2402.13429},
-abbr = {VLDB'24},
-selected={true},
-}
-
-@inproceedings{dlis_aca_vldb24,
-author = {Rui Yang and Evgenios M. Kornaropoulos and Yue Cheng},
-title = {Algorithmic Complexity Attacks on Dynamic Learned Indexes},
-year = {2024},
-booktitle = {50th International Conference on Very Large Data Bases},
-abbr = {VLDB'24},
-pdf = {https://www.vldb.org/pvldb/vol17/p780-yang.pdf},
-arxiv = {https://arxiv.org/abs/2403.12433},
-code = {https://github.com/ds2-lab/aca-dlis},
-selected={true},
-}
-
-@inproceedings{llm_survey24,
-author = {Guangji Bai and Zheng Chai and Chen Ling and Shiyu Wang and Jiaying Lu and Nan Zhang and Tingwei Shi and Ziyang Yu and Mengdan Zhu and Yifei Zhang and Carl Yang and Yue Cheng and Liang Zhao},
-title = {Beyond Efficiency: A Systematic Survey of Resource-Efficient Large Language Models},
-year = {2024},
-abbr = {arXiv},
-arxiv={https://arxiv.org/abs/2401.00625},
-website = {https://github.com/tiingweii-shii/Awesome-Resource-Efficient-LLM-Papers},
-selected={true},
-}
-
-@inproceedings{fl_bigdata23,
-author = {Ahmad Khan and Yuze Li and Xinran Wang and Sabaat Haroon and Haider Ali and Yue Cheng and Ali R. Butt and and Ali Anwar},
-title = {Towards Cost-effective and Resource-aware Aggregation at Edge for Federated Learning},
-year = {2023},
-booktitle = {2023 IEEE International Conference on Big Data},
-abbr = {BigData'23},
-pdf = {https://ieeexplore.ieee.org/abstract/document/10386691},
-}
-
-@inproceedings{lambdaFS_asplos23,
-author = {Benjamin Carver and Runzhou Han and Jingyuan Zhang and Mai Zheng and Yue Cheng},
-title = {λFS: A Scalable and Elastic Distributed File System Metadata Service using Serverless Functions},
-year = {2023},
-booktitle = {28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems},
-abbr = {ASPLOS'23},
-arxiv={https://arxiv.org/abs/2306.11877},
-pdf = {asplos23-lambdafs-ae.pdf},
-code = {https://github.com/ds2-lab/LambdaFS},
-selected={true},
-}
-
-@inproceedings{infinistore_vldb23,
-author = {Jingyuan Zhang and Ao Wang and Xiaolong Ma and Benjamin Carver and Nicholas John Newman and Ali Anwar and Lukas Rupprecht and Dimitrios Skourtis and Vasily Tarasov and Feng Yan and Yue Cheng},
-title = {InfiniStore: Elastic Serverless Cloud Storage},
-year = {2023},
-booktitle = {49th International Conference on Very Large Data Bases},
-abbr = {VLDB'23},
-arxiv={https://arxiv.org/abs/2209.01496},
-pdf = {vldb23-infinistore.pdf},
-code={https://github.com/ds2-lab/infinistore},
-selected={true},
-}
-
-@inproceedings{shade_fast23,
-author = {Redwan Ibne Seraj Khan and Ahmad Hossein Yazdani and Yuqi Fu and Arnab K. Paul and Bo Ji and Xun Jian and Yue Cheng and Ali R. Butt},
-title = {SHADE: Enable Fundamental Cacheability for Distributed Deep Learning Training},
-booktitle = {21th USENIX Conference on File and Storage Technologies (FAST 23)},
-year = {2023},
-month = feb,
-abbr = {USENIX FAST'23},
-talk = {https://www.usenix.org/conference/fast23/presentation/khan},
-code = {https://github.com/R-I-S-Khan/SHADE},
-selected={true},
-pdf={fast23-shade.pdf},
-}
-
-@inproceedings{lossy_drbsd8,
-author = {Zhaoyuan Su and Sheng Di and Ali Murat Gok and Yue Cheng and Franck Cappello},
-title = {Understanding Impact of Lossy Compression on Derivative-related Metrics in Scientific Datasets},
-year = {2022},
-booktitle = {Proceedings of the 8th International Workshop on Data Analysis and Reduction for Big Scientific Data},
-series = {DRBSD-8 '22},
-abbr = {DRBSD-8 '22},
-}
-
-@inproceedings{sion_preprint,
-author = {Jingyuan Zhang and Ao Wang and Xiaolong Ma and Benjamin Carver and Nicholas John Newman and Ali Anwar and Lukas Rupprecht and Dimitrios Skourtis and Vasily Tarasov and Feng Yan and Yue Cheng},
-title = {InfiniStore: Elastic Serverless Cloud Storage},
-year = {2022},
-booktitle = {Preprint},
-abbr = {Preprint},
-arxiv={https://arxiv.org/abs/2209.01496},
-code={https://github.com/ds2-lab/infinistore},
-}
-
-@inproceedings{sfs_sc22,
-author = {Yuqi Fu and Li Liu and Haoliang Wang and Yue Cheng and Songqing Chen},
-title = {SFS: Smart OS Scheduling for Serverless Functions},
-year = {2022},
-booktitle = {Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis},
-series = {SC '22},
-abbr = {SC'22},
-selected={true},
-arxiv={https://arxiv.org/abs/2209.01709},
-pdf = {sc22-sfs-ae.pdf},
-code={https://github.com/ds2-lab/SFS},
-award = {Best Student Paper Award Finalist},
-}
-
-@inproceedings{rkube_socc21,
-abbr={SoCC'21},
-author = {Liu, Li and Wang, Haoliang and Wang, An and Xiao, Mengbai and Cheng, Yue and Chen, Songqing},
-title = {Mind the Gap: Broken Promises of CPU Reservations in Containerized Multi-Tenant Clouds},
-year = {2021},
-isbn = {9781450386388},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/3472883.3486997},
-doi = {10.1145/3472883.3486997},
-abstract = {Containerization is becoming increasingly popular, but unfortunately, containers often fail to deliver the anticipated performance with the allocated resources. In this paper, we first demonstrate the performance variance and degradation are significant (by up to 5x) in a multi-tenant environment where containers are co-located. We then investigate the root cause of such performance degradation. Contrary to the common belief that such degradation is caused by resource contention and interference, we find that there is a gap between the amount of CPU a container reserves and actually gets. The root cause lies in the design choices of today's Linux scheduling mechanism, which we call Forced Runqueue Sharing and Phantom CPU Time. In fact, there are fundamental conflicts between the need to reserve CPU resources and Completely Fair Scheduler's work-conserving nature, and this contradiction prevents a container from fully utilizing its requested CPU resources. As a proof-of-concept, we implement a new resource configuration mechanism atop the widely used Kubernetes and Linux to demonstrate its potential benefits and shed light on future scheduler redesign. Our proof-of-concept, compared to the existing scheduler, improves the performance of both batch and interactive containerized apps by up to 5.6x and 13.7x.},
-booktitle = {Proceedings of the ACM Symposium on Cloud Computing},
-pages = {243–257},
-numpages = {15},
-keywords = {Resource management, Cloud, CPU scheduling, Containers, Multi-tenancy},
-location = {Seattle, WA, USA},
-series = {SoCC '21},
-code = {https://github.com/njuliuli/kubernetes/tree/policy},
-pdf = {socc21-rkube.pdf}
-}
-
-@inproceedings{fedat_sc21,
-author = {Chai, Zheng and Chen, Yujing and Anwar, Ali and Zhao, Liang and Cheng, Yue and Rangwala, Huzefa},
-title = {FedAT: A High-Performance and Communication-Efficient Federated Learning System with Asynchronous Tiers},
-year = {2021},
-isbn = {9781450384421},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/3458817.3476211},
-doi = {10.1145/3458817.3476211},
-abstract = {Federated learning (FL) involves training a model over massive distributed devices, while keeping the training data localized and private. This form of collaborative learning exposes new tradeoffs among model convergence speed, model accuracy, balance across clients, and communication cost, with new challenges including: (1) straggler problem---where clients lag due to data or (computing and network) resource heterogeneity, and (2) communication bottleneck---where a large number of clients communicate their local updates to a central server and bottleneck the server. Many existing FL methods focus on optimizing along only one single dimension of the tradeoff space. Existing solutions use asynchronous model updating or tiering-based, synchronous mechanisms to tackle the straggler problem. However, asynchronous methods can easily create a communication bottleneck, while tiering may introduce biases that favor faster tiers with shorter response latencies.To address these issues, we present FedAT, a novel Federated learning system with Asynchronous Tiers under Non-i.i.d. training data. FedAT synergistically combines synchronous, intra-tier training and asynchronous, cross-tier training. By bridging the synchronous and asynchronous training through tiering, FedAT minimizes the straggler effect with improved convergence speed and test accuracy. FedAT uses a straggler-aware, weighted aggregation heuristic to steer and balance the training across clients for further accuracy improvement. FedAT compresses uplink and downlink communications using an efficient, polyline-encoding-based compression algorithm, which minimizes the communication cost. Results show that FedAT improves the prediction performance by up to 21.09% and reduces the communication cost by up to 8.5\texttimes{}, compared to state-of-the-art FL methods.},
-booktitle = {Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis},
-articleno = {60},
-numpages = {16},
-keywords = {asynchronous distributed learning, tiering, federated learning, weighted aggregation, communication efficiency},
-location = {St. Louis, Missouri},
-series = {SC '21},
-abbr = {SC'21},
-pdf = {sc21-fedat.pdf},
-arxiv = {https://arxiv.org/abs/2010.05958}
-}
-
-@inproceedings {faasnet_atc21,
-author = {Ao Wang and Shuai Chang and Huangshi Tian and Hongqi Wang and Haoran Yang and Huiba Li and Rui Du and Yue Cheng},
-title = {{FaaSNet}: Scalable and Fast Provisioning of Custom Serverless Container Runtimes at Alibaba Cloud Function Compute},
-booktitle = {2021 USENIX Annual Technical Conference (USENIX ATC 21)},
-year = {2021},
-isbn = {978-1-939133-23-6},
-pages = {443--457},
-url = {https://www.usenix.org/conference/atc21/presentation/wang-ao},
-publisher = {USENIX Association},
-month = {jul},
-abbr = {USENIX ATC'21},
-selected={true},
-slides = {https://www.usenix.org/conference/atc21/presentation/wang-ao},
-pdf = {atc21-faasnet.pdf},
-code = {https://github.com/ds2-lab/FaaSNet},
-}
-
-@inproceedings{DBLP:journals/corr/abs-2112-09335,
- author = {Hongyi Li and
- Junxiang Wang and
- Yongchao Wang and
- Yue Cheng and
- Liang Zhao},
- title = {Community-based Layerwise Distributed Training of Graph Convolutional
- Networks},
- journal = {CoRR},
- volume = {abs/2112.09335},
- year = {2021},
- url = {https://arxiv.org/abs/2112.09335},
- eprinttype = {arXiv},
- eprint = {2112.09335},
- timestamp = {Mon, 03 Jan 2022 15:45:35 +0100},
- biburl = {https://dblp.org/rec/journals/corr/abs-2112-09335.bib},
- bibsource = {dblp computer science bibliography, https://dblp.org},
- booktitle = {The 13th International OPT Workshop on Optimization for Machine Learning (OPT’21)},
- abbr = {OPT'21},
- arxiv = {https://arxiv.org/abs/2112.09335}
-}
-
-@article{ben_master_thesis,
-author = {Benjamin Carver},
-title = {Wukong: A Fast, Cost-Effective, and Easy-to-Use Serverless DAG Engine},
-year = {2021},
-html = {https://mars.gmu.edu/xmlui/handle/1920/12093},
-abbr = {Thesis},
-pdf = {carver-thesis21.pdf}
-}
-
-@INPROCEEDINGS{9338293,
- author={Wang, Junxiang and Chai, Zheng and Cheng, Yue and Zhao, Liang},
- booktitle={2020 IEEE International Conference on Data Mining (ICDM)},
- title={Toward Model Parallelism for Deep Neural Network Based on Gradient-Free ADMM Framework},
- year={2020},
- pages={591-600},
- doi={10.1109/ICDM50108.2020.00068},
- abbr = {ICDM '21},
- arxiv = {https://arxiv.org/abs/2009.02868}
-}
-
-@inproceedings{10.1145/3419111.3421286,
-author = {Carver, Benjamin and Zhang, Jingyuan and Wang, Ao and Anwar, Ali and Wu, Panruo and Cheng, Yue},
-title = {Wukong: A Scalable and Locality-Enhanced Framework for Serverless Parallel Computing},
-year = {2020},
-isbn = {9781450381376},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/3419111.3421286},
-doi = {10.1145/3419111.3421286},
-abstract = {Executing complex, burst-parallel, directed acyclic graph (DAG) jobs poses a major challenge for serverless execution frameworks, which will need to rapidly scale and schedule tasks at high throughput, while minimizing data movement across tasks. We demonstrate that, for serverless parallel computations, decentralized scheduling enables scheduling to be distributed across Lambda executors that can schedule tasks in parallel, and brings multiple benefits, including enhanced data locality, reduced network I/Os, automatic resource elasticity, and improved cost effectiveness. We describe the implementation and deployment of our new serverless parallel framework, called Wukong, on AWS Lambda. We show that Wukong achieves near-ideal scalability, executes parallel computation jobs up to 68.17X faster, reduces network I/O by multiple orders of magnitude, and achieves 92.96% tenant-side cost savings compared to numpywren.},
-booktitle = {Proceedings of the 11th ACM Symposium on Cloud Computing},
-pages = {1–15},
-numpages = {15},
-location = {Virtual Event, USA},
-series = {SoCC '20},
-abbr = {SoCC'20},
-selected={true},
-code = {https://github.com/ds2-lab/Wukong},
-talk = {https://www.youtube.com/watch?v=W0tENnx_58I},
-pdf = {socc20-wukong.pdf},
-arxiv = {https://arxiv.org/abs/2010.07268}
-}
-
-@inproceedings{DBLP:journals/corr/abs-2009-04053,
- author = {Junxiang Wang and
- Zheng Chai and
- Yue Cheng and
- Liang Zhao},
- title = {Tunable Subnetwork Splitting for Model-parallelism of Neural Network
- Training},
- journal = {CoRR},
- volume = {abs/2009.04053},
- year = {2020},
- url = {https://arxiv.org/abs/2009.04053},
- eprinttype = {arXiv},
- eprint = {2009.04053},
- abbr = {OPTML-ICML'20},
- booktitle = {Beyond First Order Methods in ML Systems},
- arxiv = {https://arxiv.org/abs/2009.04053},
- code = {https://github.com/xianggebenben/TSSM},
-}
-
-@inproceedings{10.1145/3369583.3392686,
-author = {Chai, Zheng and Ali, Ahsan and Zawad, Syed and Truex, Stacey and Anwar, Ali and Baracaldo, Nathalie and Zhou, Yi and Ludwig, Heiko and Yan, Feng and Cheng, Yue},
-title = {TiFL: A Tier-Based Federated Learning System},
-year = {2020},
-isbn = {9781450370523},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/3369583.3392686},
-doi = {10.1145/3369583.3392686},
-abstract = {Federated Learning (FL) enables learning a shared model acrossmany clients without violating the privacy requirements. One of the key attributes in FL is the heterogeneity that exists in both resource and data due to the differences in computation and communication capacity, as well as the quantity and content of data among different clients. We conduct a case study to show that heterogeneity in resource and data has a significant impact on training time and model accuracy in conventional FL systems. To this end, we propose TiFL, a Tier-based Federated Learning System, which divides clients into tiers based on their training performance and selects clients from the same tier in each training round to mitigate the straggler problem caused by heterogeneity in resource anddata quantity. To further tame the heterogeneity caused by non-IID (Independent and Identical Distribution) data and resources, TiFL employs an adaptive tier selection approach to update the tiering on-the-fly based on the observed training performance and accuracy. We prototype TiFL in a FL testbed following Google's FL architecture and evaluate it using the state-of-the-art FL benchmarks. Experimental evaluation shows that TiFL outperforms the conventional FL in various heterogeneous conditions. With the proposed adaptive tier selection policy, we demonstrate that TiFL achieves much faster training performance while achieving the same or better test accuracy across the board.},
-booktitle = {Proceedings of the 29th International Symposium on High-Performance Parallel and Distributed Computing},
-pages = {125–136},
-numpages = {12},
-keywords = {edge computing, data heterogeneity, non-IID, federated learning, resource heterogeneity, stragglers},
-location = {Stockholm, Sweden},
-series = {HPDC '20},
-abbr = {HPDC'20},
-selected={true},
-pdf = {hpdc20-tifl.pdf},
-arxiv = {https://arxiv.org/abs/2001.09249}
-}
-
-@inproceedings {infinicache_fast20,
-author = {Ao Wang and Jingyuan Zhang and Xiaolong Ma and Ali Anwar and Lukas Rupprecht and Dimitrios Skourtis and Vasily Tarasov and Feng Yan and Yue Cheng},
-title = {{InfiniCache}: Exploiting Ephemeral Serverless Functions to Build a {Cost-Effective} Memory Cache},
-booktitle = {18th USENIX Conference on File and Storage Technologies (FAST 20)},
-year = {2020},
-isbn = {978-1-939133-12-0},
-address = {Santa Clara, CA},
-pages = {267--281},
-url = {https://www.usenix.org/conference/fast20/presentation/wang-ao},
-publisher = {USENIX Association},
-month = feb,
-abbr = {USENIX FAST'20},
-talk = {https://www.usenix.org/conference/fast20/presentation/wang-ao},
-website = {https://ds2-lab.github.io/infinicache/},
-selected={true},
-pdf={fast20-infinicache.pdf},
-press = {https://spectrum.ieee.org/pay-cloud-services-data-tool-news},
-blog = {https://mikhail.io/2020/03/infinicache-distributed-cache-on-aws-lambda/},
-}
-
-
-
-@ARTICLE{8631172,
-
- author={Cameron, Kirk W. and Anwar, Ali and Cheng, Yue and Xu, Li and Li, Bo and Ananth, Uday and Bernard, Jon and Jearls, Chandler and Lux, Thomas and Hong, Yili and Watson, Layne T. and Butt, Ali R.},
-
- journal={IEEE Transactions on Parallel and Distributed Systems},
-
- title={MOANA: Modeling and Analyzing I/O Variability in Parallel System Experimental Design},
-
- year={2019},
-
- volume={30},
-
- number={8},
-
- pages={1843-1856},
-
- doi={10.1109/TPDS.2019.2892129},
- abbr={TPDS},
- html={https://ieeexplore.ieee.org/document/8631172}
-}
-
-@inproceedings{zhanghyperfaas,
- title={HyperFaaS: A Truly Elastic Serverless Computing Framework},
- author={Zhang, Jingyuan and Wang, Ao and Li, Min and Chen, Yuan and Cheng, Yue},
- booktitle={USENIX Symposium on Networked Systems Design and Implementation},
- abbr={USENIX NSDI'19},
- year={2019},
- poster={nsdi19-hyperfaas.pdf}
-}
-
-
-@INPROCEEDINGS{8955207,
-
- author={Carver, Benjamin and Zhang, Jingyuan and Wang, Ao and Cheng, Yue},
-
- booktitle={2019 IEEE/ACM Fourth International Parallel Data Systems Workshop (PDSW)},
-
- title={In Search of a Fast and Efficient Serverless DAG Engine},
-
- year={2019},
-
- volume={},
-
- number={},
-
- pages={1-10},
-
- doi={10.1109/PDSW49588.2019.00005},
- abbr={PDSW'19},
- arxiv={https://arxiv.org/abs/1910.05896},
- pdf={pdsw19-wukong.pdf},
- code={https://github.com/ds2-lab/Wukong}
-}
-
-@INPROCEEDINGS{8814549,
-
- author={Littley, Michael and Anwar, Ali and Fayyaz, Hannan and Fayyaz, Zeshan and Tarasov, Vasily and Rupprecht, Lukas and Skourtis, Dimitrios and Mohamed, Mohamed and Ludwig, Heiko and Cheng, Yue and Butt, Ali R.},
-
- booktitle={2019 IEEE 12th International Conference on Cloud Computing (CLOUD)},
-
- title={Bolt: Towards a Scalable Docker Registry via Hyperconvergence},
-
- year={2019},
-
- volume={},
-
- number={},
-
- pages={358-366},
-
- doi={10.1109/CLOUD.2019.00065},
- pdf={cloud19-bolt.pdf},
- abbr={Cloud'19}
-}
-
-@inproceedings {232971,
-author = {Zheng Chai and Hannan Fayyaz and Zeshan Fayyaz and Ali Anwar and Yi Zhou and Nathalie Baracaldo and Heiko Ludwig and Yue Cheng},
-title = {Towards Taming the Resource and Data Heterogeneity in Federated Learning},
-booktitle = {2019 USENIX Conference on Operational Machine Learning (OpML 19)},
-year = {2019},
-isbn = {978-1-939133-00-7},
-address = {Santa Clara, CA},
-pages = {19--21},
-url = {https://www.usenix.org/conference/opml19/presentation/chai},
-publisher = {USENIX Association},
-month = may,
-abbr={USENIX OpML'19},
-pdf={opml19-fl.pdf},
-talk={https://www.usenix.org/conference/opml19/presentation/chai}
-}
-
-@inproceedings{10.1145/3313808.3313814,
-author = {Liu, Li and Wang, Haoliang and Wang, An and Xiao, Mengbai and Cheng, Yue and Chen, Songqing},
-title = {VCPU as a Container: Towards Accurate CPU Allocation for VMs},
-year = {2019},
-isbn = {9781450360203},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/3313808.3313814},
-doi = {10.1145/3313808.3313814},
-abstract = {With our increasing reliance on cloud computing, accurate resource allocation of virtual machines (or domains) in the cloud have become more and more important. However, the current design of hypervisors (or virtual machine monitors) fails to accurately allocate resources to the domains in the virtualized environment. In this paper, we claim the root cause is that the protection scope is erroneously used as the resource scope for a domain in the current virtualization design. Such design flaw prevents the hypervisor from accurately accounting resource consumption of each domain. In this paper, using virtual CPUs as a container we propose to redefine the resource scope of a domain, so that the new resource scope is aligned with all the CPU consumption incurred by this domain. As a demonstration, we implement a novel system, called VASE (vCPU as a container), on top of the Xen hypervisor. Evaluations on our testbed have shown our proposed approach is effective in accounting system-wide CPU consumption incurred by domains, while introducing negligible overhead to the system.},
-booktitle = {Proceedings of the 15th ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments},
-pages = {193–206},
-numpages = {14},
-keywords = {CPU Accounting, Scheduling, Virtual I/O, Cloud Computing},
-location = {Providence, RI, USA},
-series = {VEE 2019},
-pdf={vee19-vase.pdf},
-abbr = {VEE'19}
-}
-
-@article{book_chapter,
- author={Ali R. Butt and Ali Anwar and Yue Cheng},
- title={SDN helps Big Data to optimize Storage},
- journal={Book Chapter, Big Data and Software Defined Networks, Editor: Javid Taheri. IET, ISBN 978-1-78561-304-3.},
- year={2018},
- abbr={Book Chapter}
-}
-
-@INPROCEEDINGS{8622518,
-
- author={Cheng, Yue and Anwar, Ali and Duan, Xuejing},
-
- booktitle={2018 IEEE International Conference on Big Data (Big Data)},
-
- title={Analyzing Alibaba’s Co-located Datacenter Workloads},
-
- year={2018},
-
- volume={},
-
- number={},
-
- pages={292-297},
-
- doi={10.1109/BigData.2018.8622518},
- pdf={bigdata18-alibaba.pdf},
- abbr={BigData'18}
-}
-
-@INPROCEEDINGS{8665756,
-
- author={Anwar, Ali and Cheng, Yue and Huang, Hai and Han, Jingoo and Sim, Hyogi and Lee, Dongyoon and Douglis, Fred and Butt, Ali R.},
-
- booktitle={SC18: International Conference for High Performance Computing, Networking, Storage and Analysis},
-
- title={BESPOKV: Application Tailored Scale-Out Key-Value Stores},
-
- year={2018},
-
- volume={},
-
- number={},
-
- pages={14-29},
-
- doi={10.1109/SC.2018.00005},
- abbr={SC'18},
- pdf={sc18-bespokv.pdf},
- code={https://github.com/ds2-lab/bespokv}
-}
-
-@inproceedings{10.1145/3265723.3265742,
-author = {Cheng, Yue and Chai, Zheng and Anwar, Ali},
-title = {Characterizing Co-Located Datacenter Workloads: An Alibaba Case Study},
-year = {2018},
-isbn = {9781450360067},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/3265723.3265742},
-doi = {10.1145/3265723.3265742},
-booktitle = {Proceedings of the 9th Asia-Pacific Workshop on Systems},
-articleno = {12},
-numpages = {3},
-location = {Jeju Island, Republic of Korea},
-series = {APSys '18},
-abbr={ApSys'18},
-arxiv={https://arxiv.org/abs/1808.02919}
-}
-
-@inproceedings {210500,
-author = {Ali Anwar and Mohamed Mohamed and Vasily Tarasov and Michael Littley and Lukas Rupprecht and Yue Cheng and Nannan Zhao and Dimitrios Skourtis and Amit S. Warke and Heiko Ludwig and Dean Hildebrand and Ali R. Butt},
-title = {Improving Docker Registry Design Based on Production Workload Analysis},
-booktitle = {16th USENIX Conference on File and Storage Technologies (FAST 18)},
-year = {2018},
-isbn = {978-1-931971-42-3},
-address = {Oakland, CA},
-pages = {265--278},
-url = {https://www.usenix.org/conference/fast18/presentation/anwar},
-publisher = {USENIX Association},
-month = feb,
-abbr={USENIX FAST'18},
-talk={https://www.usenix.org/conference/fast18/presentation/anwar},
-selected={true},
-pdf={fast18-docker.pdf},
-code={https://github.com/ds2-lab/IBM-docker-registry-traces}
-}
-
-@INPROCEEDINGS{8425269,
-
- author={Zhao, Nannan and Anwar, Ali and Cheng, Yue and Salman, Mohammed and Li, Daping and Wan, Jiguang and Xie, Changsheng and He, Xubin and Wang, Feiyi and Butt, Ali},
-
- booktitle={2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)},
-
- title={Chameleon: An Adaptive Wear Balancer for Flash Clusters},
-
- year={2018},
-
- volume={},
-
- number={},
-
- pages={1163-1172},
-
- doi={10.1109/IPDPS.2018.00125},
- pdf={ipdps18-chameleon.pdf},
- abbr={IPDPS'18}
-}
-
-@article{yue_phd_dissertation,
-author = {Yue Cheng},
-title = {Workload-aware Efficient Storage Systems},
-year = {2017},
-html = {https://vtechworks.lib.vt.edu/handle/10919/78677},
-abbr = {Doctoral Dissertation}
-}
-
-@ARTICLE{7436639,
-
- author={Cheng, Yue and Iqbal, M. Safdar and Gupta, Aayush and Butt, Ali R.},
-
- journal={IEEE Internet Computing},
-
- title={Provider versus Tenant Pricing Games for Hybrid Object Stores in the Cloud},
-
- year={2016},
-
- volume={20},
-
- number={3},
-
- pages={28-35},
-
- doi={10.1109/MIC.2016.50},
- abbr={Internet Computing},
- html={https://ieeexplore.ieee.org/document/7436639}
-}
-
-
-@inproceedings {196241,
-author = {Yue Cheng and Fred Douglis and Philip Shilane and Grant Wallace and Peter Desnoyers and Kai Li},
-title = {Erasing {Belady{\textquoteright}s} Limitations: In Search of Flash Cache Offline Optimality},
-booktitle = {2016 USENIX Annual Technical Conference (USENIX ATC 16)},
-year = {2016},
-isbn = {978-1-931971-30-0},
-address = {Denver, CO},
-pages = {379--392},
-url = {https://www.usenix.org/conference/atc16/technical-sessions/presentation/cheng},
-publisher = {USENIX Association},
-month = jun,
-abbr={USENIX ATC'16},
-selected={true},
-pdf={atc16-paper-cheng.pdf},
-talk={https://www.usenix.org/conference/atc16/technical-sessions/presentation/cheng}
-}
-
-@inproceedings {196390,
-author = {Ali Anwar and Yue Cheng and Hai Huang and Ali R. Butt},
-title = {{ClusterOn}: Building Highly Configurable and Reusable Clustered Data Services Using Simple Data Nodes},
-booktitle = {8th USENIX Workshop on Hot Topics in Storage and File Systems (HotStorage 16)},
-year = {2016},
-address = {Denver, CO},
-url = {https://www.usenix.org/conference/hotstorage16/workshop-program/presentation/anwar},
-publisher = {USENIX Association},
-month = jun,
-abbr = {HotStorage'16},
-pdf={hotstorage16-clusteron.pdf},
-talk={https://www.usenix.org/conference/hotstorage16/workshop-program/presentation/anwar}
-}
-
-@inproceedings{10.1145/2907294.2907304,
-author = {Anwar, Ali and Cheng, Yue and Gupta, Aayush and Butt, Ali R.},
-title = {MOS: Workload-Aware Elasticity for Cloud Object Stores},
-year = {2016},
-isbn = {9781450343145},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/2907294.2907304},
-doi = {10.1145/2907294.2907304},
-abstract = {The use of cloud object stores has been growing rapidly in recent years as they combine key advantages such as HTTP-based RESTful APIs, high availability, elasticity with a "pay-as-you-go" pricing model that allows applications to scale as needed. The current practice is to either use a single set of configuration parameters or rely on statically configured storage policies for a cloud object store deployment, even when the store is used to support different types of applications with evolving requirements. This crucial mismatch between the different applications requirements and capabilities of the object store is problematic and should be addressed to achieve high efficiency and performance.In this paper, we propose MOS, a Micro Object Storage architecture, which supports independently configured microstores each tuned dynamically to the needs of a particular type of workload. We also design an enhancement, MOS++, that extends MOS's capabilities through fine-grained resource management to effectively meet the tenants' SLAs while maximizing resource efficiency. We have implemented a prototype of MOS ++ in OpenStack Swift using Docker containers. Our evaluation shows that MOS ++ can effectively support heterogeneous workloads across multiple tenants. Compared to default and statically configured object store setups, for a two-tenant setup, MOS++ improves the sustained access bandwidth by up to 79% for a large-object workload, while reducing the 95th percentile latency by up to 70.2% for a small-object workload.},
-booktitle = {Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing},
-pages = {177–188},
-numpages = {12},
-keywords = {performance analysis, object store, resource management and scheduling},
-location = {Kyoto, Japan},
-series = {HPDC '16},
-abbr = {HPDC'16},
-pdf = {hpdc16-mos.pdf}
-}
-
-@INPROCEEDINGS{7529984,
-
- author={Anwar, Ali and Cheng, Yue and Butt, Ali R.},
-
- booktitle={2016 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)},
-
- title={Towards Managing Variability in the Cloud},
-
- year={2016},
-
- volume={},
-
- number={},
-
- pages={1081-1084},
-
- doi={10.1109/IPDPSW.2016.62},
- pdf = {varsys16.pdf},
- abbr = {VarSys'16}
-}
-
-@inproceedings{10.1145/2834976.2834980,
-author = {Anwar, Ali and Cheng, Yue and Gupta, Aayush and Butt, Ali R.},
-title = {Taming the Cloud Object Storage with MOS},
-year = {2015},
-isbn = {9781450340083},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/2834976.2834980},
-doi = {10.1145/2834976.2834980},
-abstract = {Cloud object stores today are deployed using a single set of configuration parameters for all different types of applications. This homogeneous setup results in all applications experiencing the same service level (e.g., data transfer throughput, etc.). However, the vast variety of applications expose extremely different latency and throughput requirements. To this end, we propose MOS, a Micro Object Storage architecture with independently configured microstores each tuned dynamically for a particular type of workload. We then expose these microstores to the tenant who can then choose to place their data in the appropriate microstore according the latency and throughput requirements of their workloads. Our evaluation shows that compared with default setup, MOS can improve the performance up to 200% for small objects and 28% for large objects while providing opportunity of tradeoff between two.},
-booktitle = {Proceedings of the 10th Parallel Data Storage Workshop},
-pages = {7–12},
-numpages = {6},
-location = {Austin, Texas},
-series = {PDSW '15},
-pdf={pdsw15-mos.pdf},
-abbr={PDSW'15}
-}
-
-@inproceedings {190611,
-author = {Yue Cheng and M. Safdar Iqbal and Aayush Gupta and Ali R. Butt},
-title = {Pricing Games for Hybrid Object Stores in the Cloud: Provider vs. Tenant},
-booktitle = {7th USENIX Workshop on Hot Topics in Cloud Computing (HotCloud 15)},
-year = {2015},
-address = {Santa Clara, CA},
-url = {https://www.usenix.org/conference/hotcloud15/workshop-program/presentation/cheng},
-publisher = {USENIX Association},
-month = jul,
-abbr={HotCloud'15},
-pdf={hotcloud15-pricing.pdf},
-talk = {https://www.usenix.org/conference/hotcloud15/workshop-program/presentation/cheng}
-}
-
-@inproceedings{10.1145/2749246.2749252,
-author = {Cheng, Yue and Iqbal, M. Safdar and Gupta, Aayush and Butt, Ali R.},
-title = {CAST: Tiering Storage for Data Analytics in the Cloud},
-year = {2015},
-isbn = {9781450335508},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/2749246.2749252},
-doi = {10.1145/2749246.2749252},
-abstract = {Enterprises are increasingly moving their big data analytics to the cloud with the goal of reducing costs without sacrificing application performance. Cloud service providers offer their tenants a myriad of storage options, which while flexible, makes the choice of storage deployment non trivial. Crafting deployment scenarios to leverage these choices in a cost-effective manner - under the unique pricing models and multi-tenancy dynamics of the cloud environment - presents unique challenges in designing cloud-based data analytics frameworks.In this paper, we propose CAST, a Cloud Analytics Storage Tiering solution that cloud tenants can use to reduce monetary cost and improve performance of analytics workloads. The approach takes the first step towards providing storage tiering support for data analytics in the cloud. CAST performs offline workload profiling to construct job performance prediction models on different cloud storage services, and combines these models with workload specifications and high-level tenant goals to generate a cost-effective data placement and storage provisioning plan. Furthermore, we build CAST++ to enhance CAST's optimization model by incorporating data reuse patterns and across-jobs interdependencies common in realistic analytics workloads. Tests with production workload traces from Facebook and a 400-core Google Cloud based Hadoop cluster demonstrate that CAST++ achieves 1.21X performance and reduces deployment costs by 51.4% compared to local storage configuration.},
-booktitle = {Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing},
-pages = {45–56},
-numpages = {12},
-keywords = {cloud computing, mapreduce, storage tiering, big data analytics},
-location = {Portland, Oregon, USA},
-series = {HPDC '15},
-abbr = {HPDC'15},
-pdf={hpdc15-cast.pdf},
-talk = {http://www.hpdc.org/2015/program/slides/cheng.pdf}
-}
-
-@inproceedings{10.1145/2741948.2741967,
-author = {Cheng, Yue and Gupta, Aayush and Butt, Ali R.},
-title = {An In-Memory Object Caching Framework with Adaptive Load Balancing},
-year = {2015},
-isbn = {9781450332385},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/2741948.2741967},
-doi = {10.1145/2741948.2741967},
-abstract = {The extreme latency and throughput requirements of modern web applications are driving the use of distributed in-memory object caches such as Memcached. While extant caching systems scale-out seamlessly, their use in the cloud --- with its unique cost and multi-tenancy dynamics --- presents unique opportunities and design challenges.In this paper, we propose MBal, a high-performance in-memory object caching framework with adaptive Multiphase load Balancing, which supports not only horizontal (scale-out) but vertical (scale-up) scalability as well. MBal is able to make efficient use of available resources in the cloud through its fine-grained, partitioned, lockless design. This design also lends itself naturally to provide adaptive load balancing both within a server and across the cache cluster through an event-driven, multi-phased load balancer. While individual load balancing approaches are being lever-aged in in-memory caches, MBal goes beyond the extant systems and offers a holistic solution wherein the load balancing model tracks hotspots and applies different strategies based on imbalance severity -- key replication, server-local or cross-server coordinated data migration. Performance evaluation on an 8-core commodity server shows that compared to a state-of-the-art approach, MBal scales with number of cores and executes 2.3x and 12x more queries/second for GET and SET operations, respectively.},
-booktitle = {Proceedings of the Tenth European Conference on Computer Systems},
-articleno = {4},
-numpages = {16},
-location = {Bordeaux, France},
-series = {EuroSys '15},
-abbr={EuroSys'15},
-pdf={eurosys15-mbal.pdf},
-talk={https://www.youtube.com/watch?v=Ycw5334PCmI}
-}
-
-@inproceedings{10.1145/2523616.2525964,
-author = {Cheng, Yue and Gupta, Aayush and Povzner, Anna and Butt, Ali R.},
-title = {High Performance In-Memory Caching through Flexible Fine-Grained Services},
-year = {2013},
-isbn = {9781450324281},
-publisher = {Association for Computing Machinery},
-address = {New York, NY, USA},
-url = {https://doi.org/10.1145/2523616.2525964},
-doi = {10.1145/2523616.2525964},
-abstract = {In-memory object caches are extensively used in today's web installations [1, 6]. Most existing systems adopt monolithic storage models and engineer optimizations on specific workload characteristics [3, 6] or operations [4, 5]. Such optimizations are insufficient as large-scale cloud workloads typically exhibit both temporal and spatial shifts - requirements vary within the same deployment over time and different parts of the same workload demonstrate different access patterns. To this end, we propose a caching tier that supports differentiated services in multiple dimensions. Since there is no best "one-size-fits-all" solution for all workload requirements, we argue that a fine-grained modular design will provide both high performance and flexibility in supporting multiple services.},
-booktitle = {Proceedings of the 4th Annual Symposium on Cloud Computing},
-articleno = {56},
-numpages = {2},
-location = {Santa Clara, California},
-series = {SOCC '13},
-abbr={SoCC'13},
-pdf={socc13-cache.pdf},
-poster={socc13-poster.pdf}
-}
diff --git a/_config.yml b/_config.yml
deleted file mode 100644
index 35926c15..00000000
--- a/_config.yml
+++ /dev/null
@@ -1,327 +0,0 @@
-# -----------------------------------------------------------------------------
-# Site settings
-# -----------------------------------------------------------------------------
-
-title: Yue Cheng # the website title (if blank, full name will be used instead)
-first_name: Yue
-middle_name:
-last_name: Cheng
-email: mrz7dp@virginia.edu
-description: > # the ">" symbol means to ignore newlines until "footer_text:"
- Yue Cheng's academic webpage
-footer_text: >
- Powered by Jekyll with al-folio theme.
- Hosted by GitHub Pages.
-keywords: jekyll, jekyll-theme, academic-website, portfolio-website # add your own keywords or leave empty
-
-lang: en # the language of your site (for example: en, fr, cn, ru, etc.)
-icon: uva.ico # the emoji used as the favicon (alternatively, provide image name in /assets/img/)
-
-url: https://tddg.github.io # the base hostname & protocol for your site
-baseurl: # the subpath of your site, e.g. /blog/
-last_updated: 1 # set to true if you want to display last updated in the footer
-impressum_path: # set to path to include impressum link in the footer, use the same path as permalink in a page, helps to conform with EU GDPR
-
-# -----------------------------------------------------------------------------
-# Theme
-# -----------------------------------------------------------------------------
-
-# code highlighter theme
-highlight_theme_light: github # https://github.com/jwarby/jekyll-pygments-themes
-highlight_theme_dark: native # https://github.com/jwarby/jekyll-pygments-themes
-
-# repo color theme
-repo_theme_light: default # https://github.com/anuraghazra/github-readme-stats/blob/master/themes/README.md
-repo_theme_dark: dark # https://github.com/anuraghazra/github-readme-stats/blob/master/themes/README.md
-
-# -----------------------------------------------------------------------------
-# RSS Feed
-# -----------------------------------------------------------------------------
-# will use title and url fields
-# Take a look to https://github.com/jekyll/jekyll-feed for more customization
-
-rss_icon: false
-
-# -----------------------------------------------------------------------------
-# Layout
-# -----------------------------------------------------------------------------
-
-navbar_fixed: true
-footer_fixed: true
-
-# Dimensions
-max_width: 900px
-
-# TODO: add layout settings (single page vs. multi-page)
-
-# -----------------------------------------------------------------------------
-# Open Graph & Schema.org
-# -----------------------------------------------------------------------------
-# Display links to the page with a preview object on social media.
-serve_og_meta: false # Include Open Graph meta tags in the HTML head
-serve_schema_org: false # Include Schema.org in the HTML head
-og_image: # The site-wide (default for all links) Open Graph preview image
-
-# -----------------------------------------------------------------------------
-# Social integration
-# -----------------------------------------------------------------------------
-
-github_username: ds2-lab # your GitHub user name
-gitlab_username: # your GitLab user name
-twitter_username: yuecheng87 # your Twitter handle
-linkedin_username: # your LinkedIn user name
-scholar_userid: TMGwBH0AAAAJ # your Google Scholar ID
-orcid_id: # your ORCID ID
-medium_username: # your Medium username
-quora_username: # your Quora username
-publons_id: # your ID on Publons
-research_gate_profile: # your profile on ResearchGate
-blogger_url: # your blogger URL
-work_url: # work page URL
-keybase_username: # your keybase user name
-wikidata_id: # your wikidata id
-dblp_url: # your DBLP profile url
-stackoverflow_id: #your stackoverflow id
-
-contact_note: >
-
-# -----------------------------------------------------------------------------
-# Analytics and search engine verification
-# -----------------------------------------------------------------------------
-
-google_analytics: G-RGV4GWTENC # your Goole Analytics measurement ID (format: G-XXXXXXXXXX)
-panelbear_analytics: # panelbear analytics site ID (format: XXXXXXXXX)
-
-google_site_verification: # your google-site-verification ID (Google Search Console)
-bing_site_verification: # out your bing-site-verification ID (Bing Webmaster)
-
-# -----------------------------------------------------------------------------
-# Blog
-# -----------------------------------------------------------------------------
-
-blog_name: # blog_name will be displayed in your blog page
-blog_nav_title: # your blog must have a title for it to be displayed in the nav bar
-blog_description: a simple whitespace theme for academics
-permalink: /blog/:year/:title/
-
-# Pagination
-pagination:
- enabled: true
-
-# Comments
-disqus_shortname: al-folio # put your disqus shortname
-# https://help.disqus.com/en/articles/1717111-what-s-a-shortname
-
-# -----------------------------------------------------------------------------
-# Collections
-# -----------------------------------------------------------------------------
-
-collections:
- news:
- defaults:
- layout: post
- output: true
- permalink: /news/:path/
- projects:
- output: false
- permalink: /projects/:path/
- courses:
- output: true
- permalink: /courses/:path/
-
-news_scrollable: true # adds a vertical scroll bar if there are more than 3 news items
-news_limit: # leave blank to include all the news in the `_news` folder
-
-# -----------------------------------------------------------------------------
-# Jekyll settings
-# -----------------------------------------------------------------------------
-
-# Markdown and syntax highlight
-markdown: kramdown
-highlighter: rouge
-kramdown:
- input: GFM
- syntax_highlighter_opts:
- css_class: 'highlight'
- span:
- line_numbers: false
- block:
- line_numbers: false
- start_line: 1
-
-# Includes & excludes
-include: ['_pages']
-exclude:
- - bin
- - Gemfile
- - Gemfile.lock
- - vendor
-keep_files:
- - CNAME
- - .nojekyll
- - .git
-
-# Plug-ins
-plugins:
- - jekyll-archives
- - jekyll-diagrams
- - jekyll-email-protect
- - jekyll-feed
- - jekyll-imagemagick
- - jekyll-minifier
- - jekyll-paginate-v2
- - jekyll/scholar
- - jekyll-sitemap
- - jekyll-target-blank
- - jekyll-twitter-plugin
- - jemoji
-
-# Sitemap settings
-defaults:
- - scope:
- path: "assets/**/*.*"
- values:
- sitemap: false
-
-# -----------------------------------------------------------------------------
-# Jekyll Minifier
-# -----------------------------------------------------------------------------
-
-jekyll-minifier:
- exclude: ['robots.txt']
- uglifier_args:
- harmony: true
-
-# -----------------------------------------------------------------------------
-# Jekyll Archives
-# -----------------------------------------------------------------------------
-
-jekyll-archives:
- enabled: [year, tags, categories] # enables year, tag and category archives (remove if you need to disable one of them).
- layouts:
- year: archive-year
- tag: archive-tag
- category: archive-category
- permalinks:
- year: '/blog/:year/'
- tag: '/blog/tag/:name/'
- category: '/blog/category/:name/'
-
-display_tags: ['formatting', 'images', 'links', 'math', 'code'] # this tags will be dispalyed on the front page of your blog
-
-# -----------------------------------------------------------------------------
-# Jekyll Scholar
-# -----------------------------------------------------------------------------
-
-scholar:
-
- last_name: Cheng
- first_name: Yue
-
- style: apa
- locale: en
-
- source: /_bibliography/
- bibliography: papers.bib
- bibliography_template: bib
- # Note: if you have latex math in your bibtex, the latex filter
- # preprocessing may conflict with MathJAX if the latter is enabled.
- # See https://github.com/alshedivat/al-folio/issues/357.
- bibtex_filters: [latex, smallcaps, superscript]
-
- replace_strings: true
- join_strings: true
-
- details_dir: bibliography
- details_layout: bibtex.html
- details_link: Details
-
- query: "@*"
-
-# Filter out certain bibtex entry keywords used internally from the bib output
-filtered_bibtex_keywords: [abbr, abstract, arxiv, bibtex_show, html, pdf, selected, supp, blog, code, poster, slides, website, preview, talk, press, award]
-
-# Maximum number of authors to be shown, other authors will be visible on hover, leave blank to show all authors
-max_author_limit:
-
-# -----------------------------------------------------------------------------
-# Responsive WebP Images
-# -----------------------------------------------------------------------------
-
-imagemagick:
- enabled: true # enables responsive images for your site (recomended, see https://github.com/alshedivat/al-folio/issues/537)
- widths:
- - 480
- - 800
- - 1400
- input_directories:
- - assets/img/
- input_formats:
- - ".jpg"
- - ".jpeg"
- - ".png"
- - ".tiff"
- output_formats:
- webp: "-resize 800x"
-
-# -----------------------------------------------------------------------------
-# Jekyll Diagrams
-# -----------------------------------------------------------------------------
-
-jekyll-diagrams:
- # configuration, see https://github.com/zhustec/jekyll-diagrams.
- # feel free to comment out this section if not using jekyll diagrams.
-
-
-# -----------------------------------------------------------------------------
-# Optional Features
-# -----------------------------------------------------------------------------
-
-enable_google_analytics: true # enables google analytics
-enable_panelbear_analytics: false # enables panelbear analytics
-enable_statcounter_analytics: true # enables statcounter analytics
-enable_google_verification: false # enables google site verification
-enable_bing_verification: false # enables bing site verification
-enable_masonry: true # enables automatic project cards arangement
-enable_math: true # enables math typesetting (uses MathJax)
-enable_tooltips: false # enables automatic tooltip links generated
- # for each section titles on pages and posts
-enable_darkmode: true # enables switching between light/dark modes
-enable_navbar_social: true # enables displaying social links in the
- # navbar on the about page
-enable_project_categories: true # enables categorization of projects into
- # multiple categories
-enable_medium_zoom: true # enables image zoom feature (as on medium.com)
-
-
-# -----------------------------------------------------------------------------
-# Library versions
-# -----------------------------------------------------------------------------
-
-academicons:
- version: "1.9.1"
- integrity: "sha256-i1+4qU2G2860dGGIOJscdC30s9beBXjFfzjWLjBRsBg="
-bootstrap:
- version: "4.6.1"
- integrity:
- css: "sha256-DF7Zhf293AJxJNTmh5zhoYYIMs2oXitRfBjY+9L//AY="
- js: "sha256-fgLAgv7fyCGopR/gBNq2iW3ZKIdqIcyshnUULC4vex8="
-fontawesome:
- version: "5.15.4"
- integrity: "sha256-mUZM63G8m73Mcidfrv5E+Y61y7a12O5mW4ezU3bxqW4="
-jquery:
- version: "3.6.0"
- integrity: "sha256-/xUj+3OJU5yExlq6GSYGSHk7tPXikynS7ogEvDej/m4="
-mathjax:
- version: "3.2.0"
-masonry:
- version: "4.2.2"
- integrity: "sha256-Nn1q/fx0H7SNLZMQ5Hw5JLaTRZp0yILA/FRexe19VdI="
-mdb:
- version: "4.20.0"
- integrity:
- css: "sha256-jpjYvU3G3N6nrrBwXJoVEYI/0zw8htfFnhT9ljN3JJw="
- js: "sha256-NdbiivsvWt7VYCt6hYNT3h/th9vSTL4EDWeGs5SN3DA="
-medium_zoom:
- version: "1.0.6"
- integrity: "sha256-EdPgYcPk/IIrw7FYeuJQexva49pVRZNmt3LculEr7zM="
diff --git a/_courses/cs471_fall17.md b/_courses/cs471_fall17.md
deleted file mode 100644
index f375b523..00000000
--- a/_courses/cs471_fall17.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2017-08-20
-inline: true
-title: CS 471 Operating Systems
-university: George Mason University
-semester: Fall 2017
-category: gmu
----
diff --git a/_courses/cs471_fall19.md b/_courses/cs471_fall19.md
deleted file mode 100644
index 468e8963..00000000
--- a/_courses/cs471_fall19.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2019-08-20
-inline: true
-title: CS 471 Operating Systems
-university: George Mason University
-semester: Fall 2019
-category: gmu
-external_page: https://cs.gmu.edu/~yuecheng/teaching/cs471_fall19/index.html
----
diff --git a/_courses/cs471_spring19.md b/_courses/cs471_spring19.md
deleted file mode 100644
index f9049def..00000000
--- a/_courses/cs471_spring19.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2019-01-01
-inline: true
-title: CS 471 Operating Systems
-university: George Mason University
-semester: Spring 2019
-category: gmu
-external_page: https://cs.gmu.edu/~yuecheng/teaching/cs471_spring19/index.html
----
diff --git a/_courses/cs475_fall21.md b/_courses/cs475_fall21.md
deleted file mode 100644
index afb34094..00000000
--- a/_courses/cs475_fall21.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2021-08-20
-inline: true
-title: CS 475 Concurrent and Distributed Systems
-university: George Mason University
-semester: Fall 2021
-category: gmu
-external_page: https://tddg.github.io/cs475-fall21/
----
diff --git a/_courses/cs571_spring20.md b/_courses/cs571_spring20.md
deleted file mode 100644
index 7ffc048f..00000000
--- a/_courses/cs571_spring20.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2020-01-01
-inline: true
-title: CS 571 Operating Systems
-university: George Mason University
-semester: Spring 2020
-category: gmu
-external_page: https://tddg.github.io/cs571-spring20/
----
diff --git a/_courses/cs571_spring21.md b/_courses/cs571_spring21.md
deleted file mode 100644
index 8b86cf74..00000000
--- a/_courses/cs571_spring21.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2021-01-01
-inline: true
-title: CS 571 Operating Systems
-university: George Mason University
-semester: Spring 2021
-category: gmu
-external_page: https://tddg.github.io/cs571-spring21/
----
diff --git a/_courses/cs571_spring22.md b/_courses/cs571_spring22.md
deleted file mode 100644
index 336611ee..00000000
--- a/_courses/cs571_spring22.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2022-01-01
-inline: true
-title: CS 571 Operating Systems
-university: George Mason University
-semester: Spring 2022
-category: gmu
-external_page: https://tddg.github.io/cs571-spring22/
----
diff --git a/_courses/cs675_spring20.md b/_courses/cs675_spring20.md
deleted file mode 100644
index 2a1c979e..00000000
--- a/_courses/cs675_spring20.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2020-01-01
-inline: true
-title: CS 675 Distributed Systems
-university: George Mason University
-semester: Spring 2020
-category: gmu
-external_page: https://tddg.github.io/cs675-spring20/
----
diff --git a/_courses/cs795_fall18.md b/_courses/cs795_fall18.md
deleted file mode 100644
index 4d12d10f..00000000
--- a/_courses/cs795_fall18.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2018-08-20
-inline: true
-title: CS 795 Distributed Systems and Cloud Computing
-university: George Mason University
-semester: Fall 2018
-category: gmu
-external_page: https://cs.gmu.edu/~yuecheng/teaching/cs795_fall18/index.html
----
diff --git a/_courses/ds5110_cs5501_spring24.md b/_courses/ds5110_cs5501_spring24.md
deleted file mode 100644
index 8cc959b1..00000000
--- a/_courses/ds5110_cs5501_spring24.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2024-01-17
-inline: true
-title: DS5110/CS5501 Big Data Systems
-university: University of Virginia
-semester: Spring 2024
-category: uva
-external_page: https://tddg.github.io/ds5110-cs5501-spring24/
----
diff --git a/_courses/ds5110_spring23.md b/_courses/ds5110_spring23.md
deleted file mode 100644
index ef77139a..00000000
--- a/_courses/ds5110_spring23.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2023-01-18
-inline: true
-title: DS 5110 Big Data Systems
-university: University of Virginia
-semester: Spring 2023
-category: uva
-external_page: https://tddg.github.io/ds5110-spring23/
----
diff --git a/_data/coauthors.yml b/_data/coauthors.yml
deleted file mode 100644
index 8ed52124..00000000
--- a/_data/coauthors.yml
+++ /dev/null
@@ -1,34 +0,0 @@
-"Adams":
- - firstname: ["Edwin", "E.", "E. P.", "Edwin Plimpton"]
- url: https://en.wikipedia.org/wiki/Edwin_Plimpton_Adams
-
-"Podolsky":
- - firstname: ["Boris", "B.", "B. Y.", "Boris Yakovlevich"]
- url: https://en.wikipedia.org/wiki/Boris_Podolsky
-
-"Rosen":
- - firstname: ["Nathan", "N."]
- url: https://en.wikipedia.org/wiki/Nathan_Rosen
-
-"Bach":
- - firstname: ["Johann Sebastian", "J. S."]
- url: https://en.wikipedia.org/wiki/Johann_Sebastian_Bach
-
- - firstname: ["Carl Philipp Emanuel", "C. P. E."]
- url: https://en.wikipedia.org/wiki/Carl_Philipp_Emanuel_Bach
-
-"Przibram":
- - firstname: ["Karl"]
- url: https://link.springer.com/article/10.1007/s00016-019-00242-z
-
-"Schrödinger":
- - firstname: ["Erwin"]
- url: https://en.wikipedia.org/wiki/Erwin_Schr%C3%B6dinger
-
-"Lorentz":
- - firstname: ["Hendrik Antoon"]
- url: https://en.wikipedia.org/wiki/Hendrik_Lorentz
-
-"Planck":
- - firstname: ["Max"]
- url: https://en.wikipedia.org/wiki/Max_Planck
diff --git a/_data/cv.yml b/_data/cv.yml
deleted file mode 100644
index 5b115724..00000000
--- a/_data/cv.yml
+++ /dev/null
@@ -1,97 +0,0 @@
-- title: General Information
- type: map
- contents:
- - name: Full Name
- value: Albert Einstein
- - name: Date of Birth
- value: 14th March 1879
- - name: Languages
- value: English, German
-
-- title: Education
- type: time_table
- contents:
- - title: PhD
- institution: University of Zurich, Zurich, Switzerland
- year: 1905
- description:
- - Description 1.
- - Description 2.
- - title: Description 3.
- contents:
- - Sub-description 1.
- - Sub-description 2.
- - title: Federal teaching diploma
- institution: Eidgenössische Technische Hochschule, Zurich, Switzerland
- year: 1900
- description:
- - Description 1.
- - Description 2.
-
-- title: Experience
- type: time_table
- contents:
- - title: Professor of Theoretical Physics
- institution: Institute for Advanced Study, Princeton University
- year: 1933 - 1955
- description:
- - Description 1.
- - Description 2.
- - title: Description 3.
- contents:
- - Sub-description 1.
- - Sub-description 2.
- - title: Visiting Professor
- institution: California Institute of Technology, Pasadena, California, US
- year: 1933
- description:
- - Description 1.
- - Description 2.
-
- - title: Director
- institution: Kaiser Wilhelm Institute for Physics, Berlin, Germany.
- year: 1917-1933
-
- - title: Professor of Theoretical Physics
- institution: Karl-Ferdinand University, Prague, Czechoslovakia
- year: 1911 - 1917
- description:
-
- - title: Associate Professor of Theoretical Physics
- institution: University of Zurich, Zurich, Switzerland
- year: 1909 - 1911
-
-- title: Open Source Projects
- type: time_table
- contents:
- - title: al-folio
- year: 2015-now
- description: A beautiful, simple, clean, and responsive Jekyll theme for academics.
-
-- title: Honors and Awards
- type: time_table
- contents:
- - year: 1921
- items:
- - Nobel Prize in Physics
- - Matteucci Medal
- - year: 2029
- items:
- - Max Planck Medal
-
-- title: Academic Interests
- type: nested_list
- contents:
- - title: Topic 1.
- items:
- - Description 1.
- - Description 2.
- - title: Topic 2.
- items:
- - Description 1.
- - Description 2.
-
-- title: Other Interests
- type: list
- contents:
- - Hobbies: Hobby 1, Hobby 2, etc.
diff --git a/_data/repositories.yml b/_data/repositories.yml
deleted file mode 100644
index 5205c9f6..00000000
--- a/_data/repositories.yml
+++ /dev/null
@@ -1,12 +0,0 @@
-github_users:
- - torvalds
- - alshedivat
-
-github_repos:
- - alshedivat/al-folio
- - twbs/bootstrap
- - jekyll/jekyll
- - jquery/jquery
- - FortAwesome/Font-Awesome
- - jpswalsh/academicons
- - mathjax/MathJax
diff --git a/_includes/course.html b/_includes/course.html
deleted file mode 100644
index ff0cbfe1..00000000
--- a/_includes/course.html
+++ /dev/null
@@ -1,19 +0,0 @@
-
diff --git a/_news/announcement_1.md b/_news/announcement_1.md
deleted file mode 100644
index 396b8d8f..00000000
--- a/_news/announcement_1.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2021-04-26
-inline: true
----
-
-Congrats to Ao on FaaSNet accepted to USENIX ATC 2021!
diff --git a/_news/announcement_2.md b/_news/announcement_2.md
deleted file mode 100644
index ad97bf30..00000000
--- a/_news/announcement_2.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2021-06-22
-inline: true
----
-
-Congrats to Zheng on FedAT accepted to SC 2021!
diff --git a/_news/announcement_3.md b/_news/announcement_3.md
deleted file mode 100644
index c3b0634a..00000000
--- a/_news/announcement_3.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2021-08-13
-inline: true
----
-
-A collaborative FMSG grant funded by NSF (with Jia Liu @ Auburn). Thanks, NSF!
diff --git a/_news/announcement_4.md b/_news/announcement_4.md
deleted file mode 100644
index b3c90277..00000000
--- a/_news/announcement_4.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2021-08-27
-inline: true
----
-
-Congrats to Li and Haoliang on rKube accepted to SoCC 2021!
diff --git a/_news/announcement_6.md b/_news/announcement_6.md
deleted file mode 100644
index e669548b..00000000
--- a/_news/announcement_6.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2022-05-18
-inline: true
----
-
-This summer my students will intern at MSR (Ben Carver), ByteDance
-(Yuqi Fu, Jingyuan Zhang), and Argonne National Lab (Zhaoyuan Su)!
-Congrats!
diff --git a/_news/announcement_7.md b/_news/announcement_7.md
deleted file mode 100644
index 8e45c2eb..00000000
--- a/_news/announcement_7.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2022-06-14
-inline: true
----
-
-Congrats to Yuqi on his paper on serverless function scheduling
-accepted to SC 2022!
diff --git a/_news/ara.md b/_news/ara.md
deleted file mode 100644
index c262e690..00000000
--- a/_news/ara.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2020-10-30
-inline: true
----
-
-Excited to receive an Amazon Research Award with Liang Zhao from Emory!
diff --git a/_news/asplos23.md b/_news/asplos23.md
deleted file mode 100644
index 021b7fc7..00000000
--- a/_news/asplos23.md
+++ /dev/null
@@ -1,14 +0,0 @@
----
-layout: post
-date: 2023-04-28
-inline: true
----
-
-Congrats to Ben, Runzhou, and Jingyuan on the acceptance of [λFS](https://tddg.github.io/assets/pdf/asplos23-lambdafs-ae.pdf){:target="\_blank"}
-to [ASPLOS 2023](https://www.asplos-conference.org/asplos2023/){:target="\_blank"}!
-The acceptance of λFS at ASPLOS'23 marks yet another significant
-milestone of our serverless storage project series.
-Don't forget to check out our projects:
-**Episode I** - [InfiniCache](https://tddg.github.io/assets/pdf/fast20-infinicache.pdf){:target="\_blank"},
-**Episode II** - [InfiniStore](https://tddg.github.io/assets/pdf/vldb23-infinistore.pdf){:target="\_blank"},
-and our latest work, **Episode III** - [λFS](https://arxiv.org/abs/2306.11877){:target="\_blank"}.
diff --git a/_news/drbsd_workshop.md b/_news/drbsd_workshop.md
deleted file mode 100644
index 6ee51485..00000000
--- a/_news/drbsd_workshop.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2022-09-18
-inline: true
----
-
-Congrats to Zhaoyuan on his paper accepted to DRBSD-8 co-located with SC 2022!
diff --git a/_news/fast20.md b/_news/fast20.md
deleted file mode 100644
index 824c0396..00000000
--- a/_news/fast20.md
+++ /dev/null
@@ -1,15 +0,0 @@
----
-layout: post
-date: 2019-12-11
-inline: true
----
-
-Congrats to Ao, Jingyuan, and Xiaolong on InfiniCache getting
-accepted to USENIX FAST 2020! InfiniCache is a first-of-its-kind,
-cost-effective, object cache that is built atop ephemeral cloud
-funtions. InfiniCache is 31-96x cheaper than existing cloud cache
-services (e.g., AWS ElastiCache) while offering same or better
-performance. Fork InfiniCache on [GitHub](https://github.com/ds2-lab/infinicache){:target="\_blank"}.
-
-
-
diff --git a/_news/fast23.md b/_news/fast23.md
deleted file mode 100644
index 33993103..00000000
--- a/_news/fast23.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2022-12-09
-inline: true
----
-
-Congrats to Redwan, Ahmad, and Yuqi on their paper on deep learning I/O caching
-accepted to FAST 2023!
diff --git a/_news/hpdc20.md b/_news/hpdc20.md
deleted file mode 100644
index ac49cd59..00000000
--- a/_news/hpdc20.md
+++ /dev/null
@@ -1,11 +0,0 @@
----
-layout: post
-date: 2020-03-26
-inline: true
----
-
-
-Congrats to Zheng, Ahsan, and Syed on TiFL getting accepted to ACM HPDC 2020!
-
-
-
diff --git a/_news/hs24.md b/_news/hs24.md
deleted file mode 100644
index 946dc3bc..00000000
--- a/_news/hs24.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2023-10-28
-inline: true
----
-
-Serving as the general co-chair of [ACM HotStorage'24](https://www.hotstorage.org/2024/){:target="\_blank"}. Consider submitting your exciting early ideas!
diff --git a/_news/icdm20.md b/_news/icdm20.md
deleted file mode 100644
index abd411eb..00000000
--- a/_news/icdm20.md
+++ /dev/null
@@ -1,8 +0,0 @@
----
-layout: post
-date: 2020-08-21
-inline: true
----
-
-Congrats to Junxiang and Zheng on their paper getting accepted to IEEE ICDM 2020!
-
diff --git a/_news/joining_uva.md b/_news/joining_uva.md
deleted file mode 100644
index 1d9c4a46..00000000
--- a/_news/joining_uva.md
+++ /dev/null
@@ -1,8 +0,0 @@
----
-layout: post
-date: 2022-08-19
-inline: true
----
-
-In Fall '22, I am joining the School of Data Science and the
-Department of Computer Science at the University of Virginia.
diff --git a/_news/jyz_graduated.md b/_news/jyz_graduated.md
deleted file mode 100644
index 456d539d..00000000
--- a/_news/jyz_graduated.md
+++ /dev/null
@@ -1,10 +0,0 @@
----
-layout: post
-date: 2023-06-30
-inline: true
----
-
-🎓 My first Ph.D. student [Jingyuan Zhang](https://www.zhang.jingyuan.name/){:target="\_blank"}
-successfully defended his Ph.D. dissertation. Congratulations, Dr. Zhang!
-Jingyuan will be joining the cloud-native infrastructure team @
-ByteDance (San Jose, CA).
diff --git a/_news/llm_survey24.md b/_news/llm_survey24.md
deleted file mode 100644
index 50018abb..00000000
--- a/_news/llm_survey24.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2024-01-02
-inline: true
----
-
-Check our [latest survey on resource-efficient LLMs](https://arxiv.org/abs/2401.00625){:target="\_blank"}.
diff --git a/_news/meta_award.md b/_news/meta_award.md
deleted file mode 100644
index b13d7875..00000000
--- a/_news/meta_award.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2022-09-12
-inline: true
----
-
-:trophy: Excited to receive a Meta Research Award for AI System Hardware/Software Codesign. Thanks, Meta Research!
diff --git a/_news/nsf_oac_mri.md b/_news/nsf_oac_mri.md
deleted file mode 100644
index 71ead9c5..00000000
--- a/_news/nsf_oac_mri.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2020-07-17
-inline: true
----
-
-Two projects got funded by NSF. With the new MRI grant, we will be building a new HPC infrastructure to support the growing computing needs for Mason users. With an OAC grant, we will be building a new model parallel deep learning training infrastructure. Thanks NSF!
-
-
diff --git a/_news/old_news_1.md b/_news/old_news_1.md
deleted file mode 100644
index b05de297..00000000
--- a/_news/old_news_1.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2021-03-05
-inline: true
----
-
-Honored to receive a gift from Adobe Research for our work on serverless computing! Thanks, Adobe!
diff --git a/_news/old_news_2.md b/_news/old_news_2.md
deleted file mode 100644
index ec692e36..00000000
--- a/_news/old_news_2.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2021-02-14
-inline: true
----
-
-Thrilled to receive an NSF CAREER Award for my work on building serverless cloud storage infrastructure. Thanks, NSF!
diff --git a/_news/outstanding_teacher.md b/_news/outstanding_teacher.md
deleted file mode 100644
index c6e75f89..00000000
--- a/_news/outstanding_teacher.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2022-05-02
-inline: true
----
-
-🏆 Thrilled to receive an Outstanding Teaching Award from CS @ Mason!
diff --git a/_news/samsung_gro.md b/_news/samsung_gro.md
deleted file mode 100644
index b9ca0391..00000000
--- a/_news/samsung_gro.md
+++ /dev/null
@@ -1,7 +0,0 @@
----
-layout: post
-date: 2023-10-30
-inline: true
----
-
-:trophy: Excited to receive a [Samsung GRO 2023 Award](https://www.sait.samsung.co.kr/saithome/about/collabo_recipients.do){:target="\_blank"} on **New Storage for Large ML Training** (w/ Ali Anwar from UMN). Thanks, Samsung Advanced Institute of Technology and [Samsung Memory Solutions Lab](https://samsungmsl.com/){:target="\_blank"}, for the generous support on our research!
diff --git a/_news/sfs_best_paper_finalist.md b/_news/sfs_best_paper_finalist.md
deleted file mode 100644
index 61720537..00000000
--- a/_news/sfs_best_paper_finalist.md
+++ /dev/null
@@ -1,8 +0,0 @@
----
-layout: post
-date: 2022-07-13
-inline: true
----
-
-:medal_sports: SFS is nominated as a Best Student Paper Award Finalist at SC 2022!
-Congrats to Yuqi!
diff --git a/_news/socc20.md b/_news/socc20.md
deleted file mode 100644
index 59bccb2a..00000000
--- a/_news/socc20.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2020-08-08
-inline: true
----
-
-Congrats to Ben, Jingyuan, and Ao on Wukong getting accepted by ACM SoCC 2020! Wukong is a super-fast serverless parallel computing framework built atop AWS Lambda. Wukong achieves up to 68X speedup over state-of-the-art serverless parallel processing frameworks. Wukong project is online. We are happy to accept contributions!
-
-
diff --git a/_news/tchpc_career_award.md b/_news/tchpc_career_award.md
deleted file mode 100644
index 6be4bbef..00000000
--- a/_news/tchpc_career_award.md
+++ /dev/null
@@ -1,8 +0,0 @@
----
-layout: post
-date: 2022-09-25
-inline: true
----
-
-:trophy: I am honored to be selected for
-the 2022 IEEE CS TCHPC Early Career Researchers Award for Excellence in High Performance Computing.
diff --git a/_news/vldb23.md b/_news/vldb23.md
deleted file mode 100644
index ef1adf78..00000000
--- a/_news/vldb23.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2023-02-16
-inline: true
----
-
-Congrats to Jingyuan, Ben, and the team on the acceptance of InfiniStore
-to
-VLDB 2023!
diff --git a/_news/vldb24_aca.md b/_news/vldb24_aca.md
deleted file mode 100644
index 6b4aa5f9..00000000
--- a/_news/vldb24_aca.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: post
-date: 2024-02-14
-inline: true
----
-
-Congrats to Rui on [his work](https://www.vldb.org/pvldb/vol17/p780-yang.pdf){:target="\_blank"} accepted to [VLDB 2024](https://vldb.org/2024/){:target="\_blank"}!
-In this work, Rui systematically studied the algorithmic complexity
-vulnerabilities of dynamic learned indexes.
diff --git a/_news/vldb24_ptm.md b/_news/vldb24_ptm.md
deleted file mode 100644
index 6e6be17e..00000000
--- a/_news/vldb24_ptm.md
+++ /dev/null
@@ -1,11 +0,0 @@
----
-layout: post
-date: 2024-03-15
-inline: true
----
-
-Congrats to Zhaoyuan and Zirui on [their work](https://arxiv.org/abs/2402.13429){:target="\_blank"} accepted to [VLDB 2024](https://vldb.org/2024/){:target="\_blank"}!
-In this work, Zhaoyuan analyzed a large dataset of real-world
-pre-trained ML models collected from Hugging Face. Based on the
-analysis study, he designed a new storage compression method for
-reducing the storage requirement of pre-trained models at scale.
diff --git a/_pages/TenureMaterial.md b/_pages/TenureMaterial.md
deleted file mode 100644
index 0ca29f81..00000000
--- a/_pages/TenureMaterial.md
+++ /dev/null
@@ -1,108 +0,0 @@
----
-layout: page
-title: "Yue Cheng: Tenure Application Documents"
-permalink: /TenureMaterial/
-nav: false
-nav_order: 7
----
-
-
-# Statements and Vita
-
-* [Research Scholarship Statement](https://tddg.github.io/assets/pdf/tenure/YueCheng_Research_Scholarship_Statement.pdf){:target="\_blank"}
-
-* [Teaching Statement](https://tddg.github.io/assets/pdf/tenure/YueCheng_Teaching_Statement.pdf){:target="\_blank"}
-* [Service Statement](https://tddg.github.io/assets/pdf/tenure/YueCheng_Service_Statement.pdf){:target="\_blank"}
-* [Examples of Collaboration Statement](https://tddg.github.io/assets/pdf/tenure/YueCheng_Collaboration_Statement.pdf){:target="\_blank"}
-* [Curriculum Vitae](https://tddg.github.io/assets/pdf/tenure/YueCheng_CV.pdf){:target="\_blank"}
-
-
-# Supporting Materials
-
-## Evidentiary Materials for Research, Scholarship
-
-* Selected recent publications ([Complete list of publications](https://tddg.github.io/publication/){:target="\_blank"})
- - [SFS: Smart OS Scheduling for Serverless Functions](https://arxiv.org/abs/2209.01709){:target="\_blank"}
- Yuqi Fu, Li Liu, Haoliang Wang, Yue Cheng, Songqing Chen
- The International Conference for High Performance Computing, Networking, Storage and Analysis 2022 (SC'22)
- :medal_sports: Best Student Paper Award Finalist
-
- - [FaaSNet: Scalable and Fast Provisioning of Custom Serverless Container Runtimes at Alibaba Cloud Function Compute](https://tddg.github.io/assets/pdf/atc21-faasnet.pdf){:target="\_blank"}
- Ao Wang, Shuai Chang, Huangshi Tian, Hongqi Wang, Haoran Yang, Huiba Li, Rui Du, Yue Cheng
- USENIX Annual Technical Conference 2021 (USENIX ATC'21) [Acceptance rate = 18.8%]
-
- - [FedAT: A High-Performance and Communication-Efficient Federated Learning System with Asynchronous Tiers](https://tddg.github.io/assets/pdf/sc21-fedat.pdf){:target="\_blank"}
- Zheng Chai, Yujing Chen, Ali Anwar, Liang Zhao, Yue Cheng, Huzefa Rangwala
- The International Conference for High Performance Computing, Networking, Storage, and Analysis (SC'21) [Acceptance rate = 23.6%]
-
- - [Wukong: A Scalable and Locality-Enhanced Framework for Serverless Parallel Computing](https://tddg.github.io/assets/pdf/socc20-wukong.pdf){:target="\_blank"}
- Benjamin Carver, Jingyuan Zhang, Ao Wang, Ali Anwar, Panruo Wu, Yue Cheng
- ACM Symposium on Cloud Computing 2020 (ACM SoCC'20) [Acceptance rate = 24.5%]
-
- - [TiFL: A Tier-based Federated Learning System](https://tddg.github.io/assets/pdf/hpdc20-tifl.pdf){:target="\_blank"}
- Zheng Chai, Ahsan Ali, Syed Zawad, Stacey Truex, Ali Anwar, Nathalie Baracaldo, Yi Zhou, Heiko Ludwig, Feng Yan, Yue Cheng
- ACM Symposium on High-Performance Parallel and Distributed Computing 2020 (ACM HPDC'20) [Acceptance rate = 22.5%]
-
- - [InfiniCache: Exploiting Ephemeral Serverless Functions to Build a Cost-Effective Memory Cache](https://tddg.github.io/assets/pdf/fast20-infinicache.pdf){:target="\_blank"}
- Ao Wang, Jingyuan Zhang, Xiaolong Ma, Ali Anwar, Lukas Rupprecht, Dimitrios Skourtis, Vasily Tarasov, Feng Yan, Yue Cheng
- USENIX Conference on File and Storage Techniques 2020 (USENIX FAST'20) [Acceptance rate = 16.7%]
-
- - [BESPOKV: Application Tailored Scale-Out Key-Value Stores](https://tddg.github.io/assets/pdf/sc18-bespokv.pdf){:target="\_blank"}
- Ali Anwar, Yue Cheng, Hai Huang, Jingoo Han, Hyogi Sim, Dongyoon Lee, Fred Douglis, Ali R. Butt
- The International Conference for High Performance Computing, Networking, Storage, and Analysis (SC'18) [Acceptance rate = 23.6%]
-
- - [Improving Docker Registry Design based on Production Workload Analysis](https://tddg.github.io/assets/pdf/fast18-docker.pdf){:target="\_blank"}
- Ali Anwar, Mohamed Mohamed, Vasily Tarasov, Michael Littley, Lukas Rupprecht, Yue Cheng, Nannan Zhao, Dimitrios Skourtis, Amit S. Warke, Heiko Ludwig, Dean Hildebrand, Ali R. Butt
- USENIX Conference on File and Storage Techniques 2018 (USENIX FAST'18) [Acceptance rate = 16.4%]
-
- - [Erasing Belady's Limitations: In Search of Flash Cache Offline Optimality](https://tddg.github.io/assets/pdf/atc16-paper-cheng.pdf){:target="\_blank"}
- Yue Cheng, Fred Douglis, Philip Shilane, Michael Trachtman, Grant Wallace, Peter Desnoyers, Kai Li
- USENIX Annual Technical Conference 2016 (USENIX ATC'16) [Acceptance rate = 17.7%]
-
-* Relevant research products
-
- - Smart Function Scheduler (SFS): [project](https://github.com/ds2-lab/SFS){:target="\_blank"}
-
- - InfiniCache: [project](https://ds2-lab.github.io/infinicache/){:target="\_blank"}
-
- - Wukong: [project](https://github.com/ds2-lab/Wukong){:target="\_blank"}
-
- - FaaSNet: [project and datasets](https://github.com/ds2-lab/FaaSNet){:target="\_blank"}
-
- - Docker registry workload datasets: [dataset](http://iotta.snia.org/traces/static){:target="\_blank"}
-
-* [Google Scholar Profile (publications sorted by citations)](https://scholar.google.com/citations?user=TMGwBH0AAAAJ&hl=en){:target="\_blank"}
-* [Google Scholar Profile (publications in reverse chronological order)](https://scholar.google.com/citations?hl=en&user=TMGwBH0AAAAJ&view_op=list_works&sortby=pubdate){:target="\_blank"}
-
-
-
-## Evidentiary Materials for Teaching Effectiveness
-
-* [Student course evaluation summaries](https://tddg.github.io/assets/pdf/tenure/YueCheng_Course_Evaluation_Summary.pdf){:target="\_blank"}
-
-* Curriculum development and course syllabi
- - CS 795: Distributed Systems & Cloud Computing [[Fall'18]](https://cs.gmu.edu/~yuecheng/teaching/cs795_fall18/index.html){:target="\_blank"}
- - CS 675: Distributed Systems [[Spring'20]](https://tddg.github.io/cs675-spring20/){:target="\_blank"}
- - CS 571: Operating Systems [[Spring'22]](https://tddg.github.io/cs571-spring22/){:target="\_blank"} [[Spring'21]](https://tddg.github.io/cs571-spring21/){:target="\_blank"} [[Spring'20]](https://tddg.github.io/cs571-spring20/){:target="\_blank"}
- - CS 475: Concurrent and Distributed Systems [[Fall'21]](https://tddg.github.io/cs475-fall21/){:target="\_blank"}
- - CS 471: Operating Systems [[Fall'19]](https://cs.gmu.edu/~yuecheng/teaching/cs471_fall19/){:target="\_blank"} [[Spring'19]](https://cs.gmu.edu/~yuecheng/teaching/cs471_spring19/){:target="\_blank"} [[Fall'17]](https://cs.gmu.edu/~yuecheng/teaching/cs471_fall17/){:target="\_blank"}
-
-
-* Course evaluation (**Note that prior to Fall 2020, all GMU teaching evaluation reports were in archived paper format; since Spring 2021, all teaching evaluation forms are in E form.**)
- - CS 571: Operating Systems [Spring'22]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-571-001-S22.pdf){:target="\_blank"}
- - CS 475: Concurrent and Distributed Systems [Fall'21]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-475-001-F21.pdf){:target="\_blank"}
- - CS 571: Operating Systems [Spring'21]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-571-DL1-S21.pdf){:target="\_blank"}
- - CS 571: Operating Systems [Spring'20]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-571-S20-Informal.pdf){:target="\_blank"} [**formal course evaluation cancelled university-wide due to COVID**]
- - CS 675: Distributed Systems [Spring'20]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-675-S20-Informal.pdf){:target="\_blank"} [**formal course evaluation cancelled university-wide due to COVID**]
- - CS 471: Operating Systems [Fall'19]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-471-F19.pdf){:target="\_blank"}
- - CS 471: Operating Systems [Spring'19]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-471-S19.pdf){:target="\_blank"}
- - CS 795: Cloud Computing [Fall'18]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-795-F18.pdf){:target="\_blank"}
- - CS 471: Operating Systems [Fall'17]: [evaluation form](https://tddg.github.io/assets/pdf/tenure/CS-471-F17.pdf){:target="\_blank"}
-
-
-
-
-* [List of students advised](https://tddg.github.io/assets/pdf/tenure/YueCheng_Student_Advising.pdf){:target="\_blank"}
-
-
-
diff --git a/_pages/about.md b/_pages/about.md
deleted file mode 100644
index b09a990e..00000000
--- a/_pages/about.md
+++ /dev/null
@@ -1,84 +0,0 @@
----
-layout: about
-title: about
-permalink: /
-subtitle: Associate Professor at the University of Virginia
-
-profile:
- align: right
- image: YueCheng.png
- image_cicular:
- address: >
-
-
-news: 2
-selected_papers: true # includes a list of papers marked as "selected={true}"
-social: true # includes social icons at the bottom of the page
----
-
-I am an Associate Professor of [Data Science](https://datascience.virginia.edu/){:target="\_blank"}
-and [Computer Science](https://engineering.virginia.edu/departments/computer-science){:target="\_blank"} at
-the [University of Virginia](https://www.virginia.edu/){:target="\_blank"}.
-My research covers a range of topics including distributed systems,
-serverless and cloud computing, storage systems, operating systems,
-and high-performance computing.
-My current research focuses on designing scalable, high-performance, and
-easy-to-use computer **systems** that manage and process huge volume of
-**data**.
-
-Currently I am working on:
-(1) **Serverless and FaaS:** improving serverless computing using a
-end-to-end approach that cuts across the entire software-hardware
-stack: *(stateful) applications, middleware, platforms, and
-lower-level OS/HW*;
-(2) **Sys4ML:** building better (computing and storage) systems for
-(distributed) ML applications;
-and (3) **ML4Sys:** improving systems software and infrastructure
-management by using learned or data-driven approaches.
-
-I am the recipient of an
-[NSF CAREER Award](https://www.nsf.gov/awardsearch/showAward?AWD_ID=2045680&HistoricalAwards=false){:target="\_blank"} (2021),
-an Amazon Research Award (2021),
-a [Meta Research Award](https://research.facebook.com/blog/2022/9/announcing-the-winners-of-the-2022-ai-system-hardwaresoftware-codesign-request-for-proposals/?locale=en_US&draft=1284382378973290){:target="\_blank"} (2022),
-[the IEEE CS TCHPC Early Career Researchers Award for Excellence
-in HPC](https://tc.computer.org/tchpc/2022/10/06/2022-ieee-cs-tchpc-award-winners/){:target="\_blank"} (2022),
-and a [Samsung GRO 2023 Award](https://www.sait.samsung.co.kr/saithome/about/collabo_recipients.do){:target="\_blank"} (2023).
-Prior to joining UVA, I was an Assistant Professor of
-[Computer Science](https://cs.gmu.edu/){:target="\_blank"} at
-[George Mason University](https://www.gmu.edu/){:target="\_blank"}, from 2017 to 2022.
-I received my Ph.D. degree in [Computer Science](https://cs.vt.edu/){:target="\_blank"} from
-[Virginia Tech](https://vt.edu/){:target="\_blank"}, working with Dr.
-[Ali R. Butt](https://people.cs.vt.edu/butta/){:target="\_blank"}.
-During my Ph.D. I spent two summers at IBM Research Almaden in 2013
-and 2014, and six months at Dell EMC Princeton Office in 2015.
-
-
-## selected projects
-
-Most of my projects are open-source and available on our group's [GitHub page](https://github.com/ds2-lab){:target="\_blank"}.
-
-
-* **InfiniStore:** Storing large and small objects on a dynamic fleet of serverless functions with only 3% of ElastiCache's cost but without sacrificing performance and availability.
- [[ASPLOS'23](https://tddg.github.io/assets/pdf/asplos23-lambdafs-ae.pdf){:target="\_blank"}]: [[GitHub](https://github.com/ds2-lab/LambdaFS){:target="\_blank"}] --
- [[VLDB'23](https://tddg.github.io/assets/pdf/vldb23-infinistore.pdf){:target="\_blank"}]: [[GitHub](https://github.com/ds2-lab/infinistore){:target="\_blank"}] --
- [[FAST'20](https://www.usenix.org/conference/fast20/presentation/wang-ao){:target="\_blank"}]: [[GitHub](https://github.com/ds2-lab/infinicache){:target="\_blank"}]
-
-* **Wukong:** Scaling out Python parallel programs (e.g., Dask applications) on FaaS without worrying about tedious cluster management. Wukong uses a new decentralized scheduling technique, which decentralizes resource orchestration to each individual serverless function, thereby enabling high elasticity and high scalability.
- [[SoCC'20](https://tddg.github.io/assets/pdf/socc20-wukong.pdf){:target="\_blank"}]
- [[PDSW'19](https://arxiv.org/abs/1910.05896){:target="\_blank"}]: [[GitHub](https://github.com/ds2-lab/Wukong){:target="\_blank"}]
-
-* **FaaSNet:** A highly scalable container provisioning framework that can provision thousands of 10+GB serverless function containers with just a few seconds. FaaSNet is currently deployed at [Alibaba Function Compute](https://www.alibabacloud.com/product/function-compute){:target="\_blank"}.
- [[ATC'21](https://www.usenix.org/conference/atc21/presentation/wang-ao){:target="\_blank"}]: [[GitHub](https://github.com/ds2-lab/FaaSNet){:target="\_target"}] [[Alibaba Cloud Blog](https://www.alibabacloud.com/blog/597937){:target="\_blank"}]
-
-* **SFS:** Linux CFS is not ideal for short-lived serverless function workloads. SFS instead optimizes the turnaround time for transient function jobs.
- [[SC'22](https://arxiv.org/abs/2209.01709){:target="\_blank"}]: [[GitHub](https://github.com/ds2-lab/SFS){:target="\_blank"}]
-
-* **SHADE:** A common practice in deep learning training is to randomly shuffle all training samples epoch by epoch. With SHADE, you can cache the most important training samples without losing training quality.
- [[FAST'23](https://www.usenix.org/conference/fast23/presentation/khan)]: [[GitHub](https://github.com/R-I-S-Khan/SHADE){:target="\_blank"}]
-
-* **DIGEST:** Scaling GNN training using a disaggregated storage.
- [[arXiv](https://arxiv.org/abs/2206.00057){:target="\_blank"}]: [[code](#)]
-
-
diff --git a/_pages/cv.md b/_pages/cv.md
deleted file mode 100644
index 1bcc3814..00000000
--- a/_pages/cv.md
+++ /dev/null
@@ -1,9 +0,0 @@
----
-layout: page
-title: CV
-permalink: /cv/
-nav: true
-nav_order: 4
----
-
-You can find my CV [here](/assets/pdf/YueCheng_CV.pdf){:target="\_blank"}.
diff --git a/_pages/ds2lab.md b/_pages/ds2lab.md
deleted file mode 100644
index ccd3ca7a..00000000
--- a/_pages/ds2lab.md
+++ /dev/null
@@ -1,12 +0,0 @@
----
-layout: post
-title: DS2 Lab
-permalink: /ds2lab/
-nav: true
-nav_order: 5
----
-
-
-
-
-[DS2 Lab](https://ds2-lab.github.io/){:target="\_blank"}
diff --git a/_pages/publication.md b/_pages/publication.md
deleted file mode 100644
index 6ff9b3a5..00000000
--- a/_pages/publication.md
+++ /dev/null
@@ -1,18 +0,0 @@
----
-layout: page
-permalink: /publication/
-title: publication
-description: publication by categories in reversed chronological order. generated by jekyll-scholar.
-years: [2024, 2023, 2022, 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2013]
-nav: true
-nav_order: 1
----
-
-
diff --git a/_pages/research.md b/_pages/research.md
deleted file mode 100644
index dce1acc8..00000000
--- a/_pages/research.md
+++ /dev/null
@@ -1,64 +0,0 @@
----
-layout: page
-title: research
-permalink: /research/
-nav: true
-nav_order: 2
-horizontal: false
----
-
-I direct the DS2 Research Lab.
-The mission of the DS2 Lab is to
-enable efficient and flexible (i.e., ease-of-use,
-ease-of-programming, and ease-of-deployment) systems for the growing
-data demands of modern applications running on existing as well as
-emerging computing platforms such as serverless platforms.
-
-My research is driven by the complexities of modern
-computing-intensive and data-intensive systems, and the need for more efficient
-and more easy-to-use approaches to manage such complexities. You can visit
-the DS2 Lab website using the
-button below for more information.
-
-
-
-
-
-`, false);
-
- class FootnoteList extends T$6(HTMLElement) {
-
- connectedCallback() {
- super.connectedCallback();
-
- this.list = this.root.querySelector('ol');
- // footnotes list is initially hidden
- this.root.style.display = 'none';
- // look through document and register existing footnotes
- // Store.subscribeTo('footnotes', (footnote) => {
- // this.renderFootnote(footnote);
- // });
- }
-
- // TODO: could optimize this to accept individual footnotes?
- set footnotes(footnotes) {
- this.list.innerHTML = '';
- if (footnotes.length) {
- // ensure footnote list is visible
- this.root.style.display = '';
-
- for (const footnote of footnotes) {
- // construct and append list item to show footnote
- const listItem = document.createElement('li');
- listItem.id = footnote.id + '-listing';
- listItem.innerHTML = footnote.innerHTML;
-
- const backlink = document.createElement('a');
- backlink.setAttribute('class', 'footnote-backlink');
- backlink.textContent = '[↩]';
- backlink.href = '#' + footnote.id;
-
- listItem.appendChild(backlink);
- this.list.appendChild(listItem);
- }
- } else {
- // ensure footnote list is invisible
- this.root.style.display = 'none';
- }
- }
-
- }
-
- // Copyright 2018 The Distill Template Authors
-
- const T$7 = Template('d-hover-box', `
-
-
-
-
-
-
-
-`);
-
- class HoverBox extends T$7(HTMLElement) {
-
- constructor() {
- super();
- }
-
- connectedCallback() {
-
- }
-
- listen(element) {
- // console.log(element)
- this.bindDivEvents(this);
- this.bindTriggerEvents(element);
- // this.style.display = "block";
- }
-
- bindDivEvents(element) {
- // For mice, same behavior as hovering on links
- element.addEventListener('mouseover', () => {
- if (!this.visible) this.showAtNode(element);
- this.stopTimeout();
- });
- element.addEventListener('mouseout', () => {
- this.extendTimeout(500);
- });
- // Don't trigger body touchstart event when touching within box
- element.addEventListener('touchstart', (event) => {
- event.stopPropagation();
- }, {passive: true});
- // Close box when touching outside box
- document.body.addEventListener('touchstart', () => {
- this.hide();
- }, {passive: true});
- }
-
- bindTriggerEvents(node) {
- node.addEventListener('mouseover', () => {
- if (!this.visible) {
- this.showAtNode(node);
- }
- this.stopTimeout();
- });
-
- node.addEventListener('mouseout', () => {
- this.extendTimeout(300);
- });
-
- node.addEventListener('touchstart', (event) => {
- if (this.visible) {
- this.hide();
- } else {
- this.showAtNode(node);
- }
- // Don't trigger body touchstart event when touching link
- event.stopPropagation();
- }, {passive: true});
- }
-
- show(position) {
- this.visible = true;
- this.style.display = 'block';
- // 10px extra offset from element
- this.style.top = Math.round(position[1] + 10) + 'px';
- }
-
- showAtNode(node) {
- // https://developer.mozilla.org/en-US/docs/Web/API/HTMLElement/offsetTop
- const bbox = node.getBoundingClientRect();
- this.show([node.offsetLeft + bbox.width, node.offsetTop + bbox.height]);
- }
-
- hide() {
- this.visible = false;
- this.style.display = 'none';
- this.stopTimeout();
- }
-
- stopTimeout() {
- if (this.timeout) {
- clearTimeout(this.timeout);
- }
- }
-
- extendTimeout(time) {
- this.stopTimeout();
- this.timeout = setTimeout(() => {
- this.hide();
- }, time);
- }
-
- }
-
- // Copyright 2018 The Distill Template Authors
- //
- // Licensed under the Apache License, Version 2.0 (the "License");
- // you may not use this file except in compliance with the License.
- // You may obtain a copy of the License at
- //
- // http://www.apache.org/licenses/LICENSE-2.0
- //
- // Unless required by applicable law or agreed to in writing, software
- // distributed under the License is distributed on an "AS IS" BASIS,
- // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- // See the License for the specific language governing permissions and
- // limitations under the License.
-
- class Title extends HTMLElement {
- static get is() { return 'd-title'; }
- }
-
- // Copyright 2018 The Distill Template Authors
-
- const T$8 = Template('d-references', `
-
-`, false);
-
- class References extends T$8(HTMLElement) {
-
- }
-
- // Copyright 2018 The Distill Template Authors
- //
- // Licensed under the Apache License, Version 2.0 (the "License");
- // you may not use this file except in compliance with the License.
- // You may obtain a copy of the License at
- //
- // http://www.apache.org/licenses/LICENSE-2.0
- //
- // Unless required by applicable law or agreed to in writing, software
- // distributed under the License is distributed on an "AS IS" BASIS,
- // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- // See the License for the specific language governing permissions and
- // limitations under the License.
-
- class TOC extends HTMLElement {
-
- static get is() { return 'd-toc'; }
-
- connectedCallback() {
- if (!this.getAttribute('prerendered')) {
- window.onload = () => {
- const article = document.querySelector('d-article');
- const headings = article.querySelectorAll('h2, h3');
- renderTOC(this, headings);
- };
- }
- }
-
- }
-
- function renderTOC(element, headings) {
-
- let ToC =`
-
-
-
Table of contents
-
`;
-
- for (const el of headings) {
- // should element be included in TOC?
- const isInTitle = el.parentElement.tagName == 'D-TITLE';
- const isException = el.getAttribute('no-toc');
- if (isInTitle || isException) continue;
- // create TOC entry
- const title = el.textContent;
- const link = '#' + el.getAttribute('id');
-
- let newLine = '
-`;
-
- // Copyright 2018 The Distill Template Authors
-
- const T$b = Template('distill-header', headerTemplate, false);
-
- class DistillHeader extends T$b(HTMLElement) {
-
- }
-
- // Copyright 2018 The Distill Template Authors
-
- const styles$2 = `
-
-`;
-
- function appendixTemplate(frontMatter) {
- let html = styles$2;
-
- if (typeof frontMatter.githubUrl !== 'undefined') {
- html += `
-
Updates and Corrections
-
`;
- if (frontMatter.githubCompareUpdatesUrl) {
- html += `View all changes to this article since it was first published.`;
- }
- html += `
- If you see mistakes or want to suggest changes, please create an issue on GitHub.
Diagrams and text are licensed under Creative Commons Attribution CC-BY 4.0 with the source available on GitHub, unless noted otherwise. The figures that have been reused from other sources don’t fall under this license and can be recognized by a note in their caption: “Figure from …”.
- `;
- }
-
- if (typeof frontMatter.publishedDate !== 'undefined') {
- html += `
-
Citation
-
For attribution in academic contexts, please cite this work as
',n.githubCompareUpdatesUrl&&(t+=`View all changes to this article since it was first published.`),t+=`\n If you see mistakes or want to suggest changes, please create an issue on GitHub.
Diagrams and text are licensed under Creative Commons Attribution CC-BY 4.0 with the source available on GitHub, unless noted otherwise. The figures that have been reused from other sources don\u2019t fall under this license and can be recognized by a note in their caption: \u201cFigure from \u2026\u201d.
`)}}
+// Copyright 2018 The Distill Template Authors
+const co="\nd-citation-list {\n contain: style;\n}\n\nd-citation-list .references {\n grid-column: text;\n}\n\nd-citation-list .references .title {\n font-weight: 500;\n}\n";class ho extends HTMLElement{static get is(){return"d-citation-list"}connectedCallback(){this.hasAttribute("distill-prerendered")||(this.style.display="none")}set citations(n){x(this,n)}}var po=m(function(n){var t=function(n){function t(n,t,e,i,r){this.type=n,this.content=t,this.alias=e,this.length=0|(i||"").length,this.greedy=!!r}function e(n,i,a,s,l,u,d){for(var h in a)if(a.hasOwnProperty(h)&&a[h]){var p=a[h];p=Array.isArray(p)?p:[p];for(var f=0;fn.length)return;if(!(M instanceof t)){var T=1;if(y&&k!=i.tail.prev){if(g.lastIndex=S,!(N=g.exec(n)))break;var _=N.index+(b&&N[1]?N[1].length:0),C=N.index+N[0].length,A=S;for(A+=k.value.length;_>=A;)A+=(k=k.next).value.length;if(S=A-=k.value.length,k.value instanceof t)continue;for(var E=k;E!==i.tail&&(A1&&e(n,i,a,k.prev,S,!0,h+","+f),u)break}else if(u)break}}}}}function i(){var n={value:null,prev:null,next:null},t={value:null,prev:n,next:null};n.next=t,this.head=n,this.tail=t,this.length=0}function r(n,t,e){var i=t.next,r={value:e,prev:t,next:i};return t.next=r,i.prev=r,n.length++,r}function o(n,t,e){for(var i=t.next,r=0;r"+i.content+""+i.tag+">"},!n.document)return n.addEventListener?(c.disableWorkerMessageHandler||n.addEventListener("message",function(t){var e=JSON.parse(t.data),i=e.language,r=e.code,o=e.immediateClose;n.postMessage(c.highlight(r,c.languages[i],i)),o&&n.close()},!1),c):c;var d=c.util.currentScript();if(d&&(c.filename=d.src,d.hasAttribute("data-manual")&&(c.manual=!0)),!c.manual){var h=document.readyState;"loading"===h||"interactive"===h&&d&&d.defer?document.addEventListener("DOMContentLoaded",s):window.requestAnimationFrame?window.requestAnimationFrame(s):window.setTimeout(s,16)}return c}("undefined"!=typeof window?window:"undefined"!=typeof WorkerGlobalScope&&self instanceof WorkerGlobalScope?self:{});n.exports&&(n.exports=t),void 0!==ro&&(ro.Prism=t),t.languages.markup={comment://,prolog:/<\?[\s\S]+?\?>/,doctype:{pattern:/"'[\]]|"[^"]*"|'[^']*')+(?:\[(?:(?!)*\]\s*)?>/i,greedy:!0},cdata://i,tag:{pattern:/<\/?(?!\d)[^\s>\/=$<%]+(?:\s(?:\s*[^\s>\/=]+(?:\s*=\s*(?:"[^"]*"|'[^']*'|[^\s'">=]+(?=[\s>]))|(?=[\s/>])))+)?\s*\/?>/i,greedy:!0,inside:{tag:{pattern:/^<\/?[^\s>\/]+/i,inside:{punctuation:/^<\/?/,namespace:/^[^\s>\/:]+:/}},"attr-value":{pattern:/=\s*(?:"[^"]*"|'[^']*'|[^\s'">=]+)/i,inside:{punctuation:[/^=/,{pattern:/^(\s*)["']|["']$/,lookbehind:!0}]}},punctuation:/\/?>/,"attr-name":{pattern:/[^\s>\/]+/,inside:{namespace:/^[^\s>\/:]+:/}}}},entity:/?[\da-z]{1,8};/i},t.languages.markup.tag.inside["attr-value"].inside.entity=t.languages.markup.entity,t.hooks.add("wrap",function(n){"entity"===n.type&&(n.attributes.title=n.content.replace(/&/,"&"))}),Object.defineProperty(t.languages.markup.tag,"addInlined",{value:function(n,e){var i={};i["language-"+e]={pattern:/(^$)/i,lookbehind:!0,inside:t.languages[e]},i.cdata=/^$/i;var r={"included-cdata":{pattern://i,inside:i}};r["language-"+e]={pattern:/[\s\S]+/,inside:t.languages[e]};var o={};o[n]={pattern:RegExp(/(<__[\s\S]*?>)(?:\s*|[\s\S])*?(?=<\/__>)/.source.replace(/__/g,function(){return n}),"i"),lookbehind:!0,greedy:!0,inside:r},t.languages.insertBefore("markup","cdata",o)}}),t.languages.xml=t.languages.extend("markup",{}),t.languages.html=t.languages.markup,t.languages.mathml=t.languages.markup,t.languages.svg=t.languages.markup,function(n){var t=/("|')(?:\\(?:\r\n|[\s\S])|(?!\1)[^\\\r\n])*\1/;n.languages.css={comment:/\/\*[\s\S]*?\*\//,atrule:{pattern:/@[\w-]+[\s\S]*?(?:;|(?=\s*\{))/,inside:{rule:/^@[\w-]+/,"selector-function-argument":{pattern:/(\bselector\s*\((?!\s*\))\s*)(?:[^()]|\((?:[^()]|\([^()]*\))*\))+?(?=\s*\))/,lookbehind:!0,alias:"selector"}}},url:{pattern:RegExp("url\\((?:"+t.source+"|[^\n\r()]*)\\)","i"),greedy:!0,inside:{"function":/^url/i,punctuation:/^\(|\)$/}},selector:RegExp("[^{}\\s](?:[^{};\"']|"+t.source+")*?(?=\\s*\\{)"),string:{pattern:t,greedy:!0},property:/[-_a-z\xA0-\uFFFF][-\w\xA0-\uFFFF]*(?=\s*:)/i,important:/!important\b/i,"function":/[-a-z0-9]+(?=\()/i,punctuation:/[(){};:,]/},n.languages.css.atrule.inside.rest=n.languages.css;var e=n.languages.markup;e&&(e.tag.addInlined("style","css"),n.languages.insertBefore("inside","attr-value",{"style-attr":{pattern:/\s*style=("|')(?:\\[\s\S]|(?!\1)[^\\])*\1/i,inside:{"attr-name":{pattern:/^\s*style/i,inside:e.tag.inside},punctuation:/^\s*=\s*['"]|['"]\s*$/,"attr-value":{pattern:/.+/i,inside:n.languages.css}},alias:"language-css"}},e.tag))}(t),t.languages.clike={comment:[{pattern:/(^|[^\\])\/\*[\s\S]*?(?:\*\/|$)/,lookbehind:!0},{pattern:/(^|[^\\:])\/\/.*/,lookbehind:!0,greedy:!0}],string:{pattern:/(["'])(?:\\(?:\r\n|[\s\S])|(?!\1)[^\\\r\n])*\1/,greedy:!0},"class-name":{pattern:/(\b(?:class|interface|extends|implements|trait|instanceof|new)\s+|\bcatch\s+\()[\w.\\]+/i,lookbehind:!0,inside:{punctuation:/[.\\]/}},keyword:/\b(?:if|else|while|do|for|return|in|instanceof|function|new|try|throw|catch|finally|null|break|continue)\b/,boolean:/\b(?:true|false)\b/,"function":/\w+(?=\()/,number:/\b0x[\da-f]+\b|(?:\b\d+\.?\d*|\B\.\d+)(?:e[+-]?\d+)?/i,operator:/[<>]=?|[!=]=?=?|--?|\+\+?|&&?|\|\|?|[?*/~^%]/,punctuation:/[{}[\];(),.:]/},t.languages.javascript=t.languages.extend("clike",{"class-name":[t.languages.clike["class-name"],{pattern:/(^|[^$\w\xA0-\uFFFF])[_$A-Z\xA0-\uFFFF][$\w\xA0-\uFFFF]*(?=\.(?:prototype|constructor))/,lookbehind:!0}],keyword:[{pattern:/((?:^|})\s*)(?:catch|finally)\b/,lookbehind:!0},{pattern:/(^|[^.]|\.\.\.\s*)\b(?:as|async(?=\s*(?:function\b|\(|[$\w\xA0-\uFFFF]|$))|await|break|case|class|const|continue|debugger|default|delete|do|else|enum|export|extends|for|from|function|get|if|implements|import|in|instanceof|interface|let|new|null|of|package|private|protected|public|return|set|static|super|switch|this|throw|try|typeof|undefined|var|void|while|with|yield)\b/,lookbehind:!0}],number:/\b(?:(?:0[xX](?:[\dA-Fa-f](?:_[\dA-Fa-f])?)+|0[bB](?:[01](?:_[01])?)+|0[oO](?:[0-7](?:_[0-7])?)+)n?|(?:\d(?:_\d)?)+n|NaN|Infinity)\b|(?:\b(?:\d(?:_\d)?)+\.?(?:\d(?:_\d)?)*|\B\.(?:\d(?:_\d)?)+)(?:[Ee][+-]?(?:\d(?:_\d)?)+)?/,"function":/#?[_$a-zA-Z\xA0-\uFFFF][$\w\xA0-\uFFFF]*(?=\s*(?:\.\s*(?:apply|bind|call)\s*)?\()/,operator:/--|\+\+|\*\*=?|=>|&&|\|\||[!=]==|<<=?|>>>?=?|[-+*/%&|^!=<>]=?|\.{3}|\?[.?]?|[~:]/}),t.languages.javascript["class-name"][0].pattern=/(\b(?:class|interface|extends|implements|instanceof|new)\s+)[\w.\\]+/,t.languages.insertBefore("javascript","keyword",{regex:{pattern:/((?:^|[^$\w\xA0-\uFFFF."'\])\s])\s*)\/(?:\[(?:[^\]\\\r\n]|\\.)*]|\\.|[^/\\\[\r\n])+\/[gimyus]{0,6}(?=(?:\s|\/\*[\s\S]*?\*\/)*(?:$|[\r\n,.;:})\]]|\/\/))/,lookbehind:!0,greedy:!0},"function-variable":{pattern:/#?[_$a-zA-Z\xA0-\uFFFF][$\w\xA0-\uFFFF]*(?=\s*[=:]\s*(?:async\s*)?(?:\bfunction\b|(?:\((?:[^()]|\([^()]*\))*\)|[_$a-zA-Z\xA0-\uFFFF][$\w\xA0-\uFFFF]*)\s*=>))/,alias:"function"},parameter:[{pattern:/(function(?:\s+[_$A-Za-z\xA0-\uFFFF][$\w\xA0-\uFFFF]*)?\s*\(\s*)(?!\s)(?:[^()]|\([^()]*\))+?(?=\s*\))/,lookbehind:!0,inside:t.languages.javascript},{pattern:/[_$a-z\xA0-\uFFFF][$\w\xA0-\uFFFF]*(?=\s*=>)/i,inside:t.languages.javascript},{pattern:/(\(\s*)(?!\s)(?:[^()]|\([^()]*\))+?(?=\s*\)\s*=>)/,lookbehind:!0,inside:t.languages.javascript},{pattern:/((?:\b|\s|^)(?!(?:as|async|await|break|case|catch|class|const|continue|debugger|default|delete|do|else|enum|export|extends|finally|for|from|function|get|if|implements|import|in|instanceof|interface|let|new|null|of|package|private|protected|public|return|set|static|super|switch|this|throw|try|typeof|undefined|var|void|while|with|yield)(?![$\w\xA0-\uFFFF]))(?:[_$A-Za-z\xA0-\uFFFF][$\w\xA0-\uFFFF]*\s*)\(\s*)(?!\s)(?:[^()]|\([^()]*\))+?(?=\s*\)\s*\{)/,lookbehind:!0,inside:t.languages.javascript}],constant:/\b[A-Z](?:[A-Z_]|\dx?)*\b/}),t.languages.insertBefore("javascript","string",{"template-string":{pattern:/`(?:\\[\s\S]|\${(?:[^{}]|{(?:[^{}]|{[^}]*})*})+}|(?!\${)[^\\`])*`/,greedy:!0,inside:{"template-punctuation":{pattern:/^`|`$/,alias:"string"},interpolation:{pattern:/((?:^|[^\\])(?:\\{2})*)\${(?:[^{}]|{(?:[^{}]|{[^}]*})*})+}/,lookbehind:!0,inside:{"interpolation-punctuation":{pattern:/^\${|}$/,alias:"punctuation"},rest:t.languages.javascript}},string:/[\s\S]+/}}}),t.languages.markup&&t.languages.markup.tag.addInlined("script","javascript"),t.languages.js=t.languages.javascript,"undefined"!=typeof self&&self.Prism&&self.document&&document.querySelector&&(self.Prism.fileHighlight=function(n){n=n||document;var e={js:"javascript",py:"python",rb:"ruby",ps1:"powershell",psm1:"powershell",sh:"bash",bat:"batch",h:"c",tex:"latex"};Array.prototype.slice.call(n.querySelectorAll("pre[data-src]")).forEach(function(n){if(!n.hasAttribute("data-src-loaded")){for(var i,r=n.getAttribute("data-src"),o=n,a=/\blang(?:uage)?-([\w-]+)\b/i;o&&!a.test(o.className);)o=o.parentNode;if(o&&(i=(n.className.match(a)||[,""])[1]),!i){var s=(r.match(/\.(\w+)$/)||[,""])[1];i=e[s]||s}var l=document.createElement("code");l.className="language-"+i,n.textContent="",l.textContent="Loading\u2026",n.appendChild(l);var u=new XMLHttpRequest;u.open("GET",r,!0),u.onreadystatechange=function(){4==u.readyState&&(u.status<400&&u.responseText?(l.textContent=u.responseText,t.highlightElement(l),n.setAttribute("data-src-loaded","")):u.status>=400?l.textContent="\u2716 Error "+u.status+" while fetching file: "+u.statusText:l.textContent="\u2716 Error: File does not exist or is empty")},u.send(null)}})},document.addEventListener("DOMContentLoaded",function(){self.Prism.fileHighlight()}))});Prism.languages.python={comment:{pattern:/(^|[^\\])#.*/,lookbehind:!0},"string-interpolation":{pattern:/(?:f|rf|fr)(?:("""|''')[\s\S]+?\1|("|')(?:\\.|(?!\2)[^\\\r\n])*\2)/i,greedy:!0,inside:{interpolation:{pattern:/((?:^|[^{])(?:{{)*){(?!{)(?:[^{}]|{(?!{)(?:[^{}]|{(?!{)(?:[^{}])+})+})+}/,lookbehind:!0,inside:{"format-spec":{pattern:/(:)[^:(){}]+(?=}$)/,lookbehind:!0},"conversion-option":{pattern:/![sra](?=[:}]$)/,alias:"punctuation"},rest:null}},string:/[\s\S]+/}},"triple-quoted-string":{pattern:/(?:[rub]|rb|br)?("""|''')[\s\S]+?\1/i,greedy:!0,alias:"string"},string:{pattern:/(?:[rub]|rb|br)?("|')(?:\\.|(?!\1)[^\\\r\n])*\1/i,greedy:!0},"function":{pattern:/((?:^|\s)def[ \t]+)[a-zA-Z_]\w*(?=\s*\()/g,lookbehind:!0},"class-name":{pattern:/(\bclass\s+)\w+/i,lookbehind:!0},decorator:{pattern:/(^\s*)@\w+(?:\.\w+)*/im,lookbehind:!0,alias:["annotation","punctuation"],inside:{punctuation:/\./}},keyword:/\b(?:and|as|assert|async|await|break|class|continue|def|del|elif|else|except|exec|finally|for|from|global|if|import|in|is|lambda|nonlocal|not|or|pass|print|raise|return|try|while|with|yield)\b/,builtin:/\b(?:__import__|abs|all|any|apply|ascii|basestring|bin|bool|buffer|bytearray|bytes|callable|chr|classmethod|cmp|coerce|compile|complex|delattr|dict|dir|divmod|enumerate|eval|execfile|file|filter|float|format|frozenset|getattr|globals|hasattr|hash|help|hex|id|input|int|intern|isinstance|issubclass|iter|len|list|locals|long|map|max|memoryview|min|next|object|oct|open|ord|pow|property|range|raw_input|reduce|reload|repr|reversed|round|set|setattr|slice|sorted|staticmethod|str|sum|super|tuple|type|unichr|unicode|vars|xrange|zip)\b/,boolean:/\b(?:True|False|None)\b/,number:/(?:\b(?=\d)|\B(?=\.))(?:0[bo])?(?:(?:\d|0x[\da-f])[\da-f]*\.?\d*|\.\d+)(?:e[+-]?\d+)?j?\b/i,operator:/[-+%=]=?|!=|\*\*?=?|\/\/?=?|<[<=>]?|>[=>]?|[&|^~]/,punctuation:/[{}[\];(),.:]/},Prism.languages.python["string-interpolation"].inside.interpolation.inside.rest=Prism.languages.python,Prism.languages.py=Prism.languages.python,Prism.languages.clike={comment:[{pattern:/(^|[^\\])\/\*[\s\S]*?(?:\*\/|$)/,lookbehind:!0},{pattern:/(^|[^\\:])\/\/.*/,lookbehind:!0,greedy:!0}],string:{pattern:/(["'])(?:\\(?:\r\n|[\s\S])|(?!\1)[^\\\r\n])*\1/,greedy:!0},"class-name":{pattern:/(\b(?:class|interface|extends|implements|trait|instanceof|new)\s+|\bcatch\s+\()[\w.\\]+/i,lookbehind:!0,inside:{punctuation:/[.\\]/}},keyword:/\b(?:if|else|while|do|for|return|in|instanceof|function|new|try|throw|catch|finally|null|break|continue)\b/,boolean:/\b(?:true|false)\b/,"function":/\w+(?=\()/,number:/\b0x[\da-f]+\b|(?:\b\d+\.?\d*|\B\.\d+)(?:e[+-]?\d+)?/i,operator:/[<>]=?|[!=]=?=?|--?|\+\+?|&&?|\|\|?|[?*/~^%]/,punctuation:/[{}[\];(),.:]/},Prism.languages.lua={comment:/^#!.+|--(?:\[(=*)\[[\s\S]*?\]\1\]|.*)/m,string:{pattern:/(["'])(?:(?!\1)[^\\\r\n]|\\z(?:\r\n|\s)|\\(?:\r\n|[\s\S]))*\1|\[(=*)\[[\s\S]*?\]\2\]/,greedy:!0},number:/\b0x[a-f\d]+\.?[a-f\d]*(?:p[+-]?\d+)?\b|\b\d+(?:\.\B|\.?\d*(?:e[+-]?\d+)?\b)|\B\.\d+(?:e[+-]?\d+)?\b/i,keyword:/\b(?:and|break|do|else|elseif|end|false|for|function|goto|if|in|local|nil|not|or|repeat|return|then|true|until|while)\b/,"function":/(?!\d)\w+(?=\s*(?:[({]))/,operator:[/[-+*%^&|#]|\/\/?|<[<=]?|>[>=]?|[=~]=?/,{pattern:/(^|[^.])\.\.(?!\.)/,lookbehind:!0}],punctuation:/[\[\](){},;]|\.+|:+/},function(n){var t="\\b(?:BASH|BASHOPTS|BASH_ALIASES|BASH_ARGC|BASH_ARGV|BASH_CMDS|BASH_COMPLETION_COMPAT_DIR|BASH_LINENO|BASH_REMATCH|BASH_SOURCE|BASH_VERSINFO|BASH_VERSION|COLORTERM|COLUMNS|COMP_WORDBREAKS|DBUS_SESSION_BUS_ADDRESS|DEFAULTS_PATH|DESKTOP_SESSION|DIRSTACK|DISPLAY|EUID|GDMSESSION|GDM_LANG|GNOME_KEYRING_CONTROL|GNOME_KEYRING_PID|GPG_AGENT_INFO|GROUPS|HISTCONTROL|HISTFILE|HISTFILESIZE|HISTSIZE|HOME|HOSTNAME|HOSTTYPE|IFS|INSTANCE|JOB|LANG|LANGUAGE|LC_ADDRESS|LC_ALL|LC_IDENTIFICATION|LC_MEASUREMENT|LC_MONETARY|LC_NAME|LC_NUMERIC|LC_PAPER|LC_TELEPHONE|LC_TIME|LESSCLOSE|LESSOPEN|LINES|LOGNAME|LS_COLORS|MACHTYPE|MAILCHECK|MANDATORY_PATH|NO_AT_BRIDGE|OLDPWD|OPTERR|OPTIND|ORBIT_SOCKETDIR|OSTYPE|PAPERSIZE|PATH|PIPESTATUS|PPID|PS1|PS2|PS3|PS4|PWD|RANDOM|REPLY|SECONDS|SELINUX_INIT|SESSION|SESSIONTYPE|SESSION_MANAGER|SHELL|SHELLOPTS|SHLVL|SSH_AUTH_SOCK|TERM|UID|UPSTART_EVENTS|UPSTART_INSTANCE|UPSTART_JOB|UPSTART_SESSION|USER|WINDOWID|XAUTHORITY|XDG_CONFIG_DIRS|XDG_CURRENT_DESKTOP|XDG_DATA_DIRS|XDG_GREETER_DATA_DIR|XDG_MENU_PREFIX|XDG_RUNTIME_DIR|XDG_SEAT|XDG_SEAT_PATH|XDG_SESSION_DESKTOP|XDG_SESSION_ID|XDG_SESSION_PATH|XDG_SESSION_TYPE|XDG_VTNR|XMODIFIERS)\\b",e={environment:{pattern:RegExp("\\$"+t),alias:"constant"},variable:[{pattern:/\$?\(\([\s\S]+?\)\)/,greedy:!0,inside:{variable:[{pattern:/(^\$\(\([\s\S]+)\)\)/,lookbehind:!0},/^\$\(\(/],number:/\b0x[\dA-Fa-f]+\b|(?:\b\d+\.?\d*|\B\.\d+)(?:[Ee]-?\d+)?/,operator:/--?|-=|\+\+?|\+=|!=?|~|\*\*?|\*=|\/=?|%=?|<<=?|>>=?|<=?|>=?|==?|&&?|&=|\^=?|\|\|?|\|=|\?|:/,punctuation:/\(\(?|\)\)?|,|;/}},{pattern:/\$\((?:\([^)]+\)|[^()])+\)|`[^`]+`/,greedy:!0,inside:{variable:/^\$\(|^`|\)$|`$/}},{pattern:/\$\{[^}]+\}/,greedy:!0,inside:{operator:/:[-=?+]?|[!\/]|##?|%%?|\^\^?|,,?/,punctuation:/[\[\]]/,environment:{pattern:RegExp("(\\{)"+t),lookbehind:!0,alias:"constant"}}},/\$(?:\w+|[#?*!@$])/],entity:/\\(?:[abceEfnrtv\\"]|O?[0-7]{1,3}|x[0-9a-fA-F]{1,2}|u[0-9a-fA-F]{4}|U[0-9a-fA-F]{8})/};n.languages.bash={shebang:{pattern:/^#!\s*\/.*/,alias:"important"},comment:{pattern:/(^|[^"{\\$])#.*/,lookbehind:!0},"function-name":[{pattern:/(\bfunction\s+)\w+(?=(?:\s*\(?:\s*\))?\s*\{)/,lookbehind:!0,alias:"function"},{pattern:/\b\w+(?=\s*\(\s*\)\s*\{)/,alias:"function"}],"for-or-select":{pattern:/(\b(?:for|select)\s+)\w+(?=\s+in\s)/,alias:"variable",lookbehind:!0},"assign-left":{pattern:/(^|[\s;|&]|[<>]\()\w+(?=\+?=)/,inside:{environment:{pattern:RegExp("(^|[\\s;|&]|[<>]\\()"+t),lookbehind:!0,alias:"constant"}},alias:"variable",lookbehind:!0},string:[{pattern:/((?:^|[^<])<<-?\s*)(\w+?)\s*(?:\r?\n|\r)[\s\S]*?(?:\r?\n|\r)\2/,lookbehind:!0,greedy:!0,inside:e},{pattern:/((?:^|[^<])<<-?\s*)(["'])(\w+)\2\s*(?:\r?\n|\r)[\s\S]*?(?:\r?\n|\r)\3/,lookbehind:!0,greedy:!0},{pattern:/(^|[^\\](?:\\\\)*)(["'])(?:\\[\s\S]|\$\([^)]+\)|`[^`]+`|(?!\2)[^\\])*\2/,lookbehind:!0,greedy:!0,inside:e}],environment:{pattern:RegExp("\\$?"+t),alias:"constant"},variable:e.variable,"function":{pattern:/(^|[\s;|&]|[<>]\()(?:add|apropos|apt|aptitude|apt-cache|apt-get|aspell|automysqlbackup|awk|basename|bash|bc|bconsole|bg|bzip2|cal|cat|cfdisk|chgrp|chkconfig|chmod|chown|chroot|cksum|clear|cmp|column|comm|cp|cron|crontab|csplit|curl|cut|date|dc|dd|ddrescue|debootstrap|df|diff|diff3|dig|dir|dircolors|dirname|dirs|dmesg|du|egrep|eject|env|ethtool|expand|expect|expr|fdformat|fdisk|fg|fgrep|file|find|fmt|fold|format|free|fsck|ftp|fuser|gawk|git|gparted|grep|groupadd|groupdel|groupmod|groups|grub-mkconfig|gzip|halt|head|hg|history|host|hostname|htop|iconv|id|ifconfig|ifdown|ifup|import|install|ip|jobs|join|kill|killall|less|link|ln|locate|logname|logrotate|look|lpc|lpr|lprint|lprintd|lprintq|lprm|ls|lsof|lynx|make|man|mc|mdadm|mkconfig|mkdir|mke2fs|mkfifo|mkfs|mkisofs|mknod|mkswap|mmv|more|most|mount|mtools|mtr|mutt|mv|nano|nc|netstat|nice|nl|nohup|notify-send|npm|nslookup|op|open|parted|passwd|paste|pathchk|ping|pkill|pnpm|popd|pr|printcap|printenv|ps|pushd|pv|quota|quotacheck|quotactl|ram|rar|rcp|reboot|remsync|rename|renice|rev|rm|rmdir|rpm|rsync|scp|screen|sdiff|sed|sendmail|seq|service|sftp|sh|shellcheck|shuf|shutdown|sleep|slocate|sort|split|ssh|stat|strace|su|sudo|sum|suspend|swapon|sync|tac|tail|tar|tee|time|timeout|top|touch|tr|traceroute|tsort|tty|umount|uname|unexpand|uniq|units|unrar|unshar|unzip|update-grub|uptime|useradd|userdel|usermod|users|uudecode|uuencode|v|vdir|vi|vim|virsh|vmstat|wait|watch|wc|wget|whereis|which|who|whoami|write|xargs|xdg-open|yarn|yes|zenity|zip|zsh|zypper)(?=$|[)\s;|&])/,lookbehind:!0},keyword:{pattern:/(^|[\s;|&]|[<>]\()(?:if|then|else|elif|fi|for|while|in|case|esac|function|select|do|done|until)(?=$|[)\s;|&])/,lookbehind:!0},builtin:{pattern:/(^|[\s;|&]|[<>]\()(?:\.|:|break|cd|continue|eval|exec|exit|export|getopts|hash|pwd|readonly|return|shift|test|times|trap|umask|unset|alias|bind|builtin|caller|command|declare|echo|enable|help|let|local|logout|mapfile|printf|read|readarray|source|type|typeset|ulimit|unalias|set|shopt)(?=$|[)\s;|&])/,lookbehind:!0,alias:"class-name"},boolean:{pattern:/(^|[\s;|&]|[<>]\()(?:true|false)(?=$|[)\s;|&])/,lookbehind:!0},"file-descriptor":{pattern:/\B&\d\b/,alias:"important"},operator:{pattern:/\d?<>|>\||\+=|==?|!=?|=~|<<[<-]?|[&\d]?>>|\d?[<>]&?|&[>&]?|\|[&|]?|<=?|>=?/,inside:{"file-descriptor":{pattern:/^\d/,alias:"important"}}},punctuation:/\$?\(\(?|\)\)?|\.\.|[{}[\];\\]/,number:{pattern:/(^|\s)(?:[1-9]\d*|0)(?:[.,]\d+)?\b/,lookbehind:!0}};for(var i=["comment","function-name","for-or-select","assign-left","string","environment","function","keyword","builtin","boolean","file-descriptor","operator","punctuation","number"],r=e.variable[1].inside,o=0;o(?:>=?|=)?|<(?:<=?|=|-)?|:=|\.\.\./,number:/(?:\b0x[a-f\d]+|(?:\b\d+\.?\d*|\B\.\d+)(?:e[-+]?\d+)?)i?/i,string:{pattern:/(["'`])(?:\\[\s\S]|(?!\1)[^\\])*\1/,greedy:!0}}),delete Prism.languages.go["class-name"],function(n){function t(n,t){return n=n.replace(//g,function(){return e}),t&&(n=n+"|"+n.replace(/_/g,"\\*")),RegExp(/((?:^|[^\\])(?:\\{2})*)/.source+"(?:"+n+")")}var e=/(?:\\.|[^\\\n\r]|(?:\n|\r\n?)(?!\n|\r\n?))/.source,i=/(?:\\.|``.+?``|`[^`\r\n]+`|[^\\|\r\n`])+/.source,r=/\|?__(?:\|__)+\|?(?:(?:\n|\r\n?)|$)/.source.replace(/__/g,function(){return i}),o=/\|?[ \t]*:?-{3,}:?[ \t]*(?:\|[ \t]*:?-{3,}:?[ \t]*)+\|?(?:\n|\r\n?)/.source;n.languages.markdown=n.languages.extend("markup",{}),n.languages.insertBefore("markdown","prolog",{blockquote:{pattern:/^>(?:[\t ]*>)*/m,alias:"punctuation"},table:{pattern:RegExp("^"+r+o+"(?:"+r+")*","m"),inside:{"table-data-rows":{pattern:RegExp("^("+r+o+")(?:"+r+")*$"),lookbehind:!0,inside:{"table-data":{pattern:RegExp(i),inside:n.languages.markdown},punctuation:/\|/}},"table-line":{pattern:RegExp("^("+r+")"+o+"$"),lookbehind:!0,inside:{punctuation:/\||:?-{3,}:?/}},"table-header-row":{pattern:RegExp("^"+r+"$"),inside:{"table-header":{pattern:RegExp(i),alias:"important",inside:n.languages.markdown},punctuation:/\|/}}}},code:[{pattern:/((?:^|\n)[ \t]*\n|(?:^|\r\n?)[ \t]*\r\n?)(?: {4}|\t).+(?:(?:\n|\r\n?)(?: {4}|\t).+)*/,lookbehind:!0,alias:"keyword"},{pattern:/``.+?``|`[^`\r\n]+`/,alias:"keyword"},{pattern:/^```[\s\S]*?^```$/m,greedy:!0,inside:{"code-block":{pattern:/^(```.*(?:\n|\r\n?))[\s\S]+?(?=(?:\n|\r\n?)^```$)/m,lookbehind:!0},"code-language":{pattern:/^(```).+/,lookbehind:!0},punctuation:/```/}}],title:[{pattern:/\S.*(?:\n|\r\n?)(?:==+|--+)(?=[ \t]*$)/m,alias:"important",inside:{punctuation:/==+$|--+$/}},{pattern:/(^\s*)#+.+/m,lookbehind:!0,alias:"important",inside:{punctuation:/^#+|#+$/}}],hr:{pattern:/(^\s*)([*-])(?:[\t ]*\2){2,}(?=\s*$)/m,lookbehind:!0,alias:"punctuation"},list:{pattern:/(^\s*)(?:[*+-]|\d+\.)(?=[\t ].)/m,lookbehind:!0,alias:"punctuation"},"url-reference":{pattern:/!?\[[^\]]+\]:[\t ]+(?:\S+|<(?:\\.|[^>\\])+>)(?:[\t ]+(?:"(?:\\.|[^"\\])*"|'(?:\\.|[^'\\])*'|\((?:\\.|[^)\\])*\)))?/,inside:{variable:{pattern:/^(!?\[)[^\]]+/,lookbehind:!0},string:/(?:"(?:\\.|[^"\\])*"|'(?:\\.|[^'\\])*'|\((?:\\.|[^)\\])*\))$/,punctuation:/^[\[\]!:]|[<>]/},alias:"url"},bold:{pattern:t(/__(?:(?!_)|_(?:(?!_))+_)+__/.source,!0),lookbehind:!0,greedy:!0,inside:{content:{pattern:/(^..)[\s\S]+(?=..$)/,lookbehind:!0,inside:{}},punctuation:/\*\*|__/}},italic:{pattern:t(/_(?:(?!_)|__(?:(?!_))+__)+_/.source,!0),lookbehind:!0,greedy:!0,inside:{content:{pattern:/(^.)[\s\S]+(?=.$)/,lookbehind:!0,inside:{}},punctuation:/[*_]/}},strike:{pattern:t(/(~~?)(?:(?!~))+?\2/.source,!1),lookbehind:!0,greedy:!0,inside:{content:{pattern:/(^~~?)[\s\S]+(?=\1$)/,lookbehind:!0,inside:{}},punctuation:/~~?/}},url:{pattern:t(/!?\[(?:(?!\]))+\](?:\([^\s)]+(?:[\t ]+"(?:\\.|[^"\\])*")?\)| ?\[(?:(?!\]))+\])/.source,!1),lookbehind:!0,greedy:!0,inside:{variable:{pattern:/(\[)[^\]]+(?=\]$)/,lookbehind:!0},content:{pattern:/(^!?\[)[^\]]+(?=\])/,lookbehind:!0,inside:{}},string:{pattern:/"(?:\\.|[^"\\])*"(?=\)$)/}}}}),["url","bold","italic","strike"].forEach(function(t){["url","bold","italic","strike"].forEach(function(e){t!==e&&(n.languages.markdown[t].inside.content.inside[e]=n.languages.markdown[e])})}),n.hooks.add("after-tokenize",function(n){function t(n){if(n&&"string"!=typeof n)for(var e=0,i=n.length;e]?|<(?:<=?|[=:])?|>(?:=|>>?=?)?|==?=?|[~\u2260\u2264\u2265]/,punctuation:/[{}[\];(),.:]/,constant:/\b(?:(?:NaN|Inf)(?:16|32|64)?)\b/};
+// Copyright 2018 The Distill Template Authors
+const fo=Or("d-code",`\n\n\n\n\n`);class go extends(Dr(fo(HTMLElement))){renderContent(){if(this.languageName=this.getAttribute("language"),!this.languageName)return void console.warn('You need to provide a language attribute to your block to let us know how to highlight your code; e.g.:\n zeros = np.zeros(shape).');const n=po.languages[this.languageName];if(n==undefined)return void console.warn(`Distill does not yet support highlighting your code block in "${this.languageName}'.`);let t=this.textContent;const e=this.shadowRoot.querySelector("#code-container");if(this.hasAttribute("block")){const n=(t=t.replace(/\n/,"")).match(/\s*/);if(t=(t=t.replace(new RegExp("\n"+n,"g"),"\n")).trim(),e.parentNode instanceof ShadowRoot){const n=document.createElement("pre");this.shadowRoot.removeChild(e),n.appendChild(e),this.shadowRoot.appendChild(n)}}e.className=`language-${this.languageName}`,e.innerHTML=po.highlight(t,n)}}
+// Copyright 2018 The Distill Template Authors
+const mo=Or("d-footnote",'\n\n\n\n
\n \n
\n\n\n\n \n\n\n');class bo extends(mo(HTMLElement)){constructor(){super();const n={childList:!0,characterData:!0,subtree:!0};new MutationObserver(this.notify).observe(this,n)}notify(){const n=new CustomEvent("onFootnoteChanged",{detail:this,bubbles:!0});document.dispatchEvent(n)}connectedCallback(){this.hoverBox=this.root.querySelector("d-hover-box"),window.customElements.whenDefined("d-hover-box").then(()=>{this.hoverBox.listen(this)}),bo.currentFootnoteId+=1;const n=bo.currentFootnoteId.toString();this.root.host.id="d-footnote-"+n;const t="dt-fn-hover-box-"+n;this.hoverBox.id=t;const e=this.root.querySelector("#fn-");e.setAttribute("id","fn-"+n),e.setAttribute("data-hover-ref",t),e.textContent=n}}bo.currentFootnoteId=0;
+// Copyright 2018 The Distill Template Authors
+const yo=Or("d-footnote-list","\n\n\n
Footnotes
\n\n",!1);class vo extends(yo(HTMLElement)){connectedCallback(){super.connectedCallback(),this.list=this.root.querySelector("ol"),this.root.style.display="none"}set footnotes(n){if(this.list.innerHTML="",n.length){this.root.style.display="";for(const t of n){const n=document.createElement("li");n.id=t.id+"-listing",n.innerHTML=t.innerHTML;const e=document.createElement("a");e.setAttribute("class","footnote-backlink"),e.textContent="[\u21a9]",e.href="#"+t.id,n.appendChild(e),this.list.appendChild(n)}}else this.root.style.display="none"}}
+// Copyright 2018 The Distill Template Authors
+const wo=Or("d-hover-box",'\n\n\n
\n
\n \n
\n
\n');class xo extends(wo(HTMLElement)){constructor(){super()}connectedCallback(){}listen(n){this.bindDivEvents(this),this.bindTriggerEvents(n)}bindDivEvents(n){n.addEventListener("mouseover",()=>{this.visible||this.showAtNode(n),this.stopTimeout()}),n.addEventListener("mouseout",()=>{this.extendTimeout(500)}),n.addEventListener("touchstart",n=>{n.stopPropagation()},{passive:!0}),document.body.addEventListener("touchstart",()=>{this.hide()},{passive:!0})}bindTriggerEvents(n){n.addEventListener("mouseover",()=>{this.visible||this.showAtNode(n),this.stopTimeout()}),n.addEventListener("mouseout",()=>{this.extendTimeout(300)}),n.addEventListener("touchstart",t=>{this.visible?this.hide():this.showAtNode(n),t.stopPropagation()},{passive:!0})}show(n){this.visible=!0,this.style.display="block",this.style.top=Math.round(n[1]+10)+"px"}showAtNode(n){const t=n.getBoundingClientRect();this.show([n.offsetLeft+t.width,n.offsetTop+t.height])}hide(){this.visible=!1,this.style.display="none",this.stopTimeout()}stopTimeout(){this.timeout&&clearTimeout(this.timeout)}extendTimeout(n){this.stopTimeout(),this.timeout=setTimeout(()=>{this.hide()},n)}}
+// Copyright 2018 The Distill Template Authors
+class ko extends HTMLElement{static get is(){return"d-title"}}
+// Copyright 2018 The Distill Template Authors
+const So=Or("d-references","\n\n",!1);class Mo extends(So(HTMLElement)){}
+// Copyright 2018 The Distill Template Authors
+class To extends HTMLElement{static get is(){return"d-toc"}connectedCallback(){this.getAttribute("prerendered")||(window.onload=(()=>{k(this,document.querySelector("d-article").querySelectorAll("h2, h3"))}))}}class _o extends HTMLElement{static get is(){return"d-figure"}static get readyQueue(){return _o._readyQueue||(_o._readyQueue=[]),_o._readyQueue}static addToReadyQueue(n){-1===_o.readyQueue.indexOf(n)&&(_o.readyQueue.push(n),_o.runReadyQueue())}static runReadyQueue(){const n=_o.readyQueue.sort((n,t)=>n._seenOnScreen-t._seenOnScreen).filter(n=>!n._ready).pop();n&&(n.ready(),requestAnimationFrame(_o.runReadyQueue))}constructor(){super(),this._ready=!1,this._onscreen=!1,this._offscreen=!0}connectedCallback(){this.loadsWhileScrolling=this.hasAttribute("loadsWhileScrolling"),_o.marginObserver.observe(this),_o.directObserver.observe(this)}disconnectedCallback(){_o.marginObserver.unobserve(this),_o.directObserver.unobserve(this)}static get marginObserver(){if(!_o._marginObserver){const n=window.innerHeight,t=Math.floor(2*n),e={rootMargin:t+"px 0px "+t+"px 0px",threshold:.01},i=_o.didObserveMarginIntersection,r=new IntersectionObserver(i,e);_o._marginObserver=r}return _o._marginObserver}static didObserveMarginIntersection(n){for(const t of n){const n=t.target;t.isIntersecting&&!n._ready&&_o.addToReadyQueue(n)}}static get directObserver(){return _o._directObserver||(_o._directObserver=new IntersectionObserver(_o.didObserveDirectIntersection,{rootMargin:"0px",threshold:[0,1]})),_o._directObserver}static didObserveDirectIntersection(n){for(const t of n){const n=t.target;t.isIntersecting?(n._seenOnScreen=new Date,n._offscreen&&n.onscreen()):n._onscreen&&n.offscreen()}}addEventListener(n,t){super.addEventListener(n,t),"ready"===n&&-1!==_o.readyQueue.indexOf(this)&&(this._ready=!1,_o.runReadyQueue()),"onscreen"===n&&this.onscreen()}ready(){this._ready=!0,_o.marginObserver.unobserve(this);const n=new CustomEvent("ready");this.dispatchEvent(n)}onscreen(){this._onscreen=!0,this._offscreen=!1;const n=new CustomEvent("onscreen");this.dispatchEvent(n)}offscreen(){this._onscreen=!1,this._offscreen=!0;const n=new CustomEvent("offscreen");this.dispatchEvent(n)}}if("undefined"!=typeof window){let n;_o.isScrolling=!1;const t=()=>{_o.isScrolling=!0,clearTimeout(n),n=setTimeout(()=>{_o.isScrolling=!1,_o.runReadyQueue()},500)};window.addEventListener("scroll",t,!0)}
+// Copyright 2018 The Distill Template Authors
+const Co="distill.pub",Ao=Or("d-interstitial",'\n\n\n
\n
\n
This article is in review.
\n
Do not share this URL or the contents of this article. Thank you!
\n \n
Enter the password we shared with you as part of the review process to view the article.
\n
\n
\n');class Eo extends(Ao(HTMLElement)){connectedCallback(){if(this.shouldRemoveSelf())this.parentElement.removeChild(this);else{this.root.querySelector("#interstitial-password-input").oninput=(n=>this.passwordChanged(n))}}passwordChanged(n){n.target.value===this.password&&(console.log("Correct password entered."),this.parentElement.removeChild(this),"undefined"!=typeof Storage&&(console.log("Saved that correct password was entered."),localStorage.setItem(this.localStorageIdentifier(),"true")))}shouldRemoveSelf(){return window&&window.location.hostname===Co?(console.warn("Interstitial found on production, hiding it."),!0):"undefined"!=typeof Storage&&"true"===localStorage.getItem(this.localStorageIdentifier())&&(console.log("Loaded that correct password was entered before; skipping interstitial."),!0)}localStorageIdentifier(){const n="interstitial-password-correct";return"distill-drafts"+(window?window.location.pathname:"-")+n}}var No=M(S).right,Lo=Math.sqrt(50),Do=Math.sqrt(10),Oo=Math.sqrt(2),Io=.7,Fo=1/Io,Ro="\\s*([+-]?\\d+)\\s*",Uo="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)\\s*",$o="\\s*([+-]?\\d*\\.?\\d+(?:[eE][+-]?\\d+)?)%\\s*",Po=/^#([0-9a-f]{3,8})$/,Ho=new RegExp("^rgb\\("+[Ro,Ro,Ro]+"\\)$"),zo=new RegExp("^rgb\\("+[$o,$o,$o]+"\\)$"),qo=new RegExp("^rgba\\("+[Ro,Ro,Ro,Uo]+"\\)$"),jo=new RegExp("^rgba\\("+[$o,$o,$o,Uo]+"\\)$"),Bo=new RegExp("^hsl\\("+[Uo,$o,$o]+"\\)$"),Yo=new RegExp("^hsla\\("+[Uo,$o,$o,Uo]+"\\)$"),Wo={aliceblue:15792383,antiquewhite:16444375,aqua:65535,aquamarine:8388564,azure:15794175,beige:16119260,bisque:16770244,black:0,blanchedalmond:16772045,blue:255,blueviolet:9055202,brown:10824234,burlywood:14596231,cadetblue:6266528,chartreuse:8388352,chocolate:13789470,coral:16744272,cornflowerblue:6591981,cornsilk:16775388,crimson:14423100,cyan:65535,darkblue:139,darkcyan:35723,darkgoldenrod:12092939,darkgray:11119017,darkgreen:25600,darkgrey:11119017,darkkhaki:12433259,darkmagenta:9109643,darkolivegreen:5597999,darkorange:16747520,darkorchid:10040012,darkred:9109504,darksalmon:15308410,darkseagreen:9419919,darkslateblue:4734347,darkslategray:3100495,darkslategrey:3100495,darkturquoise:52945,darkviolet:9699539,deeppink:16716947,deepskyblue:49151,dimgray:6908265,dimgrey:6908265,dodgerblue:2003199,firebrick:11674146,floralwhite:16775920,forestgreen:2263842,fuchsia:16711935,gainsboro:14474460,ghostwhite:16316671,gold:16766720,goldenrod:14329120,gray:8421504,green:32768,greenyellow:11403055,grey:8421504,honeydew:15794160,hotpink:16738740,indianred:13458524,indigo:4915330,ivory:16777200,khaki:15787660,lavender:15132410,lavenderblush:16773365,lawngreen:8190976,lemonchiffon:16775885,lightblue:11393254,lightcoral:15761536,lightcyan:14745599,lightgoldenrodyellow:16448210,lightgray:13882323,lightgreen:9498256,lightgrey:13882323,lightpink:16758465,lightsalmon:16752762,lightseagreen:2142890,lightskyblue:8900346,lightslategray:7833753,lightslategrey:7833753,lightsteelblue:11584734,lightyellow:16777184,lime:65280,limegreen:3329330,linen:16445670,magenta:16711935,maroon:8388608,mediumaquamarine:6737322,mediumblue:205,mediumorchid:12211667,mediumpurple:9662683,mediumseagreen:3978097,mediumslateblue:8087790,mediumspringgreen:64154,mediumturquoise:4772300,mediumvioletred:13047173,midnightblue:1644912,mintcream:16121850,mistyrose:16770273,moccasin:16770229,navajowhite:16768685,navy:128,oldlace:16643558,olive:8421376,olivedrab:7048739,orange:16753920,orangered:16729344,orchid:14315734,palegoldenrod:15657130,palegreen:10025880,paleturquoise:11529966,palevioletred:14381203,papayawhip:16773077,peachpuff:16767673,peru:13468991,pink:16761035,plum:14524637,powderblue:11591910,purple:8388736,rebeccapurple:6697881,red:16711680,rosybrown:12357519,royalblue:4286945,saddlebrown:9127187,salmon:16416882,sandybrown:16032864,seagreen:3050327,seashell:16774638,sienna:10506797,silver:12632256,skyblue:8900331,slateblue:6970061,slategray:7372944,slategrey:7372944,snow:16775930,springgreen:65407,steelblue:4620980,tan:13808780,teal:32896,thistle:14204888,tomato:16737095,turquoise:4251856,violet:15631086,wheat:16113331,white:16777215,whitesmoke:16119285,yellow:16776960,yellowgreen:10145074};L(O,U,{copy:function(n){return Object.assign(new this.constructor,this,n)},displayable:function(){return this.rgb().displayable()},hex:I,formatHex:I,formatHsl:F,formatRgb:R,toString:R}),L(q,z,D(O,{brighter:function(n){return n=null==n?Fo:Math.pow(Fo,n),new q(this.r*n,this.g*n,this.b*n,this.opacity)},darker:function(n){return n=null==n?Io:Math.pow(Io,n),new q(this.r*n,this.g*n,this.b*n,this.opacity)},rgb:function(){return this},displayable:function(){return-.5<=this.r&&this.r<255.5&&-.5<=this.g&&this.g<255.5&&-.5<=this.b&&this.b<255.5&&0<=this.opacity&&this.opacity<=1},hex:j,formatHex:j,formatRgb:B,toString:B})),L(K,V,D(O,{brighter:function(n){return n=null==n?Fo:Math.pow(Fo,n),new K(this.h,this.s,this.l*n,this.opacity)},darker:function(n){return n=null==n?Io:Math.pow(Io,n),new K(this.h,this.s,this.l*n,this.opacity)},rgb:function(){var n=this.h%360+360*(this.h<0),t=isNaN(n)||isNaN(this.s)?0:this.s,e=this.l,i=e+(e<.5?e:1-e)*t,r=2*e-i;return new q(X(n>=240?n-240:n+120,r,i),X(n,r,i),X(n<120?n+240:n-120,r,i),this.opacity)},displayable:function(){return(0<=this.s&&this.s<=1||isNaN(this.s))&&0<=this.l&&this.l<=1&&0<=this.opacity&&this.opacity<=1},formatHsl:function(){var n=this.opacity;return(1===(n=isNaN(n)?1:Math.max(0,Math.min(1,n)))?"hsl(":"hsla(")+(this.h||0)+", "+100*(this.s||0)+"%, "+100*(this.l||0)+"%"+(1===n?")":", "+n+")")}}));var Go=Math.PI/180,Vo=180/Math.PI,Ko=18,Xo=.96422,Zo=1,Qo=.82521,Jo=4/29,na=6/29,ta=3*na*na,ea=na*na*na;L(J,Q,D(O,{brighter:function(n){return new J(this.l+Ko*(null==n?1:n),this.a,this.b,this.opacity)},darker:function(n){return new J(this.l-Ko*(null==n?1:n),this.a,this.b,this.opacity)},rgb:function(){var n=(this.l+16)/116,t=isNaN(this.a)?n:n+this.a/500,e=isNaN(this.b)?n:n-this.b/200;return new q(en(3.1338561*(t=Xo*tn(t))-1.6168667*(n=Zo*tn(n))-.4906146*(e=Qo*tn(e))),en(-.9787684*t+1.9161415*n+.033454*e),en(.0719453*t-.2289914*n+1.4052427*e),this.opacity)}})),L(sn,an,D(O,{brighter:function(n){return new sn(this.h,this.c,this.l+Ko*(null==n?1:n),this.opacity)},darker:function(n){return new sn(this.h,this.c,this.l-Ko*(null==n?1:n),this.opacity)},rgb:function(){return ln(this).rgb()}}));var ia=-.14861,ra=1.78277,oa=-.29227,aa=-.90649,sa=1.97294,la=sa*aa,ua=sa*ra,ca=ra*oa-aa*ia;L(dn,cn,D(O,{brighter:function(n){return n=null==n?Fo:Math.pow(Fo,n),new dn(this.h,this.s,this.l*n,this.opacity)},darker:function(n){return n=null==n?Io:Math.pow(Io,n),new dn(this.h,this.s,this.l*n,this.opacity)},rgb:function(){var n=isNaN(this.h)?0:(this.h+120)*Go,t=+this.l,e=isNaN(this.s)?0:this.s*t*(1-t),i=Math.cos(n),r=Math.sin(n);return new q(255*(t+e*(ia*i+ra*r)),255*(t+e*(oa*i+aa*r)),255*(t+e*(sa*i)),this.opacity)}}));var da,ha=function gs(n){function t(n,t){var i=e((n=z(n)).r,(t=z(t)).r),r=e(n.g,t.g),o=e(n.b,t.b),a=mn(n.opacity,t.opacity);return function(t){return n.r=i(t),n.g=r(t),n.b=o(t),n.opacity=a(t),n+""}}var e=gn(n);return t.gamma=gs,t}(1),pa=/[-+]?(?:\d+\.?\d*|\.?\d+)(?:[eE][-+]?\d+)?/g,fa=new RegExp(pa.source,"g"),ga=[0,1],ma=/^(?:(.)?([<>=^]))?([+\-( ])?([$#])?(0)?(\d+)?(,)?(\.\d+)?(~)?([a-z%])?$/i;qn.prototype=jn.prototype,jn.prototype.toString=function(){return this.fill+this.align+this.sign+this.symbol+(this.zero?"0":"")+(this.width===undefined?"":Math.max(1,0|this.width))+(this.comma?",":"")+(this.precision===undefined?"":"."+Math.max(0,0|this.precision))+(this.trim?"~":"")+this.type};var ba,ya,va,wa={"%":function(n,t){return(100*n).toFixed(t)},b:function(n){return Math.round(n).toString(2)},c:function(n){return n+""},d:function(n){return Math.round(n).toString(10)},e:function(n,t){return n.toExponential(t)},f:function(n,t){return n.toFixed(t)},g:function(n,t){return n.toPrecision(t)},o:function(n){return Math.round(n).toString(8)},p:function(n,t){return Wn(100*n,t)},r:Wn,s:Yn,X:function(n){return Math.round(n).toString(16).toUpperCase()},x:function(n){return Math.round(n).toString(16)}},xa=Array.prototype.map,ka=["y","z","a","f","p","n","\xb5","m","","k","M","G","T","P","E","Z","Y"];Kn({decimal:".",thousands:",",grouping:[3],currency:["$",""],minus:"-"});var Sa=new Date,Ma=new Date,Ta=et(function(){},function(n,t){n.setTime(+n+t)},function(n,t){return t-n});Ta.every=function(n){return n=Math.floor(n),isFinite(n)&&n>0?n>1?et(function(t){t.setTime(Math.floor(t/n)*n)},function(t,e){t.setTime(+t+e*n)},function(t,e){return(e-t)/n}):Ta:null};var _a=1e3,Ca=6e4,Aa=36e5,Ea=864e5,Na=6048e5,La=(et(function(n){n.setTime(n-n.getMilliseconds())},function(n,t){n.setTime(+n+t*_a)},function(n,t){return(t-n)/_a},function(n){return n.getUTCSeconds()}),et(function(n){n.setTime(n-n.getMilliseconds()-n.getSeconds()*_a)},function(n,t){n.setTime(+n+t*Ca)},function(n,t){return(t-n)/Ca},function(n){return n.getMinutes()}),et(function(n){n.setTime(n-n.getMilliseconds()-n.getSeconds()*_a-n.getMinutes()*Ca)},function(n,t){n.setTime(+n+t*Aa)},function(n,t){return(t-n)/Aa},function(n){return n.getHours()}),et(function(n){n.setHours(0,0,0,0)},function(n,t){n.setDate(n.getDate()+t)},function(n,t){return(t-n-(t.getTimezoneOffset()-n.getTimezoneOffset())*Ca)/Ea},function(n){return n.getDate()-1})),Da=it(0),Oa=it(1),Ia=(it(2),it(3),it(4)),Fa=(it(5),it(6),et(function(n){n.setDate(1),n.setHours(0,0,0,0)},function(n,t){n.setMonth(n.getMonth()+t)},function(n,t){return t.getMonth()-n.getMonth()+12*(t.getFullYear()-n.getFullYear())},function(n){return n.getMonth()}),et(function(n){n.setMonth(0,1),n.setHours(0,0,0,0)},function(n,t){n.setFullYear(n.getFullYear()+t)},function(n,t){return t.getFullYear()-n.getFullYear()},function(n){return n.getFullYear()}));Fa.every=function(n){return isFinite(n=Math.floor(n))&&n>0?et(function(t){t.setFullYear(Math.floor(t.getFullYear()/n)*n),t.setMonth(0,1),t.setHours(0,0,0,0)},function(t,e){t.setFullYear(t.getFullYear()+e*n)}):null};et(function(n){n.setUTCSeconds(0,0)},function(n,t){n.setTime(+n+t*Ca)},function(n,t){return(t-n)/Ca},function(n){return n.getUTCMinutes()}),et(function(n){n.setUTCMinutes(0,0,0)},function(n,t){n.setTime(+n+t*Aa)},function(n,t){return(t-n)/Aa},function(n){return n.getUTCHours()});var Ra=et(function(n){n.setUTCHours(0,0,0,0)},function(n,t){n.setUTCDate(n.getUTCDate()+t)},function(n,t){return(t-n)/Ea},function(n){return n.getUTCDate()-1}),Ua=rt(0),$a=rt(1),Pa=(rt(2),rt(3),rt(4)),Ha=(rt(5),rt(6),et(function(n){n.setUTCDate(1),n.setUTCHours(0,0,0,0)},function(n,t){n.setUTCMonth(n.getUTCMonth()+t)},function(n,t){return t.getUTCMonth()-n.getUTCMonth()+12*(t.getUTCFullYear()-n.getUTCFullYear())},function(n){return n.getUTCMonth()}),et(function(n){n.setUTCMonth(0,1),n.setUTCHours(0,0,0,0)},function(n,t){n.setUTCFullYear(n.getUTCFullYear()+t)},function(n,t){return t.getUTCFullYear()-n.getUTCFullYear()},function(n){return n.getUTCFullYear()}));Ha.every=function(n){return isFinite(n=Math.floor(n))&&n>0?et(function(t){t.setUTCFullYear(Math.floor(t.getUTCFullYear()/n)*n),t.setUTCMonth(0,1),t.setUTCHours(0,0,0,0)},function(t,e){t.setUTCFullYear(t.getUTCFullYear()+e*n)}):null};var za,qa,ja,Ba={"-":"",_:" ",0:"0"},Ya=/^\s*\d+/,Wa=/^%/,Ga=/[\\^$*+?|[\]().{}]/g;me({dateTime:"%x, %X",date:"%-m/%-d/%Y",time:"%-I:%M:%S %p",periods:["AM","PM"],days:["Sunday","Monday","Tuesday","Wednesday","Thursday","Friday","Saturday"],shortDays:["Sun","Mon","Tue","Wed","Thu","Fri","Sat"],months:["January","February","March","April","May","June","July","August","September","October","November","December"],shortMonths:["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"]});var Va="%Y-%m-%dT%H:%M:%S.%LZ",Ka=(Date.prototype.toISOString||qa(Va),+new Date("2000-01-01T00:00:00.000Z")||ja(Va),{value:function(){}});we.prototype=ve.prototype={constructor:we,on:function(n,t){var e,i=this._,r=xe(n+"",i),o=-1,a=r.length;if(!(arguments.length<2)){if(null!=t&&"function"!=typeof t)throw new Error("invalid callback: "+t);for(;++o0)for(var e,i,r=new Array(e),o=0;o=0&&(this._names.splice(t,1),this._node.setAttribute("class",this._names.join(" ")))},contains:function(n){return this._names.indexOf(n)>=0}};var Ja={},ns=null;"undefined"!=typeof document&&("onmouseenter"in document.documentElement||(Ja={mouseenter:"mouseover",mouseleave:"mouseout"}));var ts=[null];or.prototype=ar.prototype={constructor:or,select:Ne,selectAll:Oe,filter:Fe,data:qe,enter:Ue,exit:je,join:Be,merge:Ye,order:We,sort:Ge,call:Ke,nodes:Xe,node:Ze,size:Qe,empty:Je,each:ni,attr:si,style:hi,property:bi,classed:_i,text:Ni,html:Ii,raise:Ri,lower:$i,append:Pi,insert:zi,remove:ji,clone:Wi,datum:Gi,on:Ji,dispatch:rr},br.prototype.on=function(){var n=this._.on.apply(this._,arguments);return n===this._?this:n};const es=Or("d-slider","\n\n\n
-`;
- }
-
- // Copyright 2018 The Distill Template Authors
-
- function Byline(dom, data) {
- const byline = dom.querySelector('d-byline');
- if (byline) {
- byline.innerHTML = bylineTemplate(data);
- }
- }
-
- // Copyright 2018 The Distill Template Authors
- //
- // Licensed under the Apache License, Version 2.0 (the "License");
- // you may not use this file except in compliance with the License.
- // You may obtain a copy of the License at
- //
- // http://www.apache.org/licenses/LICENSE-2.0
- //
- // Unless required by applicable law or agreed to in writing, software
- // distributed under the License is distributed on an "AS IS" BASIS,
- // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- // See the License for the specific language governing permissions and
- // limitations under the License.
-
- // no appendix -> add appendix
- // title in front, no h1 -> add it
- // no title in front, h1 -> read and put into frontMatter
- // footnote -> footnote list
- // break up bib
- // if citation, no bib-list -> add citation-list
-
- // if authors, no byline -> add byline
-
- function OptionalComponents(dom, data) {
- const body = dom.body;
- const article = body.querySelector('d-article');
-
- // If we don't have an article tag, something weird is going on—giving up.
- if (!article) {
- console.warn('No d-article tag found; skipping adding optional components!');
- return;
- }
-
- let byline = dom.querySelector('d-byline');
- if (!byline) {
- if (data.authors) {
- byline = dom.createElement('d-byline');
- body.insertBefore(byline, article);
- } else {
- console.warn('No authors found in front matter; please add them before submission!');
- }
- }
-
- let title = dom.querySelector('d-title');
- if (!title) {
- title = dom.createElement('d-title');
- body.insertBefore(title, byline);
- }
-
- let h1 = title.querySelector('h1');
- if (!h1) {
- h1 = dom.createElement('h1');
- h1.textContent = data.title;
- title.insertBefore(h1, title.firstChild);
- }
-
- const hasPassword = typeof data.password !== 'undefined';
- let interstitial = body.querySelector('d-interstitial');
- if (hasPassword && !interstitial) {
- const inBrowser = typeof window !== 'undefined';
- const onLocalhost = inBrowser && window.location.hostname.includes('localhost');
- if (!inBrowser || !onLocalhost) {
- interstitial = dom.createElement('d-interstitial');
- interstitial.password = data.password;
- body.insertBefore(interstitial, body.firstChild);
- }
- } else if (!hasPassword && interstitial) {
- interstitial.parentElement.removeChild(this);
- }
-
- let appendix = dom.querySelector('d-appendix');
- if (!appendix) {
- appendix = dom.createElement('d-appendix');
- dom.body.appendChild(appendix);
- }
-
- let footnoteList = dom.querySelector('d-footnote-list');
- if (!footnoteList) {
- footnoteList = dom.createElement('d-footnote-list');
- appendix.appendChild(footnoteList);
- }
-
- let citationList = dom.querySelector('d-citation-list');
- if (!citationList) {
- citationList = dom.createElement('d-citation-list');
- appendix.appendChild(citationList);
- }
-
- }
-
- var katex$1 = createCommonjsModule(function (module, exports) {
- (function(f){{module.exports=f();}})(function(){return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof commonjsRequire=="function"&&commonjsRequire;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 commonjsRequire=="function"&&commonjsRequire;for(var o=0;o= 0; --i) {
- tok = expansion[i];
- if (tok.text === "#") {
- if (i === 0) {
- throw new _ParseError2.default("Incomplete placeholder at end of macro body", tok);
- }
- tok = expansion[--i]; // next token on stack
- if (tok.text === "#") {
- // ## → #
- expansion.splice(i + 1, 1); // drop first #
- } else if (/^[1-9]$/.test(tok.text)) {
- // expansion.splice(i, 2, arg[0], arg[1], …)
- // to replace placeholder with the indicated argument.
- // TODO: use spread once we move to ES2015
- expansion.splice.apply(expansion, [i, 2].concat(args[tok.text - 1]));
- } else {
- throw new _ParseError2.default("Not a valid argument number", tok);
- }
- }
- }
- }
- this.stack = this.stack.concat(expansion);
- }
- }
- }, {
- key: "get",
- value: function get(ignoreSpace) {
- this.discardedWhiteSpace = [];
- var token = this.nextToken();
- if (ignoreSpace) {
- while (token.text === " ") {
- this.discardedWhiteSpace.push(token);
- token = this.nextToken();
- }
- }
- return token;
- }
-
- /**
- * Undo the effect of the preceding call to the get method.
- * A call to this method MUST be immediately preceded and immediately followed
- * by a call to get. Only used during mode switching, i.e. after one token
- * was got in the old mode but should get got again in a new mode
- * with possibly different whitespace handling.
- */
-
- }, {
- key: "unget",
- value: function unget(token) {
- this.stack.push(token);
- while (this.discardedWhiteSpace.length !== 0) {
- this.stack.push(this.discardedWhiteSpace.pop());
- }
- }
- }]);
- return MacroExpander;
- }();
-
- module.exports = MacroExpander;
-
- },{"./Lexer":26,"./ParseError":29,"./macros":44,"babel-runtime/helpers/classCallCheck":4,"babel-runtime/helpers/createClass":5,"object-assign":25}],28:[function(require,module,exports){
-
- var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
-
- var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
-
- var _createClass2 = require("babel-runtime/helpers/createClass");
-
- var _createClass3 = _interopRequireDefault(_createClass2);
-
- var _fontMetrics2 = require("./fontMetrics");
-
- var _fontMetrics3 = _interopRequireDefault(_fontMetrics2);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- var BASESIZE = 6; /**
- * This file contains information about the options that the Parser carries
- * around with it while parsing. Data is held in an `Options` object, and when
- * recursing, a new `Options` object can be created with the `.with*` and
- * `.reset` functions.
- */
-
- var sizeStyleMap = [
- // Each element contains [textsize, scriptsize, scriptscriptsize].
- // The size mappings are taken from TeX with \normalsize=10pt.
- [1, 1, 1], // size1: [5, 5, 5] \tiny
- [2, 1, 1], // size2: [6, 5, 5]
- [3, 1, 1], // size3: [7, 5, 5] \scriptsize
- [4, 2, 1], // size4: [8, 6, 5] \footnotesize
- [5, 2, 1], // size5: [9, 6, 5] \small
- [6, 3, 1], // size6: [10, 7, 5] \normalsize
- [7, 4, 2], // size7: [12, 8, 6] \large
- [8, 6, 3], // size8: [14.4, 10, 7] \Large
- [9, 7, 6], // size9: [17.28, 12, 10] \LARGE
- [10, 8, 7], // size10: [20.74, 14.4, 12] \huge
- [11, 10, 9]];
-
- var sizeMultipliers = [
- // fontMetrics.js:getFontMetrics also uses size indexes, so if
- // you change size indexes, change that function.
- 0.5, 0.6, 0.7, 0.8, 0.9, 1.0, 1.2, 1.44, 1.728, 2.074, 2.488];
-
- var sizeAtStyle = function sizeAtStyle(size, style) {
- return style.size < 2 ? size : sizeStyleMap[size - 1][style.size - 1];
- };
-
- /**
- * This is the main options class. It contains the current style, size, color,
- * and font.
- *
- * Options objects should not be modified. To create a new Options with
- * different properties, call a `.having*` method.
- */
-
- var Options = function () {
- function Options(data) {
- (0, _classCallCheck3.default)(this, Options);
-
- this.style = data.style;
- this.color = data.color;
- this.size = data.size || BASESIZE;
- this.textSize = data.textSize || this.size;
- this.phantom = data.phantom;
- this.font = data.font;
- this.sizeMultiplier = sizeMultipliers[this.size - 1];
- this._fontMetrics = null;
- }
-
- /**
- * Returns a new options object with the same properties as "this". Properties
- * from "extension" will be copied to the new options object.
- */
-
-
- (0, _createClass3.default)(Options, [{
- key: "extend",
- value: function extend(extension) {
- var data = {
- style: this.style,
- size: this.size,
- textSize: this.textSize,
- color: this.color,
- phantom: this.phantom,
- font: this.font
- };
-
- for (var key in extension) {
- if (extension.hasOwnProperty(key)) {
- data[key] = extension[key];
- }
- }
-
- return new Options(data);
- }
-
- /**
- * Return an options object with the given style. If `this.style === style`,
- * returns `this`.
- */
-
- }, {
- key: "havingStyle",
- value: function havingStyle(style) {
- if (this.style === style) {
- return this;
- } else {
- return this.extend({
- style: style,
- size: sizeAtStyle(this.textSize, style)
- });
- }
- }
-
- /**
- * Return an options object with a cramped version of the current style. If
- * the current style is cramped, returns `this`.
- */
-
- }, {
- key: "havingCrampedStyle",
- value: function havingCrampedStyle() {
- return this.havingStyle(this.style.cramp());
- }
-
- /**
- * Return an options object with the given size and in at least `\textstyle`.
- * Returns `this` if appropriate.
- */
-
- }, {
- key: "havingSize",
- value: function havingSize(size) {
- if (this.size === size && this.textSize === size) {
- return this;
- } else {
- return this.extend({
- style: this.style.text(),
- size: size,
- textSize: size
- });
- }
- }
-
- /**
- * Like `this.havingSize(BASESIZE).havingStyle(style)`. If `style` is omitted,
- * changes to at least `\textstyle`.
- */
-
- }, {
- key: "havingBaseStyle",
- value: function havingBaseStyle(style) {
- style = style || this.style.text();
- var wantSize = sizeAtStyle(BASESIZE, style);
- if (this.size === wantSize && this.textSize === BASESIZE && this.style === style) {
- return this;
- } else {
- return this.extend({
- style: style,
- size: wantSize,
- baseSize: BASESIZE
- });
- }
- }
-
- /**
- * Create a new options object with the given color.
- */
-
- }, {
- key: "withColor",
- value: function withColor(color) {
- return this.extend({
- color: color
- });
- }
-
- /**
- * Create a new options object with "phantom" set to true.
- */
-
- }, {
- key: "withPhantom",
- value: function withPhantom() {
- return this.extend({
- phantom: true
- });
- }
-
- /**
- * Create a new options objects with the give font.
- */
-
- }, {
- key: "withFont",
- value: function withFont(font) {
- return this.extend({
- font: font || this.font
- });
- }
-
- /**
- * Return the CSS sizing classes required to switch from enclosing options
- * `oldOptions` to `this`. Returns an array of classes.
- */
-
- }, {
- key: "sizingClasses",
- value: function sizingClasses(oldOptions) {
- if (oldOptions.size !== this.size) {
- return ["sizing", "reset-size" + oldOptions.size, "size" + this.size];
- } else {
- return [];
- }
- }
-
- /**
- * Return the CSS sizing classes required to switch to the base size. Like
- * `this.havingSize(BASESIZE).sizingClasses(this)`.
- */
-
- }, {
- key: "baseSizingClasses",
- value: function baseSizingClasses() {
- if (this.size !== BASESIZE) {
- return ["sizing", "reset-size" + this.size, "size" + BASESIZE];
- } else {
- return [];
- }
- }
-
- /**
- * Return the font metrics for this size.
- */
-
- }, {
- key: "fontMetrics",
- value: function fontMetrics() {
- if (!this._fontMetrics) {
- this._fontMetrics = _fontMetrics3.default.getFontMetrics(this.size);
- }
- return this._fontMetrics;
- }
-
- /**
- * A map of color names to CSS colors.
- * TODO(emily): Remove this when we have real macros
- */
-
- }, {
- key: "getColor",
-
-
- /**
- * Gets the CSS color of the current options object, accounting for the
- * `colorMap`.
- */
- value: function getColor() {
- if (this.phantom) {
- return "transparent";
- } else {
- return Options.colorMap[this.color] || this.color;
- }
- }
- }]);
- return Options;
- }();
-
- /**
- * The base size index.
- */
-
-
- Options.colorMap = {
- "katex-blue": "#6495ed",
- "katex-orange": "#ffa500",
- "katex-pink": "#ff00af",
- "katex-red": "#df0030",
- "katex-green": "#28ae7b",
- "katex-gray": "gray",
- "katex-purple": "#9d38bd",
- "katex-blueA": "#ccfaff",
- "katex-blueB": "#80f6ff",
- "katex-blueC": "#63d9ea",
- "katex-blueD": "#11accd",
- "katex-blueE": "#0c7f99",
- "katex-tealA": "#94fff5",
- "katex-tealB": "#26edd5",
- "katex-tealC": "#01d1c1",
- "katex-tealD": "#01a995",
- "katex-tealE": "#208170",
- "katex-greenA": "#b6ffb0",
- "katex-greenB": "#8af281",
- "katex-greenC": "#74cf70",
- "katex-greenD": "#1fab54",
- "katex-greenE": "#0d923f",
- "katex-goldA": "#ffd0a9",
- "katex-goldB": "#ffbb71",
- "katex-goldC": "#ff9c39",
- "katex-goldD": "#e07d10",
- "katex-goldE": "#a75a05",
- "katex-redA": "#fca9a9",
- "katex-redB": "#ff8482",
- "katex-redC": "#f9685d",
- "katex-redD": "#e84d39",
- "katex-redE": "#bc2612",
- "katex-maroonA": "#ffbde0",
- "katex-maroonB": "#ff92c6",
- "katex-maroonC": "#ed5fa6",
- "katex-maroonD": "#ca337c",
- "katex-maroonE": "#9e034e",
- "katex-purpleA": "#ddd7ff",
- "katex-purpleB": "#c6b9fc",
- "katex-purpleC": "#aa87ff",
- "katex-purpleD": "#7854ab",
- "katex-purpleE": "#543b78",
- "katex-mintA": "#f5f9e8",
- "katex-mintB": "#edf2df",
- "katex-mintC": "#e0e5cc",
- "katex-grayA": "#f6f7f7",
- "katex-grayB": "#f0f1f2",
- "katex-grayC": "#e3e5e6",
- "katex-grayD": "#d6d8da",
- "katex-grayE": "#babec2",
- "katex-grayF": "#888d93",
- "katex-grayG": "#626569",
- "katex-grayH": "#3b3e40",
- "katex-grayI": "#21242c",
- "katex-kaBlue": "#314453",
- "katex-kaGreen": "#71B307"
- };
- Options.BASESIZE = BASESIZE;
-
- module.exports = Options;
-
- },{"./fontMetrics":41,"babel-runtime/helpers/classCallCheck":4,"babel-runtime/helpers/createClass":5}],29:[function(require,module,exports){
-
- var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
-
- var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- /**
- * This is the ParseError class, which is the main error thrown by KaTeX
- * functions when something has gone wrong. This is used to distinguish internal
- * errors from errors in the expression that the user provided.
- *
- * If possible, a caller should provide a Token or ParseNode with information
- * about where in the source string the problem occurred.
- *
- * @param {string} message The error message
- * @param {(Token|ParseNode)=} token An object providing position information
- */
- var ParseError = function ParseError(message, token) {
- (0, _classCallCheck3.default)(this, ParseError);
-
- var error = "KaTeX parse error: " + message;
- var start = void 0;
- var end = void 0;
-
- if (token && token.lexer && token.start <= token.end) {
- // If we have the input and a position, make the error a bit fancier
-
- // Get the input
- var input = token.lexer.input;
-
- // Prepend some information
- start = token.start;
- end = token.end;
- if (start === input.length) {
- error += " at end of input: ";
- } else {
- error += " at position " + (start + 1) + ": ";
- }
-
- // Underline token in question using combining underscores
- var underlined = input.slice(start, end).replace(/[^]/g, "$&\u0332");
-
- // Extract some context from the input and add it to the error
- var left = void 0;
- if (start > 15) {
- left = "…" + input.slice(start - 15, start);
- } else {
- left = input.slice(0, start);
- }
- var right = void 0;
- if (end + 15 < input.length) {
- right = input.slice(end, end + 15) + "…";
- } else {
- right = input.slice(end);
- }
- error += left + underlined + right;
- }
-
- // Some hackery to make ParseError a prototype of Error
- // See http://stackoverflow.com/a/8460753
- var self = new Error(error);
- self.name = "ParseError";
- self.__proto__ = ParseError.prototype;
-
- self.position = start;
- return self;
- };
-
- // More hackery
-
-
- ParseError.prototype.__proto__ = Error.prototype;
-
- module.exports = ParseError;
-
- },{"babel-runtime/helpers/classCallCheck":4}],30:[function(require,module,exports){
-
- Object.defineProperty(exports, "__esModule", {
- value: true
- });
-
- var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
-
- var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- /**
- * The resulting parse tree nodes of the parse tree.
- *
- * It is possible to provide position information, so that a ParseNode can
- * fulfil a role similar to a Token in error reporting.
- * For details on the corresponding properties see Token constructor.
- * Providing such information can lead to better error reporting.
- *
- * @param {string} type type of node, like e.g. "ordgroup"
- * @param {?object} value type-specific representation of the node
- * @param {string} mode parse mode in action for this node,
- * "math" or "text"
- * @param {Token=} firstToken first token of the input for this node,
- * will omit position information if unset
- * @param {Token=} lastToken last token of the input for this node,
- * will default to firstToken if unset
- */
- var ParseNode = function ParseNode(type, value, mode, firstToken, lastToken) {
- (0, _classCallCheck3.default)(this, ParseNode);
-
- this.type = type;
- this.value = value;
- this.mode = mode;
- if (firstToken && (!lastToken || lastToken.lexer === firstToken.lexer)) {
- this.lexer = firstToken.lexer;
- this.start = firstToken.start;
- this.end = (lastToken || firstToken).end;
- }
- };
-
- exports.default = ParseNode;
-
- },{"babel-runtime/helpers/classCallCheck":4}],31:[function(require,module,exports){
-
- var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
-
- var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
-
- var _createClass2 = require("babel-runtime/helpers/createClass");
-
- var _createClass3 = _interopRequireDefault(_createClass2);
-
- var _functions = require("./functions");
-
- var _functions2 = _interopRequireDefault(_functions);
-
- var _environments = require("./environments");
-
- var _environments2 = _interopRequireDefault(_environments);
-
- var _MacroExpander = require("./MacroExpander");
-
- var _MacroExpander2 = _interopRequireDefault(_MacroExpander);
-
- var _symbols = require("./symbols");
-
- var _symbols2 = _interopRequireDefault(_symbols);
-
- var _utils = require("./utils");
-
- var _utils2 = _interopRequireDefault(_utils);
-
- var _units = require("./units");
-
- var _units2 = _interopRequireDefault(_units);
-
- var _unicodeRegexes = require("./unicodeRegexes");
-
- var _ParseNode = require("./ParseNode");
-
- var _ParseNode2 = _interopRequireDefault(_ParseNode);
-
- var _ParseError = require("./ParseError");
-
- var _ParseError2 = _interopRequireDefault(_ParseError);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- /**
- * This file contains the parser used to parse out a TeX expression from the
- * input. Since TeX isn't context-free, standard parsers don't work particularly
- * well.
- *
- * The strategy of this parser is as such:
- *
- * The main functions (the `.parse...` ones) take a position in the current
- * parse string to parse tokens from. The lexer (found in Lexer.js, stored at
- * this.lexer) also supports pulling out tokens at arbitrary places. When
- * individual tokens are needed at a position, the lexer is called to pull out a
- * token, which is then used.
- *
- * The parser has a property called "mode" indicating the mode that
- * the parser is currently in. Currently it has to be one of "math" or
- * "text", which denotes whether the current environment is a math-y
- * one or a text-y one (e.g. inside \text). Currently, this serves to
- * limit the functions which can be used in text mode.
- *
- * The main functions then return an object which contains the useful data that
- * was parsed at its given point, and a new position at the end of the parsed
- * data. The main functions can call each other and continue the parsing by
- * using the returned position as a new starting point.
- *
- * There are also extra `.handle...` functions, which pull out some reused
- * functionality into self-contained functions.
- *
- * The earlier functions return ParseNodes.
- * The later functions (which are called deeper in the parse) sometimes return
- * ParseFuncOrArgument, which contain a ParseNode as well as some data about
- * whether the parsed object is a function which is missing some arguments, or a
- * standalone object which can be used as an argument to another function.
- */
-
- /**
- * An initial function (without its arguments), or an argument to a function.
- * The `result` argument should be a ParseNode.
- */
- function ParseFuncOrArgument(result, isFunction, token) {
- this.result = result;
- // Is this a function (i.e. is it something defined in functions.js)?
- this.isFunction = isFunction;
- this.token = token;
- } /* eslint no-constant-condition:0 */
-
- var Parser = function () {
- function Parser(input, settings) {
- (0, _classCallCheck3.default)(this, Parser);
-
- // Create a new macro expander (gullet) and (indirectly via that) also a
- // new lexer (mouth) for this parser (stomach, in the language of TeX)
- this.gullet = new _MacroExpander2.default(input, settings.macros);
- // Use old \color behavior (same as LaTeX's \textcolor) if requested.
- // We do this after the macros object has been copied by MacroExpander.
- if (settings.colorIsTextColor) {
- this.gullet.macros["\\color"] = "\\textcolor";
- }
- // Store the settings for use in parsing
- this.settings = settings;
- // Count leftright depth (for \middle errors)
- this.leftrightDepth = 0;
- }
-
- /**
- * Checks a result to make sure it has the right type, and throws an
- * appropriate error otherwise.
- *
- * @param {boolean=} consume whether to consume the expected token,
- * defaults to true
- */
-
-
- (0, _createClass3.default)(Parser, [{
- key: "expect",
- value: function expect(text, consume) {
- if (this.nextToken.text !== text) {
- throw new _ParseError2.default("Expected '" + text + "', got '" + this.nextToken.text + "'", this.nextToken);
- }
- if (consume !== false) {
- this.consume();
- }
- }
-
- /**
- * Considers the current look ahead token as consumed,
- * and fetches the one after that as the new look ahead.
- */
-
- }, {
- key: "consume",
- value: function consume() {
- this.nextToken = this.gullet.get(this.mode === "math");
- }
- }, {
- key: "switchMode",
- value: function switchMode(newMode) {
- this.gullet.unget(this.nextToken);
- this.mode = newMode;
- this.consume();
- }
-
- /**
- * Main parsing function, which parses an entire input.
- *
- * @return {?Array.}
- */
-
- }, {
- key: "parse",
- value: function parse() {
- // Try to parse the input
- this.mode = "math";
- this.consume();
- var parse = this.parseInput();
- return parse;
- }
-
- /**
- * Parses an entire input tree.
- */
-
- }, {
- key: "parseInput",
- value: function parseInput() {
- // Parse an expression
- var expression = this.parseExpression(false);
- // If we succeeded, make sure there's an EOF at the end
- this.expect("EOF", false);
- return expression;
- }
- }, {
- key: "parseExpression",
-
-
- /**
- * Parses an "expression", which is a list of atoms.
- *
- * @param {boolean} breakOnInfix Should the parsing stop when we hit infix
- * nodes? This happens when functions have higher precendence
- * than infix nodes in implicit parses.
- *
- * @param {?string} breakOnTokenText The text of the token that the expression
- * should end with, or `null` if something else should end the
- * expression.
- *
- * @return {ParseNode}
- */
- value: function parseExpression(breakOnInfix, breakOnTokenText) {
- var body = [];
- // Keep adding atoms to the body until we can't parse any more atoms (either
- // we reached the end, a }, or a \right)
- while (true) {
- var lex = this.nextToken;
- if (Parser.endOfExpression.indexOf(lex.text) !== -1) {
- break;
- }
- if (breakOnTokenText && lex.text === breakOnTokenText) {
- break;
- }
- if (breakOnInfix && _functions2.default[lex.text] && _functions2.default[lex.text].infix) {
- break;
- }
- var atom = this.parseAtom();
- if (!atom) {
- if (!this.settings.throwOnError && lex.text[0] === "\\") {
- var errorNode = this.handleUnsupportedCmd();
- body.push(errorNode);
- continue;
- }
-
- break;
- }
- body.push(atom);
- }
- return this.handleInfixNodes(body);
- }
-
- /**
- * Rewrites infix operators such as \over with corresponding commands such
- * as \frac.
- *
- * There can only be one infix operator per group. If there's more than one
- * then the expression is ambiguous. This can be resolved by adding {}.
- *
- * @returns {Array}
- */
-
- }, {
- key: "handleInfixNodes",
- value: function handleInfixNodes(body) {
- var overIndex = -1;
- var funcName = void 0;
-
- for (var i = 0; i < body.length; i++) {
- var node = body[i];
- if (node.type === "infix") {
- if (overIndex !== -1) {
- throw new _ParseError2.default("only one infix operator per group", node.value.token);
- }
- overIndex = i;
- funcName = node.value.replaceWith;
- }
- }
-
- if (overIndex !== -1) {
- var numerNode = void 0;
- var denomNode = void 0;
-
- var numerBody = body.slice(0, overIndex);
- var denomBody = body.slice(overIndex + 1);
-
- if (numerBody.length === 1 && numerBody[0].type === "ordgroup") {
- numerNode = numerBody[0];
- } else {
- numerNode = new _ParseNode2.default("ordgroup", numerBody, this.mode);
- }
-
- if (denomBody.length === 1 && denomBody[0].type === "ordgroup") {
- denomNode = denomBody[0];
- } else {
- denomNode = new _ParseNode2.default("ordgroup", denomBody, this.mode);
- }
-
- var value = this.callFunction(funcName, [numerNode, denomNode], null);
- return [new _ParseNode2.default(value.type, value, this.mode)];
- } else {
- return body;
- }
- }
-
- // The greediness of a superscript or subscript
-
- }, {
- key: "handleSupSubscript",
-
-
- /**
- * Handle a subscript or superscript with nice errors.
- */
- value: function handleSupSubscript(name) {
- var symbolToken = this.nextToken;
- var symbol = symbolToken.text;
- this.consume();
- var group = this.parseGroup();
-
- if (!group) {
- if (!this.settings.throwOnError && this.nextToken.text[0] === "\\") {
- return this.handleUnsupportedCmd();
- } else {
- throw new _ParseError2.default("Expected group after '" + symbol + "'", symbolToken);
- }
- } else if (group.isFunction) {
- // ^ and _ have a greediness, so handle interactions with functions'
- // greediness
- var funcGreediness = _functions2.default[group.result].greediness;
- if (funcGreediness > Parser.SUPSUB_GREEDINESS) {
- return this.parseFunction(group);
- } else {
- throw new _ParseError2.default("Got function '" + group.result + "' with no arguments " + "as " + name, symbolToken);
- }
- } else {
- return group.result;
- }
- }
-
- /**
- * Converts the textual input of an unsupported command into a text node
- * contained within a color node whose color is determined by errorColor
- */
-
- }, {
- key: "handleUnsupportedCmd",
- value: function handleUnsupportedCmd() {
- var text = this.nextToken.text;
- var textordArray = [];
-
- for (var i = 0; i < text.length; i++) {
- textordArray.push(new _ParseNode2.default("textord", text[i], "text"));
- }
-
- var textNode = new _ParseNode2.default("text", {
- body: textordArray,
- type: "text"
- }, this.mode);
-
- var colorNode = new _ParseNode2.default("color", {
- color: this.settings.errorColor,
- value: [textNode],
- type: "color"
- }, this.mode);
-
- this.consume();
- return colorNode;
- }
-
- /**
- * Parses a group with optional super/subscripts.
- *
- * @return {?ParseNode}
- */
-
- }, {
- key: "parseAtom",
- value: function parseAtom() {
- // The body of an atom is an implicit group, so that things like
- // \left(x\right)^2 work correctly.
- var base = this.parseImplicitGroup();
-
- // In text mode, we don't have superscripts or subscripts
- if (this.mode === "text") {
- return base;
- }
-
- // Note that base may be empty (i.e. null) at this point.
-
- var superscript = void 0;
- var subscript = void 0;
- while (true) {
- // Lex the first token
- var lex = this.nextToken;
-
- if (lex.text === "\\limits" || lex.text === "\\nolimits") {
- // We got a limit control
- if (!base || base.type !== "op") {
- throw new _ParseError2.default("Limit controls must follow a math operator", lex);
- } else {
- var limits = lex.text === "\\limits";
- base.value.limits = limits;
- base.value.alwaysHandleSupSub = true;
- }
- this.consume();
- } else if (lex.text === "^") {
- // We got a superscript start
- if (superscript) {
- throw new _ParseError2.default("Double superscript", lex);
- }
- superscript = this.handleSupSubscript("superscript");
- } else if (lex.text === "_") {
- // We got a subscript start
- if (subscript) {
- throw new _ParseError2.default("Double subscript", lex);
- }
- subscript = this.handleSupSubscript("subscript");
- } else if (lex.text === "'") {
- // We got a prime
- if (superscript) {
- throw new _ParseError2.default("Double superscript", lex);
- }
- var prime = new _ParseNode2.default("textord", "\\prime", this.mode);
-
- // Many primes can be grouped together, so we handle this here
- var primes = [prime];
- this.consume();
- // Keep lexing tokens until we get something that's not a prime
- while (this.nextToken.text === "'") {
- // For each one, add another prime to the list
- primes.push(prime);
- this.consume();
- }
- // If there's a superscript following the primes, combine that
- // superscript in with the primes.
- if (this.nextToken.text === "^") {
- primes.push(this.handleSupSubscript("superscript"));
- }
- // Put everything into an ordgroup as the superscript
- superscript = new _ParseNode2.default("ordgroup", primes, this.mode);
- } else {
- // If it wasn't ^, _, or ', stop parsing super/subscripts
- break;
- }
- }
-
- if (superscript || subscript) {
- // If we got either a superscript or subscript, create a supsub
- return new _ParseNode2.default("supsub", {
- base: base,
- sup: superscript,
- sub: subscript
- }, this.mode);
- } else {
- // Otherwise return the original body
- return base;
- }
- }
-
- // A list of the size-changing functions, for use in parseImplicitGroup
-
-
- // A list of the style-changing functions, for use in parseImplicitGroup
-
-
- // Old font functions
-
- }, {
- key: "parseImplicitGroup",
-
-
- /**
- * Parses an implicit group, which is a group that starts at the end of a
- * specified, and ends right before a higher explicit group ends, or at EOL. It
- * is used for functions that appear to affect the current style, like \Large or
- * \textrm, where instead of keeping a style we just pretend that there is an
- * implicit grouping after it until the end of the group. E.g.
- * small text {\Large large text} small text again
- * It is also used for \left and \right to get the correct grouping.
- *
- * @return {?ParseNode}
- */
- value: function parseImplicitGroup() {
- var start = this.parseSymbol();
-
- if (start == null) {
- // If we didn't get anything we handle, fall back to parseFunction
- return this.parseFunction();
- }
-
- var func = start.result;
-
- if (func === "\\left") {
- // If we see a left:
- // Parse the entire left function (including the delimiter)
- var left = this.parseFunction(start);
- // Parse out the implicit body
- ++this.leftrightDepth;
- var body = this.parseExpression(false);
- --this.leftrightDepth;
- // Check the next token
- this.expect("\\right", false);
- var right = this.parseFunction();
- return new _ParseNode2.default("leftright", {
- body: body,
- left: left.value.value,
- right: right.value.value
- }, this.mode);
- } else if (func === "\\begin") {
- // begin...end is similar to left...right
- var begin = this.parseFunction(start);
- var envName = begin.value.name;
- if (!_environments2.default.hasOwnProperty(envName)) {
- throw new _ParseError2.default("No such environment: " + envName, begin.value.nameGroup);
- }
- // Build the environment object. Arguments and other information will
- // be made available to the begin and end methods using properties.
- var env = _environments2.default[envName];
- var args = this.parseArguments("\\begin{" + envName + "}", env);
- var context = {
- mode: this.mode,
- envName: envName,
- parser: this,
- positions: args.pop()
- };
- var result = env.handler(context, args);
- this.expect("\\end", false);
- var endNameToken = this.nextToken;
- var end = this.parseFunction();
- if (end.value.name !== envName) {
- throw new _ParseError2.default("Mismatch: \\begin{" + envName + "} matched " + "by \\end{" + end.value.name + "}", endNameToken);
- }
- result.position = end.position;
- return result;
- } else if (_utils2.default.contains(Parser.sizeFuncs, func)) {
- // If we see a sizing function, parse out the implicit body
- this.consumeSpaces();
- var _body = this.parseExpression(false);
- return new _ParseNode2.default("sizing", {
- // Figure out what size to use based on the list of functions above
- size: _utils2.default.indexOf(Parser.sizeFuncs, func) + 1,
- value: _body
- }, this.mode);
- } else if (_utils2.default.contains(Parser.styleFuncs, func)) {
- // If we see a styling function, parse out the implicit body
- this.consumeSpaces();
- var _body2 = this.parseExpression(true);
- return new _ParseNode2.default("styling", {
- // Figure out what style to use by pulling out the style from
- // the function name
- style: func.slice(1, func.length - 5),
- value: _body2
- }, this.mode);
- } else if (func in Parser.oldFontFuncs) {
- var style = Parser.oldFontFuncs[func];
- // If we see an old font function, parse out the implicit body
- this.consumeSpaces();
- var _body3 = this.parseExpression(true);
- if (style.slice(0, 4) === 'text') {
- return new _ParseNode2.default("text", {
- style: style,
- body: new _ParseNode2.default("ordgroup", _body3, this.mode)
- }, this.mode);
- } else {
- return new _ParseNode2.default("font", {
- font: style,
- body: new _ParseNode2.default("ordgroup", _body3, this.mode)
- }, this.mode);
- }
- } else if (func === "\\color") {
- // If we see a styling function, parse out the implicit body
- var color = this.parseColorGroup(false);
- if (!color) {
- throw new _ParseError2.default("\\color not followed by color");
- }
- var _body4 = this.parseExpression(true);
- return new _ParseNode2.default("color", {
- type: "color",
- color: color.result.value,
- value: _body4
- }, this.mode);
- } else if (func === "$") {
- if (this.mode === "math") {
- throw new _ParseError2.default("$ within math mode");
- }
- this.consume();
- var outerMode = this.mode;
- this.switchMode("math");
- var _body5 = this.parseExpression(false, "$");
- this.expect("$", true);
- this.switchMode(outerMode);
- return new _ParseNode2.default("styling", {
- style: "text",
- value: _body5
- }, "math");
- } else {
- // Defer to parseFunction if it's not a function we handle
- return this.parseFunction(start);
- }
- }
-
- /**
- * Parses an entire function, including its base and all of its arguments.
- * The base might either have been parsed already, in which case
- * it is provided as an argument, or it's the next group in the input.
- *
- * @param {ParseFuncOrArgument=} baseGroup optional as described above
- * @return {?ParseNode}
- */
-
- }, {
- key: "parseFunction",
- value: function parseFunction(baseGroup) {
- if (!baseGroup) {
- baseGroup = this.parseGroup();
- }
-
- if (baseGroup) {
- if (baseGroup.isFunction) {
- var func = baseGroup.result;
- var funcData = _functions2.default[func];
- if (this.mode === "text" && !funcData.allowedInText) {
- throw new _ParseError2.default("Can't use function '" + func + "' in text mode", baseGroup.token);
- } else if (this.mode === "math" && funcData.allowedInMath === false) {
- throw new _ParseError2.default("Can't use function '" + func + "' in math mode", baseGroup.token);
- }
-
- var args = this.parseArguments(func, funcData);
- var token = baseGroup.token;
- var result = this.callFunction(func, args, args.pop(), token);
- return new _ParseNode2.default(result.type, result, this.mode);
- } else {
- return baseGroup.result;
- }
- } else {
- return null;
- }
- }
-
- /**
- * Call a function handler with a suitable context and arguments.
- */
-
- }, {
- key: "callFunction",
- value: function callFunction(name, args, positions, token) {
- var context = {
- funcName: name,
- parser: this,
- positions: positions,
- token: token
- };
- return _functions2.default[name].handler(context, args);
- }
-
- /**
- * Parses the arguments of a function or environment
- *
- * @param {string} func "\name" or "\begin{name}"
- * @param {{numArgs:number,numOptionalArgs:number|undefined}} funcData
- * @return the array of arguments, with the list of positions as last element
- */
-
- }, {
- key: "parseArguments",
- value: function parseArguments(func, funcData) {
- var totalArgs = funcData.numArgs + funcData.numOptionalArgs;
- if (totalArgs === 0) {
- return [[this.pos]];
- }
-
- var baseGreediness = funcData.greediness;
- var positions = [this.pos];
- var args = [];
-
- for (var i = 0; i < totalArgs; i++) {
- var nextToken = this.nextToken;
- var argType = funcData.argTypes && funcData.argTypes[i];
- var arg = void 0;
- if (i < funcData.numOptionalArgs) {
- if (argType) {
- arg = this.parseGroupOfType(argType, true);
- } else {
- arg = this.parseGroup(true);
- }
- if (!arg) {
- args.push(null);
- positions.push(this.pos);
- continue;
- }
- } else {
- if (argType) {
- arg = this.parseGroupOfType(argType);
- } else {
- arg = this.parseGroup();
- }
- if (!arg) {
- if (!this.settings.throwOnError && this.nextToken.text[0] === "\\") {
- arg = new ParseFuncOrArgument(this.handleUnsupportedCmd(this.nextToken.text), false);
- } else {
- throw new _ParseError2.default("Expected group after '" + func + "'", nextToken);
- }
- }
- }
- var argNode = void 0;
- if (arg.isFunction) {
- var argGreediness = _functions2.default[arg.result].greediness;
- if (argGreediness > baseGreediness) {
- argNode = this.parseFunction(arg);
- } else {
- throw new _ParseError2.default("Got function '" + arg.result + "' as " + "argument to '" + func + "'", nextToken);
- }
- } else {
- argNode = arg.result;
- }
- args.push(argNode);
- positions.push(this.pos);
- }
-
- args.push(positions);
-
- return args;
- }
-
- /**
- * Parses a group when the mode is changing.
- *
- * @return {?ParseFuncOrArgument}
- */
-
- }, {
- key: "parseGroupOfType",
- value: function parseGroupOfType(innerMode, optional) {
- var outerMode = this.mode;
- // Handle `original` argTypes
- if (innerMode === "original") {
- innerMode = outerMode;
- }
-
- if (innerMode === "color") {
- return this.parseColorGroup(optional);
- }
- if (innerMode === "size") {
- return this.parseSizeGroup(optional);
- }
-
- this.switchMode(innerMode);
- if (innerMode === "text") {
- // text mode is special because it should ignore the whitespace before
- // it
- this.consumeSpaces();
- }
- // By the time we get here, innerMode is one of "text" or "math".
- // We switch the mode of the parser, recurse, then restore the old mode.
- var res = this.parseGroup(optional);
- this.switchMode(outerMode);
- return res;
- }
- }, {
- key: "consumeSpaces",
- value: function consumeSpaces() {
- while (this.nextToken.text === " ") {
- this.consume();
- }
- }
-
- /**
- * Parses a group, essentially returning the string formed by the
- * brace-enclosed tokens plus some position information.
- *
- * @param {string} modeName Used to describe the mode in error messages
- * @param {boolean=} optional Whether the group is optional or required
- */
-
- }, {
- key: "parseStringGroup",
- value: function parseStringGroup(modeName, optional) {
- if (optional && this.nextToken.text !== "[") {
- return null;
- }
- var outerMode = this.mode;
- this.mode = "text";
- this.expect(optional ? "[" : "{");
- var str = "";
- var firstToken = this.nextToken;
- var lastToken = firstToken;
- while (this.nextToken.text !== (optional ? "]" : "}")) {
- if (this.nextToken.text === "EOF") {
- throw new _ParseError2.default("Unexpected end of input in " + modeName, firstToken.range(this.nextToken, str));
- }
- lastToken = this.nextToken;
- str += lastToken.text;
- this.consume();
- }
- this.mode = outerMode;
- this.expect(optional ? "]" : "}");
- return firstToken.range(lastToken, str);
- }
-
- /**
- * Parses a regex-delimited group: the largest sequence of tokens
- * whose concatenated strings match `regex`. Returns the string
- * formed by the tokens plus some position information.
- *
- * @param {RegExp} regex
- * @param {string} modeName Used to describe the mode in error messages
- */
-
- }, {
- key: "parseRegexGroup",
- value: function parseRegexGroup(regex, modeName) {
- var outerMode = this.mode;
- this.mode = "text";
- var firstToken = this.nextToken;
- var lastToken = firstToken;
- var str = "";
- while (this.nextToken.text !== "EOF" && regex.test(str + this.nextToken.text)) {
- lastToken = this.nextToken;
- str += lastToken.text;
- this.consume();
- }
- if (str === "") {
- throw new _ParseError2.default("Invalid " + modeName + ": '" + firstToken.text + "'", firstToken);
- }
- this.mode = outerMode;
- return firstToken.range(lastToken, str);
- }
-
- /**
- * Parses a color description.
- */
-
- }, {
- key: "parseColorGroup",
- value: function parseColorGroup(optional) {
- var res = this.parseStringGroup("color", optional);
- if (!res) {
- return null;
- }
- var match = /^(#[a-z0-9]+|[a-z]+)$/i.exec(res.text);
- if (!match) {
- throw new _ParseError2.default("Invalid color: '" + res.text + "'", res);
- }
- return new ParseFuncOrArgument(new _ParseNode2.default("color", match[0], this.mode), false);
- }
-
- /**
- * Parses a size specification, consisting of magnitude and unit.
- */
-
- }, {
- key: "parseSizeGroup",
- value: function parseSizeGroup(optional) {
- var res = void 0;
- if (!optional && this.nextToken.text !== "{") {
- res = this.parseRegexGroup(/^[-+]? *(?:$|\d+|\d+\.\d*|\.\d*) *[a-z]{0,2} *$/, "size");
- } else {
- res = this.parseStringGroup("size", optional);
- }
- if (!res) {
- return null;
- }
- var match = /([-+]?) *(\d+(?:\.\d*)?|\.\d+) *([a-z]{2})/.exec(res.text);
- if (!match) {
- throw new _ParseError2.default("Invalid size: '" + res.text + "'", res);
- }
- var data = {
- number: +(match[1] + match[2]), // sign + magnitude, cast to number
- unit: match[3]
- };
- if (!_units2.default.validUnit(data)) {
- throw new _ParseError2.default("Invalid unit: '" + data.unit + "'", res);
- }
- return new ParseFuncOrArgument(new _ParseNode2.default("size", data, this.mode), false);
- }
-
- /**
- * If the argument is false or absent, this parses an ordinary group,
- * which is either a single nucleus (like "x") or an expression
- * in braces (like "{x+y}").
- * If the argument is true, it parses either a bracket-delimited expression
- * (like "[x+y]") or returns null to indicate the absence of a
- * bracket-enclosed group.
- *
- * @param {boolean=} optional Whether the group is optional or required
- * @return {?ParseFuncOrArgument}
- */
-
- }, {
- key: "parseGroup",
- value: function parseGroup(optional) {
- var firstToken = this.nextToken;
- // Try to parse an open brace
- if (this.nextToken.text === (optional ? "[" : "{")) {
- // If we get a brace, parse an expression
- this.consume();
- var expression = this.parseExpression(false, optional ? "]" : null);
- var lastToken = this.nextToken;
- // Make sure we get a close brace
- this.expect(optional ? "]" : "}");
- if (this.mode === "text") {
- this.formLigatures(expression);
- }
- return new ParseFuncOrArgument(new _ParseNode2.default("ordgroup", expression, this.mode, firstToken, lastToken), false);
- } else {
- // Otherwise, just return a nucleus, or nothing for an optional group
- return optional ? null : this.parseSymbol();
- }
- }
-
- /**
- * Form ligature-like combinations of characters for text mode.
- * This includes inputs like "--", "---", "``" and "''".
- * The result will simply replace multiple textord nodes with a single
- * character in each value by a single textord node having multiple
- * characters in its value. The representation is still ASCII source.
- *
- * @param {Array.} group the nodes of this group,
- * list will be moified in place
- */
-
- }, {
- key: "formLigatures",
- value: function formLigatures(group) {
- var n = group.length - 1;
- for (var i = 0; i < n; ++i) {
- var a = group[i];
- var v = a.value;
- if (v === "-" && group[i + 1].value === "-") {
- if (i + 1 < n && group[i + 2].value === "-") {
- group.splice(i, 3, new _ParseNode2.default("textord", "---", "text", a, group[i + 2]));
- n -= 2;
- } else {
- group.splice(i, 2, new _ParseNode2.default("textord", "--", "text", a, group[i + 1]));
- n -= 1;
- }
- }
- if ((v === "'" || v === "`") && group[i + 1].value === v) {
- group.splice(i, 2, new _ParseNode2.default("textord", v + v, "text", a, group[i + 1]));
- n -= 1;
- }
- }
- }
-
- /**
- * Parse a single symbol out of the string. Here, we handle both the functions
- * we have defined, as well as the single character symbols
- *
- * @return {?ParseFuncOrArgument}
- */
-
- }, {
- key: "parseSymbol",
- value: function parseSymbol() {
- var nucleus = this.nextToken;
-
- if (_functions2.default[nucleus.text]) {
- this.consume();
- // If there exists a function with this name, we return the function and
- // say that it is a function.
- return new ParseFuncOrArgument(nucleus.text, true, nucleus);
- } else if (_symbols2.default[this.mode][nucleus.text]) {
- this.consume();
- // Otherwise if this is a no-argument function, find the type it
- // corresponds to in the symbols map
- return new ParseFuncOrArgument(new _ParseNode2.default(_symbols2.default[this.mode][nucleus.text].group, nucleus.text, this.mode, nucleus), false, nucleus);
- } else if (this.mode === "text" && _unicodeRegexes.cjkRegex.test(nucleus.text)) {
- this.consume();
- return new ParseFuncOrArgument(new _ParseNode2.default("textord", nucleus.text, this.mode, nucleus), false, nucleus);
- } else if (nucleus.text === "$") {
- return new ParseFuncOrArgument(nucleus.text, false, nucleus);
- } else {
- return null;
- }
- }
- }]);
- return Parser;
- }();
-
- Parser.endOfExpression = ["}", "\\end", "\\right", "&", "\\\\", "\\cr"];
- Parser.SUPSUB_GREEDINESS = 1;
- Parser.sizeFuncs = ["\\tiny", "\\sixptsize", "\\scriptsize", "\\footnotesize", "\\small", "\\normalsize", "\\large", "\\Large", "\\LARGE", "\\huge", "\\Huge"];
- Parser.styleFuncs = ["\\displaystyle", "\\textstyle", "\\scriptstyle", "\\scriptscriptstyle"];
- Parser.oldFontFuncs = {
- "\\rm": "mathrm",
- "\\sf": "mathsf",
- "\\tt": "mathtt",
- "\\bf": "mathbf",
- "\\it": "mathit"
- };
-
-
- Parser.prototype.ParseNode = _ParseNode2.default;
-
- module.exports = Parser;
-
- },{"./MacroExpander":27,"./ParseError":29,"./ParseNode":30,"./environments":40,"./functions":43,"./symbols":48,"./unicodeRegexes":49,"./units":50,"./utils":51,"babel-runtime/helpers/classCallCheck":4,"babel-runtime/helpers/createClass":5}],32:[function(require,module,exports){
-
- var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
-
- var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
-
- var _utils = require("./utils");
-
- var _utils2 = _interopRequireDefault(_utils);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- /**
- * The main Settings object
- *
- * The current options stored are:
- * - displayMode: Whether the expression should be typeset as inline math
- * (false, the default), meaning that the math starts in
- * \textstyle and is placed in an inline-block); or as display
- * math (true), meaning that the math starts in \displaystyle
- * and is placed in a block with vertical margin.
- */
- var Settings = function Settings(options) {
- (0, _classCallCheck3.default)(this, Settings);
-
- // allow null options
- options = options || {};
- this.displayMode = _utils2.default.deflt(options.displayMode, false);
- this.throwOnError = _utils2.default.deflt(options.throwOnError, true);
- this.errorColor = _utils2.default.deflt(options.errorColor, "#cc0000");
- this.macros = options.macros || {};
- this.colorIsTextColor = _utils2.default.deflt(options.colorIsTextColor, false);
- }; /**
- * This is a module for storing settings passed into KaTeX. It correctly handles
- * default settings.
- */
-
- module.exports = Settings;
-
- },{"./utils":51,"babel-runtime/helpers/classCallCheck":4}],33:[function(require,module,exports){
-
- var _classCallCheck2 = require("babel-runtime/helpers/classCallCheck");
-
- var _classCallCheck3 = _interopRequireDefault(_classCallCheck2);
-
- var _createClass2 = require("babel-runtime/helpers/createClass");
-
- var _createClass3 = _interopRequireDefault(_createClass2);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- /**
- * This file contains information and classes for the various kinds of styles
- * used in TeX. It provides a generic `Style` class, which holds information
- * about a specific style. It then provides instances of all the different kinds
- * of styles possible, and provides functions to move between them and get
- * information about them.
- */
-
- /**
- * The main style class. Contains a unique id for the style, a size (which is
- * the same for cramped and uncramped version of a style), and a cramped flag.
- */
- var Style = function () {
- function Style(id, size, cramped) {
- (0, _classCallCheck3.default)(this, Style);
-
- this.id = id;
- this.size = size;
- this.cramped = cramped;
- }
-
- /**
- * Get the style of a superscript given a base in the current style.
- */
-
-
- (0, _createClass3.default)(Style, [{
- key: "sup",
- value: function sup() {
- return styles[_sup[this.id]];
- }
-
- /**
- * Get the style of a subscript given a base in the current style.
- */
-
- }, {
- key: "sub",
- value: function sub() {
- return styles[_sub[this.id]];
- }
-
- /**
- * Get the style of a fraction numerator given the fraction in the current
- * style.
- */
-
- }, {
- key: "fracNum",
- value: function fracNum() {
- return styles[_fracNum[this.id]];
- }
-
- /**
- * Get the style of a fraction denominator given the fraction in the current
- * style.
- */
-
- }, {
- key: "fracDen",
- value: function fracDen() {
- return styles[_fracDen[this.id]];
- }
-
- /**
- * Get the cramped version of a style (in particular, cramping a cramped style
- * doesn't change the style).
- */
-
- }, {
- key: "cramp",
- value: function cramp() {
- return styles[_cramp[this.id]];
- }
-
- /**
- * Get a text or display version of this style.
- */
-
- }, {
- key: "text",
- value: function text() {
- return styles[_text[this.id]];
- }
-
- /**
- * Return if this style is tightly spaced (scriptstyle/scriptscriptstyle)
- */
-
- }, {
- key: "isTight",
- value: function isTight() {
- return this.size >= 2;
- }
- }]);
- return Style;
- }();
-
- // IDs of the different styles
-
-
- var D = 0;
- var Dc = 1;
- var T = 2;
- var Tc = 3;
- var S = 4;
- var Sc = 5;
- var SS = 6;
- var SSc = 7;
-
- // Instances of the different styles
- var styles = [new Style(D, 0, false), new Style(Dc, 0, true), new Style(T, 1, false), new Style(Tc, 1, true), new Style(S, 2, false), new Style(Sc, 2, true), new Style(SS, 3, false), new Style(SSc, 3, true)];
-
- // Lookup tables for switching from one style to another
- var _sup = [S, Sc, S, Sc, SS, SSc, SS, SSc];
- var _sub = [Sc, Sc, Sc, Sc, SSc, SSc, SSc, SSc];
- var _fracNum = [T, Tc, S, Sc, SS, SSc, SS, SSc];
- var _fracDen = [Tc, Tc, Sc, Sc, SSc, SSc, SSc, SSc];
- var _cramp = [Dc, Dc, Tc, Tc, Sc, Sc, SSc, SSc];
- var _text = [D, Dc, T, Tc, T, Tc, T, Tc];
-
- // We only export some of the styles. Also, we don't export the `Style` class so
- // no more styles can be generated.
- module.exports = {
- DISPLAY: styles[D],
- TEXT: styles[T],
- SCRIPT: styles[S],
- SCRIPTSCRIPT: styles[SS]
- };
-
- },{"babel-runtime/helpers/classCallCheck":4,"babel-runtime/helpers/createClass":5}],34:[function(require,module,exports){
-
- var _domTree = require("./domTree");
-
- var _domTree2 = _interopRequireDefault(_domTree);
-
- var _fontMetrics = require("./fontMetrics");
-
- var _fontMetrics2 = _interopRequireDefault(_fontMetrics);
-
- var _symbols = require("./symbols");
-
- var _symbols2 = _interopRequireDefault(_symbols);
-
- var _utils = require("./utils");
-
- var _utils2 = _interopRequireDefault(_utils);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- // The following have to be loaded from Main-Italic font, using class mainit
- /* eslint no-console:0 */
- /**
- * This module contains general functions that can be used for building
- * different kinds of domTree nodes in a consistent manner.
- */
-
- var mainitLetters = ["\\imath", // dotless i
- "\\jmath", // dotless j
- "\\pounds"];
-
- /**
- * Looks up the given symbol in fontMetrics, after applying any symbol
- * replacements defined in symbol.js
- */
- var lookupSymbol = function lookupSymbol(value, fontFamily, mode) {
- // Replace the value with its replaced value from symbol.js
- if (_symbols2.default[mode][value] && _symbols2.default[mode][value].replace) {
- value = _symbols2.default[mode][value].replace;
- }
- return {
- value: value,
- metrics: _fontMetrics2.default.getCharacterMetrics(value, fontFamily)
- };
- };
-
- /**
- * Makes a symbolNode after translation via the list of symbols in symbols.js.
- * Correctly pulls out metrics for the character, and optionally takes a list of
- * classes to be attached to the node.
- *
- * TODO: make argument order closer to makeSpan
- * TODO: add a separate argument for math class (e.g. `mop`, `mbin`), which
- * should if present come first in `classes`.
- */
- var makeSymbol = function makeSymbol(value, fontFamily, mode, options, classes) {
- var lookup = lookupSymbol(value, fontFamily, mode);
- var metrics = lookup.metrics;
- value = lookup.value;
-
- var symbolNode = void 0;
- if (metrics) {
- var italic = metrics.italic;
- if (mode === "text") {
- italic = 0;
- }
- symbolNode = new _domTree2.default.symbolNode(value, metrics.height, metrics.depth, italic, metrics.skew, classes);
- } else {
- // TODO(emily): Figure out a good way to only print this in development
- typeof console !== "undefined" && console.warn("No character metrics for '" + value + "' in style '" + fontFamily + "'");
- symbolNode = new _domTree2.default.symbolNode(value, 0, 0, 0, 0, classes);
- }
-
- if (options) {
- symbolNode.maxFontSize = options.sizeMultiplier;
- if (options.style.isTight()) {
- symbolNode.classes.push("mtight");
- }
- if (options.getColor()) {
- symbolNode.style.color = options.getColor();
- }
- }
-
- return symbolNode;
- };
-
- /**
- * Makes a symbol in Main-Regular or AMS-Regular.
- * Used for rel, bin, open, close, inner, and punct.
- */
- var mathsym = function mathsym(value, mode, options, classes) {
- // Decide what font to render the symbol in by its entry in the symbols
- // table.
- // Have a special case for when the value = \ because the \ is used as a
- // textord in unsupported command errors but cannot be parsed as a regular
- // text ordinal and is therefore not present as a symbol in the symbols
- // table for text
- if (value === "\\" || _symbols2.default[mode][value].font === "main") {
- return makeSymbol(value, "Main-Regular", mode, options, classes);
- } else {
- return makeSymbol(value, "AMS-Regular", mode, options, classes.concat(["amsrm"]));
- }
- };
-
- /**
- * Makes a symbol in the default font for mathords and textords.
- */
- var mathDefault = function mathDefault(value, mode, options, classes, type) {
- if (type === "mathord") {
- var fontLookup = mathit(value);
- return makeSymbol(value, fontLookup.fontName, mode, options, classes.concat([fontLookup.fontClass]));
- } else if (type === "textord") {
- var font = _symbols2.default[mode][value] && _symbols2.default[mode][value].font;
- if (font === "ams") {
- return makeSymbol(value, "AMS-Regular", mode, options, classes.concat(["amsrm"]));
- } else {
- // if (font === "main") {
- return makeSymbol(value, "Main-Regular", mode, options, classes.concat(["mathrm"]));
- }
- } else {
- throw new Error("unexpected type: " + type + " in mathDefault");
- }
- };
-
- /**
- * Determines which of the two font names (Main-Italic and Math-Italic) and
- * corresponding style tags (mainit or mathit) to use for font "mathit",
- * depending on the symbol. Use this function instead of fontMap for font
- * "mathit".
- */
- var mathit = function mathit(value, mode, options, classes) {
- if (/[0-9]/.test(value.charAt(0)) ||
- // glyphs for \imath and \jmath do not exist in Math-Italic so we
- // need to use Main-Italic instead
- _utils2.default.contains(mainitLetters, value)) {
- return {
- fontName: "Main-Italic",
- fontClass: "mainit"
- };
- } else {
- return {
- fontName: "Math-Italic",
- fontClass: "mathit"
- };
- }
- };
-
- /**
- * Makes either a mathord or textord in the correct font and color.
- */
- var makeOrd = function makeOrd(group, options, type) {
- var mode = group.mode;
- var value = group.value;
-
- var classes = ["mord"];
-
- var font = options.font;
- if (font) {
- var fontLookup = void 0;
- if (font === "mathit" || _utils2.default.contains(mainitLetters, value)) {
- fontLookup = mathit(value);
- } else {
- fontLookup = fontMap[font];
- }
- if (lookupSymbol(value, fontLookup.fontName, mode).metrics) {
- return makeSymbol(value, fontLookup.fontName, mode, options, classes.concat([fontLookup.fontClass || font]));
- } else {
- return mathDefault(value, mode, options, classes, type);
- }
- } else {
- return mathDefault(value, mode, options, classes, type);
- }
- };
-
- /**
- * Calculate the height, depth, and maxFontSize of an element based on its
- * children.
- */
- var sizeElementFromChildren = function sizeElementFromChildren(elem) {
- var height = 0;
- var depth = 0;
- var maxFontSize = 0;
-
- if (elem.children) {
- for (var i = 0; i < elem.children.length; i++) {
- if (elem.children[i].height > height) {
- height = elem.children[i].height;
- }
- if (elem.children[i].depth > depth) {
- depth = elem.children[i].depth;
- }
- if (elem.children[i].maxFontSize > maxFontSize) {
- maxFontSize = elem.children[i].maxFontSize;
- }
- }
- }
-
- elem.height = height;
- elem.depth = depth;
- elem.maxFontSize = maxFontSize;
- };
-
- /**
- * Makes a span with the given list of classes, list of children, and options.
- *
- * TODO: Ensure that `options` is always provided (currently some call sites
- * don't pass it).
- * TODO: add a separate argument for math class (e.g. `mop`, `mbin`), which
- * should if present come first in `classes`.
- */
- var makeSpan = function makeSpan(classes, children, options) {
- var span = new _domTree2.default.span(classes, children, options);
-
- sizeElementFromChildren(span);
-
- return span;
- };
-
- /**
- * Prepends the given children to the given span, updating height, depth, and
- * maxFontSize.
- */
- var prependChildren = function prependChildren(span, children) {
- span.children = children.concat(span.children);
-
- sizeElementFromChildren(span);
- };
-
- /**
- * Makes a document fragment with the given list of children.
- */
- var makeFragment = function makeFragment(children) {
- var fragment = new _domTree2.default.documentFragment(children);
-
- sizeElementFromChildren(fragment);
-
- return fragment;
- };
-
- /**
- * Makes a vertical list by stacking elements and kerns on top of each other.
- * Allows for many different ways of specifying the positioning method.
- *
- * Arguments:
- * - children: A list of child or kern nodes to be stacked on top of each other
- * (i.e. the first element will be at the bottom, and the last at
- * the top). Element nodes are specified as
- * {type: "elem", elem: node}
- * while kern nodes are specified as
- * {type: "kern", size: size}
- * - positionType: The method by which the vlist should be positioned. Valid
- * values are:
- * - "individualShift": The children list only contains elem
- * nodes, and each node contains an extra
- * "shift" value of how much it should be
- * shifted (note that shifting is always
- * moving downwards). positionData is
- * ignored.
- * - "top": The positionData specifies the topmost point of
- * the vlist (note this is expected to be a height,
- * so positive values move up)
- * - "bottom": The positionData specifies the bottommost point
- * of the vlist (note this is expected to be a
- * depth, so positive values move down
- * - "shift": The vlist will be positioned such that its
- * baseline is positionData away from the baseline
- * of the first child. Positive values move
- * downwards.
- * - "firstBaseline": The vlist will be positioned such that
- * its baseline is aligned with the
- * baseline of the first child.
- * positionData is ignored. (this is
- * equivalent to "shift" with
- * positionData=0)
- * - positionData: Data used in different ways depending on positionType
- * - options: An Options object
- *
- */
- var makeVList = function makeVList(children, positionType, positionData, options) {
- var depth = void 0;
- var currPos = void 0;
- var i = void 0;
- if (positionType === "individualShift") {
- var oldChildren = children;
- children = [oldChildren[0]];
-
- // Add in kerns to the list of children to get each element to be
- // shifted to the correct specified shift
- depth = -oldChildren[0].shift - oldChildren[0].elem.depth;
- currPos = depth;
- for (i = 1; i < oldChildren.length; i++) {
- var diff = -oldChildren[i].shift - currPos - oldChildren[i].elem.depth;
- var size = diff - (oldChildren[i - 1].elem.height + oldChildren[i - 1].elem.depth);
-
- currPos = currPos + diff;
-
- children.push({ type: "kern", size: size });
- children.push(oldChildren[i]);
- }
- } else if (positionType === "top") {
- // We always start at the bottom, so calculate the bottom by adding up
- // all the sizes
- var bottom = positionData;
- for (i = 0; i < children.length; i++) {
- if (children[i].type === "kern") {
- bottom -= children[i].size;
- } else {
- bottom -= children[i].elem.height + children[i].elem.depth;
- }
- }
- depth = bottom;
- } else if (positionType === "bottom") {
- depth = -positionData;
- } else if (positionType === "shift") {
- depth = -children[0].elem.depth - positionData;
- } else if (positionType === "firstBaseline") {
- depth = -children[0].elem.depth;
- } else {
- depth = 0;
- }
-
- // Create a strut that is taller than any list item. The strut is added to
- // each item, where it will determine the item's baseline. Since it has
- // `overflow:hidden`, the strut's top edge will sit on the item's line box's
- // top edge and the strut's bottom edge will sit on the item's baseline,
- // with no additional line-height spacing. This allows the item baseline to
- // be positioned precisely without worrying about font ascent and
- // line-height.
- var pstrutSize = 0;
- for (i = 0; i < children.length; i++) {
- if (children[i].type === "elem") {
- var child = children[i].elem;
- pstrutSize = Math.max(pstrutSize, child.maxFontSize, child.height);
- }
- }
- pstrutSize += 2;
- var pstrut = makeSpan(["pstrut"], []);
- pstrut.style.height = pstrutSize + "em";
-
- // Create a new list of actual children at the correct offsets
- var realChildren = [];
- var minPos = depth;
- var maxPos = depth;
- currPos = depth;
- for (i = 0; i < children.length; i++) {
- if (children[i].type === "kern") {
- currPos += children[i].size;
- } else {
- var _child = children[i].elem;
-
- var childWrap = makeSpan([], [pstrut, _child]);
- childWrap.style.top = -pstrutSize - currPos - _child.depth + "em";
- if (children[i].marginLeft) {
- childWrap.style.marginLeft = children[i].marginLeft;
- }
- if (children[i].marginRight) {
- childWrap.style.marginRight = children[i].marginRight;
- }
-
- realChildren.push(childWrap);
- currPos += _child.height + _child.depth;
- }
- minPos = Math.min(minPos, currPos);
- maxPos = Math.max(maxPos, currPos);
- }
-
- // The vlist contents go in a table-cell with `vertical-align:bottom`.
- // This cell's bottom edge will determine the containing table's baseline
- // without overly expanding the containing line-box.
- var vlist = makeSpan(["vlist"], realChildren);
- vlist.style.height = maxPos + "em";
-
- // A second row is used if necessary to represent the vlist's depth.
- var rows = void 0;
- if (minPos < 0) {
- var depthStrut = makeSpan(["vlist"], []);
- depthStrut.style.height = -minPos + "em";
-
- // Safari wants the first row to have inline content; otherwise it
- // puts the bottom of the *second* row on the baseline.
- var topStrut = makeSpan(["vlist-s"], [new _domTree2.default.symbolNode("\u200B")]);
-
- rows = [makeSpan(["vlist-r"], [vlist, topStrut]), makeSpan(["vlist-r"], [depthStrut])];
- } else {
- rows = [makeSpan(["vlist-r"], [vlist])];
- }
-
- var vtable = makeSpan(["vlist-t"], rows);
- if (rows.length === 2) {
- vtable.classes.push("vlist-t2");
- }
- vtable.height = maxPos;
- vtable.depth = -minPos;
- return vtable;
- };
-
- // A map of spacing functions to their attributes, like size and corresponding
- // CSS class
- var spacingFunctions = {
- "\\qquad": {
- size: "2em",
- className: "qquad"
- },
- "\\quad": {
- size: "1em",
- className: "quad"
- },
- "\\enspace": {
- size: "0.5em",
- className: "enspace"
- },
- "\\;": {
- size: "0.277778em",
- className: "thickspace"
- },
- "\\:": {
- size: "0.22222em",
- className: "mediumspace"
- },
- "\\,": {
- size: "0.16667em",
- className: "thinspace"
- },
- "\\!": {
- size: "-0.16667em",
- className: "negativethinspace"
- }
- };
-
- /**
- * Maps TeX font commands to objects containing:
- * - variant: string used for "mathvariant" attribute in buildMathML.js
- * - fontName: the "style" parameter to fontMetrics.getCharacterMetrics
- */
- // A map between tex font commands an MathML mathvariant attribute values
- var fontMap = {
- // styles
- "mathbf": {
- variant: "bold",
- fontName: "Main-Bold"
- },
- "mathrm": {
- variant: "normal",
- fontName: "Main-Regular"
- },
- "textit": {
- variant: "italic",
- fontName: "Main-Italic"
- },
-
- // "mathit" is missing because it requires the use of two fonts: Main-Italic
- // and Math-Italic. This is handled by a special case in makeOrd which ends
- // up calling mathit.
-
- // families
- "mathbb": {
- variant: "double-struck",
- fontName: "AMS-Regular"
- },
- "mathcal": {
- variant: "script",
- fontName: "Caligraphic-Regular"
- },
- "mathfrak": {
- variant: "fraktur",
- fontName: "Fraktur-Regular"
- },
- "mathscr": {
- variant: "script",
- fontName: "Script-Regular"
- },
- "mathsf": {
- variant: "sans-serif",
- fontName: "SansSerif-Regular"
- },
- "mathtt": {
- variant: "monospace",
- fontName: "Typewriter-Regular"
- }
- };
-
- module.exports = {
- fontMap: fontMap,
- makeSymbol: makeSymbol,
- mathsym: mathsym,
- makeSpan: makeSpan,
- makeFragment: makeFragment,
- makeVList: makeVList,
- makeOrd: makeOrd,
- prependChildren: prependChildren,
- spacingFunctions: spacingFunctions
- };
-
- },{"./domTree":39,"./fontMetrics":41,"./symbols":48,"./utils":51}],35:[function(require,module,exports){
-
- var _stringify = require("babel-runtime/core-js/json/stringify");
-
- var _stringify2 = _interopRequireDefault(_stringify);
-
- var _ParseError = require("./ParseError");
-
- var _ParseError2 = _interopRequireDefault(_ParseError);
-
- var _Style = require("./Style");
-
- var _Style2 = _interopRequireDefault(_Style);
-
- var _buildCommon = require("./buildCommon");
-
- var _buildCommon2 = _interopRequireDefault(_buildCommon);
-
- var _delimiter = require("./delimiter");
-
- var _delimiter2 = _interopRequireDefault(_delimiter);
-
- var _domTree = require("./domTree");
-
- var _domTree2 = _interopRequireDefault(_domTree);
-
- var _units = require("./units");
-
- var _units2 = _interopRequireDefault(_units);
-
- var _utils = require("./utils");
-
- var _utils2 = _interopRequireDefault(_utils);
-
- var _stretchy = require("./stretchy");
-
- var _stretchy2 = _interopRequireDefault(_stretchy);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- /* eslint no-console:0 */
- /**
- * This file does the main work of building a domTree structure from a parse
- * tree. The entry point is the `buildHTML` function, which takes a parse tree.
- * Then, the buildExpression, buildGroup, and various groupTypes functions are
- * called, to produce a final HTML tree.
- */
-
- var isSpace = function isSpace(node) {
- return node instanceof _domTree2.default.span && node.classes[0] === "mspace";
- };
-
- // Binary atoms (first class `mbin`) change into ordinary atoms (`mord`)
- // depending on their surroundings. See TeXbook pg. 442-446, Rules 5 and 6,
- // and the text before Rule 19.
- var isBin = function isBin(node) {
- return node && node.classes[0] === "mbin";
- };
-
- var isBinLeftCanceller = function isBinLeftCanceller(node, isRealGroup) {
- // TODO: This code assumes that a node's math class is the first element
- // of its `classes` array. A later cleanup should ensure this, for
- // instance by changing the signature of `makeSpan`.
- if (node) {
- return _utils2.default.contains(["mbin", "mopen", "mrel", "mop", "mpunct"], node.classes[0]);
- } else {
- return isRealGroup;
- }
- };
-
- var isBinRightCanceller = function isBinRightCanceller(node, isRealGroup) {
- if (node) {
- return _utils2.default.contains(["mrel", "mclose", "mpunct"], node.classes[0]);
- } else {
- return isRealGroup;
- }
- };
-
- /**
- * Splice out any spaces from `children` starting at position `i`, and return
- * the spliced-out array. Returns null if `children[i]` does not exist or is not
- * a space.
- */
- var spliceSpaces = function spliceSpaces(children, i) {
- var j = i;
- while (j < children.length && isSpace(children[j])) {
- j++;
- }
- if (j === i) {
- return null;
- } else {
- return children.splice(i, j - i);
- }
- };
-
- /**
- * Take a list of nodes, build them in order, and return a list of the built
- * nodes. documentFragments are flattened into their contents, so the
- * returned list contains no fragments. `isRealGroup` is true if `expression`
- * is a real group (no atoms will be added on either side), as opposed to
- * a partial group (e.g. one created by \color).
- */
- var buildExpression = function buildExpression(expression, options, isRealGroup) {
- // Parse expressions into `groups`.
- var groups = [];
- for (var i = 0; i < expression.length; i++) {
- var group = expression[i];
- var output = buildGroup(group, options);
- if (output instanceof _domTree2.default.documentFragment) {
- Array.prototype.push.apply(groups, output.children);
- } else {
- groups.push(output);
- }
- }
- // At this point `groups` consists entirely of `symbolNode`s and `span`s.
-
- // Explicit spaces (e.g., \;, \,) should be ignored with respect to atom
- // spacing (e.g., "add thick space between mord and mrel"). Since CSS
- // adjacency rules implement atom spacing, spaces should be invisible to
- // CSS. So we splice them out of `groups` and into the atoms themselves.
- for (var _i = 0; _i < groups.length; _i++) {
- var spaces = spliceSpaces(groups, _i);
- if (spaces) {
- // Splicing of spaces may have removed all remaining groups.
- if (_i < groups.length) {
- // If there is a following group, move space within it.
- if (groups[_i] instanceof _domTree2.default.symbolNode) {
- groups[_i] = (0, _buildCommon.makeSpan)([].concat(groups[_i].classes), [groups[_i]]);
- }
- _buildCommon2.default.prependChildren(groups[_i], spaces);
- } else {
- // Otherwise, put any spaces back at the end of the groups.
- Array.prototype.push.apply(groups, spaces);
- break;
- }
- }
- }
-
- // Binary operators change to ordinary symbols in some contexts.
- for (var _i2 = 0; _i2 < groups.length; _i2++) {
- if (isBin(groups[_i2]) && (isBinLeftCanceller(groups[_i2 - 1], isRealGroup) || isBinRightCanceller(groups[_i2 + 1], isRealGroup))) {
- groups[_i2].classes[0] = "mord";
- }
- }
-
- // Process \\not commands within the group.
- // TODO(kevinb): Handle multiple \\not commands in a row.
- // TODO(kevinb): Handle \\not{abc} correctly. The \\not should appear over
- // the 'a' instead of the 'c'.
- for (var _i3 = 0; _i3 < groups.length; _i3++) {
- if (groups[_i3].value === "\u0338" && _i3 + 1 < groups.length) {
- var children = groups.slice(_i3, _i3 + 2);
-
- children[0].classes = ["mainrm"];
- // \u0338 is a combining glyph so we could reorder the children so
- // that it comes after the other glyph. This works correctly on
- // most browsers except for Safari. Instead we absolutely position
- // the glyph and set its right side to match that of the other
- // glyph which is visually equivalent.
- children[0].style.position = "absolute";
- children[0].style.right = "0";
-
- // Copy the classes from the second glyph to the new container.
- // This is so it behaves the same as though there was no \\not.
- var classes = groups[_i3 + 1].classes;
- var container = (0, _buildCommon.makeSpan)(classes, children);
-
- // LaTeX adds a space between ords separated by a \\not.
- if (classes.indexOf("mord") !== -1) {
- // \glue(\thickmuskip) 2.77771 plus 2.77771
- container.style.paddingLeft = "0.277771em";
- }
-
- // Ensure that the \u0338 is positioned relative to the container.
- container.style.position = "relative";
- groups.splice(_i3, 2, container);
- }
- }
-
- return groups;
- };
-
- // Return math atom class (mclass) of a domTree.
- var getTypeOfDomTree = function getTypeOfDomTree(node) {
- if (node instanceof _domTree2.default.documentFragment) {
- if (node.children.length) {
- return getTypeOfDomTree(node.children[node.children.length - 1]);
- }
- } else {
- if (_utils2.default.contains(["mord", "mop", "mbin", "mrel", "mopen", "mclose", "mpunct", "minner"], node.classes[0])) {
- return node.classes[0];
- }
- }
- return null;
- };
-
- /**
- * Sometimes, groups perform special rules when they have superscripts or
- * subscripts attached to them. This function lets the `supsub` group know that
- * its inner element should handle the superscripts and subscripts instead of
- * handling them itself.
- */
- var shouldHandleSupSub = function shouldHandleSupSub(group, options) {
- if (!group.value.base) {
- return false;
- } else {
- var base = group.value.base;
- if (base.type === "op") {
- // Operators handle supsubs differently when they have limits
- // (e.g. `\displaystyle\sum_2^3`)
- return base.value.limits && (options.style.size === _Style2.default.DISPLAY.size || base.value.alwaysHandleSupSub);
- } else if (base.type === "accent") {
- return isCharacterBox(base.value.base);
- } else if (base.type === "horizBrace") {
- var isSup = group.value.sub ? false : true;
- return isSup === base.value.isOver;
- } else {
- return null;
- }
- }
- };
-
- /**
- * Sometimes we want to pull out the innermost element of a group. In most
- * cases, this will just be the group itself, but when ordgroups and colors have
- * a single element, we want to pull that out.
- */
- var getBaseElem = function getBaseElem(group) {
- if (!group) {
- return false;
- } else if (group.type === "ordgroup") {
- if (group.value.length === 1) {
- return getBaseElem(group.value[0]);
- } else {
- return group;
- }
- } else if (group.type === "color") {
- if (group.value.value.length === 1) {
- return getBaseElem(group.value.value[0]);
- } else {
- return group;
- }
- } else if (group.type === "font") {
- return getBaseElem(group.value.body);
- } else {
- return group;
- }
- };
-
- /**
- * TeXbook algorithms often reference "character boxes", which are simply groups
- * with a single character in them. To decide if something is a character box,
- * we find its innermost group, and see if it is a single character.
- */
- var isCharacterBox = function isCharacterBox(group) {
- var baseElem = getBaseElem(group);
-
- // These are all they types of groups which hold single characters
- return baseElem.type === "mathord" || baseElem.type === "textord" || baseElem.type === "bin" || baseElem.type === "rel" || baseElem.type === "inner" || baseElem.type === "open" || baseElem.type === "close" || baseElem.type === "punct";
- };
-
- var makeNullDelimiter = function makeNullDelimiter(options, classes) {
- var moreClasses = ["nulldelimiter"].concat(options.baseSizingClasses());
- return (0, _buildCommon.makeSpan)(classes.concat(moreClasses));
- };
-
- /**
- * This is a map of group types to the function used to handle that type.
- * Simpler types come at the beginning, while complicated types come afterwards.
- */
- var groupTypes = {};
-
- groupTypes.mathord = function (group, options) {
- return _buildCommon2.default.makeOrd(group, options, "mathord");
- };
-
- groupTypes.textord = function (group, options) {
- return _buildCommon2.default.makeOrd(group, options, "textord");
- };
-
- groupTypes.bin = function (group, options) {
- return _buildCommon2.default.mathsym(group.value, group.mode, options, ["mbin"]);
- };
-
- groupTypes.rel = function (group, options) {
- return _buildCommon2.default.mathsym(group.value, group.mode, options, ["mrel"]);
- };
-
- groupTypes.open = function (group, options) {
- return _buildCommon2.default.mathsym(group.value, group.mode, options, ["mopen"]);
- };
-
- groupTypes.close = function (group, options) {
- return _buildCommon2.default.mathsym(group.value, group.mode, options, ["mclose"]);
- };
-
- groupTypes.inner = function (group, options) {
- return _buildCommon2.default.mathsym(group.value, group.mode, options, ["minner"]);
- };
-
- groupTypes.punct = function (group, options) {
- return _buildCommon2.default.mathsym(group.value, group.mode, options, ["mpunct"]);
- };
-
- groupTypes.ordgroup = function (group, options) {
- return (0, _buildCommon.makeSpan)(["mord"], buildExpression(group.value, options, true), options);
- };
-
- groupTypes.text = function (group, options) {
- var newOptions = options.withFont(group.value.style);
- var inner = buildExpression(group.value.body, newOptions, true);
- for (var i = 0; i < inner.length - 1; i++) {
- if (inner[i].tryCombine(inner[i + 1])) {
- inner.splice(i + 1, 1);
- i--;
- }
- }
- return (0, _buildCommon.makeSpan)(["mord", "text"], inner, newOptions);
- };
-
- groupTypes.color = function (group, options) {
- var elements = buildExpression(group.value.value, options.withColor(group.value.color), false);
-
- // \color isn't supposed to affect the type of the elements it contains.
- // To accomplish this, we wrap the results in a fragment, so the inner
- // elements will be able to directly interact with their neighbors. For
- // example, `\color{red}{2 +} 3` has the same spacing as `2 + 3`
- return new _buildCommon2.default.makeFragment(elements);
- };
-
- groupTypes.supsub = function (group, options) {
- // Superscript and subscripts are handled in the TeXbook on page
- // 445-446, rules 18(a-f).
-
- // Here is where we defer to the inner group if it should handle
- // superscripts and subscripts itself.
- if (shouldHandleSupSub(group, options)) {
- return groupTypes[group.value.base.type](group, options);
- }
-
- var base = buildGroup(group.value.base, options);
- var supm = void 0;
- var subm = void 0;
-
- var metrics = options.fontMetrics();
- var newOptions = void 0;
-
- // Rule 18a
- var supShift = 0;
- var subShift = 0;
-
- if (group.value.sup) {
- newOptions = options.havingStyle(options.style.sup());
- supm = buildGroup(group.value.sup, newOptions, options);
- if (!isCharacterBox(group.value.base)) {
- supShift = base.height - newOptions.fontMetrics().supDrop * newOptions.sizeMultiplier / options.sizeMultiplier;
- }
- }
-
- if (group.value.sub) {
- newOptions = options.havingStyle(options.style.sub());
- subm = buildGroup(group.value.sub, newOptions, options);
- if (!isCharacterBox(group.value.base)) {
- subShift = base.depth + newOptions.fontMetrics().subDrop * newOptions.sizeMultiplier / options.sizeMultiplier;
- }
- }
-
- // Rule 18c
- var minSupShift = void 0;
- if (options.style === _Style2.default.DISPLAY) {
- minSupShift = metrics.sup1;
- } else if (options.style.cramped) {
- minSupShift = metrics.sup3;
- } else {
- minSupShift = metrics.sup2;
- }
-
- // scriptspace is a font-size-independent size, so scale it
- // appropriately
- var multiplier = options.sizeMultiplier;
- var scriptspace = 0.5 / metrics.ptPerEm / multiplier + "em";
-
- var supsub = void 0;
- if (!group.value.sup) {
- // Rule 18b
- subShift = Math.max(subShift, metrics.sub1, subm.height - 0.8 * metrics.xHeight);
-
- var vlistElem = [{ type: "elem", elem: subm, marginRight: scriptspace }];
- // Subscripts shouldn't be shifted by the base's italic correction.
- // Account for that by shifting the subscript back the appropriate
- // amount. Note we only do this when the base is a single symbol.
- if (base instanceof _domTree2.default.symbolNode) {
- vlistElem[0].marginLeft = -base.italic + "em";
- }
-
- supsub = _buildCommon2.default.makeVList(vlistElem, "shift", subShift, options);
- } else if (!group.value.sub) {
- // Rule 18c, d
- supShift = Math.max(supShift, minSupShift, supm.depth + 0.25 * metrics.xHeight);
-
- supsub = _buildCommon2.default.makeVList([{ type: "elem", elem: supm, marginRight: scriptspace }], "shift", -supShift, options);
- } else {
- supShift = Math.max(supShift, minSupShift, supm.depth + 0.25 * metrics.xHeight);
- subShift = Math.max(subShift, metrics.sub2);
-
- var ruleWidth = metrics.defaultRuleThickness;
-
- // Rule 18e
- if (supShift - supm.depth - (subm.height - subShift) < 4 * ruleWidth) {
- subShift = 4 * ruleWidth - (supShift - supm.depth) + subm.height;
- var psi = 0.8 * metrics.xHeight - (supShift - supm.depth);
- if (psi > 0) {
- supShift += psi;
- subShift -= psi;
- }
- }
-
- var _vlistElem = [{ type: "elem", elem: subm, shift: subShift, marginRight: scriptspace }, { type: "elem", elem: supm, shift: -supShift, marginRight: scriptspace }];
- // See comment above about subscripts not being shifted
- if (base instanceof _domTree2.default.symbolNode) {
- _vlistElem[0].marginLeft = -base.italic + "em";
- }
-
- supsub = _buildCommon2.default.makeVList(_vlistElem, "individualShift", null, options);
- }
-
- // We ensure to wrap the supsub vlist in a span.msupsub to reset text-align
- var mclass = getTypeOfDomTree(base) || "mord";
- return (0, _buildCommon.makeSpan)([mclass], [base, (0, _buildCommon.makeSpan)(["msupsub"], [supsub])], options);
- };
-
- groupTypes.genfrac = function (group, options) {
- // Fractions are handled in the TeXbook on pages 444-445, rules 15(a-e).
- // Figure out what style this fraction should be in based on the
- // function used
- var style = options.style;
- if (group.value.size === "display") {
- style = _Style2.default.DISPLAY;
- } else if (group.value.size === "text") {
- style = _Style2.default.TEXT;
- }
-
- var nstyle = style.fracNum();
- var dstyle = style.fracDen();
- var newOptions = void 0;
-
- newOptions = options.havingStyle(nstyle);
- var numerm = buildGroup(group.value.numer, newOptions, options);
-
- newOptions = options.havingStyle(dstyle);
- var denomm = buildGroup(group.value.denom, newOptions, options);
-
- var rule = void 0;
- var ruleWidth = void 0;
- var ruleSpacing = void 0;
- if (group.value.hasBarLine) {
- rule = makeLineSpan("frac-line", options);
- ruleWidth = rule.height;
- ruleSpacing = rule.height;
- } else {
- rule = null;
- ruleWidth = 0;
- ruleSpacing = options.fontMetrics().defaultRuleThickness;
- }
-
- // Rule 15b
- var numShift = void 0;
- var clearance = void 0;
- var denomShift = void 0;
- if (style.size === _Style2.default.DISPLAY.size) {
- numShift = options.fontMetrics().num1;
- if (ruleWidth > 0) {
- clearance = 3 * ruleSpacing;
- } else {
- clearance = 7 * ruleSpacing;
- }
- denomShift = options.fontMetrics().denom1;
- } else {
- if (ruleWidth > 0) {
- numShift = options.fontMetrics().num2;
- clearance = ruleSpacing;
- } else {
- numShift = options.fontMetrics().num3;
- clearance = 3 * ruleSpacing;
- }
- denomShift = options.fontMetrics().denom2;
- }
-
- var frac = void 0;
- if (ruleWidth === 0) {
- // Rule 15c
- var candidateClearance = numShift - numerm.depth - (denomm.height - denomShift);
- if (candidateClearance < clearance) {
- numShift += 0.5 * (clearance - candidateClearance);
- denomShift += 0.5 * (clearance - candidateClearance);
- }
-
- frac = _buildCommon2.default.makeVList([{ type: "elem", elem: denomm, shift: denomShift }, { type: "elem", elem: numerm, shift: -numShift }], "individualShift", null, options);
- } else {
- // Rule 15d
- var axisHeight = options.fontMetrics().axisHeight;
-
- if (numShift - numerm.depth - (axisHeight + 0.5 * ruleWidth) < clearance) {
- numShift += clearance - (numShift - numerm.depth - (axisHeight + 0.5 * ruleWidth));
- }
-
- if (axisHeight - 0.5 * ruleWidth - (denomm.height - denomShift) < clearance) {
- denomShift += clearance - (axisHeight - 0.5 * ruleWidth - (denomm.height - denomShift));
- }
-
- var midShift = -(axisHeight - 0.5 * ruleWidth);
-
- frac = _buildCommon2.default.makeVList([{ type: "elem", elem: denomm, shift: denomShift }, { type: "elem", elem: rule, shift: midShift }, { type: "elem", elem: numerm, shift: -numShift }], "individualShift", null, options);
- }
-
- // Since we manually change the style sometimes (with \dfrac or \tfrac),
- // account for the possible size change here.
- newOptions = options.havingStyle(style);
- frac.height *= newOptions.sizeMultiplier / options.sizeMultiplier;
- frac.depth *= newOptions.sizeMultiplier / options.sizeMultiplier;
-
- // Rule 15e
- var delimSize = void 0;
- if (style.size === _Style2.default.DISPLAY.size) {
- delimSize = options.fontMetrics().delim1;
- } else {
- delimSize = options.fontMetrics().delim2;
- }
-
- var leftDelim = void 0;
- var rightDelim = void 0;
- if (group.value.leftDelim == null) {
- leftDelim = makeNullDelimiter(options, ["mopen"]);
- } else {
- leftDelim = _delimiter2.default.customSizedDelim(group.value.leftDelim, delimSize, true, options.havingStyle(style), group.mode, ["mopen"]);
- }
- if (group.value.rightDelim == null) {
- rightDelim = makeNullDelimiter(options, ["mclose"]);
- } else {
- rightDelim = _delimiter2.default.customSizedDelim(group.value.rightDelim, delimSize, true, options.havingStyle(style), group.mode, ["mclose"]);
- }
-
- return (0, _buildCommon.makeSpan)(["mord"].concat(newOptions.sizingClasses(options)), [leftDelim, (0, _buildCommon.makeSpan)(["mfrac"], [frac]), rightDelim], options);
- };
-
- groupTypes.array = function (group, options) {
- var r = void 0;
- var c = void 0;
- var nr = group.value.body.length;
- var nc = 0;
- var body = new Array(nr);
-
- // Horizontal spacing
- var pt = 1 / options.fontMetrics().ptPerEm;
- var arraycolsep = 5 * pt; // \arraycolsep in article.cls
-
- // Vertical spacing
- var baselineskip = 12 * pt; // see size10.clo
- // Default \jot from ltmath.dtx
- // TODO(edemaine): allow overriding \jot via \setlength (#687)
- var jot = 3 * pt;
- // Default \arraystretch from lttab.dtx
- // TODO(gagern): may get redefined once we have user-defined macros
- var arraystretch = _utils2.default.deflt(group.value.arraystretch, 1);
- var arrayskip = arraystretch * baselineskip;
- var arstrutHeight = 0.7 * arrayskip; // \strutbox in ltfsstrc.dtx and
- var arstrutDepth = 0.3 * arrayskip; // \@arstrutbox in lttab.dtx
-
- var totalHeight = 0;
- for (r = 0; r < group.value.body.length; ++r) {
- var inrow = group.value.body[r];
- var height = arstrutHeight; // \@array adds an \@arstrut
- var depth = arstrutDepth; // to each tow (via the template)
-
- if (nc < inrow.length) {
- nc = inrow.length;
- }
-
- var outrow = new Array(inrow.length);
- for (c = 0; c < inrow.length; ++c) {
- var elt = buildGroup(inrow[c], options);
- if (depth < elt.depth) {
- depth = elt.depth;
- }
- if (height < elt.height) {
- height = elt.height;
- }
- outrow[c] = elt;
- }
-
- var gap = 0;
- if (group.value.rowGaps[r]) {
- gap = _units2.default.calculateSize(group.value.rowGaps[r].value, options);
- if (gap > 0) {
- // \@argarraycr
- gap += arstrutDepth;
- if (depth < gap) {
- depth = gap; // \@xargarraycr
- }
- gap = 0;
- }
- }
- // In AMS multiline environments such as aligned and gathered, rows
- // correspond to lines that have additional \jot added to the
- // \baselineskip via \openup.
- if (group.value.addJot) {
- depth += jot;
- }
-
- outrow.height = height;
- outrow.depth = depth;
- totalHeight += height;
- outrow.pos = totalHeight;
- totalHeight += depth + gap; // \@yargarraycr
- body[r] = outrow;
- }
-
- var offset = totalHeight / 2 + options.fontMetrics().axisHeight;
- var colDescriptions = group.value.cols || [];
- var cols = [];
- var colSep = void 0;
- var colDescrNum = void 0;
- for (c = 0, colDescrNum = 0;
- // Continue while either there are more columns or more column
- // descriptions, so trailing separators don't get lost.
- c < nc || colDescrNum < colDescriptions.length; ++c, ++colDescrNum) {
-
- var colDescr = colDescriptions[colDescrNum] || {};
-
- var firstSeparator = true;
- while (colDescr.type === "separator") {
- // If there is more than one separator in a row, add a space
- // between them.
- if (!firstSeparator) {
- colSep = (0, _buildCommon.makeSpan)(["arraycolsep"], []);
- colSep.style.width = options.fontMetrics().doubleRuleSep + "em";
- cols.push(colSep);
- }
-
- if (colDescr.separator === "|") {
- var separator = (0, _buildCommon.makeSpan)(["vertical-separator"], []);
- separator.style.height = totalHeight + "em";
- separator.style.verticalAlign = -(totalHeight - offset) + "em";
-
- cols.push(separator);
- } else {
- throw new _ParseError2.default("Invalid separator type: " + colDescr.separator);
- }
-
- colDescrNum++;
- colDescr = colDescriptions[colDescrNum] || {};
- firstSeparator = false;
- }
-
- if (c >= nc) {
- continue;
- }
-
- var sepwidth = void 0;
- if (c > 0 || group.value.hskipBeforeAndAfter) {
- sepwidth = _utils2.default.deflt(colDescr.pregap, arraycolsep);
- if (sepwidth !== 0) {
- colSep = (0, _buildCommon.makeSpan)(["arraycolsep"], []);
- colSep.style.width = sepwidth + "em";
- cols.push(colSep);
- }
- }
-
- var col = [];
- for (r = 0; r < nr; ++r) {
- var row = body[r];
- var elem = row[c];
- if (!elem) {
- continue;
- }
- var shift = row.pos - offset;
- elem.depth = row.depth;
- elem.height = row.height;
- col.push({ type: "elem", elem: elem, shift: shift });
- }
-
- col = _buildCommon2.default.makeVList(col, "individualShift", null, options);
- col = (0, _buildCommon.makeSpan)(["col-align-" + (colDescr.align || "c")], [col]);
- cols.push(col);
-
- if (c < nc - 1 || group.value.hskipBeforeAndAfter) {
- sepwidth = _utils2.default.deflt(colDescr.postgap, arraycolsep);
- if (sepwidth !== 0) {
- colSep = (0, _buildCommon.makeSpan)(["arraycolsep"], []);
- colSep.style.width = sepwidth + "em";
- cols.push(colSep);
- }
- }
- }
- body = (0, _buildCommon.makeSpan)(["mtable"], cols);
- return (0, _buildCommon.makeSpan)(["mord"], [body], options);
- };
-
- groupTypes.spacing = function (group, options) {
- if (group.value === "\\ " || group.value === "\\space" || group.value === " " || group.value === "~") {
- // Spaces are generated by adding an actual space. Each of these
- // things has an entry in the symbols table, so these will be turned
- // into appropriate outputs.
- if (group.mode === "text") {
- return _buildCommon2.default.makeOrd(group, options, "textord");
- } else {
- return (0, _buildCommon.makeSpan)(["mspace"], [_buildCommon2.default.mathsym(group.value, group.mode, options)], options);
- }
- } else {
- // Other kinds of spaces are of arbitrary width. We use CSS to
- // generate these.
- return (0, _buildCommon.makeSpan)(["mspace", _buildCommon2.default.spacingFunctions[group.value].className], [], options);
- }
- };
-
- groupTypes.llap = function (group, options) {
- var inner = (0, _buildCommon.makeSpan)(["inner"], [buildGroup(group.value.body, options)]);
- var fix = (0, _buildCommon.makeSpan)(["fix"], []);
- return (0, _buildCommon.makeSpan)(["mord", "llap"], [inner, fix], options);
- };
-
- groupTypes.rlap = function (group, options) {
- var inner = (0, _buildCommon.makeSpan)(["inner"], [buildGroup(group.value.body, options)]);
- var fix = (0, _buildCommon.makeSpan)(["fix"], []);
- return (0, _buildCommon.makeSpan)(["mord", "rlap"], [inner, fix], options);
- };
-
- groupTypes.op = function (group, options) {
- // Operators are handled in the TeXbook pg. 443-444, rule 13(a).
- var supGroup = void 0;
- var subGroup = void 0;
- var hasLimits = false;
- if (group.type === "supsub") {
- // If we have limits, supsub will pass us its group to handle. Pull
- // out the superscript and subscript and set the group to the op in
- // its base.
- supGroup = group.value.sup;
- subGroup = group.value.sub;
- group = group.value.base;
- hasLimits = true;
- }
-
- var style = options.style;
-
- // Most operators have a large successor symbol, but these don't.
- var noSuccessor = ["\\smallint"];
-
- var large = false;
- if (style.size === _Style2.default.DISPLAY.size && group.value.symbol && !_utils2.default.contains(noSuccessor, group.value.body)) {
-
- // Most symbol operators get larger in displaystyle (rule 13)
- large = true;
- }
-
- var base = void 0;
- if (group.value.symbol) {
- // If this is a symbol, create the symbol.
- var fontName = large ? "Size2-Regular" : "Size1-Regular";
- base = _buildCommon2.default.makeSymbol(group.value.body, fontName, "math", options, ["mop", "op-symbol", large ? "large-op" : "small-op"]);
- } else if (group.value.value) {
- // If this is a list, compose that list.
- var inner = buildExpression(group.value.value, options, true);
- if (inner.length === 1 && inner[0] instanceof _domTree2.default.symbolNode) {
- base = inner[0];
- base.classes[0] = "mop"; // replace old mclass
- } else {
- base = (0, _buildCommon.makeSpan)(["mop"], inner, options);
- }
- } else {
- // Otherwise, this is a text operator. Build the text from the
- // operator's name.
- // TODO(emily): Add a space in the middle of some of these
- // operators, like \limsup
- var output = [];
- for (var i = 1; i < group.value.body.length; i++) {
- output.push(_buildCommon2.default.mathsym(group.value.body[i], group.mode));
- }
- base = (0, _buildCommon.makeSpan)(["mop"], output, options);
- }
-
- // If content of op is a single symbol, shift it vertically.
- var baseShift = 0;
- var slant = 0;
- if (base instanceof _domTree2.default.symbolNode) {
- // Shift the symbol so its center lies on the axis (rule 13). It
- // appears that our fonts have the centers of the symbols already
- // almost on the axis, so these numbers are very small. Note we
- // don't actually apply this here, but instead it is used either in
- // the vlist creation or separately when there are no limits.
- baseShift = (base.height - base.depth) / 2 - options.fontMetrics().axisHeight;
-
- // The slant of the symbol is just its italic correction.
- slant = base.italic;
- }
-
- if (hasLimits) {
- // IE 8 clips \int if it is in a display: inline-block. We wrap it
- // in a new span so it is an inline, and works.
- base = (0, _buildCommon.makeSpan)([], [base]);
-
- var supm = void 0;
- var supKern = void 0;
- var subm = void 0;
- var subKern = void 0;
- var newOptions = void 0;
- // We manually have to handle the superscripts and subscripts. This,
- // aside from the kern calculations, is copied from supsub.
- if (supGroup) {
- newOptions = options.havingStyle(style.sup());
- supm = buildGroup(supGroup, newOptions, options);
-
- supKern = Math.max(options.fontMetrics().bigOpSpacing1, options.fontMetrics().bigOpSpacing3 - supm.depth);
- }
-
- if (subGroup) {
- newOptions = options.havingStyle(style.sub());
- subm = buildGroup(subGroup, newOptions, options);
-
- subKern = Math.max(options.fontMetrics().bigOpSpacing2, options.fontMetrics().bigOpSpacing4 - subm.height);
- }
-
- // Build the final group as a vlist of the possible subscript, base,
- // and possible superscript.
- var finalGroup = void 0;
- var top = void 0;
- var bottom = void 0;
- if (!supGroup) {
- top = base.height - baseShift;
-
- // Shift the limits by the slant of the symbol. Note
- // that we are supposed to shift the limits by 1/2 of the slant,
- // but since we are centering the limits adding a full slant of
- // margin will shift by 1/2 that.
- finalGroup = _buildCommon2.default.makeVList([{ type: "kern", size: options.fontMetrics().bigOpSpacing5 }, { type: "elem", elem: subm, marginLeft: -slant + "em" }, { type: "kern", size: subKern }, { type: "elem", elem: base }], "top", top, options);
- } else if (!subGroup) {
- bottom = base.depth + baseShift;
-
- finalGroup = _buildCommon2.default.makeVList([{ type: "elem", elem: base }, { type: "kern", size: supKern }, { type: "elem", elem: supm, marginLeft: slant + "em" }, { type: "kern", size: options.fontMetrics().bigOpSpacing5 }], "bottom", bottom, options);
- } else if (!supGroup && !subGroup) {
- // This case probably shouldn't occur (this would mean the
- // supsub was sending us a group with no superscript or
- // subscript) but be safe.
- return base;
- } else {
- bottom = options.fontMetrics().bigOpSpacing5 + subm.height + subm.depth + subKern + base.depth + baseShift;
-
- finalGroup = _buildCommon2.default.makeVList([{ type: "kern", size: options.fontMetrics().bigOpSpacing5 }, { type: "elem", elem: subm, marginLeft: -slant + "em" }, { type: "kern", size: subKern }, { type: "elem", elem: base }, { type: "kern", size: supKern }, { type: "elem", elem: supm, marginLeft: slant + "em" }, { type: "kern", size: options.fontMetrics().bigOpSpacing5 }], "bottom", bottom, options);
- }
-
- return (0, _buildCommon.makeSpan)(["mop", "op-limits"], [finalGroup], options);
- } else {
- if (baseShift) {
- base.style.position = "relative";
- base.style.top = baseShift + "em";
- }
-
- return base;
- }
- };
-
- groupTypes.mod = function (group, options) {
- var inner = [];
-
- if (group.value.modType === "bmod") {
- // “\nonscript\mskip-\medmuskip\mkern5mu”
- if (!options.style.isTight()) {
- inner.push((0, _buildCommon.makeSpan)(["mspace", "negativemediumspace"], [], options));
- }
- inner.push((0, _buildCommon.makeSpan)(["mspace", "thickspace"], [], options));
- } else if (options.style.size === _Style2.default.DISPLAY.size) {
- inner.push((0, _buildCommon.makeSpan)(["mspace", "quad"], [], options));
- } else if (group.value.modType === "mod") {
- inner.push((0, _buildCommon.makeSpan)(["mspace", "twelvemuspace"], [], options));
- } else {
- inner.push((0, _buildCommon.makeSpan)(["mspace", "eightmuspace"], [], options));
- }
-
- if (group.value.modType === "pod" || group.value.modType === "pmod") {
- inner.push(_buildCommon2.default.mathsym("(", group.mode));
- }
-
- if (group.value.modType !== "pod") {
- var modInner = [_buildCommon2.default.mathsym("m", group.mode), _buildCommon2.default.mathsym("o", group.mode), _buildCommon2.default.mathsym("d", group.mode)];
- if (group.value.modType === "bmod") {
- inner.push((0, _buildCommon.makeSpan)(["mbin"], modInner, options));
- // “\mkern5mu\nonscript\mskip-\medmuskip”
- inner.push((0, _buildCommon.makeSpan)(["mspace", "thickspace"], [], options));
- if (!options.style.isTight()) {
- inner.push((0, _buildCommon.makeSpan)(["mspace", "negativemediumspace"], [], options));
- }
- } else {
- Array.prototype.push.apply(inner, modInner);
- inner.push((0, _buildCommon.makeSpan)(["mspace", "sixmuspace"], [], options));
- }
- }
-
- if (group.value.value) {
- Array.prototype.push.apply(inner, buildExpression(group.value.value, options, false));
- }
-
- if (group.value.modType === "pod" || group.value.modType === "pmod") {
- inner.push(_buildCommon2.default.mathsym(")", group.mode));
- }
-
- return _buildCommon2.default.makeFragment(inner);
- };
-
- groupTypes.katex = function (group, options) {
- // The KaTeX logo. The offsets for the K and a were chosen to look
- // good, but the offsets for the T, E, and X were taken from the
- // definition of \TeX in TeX (see TeXbook pg. 356)
- var k = (0, _buildCommon.makeSpan)(["k"], [_buildCommon2.default.mathsym("K", group.mode)], options);
- var a = (0, _buildCommon.makeSpan)(["a"], [_buildCommon2.default.mathsym("A", group.mode)], options);
-
- a.height = (a.height + 0.2) * 0.75;
- a.depth = (a.height - 0.2) * 0.75;
-
- var t = (0, _buildCommon.makeSpan)(["t"], [_buildCommon2.default.mathsym("T", group.mode)], options);
- var e = (0, _buildCommon.makeSpan)(["e"], [_buildCommon2.default.mathsym("E", group.mode)], options);
-
- e.height = e.height - 0.2155;
- e.depth = e.depth + 0.2155;
-
- var x = (0, _buildCommon.makeSpan)(["x"], [_buildCommon2.default.mathsym("X", group.mode)], options);
-
- return (0, _buildCommon.makeSpan)(["mord", "katex-logo"], [k, a, t, e, x], options);
- };
-
- var makeLineSpan = function makeLineSpan(className, options, thickness) {
- var line = (0, _buildCommon.makeSpan)([className], [], options);
- line.height = thickness || options.fontMetrics().defaultRuleThickness;
- line.style.borderBottomWidth = line.height + "em";
- line.maxFontSize = 1.0;
- return line;
- };
-
- groupTypes.overline = function (group, options) {
- // Overlines are handled in the TeXbook pg 443, Rule 9.
-
- // Build the inner group in the cramped style.
- var innerGroup = buildGroup(group.value.body, options.havingCrampedStyle());
-
- // Create the line above the body
- var line = makeLineSpan("overline-line", options);
-
- // Generate the vlist, with the appropriate kerns
- var vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: innerGroup }, { type: "kern", size: 3 * line.height }, { type: "elem", elem: line }, { type: "kern", size: line.height }], "firstBaseline", null, options);
-
- return (0, _buildCommon.makeSpan)(["mord", "overline"], [vlist], options);
- };
-
- groupTypes.underline = function (group, options) {
- // Underlines are handled in the TeXbook pg 443, Rule 10.
- // Build the inner group.
- var innerGroup = buildGroup(group.value.body, options);
-
- // Create the line above the body
- var line = makeLineSpan("underline-line", options);
-
- // Generate the vlist, with the appropriate kerns
- var vlist = _buildCommon2.default.makeVList([{ type: "kern", size: line.height }, { type: "elem", elem: line }, { type: "kern", size: 3 * line.height }, { type: "elem", elem: innerGroup }], "top", innerGroup.height, options);
-
- return (0, _buildCommon.makeSpan)(["mord", "underline"], [vlist], options);
- };
-
- groupTypes.sqrt = function (group, options) {
- // Square roots are handled in the TeXbook pg. 443, Rule 11.
-
- // First, we do the same steps as in overline to build the inner group
- // and line
- var inner = buildGroup(group.value.body, options.havingCrampedStyle());
-
- // Some groups can return document fragments. Handle those by wrapping
- // them in a span.
- if (inner instanceof _domTree2.default.documentFragment) {
- inner = (0, _buildCommon.makeSpan)([], [inner], options);
- }
-
- // Calculate the minimum size for the \surd delimiter
- var metrics = options.fontMetrics();
- var theta = metrics.defaultRuleThickness;
-
- var phi = theta;
- if (options.style.id < _Style2.default.TEXT.id) {
- phi = options.fontMetrics().xHeight;
- }
-
- // Calculate the clearance between the body and line
- var lineClearance = theta + phi / 4;
-
- var minDelimiterHeight = (inner.height + inner.depth + lineClearance + theta) * options.sizeMultiplier;
-
- // Create a sqrt SVG of the required minimum size
- var img = _delimiter2.default.customSizedDelim("\\surd", minDelimiterHeight, false, options, group.mode);
-
- // Calculate the actual line width.
- // This actually should depend on the chosen font -- e.g. \boldmath
- // should use the thicker surd symbols from e.g. KaTeX_Main-Bold, and
- // have thicker rules.
- var ruleWidth = options.fontMetrics().sqrtRuleThickness * img.sizeMultiplier;
-
- var delimDepth = img.height - ruleWidth;
-
- // Adjust the clearance based on the delimiter size
- if (delimDepth > inner.height + inner.depth + lineClearance) {
- lineClearance = (lineClearance + delimDepth - inner.height - inner.depth) / 2;
- }
-
- // Shift the sqrt image
- var imgShift = img.height - inner.height - lineClearance - ruleWidth;
-
- // We add a special case here, because even when `inner` is empty, we
- // still get a line. So, we use a simple heuristic to decide if we
- // should omit the body entirely. (note this doesn't work for something
- // like `\sqrt{\rlap{x}}`, but if someone is doing that they deserve for
- // it not to work.
- var body = void 0;
- if (inner.height === 0 && inner.depth === 0) {
- body = (0, _buildCommon.makeSpan)();
- } else {
- inner.style.paddingLeft = img.surdWidth + "em";
-
- // Overlay the image and the argument.
- body = _buildCommon2.default.makeVList([{ type: "elem", elem: inner }, { type: "kern", size: -(inner.height + imgShift) }, { type: "elem", elem: img }, { type: "kern", size: ruleWidth }], "firstBaseline", null, options);
- body.children[0].children[0].classes.push("svg-align");
- }
-
- if (!group.value.index) {
- return (0, _buildCommon.makeSpan)(["mord", "sqrt"], [body], options);
- } else {
- // Handle the optional root index
-
- // The index is always in scriptscript style
- var newOptions = options.havingStyle(_Style2.default.SCRIPTSCRIPT);
- var rootm = buildGroup(group.value.index, newOptions, options);
-
- // The amount the index is shifted by. This is taken from the TeX
- // source, in the definition of `\r@@t`.
- var toShift = 0.6 * (body.height - body.depth);
-
- // Build a VList with the superscript shifted up correctly
- var rootVList = _buildCommon2.default.makeVList([{ type: "elem", elem: rootm }], "shift", -toShift, options);
- // Add a class surrounding it so we can add on the appropriate
- // kerning
- var rootVListWrap = (0, _buildCommon.makeSpan)(["root"], [rootVList]);
-
- return (0, _buildCommon.makeSpan)(["mord", "sqrt"], [rootVListWrap, body], options);
- }
- };
-
- function sizingGroup(value, options, baseOptions) {
- var inner = buildExpression(value, options, false);
- var multiplier = options.sizeMultiplier / baseOptions.sizeMultiplier;
-
- // Add size-resetting classes to the inner list and set maxFontSize
- // manually. Handle nested size changes.
- for (var i = 0; i < inner.length; i++) {
- var pos = _utils2.default.indexOf(inner[i].classes, "sizing");
- if (pos < 0) {
- Array.prototype.push.apply(inner[i].classes, options.sizingClasses(baseOptions));
- } else if (inner[i].classes[pos + 1] === "reset-size" + options.size) {
- // This is a nested size change: e.g., inner[i] is the "b" in
- // `\Huge a \small b`. Override the old size (the `reset-` class)
- // but not the new size.
- inner[i].classes[pos + 1] = "reset-size" + baseOptions.size;
- }
-
- inner[i].height *= multiplier;
- inner[i].depth *= multiplier;
- }
-
- return _buildCommon2.default.makeFragment(inner);
- }
-
- groupTypes.sizing = function (group, options) {
- // Handle sizing operators like \Huge. Real TeX doesn't actually allow
- // these functions inside of math expressions, so we do some special
- // handling.
- var newOptions = options.havingSize(group.value.size);
- return sizingGroup(group.value.value, newOptions, options);
- };
-
- groupTypes.styling = function (group, options) {
- // Style changes are handled in the TeXbook on pg. 442, Rule 3.
-
- // Figure out what style we're changing to.
- var styleMap = {
- "display": _Style2.default.DISPLAY,
- "text": _Style2.default.TEXT,
- "script": _Style2.default.SCRIPT,
- "scriptscript": _Style2.default.SCRIPTSCRIPT
- };
-
- var newStyle = styleMap[group.value.style];
- var newOptions = options.havingStyle(newStyle);
- return sizingGroup(group.value.value, newOptions, options);
- };
-
- groupTypes.font = function (group, options) {
- var font = group.value.font;
- return buildGroup(group.value.body, options.withFont(font));
- };
-
- groupTypes.delimsizing = function (group, options) {
- var delim = group.value.value;
-
- if (delim === ".") {
- // Empty delimiters still count as elements, even though they don't
- // show anything.
- return (0, _buildCommon.makeSpan)([group.value.mclass]);
- }
-
- // Use delimiter.sizedDelim to generate the delimiter.
- return _delimiter2.default.sizedDelim(delim, group.value.size, options, group.mode, [group.value.mclass]);
- };
-
- groupTypes.leftright = function (group, options) {
- // Build the inner expression
- var inner = buildExpression(group.value.body, options, true);
-
- var innerHeight = 0;
- var innerDepth = 0;
- var hadMiddle = false;
-
- // Calculate its height and depth
- for (var i = 0; i < inner.length; i++) {
- if (inner[i].isMiddle) {
- hadMiddle = true;
- } else {
- innerHeight = Math.max(inner[i].height, innerHeight);
- innerDepth = Math.max(inner[i].depth, innerDepth);
- }
- }
-
- // The size of delimiters is the same, regardless of what style we are
- // in. Thus, to correctly calculate the size of delimiter we need around
- // a group, we scale down the inner size based on the size.
- innerHeight *= options.sizeMultiplier;
- innerDepth *= options.sizeMultiplier;
-
- var leftDelim = void 0;
- if (group.value.left === ".") {
- // Empty delimiters in \left and \right make null delimiter spaces.
- leftDelim = makeNullDelimiter(options, ["mopen"]);
- } else {
- // Otherwise, use leftRightDelim to generate the correct sized
- // delimiter.
- leftDelim = _delimiter2.default.leftRightDelim(group.value.left, innerHeight, innerDepth, options, group.mode, ["mopen"]);
- }
- // Add it to the beginning of the expression
- inner.unshift(leftDelim);
-
- // Handle middle delimiters
- if (hadMiddle) {
- for (var _i4 = 1; _i4 < inner.length; _i4++) {
- var middleDelim = inner[_i4];
- if (middleDelim.isMiddle) {
- // Apply the options that were active when \middle was called
- inner[_i4] = _delimiter2.default.leftRightDelim(middleDelim.isMiddle.value, innerHeight, innerDepth, middleDelim.isMiddle.options, group.mode, []);
- // Add back spaces shifted into the delimiter
- var spaces = spliceSpaces(middleDelim.children, 0);
- if (spaces) {
- _buildCommon2.default.prependChildren(inner[_i4], spaces);
- }
- }
- }
- }
-
- var rightDelim = void 0;
- // Same for the right delimiter
- if (group.value.right === ".") {
- rightDelim = makeNullDelimiter(options, ["mclose"]);
- } else {
- rightDelim = _delimiter2.default.leftRightDelim(group.value.right, innerHeight, innerDepth, options, group.mode, ["mclose"]);
- }
- // Add it to the end of the expression.
- inner.push(rightDelim);
-
- return (0, _buildCommon.makeSpan)(["minner"], inner, options);
- };
-
- groupTypes.middle = function (group, options) {
- var middleDelim = void 0;
- if (group.value.value === ".") {
- middleDelim = makeNullDelimiter(options, []);
- } else {
- middleDelim = _delimiter2.default.sizedDelim(group.value.value, 1, options, group.mode, []);
- middleDelim.isMiddle = { value: group.value.value, options: options };
- }
- return middleDelim;
- };
-
- groupTypes.rule = function (group, options) {
- // Make an empty span for the rule
- var rule = (0, _buildCommon.makeSpan)(["mord", "rule"], [], options);
-
- // Calculate the shift, width, and height of the rule, and account for units
- var shift = 0;
- if (group.value.shift) {
- shift = _units2.default.calculateSize(group.value.shift, options);
- }
-
- var width = _units2.default.calculateSize(group.value.width, options);
- var height = _units2.default.calculateSize(group.value.height, options);
-
- // Style the rule to the right size
- rule.style.borderRightWidth = width + "em";
- rule.style.borderTopWidth = height + "em";
- rule.style.bottom = shift + "em";
-
- // Record the height and width
- rule.width = width;
- rule.height = height + shift;
- rule.depth = -shift;
- // Font size is the number large enough that the browser will
- // reserve at least `absHeight` space above the baseline.
- // The 1.125 factor was empirically determined
- rule.maxFontSize = height * 1.125 * options.sizeMultiplier;
-
- return rule;
- };
-
- groupTypes.kern = function (group, options) {
- // Make an empty span for the rule
- var rule = (0, _buildCommon.makeSpan)(["mord", "rule"], [], options);
-
- if (group.value.dimension) {
- var dimension = _units2.default.calculateSize(group.value.dimension, options);
- rule.style.marginLeft = dimension + "em";
- }
-
- return rule;
- };
-
- groupTypes.accent = function (group, options) {
- // Accents are handled in the TeXbook pg. 443, rule 12.
- var base = group.value.base;
-
- var supsubGroup = void 0;
- if (group.type === "supsub") {
- // If our base is a character box, and we have superscripts and
- // subscripts, the supsub will defer to us. In particular, we want
- // to attach the superscripts and subscripts to the inner body (so
- // that the position of the superscripts and subscripts won't be
- // affected by the height of the accent). We accomplish this by
- // sticking the base of the accent into the base of the supsub, and
- // rendering that, while keeping track of where the accent is.
-
- // The supsub group is the group that was passed in
- var supsub = group;
- // The real accent group is the base of the supsub group
- group = supsub.value.base;
- // The character box is the base of the accent group
- base = group.value.base;
- // Stick the character box into the base of the supsub group
- supsub.value.base = base;
-
- // Rerender the supsub group with its new base, and store that
- // result.
- supsubGroup = buildGroup(supsub, options);
- }
-
- // Build the base group
- var body = buildGroup(base, options.havingCrampedStyle());
-
- // Does the accent need to shift for the skew of a character?
- var mustShift = group.value.isShifty && isCharacterBox(base);
-
- // Calculate the skew of the accent. This is based on the line "If the
- // nucleus is not a single character, let s = 0; otherwise set s to the
- // kern amount for the nucleus followed by the \skewchar of its font."
- // Note that our skew metrics are just the kern between each character
- // and the skewchar.
- var skew = 0;
- if (mustShift) {
- // If the base is a character box, then we want the skew of the
- // innermost character. To do that, we find the innermost character:
- var baseChar = getBaseElem(base);
- // Then, we render its group to get the symbol inside it
- var baseGroup = buildGroup(baseChar, options.havingCrampedStyle());
- // Finally, we pull the skew off of the symbol.
- skew = baseGroup.skew;
- // Note that we now throw away baseGroup, because the layers we
- // removed with getBaseElem might contain things like \color which
- // we can't get rid of.
- // TODO(emily): Find a better way to get the skew
- }
-
- // calculate the amount of space between the body and the accent
- var clearance = Math.min(body.height, options.fontMetrics().xHeight);
-
- // Build the accent
- var accentBody = void 0;
- if (!group.value.isStretchy) {
- var accent = _buildCommon2.default.makeSymbol(group.value.label, "Main-Regular", group.mode, options);
- // Remove the italic correction of the accent, because it only serves to
- // shift the accent over to a place we don't want.
- accent.italic = 0;
-
- // The \vec character that the fonts use is a combining character, and
- // thus shows up much too far to the left. To account for this, we add a
- // specific class which shifts the accent over to where we want it.
- // TODO(emily): Fix this in a better way, like by changing the font
- // Similarly, text accent \H is a combining character and
- // requires a different adjustment.
- var accentClass = null;
- if (group.value.label === "\\vec") {
- accentClass = "accent-vec";
- } else if (group.value.label === '\\H') {
- accentClass = "accent-hungarian";
- }
-
- accentBody = (0, _buildCommon.makeSpan)([], [accent]);
- accentBody = (0, _buildCommon.makeSpan)(["accent-body", accentClass], [accentBody]);
-
- // Shift the accent over by the skew. Note we shift by twice the skew
- // because we are centering the accent, so by adding 2*skew to the left,
- // we shift it to the right by 1*skew.
- accentBody.style.marginLeft = 2 * skew + "em";
-
- accentBody = _buildCommon2.default.makeVList([{ type: "elem", elem: body }, { type: "kern", size: -clearance }, { type: "elem", elem: accentBody }], "firstBaseline", null, options);
- } else {
- accentBody = _stretchy2.default.svgSpan(group, options);
-
- accentBody = _buildCommon2.default.makeVList([{ type: "elem", elem: body }, { type: "elem", elem: accentBody }], "firstBaseline", null, options);
-
- var styleSpan = accentBody.children[0].children[0].children[1];
- styleSpan.classes.push("svg-align"); // text-align: left;
- if (skew > 0) {
- // Shorten the accent and nudge it to the right.
- styleSpan.style.width = "calc(100% - " + 2 * skew + "em)";
- styleSpan.style.marginLeft = 2 * skew + "em";
- }
- }
-
- var accentWrap = (0, _buildCommon.makeSpan)(["mord", "accent"], [accentBody], options);
-
- if (supsubGroup) {
- // Here, we replace the "base" child of the supsub with our newly
- // generated accent.
- supsubGroup.children[0] = accentWrap;
-
- // Since we don't rerun the height calculation after replacing the
- // accent, we manually recalculate height.
- supsubGroup.height = Math.max(accentWrap.height, supsubGroup.height);
-
- // Accents should always be ords, even when their innards are not.
- supsubGroup.classes[0] = "mord";
-
- return supsubGroup;
- } else {
- return accentWrap;
- }
- };
-
- groupTypes.horizBrace = function (group, options) {
- var style = options.style;
-
- var hasSupSub = group.type === "supsub";
- var supSubGroup = void 0;
- var newOptions = void 0;
- if (hasSupSub) {
- // Ref: LaTeX source2e: }}}}\limits}
- // i.e. LaTeX treats the brace similar to an op and passes it
- // with \limits, so we need to assign supsub style.
- if (group.value.sup) {
- newOptions = options.havingStyle(style.sup());
- supSubGroup = buildGroup(group.value.sup, newOptions, options);
- } else {
- newOptions = options.havingStyle(style.sub());
- supSubGroup = buildGroup(group.value.sub, newOptions, options);
- }
- group = group.value.base;
- }
-
- // Build the base group
- var body = buildGroup(group.value.base, options.havingBaseStyle(_Style2.default.DISPLAY));
-
- // Create the stretchy element
- var braceBody = _stretchy2.default.svgSpan(group, options);
-
- // Generate the vlist, with the appropriate kerns ┏━━━━━━━━┓
- // This first vlist contains the subject matter and the brace: equation
- var vlist = void 0;
- if (group.value.isOver) {
- vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: body }, { type: "kern", size: 0.1 }, { type: "elem", elem: braceBody }], "firstBaseline", null, options);
- vlist.children[0].children[0].children[1].classes.push("svg-align");
- } else {
- vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: braceBody }, { type: "kern", size: 0.1 }, { type: "elem", elem: body }], "bottom", body.depth + 0.1 + braceBody.height, options);
- vlist.children[0].children[0].children[0].classes.push("svg-align");
- }
-
- if (hasSupSub) {
- // In order to write the supsub, wrap the first vlist in another vlist:
- // They can't all go in the same vlist, because the note might be wider
- // than the equation. We want the equation to control the brace width.
-
- // note long note long note
- // ┏━━━━━━━━┓ or ┏━━━┓ not ┏━━━━━━━━━┓
- // equation eqn eqn
-
- var vSpan = (0, _buildCommon.makeSpan)(["mord", group.value.isOver ? "mover" : "munder"], [vlist], options);
-
- if (group.value.isOver) {
- vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: vSpan }, { type: "kern", size: 0.2 }, { type: "elem", elem: supSubGroup }], "firstBaseline", null, options);
- } else {
- vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: supSubGroup }, { type: "kern", size: 0.2 }, { type: "elem", elem: vSpan }], "bottom", vSpan.depth + 0.2 + supSubGroup.height, options);
- }
- }
-
- return (0, _buildCommon.makeSpan)(["mord", group.value.isOver ? "mover" : "munder"], [vlist], options);
- };
-
- groupTypes.accentUnder = function (group, options) {
- // Treat under accents much like underlines.
- var innerGroup = buildGroup(group.value.body, options);
-
- var accentBody = _stretchy2.default.svgSpan(group, options);
- var kern = /tilde/.test(group.value.label) ? 0.12 : 0;
-
- // Generate the vlist, with the appropriate kerns
- var vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: accentBody }, { type: "kern", size: kern }, { type: "elem", elem: innerGroup }], "bottom", accentBody.height + kern, options);
-
- vlist.children[0].children[0].children[0].classes.push("svg-align");
-
- return (0, _buildCommon.makeSpan)(["mord", "accentunder"], [vlist], options);
- };
-
- groupTypes.enclose = function (group, options) {
- // \cancel, \bcancel, \xcancel, \sout, \fbox
- var inner = buildGroup(group.value.body, options);
-
- var label = group.value.label.substr(1);
- var scale = options.sizeMultiplier;
- var img = void 0;
- var pad = 0;
- var imgShift = 0;
-
- if (label === "sout") {
- img = (0, _buildCommon.makeSpan)(["stretchy", "sout"]);
- img.height = options.fontMetrics().defaultRuleThickness / scale;
- imgShift = -0.5 * options.fontMetrics().xHeight;
- } else {
- // Add horizontal padding
- inner.classes.push(label === "fbox" ? "boxpad" : "cancel-pad");
-
- // Add vertical padding
- var isCharBox = isCharacterBox(group.value.body);
- // ref: LaTeX source2e: \fboxsep = 3pt; \fboxrule = .4pt
- // ref: cancel package: \advance\totalheight2\p@ % "+2"
- pad = label === "fbox" ? 0.34 : isCharBox ? 0.2 : 0;
- imgShift = inner.depth + pad;
-
- img = _stretchy2.default.encloseSpan(inner, label, pad, options);
- }
-
- var vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: inner, shift: 0 }, { type: "elem", elem: img, shift: imgShift }], "individualShift", null, options);
-
- if (label !== "fbox") {
- vlist.children[0].children[0].children[1].classes.push("svg-align");
- }
-
- if (/cancel/.test(label)) {
- // cancel does not create horiz space for its line extension.
- // That is, not when adjacent to a mord.
- return (0, _buildCommon.makeSpan)(["mord", "cancel-lap"], [vlist], options);
- } else {
- return (0, _buildCommon.makeSpan)(["mord"], [vlist], options);
- }
- };
-
- groupTypes.xArrow = function (group, options) {
- var style = options.style;
-
- // Build the argument groups in the appropriate style.
- // Ref: amsmath.dtx: \hbox{$\scriptstyle\mkern#3mu{#6}\mkern#4mu$}%
-
- var newOptions = options.havingStyle(style.sup());
- var upperGroup = buildGroup(group.value.body, newOptions, options);
- upperGroup.classes.push("x-arrow-pad");
-
- var lowerGroup = void 0;
- if (group.value.below) {
- // Build the lower group
- newOptions = options.havingStyle(style.sub());
- lowerGroup = buildGroup(group.value.below, newOptions, options);
- lowerGroup.classes.push("x-arrow-pad");
- }
-
- var arrowBody = _stretchy2.default.svgSpan(group, options);
-
- var arrowShift = -options.fontMetrics().axisHeight + arrowBody.depth;
- var upperShift = -options.fontMetrics().axisHeight - arrowBody.height - 0.111; // 2 mu. Ref: amsmath.dtx: #7\if0#2\else\mkern#2mu\fi
-
- // Generate the vlist
- var vlist = void 0;
- if (group.value.below) {
- var lowerShift = -options.fontMetrics().axisHeight + lowerGroup.height + arrowBody.height + 0.111;
- vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: upperGroup, shift: upperShift }, { type: "elem", elem: arrowBody, shift: arrowShift }, { type: "elem", elem: lowerGroup, shift: lowerShift }], "individualShift", null, options);
- } else {
- vlist = _buildCommon2.default.makeVList([{ type: "elem", elem: upperGroup, shift: upperShift }, { type: "elem", elem: arrowBody, shift: arrowShift }], "individualShift", null, options);
- }
-
- vlist.children[0].children[0].children[1].classes.push("svg-align");
-
- return (0, _buildCommon.makeSpan)(["mrel", "x-arrow"], [vlist], options);
- };
-
- groupTypes.phantom = function (group, options) {
- var elements = buildExpression(group.value.value, options.withPhantom(), false);
-
- // \phantom isn't supposed to affect the elements it contains.
- // See "color" for more details.
- return new _buildCommon2.default.makeFragment(elements);
- };
-
- groupTypes.mclass = function (group, options) {
- var elements = buildExpression(group.value.value, options, true);
-
- return (0, _buildCommon.makeSpan)([group.value.mclass], elements, options);
- };
-
- /**
- * buildGroup is the function that takes a group and calls the correct groupType
- * function for it. It also handles the interaction of size and style changes
- * between parents and children.
- */
- var buildGroup = function buildGroup(group, options, baseOptions) {
- if (!group) {
- return (0, _buildCommon.makeSpan)();
- }
-
- if (groupTypes[group.type]) {
- // Call the groupTypes function
- var groupNode = groupTypes[group.type](group, options);
-
- // If the size changed between the parent and the current group, account
- // for that size difference.
- if (baseOptions && options.size !== baseOptions.size) {
- groupNode = (0, _buildCommon.makeSpan)(options.sizingClasses(baseOptions), [groupNode], options);
-
- var multiplier = options.sizeMultiplier / baseOptions.sizeMultiplier;
-
- groupNode.height *= multiplier;
- groupNode.depth *= multiplier;
- }
-
- return groupNode;
- } else {
- throw new _ParseError2.default("Got group of unknown type: '" + group.type + "'");
- }
- };
-
- /**
- * Take an entire parse tree, and build it into an appropriate set of HTML
- * nodes.
- */
- var buildHTML = function buildHTML(tree, options) {
- // buildExpression is destructive, so we need to make a clone
- // of the incoming tree so that it isn't accidentally changed
- tree = JSON.parse((0, _stringify2.default)(tree));
-
- // Build the expression contained in the tree
- var expression = buildExpression(tree, options, true);
- var body = (0, _buildCommon.makeSpan)(["base"], expression, options);
-
- // Add struts, which ensure that the top of the HTML element falls at the
- // height of the expression, and the bottom of the HTML element falls at the
- // depth of the expression.
- var topStrut = (0, _buildCommon.makeSpan)(["strut"]);
- var bottomStrut = (0, _buildCommon.makeSpan)(["strut", "bottom"]);
-
- topStrut.style.height = body.height + "em";
- bottomStrut.style.height = body.height + body.depth + "em";
- // We'd like to use `vertical-align: top` but in IE 9 this lowers the
- // baseline of the box to the bottom of this strut (instead staying in the
- // normal place) so we use an absolute value for vertical-align instead
- bottomStrut.style.verticalAlign = -body.depth + "em";
-
- // Wrap the struts and body together
- var htmlNode = (0, _buildCommon.makeSpan)(["katex-html"], [topStrut, bottomStrut, body]);
-
- htmlNode.setAttribute("aria-hidden", "true");
-
- return htmlNode;
- };
-
- module.exports = buildHTML;
-
- },{"./ParseError":29,"./Style":33,"./buildCommon":34,"./delimiter":38,"./domTree":39,"./stretchy":47,"./units":50,"./utils":51,"babel-runtime/core-js/json/stringify":2}],36:[function(require,module,exports){
-
- var _buildCommon = require("./buildCommon");
-
- var _buildCommon2 = _interopRequireDefault(_buildCommon);
-
- var _fontMetrics = require("./fontMetrics");
-
- var _fontMetrics2 = _interopRequireDefault(_fontMetrics);
-
- var _mathMLTree = require("./mathMLTree");
-
- var _mathMLTree2 = _interopRequireDefault(_mathMLTree);
-
- var _ParseError = require("./ParseError");
-
- var _ParseError2 = _interopRequireDefault(_ParseError);
-
- var _Style = require("./Style");
-
- var _Style2 = _interopRequireDefault(_Style);
-
- var _symbols = require("./symbols");
-
- var _symbols2 = _interopRequireDefault(_symbols);
-
- var _utils = require("./utils");
-
- var _utils2 = _interopRequireDefault(_utils);
-
- var _stretchy = require("./stretchy");
-
- var _stretchy2 = _interopRequireDefault(_stretchy);
-
- function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
- /**
- * Takes a symbol and converts it into a MathML text node after performing
- * optional replacement from symbols.js.
- */
- /**
- * This file converts a parse tree into a cooresponding MathML tree. The main
- * entry point is the `buildMathML` function, which takes a parse tree from the
- * parser.
- */
-
- var makeText = function makeText(text, mode) {
- if (_symbols2.default[mode][text] && _symbols2.default[mode][text].replace) {
- text = _symbols2.default[mode][text].replace;
- }
-
- return new _mathMLTree2.default.TextNode(text);
- };
-
- /**
- * Returns the math variant as a string or null if none is required.
- */
- var getVariant = function getVariant(group, options) {
- var font = options.font;
- if (!font) {
- return null;
- }
-
- var mode = group.mode;
- if (font === "mathit") {
- return "italic";
- }
-
- var value = group.value;
- if (_utils2.default.contains(["\\imath", "\\jmath"], value)) {
- return null;
- }
-
- if (_symbols2.default[mode][value] && _symbols2.default[mode][value].replace) {
- value = _symbols2.default[mode][value].replace;
- }
-
- var fontName = _buildCommon.fontMap[font].fontName;
- if (_fontMetrics2.default.getCharacterMetrics(value, fontName)) {
- return _buildCommon.fontMap[options.font].variant;
- }
-
- return null;
- };
-
- /**
- * Functions for handling the different types of groups found in the parse
- * tree. Each function should take a parse group and return a MathML node.
- */
- var groupTypes = {};
-
- var defaultVariant = {
- "mi": "italic",
- "mn": "normal",
- "mtext": "normal"
- };
-
- groupTypes.mathord = function (group, options) {
- var node = new _mathMLTree2.default.MathNode("mi", [makeText(group.value, group.mode)]);
-
- var variant = getVariant(group, options) || "italic";
- if (variant !== defaultVariant[node.type]) {
- node.setAttribute("mathvariant", variant);
- }
- return node;
- };
-
- groupTypes.textord = function (group, options) {
- var text = makeText(group.value, group.mode);
-
- var variant = getVariant(group, options) || "normal";
-
- var node = void 0;
- if (group.mode === 'text') {
- node = new _mathMLTree2.default.MathNode("mtext", [text]);
- } else if (/[0-9]/.test(group.value)) {
- // TODO(kevinb) merge adjacent nodes
- // do it as a post processing step
- node = new _mathMLTree2.default.MathNode("mn", [text]);
- } else if (group.value === "\\prime") {
- node = new _mathMLTree2.default.MathNode("mo", [text]);
- } else {
- node = new _mathMLTree2.default.MathNode("mi", [text]);
- }
- if (variant !== defaultVariant[node.type]) {
- node.setAttribute("mathvariant", variant);
- }
-
- return node;
- };
-
- groupTypes.bin = function (group) {
- var node = new _mathMLTree2.default.MathNode("mo", [makeText(group.value, group.mode)]);
-
- return node;
- };
-
- groupTypes.rel = function (group) {
- var node = new _mathMLTree2.default.MathNode("mo", [makeText(group.value, group.mode)]);
-
- return node;
- };
-
- groupTypes.open = function (group) {
- var node = new _mathMLTree2.default.MathNode("mo", [makeText(group.value, group.mode)]);
-
- return node;
- };
-
- groupTypes.close = function (group) {
- var node = new _mathMLTree2.default.MathNode("mo", [makeText(group.value, group.mode)]);
-
- return node;
- };
-
- groupTypes.inner = function (group) {
- var node = new _mathMLTree2.default.MathNode("mo", [makeText(group.value, group.mode)]);
-
- return node;
- };
-
- groupTypes.punct = function (group) {
- var node = new _mathMLTree2.default.MathNode("mo", [makeText(group.value, group.mode)]);
-
- node.setAttribute("separator", "true");
-
- return node;
- };
-
- groupTypes.ordgroup = function (group, options) {
- var inner = buildExpression(group.value, options);
-
- var node = new _mathMLTree2.default.MathNode("mrow", inner);
-
- return node;
- };
-
- groupTypes.text = function (group, options) {
- var body = group.value.body;
-
- // Convert each element of the body into MathML, and combine consecutive
- // outputs into a single tag. In this way, we don't
- // nest non-text items (e.g., $nested-math$) within an .
- var inner = [];
- var currentText = null;
- for (var i = 0; i < body.length; i++) {
- var _group = buildGroup(body[i], options);
- if (_group.type === 'mtext' && currentText != null) {
- Array.prototype.push.apply(currentText.children, _group.children);
- } else {
- inner.push(_group);
- if (_group.type === 'mtext') {
- currentText = _group;
- }
- }
- }
-
- // If there is a single tag in the end (presumably ),
- // just return it. Otherwise, wrap them in an .
- if (inner.length === 1) {
- return inner[0];
- } else {
- return new _mathMLTree2.default.MathNode("mrow", inner);
- }
- };
-
- groupTypes.color = function (group, options) {
- var inner = buildExpression(group.value.value, options);
-
- var node = new _mathMLTree2.default.MathNode("mstyle", inner);
-
- node.setAttribute("mathcolor", group.value.color);
-
- return node;
- };
-
- groupTypes.supsub = function (group, options) {
- // Is the inner group a relevant horizonal brace?
- var isBrace = false;
- var isOver = void 0;
- var isSup = void 0;
- if (group.value.base) {
- if (group.value.base.value.type === "horizBrace") {
- isSup = group.value.sup ? true : false;
- if (isSup === group.value.base.value.isOver) {
- isBrace = true;
- isOver = group.value.base.value.isOver;
- }
- }
- }
-
- var removeUnnecessaryRow = true;
- var children = [buildGroup(group.value.base, options, removeUnnecessaryRow)];
-
- if (group.value.sub) {
- children.push(buildGroup(group.value.sub, options, removeUnnecessaryRow));
- }
-
- if (group.value.sup) {
- children.push(buildGroup(group.value.sup, options, removeUnnecessaryRow));
- }
-
- var nodeType = void 0;
- if (isBrace) {
- nodeType = isOver ? "mover" : "munder";
- } else if (!group.value.sub) {
- nodeType = "msup";
- } else if (!group.value.sup) {
- nodeType = "msub";
- } else {
- var base = group.value.base;
- if (base && base.value.limits && options.style === _Style2.default.DISPLAY) {
- nodeType = "munderover";
- } else {
- nodeType = "msubsup";
- }
- }
-
- var node = new _mathMLTree2.default.MathNode(nodeType, children);
-
- return node;
- };
-
- groupTypes.genfrac = function (group, options) {
- var node = new _mathMLTree2.default.MathNode("mfrac", [buildGroup(group.value.numer, options), buildGroup(group.value.denom, options)]);
-
- if (!group.value.hasBarLine) {
- node.setAttribute("linethickness", "0px");
- }
-
- if (group.value.leftDelim != null || group.value.rightDelim != null) {
- var withDelims = [];
-
- if (group.value.leftDelim != null) {
- var leftOp = new _mathMLTree2.default.MathNode("mo", [new _mathMLTree2.default.TextNode(group.value.leftDelim)]);
-
- leftOp.setAttribute("fence", "true");
-
- withDelims.push(leftOp);
- }
-
- withDelims.push(node);
-
- if (group.value.rightDelim != null) {
- var rightOp = new _mathMLTree2.default.MathNode("mo", [new _mathMLTree2.default.TextNode(group.value.rightDelim)]);
-
- rightOp.setAttribute("fence", "true");
-
- withDelims.push(rightOp);
- }
-
- var outerNode = new _mathMLTree2.default.MathNode("mrow", withDelims);
-
- return outerNode;
- }
-
- return node;
- };
-
- groupTypes.array = function (group, options) {
- return new _mathMLTree2.default.MathNode("mtable", group.value.body.map(function (row) {
- return new _mathMLTree2.default.MathNode("mtr", row.map(function (cell) {
- return new _mathMLTree2.default.MathNode("mtd", [buildGroup(cell, options)]);
- }));
- }));
- };
-
- groupTypes.sqrt = function (group, options) {
- var node = void 0;
- if (group.value.index) {
- node = new _mathMLTree2.default.MathNode("mroot", [buildGroup(group.value.body, options), buildGroup(group.value.index, options)]);
- } else {
- node = new _mathMLTree2.default.MathNode("msqrt", [buildGroup(group.value.body, options)]);
- }
-
- return node;
- };
-
- groupTypes.leftright = function (group, options) {
- var inner = buildExpression(group.value.body, options);
-
- if (group.value.left !== ".") {
- var leftNode = new _mathMLTree2.default.MathNode("mo", [makeText(group.value.left, group.mode)]);
-
- leftNode.setAttribute("fence", "true");
-
- inner.unshift(leftNode);
- }
-
- if (group.value.right !== ".") {
- var rightNode = new _mathMLTree2.default.MathNode("mo", [makeText(group.value.right, group.mode)]);
-
- rightNode.setAttribute("fence", "true");
-
- inner.push(rightNode);
- }
-
- var outerNode = new _mathMLTree2.default.MathNode("mrow", inner);
-
- return outerNode;
- };
-
- groupTypes.middle = function (group, options) {
- var middleNode = new _mathMLTree2.default.MathNode("mo", [makeText(group.value.middle, group.mode)]);
- middleNode.setAttribute("fence", "true");
- return middleNode;
- };
-
- groupTypes.accent = function (group, options) {
- var accentNode = void 0;
- if (group.value.isStretchy) {
- accentNode = _stretchy2.default.mathMLnode(group.value.label);
- } else {
- accentNode = new _mathMLTree2.default.MathNode("mo", [makeText(group.value.label, group.mode)]);
- }
-
- var node = new _mathMLTree2.default.MathNode("mover", [buildGroup(group.value.base, options), accentNode]);
-
- node.setAttribute("accent", "true");
-
- return node;
- };
-
- groupTypes.spacing = function (group) {
- var node = void 0;
-
- if (group.value === "\\ " || group.value === "\\space" || group.value === " " || group.value === "~") {
- node = new _mathMLTree2.default.MathNode("mtext", [new _mathMLTree2.default.TextNode("\xA0")]);
- } else {
- node = new _mathMLTree2.default.MathNode("mspace");
-
- node.setAttribute("width", _buildCommon2.default.spacingFunctions[group.value].size);
- }
-
- return node;
- };
-
- groupTypes.op = function (group, options) {
- var node = void 0;
-
- // TODO(emily): handle big operators using the `largeop` attribute
-
- if (group.value.symbol) {
- // This is a symbol. Just add the symbol.
- node = new _mathMLTree2.default.MathNode("mo", [makeText(group.value.body, group.mode)]);
- } else if (group.value.value) {
- // This is an operator with children. Add them.
- node = new _mathMLTree2.default.MathNode("mo", buildExpression(group.value.value, options));
- } else {
- // This is a text operator. Add all of the characters from the
- // operator's name.
- // TODO(emily): Add a space in the middle of some of these
- // operators, like \limsup.
- node = new _mathMLTree2.default.MathNode("mi", [new _mathMLTree2.default.TextNode(group.value.body.slice(1))]);
- }
-
- return node;
- };
-
- groupTypes.mod = function (group, options) {
- var inner = [];
-
- if (group.value.modType === "pod" || group.value.modType === "pmod") {
- inner.push(new _mathMLTree2.default.MathNode("mo", [makeText("(", group.mode)]));
- }
- if (group.value.modType !== "pod") {
- inner.push(new _mathMLTree2.default.MathNode("mo", [makeText("mod", group.mode)]));
- }
- if (group.value.value) {
- var space = new _mathMLTree2.default.MathNode("mspace");
- space.setAttribute("width", "0.333333em");
- inner.push(space);
- inner = inner.concat(buildExpression(group.value.value, options));
- }
- if (group.value.modType === "pod" || group.value.modType === "pmod") {
- inner.push(new _mathMLTree2.default.MathNode("mo", [makeText(")", group.mode)]));
- }
-
- return new _mathMLTree2.default.MathNode("mo", inner);
- };
-
- groupTypes.katex = function (group) {
- var node = new _mathMLTree2.default.MathNode("mtext", [new _mathMLTree2.default.TextNode("KaTeX")]);
-
- return node;
- };
-
- groupTypes.font = function (group, options) {
- var font = group.value.font;
- return buildGroup(group.value.body, options.withFont(font));
- };
-
- groupTypes.delimsizing = function (group) {
- var children = [];
-
- if (group.value.value !== ".") {
- children.push(makeText(group.value.value, group.mode));
- }
-
- var node = new _mathMLTree2.default.MathNode("mo", children);
-
- if (group.value.mclass === "mopen" || group.value.mclass === "mclose") {
- // Only some of the delimsizing functions act as fences, and they
- // return "mopen" or "mclose" mclass.
- node.setAttribute("fence", "true");
- } else {
- // Explicitly disable fencing if it's not a fence, to override the
- // defaults.
- node.setAttribute("fence", "false");
- }
-
- return node;
- };
-
- groupTypes.styling = function (group, options) {
- // Figure out what style we're changing to.
- // TODO(kevinb): dedupe this with buildHTML.js
- // This will be easier of handling of styling nodes is in the same file.
- var styleMap = {
- "display": _Style2.default.DISPLAY,
- "text": _Style2.default.TEXT,
- "script": _Style2.default.SCRIPT,
- "scriptscript": _Style2.default.SCRIPTSCRIPT
- };
-
- var newStyle = styleMap[group.value.style];
- var newOptions = options.havingStyle(newStyle);
-
- var inner = buildExpression(group.value.value, newOptions);
-
- var node = new _mathMLTree2.default.MathNode("mstyle", inner);
-
- var styleAttributes = {
- "display": ["0", "true"],
- "text": ["0", "false"],
- "script": ["1", "false"],
- "scriptscript": ["2", "false"]
- };
-
- var attr = styleAttributes[group.value.style];
-
- node.setAttribute("scriptlevel", attr[0]);
- node.setAttribute("displaystyle", attr[1]);
-
- return node;
- };
-
- groupTypes.sizing = function (group, options) {
- var newOptions = options.havingSize(group.value.size);
- var inner = buildExpression(group.value.value, newOptions);
-
- var node = new _mathMLTree2.default.MathNode("mstyle", inner);
-
- // TODO(emily): This doesn't produce the correct size for nested size
- // changes, because we don't keep state of what style we're currently
- // in, so we can't reset the size to normal before changing it. Now
- // that we're passing an options parameter we should be able to fix
- // this.
- node.setAttribute("mathsize", newOptions.sizeMultiplier + "em");
-
- return node;
- };
-
- groupTypes.overline = function (group, options) {
- var operator = new _mathMLTree2.default.MathNode("mo", [new _mathMLTree2.default.TextNode("\u203E")]);
- operator.setAttribute("stretchy", "true");
-
- var node = new _mathMLTree2.default.MathNode("mover", [buildGroup(group.value.body, options), operator]);
- node.setAttribute("accent", "true");
-
- return node;
- };
-
- groupTypes.underline = function (group, options) {
- var operator = new _mathMLTree2.default.MathNode("mo", [new _mathMLTree2.default.TextNode("\u203E")]);
- operator.setAttribute("stretchy", "true");
-
- var node = new _mathMLTree2.default.MathNode("munder", [buildGroup(group.value.body, options), operator]);
- node.setAttribute("accentunder", "true");
-
- return node;
- };
-
- groupTypes.accentUnder = function (group, options) {
- var accentNode = _stretchy2.default.mathMLnode(group.value.label);
- var node = new _mathMLTree2.default.MathNode("munder", [buildGroup(group.value.body, options), accentNode]);
- node.setAttribute("accentunder", "true");
- return node;
- };
-
- groupTypes.enclose = function (group, options) {
- var node = new _mathMLTree2.default.MathNode("menclose", [buildGroup(group.value.body, options)]);
- var notation = "";
- switch (group.value.label) {
- case "\\bcancel":
- notation = "downdiagonalstrike";
- break;
- case "\\sout":
- notation = "horizontalstrike";
- break;
- case "\\fbox":
- notation = "box";
- break;
- default:
- notation = "updiagonalstrike";
- }
- node.setAttribute("notation", notation);
- return node;
- };
-
- groupTypes.horizBrace = function (group, options) {
- var accentNode = _stretchy2.default.mathMLnode(group.value.label);
- return new _mathMLTree2.default.MathNode(group.value.isOver ? "mover" : "munder", [buildGroup(group.value.base, options), accentNode]);
- };
-
- groupTypes.xArrow = function (group, options) {
- var arrowNode = _stretchy2.default.mathMLnode(group.value.label);
- var node = void 0;
- var lowerNode = void 0;
-
- if (group.value.body) {
- var upperNode = buildGroup(group.value.body, options);
- if (group.value.below) {
- lowerNode = buildGroup(group.value.below, options);
- node = new _mathMLTree2.default.MathNode("munderover", [arrowNode, lowerNode, upperNode]);
- } else {
- node = new _mathMLTree2.default.MathNode("mover", [arrowNode, upperNode]);
- }
- } else if (group.value.below) {
- lowerNode = buildGroup(group.value.below, options);
- node = new _mathMLTree2.default.MathNode("munder", [arrowNode, lowerNode]);
- } else {
- node = new _mathMLTree2.default.MathNode("mover", [arrowNode]);
- }
- return node;
- };
-
- groupTypes.rule = function (group) {
- // TODO(emily): Figure out if there's an actual way to draw black boxes
- // in MathML.
- var node = new _mathMLTree2.default.MathNode("mrow");
-
- return node;
- };
-
- groupTypes.kern = function (group) {
- // TODO(kevin): Figure out if there's a way to add space in MathML
- var node = new _mathMLTree2.default.MathNode("mrow");
-
- return node;
- };
-
- groupTypes.llap = function (group, options) {
- var node = new _mathMLTree2.default.MathNode("mpadded", [buildGroup(group.value.body, options)]);
-
- node.setAttribute("lspace", "-1width");
- node.setAttribute("width", "0px");
-
- return node;
- };
-
- groupTypes.rlap = function (group, options) {
- var node = new _mathMLTree2.default.MathNode("mpadded", [buildGroup(group.value.body, options)]);
-
- node.setAttribute("width", "0px");
-
- return node;
- };
-
- groupTypes.phantom = function (group, options) {
- var inner = buildExpression(group.value.value, options);
- return new _mathMLTree2.default.MathNode("mphantom", inner);
- };
-
- groupTypes.mclass = function (group, options) {
- var inner = buildExpression(group.value.value, options);
- return new _mathMLTree2.default.MathNode("mstyle", inner);
- };
-
- /**
- * Takes a list of nodes, builds them, and returns a list of the generated
- * MathML nodes. A little simpler than the HTML version because we don't do any
- * previous-node handling.
- */
- var buildExpression = function buildExpression(expression, options) {
- var groups = [];
- for (var i = 0; i < expression.length; i++) {
- var group = expression[i];
- groups.push(buildGroup(group, options));
- }
-
- // TODO(kevinb): combine \\not with mrels and mords
-
- return groups;
- };
-
- /**
- * Takes a group from the parser and calls the appropriate groupTypes function
- * on it to produce a MathML node.
- */
- // TODO(kevinb): determine if removeUnnecessaryRow should always be true
- var buildGroup = function buildGroup(group, options) {
- var removeUnnecessaryRow = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : false;
-
- if (!group) {
- return new _mathMLTree2.default.MathNode("mrow");
- }
-
- if (groupTypes[group.type]) {
- // Call the groupTypes function
- var result = groupTypes[group.type](group, options);
- if (removeUnnecessaryRow) {
- if (result.type === "mrow" && result.children.length === 1) {
- return result.children[0];
- }
- }
- return result;
- } else {
- throw new _ParseError2.default("Got group of unknown type: '" + group.type + "'");
- }
- };
-
- /**
- * Takes a full parse tree and settings and builds a MathML representation of
- * it. In particular, we put the elements from building the parse tree into a
- * tag so we can also include that TeX source as an annotation.
- *
- * Note that we actually return a domTree element with a `