Create a Comprehensive and Profitable System for Predicting the
- Outcomes of NBA Games.
-
-
-
Comprehensive Approach
-
Under the 'comprehensive' aspect, the project will explore and test all plausible prediction methods,
- ensuring an evolving scope and prioritization based on the utility of the results. This creates a
- potentially never-ending project scope, focusing on the most impactful methods first.
-
-
Profitability Focus
-
The 'profitable' aspect aims to transcend theoretical exercises, focusing on generating direct financial
- gains or actionable insights for profitable betting decisions. However, consistent success in
- outperforming betting markets presents challenges, including the potential erosion of profitability if
- widely accessible. Therefore, while aiming for profitability, the project will be strategically managed
- to balance public access and financial viability.
-
-
Broad Definition of Outcomes
-
Initially, the project will focus on predicting the final score margins. In its long-term vision, it will
- expand to cover other betting domains like over/under and player props, embracing a broad definition of
- 'outcomes'.
-
-
This project is not just an analysis or a static model, but a continuously evolving resource aimed at
- setting new standards in predictive analytics for NBA games.
-
-
Motivation
-
NBA betting uniquely aligns with my interests, knowledge, skills, and goals, making it an exciting and
- beneficial project for me - a fortunate convergence of passions!
-
-
-
NBA Enthusiast: My fascination with professional basketball, particularly from an
- analytical and financial perspective, started in 2015. Growing up in Illinois, I chose to support
- teams like the Packers (NFL) and the Cardinals (MLB), diverging from my family's Chicago favorites.
- The Kobe Lakers of the late 2010s initially drew my attention, but the electrifying 2015-2016 NBA
- season, with its memorable moments and teams like the Warriors and the Spurs, truly captivated me.
- Today, I enjoy following teams like the Spurs for their game-changing talents and occasionally tune
- into the Warriors and Nuggets, complementing my viewing with insightful basketball podcasts.
-
-
Data Science Career: Data science entered my life out of necessity rather than a
- traditional educational path. I view it as a versatile toolkit more than a profession, focusing on
- practical application over theoretical knowledge.
-
-
Sports Analytics Enthusiast: A lifelong interest in sports analytics began with
- baseball and expanded into other sports. My childhood was filled with video games of various sports
- leagues, where I focused more on simulating seasons and managing teams than playing the games
- themselves. This passion extended to keeping imaginary stats and scores while playing sports in my
- yard, laying the groundwork for my current interests.
-
-
Investment Background: My educational background in finance, influenced by my
- uncle, initially led me down a traditional path. However, the post-recession job market shifted my
- focus towards applying financial concepts to diverse and emerging markets. This experience has given
- me unique insights into potential investment opportunities in fields like sports betting, beyond
- conventional investment avenues.
-
-
-
Plan
-
How do we predict the outcome of an NBA game? What are the inputs, and how do they interplay to yield
- accurate predictions? From a data science viewpoint, the challenge lies in identifying the optimal
- feature set and designing an effective model architecture.
-
-
Given the structured nature of sports and the abundant public data, the approach to this problem can vary
- significantly. The vast amount of data available for a single NBA game outstrips what is typically found
- in fields like finance, manufacturing, or IoT in terms of both breadth and depth. This abundance is both
- a blessing and a challenge: the options are plentiful, but selecting the right ones and managing them
- effectively is crucial.
-
-
Below is the current framework for organizing this project. It outlines the proposed methodology, data
- sources, and model structure. This framework is open to evolution, and I welcome suggestions for
- refinement or alternative approaches.
-
-
How to predict an NBA game result?
-
Organizing and conceptualizing approaches to NBA game predictions involves multiple layers, each
- influenced by data sources and model architectures. We've divided this complex question into four
- distinct levels. Each level can function independently for predictions or be aggregated as part of a
- higher-level framework.
Player Prediction Framework: This level focuses on individual player performance,
- aiming to quantify a player's quality. A simple example is estimating a team's score by summing up
- the players' average points per game.
-
-
Player Interaction and Synergy Framework: This framework centers on how players
- perform in various combinations on the court. It explores questions like how certain player pairings
- or lineup compositions affect overall team performance, highlighting the idea that the whole can be
- greater than the sum of its parts.
-
-
Team Prediction Framework: This is the conventional level for predicting game
- outcomes, asking how one team compares to another. It's also the level at which betting lines are
- typically set, like "GSW -8 vs SAC +8" or "PHX -210 vs DAL +240".
-
-
Game Prediction Framework: This comprehensive level includes all factors that could
- impact game results: game location, referee decisions, schedule effects (back-to-back games, travel,
- rest days), organizational incentives (tanking, playoff seeding), coaching styles, etc. It also
- encompasses more ephemeral data like betting trends, line movements, and player availability
- (injuries, rest days).
-
-
-
Data Point Examples
-
Deciding which data points to pursue is a complex yet crucial part of this project. The challenge lies in
- identifying the most relevant and impactful types of data from a plethora of available sources. This
- includes determining the optimal format and granularity of the data, whether it be raw data, traditional
- stats, advanced metrics, or even public perception and power rankings.
-
-
Initially, the project aimed to collect a broad array of data categories, but it quickly became evident
- that each data point carries its own set of challenges, especially in terms of acquisition and
- management. Consequently, a more strategic approach is needed, focusing on the most beneficial data in
- terms of time and resources.
-
-
Data acquisition has been the most time-consuming phase so far, further complicated by the time series
- nature of sports data. Predictive metrics vary in their utility based on the timeframe considered - be
- it team history, season-to-date stats, recent performance, or data from the last game. Additionally,
- machine learning and deep learning models require point-in-time data, which poses its own set of
- challenges in terms of availability and structuring.
Below are examples of the types of data points being considered, showcasing the breadth and depth of the
- information landscape we're navigating.
-
-
-
-
-
-
Raw Data
-
Traditional Statistics
-
Advanced Statistics
-
Subjective
-
Other
-
-
-
-
-
-
-
Play by Play Logs
-
Game Video
-
Camera Tracking
-
-
-
-
-
Box Scores
-
Points, Rebounds, Assists
-
Win Loss Records
-
-
-
-
-
-
EPM
-
PER
-
RAPTOR
-
-
-
-
-
Power Rankings
-
NBA2k Ratings
-
Social Media Sentiment
-
-
-
-
-
Schedule Effects
-
Injuries
-
Referees
-
-
-
-
-
-
-
-
-
-
-
Current Goal: Focusing on Point Spread and Team Prediction
-
The overarching objective of this project is to develop a sophisticated system to tackle the challenging
- goal of predicting NBA game outcomes. Initially, the focus is narrowed down to predicting the point
- spread using the team prediction framework. This approach aligns with the most common method in betting
- markets and offers a tangible starting point.
-
-
The aim is to surpass the accuracy of betting lines set by Vegas, which predict the game winner and
- margin. While these lines are a strong benchmark, there's an average discrepancy of over 9 points per
- game compared to actual results, highlighting a significant room for improvement. The graph below
- illustrates the evolution of this average discrepancy over time.
-
-
-
-
However, before delving into the methodology, it's important to acknowledge a unique challenge in this
- endeavor. Vegas, with its extensive resources and data, sets a high bar for predictive accuracy.
- Simultaneously, the public availability of Vegas lines offers a valuable data source for modeling. This
- dual nature creates a tight performance range, making it a delicate balance to measure real progress and
- achieve tangible improvements.
-
-
-
-
-
Project Structure: Data Science Workflow and Infrastructure
-
The project's architecture is built around a relational database, integrated with a series of data
- processing and model training steps. The core database, currently hosted on Amazon RDS, utilizes
- PostgreSQL, but the system is designed to be adaptable to other platforms. The daily workflow involves
- updating the database with the latest data, followed by data processing, feature engineering, model
- training, and ultimately, using the model for predictions to inform betting strategies. This entire
- process is encapsulated within a web application and dashboard, providing a comprehensive and
- user-friendly interface. Below is a flowchart that outlines this data science workflow.
-
-
-
-
-
-
-
-
Data Sourcing and Storage: Building the Foundation
-
The data sourcing and storage phase is arguably the most challenging and time-intensive aspect of this
- project. The data needed falls into three primary categories:
-
-
Game Data: This includes fundamental details like dates, times, teams, and scores
- of the games.
-
Betting Market Data: Crucial for the betting aspect, this includes various betting
- lines and odds.
-
Feature Data: Comprising the data points used for making predictions, this is the
- backbone of our modeling.
-
-
While acquiring current data is relatively straightforward, the real challenge lies in sourcing
- historical data for training and testing machine learning and deep learning models.
-
Initially, the approach involved using web scraping tools like Scrapy to gather data at minimal costs.
- However, this method proved to be laborious and fraught with complexities. To streamline the process,
- the project will transition to using paid data services, allowing a sharper focus on modeling and
- prediction. Below is a flowchart detailing the data sourcing and storage process, along with links to
- the current and future data sources and the relevant project code.
Data Prep and Feature Engineering: The Core of Predictive
- Analytics
-
-
-
-
This section delves into the critical steps of data preparation and feature engineering, which form the
- backbone of our predictive modeling. The main steps include:
-
-
Loading Data: Retrieval of data from games and raw features tables.
-
Initial Feature Engineering: Adjusting raw metrics before merging, like
- transforming points per game into relative league averages and rankings.
-
Merging Data: Combining games and feature data into a single record for each game,
- with a unique game_id as the primary key.
-
Post-Merge Feature Engineering: Creating game-level features after merging, such as
- differences in team statistics or rest days.
-
Saving Records: Storing each game's data as a record in the all_features_json
- table, which includes a game_id and a JSON object with all features for that game. This table is
- pivotal for model training and testing.
-
-
-
Important considerations in this phase:
-
-
The all_features_json table primarily serves to integrate an extensive, evolving feature list into a
- relational database framework. It is usually converted into a DataFrame using pandas for further
- processing.
-
A key challenge is avoiding data leakage during merging and feature engineering. It’s crucial to
- meticulously manage the dates for data merging (e.g., using the previous day's data for a game) and
- to accurately calculate rolling features based on the correct historical games.
-
-
-
src/etl -
- Repository link for Data Prep and Feature Engineering code.
-
-
-
-
-
-
Exploratory Data Analysis
-
-
Vegas Miss Analysis
-
An in-depth analysis of the Vegas miss data revealed a consistent average miss amount across various
- categorizations. This uniformity, while somewhat unexpected, underlines the robustness of the Vegas
- lines. A hypothesis about higher miss amounts early in the season due to data scarcity and uncertain
- team dynamics was explored. While the first month showed the highest average miss, the difference was
- not markedly significant. Weekly analysis further indicates that the miss average fluctuates randomly
- around the overall mean.
-
-
-
-
Feature Importance
-
In addressing the challenge of selecting from a vast array of potential features for the modeling
- process, methods such as correlation, mutual information, and feature importance ranking were employed.
- However, no single feature emerged as a standout predictor. This result may reflect the inherent
- complexity of accurately predicting game outcomes against Vegas lines. A significant ongoing aspect of
- this project is identifying the most effective feature set for prediction accuracy.
ML/DL Modeling: Exploring Automated and Custom Approaches
-
-
This project's modeling stage is divided into two distinct approaches. The first involves leveraging
- AutoML to explore a range of possibilities in the basic tabular format of the problem. The second
- approach focuses on developing a custom model architecture, tailored specifically to the nuances of this
- challenge.
-
-
AutoML
-
-
-
-
-
-
As indicated by the results, consistently outperforming the Vegas lines remains a challenge. This is not
- unexpected, given the complexity of the task and the additional hurdle of overcoming the vig (the
- bookmaker's charge). While a fully successful model has yet to be realized, the AutoML process has
- proven to be an enlightening and potentially valuable first step in many ML/DL projects.
The journey towards a custom model architecture initially centered around a traditional data science
- approach – combining various features from different sources. While this approach aligns with
- conventional methods and may still hold potential, it faces several challenges, including complex data
- collection and potentially mirroring the algorithms used by line setters. To move beyond these
- limitations and add an element of innovation, I am exploring a second approach, which includes the
- following key requirements:
-
-
-
-
Time Series Data Inclusive: A focus on incorporating the sequential nature of
- events in games and across seasons, recognizing the significance of order and timing in the NBA.
-
-
Minimal Data Collection: Streamlining data sourcing to the essentials, aiming for
- maximum impact with minimal data, thereby reducing time and resource investment.
-
Wider Applicability: Extending the scope to cover more comprehensive outcomes,
- moving beyond standard predictions like point spreads or over/unders.
-
Advanced Modeling System: Developing a system that is not only a learning tool but
- also potentially novel compared to the methods used by odds setters.
-
Minimal Human Decisions: Reducing the reliance on human decision-making to minimize
- errors and the limitations of individual expertise.
-
-
-
-
-
Overview - Coming Soon!
-
-
-
-
-
-
-
-
Bet Decisions
-
-
This crucial segment of the project involves the strategic application of model predictions in real-world
- betting scenarios. The process begins with the integration of predictive outputs from our models with
- supplementary data that was not directly factored into the model. This additional data can include current
- trends, team news, player conditions, and other relevant information that might influence game outcomes. The
- aim is to enhance the predictive power of our models by combining their statistical insights with real-time
- contextual data.
-
-
Once the comprehensive decision-making dataset is assembled, it feeds into a sophisticated bet and bankroll
- management system. This system is designed to optimize bet recommendations based on a balance of risk and
- reward, considering factors like betting odds, potential returns, and the overall health of the betting
- bankroll. The ultimate goal is to provide well-informed, data-driven betting recommendations that maximize
- profitability while mitigating risk.
The project includes a user-friendly web application and a companion dashboard, designed to facilitate the
- monitoring and analysis of betting performance. The web app provides real-time and recent game data along
- with prediction information, while the dashboard offers comprehensive metrics on both suggested and actual
- bets (for logged-in users). Although previously hosted on AWS, the operation costs and maintenance
- requirements have led to a shift in strategy, prioritizing a more sustainable approach for this side
- project. Below are screenshots showcasing the web app and dashboard interfaces.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
src/deployment - Repository link for the code of the Web App and
- Dashboard.
-
-
-
-
-
-
-
-
-
-
-
-
-
\ No newline at end of file
diff --git a/docs/website/style.css b/docs/website/style.css
deleted file mode 100644
index f081b87..0000000
--- a/docs/website/style.css
+++ /dev/null
@@ -1,42 +0,0 @@
-/* Custom styles for GitHub branding within the header */
-.github-branding {
- text-decoration: none;
- /* Removes the underline from all anchor tags within */
- display: flex;
- /* Aligns the items next to each other */
- align-items: center;
- /* Aligns items vertically */
-}
-
-/* Custom styles for individual GitHub logos */
-.github-name-logo,
-.github-icon-logo {
- height: 2em;
- /* Ensures both logos have the same height */
- margin: 0 5px;
- /* Adds spacing around the logos */
-}
-
-html {
- scroll-padding-top: 70px;
- /* The value should be the height of your navbar or greater */
-}
-
-/* Default styles for smaller screens */
-.custom-image {
- max-width: 100%;
-}
-
-/* Adjust the size for larger screens (e.g., screens with a width of 1200px or more) and center horizontally */
-@media (min-width: 1200px) {
- .custom-image {
- max-width: 80%;
- /* Adjust the percentage as needed */
- display: block;
- /* Ensures it's centered within its parent container */
- margin: 0 auto;
- /* Centers horizontally */
- margin-top: 1em;
- margin-bottom: 1em;
- }
-}
\ No newline at end of file
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/commonmarker b/docs/website/vendor/bundle/ruby/3.0.0/bin/commonmarker
deleted file mode 100755
index 00993f0..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/commonmarker
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'commonmarker' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('commonmarker', 'commonmarker', version)
-else
-gem "commonmarker", version
-load Gem.bin_path("commonmarker", "commonmarker", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/gemoji b/docs/website/vendor/bundle/ruby/3.0.0/bin/gemoji
deleted file mode 100755
index d6c2ad7..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/gemoji
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'gemoji' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('gemoji', 'gemoji', version)
-else
-gem "gemoji", version
-load Gem.bin_path("gemoji", "gemoji", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/github-pages b/docs/website/vendor/bundle/ruby/3.0.0/bin/github-pages
deleted file mode 100755
index 1406898..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/github-pages
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'github-pages' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('github-pages', 'github-pages', version)
-else
-gem "github-pages", version
-load Gem.bin_path("github-pages", "github-pages", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/jekyll b/docs/website/vendor/bundle/ruby/3.0.0/bin/jekyll
deleted file mode 100755
index ff46a5b..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/jekyll
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'jekyll' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('jekyll', 'jekyll', version)
-else
-gem "jekyll", version
-load Gem.bin_path("jekyll", "jekyll", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/kramdown b/docs/website/vendor/bundle/ruby/3.0.0/bin/kramdown
deleted file mode 100755
index 4c14dca..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/kramdown
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'kramdown' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('kramdown', 'kramdown', version)
-else
-gem "kramdown", version
-load Gem.bin_path("kramdown", "kramdown", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/listen b/docs/website/vendor/bundle/ruby/3.0.0/bin/listen
deleted file mode 100755
index 934c469..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/listen
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'listen' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('listen', 'listen', version)
-else
-gem "listen", version
-load Gem.bin_path("listen", "listen", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/nokogiri b/docs/website/vendor/bundle/ruby/3.0.0/bin/nokogiri
deleted file mode 100755
index 2c0482c..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/nokogiri
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'nokogiri' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('nokogiri', 'nokogiri', version)
-else
-gem "nokogiri", version
-load Gem.bin_path("nokogiri", "nokogiri", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/racc b/docs/website/vendor/bundle/ruby/3.0.0/bin/racc
deleted file mode 100755
index 4fb50db..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/racc
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'racc' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('racc', 'racc', version)
-else
-gem "racc", version
-load Gem.bin_path("racc", "racc", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/rougify b/docs/website/vendor/bundle/ruby/3.0.0/bin/rougify
deleted file mode 100755
index f0ee54c..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/rougify
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'rouge' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('rouge', 'rougify', version)
-else
-gem "rouge", version
-load Gem.bin_path("rouge", "rougify", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/safe_yaml b/docs/website/vendor/bundle/ruby/3.0.0/bin/safe_yaml
deleted file mode 100755
index 1be9bea..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/safe_yaml
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'safe_yaml' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('safe_yaml', 'safe_yaml', version)
-else
-gem "safe_yaml", version
-load Gem.bin_path("safe_yaml", "safe_yaml", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/sass b/docs/website/vendor/bundle/ruby/3.0.0/bin/sass
deleted file mode 100755
index 1e5eae9..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/sass
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'sass' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('sass', 'sass', version)
-else
-gem "sass", version
-load Gem.bin_path("sass", "sass", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/sass-convert b/docs/website/vendor/bundle/ruby/3.0.0/bin/sass-convert
deleted file mode 100755
index cf53b69..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/sass-convert
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'sass' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('sass', 'sass-convert', version)
-else
-gem "sass", version
-load Gem.bin_path("sass", "sass-convert", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/bin/scss b/docs/website/vendor/bundle/ruby/3.0.0/bin/scss
deleted file mode 100755
index 034880c..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/bin/scss
+++ /dev/null
@@ -1,29 +0,0 @@
-#!/usr/bin/env ruby3.0
-#
-# This file was generated by RubyGems.
-#
-# The application 'sass' is installed as part of a gem, and
-# this file is here to facilitate running it.
-#
-
-require 'rubygems'
-
-Gem.use_gemdeps
-
-version = ">= 0.a"
-
-str = ARGV.first
-if str
- str = str.b[/\A_(.*)_\z/, 1]
- if str and Gem::Version.correct?(str)
- version = str
- ARGV.shift
- end
-end
-
-if Gem.respond_to?(:activate_bin_path)
-load Gem.activate_bin_path('sass', 'scss', version)
-else
-gem "sass", version
-load Gem.bin_path("sass", "scss", version)
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/activesupport-7.1.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/activesupport-7.1.1.gem
deleted file mode 100644
index 8abea39..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/activesupport-7.1.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/addressable-2.8.5.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/addressable-2.8.5.gem
deleted file mode 100644
index e58bb94..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/addressable-2.8.5.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/base64-0.1.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/base64-0.1.1.gem
deleted file mode 100644
index bf37e82..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/base64-0.1.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/bigdecimal-3.1.4.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/bigdecimal-3.1.4.gem
deleted file mode 100644
index e326615..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/bigdecimal-3.1.4.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/coffee-script-2.4.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/coffee-script-2.4.1.gem
deleted file mode 100644
index 7e4066d..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/coffee-script-2.4.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/coffee-script-source-1.11.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/coffee-script-source-1.11.1.gem
deleted file mode 100644
index 30d8fd7..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/coffee-script-source-1.11.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/colorator-1.1.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/colorator-1.1.0.gem
deleted file mode 100644
index d5616ad..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/colorator-1.1.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/commonmarker-0.23.10.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/commonmarker-0.23.10.gem
deleted file mode 100644
index bc25526..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/commonmarker-0.23.10.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/concurrent-ruby-1.2.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/concurrent-ruby-1.2.2.gem
deleted file mode 100644
index 8caccaf..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/concurrent-ruby-1.2.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/connection_pool-2.4.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/connection_pool-2.4.1.gem
deleted file mode 100644
index 093ee0e..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/connection_pool-2.4.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/dnsruby-1.70.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/dnsruby-1.70.0.gem
deleted file mode 100644
index 17c9368..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/dnsruby-1.70.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/drb-2.1.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/drb-2.1.1.gem
deleted file mode 100644
index 493cb9a..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/drb-2.1.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/em-websocket-0.5.3.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/em-websocket-0.5.3.gem
deleted file mode 100644
index e5a3da1..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/em-websocket-0.5.3.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/ethon-0.16.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/ethon-0.16.0.gem
deleted file mode 100644
index 2af3d14..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/ethon-0.16.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/eventmachine-1.2.7.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/eventmachine-1.2.7.gem
deleted file mode 100644
index 708d366..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/eventmachine-1.2.7.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/execjs-2.9.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/execjs-2.9.1.gem
deleted file mode 100644
index c979b1a..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/execjs-2.9.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/faraday-2.7.11.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/faraday-2.7.11.gem
deleted file mode 100644
index 2b9a69c..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/faraday-2.7.11.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/faraday-net_http-3.0.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/faraday-net_http-3.0.2.gem
deleted file mode 100644
index f6b5175..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/faraday-net_http-3.0.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/ffi-1.16.3.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/ffi-1.16.3.gem
deleted file mode 100644
index fbca948..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/ffi-1.16.3.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/forwardable-extended-2.6.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/forwardable-extended-2.6.0.gem
deleted file mode 100644
index 370222f..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/forwardable-extended-2.6.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/gemoji-3.0.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/gemoji-3.0.1.gem
deleted file mode 100644
index 5cb301b..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/gemoji-3.0.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/github-pages-228.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/github-pages-228.gem
deleted file mode 100644
index 667e6e7..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/github-pages-228.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/github-pages-health-check-1.17.9.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/github-pages-health-check-1.17.9.gem
deleted file mode 100644
index 4fc475d..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/github-pages-health-check-1.17.9.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/html-pipeline-2.14.3.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/html-pipeline-2.14.3.gem
deleted file mode 100644
index c71e420..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/html-pipeline-2.14.3.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/http_parser.rb-0.8.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/http_parser.rb-0.8.0.gem
deleted file mode 100644
index b7e137f..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/http_parser.rb-0.8.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/i18n-1.14.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/i18n-1.14.1.gem
deleted file mode 100644
index 27d6d5d..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/i18n-1.14.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-3.9.3.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-3.9.3.gem
deleted file mode 100644
index afe09ce..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-3.9.3.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-avatar-0.7.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-avatar-0.7.0.gem
deleted file mode 100644
index cfdc8c9..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-avatar-0.7.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-coffeescript-1.1.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-coffeescript-1.1.1.gem
deleted file mode 100644
index 2069e16..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-coffeescript-1.1.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-commonmark-1.4.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-commonmark-1.4.0.gem
deleted file mode 100644
index 2d7ab5f..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-commonmark-1.4.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-commonmark-ghpages-0.4.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-commonmark-ghpages-0.4.0.gem
deleted file mode 100644
index b9a564e..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-commonmark-ghpages-0.4.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-default-layout-0.1.4.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-default-layout-0.1.4.gem
deleted file mode 100644
index e52d200..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-default-layout-0.1.4.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-feed-0.15.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-feed-0.15.1.gem
deleted file mode 100644
index 7cb3a58..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-feed-0.15.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-gist-1.5.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-gist-1.5.0.gem
deleted file mode 100644
index a202a00..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-gist-1.5.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-github-metadata-2.13.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-github-metadata-2.13.0.gem
deleted file mode 100644
index 5704ac1..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-github-metadata-2.13.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-include-cache-0.2.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-include-cache-0.2.1.gem
deleted file mode 100644
index dcd6f8a..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-include-cache-0.2.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-mentions-1.6.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-mentions-1.6.0.gem
deleted file mode 100644
index 5b8c36c..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-mentions-1.6.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-optional-front-matter-0.3.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-optional-front-matter-0.3.2.gem
deleted file mode 100644
index 8b27c4b..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-optional-front-matter-0.3.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-paginate-1.1.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-paginate-1.1.0.gem
deleted file mode 100644
index 9c7111c..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-paginate-1.1.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-readme-index-0.3.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-readme-index-0.3.0.gem
deleted file mode 100644
index 0a9ece5..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-readme-index-0.3.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-redirect-from-0.16.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-redirect-from-0.16.0.gem
deleted file mode 100644
index 30cd94d..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-redirect-from-0.16.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-relative-links-0.6.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-relative-links-0.6.1.gem
deleted file mode 100644
index d4aaa7f..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-relative-links-0.6.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-remote-theme-0.4.3.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-remote-theme-0.4.3.gem
deleted file mode 100644
index 342e42c..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-remote-theme-0.4.3.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-sass-converter-1.5.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-sass-converter-1.5.2.gem
deleted file mode 100644
index 7f0d488..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-sass-converter-1.5.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-seo-tag-2.8.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-seo-tag-2.8.0.gem
deleted file mode 100644
index 4ad1e11..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-seo-tag-2.8.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-sitemap-1.4.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-sitemap-1.4.0.gem
deleted file mode 100644
index aa185d2..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-sitemap-1.4.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-swiss-1.0.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-swiss-1.0.0.gem
deleted file mode 100644
index 82a2239..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-swiss-1.0.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-architect-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-architect-0.2.0.gem
deleted file mode 100644
index 071df6d..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-architect-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-cayman-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-cayman-0.2.0.gem
deleted file mode 100644
index dbb76fa..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-cayman-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-dinky-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-dinky-0.2.0.gem
deleted file mode 100644
index b406e9e..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-dinky-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-hacker-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-hacker-0.2.0.gem
deleted file mode 100644
index 7e8159f..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-hacker-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-leap-day-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-leap-day-0.2.0.gem
deleted file mode 100644
index d70c966..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-leap-day-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-merlot-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-merlot-0.2.0.gem
deleted file mode 100644
index bd45354..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-merlot-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-midnight-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-midnight-0.2.0.gem
deleted file mode 100644
index c47835a..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-midnight-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-minimal-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-minimal-0.2.0.gem
deleted file mode 100644
index bfd8ab9..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-minimal-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-modernist-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-modernist-0.2.0.gem
deleted file mode 100644
index 4f61e6f..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-modernist-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-primer-0.6.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-primer-0.6.0.gem
deleted file mode 100644
index 2d0cd22..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-primer-0.6.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-slate-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-slate-0.2.0.gem
deleted file mode 100644
index a30d4d8..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-slate-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-tactile-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-tactile-0.2.0.gem
deleted file mode 100644
index 6e7b9ca..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-tactile-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-time-machine-0.2.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-time-machine-0.2.0.gem
deleted file mode 100644
index 6d595b4..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-theme-time-machine-0.2.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-titles-from-headings-0.5.3.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-titles-from-headings-0.5.3.gem
deleted file mode 100644
index a0c9298..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-titles-from-headings-0.5.3.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-watch-2.2.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-watch-2.2.1.gem
deleted file mode 100644
index 0defcd7..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jekyll-watch-2.2.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/jemoji-0.12.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/jemoji-0.12.0.gem
deleted file mode 100644
index 84838f0..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/jemoji-0.12.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/kramdown-2.3.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/kramdown-2.3.2.gem
deleted file mode 100644
index 1fabd52..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/kramdown-2.3.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/kramdown-parser-gfm-1.1.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/kramdown-parser-gfm-1.1.0.gem
deleted file mode 100644
index f087be5..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/kramdown-parser-gfm-1.1.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/liquid-4.0.4.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/liquid-4.0.4.gem
deleted file mode 100644
index fb32676..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/liquid-4.0.4.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/listen-3.8.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/listen-3.8.0.gem
deleted file mode 100644
index 8837e95..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/listen-3.8.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/mercenary-0.3.6.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/mercenary-0.3.6.gem
deleted file mode 100644
index e5333e0..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/mercenary-0.3.6.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/minima-2.5.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/minima-2.5.1.gem
deleted file mode 100644
index 20026a2..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/minima-2.5.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/minitest-5.20.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/minitest-5.20.0.gem
deleted file mode 100644
index 89bd30e..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/minitest-5.20.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/mutex_m-0.1.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/mutex_m-0.1.2.gem
deleted file mode 100644
index bb9a0a6..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/mutex_m-0.1.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/nokogiri-1.15.4-x86_64-linux.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/nokogiri-1.15.4-x86_64-linux.gem
deleted file mode 100644
index 299efee..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/nokogiri-1.15.4-x86_64-linux.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/octokit-4.25.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/octokit-4.25.1.gem
deleted file mode 100644
index 6f25e59..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/octokit-4.25.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/pathutil-0.16.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/pathutil-0.16.2.gem
deleted file mode 100644
index 9dd34cc..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/pathutil-0.16.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/public_suffix-4.0.7.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/public_suffix-4.0.7.gem
deleted file mode 100644
index 18c4dfa..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/public_suffix-4.0.7.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/racc-1.7.3.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/racc-1.7.3.gem
deleted file mode 100644
index 077ab2e..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/racc-1.7.3.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/rb-fsevent-0.11.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/rb-fsevent-0.11.2.gem
deleted file mode 100644
index e645266..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/rb-fsevent-0.11.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/rb-inotify-0.10.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/rb-inotify-0.10.1.gem
deleted file mode 100644
index 276590b..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/rb-inotify-0.10.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/rexml-3.2.6.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/rexml-3.2.6.gem
deleted file mode 100644
index 71a4946..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/rexml-3.2.6.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/rouge-3.26.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/rouge-3.26.0.gem
deleted file mode 100644
index 8c6bf81..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/rouge-3.26.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/ruby2_keywords-0.0.5.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/ruby2_keywords-0.0.5.gem
deleted file mode 100644
index d311c5d..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/ruby2_keywords-0.0.5.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/rubyzip-2.3.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/rubyzip-2.3.2.gem
deleted file mode 100644
index 36fdea6..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/rubyzip-2.3.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/safe_yaml-1.0.5.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/safe_yaml-1.0.5.gem
deleted file mode 100644
index b539b54..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/safe_yaml-1.0.5.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/sass-3.7.4.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/sass-3.7.4.gem
deleted file mode 100644
index b48c3b8..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/sass-3.7.4.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/sass-listen-4.0.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/sass-listen-4.0.0.gem
deleted file mode 100644
index 9464653..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/sass-listen-4.0.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/sawyer-0.9.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/sawyer-0.9.2.gem
deleted file mode 100644
index 5213eb8..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/sawyer-0.9.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/simpleidn-0.2.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/simpleidn-0.2.1.gem
deleted file mode 100644
index fda2b0e..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/simpleidn-0.2.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/terminal-table-1.8.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/terminal-table-1.8.0.gem
deleted file mode 100644
index ac0a89c..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/terminal-table-1.8.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/typhoeus-1.4.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/typhoeus-1.4.0.gem
deleted file mode 100644
index b71baf3..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/typhoeus-1.4.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/tzinfo-2.0.6.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/tzinfo-2.0.6.gem
deleted file mode 100644
index 2c16da8..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/tzinfo-2.0.6.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/unf-0.1.4.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/unf-0.1.4.gem
deleted file mode 100644
index 01f1852..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/unf-0.1.4.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/unf_ext-0.0.8.2.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/unf_ext-0.0.8.2.gem
deleted file mode 100644
index f9a66cc..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/unf_ext-0.0.8.2.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/unicode-display_width-1.8.0.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/unicode-display_width-1.8.0.gem
deleted file mode 100644
index 75166d4..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/unicode-display_width-1.8.0.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/cache/webrick-1.8.1.gem b/docs/website/vendor/bundle/ruby/3.0.0/cache/webrick-1.8.1.gem
deleted file mode 100644
index ac0894b..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/cache/webrick-1.8.1.gem and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/bigdecimal-3.1.4/gem.build_complete b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/bigdecimal-3.1.4/gem.build_complete
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/bigdecimal-3.1.4/gem_make.out b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/bigdecimal-3.1.4/gem_make.out
deleted file mode 100644
index 62e9483..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/bigdecimal-3.1.4/gem_make.out
+++ /dev/null
@@ -1,45 +0,0 @@
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal
-/usr/bin/ruby3.0 -I /usr/lib/ruby/vendor_ruby -r ./siteconf20231104-11184-t2m122.rb extconf.rb
-checking for __builtin_clz()... yes
-checking for __builtin_clzl()... yes
-checking for __builtin_clzll()... yes
-checking for float.h... yes
-checking for math.h... yes
-checking for stdbool.h... yes
-checking for stdlib.h... yes
-checking for x86intrin.h... yes
-checking for _lzcnt_u32() in x86intrin.h... no
-checking for _lzcnt_u64() in x86intrin.h... no
-checking for intrin.h... no
-checking for __lzcnt() in intrin.h... no
-checking for __lzcnt64() in intrin.h... no
-checking for _BitScanReverse() in intrin.h... no
-checking for _BitScanReverse64() in intrin.h... no
-checking for labs() in stdlib.h... yes
-checking for llabs() in stdlib.h... yes
-checking for finite() in math.h... yes
-checking for isfinite() in math.h... no
-checking for ruby/atomic.h... yes
-checking for ruby/internal/has/builtin.h... yes
-checking for ruby/internal/static_assert.h... yes
-checking for rb_rational_num() in ruby.h... yes
-checking for rb_rational_den() in ruby.h... yes
-checking for rb_complex_real() in ruby.h... yes
-checking for rb_complex_imag() in ruby.h... yes
-checking for rb_opts_exception_p() in ruby.h... yes
-checking for rb_category_warn() in ruby.h... yes
-checking for RB_WARN_CATEGORY_DEPRECATED in ruby.h... yes
-creating Makefile
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal
-make DESTDIR\= clean
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal
-make DESTDIR\=
-compiling bigdecimal.c
-compiling missing.c
-linking shared-object bigdecimal.so
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal
-make DESTDIR\= install
-/usr/bin/install -c -m 0755 bigdecimal.so ./.gem.20231104-11184-20hl4x
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/commonmarker-0.23.10/gem.build_complete b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/commonmarker-0.23.10/gem.build_complete
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/commonmarker-0.23.10/gem_make.out b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/commonmarker-0.23.10/gem_make.out
deleted file mode 100644
index 0e3ecf2..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/commonmarker-0.23.10/gem_make.out
+++ /dev/null
@@ -1,62 +0,0 @@
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker
-/usr/bin/ruby3.0 -I /usr/lib/ruby/vendor_ruby -r ./siteconf20231104-11184-q9erce.rb extconf.rb
-creating Makefile
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker
-make DESTDIR\= clean
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker
-make DESTDIR\=
-compiling arena.c
-compiling autolink.c
-compiling blocks.c
-compiling buffer.c
-compiling cmark.c
-compiling cmark_ctype.c
-compiling commonmark.c
-compiling commonmarker.c
-In file included from houdini.h:9,
- from commonmarker.c:3:
-config.h:8: warning: "HAVE_STDBOOL_H" redefined
- 8 | #define HAVE_STDBOOL_H
- |
-In file included from /usr/include/ruby-3.0.0/ruby/internal/config.h:23,
- from /usr/include/ruby-3.0.0/ruby/ruby.h:15,
- from /usr/include/ruby-3.0.0/ruby.h:38,
- from commonmarker.h:9,
- from commonmarker.c:1:
-/usr/include/x86_64-linux-gnu/ruby-3.0.0/ruby/config.h:38: note: this is the location of the previous definition
- 38 | #define HAVE_STDBOOL_H 1
- |
-compiling core-extensions.c
-compiling ext_scanners.c
-compiling footnotes.c
-compiling houdini_href_e.c
-compiling houdini_html_e.c
-compiling houdini_html_u.c
-compiling html.c
-compiling inlines.c
-compiling iterator.c
-compiling latex.c
-compiling linked_list.c
-compiling man.c
-compiling map.c
-compiling node.c
-compiling plaintext.c
-compiling plugin.c
-compiling references.c
-compiling registry.c
-compiling render.c
-compiling scanners.c
-compiling strikethrough.c
-compiling syntax_extension.c
-compiling table.c
-compiling tagfilter.c
-compiling tasklist.c
-compiling utf8.c
-compiling xml.c
-linking shared-object commonmarker/commonmarker.so
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker
-make DESTDIR\= install
-/usr/bin/install -c -m 0755 commonmarker.so ./.gem.20231104-11184-9modoq/commonmarker
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/eventmachine-1.2.7/gem.build_complete b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/eventmachine-1.2.7/gem.build_complete
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/eventmachine-1.2.7/gem_make.out b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/eventmachine-1.2.7/gem_make.out
deleted file mode 100644
index 43a4d78..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/eventmachine-1.2.7/gem_make.out
+++ /dev/null
@@ -1,16 +0,0 @@
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/eventmachine-1.2.7/ext/fastfilereader
-/usr/bin/ruby3.0 -I /usr/lib/ruby/vendor_ruby -r ./siteconf20231104-11184-1uuut9.rb extconf.rb
-creating Makefile
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/eventmachine-1.2.7/ext/fastfilereader
-make DESTDIR\= clean
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/eventmachine-1.2.7/ext/fastfilereader
-make DESTDIR\=
-compiling mapper.cpp
-compiling rubymain.cpp
-linking shared-object fastfilereaderext.so
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/eventmachine-1.2.7/ext/fastfilereader
-make DESTDIR\= install
-/usr/bin/install -c -m 0755 fastfilereaderext.so ./.gem.20231104-11184-z4vrd2
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/ffi-1.16.3/gem.build_complete b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/ffi-1.16.3/gem.build_complete
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/ffi-1.16.3/gem_make.out b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/ffi-1.16.3/gem_make.out
deleted file mode 100644
index 72661b9..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/ffi-1.16.3/gem_make.out
+++ /dev/null
@@ -1,164 +0,0 @@
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c
-/usr/bin/ruby3.0 -I /usr/lib/ruby/vendor_ruby -r ./siteconf20231104-11184-ny2tm4.rb extconf.rb
-checking for ffi.h... no
-checking for ffi.h in /usr/local/include,/usr/include/ffi,/Library/Developer/CommandLineTools/SDKs/MacOSX.sdk/usr/include/ffi,/Applications/Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX.sdk/usr/include/ffi... no
-checking for whether -Wl,--exclude-libs,ALL is accepted as LDFLAGS... yes
-checking for rb_gc_mark_movable()... yes
-checking for whether -pthread is accepted as LDFLAGS... yes
-creating extconf.h
-creating Makefile
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c
-make DESTDIR\= clean
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c
-make DESTDIR\=
-Configuring libffi
-make -C "/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu"
-make[1]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-make all-recursive
-make[2]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-Making all in include
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/include'
-make[3]: Nothing to be done for 'all'.
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/include'
-Making all in testsuite
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/testsuite'
-make[3]: Nothing to be done for 'all'.
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/testsuite'
-Making all in man
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/man'
-make[3]: Nothing to be done for 'all'.
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/man'
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/prep_cif.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/prep_cif.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/prep_cif.c -fPIC -DPIC -o src/prep_cif.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/types.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/types.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/types.c -fPIC -DPIC -o src/types.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/raw_api.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/raw_api.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/raw_api.c -fPIC -DPIC -o src/raw_api.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/java_raw_api.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c -fPIC -DPIC -o src/java_raw_api.o
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c: In function 'ffi_java_raw_call':
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:317:3: warning: 'ffi_java_raw_to_ptrarray' is deprecated [-Wdeprecated-declarations]
- 317 | ffi_java_raw_to_ptrarray (cif, raw, avalue);
- | ^~~~~~~~~~~~~~~~~~~~~~~~
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:76:1: note: declared here
- 76 | ffi_java_raw_to_ptrarray (ffi_cif *cif, ffi_java_raw *raw, void **args)
- | ^~~~~~~~~~~~~~~~~~~~~~~~
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c: In function 'ffi_java_translate_args':
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:328:3: warning: 'ffi_java_raw_size' is deprecated [-Wdeprecated-declarations]
- 328 | ffi_java_raw *raw = (ffi_java_raw*)alloca (ffi_java_raw_size (cif));
- | ^~~~~~~~~~~~
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:45:1: note: declared here
- 45 | ffi_java_raw_size (ffi_cif *cif)
- | ^~~~~~~~~~~~~~~~~
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:331:3: warning: 'ffi_java_ptrarray_to_raw' is deprecated [-Wdeprecated-declarations]
- 331 | ffi_java_ptrarray_to_raw (cif, avalue, raw);
- | ^~~~~~~~~~~~~~~~~~~~~~~~
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:157:1: note: declared here
- 157 | ffi_java_ptrarray_to_raw (ffi_cif *cif, void **args, ffi_java_raw *raw)
- | ^~~~~~~~~~~~~~~~~~~~~~~~
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c: In function 'ffi_prep_java_raw_closure':
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:369:3: warning: 'ffi_prep_java_raw_closure_loc' is deprecated [-Wdeprecated-declarations]
- 369 | return ffi_prep_java_raw_closure_loc (cl, cif, fun, user_data, cl);
- | ^~~~~~
-/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/java_raw_api.c:337:1: note: declared here
- 337 | ffi_prep_java_raw_closure_loc (ffi_java_raw_closure* cl,
- | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/closures.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/closures.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/closures.c -fPIC -DPIC -o src/closures.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/tramp.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/tramp.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/tramp.c -fPIC -DPIC -o src/tramp.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/x86/ffi64.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/ffi64.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/ffi64.c -fPIC -DPIC -o src/x86/ffi64.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -c -o src/x86/unix64.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/unix64.S
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/unix64.S -fPIC -DPIC -o src/x86/unix64.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c -o src/x86/ffiw64.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/ffiw64.c
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -Wall -fexceptions -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/ffiw64.c -fPIC -DPIC -o src/x86/ffiw64.o
-/bin/bash ./libtool --tag=CC --mode=compile x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -c -o src/x86/win64.lo /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/win64.S
-libtool: compile: x86_64-linux-gnu-gcc -DHAVE_CONFIG_H -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -I. -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/include -Iinclude -I/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src -c /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/src/x86/win64.S -fPIC -DPIC -o src/x86/win64.o
-/bin/bash ./libtool --tag=CC --mode=link x86_64-linux-gnu-gcc -Wall -fexceptions -o libffi_convenience.la src/prep_cif.lo src/types.lo src/raw_api.lo src/java_raw_api.lo src/closures.lo src/tramp.lo src/x86/ffi64.lo src/x86/unix64.lo src/x86/ffiw64.lo src/x86/win64.lo
-libtool: link: rm -fr .libs/libffi_convenience.a(D)
-libtool: link: x86_64-linux-gnu-ar cr .libs/libffi_convenience.a src/prep_cif.o src/types.o src/raw_api.o src/java_raw_api.o src/closures.o src/tramp.o src/x86/ffi64.o src/x86/unix64.o src/x86/ffiw64.o src/x86/win64.o
-libtool: link: x86_64-linux-gnu-ranlib .libs/libffi_convenience.a
-libtool: link: ( cd ".libs" && rm -f "libffi_convenience.la" && ln -s "../libffi_convenience.la" "libffi_convenience.la" )
-/bin/bash ./libtool --tag=CC --mode=link x86_64-linux-gnu-gcc -Wall -fexceptions -no-undefined -version-info `grep -v '^#' /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi/libtool-version` -o libffi.la -rpath /usr/local/lib/../lib src/prep_cif.lo src/types.lo src/raw_api.lo src/java_raw_api.lo src/closures.lo src/tramp.lo src/x86/ffi64.lo src/x86/unix64.lo src/x86/ffiw64.lo src/x86/win64.lo
-libtool: link: x86_64-linux-gnu-ar cr .libs/libffi.a src/prep_cif.o src/types.o src/raw_api.o src/java_raw_api.o src/closures.o src/tramp.o src/x86/ffi64.o src/x86/unix64.o src/x86/ffiw64.o src/x86/win64.o
-libtool: link: x86_64-linux-gnu-ranlib .libs/libffi.a
-libtool: link: ( cd ".libs" && rm -f "libffi.la" && ln -s "../libffi.la" "libffi.la" )
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-make[2]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-make[1]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-compiling AbstractMemory.c
-compiling ArrayType.c
-compiling Buffer.c
-compiling Call.c
-compiling ClosurePool.c
-compiling DynamicLibrary.c
-compiling Function.c
-compiling FunctionInfo.c
-compiling LastError.c
-compiling LongDouble.c
-compiling MappedType.c
-compiling MemoryPointer.c
-compiling MethodHandle.c
-compiling Platform.c
-compiling Pointer.c
-compiling Struct.c
-compiling StructByValue.c
-compiling StructLayout.c
-compiling Thread.c
-compiling Type.c
-compiling Types.c
-compiling Variadic.c
-compiling ffi.c
-linking shared-object ffi_c.so
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c
-make DESTDIR\= install
-make -C "/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu"
-make[1]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-make all-recursive
-make[2]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-Making all in include
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/include'
-make[3]: Nothing to be done for 'all'.
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/include'
-Making all in testsuite
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/testsuite'
-make[3]: Nothing to be done for 'all'.
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/testsuite'
-Making all in man
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/man'
-make[3]: Nothing to be done for 'all'.
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu/man'
-make[3]: Entering directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-make[3]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-make[2]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-make[1]: Leaving directory '/home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/ffi-1.16.3/ext/ffi_c/libffi-x86_64-linux-gnu'
-compiling AbstractMemory.c
-compiling ArrayType.c
-compiling Buffer.c
-compiling Call.c
-compiling ClosurePool.c
-compiling DynamicLibrary.c
-compiling Function.c
-compiling FunctionInfo.c
-compiling LastError.c
-compiling LongDouble.c
-compiling MappedType.c
-compiling MemoryPointer.c
-compiling MethodHandle.c
-compiling Platform.c
-compiling Pointer.c
-compiling Struct.c
-compiling StructByValue.c
-compiling StructLayout.c
-compiling Thread.c
-compiling Type.c
-compiling Types.c
-compiling Variadic.c
-compiling ffi.c
-linking shared-object ffi_c.so
-/usr/bin/install -c -m 0755 ffi_c.so ./.gem.20231104-11184-t9w364
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/http_parser.rb-0.8.0/gem.build_complete b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/http_parser.rb-0.8.0/gem.build_complete
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/http_parser.rb-0.8.0/gem_make.out b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/http_parser.rb-0.8.0/gem_make.out
deleted file mode 100644
index 1fb5d34..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/http_parser.rb-0.8.0/gem_make.out
+++ /dev/null
@@ -1,16 +0,0 @@
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/http_parser.rb-0.8.0/ext/ruby_http_parser
-/usr/bin/ruby3.0 -I /usr/lib/ruby/vendor_ruby -r ./siteconf20231104-11184-iyxx32.rb extconf.rb
-creating Makefile
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/http_parser.rb-0.8.0/ext/ruby_http_parser
-make DESTDIR\= clean
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/http_parser.rb-0.8.0/ext/ruby_http_parser
-make DESTDIR\=
-compiling ruby_http_parser.c
-compiling ryah_http_parser.c
-linking shared-object ruby_http_parser.so
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/http_parser.rb-0.8.0/ext/ruby_http_parser
-make DESTDIR\= install
-/usr/bin/install -c -m 0755 ruby_http_parser.so ./.gem.20231104-11184-sg38jp
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/racc-1.7.3/gem.build_complete b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/racc-1.7.3/gem.build_complete
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/racc-1.7.3/gem_make.out b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/racc-1.7.3/gem_make.out
deleted file mode 100644
index 649e12a..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/racc-1.7.3/gem_make.out
+++ /dev/null
@@ -1,15 +0,0 @@
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/racc-1.7.3/ext/racc/cparse
-/usr/bin/ruby3.0 -I /usr/lib/ruby/vendor_ruby -r ./siteconf20231104-11184-1u1xq3.rb extconf.rb
-creating Makefile
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/racc-1.7.3/ext/racc/cparse
-make DESTDIR\= clean
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/racc-1.7.3/ext/racc/cparse
-make DESTDIR\=
-compiling cparse.c
-linking shared-object racc/cparse.so
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/racc-1.7.3/ext/racc/cparse
-make DESTDIR\= install
-/usr/bin/install -c -m 0755 cparse.so ./.gem.20231104-11184-ar0bhs/racc
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/unf_ext-0.0.8.2/gem.build_complete b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/unf_ext-0.0.8.2/gem.build_complete
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/unf_ext-0.0.8.2/gem_make.out b/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/unf_ext-0.0.8.2/gem_make.out
deleted file mode 100644
index b9c8c6f..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/extensions/x86_64-linux/3.0.0/unf_ext-0.0.8.2/gem_make.out
+++ /dev/null
@@ -1,16 +0,0 @@
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/unf_ext-0.0.8.2/ext/unf_ext
-/usr/bin/ruby3.0 -I /usr/lib/ruby/vendor_ruby -r ./siteconf20231104-11184-m85os1.rb extconf.rb
-checking for -lstdc++... yes
-creating Makefile
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/unf_ext-0.0.8.2/ext/unf_ext
-make DESTDIR\= clean
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/unf_ext-0.0.8.2/ext/unf_ext
-make DESTDIR\=
-compiling unf.cc
-linking shared-object unf_ext.so
-
-current directory: /home/jeff/Documents/NBA_Betting/docs/vendor/bundle/ruby/3.0.0/gems/unf_ext-0.0.8.2/ext/unf_ext
-make DESTDIR\= install
-/usr/bin/install -c -m 0755 unf_ext.so ./.gem.20231104-11184-8kff1q
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/CHANGELOG.md b/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/CHANGELOG.md
deleted file mode 100644
index 8d611b2..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/CHANGELOG.md
+++ /dev/null
@@ -1,1095 +0,0 @@
-## Rails 7.1.1 (October 11, 2023) ##
-
-* Add support for keyword arguments when delegating calls to custom loggers from `ActiveSupport::BroadcastLogger`.
-
- *Edouard Chin*
-
-* `NumberHelper`: handle objects responding `to_d`.
-
- *fatkodima*
-
-* Fix RedisCacheStore to properly set the TTL when incrementing or decrementing.
-
- This bug was only impacting Redis server older than 7.0.
-
- *Thomas Countz*
-
-* Fix MemoryStore to prevent race conditions when incrementing or decrementing.
-
- *Pierre Jambet*
-
-
-## Rails 7.1.0 (October 05, 2023) ##
-
-* No changes.
-
-
-## Rails 7.1.0.rc2 (October 01, 2023) ##
-
-* Fix `AS::MessagePack` with `ENV["RAILS_MAX_THREADS"]`.
-
- *Jonathan Hefner*
-
-
-## Rails 7.1.0.rc1 (September 27, 2023) ##
-
-* Add a new public API for broadcasting logs
-
- This feature existed for a while but was until now a private API.
- Broadcasting log allows to send log message to difference sinks (STDOUT, a file ...) and
- is used by default in the development environment to write logs both on STDOUT and in the
- "development.log" file.
-
- Basic usage:
-
- ```ruby
- stdout_logger = Logger.new(STDOUT)
- file_logger = Logger.new("development.log")
- broadcast = ActiveSupport::BroadcastLogger.new(stdout_logger, file_logger)
-
- broadcast.info("Hello!") # The "Hello!" message is written on STDOUT and in the log file.
- ```
-
- Adding other sink(s) to the broadcast:
-
- ```ruby
- broadcast = ActiveSupport::BroadcastLogger.new
- broadcast.broadcast_to(Logger.new(STDERR))
- ```
-
- Remove a sink from the broadcast:
-
- ```ruby
- stdout_logger = Logger.new(STDOUT)
- broadcast = ActiveSupport::BroadcastLogger.new(stdout_logger)
-
- broadcast.stop_broadcasting_to(stdout_logger)
- ```
-
- *Edouard Chin*
-
-* Fix Range#overlap? not taking empty ranges into account on Ruby < 3.3
-
- *Nobuyoshi Nakada*, *Shouichi Kamiya*, *Hartley McGuire*
-
-* Use Ruby 3.3 Range#overlap? if available
-
- *Yasuo Honda*
-
-
-## Rails 7.1.0.beta1 (September 13, 2023) ##
-
-* Add `bigdecimal` as Active Support dependency that is a bundled gem candidate for Ruby 3.4.
-
- `bigdecimal` 3.1.4 or higher version will be installed.
- Ruby 2.7 and 3.0 users who want `bigdecimal` version 2.0.0 or 3.0.0 behavior as a default gem,
- pin the `bigdecimal` version in your application Gemfile.
-
- *Koichi ITO*
-
-* Add `drb`, `mutex_m` and `base64` that are bundled gem candidates for Ruby 3.4
-
- *Yasuo Honda*
-
-* When using cache format version >= 7.1 or a custom serializer, expired and
- version-mismatched cache entries can now be detected without deserializing
- their values.
-
- *Jonathan Hefner*
-
-* Make all cache stores return a boolean for `#delete`
-
- Previously the `RedisCacheStore#delete` would return `1` if the entry
- exists and `0` otherwise. Now it returns true if the entry exists and false
- otherwise, just like the other stores.
-
- The `FileStore` would return `nil` if the entry doesn't exists and returns
- `false` now as well.
-
- *Petrik de Heus*
-
-* Active Support cache stores now support replacing the default compressor via
- a `:compressor` option. The specified compressor must respond to `deflate`
- and `inflate`. For example:
-
- ```ruby
- module MyCompressor
- def self.deflate(string)
- # compression logic...
- end
-
- def self.inflate(compressed)
- # decompression logic...
- end
- end
-
- config.cache_store = :redis_cache_store, { compressor: MyCompressor }
- ```
-
- *Jonathan Hefner*
-
-* Active Support cache stores now support a `:serializer` option. Similar to
- the `:coder` option, serializers must respond to `dump` and `load`. However,
- serializers are only responsible for serializing a cached value, whereas
- coders are responsible for serializing the entire `ActiveSupport::Cache::Entry`
- instance. Additionally, the output from serializers can be automatically
- compressed, whereas coders are responsible for their own compression.
-
- Specifying a serializer instead of a coder also enables performance
- optimizations, including the bare string optimization introduced by cache
- format version 7.1.
-
- The `:serializer` and `:coder` options are mutually exclusive. Specifying
- both will raise an `ArgumentError`.
-
- *Jonathan Hefner*
-
-* Fix `ActiveSupport::Inflector.humanize(nil)` raising ``NoMethodError: undefined method `end_with?' for nil:NilClass``.
-
- *James Robinson*
-
-* Don't show secrets for `ActiveSupport::KeyGenerator#inspect`.
-
- Before:
-
- ```ruby
- ActiveSupport::KeyGenerator.new(secret).inspect
- "#"
- ```
-
- After:
-
- ```ruby
- ActiveSupport::KeyGenerator::Aes256Gcm(secret).inspect
- "#"
- ```
-
- *Petrik de Heus*
-
-* Improve error message when EventedFileUpdateChecker is used without a
- compatible version of the Listen gem
-
- *Hartley McGuire*
-
-* Add `:report` behavior for Deprecation
-
- Setting `config.active_support.deprecation = :report` uses the error
- reporter to report deprecation warnings to `ActiveSupport::ErrorReporter`.
-
- Deprecations are reported as handled errors, with a severity of `:warning`.
-
- Useful to report deprecations happening in production to your bug tracker.
-
- *Étienne Barrié*
-
-* Rename `Range#overlaps?` to `#overlap?` and add alias for backwards compatibility
-
- *Christian Schmidt*
-
-* Fix `EncryptedConfiguration` returning incorrect values for some `Hash`
- methods
-
- *Hartley McGuire*
-
-* Don't show secrets for `MessageEncryptor#inspect`.
-
- Before:
-
- ```ruby
- ActiveSupport::MessageEncryptor.new(secret, cipher: "aes-256-gcm").inspect
- "#"
- ```
-
- After:
-
- ```ruby
- ActiveSupport::MessageEncryptor.new(secret, cipher: "aes-256-gcm").inspect
- "#"
- ```
-
- *Petrik de Heus*
-
-* Don't show contents for `EncryptedConfiguration#inspect`.
-
- Before:
- ```ruby
- Rails.application.credentials.inspect
- "#\"something secret\"} ... @key_file_contents=\"915e4ea054e011022398dc242\" ...>"
- ```
-
- After:
- ```ruby
- Rails.application.credentials.inspect
- "#"
- ```
-
- *Petrik de Heus*
-
-* `ERB::Util.html_escape_once` always returns an `html_safe` string.
-
- This method previously maintained the `html_safe?` property of a string on the return
- value. Because this string has been escaped, however, not marking it as `html_safe` causes
- entities to be double-escaped.
-
- As an example, take this view snippet:
-
- ```html
-
<%= html_escape_once("this & that & the other") %>
- ```
-
- Before this change, that would be double-escaped and render as:
-
- ```html
-
this & that & the other
- ```
-
- After this change, it renders correctly as:
-
- ```html
-
this & that & the other
- ```
-
- Fixes #48256
-
- *Mike Dalessio*
-
-* Deprecate `SafeBuffer#clone_empty`.
-
- This method has not been used internally since Rails 4.2.0.
-
- *Mike Dalessio*
-
-* `MessageEncryptor`, `MessageVerifier`, and `config.active_support.message_serializer`
- now accept `:message_pack` and `:message_pack_allow_marshal` as serializers.
- These serializers require the [`msgpack` gem](https://rubygems.org/gems/msgpack)
- (>= 1.7.0).
-
- The Message Pack format can provide improved performance and smaller payload
- sizes. It also supports round-tripping some Ruby types that are not supported
- by JSON. For example:
-
- ```ruby
- verifier = ActiveSupport::MessageVerifier.new("secret")
- data = [{ a: 1 }, { b: 2 }.with_indifferent_access, 1.to_d, Time.at(0, 123)]
- message = verifier.generate(data)
-
- # BEFORE with config.active_support.message_serializer = :json
- verifier.verified(message)
- # => [{"a"=>1}, {"b"=>2}, "1.0", "1969-12-31T18:00:00.000-06:00"]
- verifier.verified(message).map(&:class)
- # => [Hash, Hash, String, String]
-
- # AFTER with config.active_support.message_serializer = :message_pack
- verifier.verified(message)
- # => [{:a=>1}, {"b"=>2}, 0.1e1, 1969-12-31 18:00:00.000123 -0600]
- verifier.verified(message).map(&:class)
- # => [Hash, ActiveSupport::HashWithIndifferentAccess, BigDecimal, Time]
- ```
-
- The `:message_pack` serializer can fall back to deserializing with
- `ActiveSupport::JSON` when necessary, and the `:message_pack_allow_marshal`
- serializer can fall back to deserializing with `Marshal` as well as
- `ActiveSupport::JSON`. Additionally, the `:marshal`, `:json`, and
- `:json_allow_marshal` serializers can now fall back to deserializing with
- `ActiveSupport::MessagePack` when necessary. These behaviors ensure old
- messages can still be read so that migration is easier.
-
- *Jonathan Hefner*
-
-* A new `7.1` cache format is available which includes an optimization for
- bare string values such as view fragments.
-
- The `7.1` cache format is used by default for new apps, and existing apps
- can enable the format by setting `config.load_defaults 7.1` or by setting
- `config.active_support.cache_format_version = 7.1` in `config/application.rb`
- or a `config/environments/*.rb` file.
-
- Cache entries written using the `6.1` or `7.0` cache formats can be read
- when using the `7.1` format. To perform a rolling deploy of a Rails 7.1
- upgrade, wherein servers that have not yet been upgraded must be able to
- read caches from upgraded servers, leave the cache format unchanged on the
- first deploy, then enable the `7.1` cache format on a subsequent deploy.
-
- *Jonathan Hefner*
-
-* Active Support cache stores can now use a preconfigured serializer based on
- `ActiveSupport::MessagePack` via the `:serializer` option:
-
- ```ruby
- config.cache_store = :redis_cache_store, { serializer: :message_pack }
- ```
-
- The `:message_pack` serializer can reduce cache entry sizes and improve
- performance, but requires the [`msgpack` gem](https://rubygems.org/gems/msgpack)
- (>= 1.7.0).
-
- The `:message_pack` serializer can read cache entries written by the default
- serializer, and the default serializer can now read entries written by the
- `:message_pack` serializer. These behaviors make it easy to migrate between
- serializer without invalidating the entire cache.
-
- *Jonathan Hefner*
-
-* `Object#deep_dup` no longer duplicate named classes and modules.
-
- Before:
-
- ```ruby
- hash = { class: Object, module: Kernel }
- hash.deep_dup # => {:class=>#, :module=>#}
- ```
-
- After:
-
- ```ruby
- hash = { class: Object, module: Kernel }
- hash.deep_dup # => {:class=>Object, :module=>Kernel}
- ```
-
- *Jean Boussier*
-
-* Consistently raise an `ArgumentError` if the `ActiveSupport::Cache` key is blank.
-
- *Joshua Young*
-
-* Deprecate usage of the singleton `ActiveSupport::Deprecation`.
-
- All usage of `ActiveSupport::Deprecation` as a singleton is deprecated, the most common one being
- `ActiveSupport::Deprecation.warn`. Gem authors should now create their own deprecator (`ActiveSupport::Deprecation`
- object), and use it to emit deprecation warnings.
-
- Calling any of the following without specifying a deprecator argument is also deprecated:
- * Module.deprecate
- * deprecate_constant
- * DeprecatedObjectProxy
- * DeprecatedInstanceVariableProxy
- * DeprecatedConstantProxy
- * deprecation-related test assertions
-
- Use of `ActiveSupport::Deprecation.silence` and configuration methods like `behavior=`, `disallowed_behavior=`,
- `disallowed_warnings=` should now be aimed at the [application's deprecators](https://api.rubyonrails.org/classes/Rails/Application.html#method-i-deprecators).
-
- ```ruby
- Rails.application.deprecators.silence do
- # code that emits deprecation warnings
- end
- ```
-
- If your gem has a Railtie or Engine, it's encouraged to add your deprecator to the application's deprecators, that
- way the deprecation related configuration options will apply to it as well, e.g.
- `config.active_support.report_deprecations` set to `false` in the production environment will also disable your
- deprecator.
-
- ```ruby
- initializer "my_gem.deprecator" do |app|
- app.deprecators[:my_gem] = MyGem.deprecator
- end
- ```
-
- *Étienne Barrié*
-
-* Add `Object#with` to set and restore public attributes around a block
-
- ```ruby
- client.timeout # => 5
- client.with(timeout: 1) do
- client.timeout # => 1
- end
- client.timeout # => 5
- ```
-
- *Jean Boussier*
-
-* Remove deprecated support to generate incorrect RFC 4122 UUIDs when providing a namespace ID that is not one of the
- constants defined on `Digest::UUID`.
-
- *Rafael Mendonça França*
-
-* Deprecate `config.active_support.use_rfc4122_namespaced_uuids`.
-
- *Rafael Mendonça França*
-
-* Remove implicit conversion of objects into `String` by `ActiveSupport::SafeBuffer`.
-
- *Rafael Mendonça França*
-
-* Remove deprecated `active_support/core_ext/range/include_time_with_zone` file.
-
- *Rafael Mendonça França*
-
-* Deprecate `config.active_support.remove_deprecated_time_with_zone_name`.
-
- *Rafael Mendonça França*
-
-* Remove deprecated override of `ActiveSupport::TimeWithZone.name`.
-
- *Rafael Mendonça França*
-
-* Deprecate `config.active_support.disable_to_s_conversion`.
-
- *Rafael Mendonça França*
-
-* Remove deprecated option to passing a format to `#to_s` in `Array`, `Range`, `Date`, `DateTime`, `Time`,
- `BigDecimal`, `Float` and, `Integer`.
-
- *Rafael Mendonça França*
-
-* Remove deprecated `ActiveSupport::PerThreadRegistry`.
-
- *Rafael Mendonça França*
-
-* Remove deprecated override of `Enumerable#sum`.
-
- *Rafael Mendonça França*
-
-* Deprecated initializing a `ActiveSupport::Cache::MemCacheStore` with an instance of `Dalli::Client`.
-
- Deprecate the undocumented option of providing an already-initialized instance of `Dalli::Client` to `ActiveSupport::Cache::MemCacheStore`. Such clients could be configured with unrecognized options, which could lead to unexpected behavior. Instead, provide addresses as documented.
-
- *aledustet*
-
-* Stub `Time.new()` in `TimeHelpers#travel_to`
-
- ```ruby
- travel_to Time.new(2004, 11, 24) do
- # Inside the `travel_to` block `Time.new` is stubbed
- assert_equal 2004, Time.new.year
- end
- ```
-
- *fatkodima*
-
-* Raise `ActiveSupport::MessageEncryptor::InvalidMessage` from
- `ActiveSupport::MessageEncryptor#decrypt_and_verify` regardless of cipher.
- Previously, when a `MessageEncryptor` was using a non-AEAD cipher such as
- AES-256-CBC, a corrupt or tampered message would raise
- `ActiveSupport::MessageVerifier::InvalidSignature`. Now, all ciphers raise
- the same error:
-
- ```ruby
- encryptor = ActiveSupport::MessageEncryptor.new("x" * 32, cipher: "aes-256-gcm")
- message = encryptor.encrypt_and_sign("message")
- encryptor.decrypt_and_verify(message.next)
- # => raises ActiveSupport::MessageEncryptor::InvalidMessage
-
- encryptor = ActiveSupport::MessageEncryptor.new("x" * 32, cipher: "aes-256-cbc")
- message = encryptor.encrypt_and_sign("message")
- encryptor.decrypt_and_verify(message.next)
- # BEFORE:
- # => raises ActiveSupport::MessageVerifier::InvalidSignature
- # AFTER:
- # => raises ActiveSupport::MessageEncryptor::InvalidMessage
- ```
-
- *Jonathan Hefner*
-
-* Support `nil` original values when using `ActiveSupport::MessageVerifier#verify`.
- Previously, `MessageVerifier#verify` did not work with `nil` original
- values, though both `MessageVerifier#verified` and
- `MessageEncryptor#decrypt_and_verify` do:
-
- ```ruby
- encryptor = ActiveSupport::MessageEncryptor.new(secret)
- message = encryptor.encrypt_and_sign(nil)
-
- encryptor.decrypt_and_verify(message)
- # => nil
-
- verifier = ActiveSupport::MessageVerifier.new(secret)
- message = verifier.generate(nil)
-
- verifier.verified(message)
- # => nil
-
- verifier.verify(message)
- # BEFORE:
- # => raises ActiveSupport::MessageVerifier::InvalidSignature
- # AFTER:
- # => nil
- ```
-
- *Jonathan Hefner*
-
-* Maintain `html_safe?` on html_safe strings when sliced with `slice`, `slice!`, or `chr` method.
-
- Previously, `html_safe?` was only maintained when the html_safe strings were sliced
- with `[]` method. Now, `slice`, `slice!`, and `chr` methods will maintain `html_safe?` like `[]` method.
-
- ```ruby
- string = "
test
".html_safe
- string.slice(0, 1).html_safe? # => true
- string.slice!(0, 1).html_safe? # => true
- # maintain html_safe? after the slice!
- string.html_safe? # => true
- string.chr.html_safe? # => true
- ```
-
- *Michael Go*
-
-* Add `Object#in?` support for open ranges.
-
- ```ruby
- assert Date.today.in?(..Date.tomorrow)
- assert_not Date.today.in?(Date.tomorrow..)
- ```
-
- *Ignacio Galindo*
-
-* `config.i18n.raise_on_missing_translations = true` now raises on any missing translation.
-
- Previously it would only raise when called in a view or controller. Now it will raise
- anytime `I18n.t` is provided an unrecognised key.
-
- If you do not want this behaviour, you can customise the i18n exception handler. See the
- upgrading guide or i18n guide for more information.
-
- *Alex Ghiculescu*
-
-* `ActiveSupport::CurrentAttributes` now raises if a restricted attribute name is used.
-
- Attributes such as `set` and `reset` cannot be used as they clash with the
- `CurrentAttributes` public API.
-
- *Alex Ghiculescu*
-
-* `HashWithIndifferentAccess#transform_keys` now takes a Hash argument, just
- as Ruby's `Hash#transform_keys` does.
-
- *Akira Matsuda*
-
-* `delegate` now defines method with proper arity when delegating to a Class.
- With this change, it defines faster method (3.5x faster with no argument).
- However, in order to gain this benefit, the delegation target method has to
- be defined before declaring the delegation.
-
- ```ruby
- # This defines 3.5 times faster method than before
- class C
- def self.x() end
- delegate :x, to: :class
- end
-
- class C
- # This works but silently falls back to old behavior because
- # `delegate` cannot find the definition of `x`
- delegate :x, to: :class
- def self.x() end
- end
- ```
-
- *Akira Matsuda*
-
-* `assert_difference` message now includes what changed.
-
- This makes it easier to debug non-obvious failures.
-
- Before:
-
- ```
- "User.count" didn't change by 32.
- Expected: 1611
- Actual: 1579
- ```
-
- After:
-
- ```
- "User.count" didn't change by 32, but by 0.
- Expected: 1611
- Actual: 1579
- ```
-
- *Alex Ghiculescu*
-
-* Add ability to match exception messages to `assert_raises` assertion
-
- Instead of this
- ```ruby
- error = assert_raises(ArgumentError) do
- perform_service(param: 'exception')
- end
- assert_match(/incorrect param/i, error.message)
- ```
-
- you can now write this
- ```ruby
- assert_raises(ArgumentError, match: /incorrect param/i) do
- perform_service(param: 'exception')
- end
- ```
-
- *fatkodima*
-
-* Add `Rails.env.local?` shorthand for `Rails.env.development? || Rails.env.test?`.
-
- *DHH*
-
-* `ActiveSupport::Testing::TimeHelpers` now accepts named `with_usec` argument
- to `freeze_time`, `travel`, and `travel_to` methods. Passing true prevents
- truncating the destination time with `change(usec: 0)`.
-
- *KevSlashNull*, and *serprex*
-
-* `ActiveSupport::CurrentAttributes.resets` now accepts a method name
-
- The block API is still the recommended approach, but now both APIs are supported:
-
- ```ruby
- class Current < ActiveSupport::CurrentAttributes
- resets { Time.zone = nil }
- resets :clear_time_zone
- end
- ```
-
- *Alex Ghiculescu*
-
-* Ensure `ActiveSupport::Testing::Isolation::Forking` closes pipes
-
- Previously, `Forking.run_in_isolation` opened two ends of a pipe. The fork
- process closed the read end, wrote to it, and then terminated (which
- presumably closed the file descriptors on its end). The parent process
- closed the write end, read from it, and returned, never closing the read
- end.
-
- This resulted in an accumulation of open file descriptors, which could
- cause errors if the limit is reached.
-
- *Sam Bostock*
-
-* Fix `Time#change` and `Time#advance` for times around the end of Daylight
- Saving Time.
-
- Previously, when `Time#change` or `Time#advance` constructed a time inside
- the final stretch of Daylight Saving Time (DST), the non-DST offset would
- always be chosen for local times:
-
- ```ruby
- # DST ended just before 2021-11-07 2:00:00 AM in US/Eastern.
- ENV["TZ"] = "US/Eastern"
-
- time = Time.local(2021, 11, 07, 00, 59, 59) + 1
- # => 2021-11-07 01:00:00 -0400
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0500
- time.advance(seconds: 0)
- # => 2021-11-07 01:00:00 -0500
-
- time = Time.local(2021, 11, 06, 01, 00, 00)
- # => 2021-11-06 01:00:00 -0400
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0500
- time.advance(days: 1)
- # => 2021-11-07 01:00:00 -0500
- ```
-
- And the DST offset would always be chosen for times with a `TimeZone`
- object:
-
- ```ruby
- Time.zone = "US/Eastern"
-
- time = Time.new(2021, 11, 07, 02, 00, 00, Time.zone) - 3600
- # => 2021-11-07 01:00:00 -0500
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0400
- time.advance(seconds: 0)
- # => 2021-11-07 01:00:00 -0400
-
- time = Time.new(2021, 11, 8, 01, 00, 00, Time.zone)
- # => 2021-11-08 01:00:00 -0500
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0400
- time.advance(days: -1)
- # => 2021-11-07 01:00:00 -0400
- ```
-
- Now, `Time#change` and `Time#advance` will choose the offset that matches
- the original time's offset when possible:
-
- ```ruby
- ENV["TZ"] = "US/Eastern"
-
- time = Time.local(2021, 11, 07, 00, 59, 59) + 1
- # => 2021-11-07 01:00:00 -0400
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0400
- time.advance(seconds: 0)
- # => 2021-11-07 01:00:00 -0400
-
- time = Time.local(2021, 11, 06, 01, 00, 00)
- # => 2021-11-06 01:00:00 -0400
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0400
- time.advance(days: 1)
- # => 2021-11-07 01:00:00 -0400
-
- Time.zone = "US/Eastern"
-
- time = Time.new(2021, 11, 07, 02, 00, 00, Time.zone) - 3600
- # => 2021-11-07 01:00:00 -0500
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0500
- time.advance(seconds: 0)
- # => 2021-11-07 01:00:00 -0500
-
- time = Time.new(2021, 11, 8, 01, 00, 00, Time.zone)
- # => 2021-11-08 01:00:00 -0500
- time.change(day: 07)
- # => 2021-11-07 01:00:00 -0500
- time.advance(days: -1)
- # => 2021-11-07 01:00:00 -0500
- ```
-
- *Kevin Hall*, *Takayoshi Nishida*, and *Jonathan Hefner*
-
-* Fix MemoryStore to preserve entries TTL when incrementing or decrementing
-
- This is to be more consistent with how MemCachedStore and RedisCacheStore behaves.
-
- *Jean Boussier*
-
-* `Rails.error.handle` and `Rails.error.record` filter now by multiple error classes.
-
- ```ruby
- Rails.error.handle(IOError, ArgumentError) do
- 1 + '1' # raises TypeError
- end
- 1 + 1 # TypeErrors are not IOErrors or ArgumentError, so this will *not* be handled
- ```
-
- *Martin Spickermann*
-
-* `Class#subclasses` and `Class#descendants` now automatically filter reloaded classes.
-
- Previously they could return old implementations of reloadable classes that have been
- dereferenced but not yet garbage collected.
-
- They now automatically filter such classes like `DescendantTracker#subclasses` and
- `DescendantTracker#descendants`.
-
- *Jean Boussier*
-
-* `Rails.error.report` now marks errors as reported to avoid reporting them twice.
-
- In some cases, users might want to report errors explicitly with some extra context
- before letting it bubble up.
-
- This also allows to safely catch and report errors outside of the execution context.
-
- *Jean Boussier*
-
-* Add `assert_error_reported` and `assert_no_error_reported`
-
- Allows to easily asserts an error happened but was handled
-
- ```ruby
- report = assert_error_reported(IOError) do
- # ...
- end
- assert_equal "Oops", report.error.message
- assert_equal "admin", report.context[:section]
- assert_equal :warning, report.severity
- assert_predicate report, :handled?
- ```
-
- *Jean Boussier*
-
-* `ActiveSupport::Deprecation` behavior callbacks can now receive the
- deprecator instance as an argument. This makes it easier for such callbacks
- to change their behavior based on the deprecator's state. For example,
- based on the deprecator's `debug` flag.
-
- 3-arity and splat-args callbacks such as the following will now be passed
- the deprecator instance as their third argument:
-
- * `->(message, callstack, deprecator) { ... }`
- * `->(*args) { ... }`
- * `->(message, *other_args) { ... }`
-
- 2-arity and 4-arity callbacks such as the following will continue to behave
- the same as before:
-
- * `->(message, callstack) { ... }`
- * `->(message, callstack, deprecation_horizon, gem_name) { ... }`
- * `->(message, callstack, *deprecation_details) { ... }`
-
- *Jonathan Hefner*
-
-* `ActiveSupport::Deprecation#disallowed_warnings` now affects the instance on
- which it is configured.
-
- This means that individual `ActiveSupport::Deprecation` instances can be
- configured with their own disallowed warnings, and the global
- `ActiveSupport::Deprecation.disallowed_warnings` now only affects the global
- `ActiveSupport::Deprecation.warn`.
-
- **Before**
-
- ```ruby
- ActiveSupport::Deprecation.disallowed_warnings = ["foo"]
- deprecator = ActiveSupport::Deprecation.new("2.0", "MyCoolGem")
- deprecator.disallowed_warnings = ["bar"]
-
- ActiveSupport::Deprecation.warn("foo") # => raise ActiveSupport::DeprecationException
- ActiveSupport::Deprecation.warn("bar") # => print "DEPRECATION WARNING: bar"
- deprecator.warn("foo") # => raise ActiveSupport::DeprecationException
- deprecator.warn("bar") # => print "DEPRECATION WARNING: bar"
- ```
-
- **After**
-
- ```ruby
- ActiveSupport::Deprecation.disallowed_warnings = ["foo"]
- deprecator = ActiveSupport::Deprecation.new("2.0", "MyCoolGem")
- deprecator.disallowed_warnings = ["bar"]
-
- ActiveSupport::Deprecation.warn("foo") # => raise ActiveSupport::DeprecationException
- ActiveSupport::Deprecation.warn("bar") # => print "DEPRECATION WARNING: bar"
- deprecator.warn("foo") # => print "DEPRECATION WARNING: foo"
- deprecator.warn("bar") # => raise ActiveSupport::DeprecationException
- ```
-
- Note that global `ActiveSupport::Deprecation` methods such as `ActiveSupport::Deprecation.warn`
- and `ActiveSupport::Deprecation.disallowed_warnings` have been deprecated.
-
- *Jonathan Hefner*
-
-* Add italic and underline support to `ActiveSupport::LogSubscriber#color`
-
- Previously, only bold text was supported via a positional argument.
- This allows for bold, italic, and underline options to be specified
- for colored logs.
-
- ```ruby
- info color("Hello world!", :red, bold: true, underline: true)
- ```
-
- *Gannon McGibbon*
-
-* Add `String#downcase_first` method.
-
- This method is the corollary of `String#upcase_first`.
-
- *Mark Schneider*
-
-* `thread_mattr_accessor` will call `.dup.freeze` on non-frozen default values.
-
- This provides a basic level of protection against different threads trying
- to mutate a shared default object.
-
- *Jonathan Hefner*
-
-* Add `raise_on_invalid_cache_expiration_time` config to `ActiveSupport::Cache::Store`
-
- Specifies if an `ArgumentError` should be raised if `Rails.cache` `fetch` or
- `write` are given an invalid `expires_at` or `expires_in` time.
-
- Options are `true`, and `false`. If `false`, the exception will be reported
- as `handled` and logged instead. Defaults to `true` if `config.load_defaults >= 7.1`.
-
- *Trevor Turk*
-
-* `ActiveSupport::Cache::Store#fetch` now passes an options accessor to the block.
-
- It makes possible to override cache options:
-
- Rails.cache.fetch("3rd-party-token") do |name, options|
- token = fetch_token_from_remote
- # set cache's TTL to match token's TTL
- options.expires_in = token.expires_in
- token
- end
-
- *Andrii Gladkyi*, *Jean Boussier*
-
-* `default` option of `thread_mattr_accessor` now applies through inheritance and
- also across new threads.
-
- Previously, the `default` value provided was set only at the moment of defining
- the attribute writer, which would cause the attribute to be uninitialized in
- descendants and in other threads.
-
- Fixes #43312.
-
- *Thierry Deo*
-
-* Redis cache store is now compatible with redis-rb 5.0.
-
- *Jean Boussier*
-
-* Add `skip_nil:` support to `ActiveSupport::Cache::Store#fetch_multi`.
-
- *Daniel Alfaro*
-
-* Add `quarter` method to date/time
-
- *Matt Swanson*
-
-* Fix `NoMethodError` on custom `ActiveSupport::Deprecation` behavior.
-
- `ActiveSupport::Deprecation.behavior=` was supposed to accept any object
- that responds to `call`, but in fact its internal implementation assumed that
- this object could respond to `arity`, so it was restricted to only `Proc` objects.
-
- This change removes this `arity` restriction of custom behaviors.
-
- *Ryo Nakamura*
-
-* Support `:url_safe` option for `MessageEncryptor`.
-
- The `MessageEncryptor` constructor now accepts a `:url_safe` option, similar
- to the `MessageVerifier` constructor. When enabled, this option ensures
- that messages use a URL-safe encoding.
-
- *Jonathan Hefner*
-
-* Add `url_safe` option to `ActiveSupport::MessageVerifier` initializer
-
- `ActiveSupport::MessageVerifier.new` now takes optional `url_safe` argument.
- It can generate URL-safe strings by passing `url_safe: true`.
-
- ```ruby
- verifier = ActiveSupport::MessageVerifier.new(url_safe: true)
- message = verifier.generate(data) # => URL-safe string
- ```
-
- This option is `false` by default to be backwards compatible.
-
- *Shouichi Kamiya*
-
-* Enable connection pooling by default for `MemCacheStore` and `RedisCacheStore`.
-
- If you want to disable connection pooling, set `:pool` option to `false` when configuring the cache store:
-
- ```ruby
- config.cache_store = :mem_cache_store, "cache.example.com", pool: false
- ```
-
- *fatkodima*
-
-* Add `force:` support to `ActiveSupport::Cache::Store#fetch_multi`.
-
- *fatkodima*
-
-* Deprecated `:pool_size` and `:pool_timeout` options for configuring connection pooling in cache stores.
-
- Use `pool: true` to enable pooling with default settings:
-
- ```ruby
- config.cache_store = :redis_cache_store, pool: true
- ```
-
- Or pass individual options via `:pool` option:
-
- ```ruby
- config.cache_store = :redis_cache_store, pool: { size: 10, timeout: 2 }
- ```
-
- *fatkodima*
-
-* Allow #increment and #decrement methods of `ActiveSupport::Cache::Store`
- subclasses to set new values.
-
- Previously incrementing or decrementing an unset key would fail and return
- nil. A default will now be assumed and the key will be created.
-
- *Andrej Blagojević*, *Eugene Kenny*
-
-* Add `skip_nil:` support to `RedisCacheStore`
-
- *Joey Paris*
-
-* `ActiveSupport::Cache::MemoryStore#write(name, val, unless_exist:true)` now
- correctly writes expired keys.
-
- *Alan Savage*
-
-* `ActiveSupport::ErrorReporter` now accepts and forward a `source:` parameter.
-
- This allow libraries to signal the origin of the errors, and reporters
- to easily ignore some sources.
-
- *Jean Boussier*
-
-* Fix and add protections for XSS in `ActionView::Helpers` and `ERB::Util`.
-
- Add the method `ERB::Util.xml_name_escape` to escape dangerous characters
- in names of tags and names of attributes, following the specification of XML.
-
- *Álvaro Martín Fraguas*
-
-* Respect `ActiveSupport::Logger.new`'s `:formatter` keyword argument
-
- The stdlib `Logger::new` allows passing a `:formatter` keyword argument to
- set the logger's formatter. Previously `ActiveSupport::Logger.new` ignored
- that argument by always setting the formatter to an instance of
- `ActiveSupport::Logger::SimpleFormatter`.
-
- *Steven Harman*
-
-* Deprecate preserving the pre-Ruby 2.4 behavior of `to_time`
-
- With Ruby 2.4+ the default for +to_time+ changed from converting to the
- local system time to preserving the offset of the receiver. At the time Rails
- supported older versions of Ruby so a compatibility layer was added to assist
- in the migration process. From Rails 5.0 new applications have defaulted to
- the Ruby 2.4+ behavior and since Rails 7.0 now only supports Ruby 2.7+
- this compatibility layer can be safely removed.
-
- To minimize any noise generated the deprecation warning only appears when the
- setting is configured to `false` as that is the only scenario where the
- removal of the compatibility layer has any effect.
-
- *Andrew White*
-
-* `Pathname.blank?` only returns true for `Pathname.new("")`
-
- Previously it would end up calling `Pathname#empty?` which returned true
- if the path existed and was an empty directory or file.
-
- That behavior was unlikely to be expected.
-
- *Jean Boussier*
-
-* Deprecate `Notification::Event`'s `#children` and `#parent_of?`
-
- *John Hawthorn*
-
-* Change the default serializer of `ActiveSupport::MessageVerifier` from
- `Marshal` to `ActiveSupport::JSON` when using `config.load_defaults 7.1`.
-
- Messages serialized with `Marshal` can still be read, but new messages will
- be serialized with `ActiveSupport::JSON`. For more information, see
- https://guides.rubyonrails.org/v7.1/configuring.html#config-active-support-message-serializer.
-
- *Saba Kiaei*, *David Buckley*, and *Jonathan Hefner*
-
-* Change the default serializer of `ActiveSupport::MessageEncryptor` from
- `Marshal` to `ActiveSupport::JSON` when using `config.load_defaults 7.1`.
-
- Messages serialized with `Marshal` can still be read, but new messages will
- be serialized with `ActiveSupport::JSON`. For more information, see
- https://guides.rubyonrails.org/v7.1/configuring.html#config-active-support-message-serializer.
-
- *Zack Deveau*, *Martin Gingras*, and *Jonathan Hefner*
-
-* Add `ActiveSupport::TestCase#stub_const` to stub a constant for the duration of a yield.
-
- *DHH*
-
-* Fix `ActiveSupport::EncryptedConfiguration` to be compatible with Psych 4
-
- *Stephen Sugden*
-
-* Improve `File.atomic_write` error handling
-
- *Daniel Pepper*
-
-* Fix `Class#descendants` and `DescendantsTracker#descendants` compatibility with Ruby 3.1.
-
- [The native `Class#descendants` was reverted prior to Ruby 3.1 release](https://bugs.ruby-lang.org/issues/14394#note-33),
- but `Class#subclasses` was kept, breaking the feature detection.
-
- *Jean Boussier*
-
-Please check [7-0-stable](https://github.com/rails/rails/blob/7-0-stable/activesupport/CHANGELOG.md) for previous changes.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/MIT-LICENSE b/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/MIT-LICENSE
deleted file mode 100644
index f12cfa7..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/MIT-LICENSE
+++ /dev/null
@@ -1,20 +0,0 @@
-Copyright (c) David Heinemeier Hansson
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/README.rdoc b/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/README.rdoc
deleted file mode 100644
index 04e1f77..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/activesupport-7.1.1/README.rdoc
+++ /dev/null
@@ -1,40 +0,0 @@
-= Active Support -- Utility classes and Ruby extensions from \Rails
-
-Active Support is a collection of utility classes and standard library
-extensions that were found useful for the \Rails framework. These additions
-reside in this package so they can be loaded as needed in Ruby projects
-outside of \Rails.
-
-You can read more about the extensions in the {Active Support Core Extensions}[https://guides.rubyonrails.org/active_support_core_extensions.html] guide.
-
-== Download and installation
-
-The latest version of Active Support can be installed with RubyGems:
-
- $ gem install activesupport
-
-Source code can be downloaded as part of the \Rails project on GitHub:
-
-* https://github.com/rails/rails/tree/main/activesupport
-
-
-== License
-
-Active Support is released under the MIT license:
-
-* https://opensource.org/licenses/MIT
-
-
-== Support
-
-API documentation is at:
-
-* https://api.rubyonrails.org
-
-Bug reports for the Ruby on \Rails project can be filed here:
-
-* https://github.com/rails/rails/issues
-
-Feature requests should be discussed on the rails-core mailing list here:
-
-* https://discuss.rubyonrails.org/c/rubyonrails-core
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/CHANGELOG.md b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/CHANGELOG.md
deleted file mode 100644
index ee81c73..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/CHANGELOG.md
+++ /dev/null
@@ -1,291 +0,0 @@
-# Addressable 2.8.5
-- Fix thread safety issue with encoding tables ([#515])
-- Define URI::NONE as a module to avoid serialization issues ([#509])
-- Fix YAML serialization ([#508])
-
-[#508]: https://github.com/sporkmonger/addressable/pull/508
-[#509]: https://github.com/sporkmonger/addressable/pull/509
-[#515]: https://github.com/sporkmonger/addressable/pull/515
-
-# Addressable 2.8.4
-- Restore `Addressable::IDNA.unicode_normalize_kc` as a deprecated method ([#504])
-
-[#504]: https://github.com/sporkmonger/addressable/pull/504
-
-# Addressable 2.8.3
-- Fix template expand level 2 hash support for non-string objects ([#499], [#498])
-
-[#499]: https://github.com/sporkmonger/addressable/pull/499
-[#498]: https://github.com/sporkmonger/addressable/pull/498
-
-# Addressable 2.8.2
-- Improve cache hits and JIT friendliness ([#486](https://github.com/sporkmonger/addressable/pull/486))
-- Improve code style and test coverage ([#482](https://github.com/sporkmonger/addressable/pull/482))
-- Ensure reset of deferred validation ([#481](https://github.com/sporkmonger/addressable/pull/481))
-- Resolve normalization differences between `IDNA::Native` and `IDNA::Pure` ([#408](https://github.com/sporkmonger/addressable/issues/408), [#492])
-- Remove redundant colon in `Addressable::URI::CharacterClasses::AUTHORITY` regex ([#438](https://github.com/sporkmonger/addressable/pull/438)) (accidentally reverted by [#449] merge but [added back](https://github.com/sporkmonger/addressable/pull/492#discussion_r1105125280) in [#492])
-
-[#492]: https://github.com/sporkmonger/addressable/pull/492
-
-# Addressable 2.8.1
-- refactor `Addressable::URI.normalize_path` to address linter offenses ([#430](https://github.com/sporkmonger/addressable/pull/430))
-- update gemspec to reflect supported Ruby versions ([#466], [#464], [#463])
-- compatibility w/ public_suffix 5.x ([#466], [#465], [#460])
-- fixes "invalid byte sequence in UTF-8" exception when unencoding URLs containing non UTF-8 characters ([#459](https://github.com/sporkmonger/addressable/pull/459))
-- `Ractor` compatibility ([#449])
-- use the whole string instead of a single line for template match ([#431](https://github.com/sporkmonger/addressable/pull/431))
-- force UTF-8 encoding only if needed ([#341](https://github.com/sporkmonger/addressable/pull/341))
-
-[#449]: https://github.com/sporkmonger/addressable/pull/449
-[#460]: https://github.com/sporkmonger/addressable/pull/460
-[#463]: https://github.com/sporkmonger/addressable/pull/463
-[#464]: https://github.com/sporkmonger/addressable/pull/464
-[#465]: https://github.com/sporkmonger/addressable/pull/465
-[#466]: https://github.com/sporkmonger/addressable/pull/466
-
-# Addressable 2.8.0
-- fixes ReDoS vulnerability in Addressable::Template#match
-- no longer replaces `+` with spaces in queries for non-http(s) schemes
-- fixed encoding ipv6 literals
-- the `:compacted` flag for `normalized_query` now dedupes parameters
-- fix broken `escape_component` alias
-- dropping support for Ruby 2.0 and 2.1
-- adding Ruby 3.0 compatibility for development tasks
-- drop support for `rack-mount` and remove Addressable::Template#generate
-- performance improvements
-- switch CI/CD to GitHub Actions
-
-# Addressable 2.7.0
-- added `:compacted` flag to `normalized_query`
-- `heuristic_parse` handles `mailto:` more intuitively
-- dropped explicit support for JRuby 9.0.5.0
-- compatibility w/ public_suffix 4.x
-- performance improvements
-
-# Addressable 2.6.0
-- added `tld=` method to allow assignment to the public suffix
-- most `heuristic_parse` patterns are now case-insensitive
-- `heuristic_parse` handles more `file://` URI variations
-- fixes bug in `heuristic_parse` when uri starts with digit
-- fixes bug in `request_uri=` with query strings
-- fixes template issues with `nil` and `?` operator
-- `frozen_string_literal` pragmas added
-- minor performance improvements in regexps
-- fixes to eliminate warnings
-
-# Addressable 2.5.2
-- better support for frozen string literals
-- fixed bug w/ uppercase characters in scheme
-- IDNA errors w/ emoji URLs
-- compatibility w/ public_suffix 3.x
-
-# Addressable 2.5.1
-- allow unicode normalization to be disabled for URI Template expansion
-- removed duplicate test
-
-# Addressable 2.5.0
-- dropping support for Ruby 1.9
-- adding support for Ruby 2.4 preview
-- add support for public suffixes and tld; first runtime dependency
-- hostname escaping should match RFC; underscores in hostnames no longer escaped
-- paths beginning with // and missing an authority are now considered invalid
-- validation now also takes place after setting a path
-- handle backslashes in authority more like a browser for `heuristic_parse`
-- unescaped backslashes in host now raise an `InvalidURIError`
-- `merge!`, `join!`, `omit!` and `normalize!` don't disable deferred validation
-- `heuristic_parse` now trims whitespace before parsing
-- host parts longer than 63 bytes will be ignored and not passed to libidn
-- normalized values always encoded as UTF-8
-
-# Addressable 2.4.0
-- support for 1.8.x dropped
-- double quotes in a host now raises an error
-- newlines in host will no longer get unescaped during normalization
-- stricter handling of bogus scheme values
-- stricter handling of encoded port values
-- calling `require 'addressable'` will now load both the URI and Template files
-- assigning to the `hostname` component with an `IPAddr` object is now supported
-- assigning to the `origin` component is now supported
-- fixed minor bug where an exception would be thrown for a missing ACE suffix
-- better partial expansion of URI templates
-
-# Addressable 2.3.8
-- fix warnings
-- update dependency gems
-- support for 1.8.x officially deprecated
-
-# Addressable 2.3.7
-- fix scenario in which invalid URIs don't get an exception until inspected
-- handle hostnames with two adjacent periods correctly
-- upgrade of RSpec
-
-# Addressable 2.3.6
-- normalization drops empty query string
-- better handling in template extract for missing values
-- template modifier for `'?'` now treated as optional
-- fixed issue where character class parameters were modified
-- templates can now be tested for equality
-- added `:sorted` option to normalization of query strings
-- fixed issue with normalization of hosts given in `'example.com.'` form
-
-# Addressable 2.3.5
-- added Addressable::URI#empty? method
-- Addressable::URI#hostname methods now strip square brackets from IPv6 hosts
-- compatibility with Net::HTTP in Ruby 2.0.0
-- Addressable::URI#route_from should always give relative URIs
-
-# Addressable 2.3.4
-- fixed issue with encoding altering its inputs
-- query string normalization now leaves ';' characters alone
-- FakeFS is detected before attempting to load unicode tables
-- additional testing to ensure frozen objects don't cause problems
-
-# Addressable 2.3.3
-- fixed issue with converting common primitives during template expansion
-- fixed port encoding issue
-- removed a few warnings
-- normalize should now ignore %2B in query strings
-- the IDNA logic should now be handled by libidn in Ruby 1.9
-- no template match should now result in nil instead of an empty MatchData
-- added license information to gemspec
-
-# Addressable 2.3.2
-- added Addressable::URI#default_port method
-- fixed issue with Marshalling Unicode data on Windows
-- improved heuristic parsing to better handle IPv4 addresses
-
-# Addressable 2.3.1
-- fixed missing unicode data file
-
-# Addressable 2.3.0
-- updated Addressable::Template to use RFC 6570, level 4
-- fixed compatibility problems with some versions of Ruby
-- moved unicode tables into a data file for performance reasons
-- removing support for multiple query value notations
-
-# Addressable 2.2.8
-- fixed issues with dot segment removal code
-- form encoding can now handle multiple values per key
-- updated development environment
-
-# Addressable 2.2.7
-- fixed issues related to Addressable::URI#query_values=
-- the Addressable::URI.parse method is now polymorphic
-
-# Addressable 2.2.6
-- changed the way ambiguous paths are handled
-- fixed bug with frozen URIs
-- https supported in heuristic parsing
-
-# Addressable 2.2.5
-- 'parsing' a pre-parsed URI object is now a dup operation
-- introduced conditional support for libidn
-- fixed normalization issue on ampersands in query strings
-- added additional tests around handling of query strings
-
-# Addressable 2.2.4
-- added origin support from draft-ietf-websec-origin-00
-- resolved issue with attempting to navigate below root
-- fixed bug with string splitting in query strings
-
-# Addressable 2.2.3
-- added :flat_array notation for query strings
-
-# Addressable 2.2.2
-- fixed issue with percent escaping of '+' character in query strings
-
-# Addressable 2.2.1
-- added support for application/x-www-form-urlencoded.
-
-# Addressable 2.2.0
-- added site methods
-- improved documentation
-
-# Addressable 2.1.2
-- added HTTP request URI methods
-- better handling of Windows file paths
-- validation_deferred boolean replaced with defer_validation block
-- normalization of percent-encoded paths should now be correct
-- fixed issue with constructing URIs with relative paths
-- fixed warnings
-
-# Addressable 2.1.1
-- more type checking changes
-- fixed issue with unicode normalization
-- added method to find template defaults
-- symbolic keys are now allowed in template mappings
-- numeric values and symbolic values are now allowed in template mappings
-
-# Addressable 2.1.0
-- refactored URI template support out into its own class
-- removed extract method due to being useless and unreliable
-- removed Addressable::URI.expand_template
-- removed Addressable::URI#extract_mapping
-- added partial template expansion
-- fixed minor bugs in the parse and heuristic_parse methods
-- fixed incompatibility with Ruby 1.9.1
-- fixed bottleneck in Addressable::URI#hash and Addressable::URI#to_s
-- fixed unicode normalization exception
-- updated query_values methods to better handle subscript notation
-- worked around issue with freezing URIs
-- improved specs
-
-# Addressable 2.0.2
-- fixed issue with URI template expansion
-- fixed issue with percent escaping characters 0-15
-
-# Addressable 2.0.1
-- fixed issue with query string assignment
-- fixed issue with improperly encoded components
-
-# Addressable 2.0.0
-- the initialize method now takes an options hash as its only parameter
-- added query_values method to URI class
-- completely replaced IDNA implementation with pure Ruby
-- renamed Addressable::ADDRESSABLE_VERSION to Addressable::VERSION
-- completely reworked the Rakefile
-- changed the behavior of the port method significantly
-- Addressable::URI.encode_segment, Addressable::URI.unencode_segment renamed
-- documentation is now in YARD format
-- more rigorous type checking
-- to_str method implemented, implicit conversion to Strings now allowed
-- Addressable::URI#omit method added, Addressable::URI#merge method replaced
-- updated URI Template code to match v 03 of the draft spec
-- added a bunch of new specifications
-
-# Addressable 1.0.4
-- switched to using RSpec's pending system for specs that rely on IDN
-- fixed issue with creating URIs with paths that are not prefixed with '/'
-
-# Addressable 1.0.3
-- implemented a hash method
-
-# Addressable 1.0.2
-- fixed minor bug with the extract_mapping method
-
-# Addressable 1.0.1
-- fixed minor bug with the extract_mapping method
-
-# Addressable 1.0.0
-- heuristic parse method added
-- parsing is slightly more strict
-- replaced to_h with to_hash
-- fixed routing methods
-- improved specifications
-- improved heckle rake task
-- no surviving heckle mutations
-
-# Addressable 0.1.2
-- improved normalization
-- fixed bug in joining algorithm
-- updated specifications
-
-# Addressable 0.1.1
-- updated documentation
-- added URI Template variable extraction
-
-# Addressable 0.1.0
-- initial release
-- implementation based on RFC 3986, 3987
-- support for IRIs via libidn
-- support for the URI Template draft spec
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/Gemfile b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/Gemfile
deleted file mode 100644
index 0d36ffb..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/Gemfile
+++ /dev/null
@@ -1,30 +0,0 @@
-# frozen_string_literal: true
-
-source 'https://rubygems.org'
-
-gemspec
-
-group :test do
- gem 'rspec', '~> 3.8'
- gem 'rspec-its', '~> 1.3'
-end
-
-group :coverage do
- gem "coveralls", "> 0.7", require: false, platforms: :mri
- gem "simplecov", require: false
-end
-
-group :development do
- gem 'launchy', '~> 2.4', '>= 2.4.3'
- gem 'redcarpet', :platform => :mri_19
- gem 'yard'
-end
-
-group :test, :development do
- gem 'memory_profiler'
- gem "rake", ">= 12.3.3"
-end
-
-unless ENV["IDNA_MODE"] == "pure"
- gem "idn-ruby", platform: :mri
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/LICENSE.txt b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/LICENSE.txt
deleted file mode 100644
index ef51da2..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/LICENSE.txt
+++ /dev/null
@@ -1,202 +0,0 @@
-
- Apache License
- Version 2.0, January 2004
- http://www.apache.org/licenses/
-
-TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-1. Definitions.
-
- "License" shall mean the terms and conditions for use, reproduction,
- and distribution as defined by Sections 1 through 9 of this document.
-
- "Licensor" shall mean the copyright owner or entity authorized by
- the copyright owner that is granting the License.
-
- "Legal Entity" shall mean the union of the acting entity and all
- other entities that control, are controlled by, or are under common
- control with that entity. For the purposes of this definition,
- "control" means (i) the power, direct or indirect, to cause the
- direction or management of such entity, whether by contract or
- otherwise, or (ii) ownership of fifty percent (50%) or more of the
- outstanding shares, or (iii) beneficial ownership of such entity.
-
- "You" (or "Your") shall mean an individual or Legal Entity
- exercising permissions granted by this License.
-
- "Source" form shall mean the preferred form for making modifications,
- including but not limited to software source code, documentation
- source, and configuration files.
-
- "Object" form shall mean any form resulting from mechanical
- transformation or translation of a Source form, including but
- not limited to compiled object code, generated documentation,
- and conversions to other media types.
-
- "Work" shall mean the work of authorship, whether in Source or
- Object form, made available under the License, as indicated by a
- copyright notice that is included in or attached to the work
- (an example is provided in the Appendix below).
-
- "Derivative Works" shall mean any work, whether in Source or Object
- form, that is based on (or derived from) the Work and for which the
- editorial revisions, annotations, elaborations, or other modifications
- represent, as a whole, an original work of authorship. For the purposes
- of this License, Derivative Works shall not include works that remain
- separable from, or merely link (or bind by name) to the interfaces of,
- the Work and Derivative Works thereof.
-
- "Contribution" shall mean any work of authorship, including
- the original version of the Work and any modifications or additions
- to that Work or Derivative Works thereof, that is intentionally
- submitted to Licensor for inclusion in the Work by the copyright owner
- or by an individual or Legal Entity authorized to submit on behalf of
- the copyright owner. For the purposes of this definition, "submitted"
- means any form of electronic, verbal, or written communication sent
- to the Licensor or its representatives, including but not limited to
- communication on electronic mailing lists, source code control systems,
- and issue tracking systems that are managed by, or on behalf of, the
- Licensor for the purpose of discussing and improving the Work, but
- excluding communication that is conspicuously marked or otherwise
- designated in writing by the copyright owner as "Not a Contribution."
-
- "Contributor" shall mean Licensor and any individual or Legal Entity
- on behalf of whom a Contribution has been received by Licensor and
- subsequently incorporated within the Work.
-
-2. Grant of Copyright License. Subject to the terms and conditions of
- this License, each Contributor hereby grants to You a perpetual,
- worldwide, non-exclusive, no-charge, royalty-free, irrevocable
- copyright license to reproduce, prepare Derivative Works of,
- publicly display, publicly perform, sublicense, and distribute the
- Work and such Derivative Works in Source or Object form.
-
-3. Grant of Patent License. Subject to the terms and conditions of
- this License, each Contributor hereby grants to You a perpetual,
- worldwide, non-exclusive, no-charge, royalty-free, irrevocable
- (except as stated in this section) patent license to make, have made,
- use, offer to sell, sell, import, and otherwise transfer the Work,
- where such license applies only to those patent claims licensable
- by such Contributor that are necessarily infringed by their
- Contribution(s) alone or by combination of their Contribution(s)
- with the Work to which such Contribution(s) was submitted. If You
- institute patent litigation against any entity (including a
- cross-claim or counterclaim in a lawsuit) alleging that the Work
- or a Contribution incorporated within the Work constitutes direct
- or contributory patent infringement, then any patent licenses
- granted to You under this License for that Work shall terminate
- as of the date such litigation is filed.
-
-4. Redistribution. You may reproduce and distribute copies of the
- Work or Derivative Works thereof in any medium, with or without
- modifications, and in Source or Object form, provided that You
- meet the following conditions:
-
- (a) You must give any other recipients of the Work or
- Derivative Works a copy of this License; and
-
- (b) You must cause any modified files to carry prominent notices
- stating that You changed the files; and
-
- (c) You must retain, in the Source form of any Derivative Works
- that You distribute, all copyright, patent, trademark, and
- attribution notices from the Source form of the Work,
- excluding those notices that do not pertain to any part of
- the Derivative Works; and
-
- (d) If the Work includes a "NOTICE" text file as part of its
- distribution, then any Derivative Works that You distribute must
- include a readable copy of the attribution notices contained
- within such NOTICE file, excluding those notices that do not
- pertain to any part of the Derivative Works, in at least one
- of the following places: within a NOTICE text file distributed
- as part of the Derivative Works; within the Source form or
- documentation, if provided along with the Derivative Works; or,
- within a display generated by the Derivative Works, if and
- wherever such third-party notices normally appear. The contents
- of the NOTICE file are for informational purposes only and
- do not modify the License. You may add Your own attribution
- notices within Derivative Works that You distribute, alongside
- or as an addendum to the NOTICE text from the Work, provided
- that such additional attribution notices cannot be construed
- as modifying the License.
-
- You may add Your own copyright statement to Your modifications and
- may provide additional or different license terms and conditions
- for use, reproduction, or distribution of Your modifications, or
- for any such Derivative Works as a whole, provided Your use,
- reproduction, and distribution of the Work otherwise complies with
- the conditions stated in this License.
-
-5. Submission of Contributions. Unless You explicitly state otherwise,
- any Contribution intentionally submitted for inclusion in the Work
- by You to the Licensor shall be under the terms and conditions of
- this License, without any additional terms or conditions.
- Notwithstanding the above, nothing herein shall supersede or modify
- the terms of any separate license agreement you may have executed
- with Licensor regarding such Contributions.
-
-6. Trademarks. This License does not grant permission to use the trade
- names, trademarks, service marks, or product names of the Licensor,
- except as required for reasonable and customary use in describing the
- origin of the Work and reproducing the content of the NOTICE file.
-
-7. Disclaimer of Warranty. Unless required by applicable law or
- agreed to in writing, Licensor provides the Work (and each
- Contributor provides its Contributions) on an "AS IS" BASIS,
- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
- implied, including, without limitation, any warranties or conditions
- of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
- PARTICULAR PURPOSE. You are solely responsible for determining the
- appropriateness of using or redistributing the Work and assume any
- risks associated with Your exercise of permissions under this License.
-
-8. Limitation of Liability. In no event and under no legal theory,
- whether in tort (including negligence), contract, or otherwise,
- unless required by applicable law (such as deliberate and grossly
- negligent acts) or agreed to in writing, shall any Contributor be
- liable to You for damages, including any direct, indirect, special,
- incidental, or consequential damages of any character arising as a
- result of this License or out of the use or inability to use the
- Work (including but not limited to damages for loss of goodwill,
- work stoppage, computer failure or malfunction, or any and all
- other commercial damages or losses), even if such Contributor
- has been advised of the possibility of such damages.
-
-9. Accepting Warranty or Additional Liability. While redistributing
- the Work or Derivative Works thereof, You may choose to offer,
- and charge a fee for, acceptance of support, warranty, indemnity,
- or other liability obligations and/or rights consistent with this
- License. However, in accepting such obligations, You may act only
- on Your own behalf and on Your sole responsibility, not on behalf
- of any other Contributor, and only if You agree to indemnify,
- defend, and hold each Contributor harmless for any liability
- incurred by, or claims asserted against, such Contributor by reason
- of your accepting any such warranty or additional liability.
-
-END OF TERMS AND CONDITIONS
-
-APPENDIX: How to apply the Apache License to your work.
-
- To apply the Apache License to your work, attach the following
- boilerplate notice, with the fields enclosed by brackets "[]"
- replaced with your own identifying information. (Don't include
- the brackets!) The text should be enclosed in the appropriate
- comment syntax for the file format. We also recommend that a
- file or class name and description of purpose be included on the
- same "printed page" as the copyright notice for easier
- identification within third-party archives.
-
-Copyright [yyyy] [name of copyright owner]
-
-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.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/README.md b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/README.md
deleted file mode 100644
index 9892f61..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/README.md
+++ /dev/null
@@ -1,121 +0,0 @@
-# Addressable
-
-
-
-[][gem]
-[][actions]
-[][coveralls]
-[][inch]
-
-[gem]: https://rubygems.org/gems/addressable
-[actions]: https://github.com/sporkmonger/addressable/actions
-[coveralls]: https://coveralls.io/r/sporkmonger/addressable
-[inch]: https://inch-ci.org/github/sporkmonger/addressable
-
-# Description
-
-Addressable is an alternative implementation to the URI implementation
-that is part of Ruby's standard library. It is flexible, offers heuristic
-parsing, and additionally provides extensive support for IRIs and URI templates.
-
-Addressable closely conforms to RFC 3986, RFC 3987, and RFC 6570 (level 4).
-
-# Reference
-
-- {Addressable::URI}
-- {Addressable::Template}
-
-# Example usage
-
-```ruby
-require "addressable/uri"
-
-uri = Addressable::URI.parse("http://example.com/path/to/resource/")
-uri.scheme
-#=> "http"
-uri.host
-#=> "example.com"
-uri.path
-#=> "/path/to/resource/"
-
-uri = Addressable::URI.parse("http://www.詹姆斯.com/")
-uri.normalize
-#=> #
-```
-
-
-# URI Templates
-
-For more details, see [RFC 6570](https://www.rfc-editor.org/rfc/rfc6570.txt).
-
-
-```ruby
-
-require "addressable/template"
-
-template = Addressable::Template.new("http://example.com/{?query*}")
-template.expand({
- "query" => {
- 'foo' => 'bar',
- 'color' => 'red'
- }
-})
-#=> #
-
-template = Addressable::Template.new("http://example.com/{?one,two,three}")
-template.partial_expand({"one" => "1", "three" => 3}).pattern
-#=> "http://example.com/?one=1{&two}&three=3"
-
-template = Addressable::Template.new(
- "http://{host}{/segments*}/{?one,two,bogus}{#fragment}"
-)
-uri = Addressable::URI.parse(
- "http://example.com/a/b/c/?one=1&two=2#foo"
-)
-template.extract(uri)
-#=>
-# {
-# "host" => "example.com",
-# "segments" => ["a", "b", "c"],
-# "one" => "1",
-# "two" => "2",
-# "fragment" => "foo"
-# }
-```
-
-# Install
-
-```console
-$ gem install addressable
-```
-
-You may optionally turn on native IDN support by installing libidn and the
-idn gem:
-
-```console
-$ sudo apt-get install libidn11-dev # Debian/Ubuntu
-$ brew install libidn # OS X
-$ gem install idn-ruby
-```
-
-# Semantic Versioning
-
-This project uses [Semantic Versioning](https://semver.org/). You can (and should) specify your
-dependency using a pessimistic version constraint covering the major and minor
-values:
-
-```ruby
-spec.add_dependency 'addressable', '~> 2.7'
-```
-
-If you need a specific bug fix, you can also specify minimum tiny versions
-without preventing updates to the latest minor release:
-
-```ruby
-spec.add_dependency 'addressable', '~> 2.3', '>= 2.3.7'
-```
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/Rakefile b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/Rakefile
deleted file mode 100644
index 3ba58df..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/Rakefile
+++ /dev/null
@@ -1,40 +0,0 @@
-# frozen_string_literal: true
-
-require 'rubygems'
-require 'rake'
-
-require File.join(File.dirname(__FILE__), 'lib', 'addressable', 'version')
-
-PKG_DISPLAY_NAME = 'Addressable'
-PKG_NAME = PKG_DISPLAY_NAME.downcase
-PKG_VERSION = Addressable::VERSION::STRING
-PKG_FILE_NAME = "#{PKG_NAME}-#{PKG_VERSION}"
-
-RELEASE_NAME = "REL #{PKG_VERSION}"
-
-PKG_SUMMARY = "URI Implementation"
-PKG_DESCRIPTION = <<-TEXT
-Addressable is an alternative implementation to the URI implementation that is
-part of Ruby's standard library. It is flexible, offers heuristic parsing, and
-additionally provides extensive support for IRIs and URI templates.
-TEXT
-
-PKG_FILES = FileList[
- "data/**/*",
- "lib/**/*.rb",
- "spec/**/*.rb",
- "tasks/**/*.rake",
- "addressable.gemspec",
- "CHANGELOG.md",
- "Gemfile",
- "LICENSE.txt",
- "README.md",
- "Rakefile",
-]
-
-task :default => "spec"
-
-WINDOWS = (RUBY_PLATFORM =~ /mswin|win32|mingw|bccwin|cygwin/) rescue false
-SUDO = WINDOWS ? '' : ('sudo' unless ENV['SUDOLESS'])
-
-Dir['tasks/**/*.rake'].each { |rake| load rake }
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/addressable.gemspec b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/addressable.gemspec
deleted file mode 100644
index d94b2af..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/addressable.gemspec
+++ /dev/null
@@ -1,28 +0,0 @@
-# -*- encoding: utf-8 -*-
-# stub: addressable 2.8.5 ruby lib
-
-Gem::Specification.new do |s|
- s.name = "addressable".freeze
- s.version = "2.8.5"
-
- s.required_rubygems_version = Gem::Requirement.new(">= 0".freeze) if s.respond_to? :required_rubygems_version=
- s.metadata = { "changelog_uri" => "https://github.com/sporkmonger/addressable/blob/main/CHANGELOG.md" } if s.respond_to? :metadata=
- s.require_paths = ["lib".freeze]
- s.authors = ["Bob Aman".freeze]
- s.date = "2023-08-03"
- s.description = "Addressable is an alternative implementation to the URI implementation that is\npart of Ruby's standard library. It is flexible, offers heuristic parsing, and\nadditionally provides extensive support for IRIs and URI templates.\n".freeze
- s.email = "bob@sporkmonger.com".freeze
- s.extra_rdoc_files = ["README.md".freeze]
- s.files = ["CHANGELOG.md".freeze, "Gemfile".freeze, "LICENSE.txt".freeze, "README.md".freeze, "Rakefile".freeze, "addressable.gemspec".freeze, "data/unicode.data".freeze, "lib/addressable.rb".freeze, "lib/addressable/idna.rb".freeze, "lib/addressable/idna/native.rb".freeze, "lib/addressable/idna/pure.rb".freeze, "lib/addressable/template.rb".freeze, "lib/addressable/uri.rb".freeze, "lib/addressable/version.rb".freeze, "spec/addressable/idna_spec.rb".freeze, "spec/addressable/net_http_compat_spec.rb".freeze, "spec/addressable/security_spec.rb".freeze, "spec/addressable/template_spec.rb".freeze, "spec/addressable/uri_spec.rb".freeze, "spec/spec_helper.rb".freeze, "tasks/clobber.rake".freeze, "tasks/gem.rake".freeze, "tasks/git.rake".freeze, "tasks/metrics.rake".freeze, "tasks/profile.rake".freeze, "tasks/rspec.rake".freeze, "tasks/yard.rake".freeze]
- s.homepage = "https://github.com/sporkmonger/addressable".freeze
- s.licenses = ["Apache-2.0".freeze]
- s.rdoc_options = ["--main".freeze, "README.md".freeze]
- s.required_ruby_version = Gem::Requirement.new(">= 2.2".freeze)
- s.rubygems_version = "3.4.18".freeze
- s.summary = "URI Implementation".freeze
-
- s.specification_version = 4
-
- s.add_runtime_dependency(%q.freeze, [">= 2.0.2", "< 6.0"])
- s.add_development_dependency(%q.freeze, [">= 1.0", "< 3.0"])
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/idna_spec.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/idna_spec.rb
deleted file mode 100644
index 428c9ec..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/idna_spec.rb
+++ /dev/null
@@ -1,302 +0,0 @@
-# frozen_string_literal: true
-
-# Copyright (C) Bob Aman
-#
-# 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.
-
-
-require "spec_helper"
-
-# Have to use RubyGems to load the idn gem.
-require "rubygems"
-
-require "addressable/idna"
-
-shared_examples_for "converting from unicode to ASCII" do
- it "should convert 'www.google.com' correctly" do
- expect(Addressable::IDNA.to_ascii("www.google.com")).to eq("www.google.com")
- end
-
- long = 'AcinusFallumTrompetumNullunCreditumVisumEstAtCuadLongumEtCefallum.com'
- it "should convert '#{long}' correctly" do
- expect(Addressable::IDNA.to_ascii(long)).to eq(long)
- end
-
- it "should convert 'www.詹姆斯.com' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "www.詹姆斯.com"
- )).to eq("www.xn--8ws00zhy3a.com")
- end
-
- it "also accepts unicode strings encoded as ascii-8bit" do
- expect(Addressable::IDNA.to_ascii(
- "www.詹姆斯.com".b
- )).to eq("www.xn--8ws00zhy3a.com")
- end
-
- it "should convert 'www.Iñtërnâtiônàlizætiøn.com' correctly" do
- "www.Iñtërnâtiônàlizætiøn.com"
- expect(Addressable::IDNA.to_ascii(
- "www.I\xC3\xB1t\xC3\xABrn\xC3\xA2ti\xC3\xB4" +
- "n\xC3\xA0liz\xC3\xA6ti\xC3\xB8n.com"
- )).to eq("www.xn--itrntinliztin-vdb0a5exd8ewcye.com")
- end
-
- it "should convert 'www.Iñtërnâtiônàlizætiøn.com' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "www.In\xCC\x83te\xCC\x88rna\xCC\x82tio\xCC\x82n" +
- "a\xCC\x80liz\xC3\xA6ti\xC3\xB8n.com"
- )).to eq("www.xn--itrntinliztin-vdb0a5exd8ewcye.com")
- end
-
- it "should convert " +
- "'www.ほんとうにながいわけのわからないどめいんめいのらべるまだながくしないとたりない.w3.mag.keio.ac.jp' " +
- "correctly" do
- expect(Addressable::IDNA.to_ascii(
- "www.\343\201\273\343\202\223\343\201\250\343\201\206\343\201\253\343" +
- "\201\252\343\201\214\343\201\204\343\202\217\343\201\221\343\201\256" +
- "\343\202\217\343\201\213\343\202\211\343\201\252\343\201\204\343\201" +
- "\251\343\202\201\343\201\204\343\202\223\343\202\201\343\201\204\343" +
- "\201\256\343\202\211\343\201\271\343\202\213\343\201\276\343\201\240" +
- "\343\201\252\343\201\214\343\201\217\343\201\227\343\201\252\343\201" +
- "\204\343\201\250\343\201\237\343\202\212\343\201\252\343\201\204." +
- "w3.mag.keio.ac.jp"
- )).to eq(
- "www.xn--n8jaaaaai5bhf7as8fsfk3jnknefdde3" +
- "fg11amb5gzdb4wi9bya3kc6lra.w3.mag.keio.ac.jp"
- )
- end
-
- it "should convert " +
- "'www.ほんとうにながいわけのわからないどめいんめいのらべるまだながくしないとたりない.w3.mag.keio.ac.jp' " +
- "correctly" do
- expect(Addressable::IDNA.to_ascii(
- "www.\343\201\273\343\202\223\343\201\250\343\201\206\343\201\253\343" +
- "\201\252\343\201\213\343\202\231\343\201\204\343\202\217\343\201\221" +
- "\343\201\256\343\202\217\343\201\213\343\202\211\343\201\252\343\201" +
- "\204\343\201\250\343\202\231\343\202\201\343\201\204\343\202\223\343" +
- "\202\201\343\201\204\343\201\256\343\202\211\343\201\270\343\202\231" +
- "\343\202\213\343\201\276\343\201\237\343\202\231\343\201\252\343\201" +
- "\213\343\202\231\343\201\217\343\201\227\343\201\252\343\201\204\343" +
- "\201\250\343\201\237\343\202\212\343\201\252\343\201\204." +
- "w3.mag.keio.ac.jp"
- )).to eq(
- "www.xn--n8jaaaaai5bhf7as8fsfk3jnknefdde3" +
- "fg11amb5gzdb4wi9bya3kc6lra.w3.mag.keio.ac.jp"
- )
- end
-
- it "should convert '点心和烤鸭.w3.mag.keio.ac.jp' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "点心和烤鸭.w3.mag.keio.ac.jp"
- )).to eq("xn--0trv4xfvn8el34t.w3.mag.keio.ac.jp")
- end
-
- it "should convert '가각갂갃간갅갆갇갈갉힢힣.com' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "가각갂갃간갅갆갇갈갉힢힣.com"
- )).to eq("xn--o39acdefghijk5883jma.com")
- end
-
- it "should convert " +
- "'\347\242\274\346\250\231\346\272\226\350" +
- "\220\254\345\234\213\347\242\274.com' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "\347\242\274\346\250\231\346\272\226\350" +
- "\220\254\345\234\213\347\242\274.com"
- )).to eq("xn--9cs565brid46mda086o.com")
- end
-
- it "should convert 'ﾘ宠퐱〹.com' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "\357\276\230\345\256\240\355\220\261\343\200\271.com"
- )).to eq("xn--eek174hoxfpr4k.com")
- end
-
- it "should convert 'リ宠퐱卄.com' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "\343\203\252\345\256\240\355\220\261\345\215\204.com"
- )).to eq("xn--eek174hoxfpr4k.com")
- end
-
- it "should convert 'ᆵ' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "\341\206\265"
- )).to eq("xn--4ud")
- end
-
- it "should convert 'ﾯ' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "\357\276\257"
- )).to eq("xn--4ud")
- end
-
- it "should convert '🌹🌹🌹.ws' correctly" do
- expect(Addressable::IDNA.to_ascii(
- "\360\237\214\271\360\237\214\271\360\237\214\271.ws"
- )).to eq("xn--2h8haa.ws")
- end
-
- it "should handle two adjacent '.'s correctly" do
- expect(Addressable::IDNA.to_ascii(
- "example..host"
- )).to eq("example..host")
- end
-end
-
-shared_examples_for "converting from ASCII to unicode" do
- long = 'AcinusFallumTrompetumNullunCreditumVisumEstAtCuadLongumEtCefallum.com'
- it "should convert '#{long}' correctly" do
- expect(Addressable::IDNA.to_unicode(long)).to eq(long)
- end
-
- it "should return the identity conversion when punycode decode fails" do
- expect(Addressable::IDNA.to_unicode("xn--zckp1cyg1.sblo.jp")).to eq(
- "xn--zckp1cyg1.sblo.jp")
- end
-
- it "should return the identity conversion when the ACE prefix has no suffix" do
- expect(Addressable::IDNA.to_unicode("xn--...-")).to eq("xn--...-")
- end
-
- it "should convert 'www.google.com' correctly" do
- expect(Addressable::IDNA.to_unicode("www.google.com")).to eq(
- "www.google.com")
- end
-
- it "should convert 'www.詹姆斯.com' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "www.xn--8ws00zhy3a.com"
- )).to eq("www.詹姆斯.com")
- end
-
- it "should convert '詹姆斯.com' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--8ws00zhy3a.com"
- )).to eq("詹姆斯.com")
- end
-
- it "should convert 'www.iñtërnâtiônàlizætiøn.com' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "www.xn--itrntinliztin-vdb0a5exd8ewcye.com"
- )).to eq("www.iñtërnâtiônàlizætiøn.com")
- end
-
- it "should convert 'iñtërnâtiônàlizætiøn.com' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--itrntinliztin-vdb0a5exd8ewcye.com"
- )).to eq("iñtërnâtiônàlizætiøn.com")
- end
-
- it "should convert " +
- "'www.ほんとうにながいわけのわからないどめいんめいのらべるまだながくしないとたりない.w3.mag.keio.ac.jp' " +
- "correctly" do
- expect(Addressable::IDNA.to_unicode(
- "www.xn--n8jaaaaai5bhf7as8fsfk3jnknefdde3" +
- "fg11amb5gzdb4wi9bya3kc6lra.w3.mag.keio.ac.jp"
- )).to eq(
- "www.ほんとうにながいわけのわからないどめいんめいのらべるまだながくしないとたりない.w3.mag.keio.ac.jp"
- )
- end
-
- it "should convert '点心和烤鸭.w3.mag.keio.ac.jp' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--0trv4xfvn8el34t.w3.mag.keio.ac.jp"
- )).to eq("点心和烤鸭.w3.mag.keio.ac.jp")
- end
-
- it "should convert '가각갂갃간갅갆갇갈갉힢힣.com' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--o39acdefghijk5883jma.com"
- )).to eq("가각갂갃간갅갆갇갈갉힢힣.com")
- end
-
- it "should convert " +
- "'\347\242\274\346\250\231\346\272\226\350" +
- "\220\254\345\234\213\347\242\274.com' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--9cs565brid46mda086o.com"
- )).to eq(
- "\347\242\274\346\250\231\346\272\226\350" +
- "\220\254\345\234\213\347\242\274.com"
- )
- end
-
- it "should convert 'リ宠퐱卄.com' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--eek174hoxfpr4k.com"
- )).to eq("\343\203\252\345\256\240\355\220\261\345\215\204.com")
- end
-
- it "should convert 'ﾯ' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--4ud"
- )).to eq("\341\206\265")
- end
-
- it "should convert '🌹🌹🌹.ws' correctly" do
- expect(Addressable::IDNA.to_unicode(
- "xn--2h8haa.ws"
- )).to eq("\360\237\214\271\360\237\214\271\360\237\214\271.ws")
- end
-
- it "should handle two adjacent '.'s correctly" do
- expect(Addressable::IDNA.to_unicode(
- "example..host"
- )).to eq("example..host")
- end
-end
-
-describe Addressable::IDNA, "when using the pure-Ruby implementation" do
- before do
- Addressable.send(:remove_const, :IDNA)
- load "addressable/idna/pure.rb"
- end
-
- it_should_behave_like "converting from unicode to ASCII"
- it_should_behave_like "converting from ASCII to unicode"
-
- begin
- require "fiber"
-
- it "should not blow up inside fibers" do
- f = Fiber.new do
- Addressable.send(:remove_const, :IDNA)
- load "addressable/idna/pure.rb"
- end
- f.resume
- end
- rescue LoadError
- # Fibers aren't supported in this version of Ruby, skip this test.
- warn('Fibers unsupported.')
- end
-end
-
-begin
- require "idn"
-
- describe Addressable::IDNA, "when using the native-code implementation" do
- before do
- Addressable.send(:remove_const, :IDNA)
- load "addressable/idna/native.rb"
- end
-
- it_should_behave_like "converting from unicode to ASCII"
- it_should_behave_like "converting from ASCII to unicode"
- end
-rescue LoadError => error
- raise error if ENV["CI"] && TestHelper.native_supported?
-
- # Cannot test the native implementation without libidn support.
- warn('Could not load native IDN implementation.')
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/net_http_compat_spec.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/net_http_compat_spec.rb
deleted file mode 100644
index d07a43e..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/net_http_compat_spec.rb
+++ /dev/null
@@ -1,29 +0,0 @@
-# frozen_string_literal: true
-
-# Copyright (C) Bob Aman
-#
-# 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.
-
-
-require "spec_helper"
-
-require "addressable/uri"
-require "net/http"
-
-describe Net::HTTP do
- it "should be compatible with Addressable" do
- response_body =
- Net::HTTP.get(Addressable::URI.parse('http://www.google.com/'))
- expect(response_body).not_to be_nil
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/security_spec.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/security_spec.rb
deleted file mode 100644
index 3bf90a2..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/security_spec.rb
+++ /dev/null
@@ -1,58 +0,0 @@
-# frozen_string_literal: true
-
-# Copyright (C) Bob Aman
-#
-# 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.
-
-
-require "spec_helper"
-
-require "addressable/uri"
-
-describe Addressable::URI, "when created with a URI known to cause crashes " +
- "in certain browsers" do
- it "should parse correctly" do
- uri = Addressable::URI.parse('%%30%30')
- expect(uri.path).to eq('%%30%30')
- expect(uri.normalize.path).to eq('%2500')
- end
-
- it "should parse correctly as a full URI" do
- uri = Addressable::URI.parse('http://www.example.com/%%30%30')
- expect(uri.path).to eq('/%%30%30')
- expect(uri.normalize.path).to eq('/%2500')
- end
-end
-
-describe Addressable::URI, "when created with a URI known to cause crashes " +
- "in certain browsers" do
- it "should parse correctly" do
- uri = Addressable::URI.parse('لُصّبُلُلصّبُررً ॣ ॣh ॣ ॣ 冗')
- expect(uri.path).to eq('لُصّبُلُلصّبُررً ॣ ॣh ॣ ॣ 冗')
- expect(uri.normalize.path).to eq(
- '%D9%84%D9%8F%D8%B5%D9%91%D8%A8%D9%8F%D9%84%D9%8F%D9%84%D8%B5%D9%91' +
- '%D8%A8%D9%8F%D8%B1%D8%B1%D9%8B%20%E0%A5%A3%20%E0%A5%A3h%20%E0%A5' +
- '%A3%20%E0%A5%A3%20%E5%86%97'
- )
- end
-
- it "should parse correctly as a full URI" do
- uri = Addressable::URI.parse('http://www.example.com/لُصّبُلُلصّبُررً ॣ ॣh ॣ ॣ 冗')
- expect(uri.path).to eq('/لُصّبُلُلصّبُررً ॣ ॣh ॣ ॣ 冗')
- expect(uri.normalize.path).to eq(
- '/%D9%84%D9%8F%D8%B5%D9%91%D8%A8%D9%8F%D9%84%D9%8F%D9%84%D8%B5%D9%91' +
- '%D8%A8%D9%8F%D8%B1%D8%B1%D9%8B%20%E0%A5%A3%20%E0%A5%A3h%20%E0%A5' +
- '%A3%20%E0%A5%A3%20%E5%86%97'
- )
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/template_spec.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/template_spec.rb
deleted file mode 100644
index 24616c2..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/template_spec.rb
+++ /dev/null
@@ -1,1264 +0,0 @@
-# frozen_string_literal: true
-
-# Copyright (C) Bob Aman
-#
-# 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.
-
-
-require "spec_helper"
-
-require "bigdecimal"
-require "timeout"
-require "addressable/template"
-
-shared_examples_for 'expands' do |tests|
- tests.each do |template, expansion|
- exp = expansion.is_a?(Array) ? expansion.first : expansion
- it "#{template} to #{exp}" do
- tmpl = Addressable::Template.new(template).expand(subject)
- expect(tmpl.to_str).to eq(expansion)
- end
- end
-end
-
-describe "eql?" do
- let(:template) { Addressable::Template.new('https://www.example.com/{foo}') }
- it 'is equal when the pattern matches' do
- other_template = Addressable::Template.new('https://www.example.com/{foo}')
- expect(template).to be_eql(other_template)
- expect(other_template).to be_eql(template)
- end
- it 'is not equal when the pattern differs' do
- other_template = Addressable::Template.new('https://www.example.com/{bar}')
- expect(template).to_not be_eql(other_template)
- expect(other_template).to_not be_eql(template)
- end
- it 'is not equal to non-templates' do
- uri = 'https://www.example.com/foo/bar'
- addressable_template = Addressable::Template.new uri
- addressable_uri = Addressable::URI.parse uri
- expect(addressable_template).to_not be_eql(addressable_uri)
- expect(addressable_uri).to_not be_eql(addressable_template)
- end
-end
-
-describe "==" do
- let(:template) { Addressable::Template.new('https://www.example.com/{foo}') }
- it 'is equal when the pattern matches' do
- other_template = Addressable::Template.new('https://www.example.com/{foo}')
- expect(template).to eq other_template
- expect(other_template).to eq template
- end
- it 'is not equal when the pattern differs' do
- other_template = Addressable::Template.new('https://www.example.com/{bar}')
- expect(template).not_to eq other_template
- expect(other_template).not_to eq template
- end
- it 'is not equal to non-templates' do
- uri = 'https://www.example.com/foo/bar'
- addressable_template = Addressable::Template.new uri
- addressable_uri = Addressable::URI.parse uri
- expect(addressable_template).not_to eq addressable_uri
- expect(addressable_uri).not_to eq addressable_template
- end
-end
-
-describe "#to_regexp" do
- it "does not match the first line of multiline strings" do
- uri = "https://www.example.com/bar"
- template = Addressable::Template.new(uri)
- expect(template.match(uri)).not_to be_nil
- expect(template.match("#{uri}\ngarbage")).to be_nil
- end
-end
-
-describe "Type conversion" do
- subject {
- {
- :var => true,
- :hello => 1234,
- :nothing => nil,
- :sym => :symbolic,
- :decimal => BigDecimal('1')
- }
- }
-
- it_behaves_like 'expands', {
- '{var}' => 'true',
- '{hello}' => '1234',
- '{nothing}' => '',
- '{sym}' => 'symbolic',
- '{decimal}' => RUBY_VERSION < '2.4.0' ? '0.1E1' : '0.1e1'
- }
-end
-
-describe "Level 1:" do
- subject {
- {:var => "value", :hello => "Hello World!"}
- }
- it_behaves_like 'expands', {
- '{var}' => 'value',
- '{hello}' => 'Hello%20World%21'
- }
-end
-
-describe "Level 2" do
- subject {
- {
- :var => "value",
- :hello => "Hello World!",
- :path => "/foo/bar"
- }
- }
- context "Operator +:" do
- it_behaves_like 'expands', {
- '{+var}' => 'value',
- '{+hello}' => 'Hello%20World!',
- '{+path}/here' => '/foo/bar/here',
- 'here?ref={+path}' => 'here?ref=/foo/bar'
- }
- end
- context "Operator #:" do
- it_behaves_like 'expands', {
- 'X{#var}' => 'X#value',
- 'X{#hello}' => 'X#Hello%20World!'
- }
- end
-end
-
-describe "Level 3" do
- subject {
- {
- :var => "value",
- :hello => "Hello World!",
- :empty => "",
- :path => "/foo/bar",
- :x => "1024",
- :y => "768"
- }
- }
- context "Operator nil (multiple vars):" do
- it_behaves_like 'expands', {
- 'map?{x,y}' => 'map?1024,768',
- '{x,hello,y}' => '1024,Hello%20World%21,768'
- }
- end
- context "Operator + (multiple vars):" do
- it_behaves_like 'expands', {
- '{+x,hello,y}' => '1024,Hello%20World!,768',
- '{+path,x}/here' => '/foo/bar,1024/here'
- }
- end
- context "Operator # (multiple vars):" do
- it_behaves_like 'expands', {
- '{#x,hello,y}' => '#1024,Hello%20World!,768',
- '{#path,x}/here' => '#/foo/bar,1024/here'
- }
- end
- context "Operator ." do
- it_behaves_like 'expands', {
- 'X{.var}' => 'X.value',
- 'X{.x,y}' => 'X.1024.768'
- }
- end
- context "Operator /" do
- it_behaves_like 'expands', {
- '{/var}' => '/value',
- '{/var,x}/here' => '/value/1024/here'
- }
- end
- context "Operator ;" do
- it_behaves_like 'expands', {
- '{;x,y}' => ';x=1024;y=768',
- '{;x,y,empty}' => ';x=1024;y=768;empty'
- }
- end
- context "Operator ?" do
- it_behaves_like 'expands', {
- '{?x,y}' => '?x=1024&y=768',
- '{?x,y,empty}' => '?x=1024&y=768&empty='
- }
- end
- context "Operator &" do
- it_behaves_like 'expands', {
- '?fixed=yes{&x}' => '?fixed=yes&x=1024',
- '{&x,y,empty}' => '&x=1024&y=768&empty='
- }
- end
-end
-
-describe "Level 4" do
- subject {
- {
- :var => "value",
- :hello => "Hello World!",
- :path => "/foo/bar",
- :semi => ";",
- :list => %w(red green blue),
- :keys => {"semi" => ';', "dot" => '.', :comma => ','}
- }
- }
- context "Expansion with value modifiers" do
- it_behaves_like 'expands', {
- '{var:3}' => 'val',
- '{var:30}' => 'value',
- '{list}' => 'red,green,blue',
- '{list*}' => 'red,green,blue',
- '{keys}' => 'semi,%3B,dot,.,comma,%2C',
- '{keys*}' => 'semi=%3B,dot=.,comma=%2C',
- }
- end
- context "Operator + with value modifiers" do
- it_behaves_like 'expands', {
- '{+path:6}/here' => '/foo/b/here',
- '{+list}' => 'red,green,blue',
- '{+list*}' => 'red,green,blue',
- '{+keys}' => 'semi,;,dot,.,comma,,',
- '{+keys*}' => 'semi=;,dot=.,comma=,',
- }
- end
- context "Operator # with value modifiers" do
- it_behaves_like 'expands', {
- '{#path:6}/here' => '#/foo/b/here',
- '{#list}' => '#red,green,blue',
- '{#list*}' => '#red,green,blue',
- '{#keys}' => '#semi,;,dot,.,comma,,',
- '{#keys*}' => '#semi=;,dot=.,comma=,',
- }
- end
- context "Operator . with value modifiers" do
- it_behaves_like 'expands', {
- 'X{.var:3}' => 'X.val',
- 'X{.list}' => 'X.red,green,blue',
- 'X{.list*}' => 'X.red.green.blue',
- 'X{.keys}' => 'X.semi,%3B,dot,.,comma,%2C',
- 'X{.keys*}' => 'X.semi=%3B.dot=..comma=%2C',
- }
- end
- context "Operator / with value modifiers" do
- it_behaves_like 'expands', {
- '{/var:1,var}' => '/v/value',
- '{/list}' => '/red,green,blue',
- '{/list*}' => '/red/green/blue',
- '{/list*,path:4}' => '/red/green/blue/%2Ffoo',
- '{/keys}' => '/semi,%3B,dot,.,comma,%2C',
- '{/keys*}' => '/semi=%3B/dot=./comma=%2C',
- }
- end
- context "Operator ; with value modifiers" do
- it_behaves_like 'expands', {
- '{;hello:5}' => ';hello=Hello',
- '{;list}' => ';list=red,green,blue',
- '{;list*}' => ';list=red;list=green;list=blue',
- '{;keys}' => ';keys=semi,%3B,dot,.,comma,%2C',
- '{;keys*}' => ';semi=%3B;dot=.;comma=%2C',
- }
- end
- context "Operator ? with value modifiers" do
- it_behaves_like 'expands', {
- '{?var:3}' => '?var=val',
- '{?list}' => '?list=red,green,blue',
- '{?list*}' => '?list=red&list=green&list=blue',
- '{?keys}' => '?keys=semi,%3B,dot,.,comma,%2C',
- '{?keys*}' => '?semi=%3B&dot=.&comma=%2C',
- }
- end
- context "Operator & with value modifiers" do
- it_behaves_like 'expands', {
- '{&var:3}' => '&var=val',
- '{&list}' => '&list=red,green,blue',
- '{&list*}' => '&list=red&list=green&list=blue',
- '{&keys}' => '&keys=semi,%3B,dot,.,comma,%2C',
- '{&keys*}' => '&semi=%3B&dot=.&comma=%2C',
- }
- end
-end
-describe "Modifiers" do
- subject {
- {
- :var => "value",
- :semi => ";",
- :year => [1965, 2000, 2012],
- :dom => %w(example com)
- }
- }
- context "length" do
- it_behaves_like 'expands', {
- '{var:3}' => 'val',
- '{var:30}' => 'value',
- '{var}' => 'value',
- '{semi}' => '%3B',
- '{semi:2}' => '%3B'
- }
- end
- context "explode" do
- it_behaves_like 'expands', {
- 'find{?year*}' => 'find?year=1965&year=2000&year=2012',
- 'www{.dom*}' => 'www.example.com',
- }
- end
-end
-describe "Expansion" do
- subject {
- {
- :count => ["one", "two", "three"],
- :dom => ["example", "com"],
- :dub => "me/too",
- :hello => "Hello World!",
- :half => "50%",
- :var => "value",
- :who => "fred",
- :base => "http://example.com/home/",
- :path => "/foo/bar",
- :list => ["red", "green", "blue"],
- :keys => {"semi" => ";","dot" => ".",:comma => ","},
- :v => "6",
- :x => "1024",
- :y => "768",
- :empty => "",
- :empty_keys => {},
- :undef => nil
- }
- }
- context "concatenation" do
- it_behaves_like 'expands', {
- '{count}' => 'one,two,three',
- '{count*}' => 'one,two,three',
- '{/count}' => '/one,two,three',
- '{/count*}' => '/one/two/three',
- '{;count}' => ';count=one,two,three',
- '{;count*}' => ';count=one;count=two;count=three',
- '{?count}' => '?count=one,two,three',
- '{?count*}' => '?count=one&count=two&count=three',
- '{&count*}' => '&count=one&count=two&count=three'
- }
- end
- context "simple expansion" do
- it_behaves_like 'expands', {
- '{var}' => 'value',
- '{hello}' => 'Hello%20World%21',
- '{half}' => '50%25',
- 'O{empty}X' => 'OX',
- 'O{undef}X' => 'OX',
- '{x,y}' => '1024,768',
- '{x,hello,y}' => '1024,Hello%20World%21,768',
- '?{x,empty}' => '?1024,',
- '?{x,undef}' => '?1024',
- '?{undef,y}' => '?768',
- '{var:3}' => 'val',
- '{var:30}' => 'value',
- '{list}' => 'red,green,blue',
- '{list*}' => 'red,green,blue',
- '{keys}' => 'semi,%3B,dot,.,comma,%2C',
- '{keys*}' => 'semi=%3B,dot=.,comma=%2C',
- }
- end
- context "reserved expansion (+)" do
- it_behaves_like 'expands', {
- '{+var}' => 'value',
- '{+hello}' => 'Hello%20World!',
- '{+half}' => '50%25',
- '{base}index' => 'http%3A%2F%2Fexample.com%2Fhome%2Findex',
- '{+base}index' => 'http://example.com/home/index',
- 'O{+empty}X' => 'OX',
- 'O{+undef}X' => 'OX',
- '{+path}/here' => '/foo/bar/here',
- 'here?ref={+path}' => 'here?ref=/foo/bar',
- 'up{+path}{var}/here' => 'up/foo/barvalue/here',
- '{+x,hello,y}' => '1024,Hello%20World!,768',
- '{+path,x}/here' => '/foo/bar,1024/here',
- '{+path:6}/here' => '/foo/b/here',
- '{+list}' => 'red,green,blue',
- '{+list*}' => 'red,green,blue',
- '{+keys}' => 'semi,;,dot,.,comma,,',
- '{+keys*}' => 'semi=;,dot=.,comma=,',
- }
- end
- context "fragment expansion (#)" do
- it_behaves_like 'expands', {
- '{#var}' => '#value',
- '{#hello}' => '#Hello%20World!',
- '{#half}' => '#50%25',
- 'foo{#empty}' => 'foo#',
- 'foo{#undef}' => 'foo',
- '{#x,hello,y}' => '#1024,Hello%20World!,768',
- '{#path,x}/here' => '#/foo/bar,1024/here',
- '{#path:6}/here' => '#/foo/b/here',
- '{#list}' => '#red,green,blue',
- '{#list*}' => '#red,green,blue',
- '{#keys}' => '#semi,;,dot,.,comma,,',
- '{#keys*}' => '#semi=;,dot=.,comma=,',
- }
- end
- context "label expansion (.)" do
- it_behaves_like 'expands', {
- '{.who}' => '.fred',
- '{.who,who}' => '.fred.fred',
- '{.half,who}' => '.50%25.fred',
- 'www{.dom*}' => 'www.example.com',
- 'X{.var}' => 'X.value',
- 'X{.empty}' => 'X.',
- 'X{.undef}' => 'X',
- 'X{.var:3}' => 'X.val',
- 'X{.list}' => 'X.red,green,blue',
- 'X{.list*}' => 'X.red.green.blue',
- 'X{.keys}' => 'X.semi,%3B,dot,.,comma,%2C',
- 'X{.keys*}' => 'X.semi=%3B.dot=..comma=%2C',
- 'X{.empty_keys}' => 'X',
- 'X{.empty_keys*}' => 'X'
- }
- end
- context "path expansion (/)" do
- it_behaves_like 'expands', {
- '{/who}' => '/fred',
- '{/who,who}' => '/fred/fred',
- '{/half,who}' => '/50%25/fred',
- '{/who,dub}' => '/fred/me%2Ftoo',
- '{/var}' => '/value',
- '{/var,empty}' => '/value/',
- '{/var,undef}' => '/value',
- '{/var,x}/here' => '/value/1024/here',
- '{/var:1,var}' => '/v/value',
- '{/list}' => '/red,green,blue',
- '{/list*}' => '/red/green/blue',
- '{/list*,path:4}' => '/red/green/blue/%2Ffoo',
- '{/keys}' => '/semi,%3B,dot,.,comma,%2C',
- '{/keys*}' => '/semi=%3B/dot=./comma=%2C',
- }
- end
- context "path-style expansion (;)" do
- it_behaves_like 'expands', {
- '{;who}' => ';who=fred',
- '{;half}' => ';half=50%25',
- '{;empty}' => ';empty',
- '{;v,empty,who}' => ';v=6;empty;who=fred',
- '{;v,bar,who}' => ';v=6;who=fred',
- '{;x,y}' => ';x=1024;y=768',
- '{;x,y,empty}' => ';x=1024;y=768;empty',
- '{;x,y,undef}' => ';x=1024;y=768',
- '{;hello:5}' => ';hello=Hello',
- '{;list}' => ';list=red,green,blue',
- '{;list*}' => ';list=red;list=green;list=blue',
- '{;keys}' => ';keys=semi,%3B,dot,.,comma,%2C',
- '{;keys*}' => ';semi=%3B;dot=.;comma=%2C',
- }
- end
- context "form query expansion (?)" do
- it_behaves_like 'expands', {
- '{?who}' => '?who=fred',
- '{?half}' => '?half=50%25',
- '{?x,y}' => '?x=1024&y=768',
- '{?x,y,empty}' => '?x=1024&y=768&empty=',
- '{?x,y,undef}' => '?x=1024&y=768',
- '{?var:3}' => '?var=val',
- '{?list}' => '?list=red,green,blue',
- '{?list*}' => '?list=red&list=green&list=blue',
- '{?keys}' => '?keys=semi,%3B,dot,.,comma,%2C',
- '{?keys*}' => '?semi=%3B&dot=.&comma=%2C',
- }
- end
- context "form query expansion (&)" do
- it_behaves_like 'expands', {
- '{&who}' => '&who=fred',
- '{&half}' => '&half=50%25',
- '?fixed=yes{&x}' => '?fixed=yes&x=1024',
- '{&x,y,empty}' => '&x=1024&y=768&empty=',
- '{&x,y,undef}' => '&x=1024&y=768',
- '{&var:3}' => '&var=val',
- '{&list}' => '&list=red,green,blue',
- '{&list*}' => '&list=red&list=green&list=blue',
- '{&keys}' => '&keys=semi,%3B,dot,.,comma,%2C',
- '{&keys*}' => '&semi=%3B&dot=.&comma=%2C',
- }
- end
- context "non-string key in match data" do
- subject {Addressable::Template.new("http://example.com/{one}")}
-
- it "raises TypeError" do
- expect { subject.expand(Object.new => "1") }.to raise_error TypeError
- end
- end
-end
-
-class ExampleTwoProcessor
- def self.restore(name, value)
- return value.gsub(/-/, " ") if name == "query"
- return value
- end
-
- def self.match(name)
- return ".*?" if name == "first"
- return ".*"
- end
- def self.validate(name, value)
- return !!(value =~ /^[\w ]+$/) if name == "query"
- return true
- end
-
- def self.transform(name, value)
- return value.gsub(/ /, "+") if name == "query"
- return value
- end
-end
-
-class DumbProcessor
- def self.match(name)
- return ".*?" if name == "first"
- end
-end
-
-describe Addressable::Template do
- describe 'initialize' do
- context 'with a non-string' do
- it 'raises a TypeError' do
- expect { Addressable::Template.new(nil) }.to raise_error(TypeError)
- end
- end
- end
-
- describe 'freeze' do
- subject { Addressable::Template.new("http://example.com/{first}/{+second}/") }
- it 'freezes the template' do
- expect(subject.freeze).to be_frozen
- end
- end
-
- describe "Matching" do
- let(:uri){
- Addressable::URI.parse(
- "http://example.com/search/an-example-search-query/"
- )
- }
- let(:uri2){
- Addressable::URI.parse("http://example.com/a/b/c/")
- }
- let(:uri3){
- Addressable::URI.parse("http://example.com/;a=1;b=2;c=3;first=foo")
- }
- let(:uri4){
- Addressable::URI.parse("http://example.com/?a=1&b=2&c=3&first=foo")
- }
- let(:uri5){
- "http://example.com/foo"
- }
- context "first uri with ExampleTwoProcessor" do
- subject {
- Addressable::Template.new(
- "http://example.com/search/{query}/"
- ).match(uri, ExampleTwoProcessor)
- }
- its(:variables){ should == ["query"] }
- its(:captures){ should == ["an example search query"] }
- end
-
- context "second uri with ExampleTwoProcessor" do
- subject {
- Addressable::Template.new(
- "http://example.com/{first}/{+second}/"
- ).match(uri2, ExampleTwoProcessor)
- }
- its(:variables){ should == ["first", "second"] }
- its(:captures){ should == ["a", "b/c"] }
- end
-
- context "second uri with DumbProcessor" do
- subject {
- Addressable::Template.new(
- "http://example.com/{first}/{+second}/"
- ).match(uri2, DumbProcessor)
- }
- its(:variables){ should == ["first", "second"] }
- its(:captures){ should == ["a", "b/c"] }
- end
-
- context "second uri" do
- subject {
- Addressable::Template.new(
- "http://example.com/{first}{/second*}/"
- ).match(uri2)
- }
- its(:variables){ should == ["first", "second"] }
- its(:captures){ should == ["a", ["b","c"]] }
- end
- context "third uri" do
- subject {
- Addressable::Template.new(
- "http://example.com/{;hash*,first}"
- ).match(uri3)
- }
- its(:variables){ should == ["hash", "first"] }
- its(:captures){ should == [
- {"a" => "1", "b" => "2", "c" => "3", "first" => "foo"}, nil] }
- end
- # Note that this expansion is impossible to revert deterministically - the
- # * operator means first could have been a key of hash or a separate key.
- # Semantically, a separate key is more likely, but both are possible.
- context "fourth uri" do
- subject {
- Addressable::Template.new(
- "http://example.com/{?hash*,first}"
- ).match(uri4)
- }
- its(:variables){ should == ["hash", "first"] }
- its(:captures){ should == [
- {"a" => "1", "b" => "2", "c" => "3", "first"=> "foo"}, nil] }
- end
- context "fifth uri" do
- subject {
- Addressable::Template.new(
- "http://example.com/{path}{?hash*,first}"
- ).match(uri5)
- }
- its(:variables){ should == ["path", "hash", "first"] }
- its(:captures){ should == ["foo", nil, nil] }
- end
- end
-
- describe 'match' do
- subject { Addressable::Template.new('http://example.com/first/second/') }
- context 'when the URI is the same as the template' do
- it 'returns the match data itself with an empty mapping' do
- uri = Addressable::URI.parse('http://example.com/first/second/')
- match_data = subject.match(uri)
- expect(match_data).to be_an Addressable::Template::MatchData
- expect(match_data.uri).to eq(uri)
- expect(match_data.template).to eq(subject)
- expect(match_data.mapping).to be_empty
- expect(match_data.inspect).to be_an String
- end
- end
- end
-
- describe "extract" do
- let(:template) {
- Addressable::Template.new(
- "http://{host}{/segments*}/{?one,two,bogus}{#fragment}"
- )
- }
- let(:uri){ "http://example.com/a/b/c/?one=1&two=2#foo" }
- let(:uri2){ "http://example.com/a/b/c/#foo" }
- it "should be able to extract with queries" do
- expect(template.extract(uri)).to eq({
- "host" => "example.com",
- "segments" => %w(a b c),
- "one" => "1",
- "bogus" => nil,
- "two" => "2",
- "fragment" => "foo"
- })
- end
- it "should be able to extract without queries" do
- expect(template.extract(uri2)).to eq({
- "host" => "example.com",
- "segments" => %w(a b c),
- "one" => nil,
- "bogus" => nil,
- "two" => nil,
- "fragment" => "foo"
- })
- end
-
- context "issue #137" do
- subject { Addressable::Template.new('/path{?page,per_page}') }
-
- it "can match empty" do
- data = subject.extract("/path")
- expect(data["page"]).to eq(nil)
- expect(data["per_page"]).to eq(nil)
- expect(data.keys.sort).to eq(['page', 'per_page'])
- end
-
- it "can match first var" do
- data = subject.extract("/path?page=1")
- expect(data["page"]).to eq("1")
- expect(data["per_page"]).to eq(nil)
- expect(data.keys.sort).to eq(['page', 'per_page'])
- end
-
- it "can match second var" do
- data = subject.extract("/path?per_page=1")
- expect(data["page"]).to eq(nil)
- expect(data["per_page"]).to eq("1")
- expect(data.keys.sort).to eq(['page', 'per_page'])
- end
-
- it "can match both vars" do
- data = subject.extract("/path?page=2&per_page=1")
- expect(data["page"]).to eq("2")
- expect(data["per_page"]).to eq("1")
- expect(data.keys.sort).to eq(['page', 'per_page'])
- end
- end
- end
-
- describe "Partial expand with symbols" do
- context "partial_expand with two simple values" do
- subject {
- Addressable::Template.new("http://example.com/{one}/{two}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand(:one => "1").pattern).to eq(
- "http://example.com/1/{two}/"
- )
- end
- end
- context "partial_expand query with missing param in middle" do
- subject {
- Addressable::Template.new("http://example.com/{?one,two,three}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand(:one => "1", :three => "3").pattern).to eq(
- "http://example.com/?one=1{&two}&three=3/"
- )
- end
- end
- context "partial_expand form style query with missing param at beginning" do
- subject {
- Addressable::Template.new("http://example.com/{?one,two}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand(:two => "2").pattern).to eq(
- "http://example.com/?two=2{&one}/"
- )
- end
- end
- context "issue #307 - partial_expand form query with nil params" do
- subject do
- Addressable::Template.new("http://example.com/{?one,two,three}/")
- end
- it "builds a new pattern with two=nil" do
- expect(subject.partial_expand(two: nil).pattern).to eq(
- "http://example.com/{?one}{&three}/"
- )
- end
- it "builds a new pattern with one=nil and two=nil" do
- expect(subject.partial_expand(one: nil, two: nil).pattern).to eq(
- "http://example.com/{?three}/"
- )
- end
- it "builds a new pattern with one=1 and two=nil" do
- expect(subject.partial_expand(one: 1, two: nil).pattern).to eq(
- "http://example.com/?one=1{&three}/"
- )
- end
- it "builds a new pattern with one=nil and two=2" do
- expect(subject.partial_expand(one: nil, two: 2).pattern).to eq(
- "http://example.com/?two=2{&three}/"
- )
- end
- it "builds a new pattern with one=nil" do
- expect(subject.partial_expand(one: nil).pattern).to eq(
- "http://example.com/{?two}{&three}/"
- )
- end
- end
- context "partial_expand with query string" do
- subject {
- Addressable::Template.new("http://example.com/{?two,one}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand(:one => "1").pattern).to eq(
- "http://example.com/?one=1{&two}/"
- )
- end
- end
- context "partial_expand with path operator" do
- subject {
- Addressable::Template.new("http://example.com{/one,two}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand(:one => "1").pattern).to eq(
- "http://example.com/1{/two}/"
- )
- end
- end
- context "partial expand with unicode values" do
- subject do
- Addressable::Template.new("http://example.com/{resource}/{query}/")
- end
- it "normalizes unicode by default" do
- template = subject.partial_expand("query" => "Cafe\u0301")
- expect(template.pattern).to eq(
- "http://example.com/{resource}/Caf%C3%A9/"
- )
- end
-
- it "normalizes as unicode even with wrong encoding specified" do
- template = subject.partial_expand("query" => "Cafe\u0301".b)
- expect(template.pattern).to eq(
- "http://example.com/{resource}/Caf%C3%A9/"
- )
- end
-
- it "raises on invalid unicode input" do
- expect {
- subject.partial_expand("query" => "M\xE9thode".b)
- }.to raise_error(ArgumentError, "invalid byte sequence in UTF-8")
- end
-
- it "does not normalize unicode when byte semantics requested" do
- template = subject.partial_expand({"query" => "Cafe\u0301"}, nil, false)
- expect(template.pattern).to eq(
- "http://example.com/{resource}/Cafe%CC%81/"
- )
- end
- end
- end
- describe "Partial expand with strings" do
- context "partial_expand with two simple values" do
- subject {
- Addressable::Template.new("http://example.com/{one}/{two}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand("one" => "1").pattern).to eq(
- "http://example.com/1/{two}/"
- )
- end
- end
- context "partial_expand query with missing param in middle" do
- subject {
- Addressable::Template.new("http://example.com/{?one,two,three}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand("one" => "1", "three" => "3").pattern).to eq(
- "http://example.com/?one=1{&two}&three=3/"
- )
- end
- end
- context "partial_expand with query string" do
- subject {
- Addressable::Template.new("http://example.com/{?two,one}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand("one" => "1").pattern).to eq(
- "http://example.com/?one=1{&two}/"
- )
- end
- end
- context "partial_expand with path operator" do
- subject {
- Addressable::Template.new("http://example.com{/one,two}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand("one" => "1").pattern).to eq(
- "http://example.com/1{/two}/"
- )
- end
- end
- end
- describe "Expand" do
- context "expand with unicode values" do
- subject do
- Addressable::Template.new("http://example.com/search/{query}/")
- end
- it "normalizes unicode by default" do
- uri = subject.expand("query" => "Cafe\u0301").to_str
- expect(uri).to eq("http://example.com/search/Caf%C3%A9/")
- end
-
- it "normalizes as unicode even with wrong encoding specified" do
- uri = subject.expand("query" => "Cafe\u0301".b).to_str
- expect(uri).to eq("http://example.com/search/Caf%C3%A9/")
- end
-
- it "raises on invalid unicode input" do
- expect {
- subject.expand("query" => "M\xE9thode".b).to_str
- }.to raise_error(ArgumentError, "invalid byte sequence in UTF-8")
- end
-
- it "does not normalize unicode when byte semantics requested" do
- uri = subject.expand({ "query" => "Cafe\u0301" }, nil, false).to_str
- expect(uri).to eq("http://example.com/search/Cafe%CC%81/")
- end
- end
- context "expand with a processor" do
- subject {
- Addressable::Template.new("http://example.com/search/{query}/")
- }
- it "processes spaces" do
- expect(subject.expand({"query" => "an example search query"},
- ExampleTwoProcessor).to_str).to eq(
- "http://example.com/search/an+example+search+query/"
- )
- end
- it "validates" do
- expect{
- subject.expand({"query" => "Bogus!"},
- ExampleTwoProcessor).to_str
- }.to raise_error(Addressable::Template::InvalidTemplateValueError)
- end
- end
- context "partial_expand query with missing param in middle" do
- subject {
- Addressable::Template.new("http://example.com/{?one,two,three}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand("one" => "1", "three" => "3").pattern).to eq(
- "http://example.com/?one=1{&two}&three=3/"
- )
- end
- end
- context "partial_expand with query string" do
- subject {
- Addressable::Template.new("http://example.com/{?two,one}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand("one" => "1").pattern).to eq(
- "http://example.com/?one=1{&two}/"
- )
- end
- end
- context "partial_expand with path operator" do
- subject {
- Addressable::Template.new("http://example.com{/one,two}/")
- }
- it "builds a new pattern" do
- expect(subject.partial_expand("one" => "1").pattern).to eq(
- "http://example.com/1{/two}/"
- )
- end
- end
- end
- context "Matching with operators" do
- describe "Level 1:" do
- subject { Addressable::Template.new("foo{foo}/{bar}baz") }
- it "can match" do
- data = subject.match("foofoo/bananabaz")
- expect(data.mapping["foo"]).to eq("foo")
- expect(data.mapping["bar"]).to eq("banana")
- end
- it "can fail" do
- expect(subject.match("bar/foo")).to be_nil
- expect(subject.match("foobaz")).to be_nil
- end
- it "can match empty" do
- data = subject.match("foo/baz")
- expect(data.mapping["foo"]).to eq(nil)
- expect(data.mapping["bar"]).to eq(nil)
- end
- it "lists vars" do
- expect(subject.variables).to eq(["foo", "bar"])
- end
- end
-
- describe "Level 2:" do
- subject { Addressable::Template.new("foo{+foo}{#bar}baz") }
- it "can match" do
- data = subject.match("foo/test/banana#bazbaz")
- expect(data.mapping["foo"]).to eq("/test/banana")
- expect(data.mapping["bar"]).to eq("baz")
- end
- it "can match empty level 2 #" do
- data = subject.match("foo/test/bananabaz")
- expect(data.mapping["foo"]).to eq("/test/banana")
- expect(data.mapping["bar"]).to eq(nil)
- data = subject.match("foo/test/banana#baz")
- expect(data.mapping["foo"]).to eq("/test/banana")
- expect(data.mapping["bar"]).to eq("")
- end
- it "can match empty level 2 +" do
- data = subject.match("foobaz")
- expect(data.mapping["foo"]).to eq(nil)
- expect(data.mapping["bar"]).to eq(nil)
- data = subject.match("foo#barbaz")
- expect(data.mapping["foo"]).to eq(nil)
- expect(data.mapping["bar"]).to eq("bar")
- end
- it "lists vars" do
- expect(subject.variables).to eq(["foo", "bar"])
- end
- end
-
- describe "Level 3:" do
- context "no operator" do
- subject { Addressable::Template.new("foo{foo,bar}baz") }
- it "can match" do
- data = subject.match("foofoo,barbaz")
- expect(data.mapping["foo"]).to eq("foo")
- expect(data.mapping["bar"]).to eq("bar")
- end
- it "lists vars" do
- expect(subject.variables).to eq(["foo", "bar"])
- end
- end
- context "+ operator" do
- subject { Addressable::Template.new("foo{+foo,bar}baz") }
- it "can match" do
- data = subject.match("foofoo/bar,barbaz")
- expect(data.mapping["bar"]).to eq("foo/bar,bar")
- expect(data.mapping["foo"]).to eq("")
- end
- it "lists vars" do
- expect(subject.variables).to eq(["foo", "bar"])
- end
- end
- context ". operator" do
- subject { Addressable::Template.new("foo{.foo,bar}baz") }
- it "can match" do
- data = subject.match("foo.foo.barbaz")
- expect(data.mapping["foo"]).to eq("foo")
- expect(data.mapping["bar"]).to eq("bar")
- end
- it "lists vars" do
- expect(subject.variables).to eq(["foo", "bar"])
- end
- end
- context "/ operator" do
- subject { Addressable::Template.new("foo{/foo,bar}baz") }
- it "can match" do
- data = subject.match("foo/foo/barbaz")
- expect(data.mapping["foo"]).to eq("foo")
- expect(data.mapping["bar"]).to eq("bar")
- end
- it "lists vars" do
- expect(subject.variables).to eq(["foo", "bar"])
- end
- end
- context "; operator" do
- subject { Addressable::Template.new("foo{;foo,bar,baz}baz") }
- it "can match" do
- data = subject.match("foo;foo=bar%20baz;bar=foo;bazbaz")
- expect(data.mapping["foo"]).to eq("bar baz")
- expect(data.mapping["bar"]).to eq("foo")
- expect(data.mapping["baz"]).to eq("")
- end
- it "lists vars" do
- expect(subject.variables).to eq(%w(foo bar baz))
- end
- end
- context "? operator" do
- context "test" do
- subject { Addressable::Template.new("foo{?foo,bar}baz") }
- it "can match" do
- data = subject.match("foo?foo=bar%20baz&bar=foobaz")
- expect(data.mapping["foo"]).to eq("bar baz")
- expect(data.mapping["bar"]).to eq("foo")
- end
- it "lists vars" do
- expect(subject.variables).to eq(%w(foo bar))
- end
- end
-
- context "issue #137" do
- subject { Addressable::Template.new('/path{?page,per_page}') }
-
- it "can match empty" do
- data = subject.match("/path")
- expect(data.mapping["page"]).to eq(nil)
- expect(data.mapping["per_page"]).to eq(nil)
- expect(data.mapping.keys.sort).to eq(['page', 'per_page'])
- end
-
- it "can match first var" do
- data = subject.match("/path?page=1")
- expect(data.mapping["page"]).to eq("1")
- expect(data.mapping["per_page"]).to eq(nil)
- expect(data.mapping.keys.sort).to eq(['page', 'per_page'])
- end
-
- it "can match second var" do
- data = subject.match("/path?per_page=1")
- expect(data.mapping["page"]).to eq(nil)
- expect(data.mapping["per_page"]).to eq("1")
- expect(data.mapping.keys.sort).to eq(['page', 'per_page'])
- end
-
- it "can match both vars" do
- data = subject.match("/path?page=2&per_page=1")
- expect(data.mapping["page"]).to eq("2")
- expect(data.mapping["per_page"]).to eq("1")
- expect(data.mapping.keys.sort).to eq(['page', 'per_page'])
- end
- end
-
- context "issue #71" do
- subject { Addressable::Template.new("http://cyberscore.dev/api/users{?username}") }
- it "can match" do
- data = subject.match("http://cyberscore.dev/api/users?username=foobaz")
- expect(data.mapping["username"]).to eq("foobaz")
- end
- it "lists vars" do
- expect(subject.variables).to eq(%w(username))
- expect(subject.keys).to eq(%w(username))
- end
- end
- end
- context "& operator" do
- subject { Addressable::Template.new("foo{&foo,bar}baz") }
- it "can match" do
- data = subject.match("foo&foo=bar%20baz&bar=foobaz")
- expect(data.mapping["foo"]).to eq("bar baz")
- expect(data.mapping["bar"]).to eq("foo")
- end
- it "lists vars" do
- expect(subject.variables).to eq(%w(foo bar))
- end
- end
- end
- end
-
- context "support regexes:" do
- context "EXPRESSION" do
- subject { Addressable::Template::EXPRESSION }
- it "should be able to match an expression" do
- expect(subject).to match("{foo}")
- expect(subject).to match("{foo,9}")
- expect(subject).to match("{foo.bar,baz}")
- expect(subject).to match("{+foo.bar,baz}")
- expect(subject).to match("{foo,foo%20bar}")
- expect(subject).to match("{#foo:20,baz*}")
- expect(subject).to match("stuff{#foo:20,baz*}things")
- end
- it "should fail on non vars" do
- expect(subject).not_to match("!{foo")
- expect(subject).not_to match("{foo.bar.}")
- expect(subject).not_to match("!{}")
- end
- end
- context "VARNAME" do
- subject { Addressable::Template::VARNAME }
- it "should be able to match a variable" do
- expect(subject).to match("foo")
- expect(subject).to match("9")
- expect(subject).to match("foo.bar")
- expect(subject).to match("foo_bar")
- expect(subject).to match("foo_bar.baz")
- expect(subject).to match("foo%20bar")
- expect(subject).to match("foo%20bar.baz")
- end
- it "should fail on non vars" do
- expect(subject).not_to match("!foo")
- expect(subject).not_to match("foo.bar.")
- expect(subject).not_to match("foo%2%00bar")
- expect(subject).not_to match("foo_ba%r")
- expect(subject).not_to match("foo_bar*")
- expect(subject).not_to match("foo_bar:20")
- end
-
- it 'should parse in a reasonable time' do
- expect do
- Timeout.timeout(0.1) do
- expect(subject).not_to match("0"*25 + "!")
- end
- end.not_to raise_error
- end
- end
- context "VARIABLE_LIST" do
- subject { Addressable::Template::VARIABLE_LIST }
- it "should be able to match a variable list" do
- expect(subject).to match("foo,bar")
- expect(subject).to match("foo")
- expect(subject).to match("foo,bar*,baz")
- expect(subject).to match("foo.bar,bar_baz*,baz:12")
- end
- it "should fail on non vars" do
- expect(subject).not_to match(",foo,bar*,baz")
- expect(subject).not_to match("foo,*bar,baz")
- expect(subject).not_to match("foo,,bar*,baz")
- end
- end
- context "VARSPEC" do
- subject { Addressable::Template::VARSPEC }
- it "should be able to match a variable with modifier" do
- expect(subject).to match("9:8")
- expect(subject).to match("foo.bar*")
- expect(subject).to match("foo_bar:12")
- expect(subject).to match("foo_bar.baz*")
- expect(subject).to match("foo%20bar:12")
- expect(subject).to match("foo%20bar.baz*")
- end
- it "should fail on non vars" do
- expect(subject).not_to match("!foo")
- expect(subject).not_to match("*foo")
- expect(subject).not_to match("fo*o")
- expect(subject).not_to match("fo:o")
- expect(subject).not_to match("foo:")
- end
- end
- end
-end
-
-describe Addressable::Template::MatchData do
- let(:template) { Addressable::Template.new('{foo}/{bar}') }
- subject(:its) { template.match('ab/cd') }
- its(:uri) { should == Addressable::URI.parse('ab/cd') }
- its(:template) { should == template }
- its(:mapping) { should == { 'foo' => 'ab', 'bar' => 'cd' } }
- its(:variables) { should == ['foo', 'bar'] }
- its(:keys) { should == ['foo', 'bar'] }
- its(:names) { should == ['foo', 'bar'] }
- its(:values) { should == ['ab', 'cd'] }
- its(:captures) { should == ['ab', 'cd'] }
- its(:to_a) { should == ['ab/cd', 'ab', 'cd'] }
- its(:to_s) { should == 'ab/cd' }
- its(:string) { should == its.to_s }
- its(:pre_match) { should == "" }
- its(:post_match) { should == "" }
-
- describe 'values_at' do
- it 'returns an array with the values' do
- expect(its.values_at(0, 2)).to eq(['ab/cd', 'cd'])
- end
- it 'allows mixing integer an string keys' do
- expect(its.values_at('foo', 1)).to eq(['ab', 'ab'])
- end
- it 'accepts unknown keys' do
- expect(its.values_at('baz', 'foo')).to eq([nil, 'ab'])
- end
- end
-
- describe '[]' do
- context 'string key' do
- it 'returns the corresponding capture' do
- expect(its['foo']).to eq('ab')
- expect(its['bar']).to eq('cd')
- end
- it 'returns nil for unknown keys' do
- expect(its['baz']).to be_nil
- end
- end
- context 'symbol key' do
- it 'returns the corresponding capture' do
- expect(its[:foo]).to eq('ab')
- expect(its[:bar]).to eq('cd')
- end
- it 'returns nil for unknown keys' do
- expect(its[:baz]).to be_nil
- end
- end
- context 'integer key' do
- it 'returns the full URI for index 0' do
- expect(its[0]).to eq('ab/cd')
- end
- it 'returns the corresponding capture' do
- expect(its[1]).to eq('ab')
- expect(its[2]).to eq('cd')
- end
- it 'returns nil for unknown keys' do
- expect(its[3]).to be_nil
- end
- end
- context 'other key' do
- it 'raises an exception' do
- expect { its[Object.new] }.to raise_error(TypeError)
- end
- end
- context 'with length' do
- it 'returns an array starting at index with given length' do
- expect(its[0, 2]).to eq(['ab/cd', 'ab'])
- expect(its[2, 1]).to eq(['cd'])
- end
- end
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/uri_spec.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/uri_spec.rb
deleted file mode 100644
index 26ee923..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/addressable/uri_spec.rb
+++ /dev/null
@@ -1,6840 +0,0 @@
-# frozen_string_literal: true
-
-# Copyright (C) Bob Aman
-#
-# 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.
-
-
-require "spec_helper"
-
-require "addressable/uri"
-require "uri"
-require "ipaddr"
-require "yaml"
-
-if !"".respond_to?("force_encoding")
- class String
- def force_encoding(encoding)
- @encoding = encoding
- end
-
- def encoding
- @encoding ||= Encoding::ASCII_8BIT
- end
- end
-
- class Encoding
- def initialize(name)
- @name = name
- end
-
- def to_s
- return @name
- end
-
- UTF_8 = Encoding.new("UTF-8")
- ASCII_8BIT = Encoding.new("US-ASCII")
- end
-end
-
-module Fake
- module URI
- class HTTP
- def initialize(uri)
- @uri = uri
- end
-
- def to_s
- return @uri.to_s
- end
-
- alias :to_str :to_s
- end
- end
-end
-
-describe Addressable::URI, "when created with a non-numeric port number" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:port => "bogus")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with a invalid encoded port number" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:port => "%eb")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string scheme" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:scheme => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string user" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:user => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string password" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:password => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string userinfo" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:userinfo => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string host" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:host => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string authority" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:authority => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string path" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:path => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string query" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:query => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a non-string fragment" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:fragment => :bogus)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when created with a scheme but no hierarchical " +
- "segment" do
- it "should raise an error" do
- expect do
- Addressable::URI.parse("http:")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "quote handling" do
- describe 'in host name' do
- it "should raise an error for single quote" do
- expect do
- Addressable::URI.parse("http://local\"host/")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
- end
-end
-
-describe Addressable::URI, "newline normalization" do
- it "should not accept newlines in scheme" do
- expect do
- Addressable::URI.parse("ht%0atp://localhost/")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should not unescape newline in path" do
- uri = Addressable::URI.parse("http://localhost/%0a").normalize
- expect(uri.to_s).to eq("http://localhost/%0A")
- end
-
- it "should not unescape newline in hostname" do
- uri = Addressable::URI.parse("http://local%0ahost/").normalize
- expect(uri.to_s).to eq("http://local%0Ahost/")
- end
-
- it "should not unescape newline in username" do
- uri = Addressable::URI.parse("http://foo%0abar@localhost/").normalize
- expect(uri.to_s).to eq("http://foo%0Abar@localhost/")
- end
-
- it "should not unescape newline in username" do
- uri = Addressable::URI.parse("http://example:foo%0abar@example/").normalize
- expect(uri.to_s).to eq("http://example:foo%0Abar@example/")
- end
-
- it "should not accept newline in hostname" do
- uri = Addressable::URI.parse("http://localhost/")
- expect do
- uri.host = "local\nhost"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with ambiguous path" do
- it "should raise an error" do
- expect do
- Addressable::URI.parse("::http")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with an invalid host" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:host => "")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with a host consisting of " +
- "sub-delims characters" do
- it "should not raise an error" do
- expect do
- Addressable::URI.new(
- :host => Addressable::URI::CharacterClasses::SUB_DELIMS.gsub(/\\/, '')
- )
- end.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when created with a host consisting of " +
- "unreserved characters" do
- it "should not raise an error" do
- expect do
- Addressable::URI.new(
- :host => Addressable::URI::CharacterClasses::UNRESERVED.gsub(/\\/, '')
- )
- end.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when created from nil components" do
- before do
- @uri = Addressable::URI.new
- end
-
- it "should have a nil site value" do
- expect(@uri.site).to eq(nil)
- end
-
- it "should have an empty path" do
- expect(@uri.path).to eq("")
- end
-
- it "should be an empty uri" do
- expect(@uri.to_s).to eq("")
- end
-
- it "should have a nil default port" do
- expect(@uri.default_port).to eq(nil)
- end
-
- it "should be empty" do
- expect(@uri).to be_empty
- end
-
- it "should raise an error if the scheme is set to whitespace" do
- expect do
- @uri.scheme = "\t \n"
- end.to raise_error(Addressable::URI::InvalidURIError, /'\t \n'/)
- end
-
- it "should raise an error if the scheme is set to all digits" do
- expect do
- @uri.scheme = "123"
- end.to raise_error(Addressable::URI::InvalidURIError, /'123'/)
- end
-
- it "should raise an error if the scheme begins with a digit" do
- expect do
- @uri.scheme = "1scheme"
- end.to raise_error(Addressable::URI::InvalidURIError, /'1scheme'/)
- end
-
- it "should raise an error if the scheme begins with a plus" do
- expect do
- @uri.scheme = "+scheme"
- end.to raise_error(Addressable::URI::InvalidURIError, /'\+scheme'/)
- end
-
- it "should raise an error if the scheme begins with a dot" do
- expect do
- @uri.scheme = ".scheme"
- end.to raise_error(Addressable::URI::InvalidURIError, /'\.scheme'/)
- end
-
- it "should raise an error if the scheme begins with a dash" do
- expect do
- @uri.scheme = "-scheme"
- end.to raise_error(Addressable::URI::InvalidURIError, /'-scheme'/)
- end
-
- it "should raise an error if the scheme contains an illegal character" do
- expect do
- @uri.scheme = "scheme!"
- end.to raise_error(Addressable::URI::InvalidURIError, /'scheme!'/)
- end
-
- it "should raise an error if the scheme contains whitespace" do
- expect do
- @uri.scheme = "sch eme"
- end.to raise_error(Addressable::URI::InvalidURIError, /'sch eme'/)
- end
-
- it "should raise an error if the scheme contains a newline" do
- expect do
- @uri.scheme = "sch\neme"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should raise an error if set into an invalid state" do
- expect do
- @uri.user = "user"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should raise an error if set into an invalid state" do
- expect do
- @uri.password = "pass"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should raise an error if set into an invalid state" do
- expect do
- @uri.scheme = "http"
- @uri.fragment = "fragment"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should raise an error if set into an invalid state" do
- expect do
- @uri.fragment = "fragment"
- @uri.scheme = "http"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when initialized from individual components" do
- before do
- @uri = Addressable::URI.new(
- :scheme => "http",
- :user => "user",
- :password => "password",
- :host => "example.com",
- :port => 8080,
- :path => "/path",
- :query => "query=value",
- :fragment => "fragment"
- )
- end
-
- it "returns 'http' for #scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "returns 'http' for #normalized_scheme" do
- expect(@uri.normalized_scheme).to eq("http")
- end
-
- it "returns 'user' for #user" do
- expect(@uri.user).to eq("user")
- end
-
- it "returns 'user' for #normalized_user" do
- expect(@uri.normalized_user).to eq("user")
- end
-
- it "returns 'password' for #password" do
- expect(@uri.password).to eq("password")
- end
-
- it "returns 'password' for #normalized_password" do
- expect(@uri.normalized_password).to eq("password")
- end
-
- it "returns 'user:password' for #userinfo" do
- expect(@uri.userinfo).to eq("user:password")
- end
-
- it "returns 'user:password' for #normalized_userinfo" do
- expect(@uri.normalized_userinfo).to eq("user:password")
- end
-
- it "returns 'example.com' for #host" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "returns 'example.com' for #normalized_host" do
- expect(@uri.normalized_host).to eq("example.com")
- end
-
- it "returns 'com' for #tld" do
- expect(@uri.tld).to eq("com")
- end
-
- it "returns 'user:password@example.com:8080' for #authority" do
- expect(@uri.authority).to eq("user:password@example.com:8080")
- end
-
- it "returns 'user:password@example.com:8080' for #normalized_authority" do
- expect(@uri.normalized_authority).to eq("user:password@example.com:8080")
- end
-
- it "returns 8080 for #port" do
- expect(@uri.port).to eq(8080)
- end
-
- it "returns 8080 for #normalized_port" do
- expect(@uri.normalized_port).to eq(8080)
- end
-
- it "returns 80 for #default_port" do
- expect(@uri.default_port).to eq(80)
- end
-
- it "returns 'http://user:password@example.com:8080' for #site" do
- expect(@uri.site).to eq("http://user:password@example.com:8080")
- end
-
- it "returns 'http://user:password@example.com:8080' for #normalized_site" do
- expect(@uri.normalized_site).to eq("http://user:password@example.com:8080")
- end
-
- it "returns '/path' for #path" do
- expect(@uri.path).to eq("/path")
- end
-
- it "returns '/path' for #normalized_path" do
- expect(@uri.normalized_path).to eq("/path")
- end
-
- it "returns 'query=value' for #query" do
- expect(@uri.query).to eq("query=value")
- end
-
- it "returns 'query=value' for #normalized_query" do
- expect(@uri.normalized_query).to eq("query=value")
- end
-
- it "returns 'fragment' for #fragment" do
- expect(@uri.fragment).to eq("fragment")
- end
-
- it "returns 'fragment' for #normalized_fragment" do
- expect(@uri.normalized_fragment).to eq("fragment")
- end
-
- it "returns #hash" do
- expect(@uri.hash).not_to be nil
- end
-
- it "returns #to_s" do
- expect(@uri.to_s).to eq(
- "http://user:password@example.com:8080/path?query=value#fragment"
- )
- end
-
- it "should not be empty" do
- expect(@uri).not_to be_empty
- end
-
- it "should not be frozen" do
- expect(@uri).not_to be_frozen
- end
-
- it "should allow destructive operations" do
- expect { @uri.normalize! }.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when initialized from " +
- "frozen individual components" do
- before do
- @uri = Addressable::URI.new(
- :scheme => "http".freeze,
- :user => "user".freeze,
- :password => "password".freeze,
- :host => "example.com".freeze,
- :port => "8080".freeze,
- :path => "/path".freeze,
- :query => "query=value".freeze,
- :fragment => "fragment".freeze
- )
- end
-
- it "returns 'http' for #scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "returns 'http' for #normalized_scheme" do
- expect(@uri.normalized_scheme).to eq("http")
- end
-
- it "returns 'user' for #user" do
- expect(@uri.user).to eq("user")
- end
-
- it "returns 'user' for #normalized_user" do
- expect(@uri.normalized_user).to eq("user")
- end
-
- it "returns 'password' for #password" do
- expect(@uri.password).to eq("password")
- end
-
- it "returns 'password' for #normalized_password" do
- expect(@uri.normalized_password).to eq("password")
- end
-
- it "returns 'user:password' for #userinfo" do
- expect(@uri.userinfo).to eq("user:password")
- end
-
- it "returns 'user:password' for #normalized_userinfo" do
- expect(@uri.normalized_userinfo).to eq("user:password")
- end
-
- it "returns 'example.com' for #host" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "returns 'example.com' for #normalized_host" do
- expect(@uri.normalized_host).to eq("example.com")
- end
-
- it "returns 'user:password@example.com:8080' for #authority" do
- expect(@uri.authority).to eq("user:password@example.com:8080")
- end
-
- it "returns 'user:password@example.com:8080' for #normalized_authority" do
- expect(@uri.normalized_authority).to eq("user:password@example.com:8080")
- end
-
- it "returns 8080 for #port" do
- expect(@uri.port).to eq(8080)
- end
-
- it "returns 8080 for #normalized_port" do
- expect(@uri.normalized_port).to eq(8080)
- end
-
- it "returns 80 for #default_port" do
- expect(@uri.default_port).to eq(80)
- end
-
- it "returns 'http://user:password@example.com:8080' for #site" do
- expect(@uri.site).to eq("http://user:password@example.com:8080")
- end
-
- it "returns 'http://user:password@example.com:8080' for #normalized_site" do
- expect(@uri.normalized_site).to eq("http://user:password@example.com:8080")
- end
-
- it "returns '/path' for #path" do
- expect(@uri.path).to eq("/path")
- end
-
- it "returns '/path' for #normalized_path" do
- expect(@uri.normalized_path).to eq("/path")
- end
-
- it "returns 'query=value' for #query" do
- expect(@uri.query).to eq("query=value")
- end
-
- it "returns 'query=value' for #normalized_query" do
- expect(@uri.normalized_query).to eq("query=value")
- end
-
- it "returns 'fragment' for #fragment" do
- expect(@uri.fragment).to eq("fragment")
- end
-
- it "returns 'fragment' for #normalized_fragment" do
- expect(@uri.normalized_fragment).to eq("fragment")
- end
-
- it "returns #hash" do
- expect(@uri.hash).not_to be nil
- end
-
- it "returns #to_s" do
- expect(@uri.to_s).to eq(
- "http://user:password@example.com:8080/path?query=value#fragment"
- )
- end
-
- it "should not be empty" do
- expect(@uri).not_to be_empty
- end
-
- it "should not be frozen" do
- expect(@uri).not_to be_frozen
- end
-
- it "should allow destructive operations" do
- expect { @uri.normalize! }.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when parsed from a frozen string" do
- before do
- @uri = Addressable::URI.parse(
- "http://user:password@example.com:8080/path?query=value#fragment".freeze
- )
- end
-
- it "returns 'http' for #scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "returns 'http' for #normalized_scheme" do
- expect(@uri.normalized_scheme).to eq("http")
- end
-
- it "returns 'user' for #user" do
- expect(@uri.user).to eq("user")
- end
-
- it "returns 'user' for #normalized_user" do
- expect(@uri.normalized_user).to eq("user")
- end
-
- it "returns 'password' for #password" do
- expect(@uri.password).to eq("password")
- end
-
- it "returns 'password' for #normalized_password" do
- expect(@uri.normalized_password).to eq("password")
- end
-
- it "returns 'user:password' for #userinfo" do
- expect(@uri.userinfo).to eq("user:password")
- end
-
- it "returns 'user:password' for #normalized_userinfo" do
- expect(@uri.normalized_userinfo).to eq("user:password")
- end
-
- it "returns 'example.com' for #host" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "returns 'example.com' for #normalized_host" do
- expect(@uri.normalized_host).to eq("example.com")
- end
-
- it "returns 'user:password@example.com:8080' for #authority" do
- expect(@uri.authority).to eq("user:password@example.com:8080")
- end
-
- it "returns 'user:password@example.com:8080' for #normalized_authority" do
- expect(@uri.normalized_authority).to eq("user:password@example.com:8080")
- end
-
- it "returns 8080 for #port" do
- expect(@uri.port).to eq(8080)
- end
-
- it "returns 8080 for #normalized_port" do
- expect(@uri.normalized_port).to eq(8080)
- end
-
- it "returns 80 for #default_port" do
- expect(@uri.default_port).to eq(80)
- end
-
- it "returns 'http://user:password@example.com:8080' for #site" do
- expect(@uri.site).to eq("http://user:password@example.com:8080")
- end
-
- it "returns 'http://user:password@example.com:8080' for #normalized_site" do
- expect(@uri.normalized_site).to eq("http://user:password@example.com:8080")
- end
-
- it "returns '/path' for #path" do
- expect(@uri.path).to eq("/path")
- end
-
- it "returns '/path' for #normalized_path" do
- expect(@uri.normalized_path).to eq("/path")
- end
-
- it "returns 'query=value' for #query" do
- expect(@uri.query).to eq("query=value")
- end
-
- it "returns 'query=value' for #normalized_query" do
- expect(@uri.normalized_query).to eq("query=value")
- end
-
- it "returns 'fragment' for #fragment" do
- expect(@uri.fragment).to eq("fragment")
- end
-
- it "returns 'fragment' for #normalized_fragment" do
- expect(@uri.normalized_fragment).to eq("fragment")
- end
-
- it "returns #hash" do
- expect(@uri.hash).not_to be nil
- end
-
- it "returns #to_s" do
- expect(@uri.to_s).to eq(
- "http://user:password@example.com:8080/path?query=value#fragment"
- )
- end
-
- it "should not be empty" do
- expect(@uri).not_to be_empty
- end
-
- it "should not be frozen" do
- expect(@uri).not_to be_frozen
- end
-
- it "should allow destructive operations" do
- expect { @uri.normalize! }.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when frozen" do
- before do
- @uri = Addressable::URI.new.freeze
- end
-
- it "returns nil for #scheme" do
- expect(@uri.scheme).to eq(nil)
- end
-
- it "returns nil for #normalized_scheme" do
- expect(@uri.normalized_scheme).to eq(nil)
- end
-
- it "returns nil for #user" do
- expect(@uri.user).to eq(nil)
- end
-
- it "returns nil for #normalized_user" do
- expect(@uri.normalized_user).to eq(nil)
- end
-
- it "returns nil for #password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "returns nil for #normalized_password" do
- expect(@uri.normalized_password).to eq(nil)
- end
-
- it "returns nil for #userinfo" do
- expect(@uri.userinfo).to eq(nil)
- end
-
- it "returns nil for #normalized_userinfo" do
- expect(@uri.normalized_userinfo).to eq(nil)
- end
-
- it "returns nil for #host" do
- expect(@uri.host).to eq(nil)
- end
-
- it "returns nil for #normalized_host" do
- expect(@uri.normalized_host).to eq(nil)
- end
-
- it "returns nil for #authority" do
- expect(@uri.authority).to eq(nil)
- end
-
- it "returns nil for #normalized_authority" do
- expect(@uri.normalized_authority).to eq(nil)
- end
-
- it "returns nil for #port" do
- expect(@uri.port).to eq(nil)
- end
-
- it "returns nil for #normalized_port" do
- expect(@uri.normalized_port).to eq(nil)
- end
-
- it "returns nil for #default_port" do
- expect(@uri.default_port).to eq(nil)
- end
-
- it "returns nil for #site" do
- expect(@uri.site).to eq(nil)
- end
-
- it "returns nil for #normalized_site" do
- expect(@uri.normalized_site).to eq(nil)
- end
-
- it "returns '' for #path" do
- expect(@uri.path).to eq('')
- end
-
- it "returns '' for #normalized_path" do
- expect(@uri.normalized_path).to eq('')
- end
-
- it "returns nil for #query" do
- expect(@uri.query).to eq(nil)
- end
-
- it "returns nil for #normalized_query" do
- expect(@uri.normalized_query).to eq(nil)
- end
-
- it "returns nil for #fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "returns nil for #normalized_fragment" do
- expect(@uri.normalized_fragment).to eq(nil)
- end
-
- it "returns #hash" do
- expect(@uri.hash).not_to be nil
- end
-
- it "returns #to_s" do
- expect(@uri.to_s).to eq('')
- end
-
- it "should be empty" do
- expect(@uri).to be_empty
- end
-
- it "should be frozen" do
- expect(@uri).to be_frozen
- end
-
- it "should not be frozen after duping" do
- expect(@uri.dup).not_to be_frozen
- end
-
- it "should not allow destructive operations" do
- expect { @uri.normalize! }.to raise_error { |error|
- expect(error.message).to match(/can't modify frozen/)
- expect(error).to satisfy { |e| RuntimeError === e || TypeError === e }
- }
- end
-end
-
-describe Addressable::URI, "when frozen" do
- before do
- @uri = Addressable::URI.parse(
- "HTTP://example.com.:%38%30/%70a%74%68?a=%31#1%323"
- ).freeze
- end
-
- it "returns 'HTTP' for #scheme" do
- expect(@uri.scheme).to eq("HTTP")
- end
-
- it "returns 'http' for #normalized_scheme" do
- expect(@uri.normalized_scheme).to eq("http")
- expect(@uri.normalize.scheme).to eq("http")
- end
-
- it "returns nil for #user" do
- expect(@uri.user).to eq(nil)
- end
-
- it "returns nil for #normalized_user" do
- expect(@uri.normalized_user).to eq(nil)
- end
-
- it "returns nil for #password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "returns nil for #normalized_password" do
- expect(@uri.normalized_password).to eq(nil)
- end
-
- it "returns nil for #userinfo" do
- expect(@uri.userinfo).to eq(nil)
- end
-
- it "returns nil for #normalized_userinfo" do
- expect(@uri.normalized_userinfo).to eq(nil)
- end
-
- it "returns 'example.com.' for #host" do
- expect(@uri.host).to eq("example.com.")
- end
-
- it "returns nil for #normalized_host" do
- expect(@uri.normalized_host).to eq("example.com")
- expect(@uri.normalize.host).to eq("example.com")
- end
-
- it "returns 'example.com.:80' for #authority" do
- expect(@uri.authority).to eq("example.com.:80")
- end
-
- it "returns 'example.com:80' for #normalized_authority" do
- expect(@uri.normalized_authority).to eq("example.com")
- expect(@uri.normalize.authority).to eq("example.com")
- end
-
- it "returns 80 for #port" do
- expect(@uri.port).to eq(80)
- end
-
- it "returns nil for #normalized_port" do
- expect(@uri.normalized_port).to eq(nil)
- expect(@uri.normalize.port).to eq(nil)
- end
-
- it "returns 80 for #default_port" do
- expect(@uri.default_port).to eq(80)
- end
-
- it "returns 'HTTP://example.com.:80' for #site" do
- expect(@uri.site).to eq("HTTP://example.com.:80")
- end
-
- it "returns 'http://example.com' for #normalized_site" do
- expect(@uri.normalized_site).to eq("http://example.com")
- expect(@uri.normalize.site).to eq("http://example.com")
- end
-
- it "returns '/%70a%74%68' for #path" do
- expect(@uri.path).to eq("/%70a%74%68")
- end
-
- it "returns '/path' for #normalized_path" do
- expect(@uri.normalized_path).to eq("/path")
- expect(@uri.normalize.path).to eq("/path")
- end
-
- it "returns 'a=%31' for #query" do
- expect(@uri.query).to eq("a=%31")
- end
-
- it "returns 'a=1' for #normalized_query" do
- expect(@uri.normalized_query).to eq("a=1")
- expect(@uri.normalize.query).to eq("a=1")
- end
-
- it "returns '/%70a%74%68?a=%31' for #request_uri" do
- expect(@uri.request_uri).to eq("/%70a%74%68?a=%31")
- end
-
- it "returns '1%323' for #fragment" do
- expect(@uri.fragment).to eq("1%323")
- end
-
- it "returns '123' for #normalized_fragment" do
- expect(@uri.normalized_fragment).to eq("123")
- expect(@uri.normalize.fragment).to eq("123")
- end
-
- it "returns #hash" do
- expect(@uri.hash).not_to be nil
- end
-
- it "returns #to_s" do
- expect(@uri.to_s).to eq('HTTP://example.com.:80/%70a%74%68?a=%31#1%323')
- expect(@uri.normalize.to_s).to eq('http://example.com/path?a=1#123')
- end
-
- it "should not be empty" do
- expect(@uri).not_to be_empty
- end
-
- it "should be frozen" do
- expect(@uri).to be_frozen
- end
-
- it "should not be frozen after duping" do
- expect(@uri.dup).not_to be_frozen
- end
-
- it "should not allow destructive operations" do
- expect { @uri.normalize! }.to raise_error { |error|
- expect(error.message).to match(/can't modify frozen/)
- expect(error).to satisfy { |e| RuntimeError === e || TypeError === e }
- }
- end
-end
-
-describe Addressable::URI, "when normalized and then deeply frozen" do
- before do
- @uri = Addressable::URI.parse(
- "http://user:password@example.com:8080/path?query=value#fragment"
- ).normalize!
-
- @uri.instance_variables.each do |var|
- @uri.instance_variable_set(var, @uri.instance_variable_get(var).freeze)
- end
-
- @uri.freeze
- end
-
- it "#normalized_scheme should not error" do
- expect { @uri.normalized_scheme }.not_to raise_error
- end
-
- it "#normalized_user should not error" do
- expect { @uri.normalized_user }.not_to raise_error
- end
-
- it "#normalized_password should not error" do
- expect { @uri.normalized_password }.not_to raise_error
- end
-
- it "#normalized_userinfo should not error" do
- expect { @uri.normalized_userinfo }.not_to raise_error
- end
-
- it "#normalized_host should not error" do
- expect { @uri.normalized_host }.not_to raise_error
- end
-
- it "#normalized_authority should not error" do
- expect { @uri.normalized_authority }.not_to raise_error
- end
-
- it "#normalized_port should not error" do
- expect { @uri.normalized_port }.not_to raise_error
- end
-
- it "#normalized_site should not error" do
- expect { @uri.normalized_site }.not_to raise_error
- end
-
- it "#normalized_path should not error" do
- expect { @uri.normalized_path }.not_to raise_error
- end
-
- it "#normalized_query should not error" do
- expect { @uri.normalized_query }.not_to raise_error
- end
-
- it "#normalized_fragment should not error" do
- expect { @uri.normalized_fragment }.not_to raise_error
- end
-
- it "should be frozen" do
- expect(@uri).to be_frozen
- end
-
- it "should not allow destructive operations" do
- expect { @uri.normalize! }.to raise_error(RuntimeError)
- end
-end
-
-describe Addressable::URI, "when created from string components" do
- before do
- @uri = Addressable::URI.new(
- :scheme => "http", :host => "example.com"
- )
- end
-
- it "should have a site value of 'http://example.com'" do
- expect(@uri.site).to eq("http://example.com")
- end
-
- it "should be equal to the equivalent parsed URI" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com"))
- end
-
- it "should raise an error if invalid components omitted" do
- expect do
- @uri.omit(:bogus)
- end.to raise_error(ArgumentError)
- expect do
- @uri.omit(:scheme, :bogus, :path)
- end.to raise_error(ArgumentError)
- end
-end
-
-describe Addressable::URI, "when created with a nil host but " +
- "non-nil authority components" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:user => "user", :password => "pass", :port => 80)
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with both an authority and a user" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(
- :user => "user", :authority => "user@example.com:80"
- )
- end.to raise_error(ArgumentError)
- end
-end
-
-describe Addressable::URI, "when created with an authority and no port" do
- before do
- @uri = Addressable::URI.new(:authority => "user@example.com")
- end
-
- it "should not infer a port" do
- expect(@uri.port).to eq(nil)
- expect(@uri.default_port).to eq(nil)
- expect(@uri.inferred_port).to eq(nil)
- end
-
- it "should have a site value of '//user@example.com'" do
- expect(@uri.site).to eq("//user@example.com")
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when created with a host with trailing dots" do
- before do
- @uri = Addressable::URI.new(:authority => "example...")
- end
-
- it "should have a stable normalized form" do
- expect(@uri.normalize.normalize.normalize.host).to eq(
- @uri.normalize.host
- )
- end
-end
-
-describe Addressable::URI, "when created with a host with a backslash" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:authority => "example\\example")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with a host with a slash" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:authority => "example/example")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with a host with a space" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:authority => "example example")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when created with both a userinfo and a user" do
- it "should raise an error" do
- expect do
- Addressable::URI.new(:user => "user", :userinfo => "user:pass")
- end.to raise_error(ArgumentError)
- end
-end
-
-describe Addressable::URI, "when created with a path that hasn't been " +
- "prefixed with a '/' but a host specified" do
- before do
- @uri = Addressable::URI.new(
- :scheme => "http", :host => "example.com", :path => "path"
- )
- end
-
- it "should prefix a '/' to the path" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com/path"))
- end
-
- it "should have a site value of 'http://example.com'" do
- expect(@uri.site).to eq("http://example.com")
- end
-
- it "should have an origin of 'http://example.com" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-describe Addressable::URI, "when created with a path that hasn't been " +
- "prefixed with a '/' but no host specified" do
- before do
- @uri = Addressable::URI.new(
- :scheme => "http", :path => "path"
- )
- end
-
- it "should not prefix a '/' to the path" do
- expect(@uri).to eq(Addressable::URI.parse("http:path"))
- end
-
- it "should have a site value of 'http:'" do
- expect(@uri.site).to eq("http:")
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from an Addressable::URI object" do
- it "should not have unexpected side-effects" do
- original_uri = Addressable::URI.parse("http://example.com/")
- new_uri = Addressable::URI.parse(original_uri)
- new_uri.host = 'www.example.com'
- expect(new_uri.host).to eq('www.example.com')
- expect(new_uri.to_s).to eq('http://www.example.com/')
- expect(original_uri.host).to eq('example.com')
- expect(original_uri.to_s).to eq('http://example.com/')
- end
-
- it "should not have unexpected side-effects" do
- original_uri = Addressable::URI.parse("http://example.com/")
- new_uri = Addressable::URI.heuristic_parse(original_uri)
- new_uri.host = 'www.example.com'
- expect(new_uri.host).to eq('www.example.com')
- expect(new_uri.to_s).to eq('http://www.example.com/')
- expect(original_uri.host).to eq('example.com')
- expect(original_uri.to_s).to eq('http://example.com/')
- end
-
- it "should not have unexpected side-effects" do
- original_uri = Addressable::URI.parse("http://example.com/")
- new_uri = Addressable::URI.parse(original_uri)
- new_uri.origin = 'https://www.example.com:8080'
- expect(new_uri.host).to eq('www.example.com')
- expect(new_uri.to_s).to eq('https://www.example.com:8080/')
- expect(original_uri.host).to eq('example.com')
- expect(original_uri.to_s).to eq('http://example.com/')
- end
-
- it "should not have unexpected side-effects" do
- original_uri = Addressable::URI.parse("http://example.com/")
- new_uri = Addressable::URI.heuristic_parse(original_uri)
- new_uri.origin = 'https://www.example.com:8080'
- expect(new_uri.host).to eq('www.example.com')
- expect(new_uri.to_s).to eq('https://www.example.com:8080/')
- expect(original_uri.host).to eq('example.com')
- expect(original_uri.to_s).to eq('http://example.com/')
- end
-end
-
-describe Addressable::URI, "when parsed from something that looks " +
- "like a URI object" do
- it "should parse without error" do
- uri = Addressable::URI.parse(Fake::URI::HTTP.new("http://example.com/"))
- expect do
- Addressable::URI.parse(uri)
- end.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when parsed from a standard library URI object" do
- it "should parse without error" do
- uri = Addressable::URI.parse(URI.parse("http://example.com/"))
- expect do
- Addressable::URI.parse(uri)
- end.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when parsed from ''" do
- before do
- @uri = Addressable::URI.parse("")
- end
-
- it "should have no scheme" do
- expect(@uri.scheme).to eq(nil)
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should have a path of ''" do
- expect(@uri.path).to eq("")
- end
-
- it "should have a request URI of '/'" do
- expect(@uri.request_uri).to eq("/")
- end
-
- it "should be considered relative" do
- expect(@uri).to be_relative
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'ftp://ftp.is.co.za/rfc/rfc1808.txt'" do
- before do
- @uri = Addressable::URI.parse("ftp://ftp.is.co.za/rfc/rfc1808.txt")
- end
-
- it "should use the 'ftp' scheme" do
- expect(@uri.scheme).to eq("ftp")
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have a host of 'ftp.is.co.za'" do
- expect(@uri.host).to eq("ftp.is.co.za")
- end
-
- it "should have inferred_port of 21" do
- expect(@uri.inferred_port).to eq(21)
- end
-
- it "should have a path of '/rfc/rfc1808.txt'" do
- expect(@uri.path).to eq("/rfc/rfc1808.txt")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have an origin of 'ftp://ftp.is.co.za'" do
- expect(@uri.origin).to eq('ftp://ftp.is.co.za')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'http://www.ietf.org/rfc/rfc2396.txt'" do
- before do
- @uri = Addressable::URI.parse("http://www.ietf.org/rfc/rfc2396.txt")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have a host of 'www.ietf.org'" do
- expect(@uri.host).to eq("www.ietf.org")
- end
-
- it "should have inferred_port of 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/rfc/rfc2396.txt'" do
- expect(@uri.path).to eq("/rfc/rfc2396.txt")
- end
-
- it "should have a request URI of '/rfc/rfc2396.txt'" do
- expect(@uri.request_uri).to eq("/rfc/rfc2396.txt")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should correctly omit components" do
- expect(@uri.omit(:scheme).to_s).to eq("//www.ietf.org/rfc/rfc2396.txt")
- expect(@uri.omit(:path).to_s).to eq("http://www.ietf.org")
- end
-
- it "should correctly omit components destructively" do
- @uri.omit!(:scheme)
- expect(@uri.to_s).to eq("//www.ietf.org/rfc/rfc2396.txt")
- end
-
- it "should have an origin of 'http://www.ietf.org'" do
- expect(@uri.origin).to eq('http://www.ietf.org')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'ldap://[2001:db8::7]/c=GB?objectClass?one'" do
- before do
- @uri = Addressable::URI.parse("ldap://[2001:db8::7]/c=GB?objectClass?one")
- end
-
- it "should use the 'ldap' scheme" do
- expect(@uri.scheme).to eq("ldap")
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have a host of '[2001:db8::7]'" do
- expect(@uri.host).to eq("[2001:db8::7]")
- end
-
- it "should have inferred_port of 389" do
- expect(@uri.inferred_port).to eq(389)
- end
-
- it "should have a path of '/c=GB'" do
- expect(@uri.path).to eq("/c=GB")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should not allow request URI assignment" do
- expect do
- @uri.request_uri = "/"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should have a query of 'objectClass?one'" do
- expect(@uri.query).to eq("objectClass?one")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should correctly omit components" do
- expect(@uri.omit(:scheme, :authority).to_s).to eq("/c=GB?objectClass?one")
- expect(@uri.omit(:path).to_s).to eq("ldap://[2001:db8::7]?objectClass?one")
- end
-
- it "should correctly omit components destructively" do
- @uri.omit!(:scheme, :authority)
- expect(@uri.to_s).to eq("/c=GB?objectClass?one")
- end
-
- it "should raise an error if omission would create an invalid URI" do
- expect do
- @uri.omit(:authority, :path)
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should have an origin of 'ldap://[2001:db8::7]'" do
- expect(@uri.origin).to eq('ldap://[2001:db8::7]')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'mailto:John.Doe@example.com'" do
- before do
- @uri = Addressable::URI.parse("mailto:John.Doe@example.com")
- end
-
- it "should use the 'mailto' scheme" do
- expect(@uri.scheme).to eq("mailto")
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should not have an inferred_port" do
- expect(@uri.inferred_port).to eq(nil)
- end
-
- it "should have a path of 'John.Doe@example.com'" do
- expect(@uri.path).to eq("John.Doe@example.com")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-# Section 2 of RFC 6068
-describe Addressable::URI, "when parsed from " +
- "'mailto:?to=addr1@an.example,addr2@an.example'" do
- before do
- @uri = Addressable::URI.parse(
- "mailto:?to=addr1@an.example,addr2@an.example"
- )
- end
-
- it "should use the 'mailto' scheme" do
- expect(@uri.scheme).to eq("mailto")
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should not have an inferred_port" do
- expect(@uri.inferred_port).to eq(nil)
- end
-
- it "should have a path of ''" do
- expect(@uri.path).to eq("")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should have the To: field value parameterized" do
- expect(@uri.query_values(Hash)["to"]).to eq(
- "addr1@an.example,addr2@an.example"
- )
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'news:comp.infosystems.www.servers.unix'" do
- before do
- @uri = Addressable::URI.parse("news:comp.infosystems.www.servers.unix")
- end
-
- it "should use the 'news' scheme" do
- expect(@uri.scheme).to eq("news")
- end
-
- it "should not have an inferred_port" do
- expect(@uri.inferred_port).to eq(nil)
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should have a path of 'comp.infosystems.www.servers.unix'" do
- expect(@uri.path).to eq("comp.infosystems.www.servers.unix")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'tel:+1-816-555-1212'" do
- before do
- @uri = Addressable::URI.parse("tel:+1-816-555-1212")
- end
-
- it "should use the 'tel' scheme" do
- expect(@uri.scheme).to eq("tel")
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should not have an inferred_port" do
- expect(@uri.inferred_port).to eq(nil)
- end
-
- it "should have a path of '+1-816-555-1212'" do
- expect(@uri.path).to eq("+1-816-555-1212")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'telnet://192.0.2.16:80/'" do
- before do
- @uri = Addressable::URI.parse("telnet://192.0.2.16:80/")
- end
-
- it "should use the 'telnet' scheme" do
- expect(@uri.scheme).to eq("telnet")
- end
-
- it "should have a host of '192.0.2.16'" do
- expect(@uri.host).to eq("192.0.2.16")
- end
-
- it "should have a port of 80" do
- expect(@uri.port).to eq(80)
- end
-
- it "should have a inferred_port of 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a default_port of 23" do
- expect(@uri.default_port).to eq(23)
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have a path of '/'" do
- expect(@uri.path).to eq("/")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have an origin of 'telnet://192.0.2.16:80'" do
- expect(@uri.origin).to eq('telnet://192.0.2.16:80')
- end
-end
-
-# Section 1.1.2 of RFC 3986
-describe Addressable::URI, "when parsed from " +
- "'urn:oasis:names:specification:docbook:dtd:xml:4.1.2'" do
- before do
- @uri = Addressable::URI.parse(
- "urn:oasis:names:specification:docbook:dtd:xml:4.1.2")
- end
-
- it "should use the 'urn' scheme" do
- expect(@uri.scheme).to eq("urn")
- end
-
- it "should not have an inferred_port" do
- expect(@uri.inferred_port).to eq(nil)
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should have a path of " +
- "'oasis:names:specification:docbook:dtd:xml:4.1.2'" do
- expect(@uri.path).to eq("oasis:names:specification:docbook:dtd:xml:4.1.2")
- end
-
- it "should not have a request URI" do
- expect(@uri.request_uri).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when heuristically parsed from " +
- "'192.0.2.16:8000/path'" do
- before do
- @uri = Addressable::URI.heuristic_parse("192.0.2.16:8000/path")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have a host of '192.0.2.16'" do
- expect(@uri.host).to eq("192.0.2.16")
- end
-
- it "should have a port of '8000'" do
- expect(@uri.port).to eq(8000)
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have a path of '/path'" do
- expect(@uri.path).to eq("/path")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have an origin of 'http://192.0.2.16:8000'" do
- expect(@uri.origin).to eq('http://192.0.2.16:8000')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com'" do
- before do
- @uri = Addressable::URI.parse("http://example.com")
- end
-
- it "when inspected, should have the correct URI" do
- expect(@uri.inspect).to include("http://example.com")
- end
-
- it "when inspected, should have the correct class name" do
- expect(@uri.inspect).to include("Addressable::URI")
- end
-
- it "when inspected, should have the correct object id" do
- expect(@uri.inspect).to include("%#0x" % @uri.object_id)
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have an authority segment of 'example.com'" do
- expect(@uri.authority).to eq("example.com")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should be considered ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should not have a specified port" do
- expect(@uri.port).to eq(nil)
- end
-
- it "should have an empty path" do
- expect(@uri.path).to eq("")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- expect(@uri.query_values).to eq(nil)
- end
-
- it "should have a request URI of '/'" do
- expect(@uri.request_uri).to eq("/")
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should be considered absolute" do
- expect(@uri).to be_absolute
- end
-
- it "should not be considered relative" do
- expect(@uri).not_to be_relative
- end
-
- it "should not be exactly equal to 42" do
- expect(@uri.eql?(42)).to eq(false)
- end
-
- it "should not be equal to 42" do
- expect(@uri == 42).to eq(false)
- end
-
- it "should not be roughly equal to 42" do
- expect(@uri === 42).to eq(false)
- end
-
- it "should be exactly equal to http://example.com" do
- expect(@uri.eql?(Addressable::URI.parse("http://example.com"))).to eq(true)
- end
-
- it "should be roughly equal to http://example.com/" do
- expect(@uri === Addressable::URI.parse("http://example.com/")).to eq(true)
- end
-
- it "should be roughly equal to the string 'http://example.com/'" do
- expect(@uri === "http://example.com/").to eq(true)
- end
-
- it "should not be roughly equal to the string " +
- "'http://example.com:bogus/'" do
- expect do
- expect(@uri === "http://example.com:bogus/").to eq(false)
- end.not_to raise_error
- end
-
- it "should result in itself when joined with itself" do
- expect(@uri.join(@uri).to_s).to eq("http://example.com")
- expect(@uri.join!(@uri).to_s).to eq("http://example.com")
- end
-
- it "should be equivalent to http://EXAMPLE.com" do
- expect(@uri).to eq(Addressable::URI.parse("http://EXAMPLE.com"))
- end
-
- it "should be equivalent to http://EXAMPLE.com:80/" do
- expect(@uri).to eq(Addressable::URI.parse("http://EXAMPLE.com:80/"))
- end
-
- it "should have the same hash as http://example.com" do
- expect(@uri.hash).to eq(Addressable::URI.parse("http://example.com").hash)
- end
-
- it "should have the same hash as http://EXAMPLE.com after assignment" do
- @uri.origin = "http://EXAMPLE.com"
- expect(@uri.hash).to eq(Addressable::URI.parse("http://EXAMPLE.com").hash)
- end
-
- it "should have a different hash from http://EXAMPLE.com" do
- expect(@uri.hash).not_to eq(Addressable::URI.parse("http://EXAMPLE.com").hash)
- end
-
- it "should not allow origin assignment without scheme" do
- expect do
- @uri.origin = "example.com"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should not allow origin assignment without host" do
- expect do
- @uri.origin = "http://"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should not allow origin assignment with bogus type" do
- expect do
- @uri.origin = :bogus
- end.to raise_error(TypeError)
- end
-
- # Section 6.2.3 of RFC 3986
- it "should be equivalent to http://example.com/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com/"))
- end
-
- # Section 6.2.3 of RFC 3986
- it "should be equivalent to http://example.com:/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com:/"))
- end
-
- # Section 6.2.3 of RFC 3986
- it "should be equivalent to http://example.com:80/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com:80/"))
- end
-
- # Section 6.2.2.1 of RFC 3986
- it "should be equivalent to http://EXAMPLE.COM/" do
- expect(@uri).to eq(Addressable::URI.parse("http://EXAMPLE.COM/"))
- end
-
- it "should have a route of '/path/' to 'http://example.com/path/'" do
- expect(@uri.route_to("http://example.com/path/")).to eq(
- Addressable::URI.parse("/path/")
- )
- end
-
- it "should have a route of '..' from 'http://example.com/path/'" do
- expect(@uri.route_from("http://example.com/path/")).to eq(
- Addressable::URI.parse("..")
- )
- end
-
- it "should have a route of '#' to 'http://example.com/'" do
- expect(@uri.route_to("http://example.com/")).to eq(
- Addressable::URI.parse("#")
- )
- end
-
- it "should have a route of 'http://elsewhere.com/' to " +
- "'http://elsewhere.com/'" do
- expect(@uri.route_to("http://elsewhere.com/")).to eq(
- Addressable::URI.parse("http://elsewhere.com/")
- )
- end
-
- it "when joined with 'relative/path' should be " +
- "'http://example.com/relative/path'" do
- expect(@uri.join('relative/path')).to eq(
- Addressable::URI.parse("http://example.com/relative/path")
- )
- end
-
- it "when joined with a bogus object a TypeError should be raised" do
- expect do
- @uri.join(42)
- end.to raise_error(TypeError)
- end
-
- it "should have the correct username after assignment" do
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq(nil)
- expect(@uri.to_s).to eq("http://newuser@example.com")
- end
-
- it "should have the correct username after assignment" do
- @uri.user = "user@123!"
- expect(@uri.user).to eq("user@123!")
- expect(@uri.normalized_user).to eq("user%40123%21")
- expect(@uri.password).to eq(nil)
- expect(@uri.normalize.to_s).to eq("http://user%40123%21@example.com/")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- expect(@uri.user).to eq("")
- expect(@uri.to_s).to eq("http://:newpass@example.com")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = "#secret@123!"
- expect(@uri.password).to eq("#secret@123!")
- expect(@uri.normalized_password).to eq("%23secret%40123%21")
- expect(@uri.user).to eq("")
- expect(@uri.normalize.to_s).to eq("http://:%23secret%40123%21@example.com/")
- expect(@uri.omit(:password).to_s).to eq("http://example.com")
- end
-
- it "should have the correct user/pass after repeated assignment" do
- @uri.user = nil
- expect(@uri.user).to eq(nil)
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- # Username cannot be nil if the password is set
- expect(@uri.user).to eq("")
- expect(@uri.to_s).to eq("http://:newpass@example.com")
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- @uri.password = nil
- expect(@uri.password).to eq(nil)
- expect(@uri.to_s).to eq("http://newuser@example.com")
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- @uri.password = ""
- expect(@uri.password).to eq("")
- expect(@uri.to_s).to eq("http://newuser:@example.com")
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- @uri.user = nil
- # Username cannot be nil if the password is set
- expect(@uri.user).to eq("")
- expect(@uri.to_s).to eq("http://:newpass@example.com")
- end
-
- it "should have the correct user/pass after userinfo assignment" do
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- @uri.userinfo = nil
- expect(@uri.userinfo).to eq(nil)
- expect(@uri.user).to eq(nil)
- expect(@uri.password).to eq(nil)
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => nil,
- :password => nil,
- :host => "example.com",
- :port => nil,
- :path => "",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-# Section 5.1.2 of RFC 2616
-describe Addressable::URI, "when parsed from " +
- "'HTTP://www.w3.org/pub/WWW/TheProject.html'" do
- before do
- @uri = Addressable::URI.parse("HTTP://www.w3.org/pub/WWW/TheProject.html")
- end
-
- it "should have the correct request URI" do
- expect(@uri.request_uri).to eq("/pub/WWW/TheProject.html")
- end
-
- it "should have the correct request URI after assignment" do
- @uri.request_uri = "/pub/WWW/TheProject.html?"
- expect(@uri.request_uri).to eq("/pub/WWW/TheProject.html?")
- expect(@uri.path).to eq("/pub/WWW/TheProject.html")
- expect(@uri.query).to eq("")
- end
-
- it "should have the correct request URI after assignment" do
- @uri.request_uri = "/some/where/else.html"
- expect(@uri.request_uri).to eq("/some/where/else.html")
- expect(@uri.path).to eq("/some/where/else.html")
- expect(@uri.query).to eq(nil)
- end
-
- it "should have the correct request URI after assignment" do
- @uri.request_uri = "/some/where/else.html?query?string"
- expect(@uri.request_uri).to eq("/some/where/else.html?query?string")
- expect(@uri.path).to eq("/some/where/else.html")
- expect(@uri.query).to eq("query?string")
- end
-
- it "should have the correct request URI after assignment" do
- @uri.request_uri = "?x=y"
- expect(@uri.request_uri).to eq("/?x=y")
- expect(@uri.path).to eq("/")
- expect(@uri.query).to eq("x=y")
- end
-
- it "should raise an error if the site value is set to something bogus" do
- expect do
- @uri.site = 42
- end.to raise_error(TypeError)
- end
-
- it "should raise an error if the request URI is set to something bogus" do
- expect do
- @uri.request_uri = 42
- end.to raise_error(TypeError)
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "HTTP",
- :user => nil,
- :password => nil,
- :host => "www.w3.org",
- :port => nil,
- :path => "/pub/WWW/TheProject.html",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should have an origin of 'http://www.w3.org'" do
- expect(@uri.origin).to eq('http://www.w3.org')
- end
-end
-
-describe Addressable::URI, "when parsing IPv6 addresses" do
- it "should not raise an error for " +
- "'http://[3ffe:1900:4545:3:200:f8ff:fe21:67cf]/'" do
- Addressable::URI.parse("http://[3ffe:1900:4545:3:200:f8ff:fe21:67cf]/")
- end
-
- it "should not raise an error for " +
- "'http://[fe80:0:0:0:200:f8ff:fe21:67cf]/'" do
- Addressable::URI.parse("http://[fe80:0:0:0:200:f8ff:fe21:67cf]/")
- end
-
- it "should not raise an error for " +
- "'http://[fe80::200:f8ff:fe21:67cf]/'" do
- Addressable::URI.parse("http://[fe80::200:f8ff:fe21:67cf]/")
- end
-
- it "should not raise an error for " +
- "'http://[::1]/'" do
- Addressable::URI.parse("http://[::1]/")
- end
-
- it "should not raise an error for " +
- "'http://[fe80::1]/'" do
- Addressable::URI.parse("http://[fe80::1]/")
- end
-
- it "should raise an error for " +
- "'http://[]/'" do
- expect do
- Addressable::URI.parse("http://[]/")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when parsing IPv6 address" do
- subject { Addressable::URI.parse("http://[3ffe:1900:4545:3:200:f8ff:fe21:67cf]/") }
- its(:host) { should == '[3ffe:1900:4545:3:200:f8ff:fe21:67cf]' }
- its(:hostname) { should == '3ffe:1900:4545:3:200:f8ff:fe21:67cf' }
-end
-
-describe Addressable::URI, "when assigning IPv6 address" do
- it "should allow to set bare IPv6 address as hostname" do
- uri = Addressable::URI.parse("http://[::1]/")
- uri.hostname = '3ffe:1900:4545:3:200:f8ff:fe21:67cf'
- expect(uri.to_s).to eq('http://[3ffe:1900:4545:3:200:f8ff:fe21:67cf]/')
- end
-
- it "should allow to set bare IPv6 address as hostname with IPAddr object" do
- uri = Addressable::URI.parse("http://[::1]/")
- uri.hostname = IPAddr.new('3ffe:1900:4545:3:200:f8ff:fe21:67cf')
- expect(uri.to_s).to eq('http://[3ffe:1900:4545:3:200:f8ff:fe21:67cf]/')
- end
-
- it "should not allow to set bare IPv6 address as host" do
- uri = Addressable::URI.parse("http://[::1]/")
- skip "not checked"
- expect do
- uri.host = '3ffe:1900:4545:3:200:f8ff:fe21:67cf'
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when parsing IPvFuture addresses" do
- it "should not raise an error for " +
- "'http://[v9.3ffe:1900:4545:3:200:f8ff:fe21:67cf]/'" do
- Addressable::URI.parse("http://[v9.3ffe:1900:4545:3:200:f8ff:fe21:67cf]/")
- end
-
- it "should not raise an error for " +
- "'http://[vff.fe80:0:0:0:200:f8ff:fe21:67cf]/'" do
- Addressable::URI.parse("http://[vff.fe80:0:0:0:200:f8ff:fe21:67cf]/")
- end
-
- it "should not raise an error for " +
- "'http://[v12.fe80::200:f8ff:fe21:67cf]/'" do
- Addressable::URI.parse("http://[v12.fe80::200:f8ff:fe21:67cf]/")
- end
-
- it "should not raise an error for " +
- "'http://[va0.::1]/'" do
- Addressable::URI.parse("http://[va0.::1]/")
- end
-
- it "should not raise an error for " +
- "'http://[v255.fe80::1]/'" do
- Addressable::URI.parse("http://[v255.fe80::1]/")
- end
-
- it "should raise an error for " +
- "'http://[v0.]/'" do
- expect do
- Addressable::URI.parse("http://[v0.]/")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/")
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to http://example.com" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com"))
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to HTTP://example.com/" do
- expect(@uri).to eq(Addressable::URI.parse("HTTP://example.com/"))
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to http://example.com:/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com:/"))
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to http://example.com:80/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com:80/"))
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to http://Example.com/" do
- expect(@uri).to eq(Addressable::URI.parse("http://Example.com/"))
- end
-
- it "should have the correct username after assignment" do
- @uri.user = nil
- expect(@uri.user).to eq(nil)
- expect(@uri.password).to eq(nil)
- expect(@uri.to_s).to eq("http://example.com/")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = nil
- expect(@uri.password).to eq(nil)
- expect(@uri.user).to eq(nil)
- expect(@uri.to_s).to eq("http://example.com/")
- end
-
- it "should have a request URI of '/'" do
- expect(@uri.request_uri).to eq("/")
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => nil,
- :password => nil,
- :host => "example.com",
- :port => nil,
- :path => "/",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have the same hash as its duplicate" do
- expect(@uri.hash).to eq(@uri.dup.hash)
- end
-
- it "should have a different hash from its equivalent String value" do
- expect(@uri.hash).not_to eq(@uri.to_s.hash)
- end
-
- it "should have the same hash as an equal URI" do
- expect(@uri.hash).to eq(Addressable::URI.parse("http://example.com/").hash)
- end
-
- it "should be equivalent to http://EXAMPLE.com" do
- expect(@uri).to eq(Addressable::URI.parse("http://EXAMPLE.com"))
- end
-
- it "should be equivalent to http://EXAMPLE.com:80/" do
- expect(@uri).to eq(Addressable::URI.parse("http://EXAMPLE.com:80/"))
- end
-
- it "should have the same hash as http://example.com/" do
- expect(@uri.hash).to eq(Addressable::URI.parse("http://example.com/").hash)
- end
-
- it "should have the same hash as http://example.com after assignment" do
- @uri.path = ""
- expect(@uri.hash).to eq(Addressable::URI.parse("http://example.com").hash)
- end
-
- it "should have the same hash as http://example.com/? after assignment" do
- @uri.query = ""
- expect(@uri.hash).to eq(Addressable::URI.parse("http://example.com/?").hash)
- end
-
- it "should have the same hash as http://example.com/? after assignment" do
- @uri.query_values = {}
- expect(@uri.hash).to eq(Addressable::URI.parse("http://example.com/?").hash)
- end
-
- it "should have the same hash as http://example.com/# after assignment" do
- @uri.fragment = ""
- expect(@uri.hash).to eq(Addressable::URI.parse("http://example.com/#").hash)
- end
-
- it "should have a different hash from http://example.com" do
- expect(@uri.hash).not_to eq(Addressable::URI.parse("http://example.com").hash)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com?#'" do
- before do
- @uri = Addressable::URI.parse("http://example.com?#")
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => nil,
- :password => nil,
- :host => "example.com",
- :port => nil,
- :path => "",
- :query => "",
- :fragment => ""
- })
- end
-
- it "should have a request URI of '/?'" do
- expect(@uri.request_uri).to eq("/?")
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq("http://example.com")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://@example.com/'" do
- before do
- @uri = Addressable::URI.parse("http://@example.com/")
- end
-
- it "should be equivalent to http://example.com" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com"))
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => "",
- :password => nil,
- :host => "example.com",
- :port => nil,
- :path => "/",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com./'" do
- before do
- @uri = Addressable::URI.parse("http://example.com./")
- end
-
- it "should be equivalent to http://example.com" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com"))
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://:@example.com/'" do
- before do
- @uri = Addressable::URI.parse("http://:@example.com/")
- end
-
- it "should be equivalent to http://example.com" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com"))
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => "",
- :password => "",
- :host => "example.com",
- :port => nil,
- :path => "/",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'HTTP://EXAMPLE.COM/'" do
- before do
- @uri = Addressable::URI.parse("HTTP://EXAMPLE.COM/")
- end
-
- it "should be equivalent to http://example.com" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com"))
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "HTTP",
- :user => nil,
- :password => nil,
- :host => "EXAMPLE.COM",
- :port => nil,
- :path => "/",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-
- it "should have a tld of 'com'" do
- expect(@uri.tld).to eq('com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://www.example.co.uk/'" do
- before do
- @uri = Addressable::URI.parse("http://www.example.co.uk/")
- end
-
- it "should have an origin of 'http://www.example.co.uk'" do
- expect(@uri.origin).to eq('http://www.example.co.uk')
- end
-
- it "should have a tld of 'co.uk'" do
- expect(@uri.tld).to eq('co.uk')
- end
-
- it "should have a domain of 'example.co.uk'" do
- expect(@uri.domain).to eq('example.co.uk')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://sub_domain.blogspot.com/'" do
- before do
- @uri = Addressable::URI.parse("http://sub_domain.blogspot.com/")
- end
-
- it "should have an origin of 'http://sub_domain.blogspot.com'" do
- expect(@uri.origin).to eq('http://sub_domain.blogspot.com')
- end
-
- it "should have a tld of 'com'" do
- expect(@uri.tld).to eq('com')
- end
-
- it "should have a domain of 'blogspot.com'" do
- expect(@uri.domain).to eq('blogspot.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/~smith/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/~smith/")
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to http://example.com/%7Esmith/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com/%7Esmith/"))
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to http://example.com/%7esmith/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com/%7esmith/"))
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/%E8'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/%E8")
- end
-
- it "should not raise an exception when normalized" do
- expect do
- @uri.normalize
- end.not_to raise_error
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should not change if encoded with the normalizing algorithm" do
- expect(Addressable::URI.normalized_encode(@uri).to_s).to eq(
- "http://example.com/%E8"
- )
- expect(Addressable::URI.normalized_encode(@uri, Addressable::URI).to_s).to be ===
- "http://example.com/%E8"
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/path%2Fsegment/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/path%2Fsegment/")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should be equal to 'http://example.com/path%2Fsegment/'" do
- expect(@uri.normalize).to be_eql(
- Addressable::URI.parse("http://example.com/path%2Fsegment/")
- )
- end
-
- it "should not be equal to 'http://example.com/path/segment/'" do
- expect(@uri).not_to eq(
- Addressable::URI.parse("http://example.com/path/segment/")
- )
- end
-
- it "should not be equal to 'http://example.com/path/segment/'" do
- expect(@uri.normalize).not_to be_eql(
- Addressable::URI.parse("http://example.com/path/segment/")
- )
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?%F6'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?%F6")
- end
-
- it "should not raise an exception when normalized" do
- expect do
- @uri.normalize
- end.not_to raise_error
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should not change if encoded with the normalizing algorithm" do
- expect(Addressable::URI.normalized_encode(@uri).to_s).to eq(
- "http://example.com/?%F6"
- )
- expect(Addressable::URI.normalized_encode(@uri, Addressable::URI).to_s).to be ===
- "http://example.com/?%F6"
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/#%F6'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/#%F6")
- end
-
- it "should not raise an exception when normalized" do
- expect do
- @uri.normalize
- end.not_to raise_error
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should not change if encoded with the normalizing algorithm" do
- expect(Addressable::URI.normalized_encode(@uri).to_s).to eq(
- "http://example.com/#%F6"
- )
- expect(Addressable::URI.normalized_encode(@uri, Addressable::URI).to_s).to be ===
- "http://example.com/#%F6"
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/%C3%87'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/%C3%87")
- end
-
- # Based on http://intertwingly.net/blog/2004/07/31/URI-Equivalence
- it "should be equivalent to 'http://example.com/C%CC%A7'" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com/C%CC%A7"))
- end
-
- it "should not change if encoded with the normalizing algorithm" do
- expect(Addressable::URI.normalized_encode(@uri).to_s).to eq(
- "http://example.com/%C3%87"
- )
- expect(Addressable::URI.normalized_encode(@uri, Addressable::URI).to_s).to be ===
- "http://example.com/%C3%87"
- end
-
- it "should raise an error if encoding with an unexpected return type" do
- expect do
- Addressable::URI.normalized_encode(@uri, Integer)
- end.to raise_error(TypeError)
- end
-
- it "if percent encoded should be 'http://example.com/C%25CC%25A7'" do
- expect(Addressable::URI.encode(@uri).to_s).to eq(
- "http://example.com/%25C3%2587"
- )
- end
-
- it "if percent encoded should be 'http://example.com/C%25CC%25A7'" do
- expect(Addressable::URI.encode(@uri, Addressable::URI)).to eq(
- Addressable::URI.parse("http://example.com/%25C3%2587")
- )
- end
-
- it "should raise an error if encoding with an unexpected return type" do
- expect do
- Addressable::URI.encode(@uri, Integer)
- end.to raise_error(TypeError)
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?q=string'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?q=string")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'example.com'" do
- expect(@uri.authority).to eq("example.com")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/'" do
- expect(@uri.path).to eq("/")
- end
-
- it "should have a query string of 'q=string'" do
- expect(@uri.query).to eq("q=string")
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should be considered absolute" do
- expect(@uri).to be_absolute
- end
-
- it "should not be considered relative" do
- expect(@uri).not_to be_relative
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com:80/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com:80/")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'example.com:80'" do
- expect(@uri.authority).to eq("example.com:80")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have explicit port 80" do
- expect(@uri.port).to eq(80)
- end
-
- it "should have a path of '/'" do
- expect(@uri.path).to eq("/")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should be considered absolute" do
- expect(@uri).to be_absolute
- end
-
- it "should not be considered relative" do
- expect(@uri).not_to be_relative
- end
-
- it "should be exactly equal to http://example.com:80/" do
- expect(@uri.eql?(Addressable::URI.parse("http://example.com:80/"))).to eq(true)
- end
-
- it "should be roughly equal to http://example.com/" do
- expect(@uri === Addressable::URI.parse("http://example.com/")).to eq(true)
- end
-
- it "should be roughly equal to the string 'http://example.com/'" do
- expect(@uri === "http://example.com/").to eq(true)
- end
-
- it "should not be roughly equal to the string " +
- "'http://example.com:bogus/'" do
- expect do
- expect(@uri === "http://example.com:bogus/").to eq(false)
- end.not_to raise_error
- end
-
- it "should result in itself when joined with itself" do
- expect(@uri.join(@uri).to_s).to eq("http://example.com:80/")
- expect(@uri.join!(@uri).to_s).to eq("http://example.com:80/")
- end
-
- # Section 6.2.3 of RFC 3986
- it "should be equal to http://example.com/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com/"))
- end
-
- # Section 6.2.3 of RFC 3986
- it "should be equal to http://example.com:/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com:/"))
- end
-
- # Section 6.2.3 of RFC 3986
- it "should be equal to http://example.com:80/" do
- expect(@uri).to eq(Addressable::URI.parse("http://example.com:80/"))
- end
-
- # Section 6.2.2.1 of RFC 3986
- it "should be equal to http://EXAMPLE.COM/" do
- expect(@uri).to eq(Addressable::URI.parse("http://EXAMPLE.COM/"))
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => nil,
- :password => nil,
- :host => "example.com",
- :port => 80,
- :path => "/",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-
- it "should not change if encoded with the normalizing algorithm" do
- expect(Addressable::URI.normalized_encode(@uri).to_s).to eq(
- "http://example.com:80/"
- )
- expect(Addressable::URI.normalized_encode(@uri, Addressable::URI).to_s).to be ===
- "http://example.com:80/"
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com:8080/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com:8080/")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'example.com:8080'" do
- expect(@uri.authority).to eq("example.com:8080")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 8080" do
- expect(@uri.inferred_port).to eq(8080)
- end
-
- it "should have explicit port 8080" do
- expect(@uri.port).to eq(8080)
- end
-
- it "should have default port 80" do
- expect(@uri.default_port).to eq(80)
- end
-
- it "should have a path of '/'" do
- expect(@uri.path).to eq("/")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should be considered absolute" do
- expect(@uri).to be_absolute
- end
-
- it "should not be considered relative" do
- expect(@uri).not_to be_relative
- end
-
- it "should be exactly equal to http://example.com:8080/" do
- expect(@uri.eql?(Addressable::URI.parse(
- "http://example.com:8080/"))).to eq(true)
- end
-
- it "should have a route of 'http://example.com:8080/' from " +
- "'http://example.com/path/to/'" do
- expect(@uri.route_from("http://example.com/path/to/")).to eq(
- Addressable::URI.parse("http://example.com:8080/")
- )
- end
-
- it "should have a route of 'http://example.com:8080/' from " +
- "'http://example.com:80/path/to/'" do
- expect(@uri.route_from("http://example.com:80/path/to/")).to eq(
- Addressable::URI.parse("http://example.com:8080/")
- )
- end
-
- it "should have a route of '../../' from " +
- "'http://example.com:8080/path/to/'" do
- expect(@uri.route_from("http://example.com:8080/path/to/")).to eq(
- Addressable::URI.parse("../../")
- )
- end
-
- it "should have a route of 'http://example.com:8080/' from " +
- "'http://user:pass@example.com/path/to/'" do
- expect(@uri.route_from("http://user:pass@example.com/path/to/")).to eq(
- Addressable::URI.parse("http://example.com:8080/")
- )
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => nil,
- :password => nil,
- :host => "example.com",
- :port => 8080,
- :path => "/",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com:8080'" do
- expect(@uri.origin).to eq('http://example.com:8080')
- end
-
- it "should not change if encoded with the normalizing algorithm" do
- expect(Addressable::URI.normalized_encode(@uri).to_s).to eq(
- "http://example.com:8080/"
- )
- expect(Addressable::URI.normalized_encode(@uri, Addressable::URI).to_s).to be ===
- "http://example.com:8080/"
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com:%38%30/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com:%38%30/")
- end
-
- it "should have the correct port" do
- expect(@uri.port).to eq(80)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-describe Addressable::URI, "when parsed with empty port" do
- subject(:uri) do
- Addressable::URI.parse("//example.com:")
- end
-
- it "should not infer a port" do
- expect(uri.port).to be(nil)
- end
-
- it "should have a site value of '//example.com'" do
- expect(uri.site).to eq("//example.com")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/%2E/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/%2E/")
- end
-
- it "should be considered to be in normal form" do
- skip(
- 'path segment normalization should happen before ' +
- 'percent escaping normalization'
- )
- @uri.normalize.should be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/%2E/'" do
- skip(
- 'path segment normalization should happen before ' +
- 'percent escaping normalization'
- )
- expect(@uri.normalize).to eq("http://example.com/%2E/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/..'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/..")
- end
-
- it "should have the correct port" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/../..'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/../..")
- end
-
- it "should have the correct port" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/path(/..'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/path(/..")
- end
-
- it "should have the correct port" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/(path)/..'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/(path)/..")
- end
-
- it "should have the correct port" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/path(/../'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/path(/../")
- end
-
- it "should have the correct port" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/(path)/../'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/(path)/../")
- end
-
- it "should have the correct port" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'/..//example.com'" do
- before do
- @uri = Addressable::URI.parse("/..//example.com")
- end
-
- it "should become invalid when normalized" do
- expect do
- @uri.normalize
- end.to raise_error(Addressable::URI::InvalidURIError, /authority/)
- end
-
- it "should have a path of '/..//example.com'" do
- expect(@uri.path).to eq("/..//example.com")
- end
-end
-
-describe Addressable::URI, "when parsed from '/a/b/c/./../../g'" do
- before do
- @uri = Addressable::URI.parse("/a/b/c/./../../g")
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- # Section 5.2.4 of RFC 3986
- it "should normalize to '/a/g'" do
- expect(@uri.normalize.to_s).to eq("/a/g")
- end
-end
-
-describe Addressable::URI, "when parsed from 'mid/content=5/../6'" do
- before do
- @uri = Addressable::URI.parse("mid/content=5/../6")
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- # Section 5.2.4 of RFC 3986
- it "should normalize to 'mid/6'" do
- expect(@uri.normalize.to_s).to eq("mid/6")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://www.example.com///../'" do
- before do
- @uri = Addressable::URI.parse('http://www.example.com///../')
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-
- it "should normalize to 'http://www.example.com//'" do
- expect(@uri.normalize.to_s).to eq("http://www.example.com//")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/path/to/resource/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/path/to/resource/")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'example.com'" do
- expect(@uri.authority).to eq("example.com")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/path/to/resource/'" do
- expect(@uri.path).to eq("/path/to/resource/")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should be considered absolute" do
- expect(@uri).to be_absolute
- end
-
- it "should not be considered relative" do
- expect(@uri).not_to be_relative
- end
-
- it "should be exactly equal to http://example.com:8080/" do
- expect(@uri.eql?(Addressable::URI.parse(
- "http://example.com/path/to/resource/"))).to eq(true)
- end
-
- it "should have a route of 'resource/' from " +
- "'http://example.com/path/to/'" do
- expect(@uri.route_from("http://example.com/path/to/")).to eq(
- Addressable::URI.parse("resource/")
- )
- end
-
- it "should have a route of '../' from " +
- "'http://example.com/path/to/resource/sub'" do
- expect(@uri.route_from("http://example.com/path/to/resource/sub")).to eq(
- Addressable::URI.parse("../")
- )
- end
-
-
- it "should have a route of 'resource/' from " +
- "'http://example.com/path/to/another'" do
- expect(@uri.route_from("http://example.com/path/to/another")).to eq(
- Addressable::URI.parse("resource/")
- )
- end
-
- it "should have a route of 'resource/' from " +
- "'http://example.com/path/to/res'" do
- expect(@uri.route_from("http://example.com/path/to/res")).to eq(
- Addressable::URI.parse("resource/")
- )
- end
-
- it "should have a route of 'resource/' from " +
- "'http://example.com:80/path/to/'" do
- expect(@uri.route_from("http://example.com:80/path/to/")).to eq(
- Addressable::URI.parse("resource/")
- )
- end
-
- it "should have a route of 'http://example.com/path/to/' from " +
- "'http://example.com:8080/path/to/'" do
- expect(@uri.route_from("http://example.com:8080/path/to/")).to eq(
- Addressable::URI.parse("http://example.com/path/to/resource/")
- )
- end
-
- it "should have a route of 'http://example.com/path/to/' from " +
- "'http://user:pass@example.com/path/to/'" do
- expect(@uri.route_from("http://user:pass@example.com/path/to/")).to eq(
- Addressable::URI.parse("http://example.com/path/to/resource/")
- )
- end
-
- it "should have a route of '../../path/to/resource/' from " +
- "'http://example.com/to/resource/'" do
- expect(@uri.route_from("http://example.com/to/resource/")).to eq(
- Addressable::URI.parse("../../path/to/resource/")
- )
- end
-
- it "should correctly convert to a hash" do
- expect(@uri.to_hash).to eq({
- :scheme => "http",
- :user => nil,
- :password => nil,
- :host => "example.com",
- :port => nil,
- :path => "/path/to/resource/",
- :query => nil,
- :fragment => nil
- })
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'relative/path/to/resource'" do
- before do
- @uri = Addressable::URI.parse("relative/path/to/resource")
- end
-
- it "should not have a scheme" do
- expect(@uri.scheme).to eq(nil)
- end
-
- it "should not be considered ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should not have an authority segment" do
- expect(@uri.authority).to eq(nil)
- end
-
- it "should not have a host" do
- expect(@uri.host).to eq(nil)
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should not have a port" do
- expect(@uri.port).to eq(nil)
- end
-
- it "should have a path of 'relative/path/to/resource'" do
- expect(@uri.path).to eq("relative/path/to/resource")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should not be considered absolute" do
- expect(@uri).not_to be_absolute
- end
-
- it "should be considered relative" do
- expect(@uri).to be_relative
- end
-
- it "should raise an error if routing is attempted" do
- expect do
- @uri.route_to("http://example.com/")
- end.to raise_error(ArgumentError, /relative\/path\/to\/resource/)
- expect do
- @uri.route_from("http://example.com/")
- end.to raise_error(ArgumentError, /relative\/path\/to\/resource/)
- end
-
- it "when joined with 'another/relative/path' should be " +
- "'relative/path/to/another/relative/path'" do
- expect(@uri.join('another/relative/path')).to eq(
- Addressable::URI.parse("relative/path/to/another/relative/path")
- )
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'relative_path_with_no_slashes'" do
- before do
- @uri = Addressable::URI.parse("relative_path_with_no_slashes")
- end
-
- it "should not have a scheme" do
- expect(@uri.scheme).to eq(nil)
- end
-
- it "should not be considered ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should not have an authority segment" do
- expect(@uri.authority).to eq(nil)
- end
-
- it "should not have a host" do
- expect(@uri.host).to eq(nil)
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should not have a port" do
- expect(@uri.port).to eq(nil)
- end
-
- it "should have a path of 'relative_path_with_no_slashes'" do
- expect(@uri.path).to eq("relative_path_with_no_slashes")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should not be considered absolute" do
- expect(@uri).not_to be_absolute
- end
-
- it "should be considered relative" do
- expect(@uri).to be_relative
- end
-
- it "when joined with 'another_relative_path' should be " +
- "'another_relative_path'" do
- expect(@uri.join('another_relative_path')).to eq(
- Addressable::URI.parse("another_relative_path")
- )
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/file.txt'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/file.txt")
- end
-
- it "should have a scheme of 'http'" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'example.com'" do
- expect(@uri.authority).to eq("example.com")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/file.txt'" do
- expect(@uri.path).to eq("/file.txt")
- end
-
- it "should have a basename of 'file.txt'" do
- expect(@uri.basename).to eq("file.txt")
- end
-
- it "should have an extname of '.txt'" do
- expect(@uri.extname).to eq(".txt")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/file.txt;parameter'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/file.txt;parameter")
- end
-
- it "should have a scheme of 'http'" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'example.com'" do
- expect(@uri.authority).to eq("example.com")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/file.txt;parameter'" do
- expect(@uri.path).to eq("/file.txt;parameter")
- end
-
- it "should have a basename of 'file.txt'" do
- expect(@uri.basename).to eq("file.txt")
- end
-
- it "should have an extname of '.txt'" do
- expect(@uri.extname).to eq(".txt")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/file.txt;x=y'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/file.txt;x=y")
- end
-
- it "should have a scheme of 'http'" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have a scheme of 'http'" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'example.com'" do
- expect(@uri.authority).to eq("example.com")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have no username" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/file.txt;x=y'" do
- expect(@uri.path).to eq("/file.txt;x=y")
- end
-
- it "should have an extname of '.txt'" do
- expect(@uri.extname).to eq(".txt")
- end
-
- it "should have no query string" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have no fragment" do
- expect(@uri.fragment).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'svn+ssh://developername@rubyforge.org/var/svn/project'" do
- before do
- @uri = Addressable::URI.parse(
- "svn+ssh://developername@rubyforge.org/var/svn/project"
- )
- end
-
- it "should have a scheme of 'svn+ssh'" do
- expect(@uri.scheme).to eq("svn+ssh")
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).to be_ip_based
- end
-
- it "should have a path of '/var/svn/project'" do
- expect(@uri.path).to eq("/var/svn/project")
- end
-
- it "should have a username of 'developername'" do
- expect(@uri.user).to eq("developername")
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'ssh+svn://developername@RUBYFORGE.ORG/var/svn/project'" do
- before do
- @uri = Addressable::URI.parse(
- "ssh+svn://developername@RUBYFORGE.ORG/var/svn/project"
- )
- end
-
- it "should have a scheme of 'ssh+svn'" do
- expect(@uri.scheme).to eq("ssh+svn")
- end
-
- it "should have a normalized scheme of 'svn+ssh'" do
- expect(@uri.normalized_scheme).to eq("svn+ssh")
- end
-
- it "should have a normalized site of 'svn+ssh'" do
- expect(@uri.normalized_site).to eq("svn+ssh://developername@rubyforge.org")
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should have a path of '/var/svn/project'" do
- expect(@uri.path).to eq("/var/svn/project")
- end
-
- it "should have a username of 'developername'" do
- expect(@uri.user).to eq("developername")
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should not be considered to be in normal form" do
- expect(@uri.normalize).not_to be_eql(@uri)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'mailto:user@example.com'" do
- before do
- @uri = Addressable::URI.parse("mailto:user@example.com")
- end
-
- it "should have a scheme of 'mailto'" do
- expect(@uri.scheme).to eq("mailto")
- end
-
- it "should not be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should have a path of 'user@example.com'" do
- expect(@uri.path).to eq("user@example.com")
- end
-
- it "should have no user" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'tag:example.com,2006-08-18:/path/to/something'" do
- before do
- @uri = Addressable::URI.parse(
- "tag:example.com,2006-08-18:/path/to/something")
- end
-
- it "should have a scheme of 'tag'" do
- expect(@uri.scheme).to eq("tag")
- end
-
- it "should be considered to be ip-based" do
- expect(@uri).not_to be_ip_based
- end
-
- it "should have a path of " +
- "'example.com,2006-08-18:/path/to/something'" do
- expect(@uri.path).to eq("example.com,2006-08-18:/path/to/something")
- end
-
- it "should have no user" do
- expect(@uri.user).to eq(nil)
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/x;y/'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/x;y/")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?x=1&y=2'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?x=1&y=2")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'view-source:http://example.com/'" do
- before do
- @uri = Addressable::URI.parse("view-source:http://example.com/")
- end
-
- it "should have a scheme of 'view-source'" do
- expect(@uri.scheme).to eq("view-source")
- end
-
- it "should have a path of 'http://example.com/'" do
- expect(@uri.path).to eq("http://example.com/")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://user:pass@example.com/path/to/resource?query=x#fragment'" do
- before do
- @uri = Addressable::URI.parse(
- "http://user:pass@example.com/path/to/resource?query=x#fragment")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have an authority segment of 'user:pass@example.com'" do
- expect(@uri.authority).to eq("user:pass@example.com")
- end
-
- it "should have a username of 'user'" do
- expect(@uri.user).to eq("user")
- end
-
- it "should have a password of 'pass'" do
- expect(@uri.password).to eq("pass")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/path/to/resource'" do
- expect(@uri.path).to eq("/path/to/resource")
- end
-
- it "should have a query string of 'query=x'" do
- expect(@uri.query).to eq("query=x")
- end
-
- it "should have a fragment of 'fragment'" do
- expect(@uri.fragment).to eq("fragment")
- end
-
- it "should be considered to be in normal form" do
- expect(@uri.normalize).to be_eql(@uri)
- end
-
- it "should have a route of '../../' to " +
- "'http://user:pass@example.com/path/'" do
- expect(@uri.route_to("http://user:pass@example.com/path/")).to eq(
- Addressable::URI.parse("../../")
- )
- end
-
- it "should have a route of 'to/resource?query=x#fragment' " +
- "from 'http://user:pass@example.com/path/'" do
- expect(@uri.route_from("http://user:pass@example.com/path/")).to eq(
- Addressable::URI.parse("to/resource?query=x#fragment")
- )
- end
-
- it "should have a route of '?query=x#fragment' " +
- "from 'http://user:pass@example.com/path/to/resource'" do
- expect(@uri.route_from("http://user:pass@example.com/path/to/resource")).to eq(
- Addressable::URI.parse("?query=x#fragment")
- )
- end
-
- it "should have a route of '#fragment' " +
- "from 'http://user:pass@example.com/path/to/resource?query=x'" do
- expect(@uri.route_from(
- "http://user:pass@example.com/path/to/resource?query=x")).to eq(
- Addressable::URI.parse("#fragment")
- )
- end
-
- it "should have a route of '#fragment' from " +
- "'http://user:pass@example.com/path/to/resource?query=x#fragment'" do
- expect(@uri.route_from(
- "http://user:pass@example.com/path/to/resource?query=x#fragment"
- )).to eq(Addressable::URI.parse("#fragment"))
- end
-
- it "should have a route of 'http://elsewhere.com/' to " +
- "'http://elsewhere.com/'" do
- expect(@uri.route_to("http://elsewhere.com/")).to eq(
- Addressable::URI.parse("http://elsewhere.com/")
- )
- end
-
- it "should have a route of " +
- "'http://user:pass@example.com/path/to/resource?query=x#fragment' " +
- "from 'http://example.com/path/to/'" do
- expect(@uri.route_from("http://elsewhere.com/path/to/")).to eq(
- Addressable::URI.parse(
- "http://user:pass@example.com/path/to/resource?query=x#fragment")
- )
- end
-
- it "should have the correct scheme after assignment" do
- @uri.scheme = "ftp"
- expect(@uri.scheme).to eq("ftp")
- expect(@uri.to_s).to eq(
- "ftp://user:pass@example.com/path/to/resource?query=x#fragment"
- )
- expect(@uri.to_str).to eq(
- "ftp://user:pass@example.com/path/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct site segment after assignment" do
- @uri.site = "https://newuser:newpass@example.com:443"
- expect(@uri.scheme).to eq("https")
- expect(@uri.authority).to eq("newuser:newpass@example.com:443")
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("newpass")
- expect(@uri.userinfo).to eq("newuser:newpass")
- expect(@uri.normalized_userinfo).to eq("newuser:newpass")
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(443)
- expect(@uri.inferred_port).to eq(443)
- expect(@uri.to_s).to eq(
- "https://newuser:newpass@example.com:443" +
- "/path/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct authority segment after assignment" do
- @uri.authority = "newuser:newpass@example.com:80"
- expect(@uri.authority).to eq("newuser:newpass@example.com:80")
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("newpass")
- expect(@uri.userinfo).to eq("newuser:newpass")
- expect(@uri.normalized_userinfo).to eq("newuser:newpass")
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(80)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq(
- "http://newuser:newpass@example.com:80" +
- "/path/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct userinfo segment after assignment" do
- @uri.userinfo = "newuser:newpass"
- expect(@uri.userinfo).to eq("newuser:newpass")
- expect(@uri.authority).to eq("newuser:newpass@example.com")
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("newpass")
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(nil)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq(
- "http://newuser:newpass@example.com" +
- "/path/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct username after assignment" do
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- expect(@uri.authority).to eq("newuser:pass@example.com")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- expect(@uri.authority).to eq("user:newpass@example.com")
- end
-
- it "should have the correct host after assignment" do
- @uri.host = "newexample.com"
- expect(@uri.host).to eq("newexample.com")
- expect(@uri.authority).to eq("user:pass@newexample.com")
- end
-
- it "should have the correct host after assignment" do
- @uri.hostname = "newexample.com"
- expect(@uri.host).to eq("newexample.com")
- expect(@uri.hostname).to eq("newexample.com")
- expect(@uri.authority).to eq("user:pass@newexample.com")
- end
-
- it "should raise an error if assigning a bogus object to the hostname" do
- expect do
- @uri.hostname = Object.new
- end.to raise_error(TypeError)
- end
-
- it "should have the correct port after assignment" do
- @uri.port = 8080
- expect(@uri.port).to eq(8080)
- expect(@uri.authority).to eq("user:pass@example.com:8080")
- end
-
- it "should have the correct origin after assignment" do
- @uri.origin = "http://newexample.com"
- expect(@uri.host).to eq("newexample.com")
- expect(@uri.authority).to eq("newexample.com")
- end
-
- it "should have the correct path after assignment" do
- @uri.path = "/newpath/to/resource"
- expect(@uri.path).to eq("/newpath/to/resource")
- expect(@uri.to_s).to eq(
- "http://user:pass@example.com/newpath/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct scheme and authority after nil assignment" do
- @uri.site = nil
- expect(@uri.scheme).to eq(nil)
- expect(@uri.authority).to eq(nil)
- expect(@uri.to_s).to eq("/path/to/resource?query=x#fragment")
- end
-
- it "should have the correct scheme and authority after assignment" do
- @uri.site = "file://"
- expect(@uri.scheme).to eq("file")
- expect(@uri.authority).to eq("")
- expect(@uri.to_s).to eq("file:///path/to/resource?query=x#fragment")
- end
-
- it "should have the correct path after nil assignment" do
- @uri.path = nil
- expect(@uri.path).to eq("")
- expect(@uri.to_s).to eq(
- "http://user:pass@example.com?query=x#fragment"
- )
- end
-
- it "should have the correct query string after assignment" do
- @uri.query = "newquery=x"
- expect(@uri.query).to eq("newquery=x")
- expect(@uri.to_s).to eq(
- "http://user:pass@example.com/path/to/resource?newquery=x#fragment"
- )
- @uri.query = nil
- expect(@uri.query).to eq(nil)
- expect(@uri.to_s).to eq(
- "http://user:pass@example.com/path/to/resource#fragment"
- )
- end
-
- it "should have the correct query string after hash assignment" do
- @uri.query_values = {"?uestion mark" => "=sign", "hello" => "g\xC3\xBCnther"}
- expect(@uri.query.split("&")).to include("%3Fuestion%20mark=%3Dsign")
- expect(@uri.query.split("&")).to include("hello=g%C3%BCnther")
- expect(@uri.query_values).to eq({
- "?uestion mark" => "=sign", "hello" => "g\xC3\xBCnther"
- })
- end
-
- it "should have the correct query string after flag hash assignment" do
- @uri.query_values = {'flag?1' => nil, 'fl=ag2' => nil, 'flag3' => nil}
- expect(@uri.query.split("&")).to include("flag%3F1")
- expect(@uri.query.split("&")).to include("fl%3Dag2")
- expect(@uri.query.split("&")).to include("flag3")
- expect(@uri.query_values(Array).sort).to eq([["fl=ag2"], ["flag3"], ["flag?1"]])
- expect(@uri.query_values(Hash)).to eq({
- 'flag?1' => nil, 'fl=ag2' => nil, 'flag3' => nil
- })
- end
-
- it "should raise an error if query values are set to a bogus type" do
- expect do
- @uri.query_values = "bogus"
- end.to raise_error(TypeError)
- end
-
- it "should have the correct fragment after assignment" do
- @uri.fragment = "newfragment"
- expect(@uri.fragment).to eq("newfragment")
- expect(@uri.to_s).to eq(
- "http://user:pass@example.com/path/to/resource?query=x#newfragment"
- )
-
- @uri.fragment = nil
- expect(@uri.fragment).to eq(nil)
- expect(@uri.to_s).to eq(
- "http://user:pass@example.com/path/to/resource?query=x"
- )
- end
-
- it "should have the correct values after a merge" do
- expect(@uri.merge(:fragment => "newfragment").to_s).to eq(
- "http://user:pass@example.com/path/to/resource?query=x#newfragment"
- )
- end
-
- it "should have the correct values after a merge" do
- expect(@uri.merge(:fragment => nil).to_s).to eq(
- "http://user:pass@example.com/path/to/resource?query=x"
- )
- end
-
- it "should have the correct values after a merge" do
- expect(@uri.merge(:userinfo => "newuser:newpass").to_s).to eq(
- "http://newuser:newpass@example.com/path/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct values after a merge" do
- expect(@uri.merge(:userinfo => nil).to_s).to eq(
- "http://example.com/path/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct values after a merge" do
- expect(@uri.merge(:path => "newpath").to_s).to eq(
- "http://user:pass@example.com/newpath?query=x#fragment"
- )
- end
-
- it "should have the correct values after a merge" do
- expect(@uri.merge(:port => "42", :path => "newpath", :query => "").to_s).to eq(
- "http://user:pass@example.com:42/newpath?#fragment"
- )
- end
-
- it "should have the correct values after a merge" do
- expect(@uri.merge(:authority => "foo:bar@baz:42").to_s).to eq(
- "http://foo:bar@baz:42/path/to/resource?query=x#fragment"
- )
- # Ensure the operation was not destructive
- expect(@uri.to_s).to eq(
- "http://user:pass@example.com/path/to/resource?query=x#fragment"
- )
- end
-
- it "should have the correct values after a destructive merge" do
- @uri.merge!(:authority => "foo:bar@baz:42")
- # Ensure the operation was destructive
- expect(@uri.to_s).to eq(
- "http://foo:bar@baz:42/path/to/resource?query=x#fragment"
- )
- end
-
- it "should fail to merge with bogus values" do
- expect do
- @uri.merge(:port => "bogus")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should fail to merge with bogus values" do
- expect do
- @uri.merge(:authority => "bar@baz:bogus")
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should fail to merge with bogus parameters" do
- expect do
- @uri.merge(42)
- end.to raise_error(TypeError)
- end
-
- it "should fail to merge with bogus parameters" do
- expect do
- @uri.merge("http://example.com/")
- end.to raise_error(TypeError)
- end
-
- it "should fail to merge with both authority and subcomponents" do
- expect do
- @uri.merge(:authority => "foo:bar@baz:42", :port => "42")
- end.to raise_error(ArgumentError)
- end
-
- it "should fail to merge with both userinfo and subcomponents" do
- expect do
- @uri.merge(:userinfo => "foo:bar", :user => "foo")
- end.to raise_error(ArgumentError)
- end
-
- it "should be identical to its duplicate" do
- expect(@uri).to eq(@uri.dup)
- end
-
- it "should have an origin of 'http://example.com'" do
- expect(@uri.origin).to eq('http://example.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/search?q=Q%26A'" do
-
- before do
- @uri = Addressable::URI.parse("http://example.com/search?q=Q%26A")
- end
-
- it "should have a query of 'q=Q%26A'" do
- expect(@uri.query).to eq("q=Q%26A")
- end
-
- it "should have query_values of {'q' => 'Q&A'}" do
- expect(@uri.query_values).to eq({ 'q' => 'Q&A' })
- end
-
- it "should normalize to the original uri " +
- "(with the ampersand properly percent-encoded)" do
- expect(@uri.normalize.to_s).to eq("http://example.com/search?q=Q%26A")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?&x=b'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?&x=b")
- end
-
- it "should have a query of '&x=b'" do
- expect(@uri.query).to eq("&x=b")
- end
-
- it "should have query_values of {'x' => 'b'}" do
- expect(@uri.query_values).to eq({'x' => 'b'})
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?q='one;two'&x=1'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?q='one;two'&x=1")
- end
-
- it "should have a query of 'q='one;two'&x=1'" do
- expect(@uri.query).to eq("q='one;two'&x=1")
- end
-
- it "should have query_values of {\"q\" => \"'one;two'\", \"x\" => \"1\"}" do
- expect(@uri.query_values).to eq({"q" => "'one;two'", "x" => "1"})
- end
-
- it "should escape the ';' character when normalizing to avoid ambiguity " +
- "with the W3C HTML 4.01 specification" do
- # HTML 4.01 Section B.2.2
- expect(@uri.normalize.query).to eq("q='one%3Btwo'&x=1")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?&&x=b'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?&&x=b")
- end
-
- it "should have a query of '&&x=b'" do
- expect(@uri.query).to eq("&&x=b")
- end
-
- it "should have query_values of {'x' => 'b'}" do
- expect(@uri.query_values).to eq({'x' => 'b'})
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?q=a&&x=b'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?q=a&&x=b")
- end
-
- it "should have a query of 'q=a&&x=b'" do
- expect(@uri.query).to eq("q=a&&x=b")
- end
-
- it "should have query_values of {'q' => 'a, 'x' => 'b'}" do
- expect(@uri.query_values).to eq({'q' => 'a', 'x' => 'b'})
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?q&&x=b'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?q&&x=b")
- end
-
- it "should have a query of 'q&&x=b'" do
- expect(@uri.query).to eq("q&&x=b")
- end
-
- it "should have query_values of {'q' => true, 'x' => 'b'}" do
- expect(@uri.query_values).to eq({'q' => nil, 'x' => 'b'})
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?q=a+b'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?q=a+b")
- end
-
- it "should have a query of 'q=a+b'" do
- expect(@uri.query).to eq("q=a+b")
- end
-
- it "should have query_values of {'q' => 'a b'}" do
- expect(@uri.query_values).to eq({'q' => 'a b'})
- end
-
- it "should have a normalized query of 'q=a+b'" do
- expect(@uri.normalized_query).to eq("q=a+b")
- end
-end
-
-describe Addressable::URI, "when parsed from 'https://example.com/?q=a+b'" do
- before do
- @uri = Addressable::URI.parse("https://example.com/?q=a+b")
- end
-
- it "should have query_values of {'q' => 'a b'}" do
- expect(@uri.query_values).to eq("q" => "a b")
- end
-end
-
-describe Addressable::URI, "when parsed from 'example.com?q=a+b'" do
- before do
- @uri = Addressable::URI.parse("example.com?q=a+b")
- end
-
- it "should have query_values of {'q' => 'a b'}" do
- expect(@uri.query_values).to eq("q" => "a b")
- end
-end
-
-describe Addressable::URI, "when parsed from 'mailto:?q=a+b'" do
- before do
- @uri = Addressable::URI.parse("mailto:?q=a+b")
- end
-
- it "should have query_values of {'q' => 'a+b'}" do
- expect(@uri.query_values).to eq("q" => "a+b")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?q=a%2bb'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?q=a%2bb")
- end
-
- it "should have a query of 'q=a+b'" do
- expect(@uri.query).to eq("q=a%2bb")
- end
-
- it "should have query_values of {'q' => 'a+b'}" do
- expect(@uri.query_values).to eq({'q' => 'a+b'})
- end
-
- it "should have a normalized query of 'q=a%2Bb'" do
- expect(@uri.normalized_query).to eq("q=a%2Bb")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?v=%7E&w=%&x=%25&y=%2B&z=C%CC%A7'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?v=%7E&w=%&x=%25&y=%2B&z=C%CC%A7")
- end
-
- it "should have a normalized query of 'v=~&w=%25&x=%25&y=%2B&z=%C3%87'" do
- expect(@uri.normalized_query).to eq("v=~&w=%25&x=%25&y=%2B&z=%C3%87")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?v=%7E&w=%&x=%25&y=+&z=C%CC%A7'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?v=%7E&w=%&x=%25&y=+&z=C%CC%A7")
- end
-
- it "should have a normalized query of 'v=~&w=%25&x=%25&y=+&z=%C3%87'" do
- expect(@uri.normalized_query).to eq("v=~&w=%25&x=%25&y=+&z=%C3%87")
- end
-end
-
-describe Addressable::URI, "when parsed from 'http://example/?b=1&a=2&c=3'" do
- before do
- @uri = Addressable::URI.parse("http://example/?b=1&a=2&c=3")
- end
-
- it "should have a sorted normalized query of 'a=2&b=1&c=3'" do
- expect(@uri.normalized_query(:sorted)).to eq("a=2&b=1&c=3")
- end
-end
-
-describe Addressable::URI, "when parsed from 'http://example/?&a&&c&'" do
- before do
- @uri = Addressable::URI.parse("http://example/?&a&&c&")
- end
-
- it "should have a compacted normalized query of 'a&c'" do
- expect(@uri.normalized_query(:compacted)).to eq("a&c")
- end
-end
-
-describe Addressable::URI, "when parsed from 'http://example.com/?a=1&a=1'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?a=1&a=1")
- end
-
- it "should have a compacted normalized query of 'a=1'" do
- expect(@uri.normalized_query(:compacted)).to eq("a=1")
- end
-end
-
-describe Addressable::URI, "when parsed from 'http://example.com/?a=1&a=2'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?a=1&a=2")
- end
-
- it "should have a compacted normalized query of 'a=1&a=2'" do
- expect(@uri.normalized_query(:compacted)).to eq("a=1&a=2")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/sound%2bvision'" do
- before do
- @uri = Addressable::URI.parse("http://example.com/sound%2bvision")
- end
-
- it "should have a normalized path of '/sound+vision'" do
- expect(@uri.normalized_path).to eq('/sound+vision')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/?q='" do
- before do
- @uri = Addressable::URI.parse("http://example.com/?q=")
- end
-
- it "should have a query of 'q='" do
- expect(@uri.query).to eq("q=")
- end
-
- it "should have query_values of {'q' => ''}" do
- expect(@uri.query_values).to eq({'q' => ''})
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://user@example.com'" do
- before do
- @uri = Addressable::URI.parse("http://user@example.com")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have a username of 'user'" do
- expect(@uri.user).to eq("user")
- end
-
- it "should have no password" do
- expect(@uri.password).to eq(nil)
- end
-
- it "should have a userinfo of 'user'" do
- expect(@uri.userinfo).to eq("user")
- end
-
- it "should have a normalized userinfo of 'user'" do
- expect(@uri.normalized_userinfo).to eq("user")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have default_port 80" do
- expect(@uri.default_port).to eq(80)
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have the correct username after assignment" do
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq(nil)
- expect(@uri.to_s).to eq("http://newuser@example.com")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- expect(@uri.to_s).to eq("http://user:newpass@example.com")
- end
-
- it "should have the correct userinfo segment after assignment" do
- @uri.userinfo = "newuser:newpass"
- expect(@uri.userinfo).to eq("newuser:newpass")
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("newpass")
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(nil)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq("http://newuser:newpass@example.com")
- end
-
- it "should have the correct userinfo segment after nil assignment" do
- @uri.userinfo = nil
- expect(@uri.userinfo).to eq(nil)
- expect(@uri.user).to eq(nil)
- expect(@uri.password).to eq(nil)
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(nil)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq("http://example.com")
- end
-
- it "should have the correct authority segment after assignment" do
- @uri.authority = "newuser@example.com"
- expect(@uri.authority).to eq("newuser@example.com")
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq(nil)
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(nil)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq("http://newuser@example.com")
- end
-
- it "should raise an error after nil assignment of authority segment" do
- expect do
- # This would create an invalid URI
- @uri.authority = nil
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://user:@example.com'" do
- before do
- @uri = Addressable::URI.parse("http://user:@example.com")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have a username of 'user'" do
- expect(@uri.user).to eq("user")
- end
-
- it "should have a password of ''" do
- expect(@uri.password).to eq("")
- end
-
- it "should have a normalized userinfo of 'user:'" do
- expect(@uri.normalized_userinfo).to eq("user:")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have the correct username after assignment" do
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("")
- expect(@uri.to_s).to eq("http://newuser:@example.com")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- expect(@uri.to_s).to eq("http://user:newpass@example.com")
- end
-
- it "should have the correct authority segment after assignment" do
- @uri.authority = "newuser:@example.com"
- expect(@uri.authority).to eq("newuser:@example.com")
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("")
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(nil)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq("http://newuser:@example.com")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://:pass@example.com'" do
- before do
- @uri = Addressable::URI.parse("http://:pass@example.com")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have a username of ''" do
- expect(@uri.user).to eq("")
- end
-
- it "should have a password of 'pass'" do
- expect(@uri.password).to eq("pass")
- end
-
- it "should have a userinfo of ':pass'" do
- expect(@uri.userinfo).to eq(":pass")
- end
-
- it "should have a normalized userinfo of ':pass'" do
- expect(@uri.normalized_userinfo).to eq(":pass")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have the correct username after assignment" do
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("pass")
- expect(@uri.to_s).to eq("http://newuser:pass@example.com")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- expect(@uri.user).to eq("")
- expect(@uri.to_s).to eq("http://:newpass@example.com")
- end
-
- it "should have the correct authority segment after assignment" do
- @uri.authority = ":newpass@example.com"
- expect(@uri.authority).to eq(":newpass@example.com")
- expect(@uri.user).to eq("")
- expect(@uri.password).to eq("newpass")
- expect(@uri.host).to eq("example.com")
- expect(@uri.port).to eq(nil)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq("http://:newpass@example.com")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://:@example.com'" do
- before do
- @uri = Addressable::URI.parse("http://:@example.com")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have a username of ''" do
- expect(@uri.user).to eq("")
- end
-
- it "should have a password of ''" do
- expect(@uri.password).to eq("")
- end
-
- it "should have a normalized userinfo of nil" do
- expect(@uri.normalized_userinfo).to eq(nil)
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have the correct username after assignment" do
- @uri.user = "newuser"
- expect(@uri.user).to eq("newuser")
- expect(@uri.password).to eq("")
- expect(@uri.to_s).to eq("http://newuser:@example.com")
- end
-
- it "should have the correct password after assignment" do
- @uri.password = "newpass"
- expect(@uri.password).to eq("newpass")
- expect(@uri.user).to eq("")
- expect(@uri.to_s).to eq("http://:newpass@example.com")
- end
-
- it "should have the correct authority segment after assignment" do
- @uri.authority = ":@newexample.com"
- expect(@uri.authority).to eq(":@newexample.com")
- expect(@uri.user).to eq("")
- expect(@uri.password).to eq("")
- expect(@uri.host).to eq("newexample.com")
- expect(@uri.port).to eq(nil)
- expect(@uri.inferred_port).to eq(80)
- expect(@uri.to_s).to eq("http://:@newexample.com")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'#example'" do
- before do
- @uri = Addressable::URI.parse("#example")
- end
-
- it "should be considered relative" do
- expect(@uri).to be_relative
- end
-
- it "should have a host of nil" do
- expect(@uri.host).to eq(nil)
- end
-
- it "should have a site of nil" do
- expect(@uri.site).to eq(nil)
- end
-
- it "should have a normalized_site of nil" do
- expect(@uri.normalized_site).to eq(nil)
- end
-
- it "should have a path of ''" do
- expect(@uri.path).to eq("")
- end
-
- it "should have a query string of nil" do
- expect(@uri.query).to eq(nil)
- end
-
- it "should have a fragment of 'example'" do
- expect(@uri.fragment).to eq("example")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "the network-path reference '//example.com/'" do
- before do
- @uri = Addressable::URI.parse("//example.com/")
- end
-
- it "should be considered relative" do
- expect(@uri).to be_relative
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should have a path of '/'" do
- expect(@uri.path).to eq("/")
- end
-
- it "should raise an error if routing is attempted" do
- expect do
- @uri.route_to("http://example.com/")
- end.to raise_error(ArgumentError, /\/\/example.com\//)
- expect do
- @uri.route_from("http://example.com/")
- end.to raise_error(ArgumentError, /\/\/example.com\//)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'feed://http://example.com/'" do
- before do
- @uri = Addressable::URI.parse("feed://http://example.com/")
- end
-
- it "should have a host of 'http'" do
- expect(@uri.host).to eq("http")
- end
-
- it "should have a path of '//example.com/'" do
- expect(@uri.path).to eq("//example.com/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'feed:http://example.com/'" do
- before do
- @uri = Addressable::URI.parse("feed:http://example.com/")
- end
-
- it "should have a path of 'http://example.com/'" do
- expect(@uri.path).to eq("http://example.com/")
- end
-
- it "should normalize to 'http://example.com/'" do
- expect(@uri.normalize.to_s).to eq("http://example.com/")
- expect(@uri.normalize!.to_s).to eq("http://example.com/")
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'example://a/b/c/%7Bfoo%7D'" do
- before do
- @uri = Addressable::URI.parse("example://a/b/c/%7Bfoo%7D")
- end
-
- # Section 6.2.2 of RFC 3986
- it "should be equivalent to eXAMPLE://a/./b/../b/%63/%7bfoo%7d" do
- expect(@uri).to eq(
- Addressable::URI.parse("eXAMPLE://a/./b/../b/%63/%7bfoo%7d")
- )
- end
-
- it "should have an origin of 'example://a'" do
- expect(@uri.origin).to eq('example://a')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://example.com/indirect/path/./to/../resource/'" do
- before do
- @uri = Addressable::URI.parse(
- "http://example.com/indirect/path/./to/../resource/")
- end
-
- it "should use the 'http' scheme" do
- expect(@uri.scheme).to eq("http")
- end
-
- it "should have a host of 'example.com'" do
- expect(@uri.host).to eq("example.com")
- end
-
- it "should use port 80" do
- expect(@uri.inferred_port).to eq(80)
- end
-
- it "should have a path of '/indirect/path/./to/../resource/'" do
- expect(@uri.path).to eq("/indirect/path/./to/../resource/")
- end
-
- # Section 6.2.2.3 of RFC 3986
- it "should have a normalized path of '/indirect/path/resource/'" do
- expect(@uri.normalize.path).to eq("/indirect/path/resource/")
- expect(@uri.normalize!.path).to eq("/indirect/path/resource/")
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://under_score.example.com/'" do
- it "should not cause an error" do
- expect do
- Addressable::URI.parse("http://under_score.example.com/")
- end.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'./this:that'" do
- before do
- @uri = Addressable::URI.parse("./this:that")
- end
-
- it "should be considered relative" do
- expect(@uri).to be_relative
- end
-
- it "should have no scheme" do
- expect(@uri.scheme).to eq(nil)
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'this:that'" do
- before do
- @uri = Addressable::URI.parse("this:that")
- end
-
- it "should be considered absolute" do
- expect(@uri).to be_absolute
- end
-
- it "should have a scheme of 'this'" do
- expect(@uri.scheme).to eq("this")
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from '?'" do
- before do
- @uri = Addressable::URI.parse("?")
- end
-
- it "should normalize to ''" do
- expect(@uri.normalize.to_s).to eq("")
- end
-
- it "should have the correct return type" do
- expect(@uri.query_values).to eq({})
- expect(@uri.query_values(Hash)).to eq({})
- expect(@uri.query_values(Array)).to eq([])
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from '?one=1&two=2&three=3'" do
- before do
- @uri = Addressable::URI.parse("?one=1&two=2&three=3")
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({"one" => "1", "two" => "2", "three" => "3"})
- end
-
- it "should raise an error for invalid return type values" do
- expect do
- @uri.query_values(Integer)
- end.to raise_error(ArgumentError)
- end
-
- it "should have the correct array query values" do
- expect(@uri.query_values(Array)).to eq([
- ["one", "1"], ["two", "2"], ["three", "3"]
- ])
- end
-
- it "should have a 'null' origin" do
- expect(@uri.origin).to eq('null')
- end
-end
-
-describe Addressable::URI, "when parsed from '?one=1=uno&two=2=dos'" do
- before do
- @uri = Addressable::URI.parse("?one=1=uno&two=2=dos")
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({"one" => "1=uno", "two" => "2=dos"})
- end
-
- it "should have the correct array query values" do
- expect(@uri.query_values(Array)).to eq([
- ["one", "1=uno"], ["two", "2=dos"]
- ])
- end
-end
-
-describe Addressable::URI, "when parsed from '?one[two][three]=four'" do
- before do
- @uri = Addressable::URI.parse("?one[two][three]=four")
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({"one[two][three]" => "four"})
- end
-
- it "should have the correct array query values" do
- expect(@uri.query_values(Array)).to eq([
- ["one[two][three]", "four"]
- ])
- end
-end
-
-describe Addressable::URI, "when parsed from '?one.two.three=four'" do
- before do
- @uri = Addressable::URI.parse("?one.two.three=four")
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({
- "one.two.three" => "four"
- })
- end
-
- it "should have the correct array query values" do
- expect(@uri.query_values(Array)).to eq([
- ["one.two.three", "four"]
- ])
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'?one[two][three]=four&one[two][five]=six'" do
- before do
- @uri = Addressable::URI.parse("?one[two][three]=four&one[two][five]=six")
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({
- "one[two][three]" => "four", "one[two][five]" => "six"
- })
- end
-
- it "should have the correct array query values" do
- expect(@uri.query_values(Array)).to eq([
- ["one[two][three]", "four"], ["one[two][five]", "six"]
- ])
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'?one.two.three=four&one.two.five=six'" do
- before do
- @uri = Addressable::URI.parse("?one.two.three=four&one.two.five=six")
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({
- "one.two.three" => "four", "one.two.five" => "six"
- })
- end
-
- it "should have the correct array query values" do
- expect(@uri.query_values(Array)).to eq([
- ["one.two.three", "four"], ["one.two.five", "six"]
- ])
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'?one=two&one=three'" do
- before do
- @uri = Addressable::URI.parse(
- "?one=two&one=three&one=four"
- )
- end
-
- it "should have correct array query values" do
- expect(@uri.query_values(Array)).to eq(
- [['one', 'two'], ['one', 'three'], ['one', 'four']]
- )
- end
-
- it "should have correct hash query values" do
- skip("This is probably more desirable behavior.")
- expect(@uri.query_values(Hash)).to eq(
- {'one' => ['two', 'three', 'four']}
- )
- end
-
- it "should handle assignment with keys of mixed type" do
- @uri.query_values = @uri.query_values(Hash).merge({:one => 'three'})
- expect(@uri.query_values(Hash)).to eq({'one' => 'three'})
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'?one[two][three][]=four&one[two][three][]=five'" do
- before do
- @uri = Addressable::URI.parse(
- "?one[two][three][]=four&one[two][three][]=five"
- )
- end
-
- it "should have correct query values" do
- expect(@uri.query_values(Hash)).to eq({"one[two][three][]" => "five"})
- end
-
- it "should have correct array query values" do
- expect(@uri.query_values(Array)).to eq([
- ["one[two][three][]", "four"], ["one[two][three][]", "five"]
- ])
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'?one[two][three][0]=four&one[two][three][1]=five'" do
- before do
- @uri = Addressable::URI.parse(
- "?one[two][three][0]=four&one[two][three][1]=five"
- )
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({
- "one[two][three][0]" => "four", "one[two][three][1]" => "five"
- })
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'?one[two][three][1]=four&one[two][three][0]=five'" do
- before do
- @uri = Addressable::URI.parse(
- "?one[two][three][1]=four&one[two][three][0]=five"
- )
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({
- "one[two][three][1]" => "four", "one[two][three][0]" => "five"
- })
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'?one[two][three][2]=four&one[two][three][1]=five'" do
- before do
- @uri = Addressable::URI.parse(
- "?one[two][three][2]=four&one[two][three][1]=five"
- )
- end
-
- it "should have the correct query values" do
- expect(@uri.query_values).to eq({
- "one[two][three][2]" => "four", "one[two][three][1]" => "five"
- })
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://www.詹姆斯.com/'" do
- before do
- @uri = Addressable::URI.parse("http://www.詹姆斯.com/")
- end
-
- it "should be equivalent to 'http://www.xn--8ws00zhy3a.com/'" do
- expect(@uri).to eq(
- Addressable::URI.parse("http://www.xn--8ws00zhy3a.com/")
- )
- end
-
- it "should not have domain name encoded during normalization" do
- expect(Addressable::URI.normalized_encode(@uri.to_s)).to eq(
- "http://www.詹姆斯.com/"
- )
- end
-
- it "should have an origin of 'http://www.xn--8ws00zhy3a.com'" do
- expect(@uri.origin).to eq('http://www.xn--8ws00zhy3a.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://www.詹姆斯.com/ some spaces /'" do
- before do
- @uri = Addressable::URI.parse("http://www.詹姆斯.com/ some spaces /")
- end
-
- it "should be equivalent to " +
- "'http://www.xn--8ws00zhy3a.com/%20some%20spaces%20/'" do
- expect(@uri).to eq(
- Addressable::URI.parse(
- "http://www.xn--8ws00zhy3a.com/%20some%20spaces%20/")
- )
- end
-
- it "should not have domain name encoded during normalization" do
- expect(Addressable::URI.normalized_encode(@uri.to_s)).to eq(
- "http://www.詹姆斯.com/%20some%20spaces%20/"
- )
- end
-
- it "should have an origin of 'http://www.xn--8ws00zhy3a.com'" do
- expect(@uri.origin).to eq('http://www.xn--8ws00zhy3a.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://www.xn--8ws00zhy3a.com/'" do
- before do
- @uri = Addressable::URI.parse("http://www.xn--8ws00zhy3a.com/")
- end
-
- it "should be displayed as http://www.詹姆斯.com/" do
- expect(@uri.display_uri.to_s).to eq("http://www.詹姆斯.com/")
- end
-
- it "should properly force the encoding" do
- display_string = @uri.display_uri.to_str
- expect(display_string).to eq("http://www.詹姆斯.com/")
- if display_string.respond_to?(:encoding)
- expect(display_string.encoding.to_s).to eq(Encoding::UTF_8.to_s)
- end
- end
-
- it "should have an origin of 'http://www.xn--8ws00zhy3a.com'" do
- expect(@uri.origin).to eq('http://www.xn--8ws00zhy3a.com')
- end
-end
-
-describe Addressable::URI, "when parsed from " +
- "'http://www.詹姆斯.com/atomtests/iri/詹.html'" do
- before do
- @uri = Addressable::URI.parse("http://www.詹姆斯.com/atomtests/iri/詹.html")
- end
-
- it "should normalize to " +
- "http://www.xn--8ws00zhy3a.com/atomtests/iri/%E8%A9%B9.html" do
- expect(@uri.normalize.to_s).to eq(
- "http://www.xn--8ws00zhy3a.com/atomtests/iri/%E8%A9%B9.html"
- )
- expect(@uri.normalize!.to_s).to eq(
- "http://www.xn--8ws00zhy3a.com/atomtests/iri/%E8%A9%B9.html"
- )
- end
-end
-
-describe Addressable::URI, "when parsed from a percent-encoded IRI" do
- before do
- @uri = Addressable::URI.parse(
- "http://www.%E3%81%BB%E3%82%93%E3%81%A8%E3%81%86%E3%81%AB%E3%81%AA" +
- "%E3%81%8C%E3%81%84%E3%82%8F%E3%81%91%E3%81%AE%E3%82%8F%E3%81%8B%E3" +
- "%82%89%E3%81%AA%E3%81%84%E3%81%A9%E3%82%81%E3%81%84%E3%82%93%E3%82" +
- "%81%E3%81%84%E3%81%AE%E3%82%89%E3%81%B9%E3%82%8B%E3%81%BE%E3%81%A0" +
- "%E3%81%AA%E3%81%8C%E3%81%8F%E3%81%97%E3%81%AA%E3%81%84%E3%81%A8%E3" +
- "%81%9F%E3%82%8A%E3%81%AA%E3%81%84.w3.mag.keio.ac.jp"
- )
- end
-
- it "should normalize to something sane" do
- expect(@uri.normalize.to_s).to eq(
- "http://www.xn--n8jaaaaai5bhf7as8fsfk3jnknefdde3f" +
- "g11amb5gzdb4wi9bya3kc6lra.w3.mag.keio.ac.jp/"
- )
- expect(@uri.normalize!.to_s).to eq(
- "http://www.xn--n8jaaaaai5bhf7as8fsfk3jnknefdde3f" +
- "g11amb5gzdb4wi9bya3kc6lra.w3.mag.keio.ac.jp/"
- )
- end
-
- it "should have the correct origin" do
- expect(@uri.origin).to eq(
- "http://www.xn--n8jaaaaai5bhf7as8fsfk3jnknefdde3f" +
- "g11amb5gzdb4wi9bya3kc6lra.w3.mag.keio.ac.jp"
- )
- end
-end
-
-describe Addressable::URI, "with a base uri of 'http://a/b/c/d;p?q'" do
- before do
- @uri = Addressable::URI.parse("http://a/b/c/d;p?q")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g:h' should resolve to g:h" do
- expect((@uri + "g:h").to_s).to eq("g:h")
- expect(Addressable::URI.join(@uri, "g:h").to_s).to eq("g:h")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g' should resolve to http://a/b/c/g" do
- expect((@uri + "g").to_s).to eq("http://a/b/c/g")
- expect(Addressable::URI.join(@uri.to_s, "g").to_s).to eq("http://a/b/c/g")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with './g' should resolve to http://a/b/c/g" do
- expect((@uri + "./g").to_s).to eq("http://a/b/c/g")
- expect(Addressable::URI.join(@uri.to_s, "./g").to_s).to eq("http://a/b/c/g")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g/' should resolve to http://a/b/c/g/" do
- expect((@uri + "g/").to_s).to eq("http://a/b/c/g/")
- expect(Addressable::URI.join(@uri.to_s, "g/").to_s).to eq("http://a/b/c/g/")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '/g' should resolve to http://a/g" do
- expect((@uri + "/g").to_s).to eq("http://a/g")
- expect(Addressable::URI.join(@uri.to_s, "/g").to_s).to eq("http://a/g")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '//g' should resolve to http://g" do
- expect((@uri + "//g").to_s).to eq("http://g")
- expect(Addressable::URI.join(@uri.to_s, "//g").to_s).to eq("http://g")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '?y' should resolve to http://a/b/c/d;p?y" do
- expect((@uri + "?y").to_s).to eq("http://a/b/c/d;p?y")
- expect(Addressable::URI.join(@uri.to_s, "?y").to_s).to eq("http://a/b/c/d;p?y")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g?y' should resolve to http://a/b/c/g?y" do
- expect((@uri + "g?y").to_s).to eq("http://a/b/c/g?y")
- expect(Addressable::URI.join(@uri.to_s, "g?y").to_s).to eq("http://a/b/c/g?y")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '#s' should resolve to http://a/b/c/d;p?q#s" do
- expect((@uri + "#s").to_s).to eq("http://a/b/c/d;p?q#s")
- expect(Addressable::URI.join(@uri.to_s, "#s").to_s).to eq(
- "http://a/b/c/d;p?q#s"
- )
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g#s' should resolve to http://a/b/c/g#s" do
- expect((@uri + "g#s").to_s).to eq("http://a/b/c/g#s")
- expect(Addressable::URI.join(@uri.to_s, "g#s").to_s).to eq("http://a/b/c/g#s")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g?y#s' should resolve to http://a/b/c/g?y#s" do
- expect((@uri + "g?y#s").to_s).to eq("http://a/b/c/g?y#s")
- expect(Addressable::URI.join(
- @uri.to_s, "g?y#s").to_s).to eq("http://a/b/c/g?y#s")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with ';x' should resolve to http://a/b/c/;x" do
- expect((@uri + ";x").to_s).to eq("http://a/b/c/;x")
- expect(Addressable::URI.join(@uri.to_s, ";x").to_s).to eq("http://a/b/c/;x")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g;x' should resolve to http://a/b/c/g;x" do
- expect((@uri + "g;x").to_s).to eq("http://a/b/c/g;x")
- expect(Addressable::URI.join(@uri.to_s, "g;x").to_s).to eq("http://a/b/c/g;x")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with 'g;x?y#s' should resolve to http://a/b/c/g;x?y#s" do
- expect((@uri + "g;x?y#s").to_s).to eq("http://a/b/c/g;x?y#s")
- expect(Addressable::URI.join(
- @uri.to_s, "g;x?y#s").to_s).to eq("http://a/b/c/g;x?y#s")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '' should resolve to http://a/b/c/d;p?q" do
- expect((@uri + "").to_s).to eq("http://a/b/c/d;p?q")
- expect(Addressable::URI.join(@uri.to_s, "").to_s).to eq("http://a/b/c/d;p?q")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '.' should resolve to http://a/b/c/" do
- expect((@uri + ".").to_s).to eq("http://a/b/c/")
- expect(Addressable::URI.join(@uri.to_s, ".").to_s).to eq("http://a/b/c/")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with './' should resolve to http://a/b/c/" do
- expect((@uri + "./").to_s).to eq("http://a/b/c/")
- expect(Addressable::URI.join(@uri.to_s, "./").to_s).to eq("http://a/b/c/")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '..' should resolve to http://a/b/" do
- expect((@uri + "..").to_s).to eq("http://a/b/")
- expect(Addressable::URI.join(@uri.to_s, "..").to_s).to eq("http://a/b/")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '../' should resolve to http://a/b/" do
- expect((@uri + "../").to_s).to eq("http://a/b/")
- expect(Addressable::URI.join(@uri.to_s, "../").to_s).to eq("http://a/b/")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '../g' should resolve to http://a/b/g" do
- expect((@uri + "../g").to_s).to eq("http://a/b/g")
- expect(Addressable::URI.join(@uri.to_s, "../g").to_s).to eq("http://a/b/g")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '../..' should resolve to http://a/" do
- expect((@uri + "../..").to_s).to eq("http://a/")
- expect(Addressable::URI.join(@uri.to_s, "../..").to_s).to eq("http://a/")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '../../' should resolve to http://a/" do
- expect((@uri + "../../").to_s).to eq("http://a/")
- expect(Addressable::URI.join(@uri.to_s, "../../").to_s).to eq("http://a/")
- end
-
- # Section 5.4.1 of RFC 3986
- it "when joined with '../../g' should resolve to http://a/g" do
- expect((@uri + "../../g").to_s).to eq("http://a/g")
- expect(Addressable::URI.join(@uri.to_s, "../../g").to_s).to eq("http://a/g")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with '../../../g' should resolve to http://a/g" do
- expect((@uri + "../../../g").to_s).to eq("http://a/g")
- expect(Addressable::URI.join(@uri.to_s, "../../../g").to_s).to eq("http://a/g")
- end
-
- it "when joined with '../.././../g' should resolve to http://a/g" do
- expect((@uri + "../.././../g").to_s).to eq("http://a/g")
- expect(Addressable::URI.join(@uri.to_s, "../.././../g").to_s).to eq(
- "http://a/g"
- )
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with '../../../../g' should resolve to http://a/g" do
- expect((@uri + "../../../../g").to_s).to eq("http://a/g")
- expect(Addressable::URI.join(
- @uri.to_s, "../../../../g").to_s).to eq("http://a/g")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with '/./g' should resolve to http://a/g" do
- expect((@uri + "/./g").to_s).to eq("http://a/g")
- expect(Addressable::URI.join(@uri.to_s, "/./g").to_s).to eq("http://a/g")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with '/../g' should resolve to http://a/g" do
- expect((@uri + "/../g").to_s).to eq("http://a/g")
- expect(Addressable::URI.join(@uri.to_s, "/../g").to_s).to eq("http://a/g")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g.' should resolve to http://a/b/c/g." do
- expect((@uri + "g.").to_s).to eq("http://a/b/c/g.")
- expect(Addressable::URI.join(@uri.to_s, "g.").to_s).to eq("http://a/b/c/g.")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with '.g' should resolve to http://a/b/c/.g" do
- expect((@uri + ".g").to_s).to eq("http://a/b/c/.g")
- expect(Addressable::URI.join(@uri.to_s, ".g").to_s).to eq("http://a/b/c/.g")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g..' should resolve to http://a/b/c/g.." do
- expect((@uri + "g..").to_s).to eq("http://a/b/c/g..")
- expect(Addressable::URI.join(@uri.to_s, "g..").to_s).to eq("http://a/b/c/g..")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with '..g' should resolve to http://a/b/c/..g" do
- expect((@uri + "..g").to_s).to eq("http://a/b/c/..g")
- expect(Addressable::URI.join(@uri.to_s, "..g").to_s).to eq("http://a/b/c/..g")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with './../g' should resolve to http://a/b/g" do
- expect((@uri + "./../g").to_s).to eq("http://a/b/g")
- expect(Addressable::URI.join(@uri.to_s, "./../g").to_s).to eq("http://a/b/g")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with './g/.' should resolve to http://a/b/c/g/" do
- expect((@uri + "./g/.").to_s).to eq("http://a/b/c/g/")
- expect(Addressable::URI.join(@uri.to_s, "./g/.").to_s).to eq("http://a/b/c/g/")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g/./h' should resolve to http://a/b/c/g/h" do
- expect((@uri + "g/./h").to_s).to eq("http://a/b/c/g/h")
- expect(Addressable::URI.join(@uri.to_s, "g/./h").to_s).to eq("http://a/b/c/g/h")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g/../h' should resolve to http://a/b/c/h" do
- expect((@uri + "g/../h").to_s).to eq("http://a/b/c/h")
- expect(Addressable::URI.join(@uri.to_s, "g/../h").to_s).to eq("http://a/b/c/h")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g;x=1/./y' " +
- "should resolve to http://a/b/c/g;x=1/y" do
- expect((@uri + "g;x=1/./y").to_s).to eq("http://a/b/c/g;x=1/y")
- expect(Addressable::URI.join(
- @uri.to_s, "g;x=1/./y").to_s).to eq("http://a/b/c/g;x=1/y")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g;x=1/../y' should resolve to http://a/b/c/y" do
- expect((@uri + "g;x=1/../y").to_s).to eq("http://a/b/c/y")
- expect(Addressable::URI.join(
- @uri.to_s, "g;x=1/../y").to_s).to eq("http://a/b/c/y")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g?y/./x' " +
- "should resolve to http://a/b/c/g?y/./x" do
- expect((@uri + "g?y/./x").to_s).to eq("http://a/b/c/g?y/./x")
- expect(Addressable::URI.join(
- @uri.to_s, "g?y/./x").to_s).to eq("http://a/b/c/g?y/./x")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g?y/../x' " +
- "should resolve to http://a/b/c/g?y/../x" do
- expect((@uri + "g?y/../x").to_s).to eq("http://a/b/c/g?y/../x")
- expect(Addressable::URI.join(
- @uri.to_s, "g?y/../x").to_s).to eq("http://a/b/c/g?y/../x")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g#s/./x' " +
- "should resolve to http://a/b/c/g#s/./x" do
- expect((@uri + "g#s/./x").to_s).to eq("http://a/b/c/g#s/./x")
- expect(Addressable::URI.join(
- @uri.to_s, "g#s/./x").to_s).to eq("http://a/b/c/g#s/./x")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'g#s/../x' " +
- "should resolve to http://a/b/c/g#s/../x" do
- expect((@uri + "g#s/../x").to_s).to eq("http://a/b/c/g#s/../x")
- expect(Addressable::URI.join(
- @uri.to_s, "g#s/../x").to_s).to eq("http://a/b/c/g#s/../x")
- end
-
- # Section 5.4.2 of RFC 3986
- it "when joined with 'http:g' should resolve to http:g" do
- expect((@uri + "http:g").to_s).to eq("http:g")
- expect(Addressable::URI.join(@uri.to_s, "http:g").to_s).to eq("http:g")
- end
-
- # Edge case to be sure
- it "when joined with '//example.com/' should " +
- "resolve to http://example.com/" do
- expect((@uri + "//example.com/").to_s).to eq("http://example.com/")
- expect(Addressable::URI.join(
- @uri.to_s, "//example.com/").to_s).to eq("http://example.com/")
- end
-
- it "when joined with a bogus object a TypeError should be raised" do
- expect do
- Addressable::URI.join(@uri, 42)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when converting the path " +
- "'relative/path/to/something'" do
- before do
- @path = 'relative/path/to/something'
- end
-
- it "should convert to " +
- "\'relative/path/to/something\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("relative/path/to/something")
- end
-
- it "should join with an absolute file path correctly" do
- @base = Addressable::URI.convert_path("/absolute/path/")
- @uri = Addressable::URI.convert_path(@path)
- expect((@base + @uri).to_str).to eq(
- "file:///absolute/path/relative/path/to/something"
- )
- end
-end
-
-describe Addressable::URI, "when converting a bogus path" do
- it "should raise a TypeError" do
- expect do
- Addressable::URI.convert_path(42)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when given a UNIX root directory" do
- before do
- @path = "/"
- end
-
- it "should convert to \'file:///\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given a Windows root directory" do
- before do
- @path = "C:\\"
- end
-
- it "should convert to \'file:///c:/\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///c:/")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given the path '/one/two/'" do
- before do
- @path = '/one/two/'
- end
-
- it "should convert to " +
- "\'file:///one/two/\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///one/two/")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given the tld " do
- it "'uk' should have a tld of 'uk'" do
- uri = Addressable::URI.parse("http://example.com")
- uri.tld = "uk"
-
- expect(uri.tld).to eq("uk")
- end
-
- context "which " do
- let (:uri) { Addressable::URI.parse("http://www.comrade.net/path/to/source/") }
-
- it "contains a subdomain" do
- uri.tld = "co.uk"
-
- expect(uri.to_s).to eq("http://www.comrade.co.uk/path/to/source/")
- end
-
- it "is part of the domain" do
- uri.tld = "com"
-
- expect(uri.to_s).to eq("http://www.comrade.com/path/to/source/")
- end
- end
-end
-
-describe Addressable::URI, "when given the path " +
- "'c:\\windows\\My Documents 100%20\\foo.txt'" do
- before do
- @path = "c:\\windows\\My Documents 100%20\\foo.txt"
- end
-
- it "should convert to " +
- "\'file:///c:/windows/My%20Documents%20100%20/foo.txt\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///c:/windows/My%20Documents%20100%20/foo.txt")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given the path " +
- "'file://c:\\windows\\My Documents 100%20\\foo.txt'" do
- before do
- @path = "file://c:\\windows\\My Documents 100%20\\foo.txt"
- end
-
- it "should convert to " +
- "\'file:///c:/windows/My%20Documents%20100%20/foo.txt\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///c:/windows/My%20Documents%20100%20/foo.txt")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given the path " +
- "'file:c:\\windows\\My Documents 100%20\\foo.txt'" do
- before do
- @path = "file:c:\\windows\\My Documents 100%20\\foo.txt"
- end
-
- it "should convert to " +
- "\'file:///c:/windows/My%20Documents%20100%20/foo.txt\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///c:/windows/My%20Documents%20100%20/foo.txt")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given the path " +
- "'file:/c:\\windows\\My Documents 100%20\\foo.txt'" do
- before do
- @path = "file:/c:\\windows\\My Documents 100%20\\foo.txt"
- end
-
- it "should convert to " +
- "\'file:///c:/windows/My%20Documents%20100%20/foo.txt\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///c:/windows/My%20Documents%20100%20/foo.txt")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given the path " +
- "'file:///c|/windows/My%20Documents%20100%20/foo.txt'" do
- before do
- @path = "file:///c|/windows/My%20Documents%20100%20/foo.txt"
- end
-
- it "should convert to " +
- "\'file:///c:/windows/My%20Documents%20100%20/foo.txt\'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("file:///c:/windows/My%20Documents%20100%20/foo.txt")
- end
-
- it "should have an origin of 'file://'" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.origin).to eq('file://')
- end
-end
-
-describe Addressable::URI, "when given an http protocol URI" do
- before do
- @path = "http://example.com/"
- end
-
- it "should not do any conversion at all" do
- @uri = Addressable::URI.convert_path(@path)
- expect(@uri.to_str).to eq("http://example.com/")
- end
-end
-
-class SuperString
- def initialize(string)
- @string = string.to_s
- end
-
- def to_str
- return @string
- end
-end
-
-describe Addressable::URI, "when parsing a non-String object" do
- it "should correctly parse anything with a 'to_str' method" do
- Addressable::URI.parse(SuperString.new(42))
- end
-
- it "should raise a TypeError for objects than cannot be converted" do
- expect do
- Addressable::URI.parse(42)
- end.to raise_error(TypeError)
- end
-
- it "should correctly parse heuristically anything with a 'to_str' method" do
- Addressable::URI.heuristic_parse(SuperString.new(42))
- end
-
- it "should raise a TypeError for objects than cannot be converted" do
- expect do
- Addressable::URI.heuristic_parse(42)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when form encoding a hash" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.form_encode(
- [["&one", "/1"], ["=two", "?2"], [":three", "#3"]]
- )).to eq("%26one=%2F1&%3Dtwo=%3F2&%3Athree=%233")
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.form_encode(
- {"q" => "one two three"}
- )).to eq("q=one+two+three")
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.form_encode(
- {"key" => nil}
- )).to eq("key=")
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.form_encode(
- {"q" => ["one", "two", "three"]}
- )).to eq("q=one&q=two&q=three")
- end
-
- it "should result in correctly encoded newlines" do
- expect(Addressable::URI.form_encode(
- {"text" => "one\ntwo\rthree\r\nfour\n\r"}
- )).to eq("text=one%0D%0Atwo%0D%0Athree%0D%0Afour%0D%0A%0D%0A")
- end
-
- it "should result in a sorted percent encoded sequence" do
- expect(Addressable::URI.form_encode(
- [["a", "1"], ["dup", "3"], ["dup", "2"]], true
- )).to eq("a=1&dup=2&dup=3")
- end
-end
-
-describe Addressable::URI, "when form encoding a non-Array object" do
- it "should raise a TypeError for objects than cannot be converted" do
- expect do
- Addressable::URI.form_encode(42)
- end.to raise_error(TypeError)
- end
-end
-
-# See https://tools.ietf.org/html/rfc6749#appendix-B
-describe Addressable::URI, "when form encoding the example value from OAuth 2" do
- it "should result in correct values" do
- expect(Addressable::URI.form_encode(
- {"value" => " %&+£€"}
- )).to eq("value=+%25%26%2B%C2%A3%E2%82%AC")
- end
-end
-
-# See https://tools.ietf.org/html/rfc6749#appendix-B
-describe Addressable::URI, "when form unencoding the example value from OAuth 2" do
- it "should result in correct values" do
- expect(Addressable::URI.form_unencode(
- "value=+%25%26%2B%C2%A3%E2%82%AC"
- )).to eq([["value", " %&+£€"]])
- end
-end
-
-describe Addressable::URI, "when form unencoding a string" do
- it "should result in correct values" do
- expect(Addressable::URI.form_unencode(
- "%26one=%2F1&%3Dtwo=%3F2&%3Athree=%233"
- )).to eq([["&one", "/1"], ["=two", "?2"], [":three", "#3"]])
- end
-
- it "should result in correct values" do
- expect(Addressable::URI.form_unencode(
- "q=one+two+three"
- )).to eq([["q", "one two three"]])
- end
-
- it "should result in correct values" do
- expect(Addressable::URI.form_unencode(
- "text=one%0D%0Atwo%0D%0Athree%0D%0Afour%0D%0A%0D%0A"
- )).to eq([["text", "one\ntwo\nthree\nfour\n\n"]])
- end
-
- it "should result in correct values" do
- expect(Addressable::URI.form_unencode(
- "a=1&dup=2&dup=3"
- )).to eq([["a", "1"], ["dup", "2"], ["dup", "3"]])
- end
-
- it "should result in correct values" do
- expect(Addressable::URI.form_unencode(
- "key"
- )).to eq([["key", nil]])
- end
-
- it "should result in correct values" do
- expect(Addressable::URI.form_unencode("GivenName=Ren%C3%A9")).to eq(
- [["GivenName", "René"]]
- )
- end
-end
-
-describe Addressable::URI, "when form unencoding a non-String object" do
- it "should correctly parse anything with a 'to_str' method" do
- Addressable::URI.form_unencode(SuperString.new(42))
- end
-
- it "should raise a TypeError for objects than cannot be converted" do
- expect do
- Addressable::URI.form_unencode(42)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when normalizing a non-String object" do
- it "should correctly parse anything with a 'to_str' method" do
- Addressable::URI.normalize_component(SuperString.new(42))
- end
-
- it "should raise a TypeError for objects than cannot be converted" do
- expect do
- Addressable::URI.normalize_component(42)
- end.to raise_error(TypeError)
- end
-
- it "should raise a TypeError for objects than cannot be converted" do
- expect do
- Addressable::URI.normalize_component("component", 42)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when normalizing a path with an encoded slash" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.parse("/path%2Fsegment/").normalize.path).to eq(
- "/path%2Fsegment/"
- )
- end
-end
-
-describe Addressable::URI, "when normalizing a path with special unicode" do
- it "does not stop at or ignore null bytes" do
- expect(Addressable::URI.parse("/path%00segment/").normalize.path).to eq(
- "/path%00segment/"
- )
- end
-
- it "does apply NFC unicode normalization" do
- expect(Addressable::URI.parse("/%E2%84%A6").normalize.path).to eq(
- "/%CE%A9"
- )
- end
-
- it "does not apply NFKC unicode normalization" do
- expect(Addressable::URI.parse("/%C2%AF%C2%A0").normalize.path).to eq(
- "/%C2%AF%C2%A0"
- )
- end
-end
-
-describe Addressable::URI, "when normalizing a partially encoded string" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.normalize_component(
- "partially % encoded%21"
- )).to eq("partially%20%25%20encoded!")
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.normalize_component(
- "partially %25 encoded!"
- )).to eq("partially%20%25%20encoded!")
- end
-end
-
-describe Addressable::URI, "when normalizing a unicode sequence" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.normalize_component(
- "/C%CC%A7"
- )).to eq("/%C3%87")
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.normalize_component(
- "/%C3%87"
- )).to eq("/%C3%87")
- end
-end
-
-describe Addressable::URI, "when normalizing a multibyte string" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.normalize_component("günther")).to eq(
- "g%C3%BCnther"
- )
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.normalize_component("g%C3%BCnther")).to eq(
- "g%C3%BCnther"
- )
- end
-end
-
-describe Addressable::URI, "when normalizing a string but leaving some characters encoded" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.normalize_component("%58X%59Y%5AZ", "0-9a-zXY", "Y")).to eq(
- "XX%59Y%5A%5A"
- )
- end
-
- it "should not modify the character class" do
- character_class = "0-9a-zXY"
-
- character_class_copy = character_class.dup
-
- Addressable::URI.normalize_component("%58X%59Y%5AZ", character_class, "Y")
-
- expect(character_class).to eq(character_class_copy)
- end
-end
-
-describe Addressable::URI, "when encoding IP literals" do
- it "should work for IPv4" do
- input = "http://127.0.0.1/"
- expect(Addressable::URI.encode(input)).to eq(input)
- end
-
- it "should work for IPv6" do
- input = "http://[fe80::200:f8ff:fe21:67cf]/"
- expect(Addressable::URI.encode(input)).to eq(input)
- end
-end
-
-describe Addressable::URI, "when encoding a string with existing encodings to upcase" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.encode_component("JK%4c", "0-9A-IKM-Za-z%", "L")).to eq("%4AK%4C")
- end
-end
-
-describe Addressable::URI, "when encoding a multibyte string" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.encode_component("günther")).to eq("g%C3%BCnther")
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.encode_component(
- "günther", /[^a-zA-Z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\-\.\_\~]/
- )).to eq("g%C3%BCnther")
- end
-end
-
-describe Addressable::URI, "when form encoding a multibyte string" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.form_encode({"GivenName" => "René"})).to eq(
- "GivenName=Ren%C3%A9"
- )
- end
-end
-
-describe Addressable::URI, "when encoding a string with ASCII chars 0-15" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.encode_component("one\ntwo")).to eq("one%0Atwo")
- end
-
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.encode_component(
- "one\ntwo", /[^a-zA-Z0-9\:\/\?\#\[\]\@\!\$\&\'\(\)\*\+\,\;\=\-\.\_\~]/
- )).to eq("one%0Atwo")
- end
-end
-
-describe Addressable::URI, "when unencoding a multibyte string" do
- it "should result in correct percent encoded sequence" do
- expect(Addressable::URI.unencode_component("g%C3%BCnther")).to eq("günther")
- end
-
- it "should consistently use UTF-8 internally" do
- expect(Addressable::URI.unencode_component("ski=%BA%DAɫ")).to eq("ski=\xBA\xDAɫ")
- end
-
- it "should not fail with UTF-8 incompatible string" do
- url = "/M%E9/\xE9?p=\xFC".b
- expect(Addressable::URI.unencode_component(url)).to eq("/M\xE9/\xE9?p=\xFC")
- end
-
- it "should result in correct percent encoded sequence as a URI" do
- expect(Addressable::URI.unencode(
- "/path?g%C3%BCnther", ::Addressable::URI
- )).to eq(Addressable::URI.new(
- :path => "/path", :query => "günther"
- ))
- end
-end
-
-describe Addressable::URI, "when partially unencoding a string" do
- it "should unencode all characters by default" do
- expect(Addressable::URI.unencode('%%25~%7e+%2b', String)).to eq('%%~~++')
- end
-
- it "should unencode characters not in leave_encoded" do
- expect(Addressable::URI.unencode('%%25~%7e+%2b', String, '~')).to eq('%%~%7e++')
- end
-
- it "should leave characters in leave_encoded alone" do
- expect(Addressable::URI.unencode('%%25~%7e+%2b', String, '%~+')).to eq('%%25~%7e+%2b')
- end
-end
-
-describe Addressable::URI, "when unencoding a bogus object" do
- it "should raise a TypeError" do
- expect do
- Addressable::URI.unencode_component(42)
- end.to raise_error(TypeError)
- end
-
- it "should raise a TypeError" do
- expect do
- Addressable::URI.unencode("/path?g%C3%BCnther", Integer)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when encoding a bogus object" do
- it "should raise a TypeError" do
- expect do
- Addressable::URI.encode(Object.new)
- end.to raise_error(TypeError)
- end
-
- it "should raise a TypeError" do
- expect do
- Addressable::URI.normalized_encode(Object.new)
- end.to raise_error(TypeError)
- end
-
- it "should raise a TypeError" do
- expect do
- Addressable::URI.encode_component("günther", Object.new)
- end.to raise_error(TypeError)
- end
-
- it "should raise a TypeError" do
- expect do
- Addressable::URI.encode_component(Object.new)
- end.to raise_error(TypeError)
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://example.com/'" do
- before do
- @input = "http://example.com/"
- end
-
- it "should heuristically parse to 'http://example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("http://example.com/")
- end
-
- it "should not raise error when frozen" do
- expect do
- Addressable::URI.heuristic_parse(@input).freeze.to_s
- end.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'https://example.com/'" do
- before do
- @input = "https://example.com/"
- end
-
- it "should heuristically parse to 'https://example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("https://example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http:example.com/'" do
- before do
- @input = "http:example.com/"
- end
-
- it "should heuristically parse to 'http://example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("http://example.com/")
- end
-
- it "should heuristically parse to 'http://example.com/' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("http://example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'https:example.com/'" do
- before do
- @input = "https:example.com/"
- end
-
- it "should heuristically parse to 'https://example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("https://example.com/")
- end
-
- it "should heuristically parse to 'https://example.com/' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("https://example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://example.com/example.com/'" do
- before do
- @input = "http://example.com/example.com/"
- end
-
- it "should heuristically parse to 'http://example.com/example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("http://example.com/example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://prefix\\.example.com/'" do
- before do
- @input = "http://prefix\\.example.com/"
- end
-
- it "should heuristically parse to 'http://prefix/.example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.authority).to eq("prefix")
- expect(@uri.to_s).to eq("http://prefix/.example.com/")
- end
-
- it "should heuristically parse to 'http://prefix/.example.com/' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("http://prefix/.example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://p:\\/'" do
- before do
- @input = "http://p:\\/"
- end
-
- it "should heuristically parse to 'http://p//'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.authority).to eq("p")
- expect(@uri.to_s).to eq("http://p//")
- end
-
- it "should heuristically parse to 'http://p//' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("http://p//")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://p://'" do
- before do
- @input = "http://p://"
- end
-
- it "should heuristically parse to 'http://p//'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.authority).to eq("p")
- expect(@uri.to_s).to eq("http://p//")
- end
-
- it "should heuristically parse to 'http://p//' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("http://p//")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://p://p'" do
- before do
- @input = "http://p://p"
- end
-
- it "should heuristically parse to 'http://p//p'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.authority).to eq("p")
- expect(@uri.to_s).to eq("http://p//p")
- end
-
- it "should heuristically parse to 'http://p//p' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("http://p//p")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://prefix .example.com/'" do
- before do
- @input = "http://prefix .example.com/"
- end
-
- # Justification here being that no browser actually tries to resolve this.
- # They all treat this as a web search.
- it "should heuristically parse to 'http://prefix%20.example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.authority).to eq("prefix%20.example.com")
- expect(@uri.to_s).to eq("http://prefix%20.example.com/")
- end
-
- it "should heuristically parse to 'http://prefix%20.example.com/' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("http://prefix%20.example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "' http://www.example.com/ '" do
- before do
- @input = " http://www.example.com/ "
- end
-
- it "should heuristically parse to 'http://prefix%20.example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.scheme).to eq("http")
- expect(@uri.path).to eq("/")
- expect(@uri.to_s).to eq("http://www.example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http://prefix%2F.example.com/'" do
- before do
- @input = "http://prefix%2F.example.com/"
- end
-
- it "should heuristically parse to 'http://prefix%2F.example.com/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.authority).to eq("prefix%2F.example.com")
- expect(@uri.to_s).to eq("http://prefix%2F.example.com/")
- end
-
- it "should heuristically parse to 'http://prefix%2F.example.com/' " +
- "even with a scheme hint of 'ftp'" do
- @uri = Addressable::URI.heuristic_parse(@input, {:scheme => 'ftp'})
- expect(@uri.to_s).to eq("http://prefix%2F.example.com/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'/path/to/resource'" do
- before do
- @input = "/path/to/resource"
- end
-
- it "should heuristically parse to '/path/to/resource'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("/path/to/resource")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'relative/path/to/resource'" do
- before do
- @input = "relative/path/to/resource"
- end
-
- it "should heuristically parse to 'relative/path/to/resource'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("relative/path/to/resource")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'example.com'" do
- before do
- @input = "example.com"
- end
-
- it "should heuristically parse to 'http://example.com'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("http://example.com")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'example.com' and a scheme hint of 'ftp'" do
- before do
- @input = "example.com"
- @hints = {:scheme => 'ftp'}
- end
-
- it "should heuristically parse to 'http://example.com'" do
- @uri = Addressable::URI.heuristic_parse(@input, @hints)
- expect(@uri.to_s).to eq("ftp://example.com")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'example.com:21' and a scheme hint of 'ftp'" do
- before do
- @input = "example.com:21"
- @hints = {:scheme => 'ftp'}
- end
-
- it "should heuristically parse to 'http://example.com:21'" do
- @uri = Addressable::URI.heuristic_parse(@input, @hints)
- expect(@uri.to_s).to eq("ftp://example.com:21")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'example.com/path/to/resource'" do
- before do
- @input = "example.com/path/to/resource"
- end
-
- it "should heuristically parse to 'http://example.com/path/to/resource'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("http://example.com/path/to/resource")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'http:///example.com'" do
- before do
- @input = "http:///example.com"
- end
-
- it "should heuristically parse to 'http://example.com'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("http://example.com")
- end
-end
-
-describe Addressable::URI, "when given the input which "\
- "start with digits and has specified port" do
- before do
- @input = "7777.example.org:8089"
- end
-
- it "should heuristically parse to 'http://7777.example.org:8089'" do
- uri = Addressable::URI.heuristic_parse(@input)
- expect(uri.to_s).to eq("http://7777.example.org:8089")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'feed:///example.com'" do
- before do
- @input = "feed:///example.com"
- end
-
- it "should heuristically parse to 'feed://example.com'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("feed://example.com")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'file://localhost/path/to/resource/'" do
- before do
- @input = "file://localhost/path/to/resource/"
- end
-
- it "should heuristically parse to 'file:///path/to/resource/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("file:///path/to/resource/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'file://path/to/resource/'" do
- before do
- @input = "file://path/to/resource/"
- end
-
- it "should heuristically parse to 'file:///path/to/resource/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("file:///path/to/resource/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'file://///path/to/resource/'" do
- before do
- @input = "file:///////path/to/resource/"
- end
-
- it "should heuristically parse to 'file:////path/to/resource/'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("file:////path/to/resource/")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "'feed://http://example.com'" do
- before do
- @input = "feed://http://example.com"
- end
-
- it "should heuristically parse to 'feed:http://example.com'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("feed:http://example.com")
- end
-end
-
-describe Addressable::URI, "when given the input " +
- "::URI.parse('http://example.com')" do
- before do
- @input = ::URI.parse('http://example.com')
- end
-
- it "should heuristically parse to 'http://example.com'" do
- @uri = Addressable::URI.heuristic_parse(@input)
- expect(@uri.to_s).to eq("http://example.com")
- end
-end
-
-describe Addressable::URI, "when given the input: 'user@domain.com'" do
- before do
- @input = "user@domain.com"
- end
-
- context "for heuristic parse" do
- it "should remain 'mailto:user@domain.com'" do
- uri = Addressable::URI.heuristic_parse("mailto:#{@input}")
- expect(uri.to_s).to eq("mailto:user@domain.com")
- end
-
- it "should have a scheme of 'mailto'" do
- uri = Addressable::URI.heuristic_parse(@input)
- expect(uri.to_s).to eq("mailto:user@domain.com")
- expect(uri.scheme).to eq("mailto")
- end
-
- it "should remain 'acct:user@domain.com'" do
- uri = Addressable::URI.heuristic_parse("acct:#{@input}")
- expect(uri.to_s).to eq("acct:user@domain.com")
- end
-
- context "HTTP" do
- before do
- @uri = Addressable::URI.heuristic_parse("http://#{@input}/")
- end
-
- it "should remain 'http://user@domain.com/'" do
- expect(@uri.to_s).to eq("http://user@domain.com/")
- end
-
- it "should have the username 'user' for HTTP basic authentication" do
- expect(@uri.user).to eq("user")
- end
- end
- end
-end
-
-describe Addressable::URI, "when assigning query values" do
- before do
- @uri = Addressable::URI.new
- end
-
- it "should correctly assign {:a => 'a', :b => ['c', 'd', 'e']}" do
- @uri.query_values = {:a => "a", :b => ["c", "d", "e"]}
- expect(@uri.query).to eq("a=a&b=c&b=d&b=e")
- end
-
- it "should raise an error attempting to assign {'a' => {'b' => ['c']}}" do
- expect do
- @uri.query_values = { 'a' => {'b' => ['c'] } }
- end.to raise_error(TypeError)
- end
-
- it "should raise an error attempting to assign " +
- "{:b => '2', :a => {:c => '1'}}" do
- expect do
- @uri.query_values = {:b => '2', :a => {:c => '1'}}
- end.to raise_error(TypeError)
- end
-
- it "should raise an error attempting to assign " +
- "{:a => 'a', :b => [{:c => 'c', :d => 'd'}, " +
- "{:e => 'e', :f => 'f'}]}" do
- expect do
- @uri.query_values = {
- :a => "a", :b => [{:c => "c", :d => "d"}, {:e => "e", :f => "f"}]
- }
- end.to raise_error(TypeError)
- end
-
- it "should raise an error attempting to assign " +
- "{:a => 'a', :b => [{:c => true, :d => 'd'}, " +
- "{:e => 'e', :f => 'f'}]}" do
- expect do
- @uri.query_values = {
- :a => 'a', :b => [{:c => true, :d => 'd'}, {:e => 'e', :f => 'f'}]
- }
- end.to raise_error(TypeError)
- end
-
- it "should raise an error attempting to assign " +
- "{:a => 'a', :b => {:c => true, :d => 'd'}}" do
- expect do
- @uri.query_values = {
- :a => 'a', :b => {:c => true, :d => 'd'}
- }
- end.to raise_error(TypeError)
- end
-
- it "should raise an error attempting to assign " +
- "{:a => 'a', :b => {:c => true, :d => 'd'}}" do
- expect do
- @uri.query_values = {
- :a => 'a', :b => {:c => true, :d => 'd'}
- }
- end.to raise_error(TypeError)
- end
-
- it "should correctly assign {:a => 1, :b => 1.5}" do
- @uri.query_values = { :a => 1, :b => 1.5 }
- expect(@uri.query).to eq("a=1&b=1.5")
- end
-
- it "should raise an error attempting to assign " +
- "{:z => 1, :f => [2, {999.1 => [3,'4']}, ['h', 'i']], " +
- ":a => {:b => ['c', 'd'], :e => true, :y => 0.5}}" do
- expect do
- @uri.query_values = {
- :z => 1,
- :f => [ 2, {999.1 => [3,'4']}, ['h', 'i'] ],
- :a => { :b => ['c', 'd'], :e => true, :y => 0.5 }
- }
- end.to raise_error(TypeError)
- end
-
- it "should correctly assign {}" do
- @uri.query_values = {}
- expect(@uri.query).to eq('')
- end
-
- it "should correctly assign nil" do
- @uri.query_values = nil
- expect(@uri.query).to eq(nil)
- end
-
- it "should correctly sort {'ab' => 'c', :ab => 'a', :a => 'x'}" do
- @uri.query_values = {'ab' => 'c', :ab => 'a', :a => 'x'}
- expect(@uri.query).to eq("a=x&ab=a&ab=c")
- end
-
- it "should correctly assign " +
- "[['b', 'c'], ['b', 'a'], ['a', 'a']]" do
- # Order can be guaranteed in this format, so preserve it.
- @uri.query_values = [['b', 'c'], ['b', 'a'], ['a', 'a']]
- expect(@uri.query).to eq("b=c&b=a&a=a")
- end
-
- it "should preserve query string order" do
- query_string = (('a'..'z').to_a.reverse.map { |e| "#{e}=#{e}" }).join("&")
- @uri.query = query_string
- original_uri = @uri.to_s
- @uri.query_values = @uri.query_values(Array)
- expect(@uri.to_s).to eq(original_uri)
- end
-
- describe 'when a hash with mixed types is assigned to query_values' do
- it 'should not raise an error' do
- skip 'Issue #94'
- expect { subject.query_values = { "page" => "1", :page => 2 } }.to_not raise_error
- end
- end
-end
-
-describe Addressable::URI, "when assigning path values" do
- before do
- @uri = Addressable::URI.new
- end
-
- it "should correctly assign paths containing colons" do
- @uri.path = "acct:bob@sporkmonger.com"
- expect(@uri.path).to eq("acct:bob@sporkmonger.com")
- expect(@uri.normalize.to_str).to eq("acct%2Fbob@sporkmonger.com")
- expect { @uri.to_s }.to raise_error(
- Addressable::URI::InvalidURIError
- )
- end
-
- it "should correctly assign paths containing colons" do
- @uri.path = "/acct:bob@sporkmonger.com"
- @uri.authority = "example.com"
- expect(@uri.normalize.to_str).to eq("//example.com/acct:bob@sporkmonger.com")
- end
-
- it "should correctly assign paths containing colons" do
- @uri.path = "acct:bob@sporkmonger.com"
- @uri.scheme = "something"
- expect(@uri.normalize.to_str).to eq("something:acct:bob@sporkmonger.com")
- end
-
- it "should not allow relative paths to be assigned on absolute URIs" do
- expect do
- @uri.scheme = "http"
- @uri.host = "example.com"
- @uri.path = "acct:bob@sporkmonger.com"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should not allow relative paths to be assigned on absolute URIs" do
- expect do
- @uri.path = "acct:bob@sporkmonger.com"
- @uri.scheme = "http"
- @uri.host = "example.com"
- end.to raise_error(Addressable::URI::InvalidURIError)
- end
-
- it "should not allow relative paths to be assigned on absolute URIs" do
- expect do
- @uri.path = "uuid:0b3ecf60-3f93-11df-a9c3-001f5bfffe12"
- @uri.scheme = "urn"
- end.not_to raise_error
- end
-end
-
-describe Addressable::URI, "when initializing a subclass of Addressable::URI" do
- before do
- @uri = Class.new(Addressable::URI).new
- end
-
- it "should have the same class after being parsed" do
- expect(@uri.class).to eq(Addressable::URI.parse(@uri).class)
- end
-
- it "should have the same class as its duplicate" do
- expect(@uri.class).to eq(@uri.dup.class)
- end
-
- it "should have the same class after being normalized" do
- expect(@uri.class).to eq(@uri.normalize.class)
- end
-
- it "should have the same class after being merged" do
- expect(@uri.class).to eq(@uri.merge(:path => 'path').class)
- end
-
- it "should have the same class after being joined" do
- expect(@uri.class).to eq(@uri.join('path').class)
- end
-end
-
-describe Addressable::URI, "support serialization roundtrip" do
- before do
- @uri = Addressable::URI.new(
- :scheme => "http",
- :user => "user",
- :password => "password",
- :host => "example.com",
- :port => 80,
- :path => "/path",
- :query => "query=value",
- :fragment => "fragment"
- )
- end
-
- it "is in a working state after being serialized with Marshal" do
- @uri = Addressable::URI.parse("http://example.com")
- cloned_uri = Marshal.load(Marshal.dump(@uri))
- expect(cloned_uri.normalized_scheme).to be == @uri.normalized_scheme
- end
-
- it "is in a working state after being serialized with YAML" do
- @uri = Addressable::URI.parse("http://example.com")
- cloned_uri = if YAML.respond_to?(:unsafe_load)
- YAML.unsafe_load(YAML.dump(@uri))
- else
- YAML.load(YAML.dump(@uri))
- end
- expect(cloned_uri.normalized_scheme).to be == @uri.normalized_scheme
- end
-end
-
-describe Addressable::URI, "when initialized in a non-main `Ractor`" do
- it "should have the same value as if used in the main `Ractor`" do
- pending("Ruby 3.0+ for `Ractor` support") unless defined?(Ractor)
- main = Addressable::URI.parse("http://example.com")
- expect(
- Ractor.new { Addressable::URI.parse("http://example.com") }.take
- ).to eq(main)
- end
-end
-
-describe Addressable::URI, "when deferring validation" do
- subject(:deferred) { uri.instance_variable_get(:@validation_deferred) }
-
- let(:uri) { Addressable::URI.parse("http://example.com") }
-
- it "defers validation within the block" do
- uri.defer_validation do
- expect(deferred).to be true
- end
- end
-
- it "always resets deferral afterward" do
- expect { uri.defer_validation { raise "boom" } }.to raise_error("boom")
- expect(deferred).to be false
- end
-
- it "returns nil" do
- res = uri.defer_validation {}
- expect(res).to be nil
- end
-end
-
-describe Addressable::URI, "YAML safe loading" do
- it "doesn't serialize anonymous objects" do
- url = Addressable::URI.parse("http://example.com/")
- expect(YAML.dump(url)).to_not include("!ruby/object {}")
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/spec_helper.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/spec_helper.rb
deleted file mode 100644
index bd8e395..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/spec/spec_helper.rb
+++ /dev/null
@@ -1,33 +0,0 @@
-# frozen_string_literal: true
-
-require 'bundler/setup'
-require 'rspec/its'
-
-begin
- require 'coveralls'
- Coveralls.wear! do
- add_filter "spec/"
- add_filter "vendor/"
- end
-rescue LoadError
- warn "warning: coveralls gem not found; skipping Coveralls"
- require 'simplecov'
- SimpleCov.start do
- add_filter "spec/"
- add_filter "vendor/"
- end
-end if Gem.loaded_specs.key?("simplecov")
-
-class TestHelper
- def self.native_supported?
- mri = RUBY_ENGINE == "ruby"
- windows = RUBY_PLATFORM.include?("mingw")
-
- mri && !windows
- end
-end
-
-RSpec.configure do |config|
- config.warnings = true
- config.filter_run_when_matching :focus
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/clobber.rake b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/clobber.rake
deleted file mode 100644
index a9e32b3..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/clobber.rake
+++ /dev/null
@@ -1,4 +0,0 @@
-# frozen_string_literal: true
-
-desc "Remove all build products"
-task "clobber"
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/gem.rake b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/gem.rake
deleted file mode 100644
index 24d9714..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/gem.rake
+++ /dev/null
@@ -1,95 +0,0 @@
-# frozen_string_literal: true
-
-require "rubygems/package_task"
-
-namespace :gem do
- GEM_SPEC = Gem::Specification.new do |s|
- s.name = PKG_NAME
- s.version = PKG_VERSION
- s.summary = PKG_SUMMARY
- s.description = PKG_DESCRIPTION
-
- s.files = PKG_FILES.to_a
-
- s.extra_rdoc_files = %w( README.md )
- s.rdoc_options.concat ["--main", "README.md"]
-
- if !s.respond_to?(:add_development_dependency)
- puts "Cannot build Gem with this version of RubyGems."
- exit(1)
- end
-
- s.required_ruby_version = ">= 2.2"
-
- s.add_runtime_dependency "public_suffix", ">= 2.0.2", "< 6.0"
- s.add_development_dependency "bundler", ">= 1.0", "< 3.0"
-
- s.require_path = "lib"
-
- s.author = "Bob Aman"
- s.email = "bob@sporkmonger.com"
- s.homepage = "https://github.com/sporkmonger/addressable"
- s.license = "Apache-2.0"
- s.metadata = {
- "changelog_uri" => "https://github.com/sporkmonger/addressable/blob/main/CHANGELOG.md"
- }
- end
-
- Gem::PackageTask.new(GEM_SPEC) do |p|
- p.gem_spec = GEM_SPEC
- p.need_tar = true
- p.need_zip = true
- end
-
- desc "Generates .gemspec file"
- task :gemspec do
- spec_string = GEM_SPEC.to_ruby
- File.open("#{GEM_SPEC.name}.gemspec", "w") do |file|
- file.write spec_string
- end
- end
-
- desc "Show information about the gem"
- task :debug do
- puts GEM_SPEC.to_ruby
- end
-
- desc "Install the gem"
- task :install => ["clobber", "gem:package"] do
- sh "#{SUDO} gem install --local pkg/#{GEM_SPEC.full_name}"
- end
-
- desc "Uninstall the gem"
- task :uninstall do
- installed_list = Gem.source_index.find_name(PKG_NAME)
- if installed_list &&
- (installed_list.collect { |s| s.version.to_s}.include?(PKG_VERSION))
- sh(
- "#{SUDO} gem uninstall --version '#{PKG_VERSION}' " +
- "--ignore-dependencies --executables #{PKG_NAME}"
- )
- end
- end
-
- desc "Reinstall the gem"
- task :reinstall => [:uninstall, :install]
-
- desc "Package for release"
- task :release => ["gem:package", "gem:gemspec"] do |t|
- v = ENV["VERSION"] or abort "Must supply VERSION=x.y.z"
- abort "Versions don't match #{v} vs #{PROJ.version}" if v != PKG_VERSION
- pkg = "pkg/#{GEM_SPEC.full_name}"
-
- changelog = File.open("CHANGELOG.md") { |file| file.read }
-
- puts "Releasing #{PKG_NAME} v. #{PKG_VERSION}"
- Rake::Task["git:tag:create"].invoke
- end
-end
-
-desc "Alias to gem:package"
-task "gem" => "gem:package"
-
-task "gem:release" => "gem:gemspec"
-
-task "clobber" => ["gem:clobber_package"]
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/git.rake b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/git.rake
deleted file mode 100644
index 1238c8d..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/git.rake
+++ /dev/null
@@ -1,47 +0,0 @@
-# frozen_string_literal: true
-
-namespace :git do
- namespace :tag do
- desc "List tags from the Git repository"
- task :list do
- tags = `git tag -l`
- tags.gsub!("\r", "")
- tags = tags.split("\n").sort {|a, b| b <=> a }
- puts tags.join("\n")
- end
-
- desc "Create a new tag in the Git repository"
- task :create do
- changelog = File.open("CHANGELOG.md", "r") { |file| file.read }
- puts "-" * 80
- puts changelog
- puts "-" * 80
- puts
-
- v = ENV["VERSION"] or abort "Must supply VERSION=x.y.z"
- abort "Versions don't match #{v} vs #{PKG_VERSION}" if v != PKG_VERSION
-
- git_status = `git status`
- if git_status !~ /^nothing to commit/
- abort "Working directory isn't clean."
- end
-
- tag = "#{PKG_NAME}-#{PKG_VERSION}"
- msg = "Release #{PKG_NAME}-#{PKG_VERSION}"
-
- existing_tags = `git tag -l #{PKG_NAME}-*`.split('\n')
- if existing_tags.include?(tag)
- warn("Tag already exists, deleting...")
- unless system "git tag -d #{tag}"
- abort "Tag deletion failed."
- end
- end
- puts "Creating git tag '#{tag}'..."
- unless system "git tag -a -m \"#{msg}\" #{tag}"
- abort "Tag creation failed."
- end
- end
- end
-end
-
-task "gem:release" => "git:tag:create"
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/metrics.rake b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/metrics.rake
deleted file mode 100644
index 107cc24..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/metrics.rake
+++ /dev/null
@@ -1,24 +0,0 @@
-# frozen_string_literal: true
-
-namespace :metrics do
- task :lines do
- lines, codelines, total_lines, total_codelines = 0, 0, 0, 0
- for file_name in FileList["lib/**/*.rb"]
- f = File.open(file_name)
- while line = f.gets
- lines += 1
- next if line =~ /^\s*$/
- next if line =~ /^\s*#/
- codelines += 1
- end
- puts "L: #{sprintf("%4d", lines)}, " +
- "LOC #{sprintf("%4d", codelines)} | #{file_name}"
- total_lines += lines
- total_codelines += codelines
-
- lines, codelines = 0, 0
- end
-
- puts "Total: Lines #{total_lines}, LOC #{total_codelines}"
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/profile.rake b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/profile.rake
deleted file mode 100644
index b697d48..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/profile.rake
+++ /dev/null
@@ -1,72 +0,0 @@
-# frozen_string_literal: true
-
-namespace :profile do
- desc "Profile Template match memory allocations"
- task :template_match_memory do
- require "memory_profiler"
- require "addressable/template"
-
- start_at = Time.now.to_f
- template = Addressable::Template.new("http://example.com/{?one,two,three}")
- report = MemoryProfiler.report do
- 30_000.times do
- template.match(
- "http://example.com/?one=one&two=floo&three=me"
- )
- end
- end
- end_at = Time.now.to_f
- print_options = { scale_bytes: true, normalize_paths: true }
- puts "\n\n"
-
- if ENV["CI"]
- report.pretty_print(print_options)
- else
- t_allocated = report.scale_bytes(report.total_allocated_memsize)
- t_retained = report.scale_bytes(report.total_retained_memsize)
-
- puts "Total allocated: #{t_allocated} (#{report.total_allocated} objects)"
- puts "Total retained: #{t_retained} (#{report.total_retained} objects)"
- puts "Took #{end_at - start_at} seconds"
-
- FileUtils.mkdir_p("tmp")
- report.pretty_print(to_file: "tmp/memprof.txt", **print_options)
- end
- end
-
- desc "Profile URI parse memory allocations"
- task :memory do
- require "memory_profiler"
- require "addressable/uri"
- if ENV["IDNA_MODE"] == "pure"
- Addressable.send(:remove_const, :IDNA)
- load "addressable/idna/pure.rb"
- end
-
- start_at = Time.now.to_f
- report = MemoryProfiler.report do
- 30_000.times do
- Addressable::URI.parse(
- "http://google.com/stuff/../?with_lots=of¶ms=asdff#!stuff"
- ).normalize
- end
- end
- end_at = Time.now.to_f
- print_options = { scale_bytes: true, normalize_paths: true }
- puts "\n\n"
-
- if ENV["CI"]
- report.pretty_print(**print_options)
- else
- t_allocated = report.scale_bytes(report.total_allocated_memsize)
- t_retained = report.scale_bytes(report.total_retained_memsize)
-
- puts "Total allocated: #{t_allocated} (#{report.total_allocated} objects)"
- puts "Total retained: #{t_retained} (#{report.total_retained} objects)"
- puts "Took #{end_at - start_at} seconds"
-
- FileUtils.mkdir_p("tmp")
- report.pretty_print(to_file: "tmp/memprof.txt", **print_options)
- end
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/rspec.rake b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/rspec.rake
deleted file mode 100644
index e3d9f01..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/rspec.rake
+++ /dev/null
@@ -1,23 +0,0 @@
-# frozen_string_literal: true
-
-require "rspec/core/rake_task"
-
-namespace :spec do
- RSpec::Core::RakeTask.new(:simplecov) do |t|
- t.pattern = FileList['spec/**/*_spec.rb']
- t.rspec_opts = %w[--color --format documentation] unless ENV["CI"]
- end
-
- namespace :simplecov do
- desc "Browse the code coverage report."
- task :browse => "spec:simplecov" do
- require "launchy"
- Launchy.open("coverage/index.html")
- end
- end
-end
-
-desc "Alias to spec:simplecov"
-task "spec" => "spec:simplecov"
-
-task "clobber" => ["spec:clobber_simplecov"]
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/yard.rake b/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/yard.rake
deleted file mode 100644
index 515f960..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/addressable-2.8.5/tasks/yard.rake
+++ /dev/null
@@ -1,29 +0,0 @@
-# frozen_string_literal: true
-
-require "rake"
-
-begin
- require "yard"
- require "yard/rake/yardoc_task"
-
- namespace :doc do
- desc "Generate Yardoc documentation"
- YARD::Rake::YardocTask.new do |yardoc|
- yardoc.name = "yard"
- yardoc.options = ["--verbose", "--markup", "markdown"]
- yardoc.files = FileList[
- "lib/**/*.rb", "ext/**/*.c",
- "README.md", "CHANGELOG.md", "LICENSE.txt"
- ].exclude(/idna/)
- end
- end
-
- task "clobber" => ["doc:clobber_yard"]
-
- desc "Alias to doc:yard"
- task "doc" => "doc:yard"
-rescue LoadError
- # If yard isn't available, it's not the end of the world
- desc "Alias to doc:rdoc"
- task "doc" => "doc:rdoc"
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/base64-0.1.1/LICENSE.txt b/docs/website/vendor/bundle/ruby/3.0.0/gems/base64-0.1.1/LICENSE.txt
deleted file mode 100644
index a009cae..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/base64-0.1.1/LICENSE.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-Copyright (C) 1993-2013 Yukihiro Matsumoto. All rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-1. Redistributions of source code must retain the above copyright
-notice, this list of conditions and the following disclaimer.
-2. Redistributions in binary form must reproduce the above copyright
-notice, this list of conditions and the following disclaimer in the
-documentation and/or other materials provided with the distribution.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
-FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
-OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
-OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
-SUCH DAMAGE.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/base64-0.1.1/README.md b/docs/website/vendor/bundle/ruby/3.0.0/gems/base64-0.1.1/README.md
deleted file mode 100644
index a29c58e..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/base64-0.1.1/README.md
+++ /dev/null
@@ -1,48 +0,0 @@
-# Base64
-
-The Base64 module provides for the encoding (`#encode64`, `#strict_encode64`,
-`#urlsafe_encode64`) and decoding (`#decode64`, `#strict_decode64`,
-`#urlsafe_decode64`) of binary data using a Base64 representation.
-
-## Installation
-
-Add this line to your application's Gemfile:
-
-```ruby
-gem 'base64'
-```
-
-And then execute:
-
- $ bundle install
-
-Or install it yourself as:
-
- $ gem install base64
-
-## Usage
-
-A simple encoding and decoding.
-
-```ruby
-require "base64"
-
-enc = Base64.encode64('Send reinforcements')
- # -> "U2VuZCByZWluZm9yY2VtZW50cw==\n"
-plain = Base64.decode64(enc)
- # -> "Send reinforcements"
-```
-
-The purpose of using base64 to encode data is that it translates any
-binary data into purely printable characters.
-
-## Development
-
-After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
-
-To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
-
-## Contributing
-
-Bug reports and pull requests are welcome on GitHub at https://github.com/ruby/base64.
-
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/bigdecimal.gemspec b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/bigdecimal.gemspec
deleted file mode 100644
index f9f3b45..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/bigdecimal.gemspec
+++ /dev/null
@@ -1,54 +0,0 @@
-# coding: utf-8
-
-name = File.basename(__FILE__, '.*')
-source_version = ["", "ext/#{name}/"].find do |dir|
- begin
- break File.foreach(File.join(__dir__, "#{dir}#{name}.c")) {|line|
- break $1.sub("-", ".") if /^#define\s+#{name.upcase}_VERSION\s+"(.+)"/o =~ line
- }
- rescue Errno::ENOENT
- end
-end or raise "can't find #{name.upcase}_VERSION"
-
-Gem::Specification.new do |s|
- s.name = name
- s.version = source_version
- s.authors = ["Kenta Murata", "Zachary Scott", "Shigeo Kobayashi"]
- s.email = ["mrkn@mrkn.jp"]
-
- s.summary = "Arbitrary-precision decimal floating-point number library."
- s.description = "This library provides arbitrary-precision decimal floating-point number class."
- s.homepage = "https://github.com/ruby/bigdecimal"
- s.licenses = ["Ruby", "BSD-2-Clause"]
-
- s.require_paths = %w[lib]
- s.files = %w[
- bigdecimal.gemspec
- lib/bigdecimal.rb
- lib/bigdecimal/jacobian.rb
- lib/bigdecimal/ludcmp.rb
- lib/bigdecimal/math.rb
- lib/bigdecimal/newton.rb
- lib/bigdecimal/util.rb
- sample/linear.rb
- sample/nlsolve.rb
- sample/pi.rb
- ]
- if Gem::Platform === s.platform and s.platform =~ 'java' or RUBY_ENGINE == 'jruby'
- s.platform = 'java'
- else
- s.extensions = %w[ext/bigdecimal/extconf.rb]
- s.files += %w[
- ext/bigdecimal/bigdecimal.c
- ext/bigdecimal/bigdecimal.h
- ext/bigdecimal/bits.h
- ext/bigdecimal/feature.h
- ext/bigdecimal/missing.c
- ext/bigdecimal/missing.h
- ext/bigdecimal/missing/dtoa.c
- ext/bigdecimal/static_assert.h
- ]
- end
-
- s.required_ruby_version = Gem::Requirement.new(">= 2.5.0")
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/.sitearchdir.time b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/.sitearchdir.time
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/Makefile b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/Makefile
deleted file mode 100644
index fe94630..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/Makefile
+++ /dev/null
@@ -1,267 +0,0 @@
-
-SHELL = /bin/sh
-
-# V=0 quiet, V=1 verbose. other values don't work.
-V = 0
-Q1 = $(V:1=)
-Q = $(Q1:0=@)
-ECHO1 = $(V:1=@ :)
-ECHO = $(ECHO1:0=@ echo)
-NULLCMD = :
-
-#### Start of system configuration section. ####
-
-srcdir = .
-topdir = /usr/include/ruby-3.0.0
-hdrdir = $(topdir)
-arch_hdrdir = /usr/include/x86_64-linux-gnu/ruby-3.0.0
-PATH_SEPARATOR = :
-VPATH = $(srcdir):$(arch_hdrdir)/ruby:$(hdrdir)/ruby
-prefix = $(DESTDIR)/usr
-rubysitearchprefix = $(sitearchlibdir)/$(RUBY_BASE_NAME)
-rubyarchprefix = $(archlibdir)/$(RUBY_BASE_NAME)
-rubylibprefix = $(libdir)/$(RUBY_BASE_NAME)
-exec_prefix = $(prefix)
-vendorarchhdrdir = $(sitearchincludedir)/$(RUBY_VERSION_NAME)/vendor_ruby
-sitearchhdrdir = $(sitearchincludedir)/$(RUBY_VERSION_NAME)/site_ruby
-rubyarchhdrdir = $(archincludedir)/$(RUBY_VERSION_NAME)
-vendorhdrdir = $(rubyhdrdir)/vendor_ruby
-sitehdrdir = $(rubyhdrdir)/site_ruby
-rubyhdrdir = $(includedir)/$(RUBY_VERSION_NAME)
-vendorarchdir = $(rubysitearchprefix)/vendor_ruby/$(ruby_version)
-vendorlibdir = $(vendordir)/$(ruby_version)
-vendordir = $(rubylibprefix)/vendor_ruby
-sitearchdir = $(DESTDIR)./.gem.20231104-11184-20hl4x
-sitelibdir = $(DESTDIR)./.gem.20231104-11184-20hl4x
-sitedir = $(DESTDIR)/usr/local/lib/site_ruby
-rubyarchdir = $(rubyarchprefix)/$(ruby_version)
-rubylibdir = $(rubylibprefix)/$(ruby_version)
-sitearchincludedir = $(includedir)/$(sitearch)
-archincludedir = $(includedir)/$(arch)
-sitearchlibdir = $(libdir)/$(sitearch)
-archlibdir = $(libdir)/$(arch)
-ridir = $(datarootdir)/$(RI_BASE_NAME)
-mandir = $(datarootdir)/man
-localedir = $(datarootdir)/locale
-libdir = $(exec_prefix)/lib
-psdir = $(docdir)
-pdfdir = $(docdir)
-dvidir = $(docdir)
-htmldir = $(docdir)
-infodir = $(datarootdir)/info
-docdir = $(datarootdir)/doc/$(PACKAGE)
-oldincludedir = $(DESTDIR)/usr/include
-includedir = $(prefix)/include
-runstatedir = $(DESTDIR)/var/run
-localstatedir = $(DESTDIR)/var
-sharedstatedir = $(prefix)/com
-sysconfdir = $(DESTDIR)/etc
-datadir = $(datarootdir)
-datarootdir = $(prefix)/share
-libexecdir = $(exec_prefix)/libexec
-sbindir = $(exec_prefix)/sbin
-bindir = $(exec_prefix)/bin
-archdir = $(rubyarchdir)
-
-
-CC_WRAPPER =
-CC = x86_64-linux-gnu-gcc
-CXX = x86_64-linux-gnu-g++
-LIBRUBY = $(LIBRUBY_SO)
-LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a
-LIBRUBYARG_SHARED = -l$(RUBY_SO_NAME)
-LIBRUBYARG_STATIC = -l$(RUBY_SO_NAME)-static $(MAINLIBS)
-empty =
-OUTFLAG = -o $(empty)
-COUTFLAG = -o $(empty)
-CSRCFLAG = $(empty)
-
-RUBY_EXTCONF_H =
-cflags = $(optflags) $(debugflags) $(warnflags)
-cxxflags =
-optflags = -O3
-debugflags = -ggdb3
-warnflags = -Wall -Wextra -Wdeprecated-declarations -Wduplicated-cond -Wimplicit-function-declaration -Wimplicit-int -Wmisleading-indentation -Wpointer-arith -Wwrite-strings -Wimplicit-fallthrough=0 -Wmissing-noreturn -Wno-cast-function-type -Wno-constant-logical-operand -Wno-long-long -Wno-missing-field-initializers -Wno-overlength-strings -Wno-packed-bitfield-compat -Wno-parentheses-equality -Wno-self-assign -Wno-tautological-compare -Wno-unused-parameter -Wno-unused-value -Wsuggest-attribute=format -Wsuggest-attribute=noreturn -Wunused-variable
-cppflags =
-CCDLFLAGS = -fPIC
-CFLAGS = $(CCDLFLAGS) -g -O2 -ffile-prefix-map=/build/ruby3.0-ohOwi0/ruby3.0-3.0.2=. -fstack-protector-strong -Wformat -Werror=format-security -fPIC $(ARCH_FLAG)
-INCFLAGS = -I. -I$(arch_hdrdir) -I$(hdrdir)/ruby/backward -I$(hdrdir) -I$(srcdir)
-DEFS =
-CPPFLAGS = -DHAVE_BUILTIN___BUILTIN_CLZ -DHAVE_BUILTIN___BUILTIN_CLZL -DHAVE_BUILTIN___BUILTIN_CLZLL -DHAVE_FLOAT_H -DHAVE_MATH_H -DHAVE_STDBOOL_H -DHAVE_STDLIB_H -DHAVE_X86INTRIN_H -DHAVE_LABS -DHAVE_LLABS -DHAVE_FINITE -DHAVE_RUBY_ATOMIC_H -DHAVE_RUBY_INTERNAL_HAS_BUILTIN_H -DHAVE_RUBY_INTERNAL_STATIC_ASSERT_H -DHAVE_RB_RATIONAL_NUM -DHAVE_RB_RATIONAL_DEN -DHAVE_RB_COMPLEX_REAL -DHAVE_RB_COMPLEX_IMAG -DHAVE_RB_OPTS_EXCEPTION_P -DHAVE_RB_CATEGORY_WARN -DHAVE_CONST_RB_WARN_CATEGORY_DEPRECATED -Wdate-time -D_FORTIFY_SOURCE=2 $(DEFS) $(cppflags)
-CXXFLAGS = $(CCDLFLAGS) -g -O2 -ffile-prefix-map=/build/ruby3.0-ohOwi0/ruby3.0-3.0.2=. -fstack-protector-strong -Wformat -Werror=format-security $(ARCH_FLAG)
-ldflags = -L. -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -fstack-protector-strong -rdynamic -Wl,-export-dynamic
-dldflags = -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now
-ARCH_FLAG =
-DLDFLAGS = $(ldflags) $(dldflags) $(ARCH_FLAG)
-LDSHARED = $(CC) -shared
-LDSHAREDXX = $(CXX) -shared
-AR = x86_64-linux-gnu-gcc-ar
-EXEEXT =
-
-RUBY_INSTALL_NAME = $(RUBY_BASE_NAME)3.0
-RUBY_SO_NAME = ruby-3.0
-RUBYW_INSTALL_NAME =
-RUBY_VERSION_NAME = $(RUBY_BASE_NAME)-$(ruby_version)
-RUBYW_BASE_NAME = rubyw
-RUBY_BASE_NAME = ruby
-
-arch = x86_64-linux-gnu
-sitearch = $(arch)
-ruby_version = 3.0.0
-ruby = $(bindir)/$(RUBY_BASE_NAME)3.0
-RUBY = $(ruby)
-ruby_headers = $(hdrdir)/ruby.h $(hdrdir)/ruby/backward.h $(hdrdir)/ruby/ruby.h $(hdrdir)/ruby/defines.h $(hdrdir)/ruby/missing.h $(hdrdir)/ruby/intern.h $(hdrdir)/ruby/st.h $(hdrdir)/ruby/subst.h $(arch_hdrdir)/ruby/config.h
-
-RM = rm -f
-RM_RF = $(RUBY) -run -e rm -- -rf
-RMDIRS = rmdir --ignore-fail-on-non-empty -p
-MAKEDIRS = /usr/bin/mkdir -p
-INSTALL = /usr/bin/install -c
-INSTALL_PROG = $(INSTALL) -m 0755
-INSTALL_DATA = $(INSTALL) -m 644
-COPY = cp
-TOUCH = exit >
-
-#### End of system configuration section. ####
-
-preload =
-libpath = . $(archlibdir)
-LIBPATH = -L. -L$(archlibdir)
-DEFFILE =
-
-CLEANFILES = mkmf.log
-DISTCLEANFILES =
-DISTCLEANDIRS =
-
-extout =
-extout_prefix =
-target_prefix =
-LOCAL_LIBS =
-LIBS = $(LIBRUBYARG_SHARED) -lm -lc
-ORIG_SRCS = bigdecimal.c missing.c
-SRCS = $(ORIG_SRCS)
-OBJS = bigdecimal.o missing.o
-HDRS = $(srcdir)/bigdecimal.h $(srcdir)/bits.h $(srcdir)/feature.h $(srcdir)/missing.h $(srcdir)/static_assert.h
-LOCAL_HDRS =
-TARGET = bigdecimal
-TARGET_NAME = bigdecimal
-TARGET_ENTRY = Init_$(TARGET_NAME)
-DLLIB = $(TARGET).so
-EXTSTATIC =
-STATIC_LIB =
-
-TIMESTAMP_DIR = .
-BINDIR = $(bindir)
-RUBYCOMMONDIR = $(sitedir)$(target_prefix)
-RUBYLIBDIR = $(sitelibdir)$(target_prefix)
-RUBYARCHDIR = $(sitearchdir)$(target_prefix)
-HDRDIR = $(sitehdrdir)$(target_prefix)
-ARCHHDRDIR = $(sitearchhdrdir)$(target_prefix)
-TARGET_SO_DIR =
-TARGET_SO = $(TARGET_SO_DIR)$(DLLIB)
-CLEANLIBS = $(TARGET_SO)
-CLEANOBJS = *.o *.bak
-BIGDECIMAL_RB = $(srcdir)/../../lib/bigdecimal.rb
-
-all: $(DLLIB)
-static: $(STATIC_LIB)
-.PHONY: all install static install-so install-rb
-.PHONY: clean clean-so clean-static clean-rb
-
-clean-static::
-clean-rb-default::
-clean-rb::
-clean-so::
-clean: clean-so clean-static clean-rb-default clean-rb
- -$(Q)$(RM) $(CLEANLIBS) $(CLEANOBJS) $(CLEANFILES) .*.time
-
-distclean-rb-default::
-distclean-rb::
-distclean-so::
-distclean-static::
-distclean: clean distclean-so distclean-static distclean-rb-default distclean-rb
- -$(Q)$(RM) Makefile $(RUBY_EXTCONF_H) conftest.* mkmf.log
- -$(Q)$(RM) core ruby$(EXEEXT) *~ $(DISTCLEANFILES)
- -$(Q)$(RMDIRS) $(DISTCLEANDIRS) 2> /dev/null || true
-
-realclean: distclean
-install: install-so install-rb
-
-install-so: $(DLLIB) $(TIMESTAMP_DIR)/.sitearchdir.time
- $(INSTALL_PROG) $(DLLIB) $(RUBYARCHDIR)
-clean-static::
- -$(Q)$(RM) $(STATIC_LIB)
-install-rb: pre-install-rb do-install-rb install-rb-default
-install-rb-default: pre-install-rb-default do-install-rb-default
-pre-install-rb: Makefile
-pre-install-rb-default: Makefile
-do-install-rb:
-do-install-rb-default:
-pre-install-rb-default:
- @$(NULLCMD)
-$(TIMESTAMP_DIR)/.sitearchdir.time:
- $(Q) $(MAKEDIRS) $(@D) $(RUBYARCHDIR)
- $(Q) $(TOUCH) $@
-
-site-install: site-install-so site-install-rb
-site-install-so: install-so
-site-install-rb: install-rb
-
-.SUFFIXES: .c .m .cc .mm .cxx .cpp .o .S
-
-.cc.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.cc.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.mm.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.mm.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.cxx.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.cxx.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.cpp.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.cpp.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.c.o:
- $(ECHO) compiling $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.c.S:
- $(ECHO) translating $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.m.o:
- $(ECHO) compiling $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.m.S:
- $(ECHO) translating $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-$(TARGET_SO): $(OBJS) Makefile
- $(ECHO) linking shared-object $(DLLIB)
- -$(Q)$(RM) $(@)
- $(Q) $(LDSHARED) -o $@ $(OBJS) $(LIBPATH) $(DLDFLAGS) $(LOCAL_LIBS) $(LIBS)
-
-
-
-$(OBJS): $(HDRS) $(ruby_headers)
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.c b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.c
deleted file mode 100644
index 6eb14bc..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.c
+++ /dev/null
@@ -1,7737 +0,0 @@
-/*
- *
- * Ruby BigDecimal(Variable decimal precision) extension library.
- *
- * Copyright(C) 2002 by Shigeo Kobayashi(shigeo@tinyforest.gr.jp)
- *
- */
-
-/* #define BIGDECIMAL_DEBUG 1 */
-
-#include "bigdecimal.h"
-#include "ruby/util.h"
-
-#ifndef BIGDECIMAL_DEBUG
-# undef NDEBUG
-# define NDEBUG
-#endif
-#include
-
-#include
-#include
-#include
-#include
-#include
-#include
-
-#ifdef HAVE_IEEEFP_H
-#include
-#endif
-
-#include "bits.h"
-#include "static_assert.h"
-
-#define BIGDECIMAL_VERSION "3.1.4"
-
-/* #define ENABLE_NUMERIC_STRING */
-
-#define SIGNED_VALUE_MAX INTPTR_MAX
-#define SIGNED_VALUE_MIN INTPTR_MIN
-#define MUL_OVERFLOW_SIGNED_VALUE_P(a, b) MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, SIGNED_VALUE_MIN, SIGNED_VALUE_MAX)
-
-VALUE rb_cBigDecimal;
-VALUE rb_mBigMath;
-
-static ID id_BigDecimal_exception_mode;
-static ID id_BigDecimal_rounding_mode;
-static ID id_BigDecimal_precision_limit;
-
-static ID id_up;
-static ID id_down;
-static ID id_truncate;
-static ID id_half_up;
-static ID id_default;
-static ID id_half_down;
-static ID id_half_even;
-static ID id_banker;
-static ID id_ceiling;
-static ID id_ceil;
-static ID id_floor;
-static ID id_to_r;
-static ID id_eq;
-static ID id_half;
-
-#define RBD_NUM_ROUNDING_MODES 11
-
-static struct {
- ID id;
- uint8_t mode;
-} rbd_rounding_modes[RBD_NUM_ROUNDING_MODES];
-
-/* MACRO's to guard objects from GC by keeping them in stack */
-#ifdef RBIMPL_ATTR_MAYBE_UNUSED
-#define ENTER(n) RBIMPL_ATTR_MAYBE_UNUSED() volatile VALUE vStack[n];int iStack=0
-#else
-#define ENTER(n) volatile VALUE RB_UNUSED_VAR(vStack[n]);int iStack=0
-#endif
-#define PUSH(x) (vStack[iStack++] = (VALUE)(x))
-#define SAVE(p) PUSH((p)->obj)
-#define GUARD_OBJ(p,y) ((p)=(y), SAVE(p))
-
-#define BASE_FIG BIGDECIMAL_COMPONENT_FIGURES
-#define BASE BIGDECIMAL_BASE
-
-#define HALF_BASE (BASE/2)
-#define BASE1 (BASE/10)
-
-#define LOG10_2 0.3010299956639812
-
-#ifndef RRATIONAL_ZERO_P
-# define RRATIONAL_ZERO_P(x) (FIXNUM_P(rb_rational_num(x)) && \
- FIX2LONG(rb_rational_num(x)) == 0)
-#endif
-
-#ifndef RRATIONAL_NEGATIVE_P
-# define RRATIONAL_NEGATIVE_P(x) RTEST(rb_funcall((x), '<', 1, INT2FIX(0)))
-#endif
-
-#ifndef DECIMAL_SIZE_OF_BITS
-#define DECIMAL_SIZE_OF_BITS(n) (((n) * 3010 + 9998) / 9999)
-/* an approximation of ceil(n * log10(2)), upto 65536 at least */
-#endif
-
-#ifdef PRIsVALUE
-# define RB_OBJ_CLASSNAME(obj) rb_obj_class(obj)
-# define RB_OBJ_STRING(obj) (obj)
-#else
-# define PRIsVALUE "s"
-# define RB_OBJ_CLASSNAME(obj) rb_obj_classname(obj)
-# define RB_OBJ_STRING(obj) StringValueCStr(obj)
-#endif
-
-#ifndef MAYBE_UNUSED
-# define MAYBE_UNUSED(x) x
-#endif
-
-#define BIGDECIMAL_POSITIVE_P(bd) ((bd)->sign > 0)
-#define BIGDECIMAL_NEGATIVE_P(bd) ((bd)->sign < 0)
-
-/*
- * ================== Memory allocation ============================
- */
-
-#ifdef BIGDECIMAL_DEBUG
-static size_t rbd_allocation_count = 0; /* Memory allocation counter */
-static inline void
-atomic_allocation_count_inc(void)
-{
- RUBY_ATOMIC_SIZE_INC(rbd_allocation_count);
-}
-static inline void
-atomic_allocation_count_dec_nounderflow(void)
-{
- if (rbd_allocation_count == 0) return;
- RUBY_ATOMIC_SIZE_DEC(rbd_allocation_count);
-}
-static void
-check_allocation_count_nonzero(void)
-{
- if (rbd_allocation_count != 0) return;
- rb_bug("[bigdecimal][rbd_free_struct] Too many memory free calls");
-}
-#else
-# define atomic_allocation_count_inc() /* nothing */
-# define atomic_allocation_count_dec_nounderflow() /* nothing */
-# define check_allocation_count_nonzero() /* nothing */
-#endif /* BIGDECIMAL_DEBUG */
-
-PUREFUNC(static inline size_t rbd_struct_size(size_t const));
-
-static inline size_t
-rbd_struct_size(size_t const internal_digits)
-{
- size_t const frac_len = (internal_digits == 0) ? 1 : internal_digits;
- return offsetof(Real, frac) + frac_len * sizeof(DECDIG);
-}
-
-static inline Real *
-rbd_allocate_struct(size_t const internal_digits)
-{
- size_t const size = rbd_struct_size(internal_digits);
- Real *real = ruby_xcalloc(1, size);
- atomic_allocation_count_inc();
- real->MaxPrec = internal_digits;
- return real;
-}
-
-static size_t
-rbd_calculate_internal_digits(size_t const digits, bool limit_precision)
-{
- size_t const len = roomof(digits, BASE_FIG);
- if (limit_precision) {
- size_t const prec_limit = VpGetPrecLimit();
- if (prec_limit > 0) {
- /* NOTE: 2 more digits for rounding and division */
- size_t const max_len = roomof(prec_limit, BASE_FIG) + 2;
- if (len > max_len)
- return max_len;
- }
- }
-
- return len;
-}
-
-static inline Real *
-rbd_allocate_struct_decimal_digits(size_t const decimal_digits, bool limit_precision)
-{
- size_t const internal_digits = rbd_calculate_internal_digits(decimal_digits, limit_precision);
- return rbd_allocate_struct(internal_digits);
-}
-
-static VALUE BigDecimal_wrap_struct(VALUE obj, Real *vp);
-
-static Real *
-rbd_reallocate_struct(Real *real, size_t const internal_digits)
-{
- size_t const size = rbd_struct_size(internal_digits);
- VALUE obj = real ? real->obj : 0;
- Real *new_real = (Real *)ruby_xrealloc(real, size);
- new_real->MaxPrec = internal_digits;
- if (obj) {
- new_real->obj = 0;
- BigDecimal_wrap_struct(obj, new_real);
- }
- return new_real;
-}
-
-static void
-rbd_free_struct(Real *real)
-{
- if (real != NULL) {
- check_allocation_count_nonzero();
- ruby_xfree(real);
- atomic_allocation_count_dec_nounderflow();
- }
-}
-
-#define NewZero rbd_allocate_struct_zero
-static Real *
-rbd_allocate_struct_zero(int sign, size_t const digits, bool limit_precision)
-{
- Real *real = rbd_allocate_struct_decimal_digits(digits, limit_precision);
- VpSetZero(real, sign);
- return real;
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_zero_limited(int sign, size_t const digits));
-#define NewZeroLimited rbd_allocate_struct_zero_limited
-static inline Real *
-rbd_allocate_struct_zero_limited(int sign, size_t const digits)
-{
- return rbd_allocate_struct_zero(sign, digits, true);
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_zero_nolimit(int sign, size_t const digits));
-#define NewZeroNolimit rbd_allocate_struct_zero_nolimit
-static inline Real *
-rbd_allocate_struct_zero_nolimit(int sign, size_t const digits)
-{
- return rbd_allocate_struct_zero(sign, digits, false);
-}
-
-#define NewOne rbd_allocate_struct_one
-static Real *
-rbd_allocate_struct_one(int sign, size_t const digits, bool limit_precision)
-{
- Real *real = rbd_allocate_struct_decimal_digits(digits, limit_precision);
- VpSetOne(real);
- if (sign < 0)
- VpSetSign(real, VP_SIGN_NEGATIVE_FINITE);
- return real;
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_one_limited(int sign, size_t const digits));
-#define NewOneLimited rbd_allocate_struct_one_limited
-static inline Real *
-rbd_allocate_struct_one_limited(int sign, size_t const digits)
-{
- return rbd_allocate_struct_one(sign, digits, true);
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_one_nolimit(int sign, size_t const digits));
-#define NewOneNolimit rbd_allocate_struct_one_nolimit
-static inline Real *
-rbd_allocate_struct_one_nolimit(int sign, size_t const digits)
-{
- return rbd_allocate_struct_one(sign, digits, false);
-}
-
-/*
- * ================== Ruby Interface part ==========================
- */
-#define DoSomeOne(x,y,f) rb_num_coerce_bin(x,y,f)
-
-/*
- * VP routines used in BigDecimal part
- */
-static unsigned short VpGetException(void);
-static void VpSetException(unsigned short f);
-static void VpCheckException(Real *p, bool always);
-static VALUE VpCheckGetValue(Real *p);
-static void VpInternalRound(Real *c, size_t ixDigit, DECDIG vPrev, DECDIG v);
-static int VpLimitRound(Real *c, size_t ixDigit);
-static Real *VpCopy(Real *pv, Real const* const x);
-static int VPrint(FILE *fp,const char *cntl_chr,Real *a);
-
-/*
- * **** BigDecimal part ****
- */
-
-static VALUE BigDecimal_nan(void);
-static VALUE BigDecimal_positive_infinity(void);
-static VALUE BigDecimal_negative_infinity(void);
-static VALUE BigDecimal_positive_zero(void);
-static VALUE BigDecimal_negative_zero(void);
-
-static void
-BigDecimal_delete(void *pv)
-{
- rbd_free_struct(pv);
-}
-
-static size_t
-BigDecimal_memsize(const void *ptr)
-{
- const Real *pv = ptr;
- return (sizeof(*pv) + pv->MaxPrec * sizeof(DECDIG));
-}
-
-#ifndef HAVE_RB_EXT_RACTOR_SAFE
-# undef RUBY_TYPED_FROZEN_SHAREABLE
-# define RUBY_TYPED_FROZEN_SHAREABLE 0
-#endif
-
-static const rb_data_type_t BigDecimal_data_type = {
- "BigDecimal",
- { 0, BigDecimal_delete, BigDecimal_memsize, },
-#ifdef RUBY_TYPED_FREE_IMMEDIATELY
- 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_FROZEN_SHAREABLE | RUBY_TYPED_WB_PROTECTED
-#endif
-};
-
-static Real *
-rbd_allocate_struct_zero_wrap_klass(VALUE klass, int sign, size_t const digits, bool limit_precision)
-{
- Real *real = rbd_allocate_struct_zero(sign, digits, limit_precision);
- if (real != NULL) {
- VALUE obj = TypedData_Wrap_Struct(klass, &BigDecimal_data_type, 0);
- BigDecimal_wrap_struct(obj, real);
- }
- return real;
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_zero_limited_wrap(int sign, size_t const digits));
-#define NewZeroWrapLimited rbd_allocate_struct_zero_limited_wrap
-static inline Real *
-rbd_allocate_struct_zero_limited_wrap(int sign, size_t const digits)
-{
- return rbd_allocate_struct_zero_wrap_klass(rb_cBigDecimal, sign, digits, true);
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_zero_nolimit_wrap(int sign, size_t const digits));
-#define NewZeroWrapNolimit rbd_allocate_struct_zero_nolimit_wrap
-static inline Real *
-rbd_allocate_struct_zero_nolimit_wrap(int sign, size_t const digits)
-{
- return rbd_allocate_struct_zero_wrap_klass(rb_cBigDecimal, sign, digits, false);
-}
-
-static Real *
-rbd_allocate_struct_one_wrap_klass(VALUE klass, int sign, size_t const digits, bool limit_precision)
-{
- Real *real = rbd_allocate_struct_one(sign, digits, limit_precision);
- if (real != NULL) {
- VALUE obj = TypedData_Wrap_Struct(klass, &BigDecimal_data_type, 0);
- BigDecimal_wrap_struct(obj, real);
- }
- return real;
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_one_limited_wrap(int sign, size_t const digits));
-#define NewOneWrapLimited rbd_allocate_struct_one_limited_wrap
-static inline Real *
-rbd_allocate_struct_one_limited_wrap(int sign, size_t const digits)
-{
- return rbd_allocate_struct_one_wrap_klass(rb_cBigDecimal, sign, digits, true);
-}
-
-MAYBE_UNUSED(static inline Real * rbd_allocate_struct_one_nolimit_wrap(int sign, size_t const digits));
-#define NewOneWrapNolimit rbd_allocate_struct_one_nolimit_wrap
-static inline Real *
-rbd_allocate_struct_one_nolimit_wrap(int sign, size_t const digits)
-{
- return rbd_allocate_struct_one_wrap_klass(rb_cBigDecimal, sign, digits, false);
-}
-
-static inline int
-is_kind_of_BigDecimal(VALUE const v)
-{
- return rb_typeddata_is_kind_of(v, &BigDecimal_data_type);
-}
-
-NORETURN(static void cannot_be_coerced_into_BigDecimal(VALUE, VALUE));
-
-static void
-cannot_be_coerced_into_BigDecimal(VALUE exc_class, VALUE v)
-{
- VALUE str;
-
- if (rb_special_const_p(v)) {
- str = rb_inspect(v);
- }
- else {
- str = rb_class_name(rb_obj_class(v));
- }
-
- str = rb_str_cat2(rb_str_dup(str), " can't be coerced into BigDecimal");
- rb_exc_raise(rb_exc_new3(exc_class, str));
-}
-
-static inline VALUE BigDecimal_div2(VALUE, VALUE, VALUE);
-static VALUE rb_inum_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception);
-static VALUE rb_float_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception);
-static VALUE rb_rational_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception);
-static VALUE rb_cstr_convert_to_BigDecimal(const char *c_str, size_t digs, int raise_exception);
-static VALUE rb_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception);
-
-static Real*
-GetVpValueWithPrec(VALUE v, long prec, int must)
-{
- const size_t digs = prec < 0 ? SIZE_MAX : (size_t)prec;
-
- switch(TYPE(v)) {
- case T_FLOAT:
- v = rb_float_convert_to_BigDecimal(v, digs, must);
- break;
-
- case T_RATIONAL:
- v = rb_rational_convert_to_BigDecimal(v, digs, must);
- break;
-
- case T_DATA:
- if (!is_kind_of_BigDecimal(v)) {
- goto SomeOneMayDoIt;
- }
- break;
-
- case T_FIXNUM: {
- char szD[128];
- snprintf(szD, 128, "%ld", FIX2LONG(v));
- v = rb_cstr_convert_to_BigDecimal(szD, VpBaseFig() * 2 + 1, must);
- break;
- }
-
-#ifdef ENABLE_NUMERIC_STRING
- case T_STRING: {
- const char *c_str = StringValueCStr(v);
- v = rb_cstr_convert_to_BigDecimal(c_str, RSTRING_LEN(v) + VpBaseFig() + 1, must);
- break;
- }
-#endif /* ENABLE_NUMERIC_STRING */
-
- case T_BIGNUM: {
- VALUE bg = rb_big2str(v, 10);
- v = rb_cstr_convert_to_BigDecimal(RSTRING_PTR(bg), RSTRING_LEN(bg) + VpBaseFig() + 1, must);
- RB_GC_GUARD(bg);
- break;
- }
-
- default:
- goto SomeOneMayDoIt;
- }
-
- Real *vp;
- TypedData_Get_Struct(v, Real, &BigDecimal_data_type, vp);
- return vp;
-
-SomeOneMayDoIt:
- if (must) {
- cannot_be_coerced_into_BigDecimal(rb_eTypeError, v);
- }
- return NULL; /* NULL means to coerce */
-}
-
-static inline Real*
-GetVpValue(VALUE v, int must)
-{
- return GetVpValueWithPrec(v, -1, must);
-}
-
-/* call-seq:
- * BigDecimal.double_fig -> integer
- *
- * Returns the number of digits a Float object is allowed to have;
- * the result is system-dependent:
- *
- * BigDecimal.double_fig # => 16
- *
- */
-static inline VALUE
-BigDecimal_double_fig(VALUE self)
-{
- return INT2FIX(VpDblFig());
-}
-
-/* call-seq:
- * precs -> array
- *
- * Returns an Array of two Integer values that represent platform-dependent
- * internal storage properties.
- *
- * This method is deprecated and will be removed in the future.
- * Instead, use BigDecimal#n_significant_digits for obtaining the number of
- * significant digits in scientific notation, and BigDecimal#precision for
- * obtaining the number of digits in decimal notation.
- *
- */
-
-static VALUE
-BigDecimal_prec(VALUE self)
-{
- ENTER(1);
- Real *p;
- VALUE obj;
-
- rb_category_warn(RB_WARN_CATEGORY_DEPRECATED,
- "BigDecimal#precs is deprecated and will be removed in the future; "
- "use BigDecimal#precision instead.");
-
- GUARD_OBJ(p, GetVpValue(self, 1));
- obj = rb_assoc_new(SIZET2NUM(p->Prec*VpBaseFig()),
- SIZET2NUM(p->MaxPrec*VpBaseFig()));
- return obj;
-}
-
-static void
-BigDecimal_count_precision_and_scale(VALUE self, ssize_t *out_precision, ssize_t *out_scale)
-{
- ENTER(1);
-
- if (out_precision == NULL && out_scale == NULL)
- return;
-
- Real *p;
- GUARD_OBJ(p, GetVpValue(self, 1));
- if (VpIsZero(p) || !VpIsDef(p)) {
- zero:
- if (out_precision) *out_precision = 0;
- if (out_scale) *out_scale = 0;
- return;
- }
-
- DECDIG x;
-
- ssize_t n = p->Prec; /* The length of frac without zeros. */
- while (n > 0 && p->frac[n-1] == 0) --n;
- if (n == 0) goto zero;
-
- int nlz = BASE_FIG;
- for (x = p->frac[0]; x > 0; x /= 10) --nlz;
-
- int ntz = 0;
- for (x = p->frac[n-1]; x > 0 && x % 10 == 0; x /= 10) ++ntz;
-
- /*
- * Calculate the precision and the scale
- * -------------------------------------
- *
- * The most significant digit is frac[0], and the least significant digit
- * is frac[Prec-1]. When the exponent is zero, the decimal point is
- * located just before frac[0].
- *
- * When the exponent is negative, the decimal point moves to leftward.
- * In this case, the precision can be calculated by
- *
- * precision = BASE_FIG * (-exponent + n) - ntz,
- *
- * and the scale is the same as precision.
- *
- * 0 . 0000 0000 | frac[0] ... frac[n-1] |
- * |<----------| exponent == -2 |
- * |---------------------------------->| precision
- * |---------------------------------->| scale
- *
- *
- * Conversely, when the exponent is positive, the decimal point moves to
- * rightward. In this case, the scale equals to
- *
- * BASE_FIG * (n - exponent) - ntz.
- *
- * the precision equals to
- *
- * scale + BASE_FIG * exponent - nlz.
- *
- * | frac[0] frac[1] . frac[2] ... frac[n-1] |
- * |---------------->| exponent == 2 |
- * | |---------------------->| scale
- * |---------------------------------------->| precision
- */
-
- ssize_t ex = p->exponent;
-
- /* Count the number of decimal digits before frac[1]. */
- ssize_t n_digits_head = BASE_FIG;
- if (ex < 0) {
- n_digits_head += (-ex) * BASE_FIG; /* The number of leading zeros before frac[0]. */
- ex = 0;
- }
- else if (ex > 0) {
- /* Count the number of decimal digits without the leading zeros in
- * the most significant digit in the integral part.
- */
- n_digits_head -= nlz; /* Make the number of digits */
- }
-
- if (out_precision) {
- ssize_t precision = n_digits_head;
-
- /* Count the number of decimal digits after frac[0]. */
- if (ex > (ssize_t)n) {
- /* In this case the number is an integer with some trailing zeros. */
- precision += (ex - 1) * BASE_FIG;
- }
- else if (n > 0) {
- precision += (n - 1) * BASE_FIG;
-
- if (ex < (ssize_t)n) {
- precision -= ntz;
- }
- }
-
- *out_precision = precision;
- }
-
- if (out_scale) {
- ssize_t scale = 0;
-
- if (p->exponent < 0) {
- scale = n_digits_head + (n - 1) * BASE_FIG - ntz;
- }
- else if (n > p->exponent) {
- scale = (n - p->exponent) * BASE_FIG - ntz;
- }
-
- *out_scale = scale;
- }
-}
-
-/*
- * call-seq:
- * precision -> integer
- *
- * Returns the number of decimal digits in +self+:
- *
- * BigDecimal("0").precision # => 0
- * BigDecimal("1").precision # => 1
- * BigDecimal("1.1").precision # => 2
- * BigDecimal("3.1415").precision # => 5
- * BigDecimal("-1e20").precision # => 21
- * BigDecimal("1e-20").precision # => 20
- * BigDecimal("Infinity").precision # => 0
- * BigDecimal("-Infinity").precision # => 0
- * BigDecimal("NaN").precision # => 0
- *
- */
-static VALUE
-BigDecimal_precision(VALUE self)
-{
- ssize_t precision;
- BigDecimal_count_precision_and_scale(self, &precision, NULL);
- return SSIZET2NUM(precision);
-}
-
-/*
- * call-seq:
- * scale -> integer
- *
- * Returns the number of decimal digits following the decimal digits in +self+.
- *
- * BigDecimal("0").scale # => 0
- * BigDecimal("1").scale # => 1
- * BigDecimal("1.1").scale # => 1
- * BigDecimal("3.1415").scale # => 4
- * BigDecimal("-1e20").precision # => 0
- * BigDecimal("1e-20").precision # => 20
- * BigDecimal("Infinity").scale # => 0
- * BigDecimal("-Infinity").scale # => 0
- * BigDecimal("NaN").scale # => 0
- */
-static VALUE
-BigDecimal_scale(VALUE self)
-{
- ssize_t scale;
- BigDecimal_count_precision_and_scale(self, NULL, &scale);
- return SSIZET2NUM(scale);
-}
-
-/*
- * call-seq:
- * precision_scale -> [integer, integer]
- *
- * Returns a 2-length array; the first item is the result of
- * BigDecimal#precision and the second one is of BigDecimal#scale.
- *
- * See BigDecimal#precision.
- * See BigDecimal#scale.
- */
-static VALUE
-BigDecimal_precision_scale(VALUE self)
-{
- ssize_t precision, scale;
- BigDecimal_count_precision_and_scale(self, &precision, &scale);
- return rb_assoc_new(SSIZET2NUM(precision), SSIZET2NUM(scale));
-}
-
-/*
- * call-seq:
- * n_significant_digits -> integer
- *
- * Returns the number of decimal significant digits in +self+.
- *
- * BigDecimal("0").n_significant_digits # => 0
- * BigDecimal("1").n_significant_digits # => 1
- * BigDecimal("1.1").n_significant_digits # => 2
- * BigDecimal("3.1415").n_significant_digits # => 5
- * BigDecimal("-1e20").n_significant_digits # => 1
- * BigDecimal("1e-20").n_significant_digits # => 1
- * BigDecimal("Infinity").n_significant_digits # => 0
- * BigDecimal("-Infinity").n_significant_digits # => 0
- * BigDecimal("NaN").n_significant_digits # => 0
- */
-static VALUE
-BigDecimal_n_significant_digits(VALUE self)
-{
- ENTER(1);
-
- Real *p;
- GUARD_OBJ(p, GetVpValue(self, 1));
- if (VpIsZero(p) || !VpIsDef(p)) {
- return INT2FIX(0);
- }
-
- ssize_t n = p->Prec; /* The length of frac without trailing zeros. */
- for (n = p->Prec; n > 0 && p->frac[n-1] == 0; --n);
- if (n == 0) return INT2FIX(0);
-
- DECDIG x;
- int nlz = BASE_FIG;
- for (x = p->frac[0]; x > 0; x /= 10) --nlz;
-
- int ntz = 0;
- for (x = p->frac[n-1]; x > 0 && x % 10 == 0; x /= 10) ++ntz;
-
- ssize_t n_significant_digits = BASE_FIG*n - nlz - ntz;
- return SSIZET2NUM(n_significant_digits);
-}
-
-/*
- * call-seq:
- * hash -> integer
- *
- * Returns the integer hash value for +self+.
- *
- * Two instances of \BigDecimal have the same hash value if and only if
- * they have equal:
- *
- * - Sign.
- * - Fractional part.
- * - Exponent.
- *
- */
-static VALUE
-BigDecimal_hash(VALUE self)
-{
- ENTER(1);
- Real *p;
- st_index_t hash;
-
- GUARD_OBJ(p, GetVpValue(self, 1));
- hash = (st_index_t)p->sign;
- /* hash!=2: the case for 0(1),NaN(0) or +-Infinity(3) is sign itself */
- if(hash == 2 || hash == (st_index_t)-2) {
- hash ^= rb_memhash(p->frac, sizeof(DECDIG)*p->Prec);
- hash += p->exponent;
- }
- return ST2FIX(hash);
-}
-
-/*
- * call-seq:
- * _dump -> string
- *
- * Returns a string representing the marshalling of +self+.
- * See module Marshal.
- *
- * inf = BigDecimal('Infinity') # => Infinity
- * dumped = inf._dump # => "9:Infinity"
- * BigDecimal._load(dumped) # => Infinity
- *
- */
-static VALUE
-BigDecimal_dump(int argc, VALUE *argv, VALUE self)
-{
- ENTER(5);
- Real *vp;
- char *psz;
- VALUE dummy;
- volatile VALUE dump;
- size_t len;
-
- rb_scan_args(argc, argv, "01", &dummy);
- GUARD_OBJ(vp,GetVpValue(self, 1));
- dump = rb_str_new(0, VpNumOfChars(vp, "E")+50);
- psz = RSTRING_PTR(dump);
- snprintf(psz, RSTRING_LEN(dump), "%"PRIuSIZE":", VpMaxPrec(vp)*VpBaseFig());
- len = strlen(psz);
- VpToString(vp, psz+len, RSTRING_LEN(dump)-len, 0, 0);
- rb_str_resize(dump, strlen(psz));
- return dump;
-}
-
-/*
- * Internal method used to provide marshalling support. See the Marshal module.
- */
-static VALUE
-BigDecimal_load(VALUE self, VALUE str)
-{
- ENTER(2);
- Real *pv;
- unsigned char *pch;
- unsigned char ch;
- unsigned long m=0;
-
- pch = (unsigned char *)StringValueCStr(str);
- /* First get max prec */
- while((*pch) != (unsigned char)'\0' && (ch = *pch++) != (unsigned char)':') {
- if(!ISDIGIT(ch)) {
- rb_raise(rb_eTypeError, "load failed: invalid character in the marshaled string");
- }
- m = m*10 + (unsigned long)(ch-'0');
- }
- if (m > VpBaseFig()) m -= VpBaseFig();
- GUARD_OBJ(pv, VpNewRbClass(m, (char *)pch, self, true, true));
- m /= VpBaseFig();
- if (m && pv->MaxPrec > m) {
- pv->MaxPrec = m+1;
- }
- return VpCheckGetValue(pv);
-}
-
-static unsigned short
-check_rounding_mode_option(VALUE const opts)
-{
- VALUE mode;
- char const *s;
- long l;
-
- assert(RB_TYPE_P(opts, T_HASH));
-
- if (NIL_P(opts))
- goto no_opt;
-
- mode = rb_hash_lookup2(opts, ID2SYM(id_half), Qundef);
- if (mode == Qundef || NIL_P(mode))
- goto no_opt;
-
- if (SYMBOL_P(mode))
- mode = rb_sym2str(mode);
- else if (!RB_TYPE_P(mode, T_STRING)) {
- VALUE str_mode = rb_check_string_type(mode);
- if (NIL_P(str_mode))
- goto invalid;
- mode = str_mode;
- }
- s = RSTRING_PTR(mode);
- l = RSTRING_LEN(mode);
- switch (l) {
- case 2:
- if (strncasecmp(s, "up", 2) == 0)
- return VP_ROUND_HALF_UP;
- break;
- case 4:
- if (strncasecmp(s, "even", 4) == 0)
- return VP_ROUND_HALF_EVEN;
- else if (strncasecmp(s, "down", 4) == 0)
- return VP_ROUND_HALF_DOWN;
- break;
- default:
- break;
- }
-
- invalid:
- rb_raise(rb_eArgError, "invalid rounding mode (%"PRIsVALUE")", mode);
-
- no_opt:
- return VpGetRoundMode();
-}
-
-static unsigned short
-check_rounding_mode(VALUE const v)
-{
- unsigned short sw;
- ID id;
- if (RB_TYPE_P(v, T_SYMBOL)) {
- int i;
- id = SYM2ID(v);
- for (i = 0; i < RBD_NUM_ROUNDING_MODES; ++i) {
- if (rbd_rounding_modes[i].id == id) {
- return rbd_rounding_modes[i].mode;
- }
- }
- rb_raise(rb_eArgError, "invalid rounding mode (%"PRIsVALUE")", v);
- }
- else {
- sw = NUM2USHORT(v);
- if (!VpIsRoundMode(sw)) {
- rb_raise(rb_eArgError, "invalid rounding mode (%"PRIsVALUE")", v);
- }
- return sw;
- }
-}
-
-/* call-seq:
- * BigDecimal.mode(mode, setting = nil) -> integer
- *
- * Returns an integer representing the mode settings
- * for exception handling and rounding.
- *
- * These modes control exception handling:
- *
- * - \BigDecimal::EXCEPTION_NaN.
- * - \BigDecimal::EXCEPTION_INFINITY.
- * - \BigDecimal::EXCEPTION_UNDERFLOW.
- * - \BigDecimal::EXCEPTION_OVERFLOW.
- * - \BigDecimal::EXCEPTION_ZERODIVIDE.
- * - \BigDecimal::EXCEPTION_ALL.
- *
- * Values for +setting+ for exception handling:
- *
- * - +true+: sets the given +mode+ to +true+.
- * - +false+: sets the given +mode+ to +false+.
- * - +nil+: does not modify the mode settings.
- *
- * You can use method BigDecimal.save_exception_mode
- * to temporarily change, and then automatically restore, exception modes.
- *
- * For clarity, some examples below begin by setting all
- * exception modes to +false+.
- *
- * This mode controls the way rounding is to be performed:
- *
- * - \BigDecimal::ROUND_MODE
- *
- * You can use method BigDecimal.save_rounding_mode
- * to temporarily change, and then automatically restore, the rounding mode.
- *
- * NaNs
- *
- * Mode \BigDecimal::EXCEPTION_NaN controls behavior
- * when a \BigDecimal NaN is created.
- *
- * Settings:
- *
- * - +false+ (default): Returns BigDecimal('NaN').
- * - +true+: Raises FloatDomainError.
- *
- * Examples:
- *
- * BigDecimal.mode(BigDecimal::EXCEPTION_ALL, false) # => 0
- * BigDecimal('NaN') # => NaN
- * BigDecimal.mode(BigDecimal::EXCEPTION_NaN, true) # => 2
- * BigDecimal('NaN') # Raises FloatDomainError
- *
- * Infinities
- *
- * Mode \BigDecimal::EXCEPTION_INFINITY controls behavior
- * when a \BigDecimal Infinity or -Infinity is created.
- * Settings:
- *
- * - +false+ (default): Returns BigDecimal('Infinity')
- * or BigDecimal('-Infinity').
- * - +true+: Raises FloatDomainError.
- *
- * Examples:
- *
- * BigDecimal.mode(BigDecimal::EXCEPTION_ALL, false) # => 0
- * BigDecimal('Infinity') # => Infinity
- * BigDecimal('-Infinity') # => -Infinity
- * BigDecimal.mode(BigDecimal::EXCEPTION_INFINITY, true) # => 1
- * BigDecimal('Infinity') # Raises FloatDomainError
- * BigDecimal('-Infinity') # Raises FloatDomainError
- *
- * Underflow
- *
- * Mode \BigDecimal::EXCEPTION_UNDERFLOW controls behavior
- * when a \BigDecimal underflow occurs.
- * Settings:
- *
- * - +false+ (default): Returns BigDecimal('0')
- * or BigDecimal('-Infinity').
- * - +true+: Raises FloatDomainError.
- *
- * Examples:
- *
- * BigDecimal.mode(BigDecimal::EXCEPTION_ALL, false) # => 0
- * def flow_under
- * x = BigDecimal('0.1')
- * 100.times { x *= x }
- * end
- * flow_under # => 100
- * BigDecimal.mode(BigDecimal::EXCEPTION_UNDERFLOW, true) # => 4
- * flow_under # Raises FloatDomainError
- *
- * Overflow
- *
- * Mode \BigDecimal::EXCEPTION_OVERFLOW controls behavior
- * when a \BigDecimal overflow occurs.
- * Settings:
- *
- * - +false+ (default): Returns BigDecimal('Infinity')
- * or BigDecimal('-Infinity').
- * - +true+: Raises FloatDomainError.
- *
- * Examples:
- *
- * BigDecimal.mode(BigDecimal::EXCEPTION_ALL, false) # => 0
- * def flow_over
- * x = BigDecimal('10')
- * 100.times { x *= x }
- * end
- * flow_over # => 100
- * BigDecimal.mode(BigDecimal::EXCEPTION_OVERFLOW, true) # => 1
- * flow_over # Raises FloatDomainError
- *
- * Zero Division
- *
- * Mode \BigDecimal::EXCEPTION_ZERODIVIDE controls behavior
- * when a zero-division occurs.
- * Settings:
- *
- * - +false+ (default): Returns BigDecimal('Infinity')
- * or BigDecimal('-Infinity').
- * - +true+: Raises FloatDomainError.
- *
- * Examples:
- *
- * BigDecimal.mode(BigDecimal::EXCEPTION_ALL, false) # => 0
- * one = BigDecimal('1')
- * zero = BigDecimal('0')
- * one / zero # => Infinity
- * BigDecimal.mode(BigDecimal::EXCEPTION_ZERODIVIDE, true) # => 16
- * one / zero # Raises FloatDomainError
- *
- * All Exceptions
- *
- * Mode \BigDecimal::EXCEPTION_ALL controls all of the above:
- *
- * BigDecimal.mode(BigDecimal::EXCEPTION_ALL, false) # => 0
- * BigDecimal.mode(BigDecimal::EXCEPTION_ALL, true) # => 23
- *
- * Rounding
- *
- * Mode \BigDecimal::ROUND_MODE controls the way rounding is to be performed;
- * its +setting+ values are:
- *
- * - +ROUND_UP+: Round away from zero.
- * Aliased as +:up+.
- * - +ROUND_DOWN+: Round toward zero.
- * Aliased as +:down+ and +:truncate+.
- * - +ROUND_HALF_UP+: Round toward the nearest neighbor;
- * if the neighbors are equidistant, round away from zero.
- * Aliased as +:half_up+ and +:default+.
- * - +ROUND_HALF_DOWN+: Round toward the nearest neighbor;
- * if the neighbors are equidistant, round toward zero.
- * Aliased as +:half_down+.
- * - +ROUND_HALF_EVEN+ (Banker's rounding): Round toward the nearest neighbor;
- * if the neighbors are equidistant, round toward the even neighbor.
- * Aliased as +:half_even+ and +:banker+.
- * - +ROUND_CEILING+: Round toward positive infinity.
- * Aliased as +:ceiling+ and +:ceil+.
- * - +ROUND_FLOOR+: Round toward negative infinity.
- * Aliased as +:floor:+.
- *
- */
-static VALUE
-BigDecimal_mode(int argc, VALUE *argv, VALUE self)
-{
- VALUE which;
- VALUE val;
- unsigned long f,fo;
-
- rb_scan_args(argc, argv, "11", &which, &val);
- f = (unsigned long)NUM2INT(which);
-
- if (f & VP_EXCEPTION_ALL) {
- /* Exception mode setting */
- fo = VpGetException();
- if (val == Qnil) return INT2FIX(fo);
- if (val != Qfalse && val!=Qtrue) {
- rb_raise(rb_eArgError, "second argument must be true or false");
- return Qnil; /* Not reached */
- }
- if (f & VP_EXCEPTION_INFINITY) {
- VpSetException((unsigned short)((val == Qtrue) ? (fo | VP_EXCEPTION_INFINITY) :
- (fo & (~VP_EXCEPTION_INFINITY))));
- }
- fo = VpGetException();
- if (f & VP_EXCEPTION_NaN) {
- VpSetException((unsigned short)((val == Qtrue) ? (fo | VP_EXCEPTION_NaN) :
- (fo & (~VP_EXCEPTION_NaN))));
- }
- fo = VpGetException();
- if (f & VP_EXCEPTION_UNDERFLOW) {
- VpSetException((unsigned short)((val == Qtrue) ? (fo | VP_EXCEPTION_UNDERFLOW) :
- (fo & (~VP_EXCEPTION_UNDERFLOW))));
- }
- fo = VpGetException();
- if(f & VP_EXCEPTION_ZERODIVIDE) {
- VpSetException((unsigned short)((val == Qtrue) ? (fo | VP_EXCEPTION_ZERODIVIDE) :
- (fo & (~VP_EXCEPTION_ZERODIVIDE))));
- }
- fo = VpGetException();
- return INT2FIX(fo);
- }
- if (VP_ROUND_MODE == f) {
- /* Rounding mode setting */
- unsigned short sw;
- fo = VpGetRoundMode();
- if (NIL_P(val)) return INT2FIX(fo);
- sw = check_rounding_mode(val);
- fo = VpSetRoundMode(sw);
- return INT2FIX(fo);
- }
- rb_raise(rb_eTypeError, "first argument for BigDecimal.mode invalid");
- return Qnil;
-}
-
-static size_t
-GetAddSubPrec(Real *a, Real *b)
-{
- size_t mxs;
- size_t mx = a->Prec;
- SIGNED_VALUE d;
-
- if (!VpIsDef(a) || !VpIsDef(b)) return (size_t)-1L;
- if (mx < b->Prec) mx = b->Prec;
- if (a->exponent != b->exponent) {
- mxs = mx;
- d = a->exponent - b->exponent;
- if (d < 0) d = -d;
- mx = mx + (size_t)d;
- if (mx < mxs) {
- return VpException(VP_EXCEPTION_INFINITY, "Exponent overflow", 0);
- }
- }
- return mx;
-}
-
-static inline SIGNED_VALUE
-check_int_precision(VALUE v)
-{
- SIGNED_VALUE n;
-#if SIZEOF_VALUE <= SIZEOF_LONG
- n = (SIGNED_VALUE)NUM2LONG(v);
-#elif SIZEOF_VALUE <= SIZEOF_LONG_LONG
- n = (SIGNED_VALUE)NUM2LL(v);
-#else
-# error SIZEOF_VALUE is too large
-#endif
- if (n < 0) {
- rb_raise(rb_eArgError, "negative precision");
- }
- return n;
-}
-
-static VALUE
-BigDecimal_wrap_struct(VALUE obj, Real *vp)
-{
- assert(is_kind_of_BigDecimal(obj));
- assert(vp != NULL);
-
- if (vp->obj == obj && RTYPEDDATA_DATA(obj) == vp)
- return obj;
-
- assert(RTYPEDDATA_DATA(obj) == NULL);
- assert(vp->obj == 0);
-
- RTYPEDDATA_DATA(obj) = vp;
- vp->obj = obj;
- RB_OBJ_FREEZE(obj);
- return obj;
-}
-
-VP_EXPORT Real *
-VpNewRbClass(size_t mx, const char *str, VALUE klass, bool strict_p, bool raise_exception)
-{
- VALUE obj = TypedData_Wrap_Struct(klass, &BigDecimal_data_type, 0);
- Real *pv = VpAlloc(mx, str, strict_p, raise_exception);
- if (!pv)
- return NULL;
- BigDecimal_wrap_struct(obj, pv);
- return pv;
-}
-
-VP_EXPORT Real *
-VpCreateRbObject(size_t mx, const char *str, bool raise_exception)
-{
- return VpNewRbClass(mx, str, rb_cBigDecimal, true, raise_exception);
-}
-
-static Real *
-VpCopy(Real *pv, Real const* const x)
-{
- assert(x != NULL);
-
- pv = rbd_reallocate_struct(pv, x->MaxPrec);
- pv->MaxPrec = x->MaxPrec;
- pv->Prec = x->Prec;
- pv->exponent = x->exponent;
- pv->sign = x->sign;
- pv->flag = x->flag;
- MEMCPY(pv->frac, x->frac, DECDIG, pv->MaxPrec);
-
- return pv;
-}
-
-/* Returns True if the value is Not a Number. */
-static VALUE
-BigDecimal_IsNaN(VALUE self)
-{
- Real *p = GetVpValue(self, 1);
- if (VpIsNaN(p)) return Qtrue;
- return Qfalse;
-}
-
-/* Returns nil, -1, or +1 depending on whether the value is finite,
- * -Infinity, or +Infinity.
- */
-static VALUE
-BigDecimal_IsInfinite(VALUE self)
-{
- Real *p = GetVpValue(self, 1);
- if (VpIsPosInf(p)) return INT2FIX(1);
- if (VpIsNegInf(p)) return INT2FIX(-1);
- return Qnil;
-}
-
-/* Returns True if the value is finite (not NaN or infinite). */
-static VALUE
-BigDecimal_IsFinite(VALUE self)
-{
- Real *p = GetVpValue(self, 1);
- if (VpIsNaN(p)) return Qfalse;
- if (VpIsInf(p)) return Qfalse;
- return Qtrue;
-}
-
-static void
-BigDecimal_check_num(Real *p)
-{
- VpCheckException(p, true);
-}
-
-static VALUE BigDecimal_split(VALUE self);
-
-/* Returns the value as an Integer.
- *
- * If the BigDecimal is infinity or NaN, raises FloatDomainError.
- */
-static VALUE
-BigDecimal_to_i(VALUE self)
-{
- ENTER(5);
- ssize_t e, nf;
- Real *p;
-
- GUARD_OBJ(p, GetVpValue(self, 1));
- BigDecimal_check_num(p);
-
- e = VpExponent10(p);
- if (e <= 0) return INT2FIX(0);
- nf = VpBaseFig();
- if (e <= nf) {
- return LONG2NUM((long)(VpGetSign(p) * (DECDIG_DBL_SIGNED)p->frac[0]));
- }
- else {
- VALUE a = BigDecimal_split(self);
- VALUE digits = RARRAY_AREF(a, 1);
- VALUE numerator = rb_funcall(digits, rb_intern("to_i"), 0);
- VALUE ret;
- ssize_t dpower = e - (ssize_t)RSTRING_LEN(digits);
-
- if (BIGDECIMAL_NEGATIVE_P(p)) {
- numerator = rb_funcall(numerator, '*', 1, INT2FIX(-1));
- }
- if (dpower < 0) {
- ret = rb_funcall(numerator, rb_intern("div"), 1,
- rb_funcall(INT2FIX(10), rb_intern("**"), 1,
- INT2FIX(-dpower)));
- }
- else {
- ret = rb_funcall(numerator, '*', 1,
- rb_funcall(INT2FIX(10), rb_intern("**"), 1,
- INT2FIX(dpower)));
- }
- if (RB_TYPE_P(ret, T_FLOAT)) {
- rb_raise(rb_eFloatDomainError, "Infinity");
- }
- return ret;
- }
-}
-
-/* Returns a new Float object having approximately the same value as the
- * BigDecimal number. Normal accuracy limits and built-in errors of binary
- * Float arithmetic apply.
- */
-static VALUE
-BigDecimal_to_f(VALUE self)
-{
- ENTER(1);
- Real *p;
- double d;
- SIGNED_VALUE e;
- char *buf;
- volatile VALUE str;
-
- GUARD_OBJ(p, GetVpValue(self, 1));
- if (VpVtoD(&d, &e, p) != 1)
- return rb_float_new(d);
- if (e > (SIGNED_VALUE)(DBL_MAX_10_EXP+BASE_FIG))
- goto overflow;
- if (e < (SIGNED_VALUE)(DBL_MIN_10_EXP-BASE_FIG))
- goto underflow;
-
- str = rb_str_new(0, VpNumOfChars(p, "E"));
- buf = RSTRING_PTR(str);
- VpToString(p, buf, RSTRING_LEN(str), 0, 0);
- errno = 0;
- d = strtod(buf, 0);
- if (errno == ERANGE) {
- if (d == 0.0) goto underflow;
- if (fabs(d) >= HUGE_VAL) goto overflow;
- }
- return rb_float_new(d);
-
-overflow:
- VpException(VP_EXCEPTION_OVERFLOW, "BigDecimal to Float conversion", 0);
- if (BIGDECIMAL_NEGATIVE_P(p))
- return rb_float_new(VpGetDoubleNegInf());
- else
- return rb_float_new(VpGetDoublePosInf());
-
-underflow:
- VpException(VP_EXCEPTION_UNDERFLOW, "BigDecimal to Float conversion", 0);
- if (BIGDECIMAL_NEGATIVE_P(p))
- return rb_float_new(-0.0);
- else
- return rb_float_new(0.0);
-}
-
-
-/* Converts a BigDecimal to a Rational.
- */
-static VALUE
-BigDecimal_to_r(VALUE self)
-{
- Real *p;
- ssize_t sign, power, denomi_power;
- VALUE a, digits, numerator;
-
- p = GetVpValue(self, 1);
- BigDecimal_check_num(p);
-
- sign = VpGetSign(p);
- power = VpExponent10(p);
- a = BigDecimal_split(self);
- digits = RARRAY_AREF(a, 1);
- denomi_power = power - RSTRING_LEN(digits);
- numerator = rb_funcall(digits, rb_intern("to_i"), 0);
-
- if (sign < 0) {
- numerator = rb_funcall(numerator, '*', 1, INT2FIX(-1));
- }
- if (denomi_power < 0) {
- return rb_Rational(numerator,
- rb_funcall(INT2FIX(10), rb_intern("**"), 1,
- INT2FIX(-denomi_power)));
- }
- else {
- return rb_Rational1(rb_funcall(numerator, '*', 1,
- rb_funcall(INT2FIX(10), rb_intern("**"), 1,
- INT2FIX(denomi_power))));
- }
-}
-
-/* The coerce method provides support for Ruby type coercion. It is not
- * enabled by default.
- *
- * This means that binary operations like + * / or - can often be performed
- * on a BigDecimal and an object of another type, if the other object can
- * be coerced into a BigDecimal value.
- *
- * e.g.
- * a = BigDecimal("1.0")
- * b = a / 2.0 #=> 0.5
- *
- * Note that coercing a String to a BigDecimal is not supported by default;
- * it requires a special compile-time option when building Ruby.
- */
-static VALUE
-BigDecimal_coerce(VALUE self, VALUE other)
-{
- ENTER(2);
- VALUE obj;
- Real *b;
-
- if (RB_TYPE_P(other, T_FLOAT)) {
- GUARD_OBJ(b, GetVpValueWithPrec(other, 0, 1));
- obj = rb_assoc_new(VpCheckGetValue(b), self);
- }
- else {
- if (RB_TYPE_P(other, T_RATIONAL)) {
- Real* pv = DATA_PTR(self);
- GUARD_OBJ(b, GetVpValueWithPrec(other, pv->Prec*VpBaseFig(), 1));
- }
- else {
- GUARD_OBJ(b, GetVpValue(other, 1));
- }
- obj = rb_assoc_new(b->obj, self);
- }
-
- return obj;
-}
-
-/*
- * call-seq:
- * +big_decimal -> self
- *
- * Returns +self+:
- *
- * +BigDecimal(5) # => 0.5e1
- * +BigDecimal(-5) # => -0.5e1
- *
- */
-
-static VALUE
-BigDecimal_uplus(VALUE self)
-{
- return self;
-}
-
- /*
- * call-seq:
- * self + value -> bigdecimal
- *
- * Returns the \BigDecimal sum of +self+ and +value+:
- *
- * b = BigDecimal('111111.111') # => 0.111111111e6
- * b + 2 # => 0.111113111e6
- * b + 2.0 # => 0.111113111e6
- * b + Rational(2, 1) # => 0.111113111e6
- * b + Complex(2, 0) # => (0.111113111e6+0i)
- *
- * See the {Note About Precision}[BigDecimal.html#class-BigDecimal-label-A+Note+About+Precision].
- *
- */
-
-static VALUE
-BigDecimal_add(VALUE self, VALUE r)
-{
- ENTER(5);
- Real *c, *a, *b;
- size_t mx;
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- if (RB_TYPE_P(r, T_FLOAT)) {
- b = GetVpValueWithPrec(r, 0, 1);
- }
- else if (RB_TYPE_P(r, T_RATIONAL)) {
- b = GetVpValueWithPrec(r, a->Prec*VpBaseFig(), 1);
- }
- else {
- b = GetVpValue(r, 0);
- }
-
- if (!b) return DoSomeOne(self,r,'+');
- SAVE(b);
-
- if (VpIsNaN(b)) return b->obj;
- if (VpIsNaN(a)) return a->obj;
-
- mx = GetAddSubPrec(a, b);
- if (mx == (size_t)-1L) {
- GUARD_OBJ(c, NewZeroWrapLimited(1, VpBaseFig() + 1));
- VpAddSub(c, a, b, 1);
- }
- else {
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx * (VpBaseFig() + 1)));
- if (!mx) {
- VpSetInf(c, VpGetSign(a));
- }
- else {
- VpAddSub(c, a, b, 1);
- }
- }
- return VpCheckGetValue(c);
-}
-
- /* call-seq:
- * self - value -> bigdecimal
- *
- * Returns the \BigDecimal difference of +self+ and +value+:
- *
- * b = BigDecimal('333333.333') # => 0.333333333e6
- * b - 2 # => 0.333331333e6
- * b - 2.0 # => 0.333331333e6
- * b - Rational(2, 1) # => 0.333331333e6
- * b - Complex(2, 0) # => (0.333331333e6+0i)
- *
- * See the {Note About Precision}[BigDecimal.html#class-BigDecimal-label-A+Note+About+Precision].
- *
- */
-static VALUE
-BigDecimal_sub(VALUE self, VALUE r)
-{
- ENTER(5);
- Real *c, *a, *b;
- size_t mx;
-
- GUARD_OBJ(a, GetVpValue(self,1));
- if (RB_TYPE_P(r, T_FLOAT)) {
- b = GetVpValueWithPrec(r, 0, 1);
- }
- else if (RB_TYPE_P(r, T_RATIONAL)) {
- b = GetVpValueWithPrec(r, a->Prec*VpBaseFig(), 1);
- }
- else {
- b = GetVpValue(r,0);
- }
-
- if (!b) return DoSomeOne(self,r,'-');
- SAVE(b);
-
- if (VpIsNaN(b)) return b->obj;
- if (VpIsNaN(a)) return a->obj;
-
- mx = GetAddSubPrec(a,b);
- if (mx == (size_t)-1L) {
- GUARD_OBJ(c, NewZeroWrapLimited(1, VpBaseFig() + 1));
- VpAddSub(c, a, b, -1);
- }
- else {
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx *(VpBaseFig() + 1)));
- if (!mx) {
- VpSetInf(c,VpGetSign(a));
- }
- else {
- VpAddSub(c, a, b, -1);
- }
- }
- return VpCheckGetValue(c);
-}
-
-static VALUE
-BigDecimalCmp(VALUE self, VALUE r,char op)
-{
- ENTER(5);
- SIGNED_VALUE e;
- Real *a, *b=0;
- GUARD_OBJ(a, GetVpValue(self, 1));
- switch (TYPE(r)) {
- case T_DATA:
- if (!is_kind_of_BigDecimal(r)) break;
- /* fall through */
- case T_FIXNUM:
- /* fall through */
- case T_BIGNUM:
- GUARD_OBJ(b, GetVpValue(r, 0));
- break;
-
- case T_FLOAT:
- GUARD_OBJ(b, GetVpValueWithPrec(r, 0, 0));
- break;
-
- case T_RATIONAL:
- GUARD_OBJ(b, GetVpValueWithPrec(r, a->Prec*VpBaseFig(), 0));
- break;
-
- default:
- break;
- }
- if (b == NULL) {
- ID f = 0;
-
- switch (op) {
- case '*':
- return rb_num_coerce_cmp(self, r, rb_intern("<=>"));
-
- case '=':
- return RTEST(rb_num_coerce_cmp(self, r, rb_intern("=="))) ? Qtrue : Qfalse;
-
- case 'G':
- f = rb_intern(">=");
- break;
-
- case 'L':
- f = rb_intern("<=");
- break;
-
- case '>':
- /* fall through */
- case '<':
- f = (ID)op;
- break;
-
- default:
- break;
- }
- return rb_num_coerce_relop(self, r, f);
- }
- SAVE(b);
- e = VpComp(a, b);
- if (e == 999)
- return (op == '*') ? Qnil : Qfalse;
- switch (op) {
- case '*':
- return INT2FIX(e); /* any op */
-
- case '=':
- if (e == 0) return Qtrue;
- return Qfalse;
-
- case 'G':
- if (e >= 0) return Qtrue;
- return Qfalse;
-
- case '>':
- if (e > 0) return Qtrue;
- return Qfalse;
-
- case 'L':
- if (e <= 0) return Qtrue;
- return Qfalse;
-
- case '<':
- if (e < 0) return Qtrue;
- return Qfalse;
-
- default:
- break;
- }
-
- rb_bug("Undefined operation in BigDecimalCmp()");
-
- UNREACHABLE;
-}
-
-/* Returns True if the value is zero. */
-static VALUE
-BigDecimal_zero(VALUE self)
-{
- Real *a = GetVpValue(self, 1);
- return VpIsZero(a) ? Qtrue : Qfalse;
-}
-
-/* Returns self if the value is non-zero, nil otherwise. */
-static VALUE
-BigDecimal_nonzero(VALUE self)
-{
- Real *a = GetVpValue(self, 1);
- return VpIsZero(a) ? Qnil : self;
-}
-
-/* The comparison operator.
- * a <=> b is 0 if a == b, 1 if a > b, -1 if a < b.
- */
-static VALUE
-BigDecimal_comp(VALUE self, VALUE r)
-{
- return BigDecimalCmp(self, r, '*');
-}
-
-/*
- * Tests for value equality; returns true if the values are equal.
- *
- * The == and === operators and the eql? method have the same implementation
- * for BigDecimal.
- *
- * Values may be coerced to perform the comparison:
- *
- * BigDecimal('1.0') == 1.0 #=> true
- */
-static VALUE
-BigDecimal_eq(VALUE self, VALUE r)
-{
- return BigDecimalCmp(self, r, '=');
-}
-
-/* call-seq:
- * self < other -> true or false
- *
- * Returns +true+ if +self+ is less than +other+, +false+ otherwise:
- *
- * b = BigDecimal('1.5') # => 0.15e1
- * b < 2 # => true
- * b < 2.0 # => true
- * b < Rational(2, 1) # => true
- * b < 1.5 # => false
- *
- * Raises an exception if the comparison cannot be made.
- *
- */
-static VALUE
-BigDecimal_lt(VALUE self, VALUE r)
-{
- return BigDecimalCmp(self, r, '<');
-}
-
-/* call-seq:
- * self <= other -> true or false
- *
- * Returns +true+ if +self+ is less or equal to than +other+, +false+ otherwise:
- *
- * b = BigDecimal('1.5') # => 0.15e1
- * b <= 2 # => true
- * b <= 2.0 # => true
- * b <= Rational(2, 1) # => true
- * b <= 1.5 # => true
- * b < 1 # => false
- *
- * Raises an exception if the comparison cannot be made.
- *
- */
-static VALUE
-BigDecimal_le(VALUE self, VALUE r)
-{
- return BigDecimalCmp(self, r, 'L');
-}
-
-/* call-seq:
- * self > other -> true or false
- *
- * Returns +true+ if +self+ is greater than +other+, +false+ otherwise:
- *
- * b = BigDecimal('1.5')
- * b > 1 # => true
- * b > 1.0 # => true
- * b > Rational(1, 1) # => true
- * b > 2 # => false
- *
- * Raises an exception if the comparison cannot be made.
- *
- */
-static VALUE
-BigDecimal_gt(VALUE self, VALUE r)
-{
- return BigDecimalCmp(self, r, '>');
-}
-
-/* call-seq:
- * self >= other -> true or false
- *
- * Returns +true+ if +self+ is greater than or equal to +other+, +false+ otherwise:
- *
- * b = BigDecimal('1.5')
- * b >= 1 # => true
- * b >= 1.0 # => true
- * b >= Rational(1, 1) # => true
- * b >= 1.5 # => true
- * b > 2 # => false
- *
- * Raises an exception if the comparison cannot be made.
- *
- */
-static VALUE
-BigDecimal_ge(VALUE self, VALUE r)
-{
- return BigDecimalCmp(self, r, 'G');
-}
-
-/*
- * call-seq:
- * -self -> bigdecimal
- *
- * Returns the \BigDecimal negation of self:
- *
- * b0 = BigDecimal('1.5')
- * b1 = -b0 # => -0.15e1
- * b2 = -b1 # => 0.15e1
- *
- */
-
-static VALUE
-BigDecimal_neg(VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- GUARD_OBJ(a, GetVpValue(self, 1));
- GUARD_OBJ(c, NewZeroWrapLimited(1, a->Prec *(VpBaseFig() + 1)));
- VpAsgn(c, a, -1);
- return VpCheckGetValue(c);
-}
-
-static VALUE
-BigDecimal_mult(VALUE self, VALUE r)
-{
- ENTER(5);
- Real *c, *a, *b;
- size_t mx;
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- if (RB_TYPE_P(r, T_FLOAT)) {
- b = GetVpValueWithPrec(r, 0, 1);
- }
- else if (RB_TYPE_P(r, T_RATIONAL)) {
- b = GetVpValueWithPrec(r, a->Prec*VpBaseFig(), 1);
- }
- else {
- b = GetVpValue(r,0);
- }
-
- if (!b) return DoSomeOne(self, r, '*');
- SAVE(b);
-
- mx = a->Prec + b->Prec;
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx * (VpBaseFig() + 1)));
- VpMult(c, a, b);
- return VpCheckGetValue(c);
-}
-
-static VALUE
-BigDecimal_divide(VALUE self, VALUE r, Real **c, Real **res, Real **div)
-/* For c = self.div(r): with round operation */
-{
- ENTER(5);
- Real *a, *b;
- ssize_t a_prec, b_prec;
- size_t mx;
-
- TypedData_Get_Struct(self, Real, &BigDecimal_data_type, a);
- SAVE(a);
-
- VALUE rr = r;
- if (is_kind_of_BigDecimal(rr)) {
- /* do nothing */
- }
- else if (RB_INTEGER_TYPE_P(r)) {
- rr = rb_inum_convert_to_BigDecimal(r, 0, true);
- }
- else if (RB_TYPE_P(r, T_FLOAT)) {
- rr = rb_float_convert_to_BigDecimal(r, 0, true);
- }
- else if (RB_TYPE_P(r, T_RATIONAL)) {
- rr = rb_rational_convert_to_BigDecimal(r, a->Prec*BASE_FIG, true);
- }
-
- if (!is_kind_of_BigDecimal(rr)) {
- return DoSomeOne(self, r, '/');
- }
-
- TypedData_Get_Struct(rr, Real, &BigDecimal_data_type, b);
- SAVE(b);
- *div = b;
-
- BigDecimal_count_precision_and_scale(self, &a_prec, NULL);
- BigDecimal_count_precision_and_scale(rr, &b_prec, NULL);
- mx = (a_prec > b_prec) ? a_prec : b_prec;
- mx *= 2;
-
- if (2*BIGDECIMAL_DOUBLE_FIGURES > mx)
- mx = 2*BIGDECIMAL_DOUBLE_FIGURES;
-
- GUARD_OBJ((*c), NewZeroWrapNolimit(1, mx + 2*BASE_FIG));
- GUARD_OBJ((*res), NewZeroWrapNolimit(1, (mx + 1)*2 + 2*BASE_FIG));
- VpDivd(*c, *res, a, b);
-
- return Qnil;
-}
-
-static VALUE BigDecimal_DoDivmod(VALUE self, VALUE r, Real **div, Real **mod);
-
-/* call-seq:
- * a / b -> bigdecimal
- *
- * Divide by the specified value.
- *
- * The result precision will be the precision of the larger operand,
- * but its minimum is 2*Float::DIG.
- *
- * See BigDecimal#div.
- * See BigDecimal#quo.
- */
-static VALUE
-BigDecimal_div(VALUE self, VALUE r)
-/* For c = self/r: with round operation */
-{
- ENTER(5);
- Real *c=NULL, *res=NULL, *div = NULL;
- r = BigDecimal_divide(self, r, &c, &res, &div);
- if (!NIL_P(r)) return r; /* coerced by other */
- SAVE(c); SAVE(res); SAVE(div);
- /* a/b = c + r/b */
- /* c xxxxx
- r 00000yyyyy ==> (y/b)*BASE >= HALF_BASE
- */
- /* Round */
- if (VpHasVal(div)) { /* frac[0] must be zero for NaN,INF,Zero */
- VpInternalRound(c, 0, c->frac[c->Prec-1], (DECDIG)(VpBaseVal() * (DECDIG_DBL)res->frac[0] / div->frac[0]));
- }
- return VpCheckGetValue(c);
-}
-
-static VALUE BigDecimal_round(int argc, VALUE *argv, VALUE self);
-
-/* call-seq:
- * quo(value) -> bigdecimal
- * quo(value, digits) -> bigdecimal
- *
- * Divide by the specified value.
- *
- * digits:: If specified and less than the number of significant digits of
- * the result, the result is rounded to the given number of digits,
- * according to the rounding mode indicated by BigDecimal.mode.
- *
- * If digits is 0 or omitted, the result is the same as for the
- * / operator.
- *
- * See BigDecimal#/.
- * See BigDecimal#div.
- */
-static VALUE
-BigDecimal_quo(int argc, VALUE *argv, VALUE self)
-{
- VALUE value, digits, result;
- SIGNED_VALUE n = -1;
-
- argc = rb_scan_args(argc, argv, "11", &value, &digits);
- if (argc > 1) {
- n = check_int_precision(digits);
- }
-
- if (n > 0) {
- result = BigDecimal_div2(self, value, digits);
- }
- else {
- result = BigDecimal_div(self, value);
- }
-
- return result;
-}
-
-/*
- * %: mod = a%b = a - (a.to_f/b).floor * b
- * div = (a.to_f/b).floor
- */
-static VALUE
-BigDecimal_DoDivmod(VALUE self, VALUE r, Real **div, Real **mod)
-{
- ENTER(8);
- Real *c=NULL, *d=NULL, *res=NULL;
- Real *a, *b;
- ssize_t a_prec, b_prec;
- size_t mx;
-
- TypedData_Get_Struct(self, Real, &BigDecimal_data_type, a);
- SAVE(a);
-
- VALUE rr = r;
- if (is_kind_of_BigDecimal(rr)) {
- /* do nothing */
- }
- else if (RB_INTEGER_TYPE_P(r)) {
- rr = rb_inum_convert_to_BigDecimal(r, 0, true);
- }
- else if (RB_TYPE_P(r, T_FLOAT)) {
- rr = rb_float_convert_to_BigDecimal(r, 0, true);
- }
- else if (RB_TYPE_P(r, T_RATIONAL)) {
- rr = rb_rational_convert_to_BigDecimal(r, a->Prec*BASE_FIG, true);
- }
-
- if (!is_kind_of_BigDecimal(rr)) {
- return Qfalse;
- }
-
- TypedData_Get_Struct(rr, Real, &BigDecimal_data_type, b);
- SAVE(b);
-
- if (VpIsNaN(a) || VpIsNaN(b)) goto NaN;
- if (VpIsInf(a) && VpIsInf(b)) goto NaN;
- if (VpIsZero(b)) {
- rb_raise(rb_eZeroDivError, "divided by 0");
- }
- if (VpIsInf(a)) {
- if (VpGetSign(a) == VpGetSign(b)) {
- VALUE inf = BigDecimal_positive_infinity();
- TypedData_Get_Struct(inf, Real, &BigDecimal_data_type, *div);
- }
- else {
- VALUE inf = BigDecimal_negative_infinity();
- TypedData_Get_Struct(inf, Real, &BigDecimal_data_type, *div);
- }
- VALUE nan = BigDecimal_nan();
- TypedData_Get_Struct(nan, Real, &BigDecimal_data_type, *mod);
- return Qtrue;
- }
- if (VpIsInf(b)) {
- VALUE zero = BigDecimal_positive_zero();
- TypedData_Get_Struct(zero, Real, &BigDecimal_data_type, *div);
- *mod = a;
- return Qtrue;
- }
- if (VpIsZero(a)) {
- VALUE zero = BigDecimal_positive_zero();
- TypedData_Get_Struct(zero, Real, &BigDecimal_data_type, *div);
- TypedData_Get_Struct(zero, Real, &BigDecimal_data_type, *mod);
- return Qtrue;
- }
-
- BigDecimal_count_precision_and_scale(self, &a_prec, NULL);
- BigDecimal_count_precision_and_scale(rr, &b_prec, NULL);
-
- mx = (a_prec > b_prec) ? a_prec : b_prec;
- mx *= 2;
-
- if (2*BIGDECIMAL_DOUBLE_FIGURES > mx)
- mx = 2*BIGDECIMAL_DOUBLE_FIGURES;
-
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx + 2*BASE_FIG));
- GUARD_OBJ(res, NewZeroWrapNolimit(1, mx*2 + 2*BASE_FIG));
- VpDivd(c, res, a, b);
-
- mx = c->Prec * BASE_FIG;
- GUARD_OBJ(d, NewZeroWrapLimited(1, mx));
- VpActiveRound(d, c, VP_ROUND_DOWN, 0);
-
- VpMult(res, d, b);
- VpAddSub(c, a, res, -1);
-
- if (!VpIsZero(c) && (VpGetSign(a) * VpGetSign(b) < 0)) {
- /* result adjustment for negative case */
- res = rbd_reallocate_struct(res, d->MaxPrec);
- res->MaxPrec = d->MaxPrec;
- VpAddSub(res, d, VpOne(), -1);
- GUARD_OBJ(d, NewZeroWrapLimited(1, GetAddSubPrec(c, b) * 2*BASE_FIG));
- VpAddSub(d, c, b, 1);
- *div = res;
- *mod = d;
- }
- else {
- *div = d;
- *mod = c;
- }
- return Qtrue;
-
- NaN:
- {
- VALUE nan = BigDecimal_nan();
- TypedData_Get_Struct(nan, Real, &BigDecimal_data_type, *div);
- TypedData_Get_Struct(nan, Real, &BigDecimal_data_type, *mod);
- }
- return Qtrue;
-}
-
-/* call-seq:
- * a % b
- * a.modulo(b)
- *
- * Returns the modulus from dividing by b.
- *
- * See BigDecimal#divmod.
- */
-static VALUE
-BigDecimal_mod(VALUE self, VALUE r) /* %: a%b = a - (a.to_f/b).floor * b */
-{
- ENTER(3);
- Real *div = NULL, *mod = NULL;
-
- if (BigDecimal_DoDivmod(self, r, &div, &mod)) {
- SAVE(div); SAVE(mod);
- return VpCheckGetValue(mod);
- }
- return DoSomeOne(self, r, '%');
-}
-
-static VALUE
-BigDecimal_divremain(VALUE self, VALUE r, Real **dv, Real **rv)
-{
- ENTER(10);
- size_t mx;
- Real *a = NULL, *b = NULL, *c = NULL, *res = NULL, *d = NULL, *rr = NULL, *ff = NULL;
- Real *f = NULL;
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- if (RB_TYPE_P(r, T_FLOAT)) {
- b = GetVpValueWithPrec(r, 0, 1);
- }
- else if (RB_TYPE_P(r, T_RATIONAL)) {
- b = GetVpValueWithPrec(r, a->Prec*VpBaseFig(), 1);
- }
- else {
- b = GetVpValue(r, 0);
- }
-
- if (!b) return DoSomeOne(self, r, rb_intern("remainder"));
- SAVE(b);
-
- if (VpIsPosInf(b) || VpIsNegInf(b)) {
- GUARD_OBJ(*dv, NewZeroWrapLimited(1, 1));
- VpSetZero(*dv, 1);
- *rv = a;
- return Qnil;
- }
-
- mx = (a->MaxPrec + b->MaxPrec) *VpBaseFig();
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- GUARD_OBJ(res, NewZeroWrapNolimit(1, (mx+1) * 2 + (VpBaseFig() + 1)));
- GUARD_OBJ(rr, NewZeroWrapNolimit(1, (mx+1) * 2 + (VpBaseFig() + 1)));
- GUARD_OBJ(ff, NewZeroWrapNolimit(1, (mx+1) * 2 + (VpBaseFig() + 1)));
-
- VpDivd(c, res, a, b);
-
- mx = c->Prec *(VpBaseFig() + 1);
-
- GUARD_OBJ(d, NewZeroWrapLimited(1, mx));
- GUARD_OBJ(f, NewZeroWrapLimited(1, mx));
-
- VpActiveRound(d, c, VP_ROUND_DOWN, 0); /* 0: round off */
-
- VpFrac(f, c);
- VpMult(rr, f, b);
- VpAddSub(ff, res, rr, 1);
-
- *dv = d;
- *rv = ff;
- return Qnil;
-}
-
-/* call-seq:
- * remainder(value)
- *
- * Returns the remainder from dividing by the value.
- *
- * x.remainder(y) means x-y*(x/y).truncate
- */
-static VALUE
-BigDecimal_remainder(VALUE self, VALUE r) /* remainder */
-{
- VALUE f;
- Real *d, *rv = 0;
- f = BigDecimal_divremain(self, r, &d, &rv);
- if (!NIL_P(f)) return f;
- return VpCheckGetValue(rv);
-}
-
-/* call-seq:
- * divmod(value)
- *
- * Divides by the specified value, and returns the quotient and modulus
- * as BigDecimal numbers. The quotient is rounded towards negative infinity.
- *
- * For example:
- *
- * require 'bigdecimal'
- *
- * a = BigDecimal("42")
- * b = BigDecimal("9")
- *
- * q, m = a.divmod(b)
- *
- * c = q * b + m
- *
- * a == c #=> true
- *
- * The quotient q is (a/b).floor, and the modulus is the amount that must be
- * added to q * b to get a.
- */
-static VALUE
-BigDecimal_divmod(VALUE self, VALUE r)
-{
- ENTER(5);
- Real *div = NULL, *mod = NULL;
-
- if (BigDecimal_DoDivmod(self, r, &div, &mod)) {
- SAVE(div); SAVE(mod);
- return rb_assoc_new(VpCheckGetValue(div), VpCheckGetValue(mod));
- }
- return DoSomeOne(self,r,rb_intern("divmod"));
-}
-
-/*
- * Do the same manner as Float#div when n is nil.
- * Do the same manner as BigDecimal#quo when n is 0.
- */
-static inline VALUE
-BigDecimal_div2(VALUE self, VALUE b, VALUE n)
-{
- ENTER(5);
- SIGNED_VALUE ix;
-
- if (NIL_P(n)) { /* div in Float sense */
- Real *div = NULL;
- Real *mod;
- if (BigDecimal_DoDivmod(self, b, &div, &mod)) {
- return BigDecimal_to_i(VpCheckGetValue(div));
- }
- return DoSomeOne(self, b, rb_intern("div"));
- }
-
- /* div in BigDecimal sense */
- ix = check_int_precision(n);
- if (ix == 0) {
- return BigDecimal_div(self, b);
- }
- else {
- Real *res = NULL;
- Real *av = NULL, *bv = NULL, *cv = NULL;
- size_t mx = ix + VpBaseFig()*2;
- size_t b_prec = ix;
- size_t pl = VpSetPrecLimit(0);
-
- GUARD_OBJ(cv, NewZeroWrapLimited(1, mx + VpBaseFig()));
- GUARD_OBJ(av, GetVpValue(self, 1));
- /* TODO: I want to refactor this precision control for a float value later
- * by introducing an implicit conversion function instead of
- * GetVpValueWithPrec. */
- if (RB_FLOAT_TYPE_P(b) && b_prec > BIGDECIMAL_DOUBLE_FIGURES) {
- b_prec = BIGDECIMAL_DOUBLE_FIGURES;
- }
- GUARD_OBJ(bv, GetVpValueWithPrec(b, b_prec, 1));
- mx = av->Prec + bv->Prec + 2;
- if (mx <= cv->MaxPrec) mx = cv->MaxPrec + 1;
- GUARD_OBJ(res, NewZeroWrapNolimit(1, (mx * 2 + 2)*VpBaseFig()));
- VpDivd(cv, res, av, bv);
- VpSetPrecLimit(pl);
- VpLeftRound(cv, VpGetRoundMode(), ix);
- return VpCheckGetValue(cv);
- }
-}
-
- /*
- * Document-method: BigDecimal#div
- *
- * call-seq:
- * div(value) -> integer
- * div(value, digits) -> bigdecimal or integer
- *
- * Divide by the specified value.
- *
- * digits:: If specified and less than the number of significant digits of the
- * result, the result is rounded to that number of digits, according
- * to BigDecimal.mode.
- *
- * If digits is 0, the result is the same as for the / operator
- * or #quo.
- *
- * If digits is not specified, the result is an integer,
- * by analogy with Float#div; see also BigDecimal#divmod.
- *
- * See BigDecimal#/.
- * See BigDecimal#quo.
- *
- * Examples:
- *
- * a = BigDecimal("4")
- * b = BigDecimal("3")
- *
- * a.div(b, 3) # => 0.133e1
- *
- * a.div(b, 0) # => 0.1333333333333333333e1
- * a / b # => 0.1333333333333333333e1
- * a.quo(b) # => 0.1333333333333333333e1
- *
- * a.div(b) # => 1
- */
-static VALUE
-BigDecimal_div3(int argc, VALUE *argv, VALUE self)
-{
- VALUE b,n;
-
- rb_scan_args(argc, argv, "11", &b, &n);
-
- return BigDecimal_div2(self, b, n);
-}
-
- /*
- * call-seq:
- * add(value, ndigits) -> new_bigdecimal
- *
- * Returns the \BigDecimal sum of +self+ and +value+
- * with a precision of +ndigits+ decimal digits.
- *
- * When +ndigits+ is less than the number of significant digits
- * in the sum, the sum is rounded to that number of digits,
- * according to the current rounding mode; see BigDecimal.mode.
- *
- * Examples:
- *
- * # Set the rounding mode.
- * BigDecimal.mode(BigDecimal::ROUND_MODE, :half_up)
- * b = BigDecimal('111111.111')
- * b.add(1, 0) # => 0.111112111e6
- * b.add(1, 3) # => 0.111e6
- * b.add(1, 6) # => 0.111112e6
- * b.add(1, 15) # => 0.111112111e6
- * b.add(1.0, 15) # => 0.111112111e6
- * b.add(Rational(1, 1), 15) # => 0.111112111e6
- *
- */
-
-static VALUE
-BigDecimal_add2(VALUE self, VALUE b, VALUE n)
-{
- ENTER(2);
- Real *cv;
- SIGNED_VALUE mx = check_int_precision(n);
- if (mx == 0) return BigDecimal_add(self, b);
- else {
- size_t pl = VpSetPrecLimit(0);
- VALUE c = BigDecimal_add(self, b);
- VpSetPrecLimit(pl);
- GUARD_OBJ(cv, GetVpValue(c, 1));
- VpLeftRound(cv, VpGetRoundMode(), mx);
- return VpCheckGetValue(cv);
- }
-}
-
-/* call-seq:
- * sub(value, digits) -> bigdecimal
- *
- * Subtract the specified value.
- *
- * e.g.
- * c = a.sub(b,n)
- *
- * digits:: If specified and less than the number of significant digits of the
- * result, the result is rounded to that number of digits, according
- * to BigDecimal.mode.
- *
- */
-static VALUE
-BigDecimal_sub2(VALUE self, VALUE b, VALUE n)
-{
- ENTER(2);
- Real *cv;
- SIGNED_VALUE mx = check_int_precision(n);
- if (mx == 0) return BigDecimal_sub(self, b);
- else {
- size_t pl = VpSetPrecLimit(0);
- VALUE c = BigDecimal_sub(self, b);
- VpSetPrecLimit(pl);
- GUARD_OBJ(cv, GetVpValue(c, 1));
- VpLeftRound(cv, VpGetRoundMode(), mx);
- return VpCheckGetValue(cv);
- }
-}
-
- /*
- * call-seq:
- * mult(other, ndigits) -> bigdecimal
- *
- * Returns the \BigDecimal product of +self+ and +value+
- * with a precision of +ndigits+ decimal digits.
- *
- * When +ndigits+ is less than the number of significant digits
- * in the sum, the sum is rounded to that number of digits,
- * according to the current rounding mode; see BigDecimal.mode.
- *
- * Examples:
- *
- * # Set the rounding mode.
- * BigDecimal.mode(BigDecimal::ROUND_MODE, :half_up)
- * b = BigDecimal('555555.555')
- * b.mult(3, 0) # => 0.1666666665e7
- * b.mult(3, 3) # => 0.167e7
- * b.mult(3, 6) # => 0.166667e7
- * b.mult(3, 15) # => 0.1666666665e7
- * b.mult(3.0, 0) # => 0.1666666665e7
- * b.mult(Rational(3, 1), 0) # => 0.1666666665e7
- * b.mult(Complex(3, 0), 0) # => (0.1666666665e7+0.0i)
- *
- */
-
-static VALUE
-BigDecimal_mult2(VALUE self, VALUE b, VALUE n)
-{
- ENTER(2);
- Real *cv;
- SIGNED_VALUE mx = check_int_precision(n);
- if (mx == 0) return BigDecimal_mult(self, b);
- else {
- size_t pl = VpSetPrecLimit(0);
- VALUE c = BigDecimal_mult(self, b);
- VpSetPrecLimit(pl);
- GUARD_OBJ(cv, GetVpValue(c, 1));
- VpLeftRound(cv, VpGetRoundMode(), mx);
- return VpCheckGetValue(cv);
- }
-}
-
-/*
- * call-seq:
- * abs -> bigdecimal
- *
- * Returns the \BigDecimal absolute value of +self+:
- *
- * BigDecimal('5').abs # => 0.5e1
- * BigDecimal('-3').abs # => 0.3e1
- *
- */
-
-static VALUE
-BigDecimal_abs(VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- size_t mx;
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec *(VpBaseFig() + 1);
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpAsgn(c, a, 1);
- VpChangeSign(c, 1);
- return VpCheckGetValue(c);
-}
-
-/* call-seq:
- * sqrt(n)
- *
- * Returns the square root of the value.
- *
- * Result has at least n significant digits.
- */
-static VALUE
-BigDecimal_sqrt(VALUE self, VALUE nFig)
-{
- ENTER(5);
- Real *c, *a;
- size_t mx, n;
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec * (VpBaseFig() + 1);
-
- n = check_int_precision(nFig);
- n += VpDblFig() + VpBaseFig();
- if (mx <= n) mx = n;
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpSqrt(c, a);
- return VpCheckGetValue(c);
-}
-
-/* Return the integer part of the number, as a BigDecimal.
- */
-static VALUE
-BigDecimal_fix(VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- size_t mx;
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec *(VpBaseFig() + 1);
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpActiveRound(c, a, VP_ROUND_DOWN, 0); /* 0: round off */
- return VpCheckGetValue(c);
-}
-
-/* call-seq:
- * round(n, mode)
- *
- * Round to the nearest integer (by default), returning the result as a
- * BigDecimal if n is specified, or as an Integer if it isn't.
- *
- * BigDecimal('3.14159').round #=> 3
- * BigDecimal('8.7').round #=> 9
- * BigDecimal('-9.9').round #=> -10
- *
- * BigDecimal('3.14159').round(2).class.name #=> "BigDecimal"
- * BigDecimal('3.14159').round.class.name #=> "Integer"
- *
- * If n is specified and positive, the fractional part of the result has no
- * more than that many digits.
- *
- * If n is specified and negative, at least that many digits to the left of the
- * decimal point will be 0 in the result, and return value will be an Integer.
- *
- * BigDecimal('3.14159').round(3) #=> 3.142
- * BigDecimal('13345.234').round(-2) #=> 13300
- *
- * The value of the optional mode argument can be used to determine how
- * rounding is performed; see BigDecimal.mode.
- */
-static VALUE
-BigDecimal_round(int argc, VALUE *argv, VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- int iLoc = 0;
- VALUE vLoc;
- VALUE vRound;
- int round_to_int = 0;
- size_t mx, pl;
-
- unsigned short sw = VpGetRoundMode();
-
- switch (rb_scan_args(argc, argv, "02", &vLoc, &vRound)) {
- case 0:
- iLoc = 0;
- round_to_int = 1;
- break;
- case 1:
- if (RB_TYPE_P(vLoc, T_HASH)) {
- sw = check_rounding_mode_option(vLoc);
- }
- else {
- iLoc = NUM2INT(vLoc);
- if (iLoc < 1) round_to_int = 1;
- }
- break;
- case 2:
- iLoc = NUM2INT(vLoc);
- if (RB_TYPE_P(vRound, T_HASH)) {
- sw = check_rounding_mode_option(vRound);
- }
- else {
- sw = check_rounding_mode(vRound);
- }
- break;
- default:
- break;
- }
-
- pl = VpSetPrecLimit(0);
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec * (VpBaseFig() + 1);
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpSetPrecLimit(pl);
- VpActiveRound(c, a, sw, iLoc);
- if (round_to_int) {
- return BigDecimal_to_i(VpCheckGetValue(c));
- }
- return VpCheckGetValue(c);
-}
-
-/* call-seq:
- * truncate(n)
- *
- * Truncate to the nearest integer (by default), returning the result as a
- * BigDecimal.
- *
- * BigDecimal('3.14159').truncate #=> 3
- * BigDecimal('8.7').truncate #=> 8
- * BigDecimal('-9.9').truncate #=> -9
- *
- * If n is specified and positive, the fractional part of the result has no
- * more than that many digits.
- *
- * If n is specified and negative, at least that many digits to the left of the
- * decimal point will be 0 in the result.
- *
- * BigDecimal('3.14159').truncate(3) #=> 3.141
- * BigDecimal('13345.234').truncate(-2) #=> 13300.0
- */
-static VALUE
-BigDecimal_truncate(int argc, VALUE *argv, VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- int iLoc;
- VALUE vLoc;
- size_t mx, pl = VpSetPrecLimit(0);
-
- if (rb_scan_args(argc, argv, "01", &vLoc) == 0) {
- iLoc = 0;
- }
- else {
- iLoc = NUM2INT(vLoc);
- }
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec * (VpBaseFig() + 1);
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpSetPrecLimit(pl);
- VpActiveRound(c, a, VP_ROUND_DOWN, iLoc); /* 0: truncate */
- if (argc == 0) {
- return BigDecimal_to_i(VpCheckGetValue(c));
- }
- return VpCheckGetValue(c);
-}
-
-/* Return the fractional part of the number, as a BigDecimal.
- */
-static VALUE
-BigDecimal_frac(VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- size_t mx;
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec * (VpBaseFig() + 1);
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpFrac(c, a);
- return VpCheckGetValue(c);
-}
-
-/* call-seq:
- * floor(n)
- *
- * Return the largest integer less than or equal to the value, as a BigDecimal.
- *
- * BigDecimal('3.14159').floor #=> 3
- * BigDecimal('-9.1').floor #=> -10
- *
- * If n is specified and positive, the fractional part of the result has no
- * more than that many digits.
- *
- * If n is specified and negative, at least that
- * many digits to the left of the decimal point will be 0 in the result.
- *
- * BigDecimal('3.14159').floor(3) #=> 3.141
- * BigDecimal('13345.234').floor(-2) #=> 13300.0
- */
-static VALUE
-BigDecimal_floor(int argc, VALUE *argv, VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- int iLoc;
- VALUE vLoc;
- size_t mx, pl = VpSetPrecLimit(0);
-
- if (rb_scan_args(argc, argv, "01", &vLoc)==0) {
- iLoc = 0;
- }
- else {
- iLoc = NUM2INT(vLoc);
- }
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec * (VpBaseFig() + 1);
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpSetPrecLimit(pl);
- VpActiveRound(c, a, VP_ROUND_FLOOR, iLoc);
-#ifdef BIGDECIMAL_DEBUG
- VPrint(stderr, "floor: c=%\n", c);
-#endif
- if (argc == 0) {
- return BigDecimal_to_i(VpCheckGetValue(c));
- }
- return VpCheckGetValue(c);
-}
-
-/* call-seq:
- * ceil(n)
- *
- * Return the smallest integer greater than or equal to the value, as a BigDecimal.
- *
- * BigDecimal('3.14159').ceil #=> 4
- * BigDecimal('-9.1').ceil #=> -9
- *
- * If n is specified and positive, the fractional part of the result has no
- * more than that many digits.
- *
- * If n is specified and negative, at least that
- * many digits to the left of the decimal point will be 0 in the result.
- *
- * BigDecimal('3.14159').ceil(3) #=> 3.142
- * BigDecimal('13345.234').ceil(-2) #=> 13400.0
- */
-static VALUE
-BigDecimal_ceil(int argc, VALUE *argv, VALUE self)
-{
- ENTER(5);
- Real *c, *a;
- int iLoc;
- VALUE vLoc;
- size_t mx, pl = VpSetPrecLimit(0);
-
- if (rb_scan_args(argc, argv, "01", &vLoc) == 0) {
- iLoc = 0;
- } else {
- iLoc = NUM2INT(vLoc);
- }
-
- GUARD_OBJ(a, GetVpValue(self, 1));
- mx = a->Prec * (VpBaseFig() + 1);
- GUARD_OBJ(c, NewZeroWrapLimited(1, mx));
- VpSetPrecLimit(pl);
- VpActiveRound(c, a, VP_ROUND_CEIL, iLoc);
- if (argc == 0) {
- return BigDecimal_to_i(VpCheckGetValue(c));
- }
- return VpCheckGetValue(c);
-}
-
-/* call-seq:
- * to_s(s)
- *
- * Converts the value to a string.
- *
- * The default format looks like 0.xxxxEnn.
- *
- * The optional parameter s consists of either an integer; or an optional '+'
- * or ' ', followed by an optional number, followed by an optional 'E' or 'F'.
- *
- * If there is a '+' at the start of s, positive values are returned with
- * a leading '+'.
- *
- * A space at the start of s returns positive values with a leading space.
- *
- * If s contains a number, a space is inserted after each group of that many
- * fractional digits.
- *
- * If s ends with an 'E', engineering notation (0.xxxxEnn) is used.
- *
- * If s ends with an 'F', conventional floating point notation is used.
- *
- * Examples:
- *
- * BigDecimal('-123.45678901234567890').to_s('5F')
- * #=> '-123.45678 90123 45678 9'
- *
- * BigDecimal('123.45678901234567890').to_s('+8F')
- * #=> '+123.45678901 23456789'
- *
- * BigDecimal('123.45678901234567890').to_s(' F')
- * #=> ' 123.4567890123456789'
- */
-static VALUE
-BigDecimal_to_s(int argc, VALUE *argv, VALUE self)
-{
- ENTER(5);
- int fmt = 0; /* 0: E format, 1: F format */
- int fPlus = 0; /* 0: default, 1: set ' ' before digits, 2: set '+' before digits. */
- Real *vp;
- volatile VALUE str;
- char *psz;
- char ch;
- size_t nc, mc = 0;
- SIGNED_VALUE m;
- VALUE f;
-
- GUARD_OBJ(vp, GetVpValue(self, 1));
-
- if (rb_scan_args(argc, argv, "01", &f) == 1) {
- if (RB_TYPE_P(f, T_STRING)) {
- psz = StringValueCStr(f);
- if (*psz == ' ') {
- fPlus = 1;
- psz++;
- }
- else if (*psz == '+') {
- fPlus = 2;
- psz++;
- }
- while ((ch = *psz++) != 0) {
- if (ISSPACE(ch)) {
- continue;
- }
- if (!ISDIGIT(ch)) {
- if (ch == 'F' || ch == 'f') {
- fmt = 1; /* F format */
- }
- break;
- }
- mc = mc*10 + ch - '0';
- }
- }
- else {
- m = NUM2INT(f);
- if (m <= 0) {
- rb_raise(rb_eArgError, "argument must be positive");
- }
- mc = (size_t)m;
- }
- }
- if (fmt) {
- nc = VpNumOfChars(vp, "F");
- }
- else {
- nc = VpNumOfChars(vp, "E");
- }
- if (mc > 0) {
- nc += (nc + mc - 1) / mc + 1;
- }
-
- str = rb_usascii_str_new(0, nc);
- psz = RSTRING_PTR(str);
-
- if (fmt) {
- VpToFString(vp, psz, RSTRING_LEN(str), mc, fPlus);
- }
- else {
- VpToString (vp, psz, RSTRING_LEN(str), mc, fPlus);
- }
- rb_str_resize(str, strlen(psz));
- return str;
-}
-
-/* Splits a BigDecimal number into four parts, returned as an array of values.
- *
- * The first value represents the sign of the BigDecimal, and is -1 or 1, or 0
- * if the BigDecimal is Not a Number.
- *
- * The second value is a string representing the significant digits of the
- * BigDecimal, with no leading zeros.
- *
- * The third value is the base used for arithmetic (currently always 10) as an
- * Integer.
- *
- * The fourth value is an Integer exponent.
- *
- * If the BigDecimal can be represented as 0.xxxxxx*10**n, then xxxxxx is the
- * string of significant digits with no leading zeros, and n is the exponent.
- *
- * From these values, you can translate a BigDecimal to a float as follows:
- *
- * sign, significant_digits, base, exponent = a.split
- * f = sign * "0.#{significant_digits}".to_f * (base ** exponent)
- *
- * (Note that the to_f method is provided as a more convenient way to translate
- * a BigDecimal to a Float.)
- */
-static VALUE
-BigDecimal_split(VALUE self)
-{
- ENTER(5);
- Real *vp;
- VALUE obj,str;
- ssize_t e, s;
- char *psz1;
-
- GUARD_OBJ(vp, GetVpValue(self, 1));
- str = rb_str_new(0, VpNumOfChars(vp, "E"));
- psz1 = RSTRING_PTR(str);
- VpSzMantissa(vp, psz1, RSTRING_LEN(str));
- s = 1;
- if(psz1[0] == '-') {
- size_t len = strlen(psz1 + 1);
-
- memmove(psz1, psz1 + 1, len);
- psz1[len] = '\0';
- s = -1;
- }
- if (psz1[0] == 'N') s = 0; /* NaN */
- e = VpExponent10(vp);
- obj = rb_ary_new2(4);
- rb_ary_push(obj, INT2FIX(s));
- rb_ary_push(obj, str);
- rb_str_resize(str, strlen(psz1));
- rb_ary_push(obj, INT2FIX(10));
- rb_ary_push(obj, SSIZET2NUM(e));
- return obj;
-}
-
-/* Returns the exponent of the BigDecimal number, as an Integer.
- *
- * If the number can be represented as 0.xxxxxx*10**n where xxxxxx is a string
- * of digits with no leading zeros, then n is the exponent.
- */
-static VALUE
-BigDecimal_exponent(VALUE self)
-{
- ssize_t e = VpExponent10(GetVpValue(self, 1));
- return SSIZET2NUM(e);
-}
-
-/* Returns a string representation of self.
- *
- * BigDecimal("1234.5678").inspect
- * #=> "0.12345678e4"
- */
-static VALUE
-BigDecimal_inspect(VALUE self)
-{
- ENTER(5);
- Real *vp;
- volatile VALUE str;
- size_t nc;
-
- GUARD_OBJ(vp, GetVpValue(self, 1));
- nc = VpNumOfChars(vp, "E");
-
- str = rb_str_new(0, nc);
- VpToString(vp, RSTRING_PTR(str), RSTRING_LEN(str), 0, 0);
- rb_str_resize(str, strlen(RSTRING_PTR(str)));
- return str;
-}
-
-static VALUE BigMath_s_exp(VALUE, VALUE, VALUE);
-static VALUE BigMath_s_log(VALUE, VALUE, VALUE);
-
-#define BigMath_exp(x, n) BigMath_s_exp(rb_mBigMath, (x), (n))
-#define BigMath_log(x, n) BigMath_s_log(rb_mBigMath, (x), (n))
-
-inline static int
-is_integer(VALUE x)
-{
- return (RB_TYPE_P(x, T_FIXNUM) || RB_TYPE_P(x, T_BIGNUM));
-}
-
-inline static int
-is_negative(VALUE x)
-{
- if (FIXNUM_P(x)) {
- return FIX2LONG(x) < 0;
- }
- else if (RB_TYPE_P(x, T_BIGNUM)) {
- return FIX2INT(rb_big_cmp(x, INT2FIX(0))) < 0;
- }
- else if (RB_TYPE_P(x, T_FLOAT)) {
- return RFLOAT_VALUE(x) < 0.0;
- }
- return RTEST(rb_funcall(x, '<', 1, INT2FIX(0)));
-}
-
-#define is_positive(x) (!is_negative(x))
-
-inline static int
-is_zero(VALUE x)
-{
- VALUE num;
-
- switch (TYPE(x)) {
- case T_FIXNUM:
- return FIX2LONG(x) == 0;
-
- case T_BIGNUM:
- return Qfalse;
-
- case T_RATIONAL:
- num = rb_rational_num(x);
- return FIXNUM_P(num) && FIX2LONG(num) == 0;
-
- default:
- break;
- }
-
- return RTEST(rb_funcall(x, id_eq, 1, INT2FIX(0)));
-}
-
-inline static int
-is_one(VALUE x)
-{
- VALUE num, den;
-
- switch (TYPE(x)) {
- case T_FIXNUM:
- return FIX2LONG(x) == 1;
-
- case T_BIGNUM:
- return Qfalse;
-
- case T_RATIONAL:
- num = rb_rational_num(x);
- den = rb_rational_den(x);
- return FIXNUM_P(den) && FIX2LONG(den) == 1 &&
- FIXNUM_P(num) && FIX2LONG(num) == 1;
-
- default:
- break;
- }
-
- return RTEST(rb_funcall(x, id_eq, 1, INT2FIX(1)));
-}
-
-inline static int
-is_even(VALUE x)
-{
- switch (TYPE(x)) {
- case T_FIXNUM:
- return (FIX2LONG(x) % 2) == 0;
-
- case T_BIGNUM:
- {
- unsigned long l;
- rb_big_pack(x, &l, 1);
- return l % 2 == 0;
- }
-
- default:
- break;
- }
-
- return 0;
-}
-
-static VALUE
-bigdecimal_power_by_bigdecimal(Real const* x, Real const* exp, ssize_t const n)
-{
- VALUE log_x, multiplied, y;
- volatile VALUE obj = exp->obj;
-
- if (VpIsZero(exp)) {
- return VpCheckGetValue(NewOneWrapLimited(1, n));
- }
-
- log_x = BigMath_log(x->obj, SSIZET2NUM(n+1));
- multiplied = BigDecimal_mult2(exp->obj, log_x, SSIZET2NUM(n+1));
- y = BigMath_exp(multiplied, SSIZET2NUM(n));
- RB_GC_GUARD(obj);
-
- return y;
-}
-
-/* call-seq:
- * power(n)
- * power(n, prec)
- *
- * Returns the value raised to the power of n.
- *
- * Note that n must be an Integer.
- *
- * Also available as the operator **.
- */
-static VALUE
-BigDecimal_power(int argc, VALUE*argv, VALUE self)
-{
- ENTER(5);
- VALUE vexp, prec;
- Real* exp = NULL;
- Real *x, *y;
- ssize_t mp, ma, n;
- SIGNED_VALUE int_exp;
- double d;
-
- rb_scan_args(argc, argv, "11", &vexp, &prec);
-
- GUARD_OBJ(x, GetVpValue(self, 1));
- n = NIL_P(prec) ? (ssize_t)(x->Prec*VpBaseFig()) : NUM2SSIZET(prec);
-
- if (VpIsNaN(x)) {
- y = NewZeroWrapLimited(1, n);
- VpSetNaN(y);
- RB_GC_GUARD(y->obj);
- return VpCheckGetValue(y);
- }
-
- retry:
- switch (TYPE(vexp)) {
- case T_FIXNUM:
- break;
-
- case T_BIGNUM:
- break;
-
- case T_FLOAT:
- d = RFLOAT_VALUE(vexp);
- if (d == round(d)) {
- if (FIXABLE(d)) {
- vexp = LONG2FIX((long)d);
- }
- else {
- vexp = rb_dbl2big(d);
- }
- goto retry;
- }
- if (NIL_P(prec)) {
- n += BIGDECIMAL_DOUBLE_FIGURES;
- }
- exp = GetVpValueWithPrec(vexp, 0, 1);
- break;
-
- case T_RATIONAL:
- if (is_zero(rb_rational_num(vexp))) {
- if (is_positive(vexp)) {
- vexp = INT2FIX(0);
- goto retry;
- }
- }
- else if (is_one(rb_rational_den(vexp))) {
- vexp = rb_rational_num(vexp);
- goto retry;
- }
- exp = GetVpValueWithPrec(vexp, n, 1);
- if (NIL_P(prec)) {
- n += n;
- }
- break;
-
- case T_DATA:
- if (is_kind_of_BigDecimal(vexp)) {
- VALUE zero = INT2FIX(0);
- VALUE rounded = BigDecimal_round(1, &zero, vexp);
- if (RTEST(BigDecimal_eq(vexp, rounded))) {
- vexp = BigDecimal_to_i(vexp);
- goto retry;
- }
- if (NIL_P(prec)) {
- GUARD_OBJ(y, GetVpValue(vexp, 1));
- n += y->Prec*VpBaseFig();
- }
- exp = DATA_PTR(vexp);
- break;
- }
- /* fall through */
- default:
- rb_raise(rb_eTypeError,
- "wrong argument type %"PRIsVALUE" (expected scalar Numeric)",
- RB_OBJ_CLASSNAME(vexp));
- }
-
- if (VpIsZero(x)) {
- if (is_negative(vexp)) {
- y = NewZeroWrapNolimit(1, n);
- if (BIGDECIMAL_NEGATIVE_P(x)) {
- if (is_integer(vexp)) {
- if (is_even(vexp)) {
- /* (-0) ** (-even_integer) -> Infinity */
- VpSetPosInf(y);
- }
- else {
- /* (-0) ** (-odd_integer) -> -Infinity */
- VpSetNegInf(y);
- }
- }
- else {
- /* (-0) ** (-non_integer) -> Infinity */
- VpSetPosInf(y);
- }
- }
- else {
- /* (+0) ** (-num) -> Infinity */
- VpSetPosInf(y);
- }
- RB_GC_GUARD(y->obj);
- return VpCheckGetValue(y);
- }
- else if (is_zero(vexp)) {
- return VpCheckGetValue(NewOneWrapLimited(1, n));
- }
- else {
- return VpCheckGetValue(NewZeroWrapLimited(1, n));
- }
- }
-
- if (is_zero(vexp)) {
- return VpCheckGetValue(NewOneWrapLimited(1, n));
- }
- else if (is_one(vexp)) {
- return self;
- }
-
- if (VpIsInf(x)) {
- if (is_negative(vexp)) {
- if (BIGDECIMAL_NEGATIVE_P(x)) {
- if (is_integer(vexp)) {
- if (is_even(vexp)) {
- /* (-Infinity) ** (-even_integer) -> +0 */
- return VpCheckGetValue(NewZeroWrapLimited(1, n));
- }
- else {
- /* (-Infinity) ** (-odd_integer) -> -0 */
- return VpCheckGetValue(NewZeroWrapLimited(-1, n));
- }
- }
- else {
- /* (-Infinity) ** (-non_integer) -> -0 */
- return VpCheckGetValue(NewZeroWrapLimited(-1, n));
- }
- }
- else {
- return VpCheckGetValue(NewZeroWrapLimited(1, n));
- }
- }
- else {
- y = NewZeroWrapLimited(1, n);
- if (BIGDECIMAL_NEGATIVE_P(x)) {
- if (is_integer(vexp)) {
- if (is_even(vexp)) {
- VpSetPosInf(y);
- }
- else {
- VpSetNegInf(y);
- }
- }
- else {
- /* TODO: support complex */
- rb_raise(rb_eMathDomainError,
- "a non-integral exponent for a negative base");
- }
- }
- else {
- VpSetPosInf(y);
- }
- return VpCheckGetValue(y);
- }
- }
-
- if (exp != NULL) {
- return bigdecimal_power_by_bigdecimal(x, exp, n);
- }
- else if (RB_TYPE_P(vexp, T_BIGNUM)) {
- VALUE abs_value = BigDecimal_abs(self);
- if (is_one(abs_value)) {
- return VpCheckGetValue(NewOneWrapLimited(1, n));
- }
- else if (RTEST(rb_funcall(abs_value, '<', 1, INT2FIX(1)))) {
- if (is_negative(vexp)) {
- y = NewZeroWrapLimited(1, n);
- VpSetInf(y, (is_even(vexp) ? 1 : -1) * VpGetSign(x));
- return VpCheckGetValue(y);
- }
- else if (BIGDECIMAL_NEGATIVE_P(x) && is_even(vexp)) {
- return VpCheckGetValue(NewZeroWrapLimited(-1, n));
- }
- else {
- return VpCheckGetValue(NewZeroWrapLimited(1, n));
- }
- }
- else {
- if (is_positive(vexp)) {
- y = NewZeroWrapLimited(1, n);
- VpSetInf(y, (is_even(vexp) ? 1 : -1) * VpGetSign(x));
- return VpCheckGetValue(y);
- }
- else if (BIGDECIMAL_NEGATIVE_P(x) && is_even(vexp)) {
- return VpCheckGetValue(NewZeroWrapLimited(-1, n));
- }
- else {
- return VpCheckGetValue(NewZeroWrapLimited(1, n));
- }
- }
- }
-
- int_exp = FIX2LONG(vexp);
- ma = int_exp;
- if (ma < 0) ma = -ma;
- if (ma == 0) ma = 1;
-
- if (VpIsDef(x)) {
- mp = x->Prec * (VpBaseFig() + 1);
- GUARD_OBJ(y, NewZeroWrapLimited(1, mp * (ma + 1)));
- }
- else {
- GUARD_OBJ(y, NewZeroWrapLimited(1, 1));
- }
- VpPowerByInt(y, x, int_exp);
- if (!NIL_P(prec) && VpIsDef(y)) {
- VpMidRound(y, VpGetRoundMode(), n);
- }
- return VpCheckGetValue(y);
-}
-
-/* call-seq:
- * self ** other -> bigdecimal
- *
- * Returns the \BigDecimal value of +self+ raised to power +other+:
- *
- * b = BigDecimal('3.14')
- * b ** 2 # => 0.98596e1
- * b ** 2.0 # => 0.98596e1
- * b ** Rational(2, 1) # => 0.98596e1
- *
- * Related: BigDecimal#power.
- *
- */
-static VALUE
-BigDecimal_power_op(VALUE self, VALUE exp)
-{
- return BigDecimal_power(1, &exp, self);
-}
-
-/* :nodoc:
- *
- * private method for dup and clone the provided BigDecimal +other+
- */
-static VALUE
-BigDecimal_initialize_copy(VALUE self, VALUE other)
-{
- Real *pv = rb_check_typeddata(self, &BigDecimal_data_type);
- Real *x = rb_check_typeddata(other, &BigDecimal_data_type);
-
- if (self != other) {
- DATA_PTR(self) = VpCopy(pv, x);
- }
- return self;
-}
-
-static VALUE
-BigDecimal_clone(VALUE self)
-{
- return self;
-}
-
-#ifdef HAVE_RB_OPTS_EXCEPTION_P
-int rb_opts_exception_p(VALUE opts, int default_value);
-#define opts_exception_p(opts) rb_opts_exception_p((opts), 1)
-#else
-static int
-opts_exception_p(VALUE opts)
-{
- static ID kwds[1];
- VALUE exception;
- if (!kwds[0]) {
- kwds[0] = rb_intern_const("exception");
- }
- if (!rb_get_kwargs(opts, kwds, 0, 1, &exception)) return 1;
- switch (exception) {
- case Qtrue: case Qfalse:
- break;
- default:
- rb_raise(rb_eArgError, "true or false is expected as exception: %+"PRIsVALUE,
- exception);
- }
- return exception != Qfalse;
-}
-#endif
-
-static VALUE
-check_exception(VALUE bd)
-{
- assert(is_kind_of_BigDecimal(bd));
-
- Real *vp;
- TypedData_Get_Struct(bd, Real, &BigDecimal_data_type, vp);
- VpCheckGetValue(vp); /* VpCheckGetValue performs exception check */
-
- return bd;
-}
-
-static VALUE
-rb_uint64_convert_to_BigDecimal(uint64_t uval, RB_UNUSED_VAR(size_t digs), int raise_exception)
-{
- VALUE obj = TypedData_Wrap_Struct(rb_cBigDecimal, &BigDecimal_data_type, 0);
-
- Real *vp;
- if (uval == 0) {
- vp = rbd_allocate_struct(1);
- vp->MaxPrec = 1;
- vp->Prec = 1;
- vp->exponent = 1;
- VpSetZero(vp, 1);
- vp->frac[0] = 0;
- }
- else if (uval < BASE) {
- vp = rbd_allocate_struct(1);
- vp->MaxPrec = 1;
- vp->Prec = 1;
- vp->exponent = 1;
- VpSetSign(vp, 1);
- vp->frac[0] = (DECDIG)uval;
- }
- else {
- DECDIG buf[BIGDECIMAL_INT64_MAX_LENGTH] = {0,};
- DECDIG r = uval % BASE;
- size_t len = 0, ntz = 0;
- if (r == 0) {
- // Count and skip trailing zeros
- for (; r == 0 && uval > 0; ++ntz) {
- uval /= BASE;
- r = uval % BASE;
- }
- }
- for (; uval > 0; ++len) {
- // Store digits
- buf[BIGDECIMAL_INT64_MAX_LENGTH - len - 1] = r;
- uval /= BASE;
- r = uval % BASE;
- }
-
- const size_t exp = len + ntz;
- vp = rbd_allocate_struct(len);
- vp->MaxPrec = len;
- vp->Prec = len;
- vp->exponent = exp;
- VpSetSign(vp, 1);
- MEMCPY(vp->frac, buf + BIGDECIMAL_INT64_MAX_LENGTH - len, DECDIG, len);
- }
-
- return BigDecimal_wrap_struct(obj, vp);
-}
-
-static VALUE
-rb_int64_convert_to_BigDecimal(int64_t ival, size_t digs, int raise_exception)
-{
- const uint64_t uval = (ival < 0) ? (((uint64_t)-(ival+1))+1) : (uint64_t)ival;
- VALUE bd = rb_uint64_convert_to_BigDecimal(uval, digs, raise_exception);
- if (ival < 0) {
- Real *vp;
- TypedData_Get_Struct(bd, Real, &BigDecimal_data_type, vp);
- VpSetSign(vp, -1);
- }
- return bd;
-}
-
-static VALUE
-rb_big_convert_to_BigDecimal(VALUE val, RB_UNUSED_VAR(size_t digs), int raise_exception)
-{
- assert(RB_TYPE_P(val, T_BIGNUM));
-
- int leading_zeros;
- size_t size = rb_absint_size(val, &leading_zeros);
- int sign = FIX2INT(rb_big_cmp(val, INT2FIX(0)));
- if (sign < 0 && leading_zeros == 0) {
- size += 1;
- }
- if (size <= sizeof(long)) {
- if (sign < 0) {
- return rb_int64_convert_to_BigDecimal(NUM2LONG(val), digs, raise_exception);
- }
- else {
- return rb_uint64_convert_to_BigDecimal(NUM2ULONG(val), digs, raise_exception);
- }
- }
-#if defined(SIZEOF_LONG_LONG) && SIZEOF_LONG < SIZEOF_LONG_LONG
- else if (size <= sizeof(LONG_LONG)) {
- if (sign < 0) {
- return rb_int64_convert_to_BigDecimal(NUM2LL(val), digs, raise_exception);
- }
- else {
- return rb_uint64_convert_to_BigDecimal(NUM2ULL(val), digs, raise_exception);
- }
- }
-#endif
- else {
- VALUE str = rb_big2str(val, 10);
- Real *vp = VpCreateRbObject(RSTRING_LEN(str) + BASE_FIG + 1,
- RSTRING_PTR(str), true);
- RB_GC_GUARD(str);
- return check_exception(vp->obj);
- }
-}
-
-static VALUE
-rb_inum_convert_to_BigDecimal(VALUE val, RB_UNUSED_VAR(size_t digs), int raise_exception)
-{
- assert(RB_INTEGER_TYPE_P(val));
- if (FIXNUM_P(val)) {
- return rb_int64_convert_to_BigDecimal(FIX2LONG(val), digs, raise_exception);
- }
- else {
- return rb_big_convert_to_BigDecimal(val, digs, raise_exception);
- }
-}
-
-static VALUE
-rb_float_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception)
-{
- assert(RB_FLOAT_TYPE_P(val));
-
- double d = RFLOAT_VALUE(val);
-
- if (isnan(d)) {
- VALUE obj = BigDecimal_nan();
- return check_exception(obj);
- }
- else if (isinf(d)) {
- VALUE obj;
- if (d > 0) {
- obj = BigDecimal_positive_infinity();
- }
- else {
- obj = BigDecimal_negative_infinity();
- }
- return check_exception(obj);
- }
- else if (d == 0.0) {
- if (1/d < 0.0) {
- return BigDecimal_negative_zero();
- }
- else {
- return BigDecimal_positive_zero();
- }
- }
-
- if (digs == SIZE_MAX) {
- if (!raise_exception)
- return Qnil;
- rb_raise(rb_eArgError,
- "can't omit precision for a %"PRIsVALUE".",
- CLASS_OF(val));
- }
- else if (digs > BIGDECIMAL_DOUBLE_FIGURES) {
- if (!raise_exception)
- return Qnil;
- rb_raise(rb_eArgError, "precision too large.");
- }
-
- /* Use the same logic in flo_to_s to convert a float to a decimal string */
- char buf[BIGDECIMAL_DOUBLE_FIGURES + BASE_FIG + 2 + 1]; /* sizeof(buf) == 28 in the typical case */
- int decpt, negative_p;
- char *e;
- const int mode = digs == 0 ? 0 : 2;
- char *p = BigDecimal_dtoa(d, mode, (int)digs, &decpt, &negative_p, &e);
- int len10 = (int)(e - p);
- if (len10 > BIGDECIMAL_DOUBLE_FIGURES) {
- /* TODO: Presumably, rounding should be done here. */
- len10 = BIGDECIMAL_DOUBLE_FIGURES;
- }
- memcpy(buf, p, len10);
- xfree(p);
-
- VALUE inum;
- size_t RB_UNUSED_VAR(prec) = 0;
- SIGNED_VALUE exp = 0;
- if (decpt > 0) {
- if (decpt < len10) {
- /*
- * len10 |---------------|
- * : |-------| frac_len10 = len10 - decpt
- * decpt |-------| |--| ntz10 = BASE_FIG - frac_len10 % BASE_FIG
- * : : :
- * 00 dd dddd.dddd dd 00
- * prec |-----.----.----.-----| prec = exp + roomof(frac_len, BASE_FIG)
- * exp |-----.----| exp = roomof(decpt, BASE_FIG)
- */
- const size_t frac_len10 = len10 - decpt;
- const size_t ntz10 = BASE_FIG - frac_len10 % BASE_FIG;
- memset(buf + len10, '0', ntz10);
- buf[len10 + ntz10] = '\0';
- inum = rb_cstr_to_inum(buf, 10, false);
-
- exp = roomof(decpt, BASE_FIG);
- prec = exp + roomof(frac_len10, BASE_FIG);
- }
- else {
- /*
- * decpt |-----------------------|
- * len10 |----------| :
- * : |------------| exp10
- * : : :
- * 00 dd dddd dd 00 0000 0000.0
- * : : : :
- * : |--| ntz10 = exp10 % BASE_FIG
- * prec |-----.----.-----| :
- * : |----.----| exp10 / BASE_FIG
- * exp |-----.----.-----.----.----|
- */
- const size_t exp10 = decpt - len10;
- const size_t ntz10 = exp10 % BASE_FIG;
-
- memset(buf + len10, '0', ntz10);
- buf[len10 + ntz10] = '\0';
- inum = rb_cstr_to_inum(buf, 10, false);
-
- prec = roomof(len10 + ntz10, BASE_FIG);
- exp = prec + exp10 / BASE_FIG;
- }
- }
- else if (decpt == 0) {
- /*
- * len10 |------------|
- * : :
- * 0.dddd dddd dd 00
- * : : :
- * : |--| ntz10 = prec * BASE_FIG - len10
- * prec |----.----.-----| roomof(len10, BASE_FIG)
- */
- prec = roomof(len10, BASE_FIG);
- const size_t ntz10 = prec * BASE_FIG - len10;
-
- memset(buf + len10, '0', ntz10);
- buf[len10 + ntz10] = '\0';
- inum = rb_cstr_to_inum(buf, 10, false);
- }
- else {
- /*
- * len10 |---------------|
- * : :
- * decpt |-------| |--| ntz10 = prec * BASE_FIG - nlz10 - len10
- * : : :
- * 0.0000 00 dd dddd dddd dd 00
- * : : :
- * nlz10 |--| : decpt % BASE_FIG
- * prec |-----.----.----.-----| roomof(decpt + len10, BASE_FIG) - exp
- * exp |----| decpt / BASE_FIG
- */
- decpt = -decpt;
-
- const size_t nlz10 = decpt % BASE_FIG;
- exp = decpt / BASE_FIG;
- prec = roomof(decpt + len10, BASE_FIG) - exp;
- const size_t ntz10 = prec * BASE_FIG - nlz10 - len10;
-
- if (nlz10 > 0) {
- memmove(buf + nlz10, buf, len10);
- memset(buf, '0', nlz10);
- }
- memset(buf + nlz10 + len10, '0', ntz10);
- buf[nlz10 + len10 + ntz10] = '\0';
- inum = rb_cstr_to_inum(buf, 10, false);
-
- exp = -exp;
- }
-
- VALUE bd = rb_inum_convert_to_BigDecimal(inum, SIZE_MAX, raise_exception);
- Real *vp;
- TypedData_Get_Struct(bd, Real, &BigDecimal_data_type, vp);
- assert(vp->Prec == prec);
- vp->exponent = exp;
-
- if (negative_p) VpSetSign(vp, -1);
- return bd;
-}
-
-static VALUE
-rb_rational_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception)
-{
- assert(RB_TYPE_P(val, T_RATIONAL));
-
- if (digs == SIZE_MAX) {
- if (!raise_exception)
- return Qnil;
- rb_raise(rb_eArgError,
- "can't omit precision for a %"PRIsVALUE".",
- CLASS_OF(val));
- }
-
- VALUE num = rb_inum_convert_to_BigDecimal(rb_rational_num(val), 0, raise_exception);
- VALUE d = BigDecimal_div2(num, rb_rational_den(val), SIZET2NUM(digs));
- return d;
-}
-
-static VALUE
-rb_cstr_convert_to_BigDecimal(const char *c_str, size_t digs, int raise_exception)
-{
- if (digs == SIZE_MAX)
- digs = 0;
-
- Real *vp = VpCreateRbObject(digs, c_str, raise_exception);
- if (!vp)
- return Qnil;
- return VpCheckGetValue(vp);
-}
-
-static inline VALUE
-rb_str_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception)
-{
- const char *c_str = StringValueCStr(val);
- return rb_cstr_convert_to_BigDecimal(c_str, digs, raise_exception);
-}
-
-static VALUE
-rb_convert_to_BigDecimal(VALUE val, size_t digs, int raise_exception)
-{
- switch (val) {
- case Qnil:
- case Qtrue:
- case Qfalse:
- if (raise_exception) {
- const char *cname = NIL_P(val) ? "nil" :
- val == Qtrue ? "true" :
- val == Qfalse ? "false" :
- NULL;
- rb_raise(rb_eTypeError,
- "can't convert %s into BigDecimal", cname);
- }
- return Qnil;
-
- default:
- break;
- }
-
- if (is_kind_of_BigDecimal(val)) {
- if (digs == SIZE_MAX)
- return check_exception(val);
-
- Real *vp;
- TypedData_Get_Struct(val, Real, &BigDecimal_data_type, vp);
-
- VALUE copy = TypedData_Wrap_Struct(rb_cBigDecimal, &BigDecimal_data_type, 0);
- vp = VpCopy(NULL, vp);
- /* TODO: rounding */
- BigDecimal_wrap_struct(copy, vp);
- return VpCheckGetValue(vp);
- }
- else if (RB_INTEGER_TYPE_P(val)) {
- return rb_inum_convert_to_BigDecimal(val, digs, raise_exception);
- }
- else if (RB_FLOAT_TYPE_P(val)) {
- return rb_float_convert_to_BigDecimal(val, digs, raise_exception);
- }
- else if (RB_TYPE_P(val, T_RATIONAL)) {
- return rb_rational_convert_to_BigDecimal(val, digs, raise_exception);
- }
- else if (RB_TYPE_P(val, T_COMPLEX)) {
- VALUE im = rb_complex_imag(val);
- if (!is_zero(im)) {
- /* TODO: handle raise_exception */
- rb_raise(rb_eArgError,
- "Unable to make a BigDecimal from non-zero imaginary number");
- }
- return rb_convert_to_BigDecimal(rb_complex_real(val), digs, raise_exception);
- }
- else if (RB_TYPE_P(val, T_STRING)) {
- return rb_str_convert_to_BigDecimal(val, digs, raise_exception);
- }
-
- /* TODO: chheck to_d */
- /* TODO: chheck to_int */
-
- VALUE str = rb_check_convert_type(val, T_STRING, "String", "to_str");
- if (!RB_TYPE_P(str, T_STRING)) {
- if (raise_exception) {
- rb_raise(rb_eTypeError,
- "can't convert %"PRIsVALUE" into BigDecimal", rb_obj_class(val));
- }
- return Qnil;
- }
- return rb_str_convert_to_BigDecimal(str, digs, raise_exception);
-}
-
-/* call-seq:
- * BigDecimal(value, exception: true) -> bigdecimal
- * BigDecimal(value, ndigits, exception: true) -> bigdecimal
- *
- * Returns the \BigDecimal converted from +value+
- * with a precision of +ndigits+ decimal digits.
- *
- * When +ndigits+ is less than the number of significant digits
- * in the value, the result is rounded to that number of digits,
- * according to the current rounding mode; see BigDecimal.mode.
- *
- * When +ndigits+ is 0, the number of digits to correctly represent a float number
- * is determined automatically.
- *
- * Returns +value+ converted to a \BigDecimal, depending on the type of +value+:
- *
- * - Integer, Float, Rational, Complex, or BigDecimal: converted directly:
- *
- * # Integer, Complex, or BigDecimal value does not require ndigits; ignored if given.
- * BigDecimal(2) # => 0.2e1
- * BigDecimal(Complex(2, 0)) # => 0.2e1
- * BigDecimal(BigDecimal(2)) # => 0.2e1
- * # Float or Rational value requires ndigits.
- * BigDecimal(2.0, 0) # => 0.2e1
- * BigDecimal(Rational(2, 1), 0) # => 0.2e1
- *
- * - String: converted by parsing if it contains an integer or floating-point literal;
- * leading and trailing whitespace is ignored:
- *
- * # String does not require ndigits; ignored if given.
- * BigDecimal('2') # => 0.2e1
- * BigDecimal('2.0') # => 0.2e1
- * BigDecimal('0.2e1') # => 0.2e1
- * BigDecimal(' 2.0 ') # => 0.2e1
- *
- * - Other type that responds to method :to_str:
- * first converted to a string, then converted to a \BigDecimal, as above.
- *
- * - Other type:
- *
- * - Raises an exception if keyword argument +exception+ is +true+.
- * - Returns +nil+ if keyword argument +exception+ is +true+.
- *
- * Raises an exception if +value+ evaluates to a Float
- * and +digits+ is larger than Float::DIG + 1.
- *
- */
-static VALUE
-f_BigDecimal(int argc, VALUE *argv, VALUE self)
-{
- VALUE val, digs_v, opts = Qnil;
- argc = rb_scan_args(argc, argv, "11:", &val, &digs_v, &opts);
- int exception = opts_exception_p(opts);
-
- size_t digs = SIZE_MAX; /* this means digs is omitted */
- if (argc > 1) {
- digs_v = rb_to_int(digs_v);
- if (FIXNUM_P(digs_v)) {
- long n = FIX2LONG(digs_v);
- if (n < 0)
- goto negative_digs;
- digs = (size_t)n;
- }
- else {
- if (RBIGNUM_NEGATIVE_P(digs_v)) {
- negative_digs:
- if (!exception)
- return Qnil;
- rb_raise(rb_eArgError, "negative precision");
- }
- digs = NUM2SIZET(digs_v);
- }
- }
-
- return rb_convert_to_BigDecimal(val, digs, exception);
-}
-
-static VALUE
-BigDecimal_s_interpret_loosely(VALUE klass, VALUE str)
-{
- char const *c_str = StringValueCStr(str);
- Real *vp = VpNewRbClass(0, c_str, klass, false, true);
- if (!vp)
- return Qnil;
- else
- return VpCheckGetValue(vp);
-}
-
- /* call-seq:
- * BigDecimal.limit(digits)
- *
- * Limit the number of significant digits in newly created BigDecimal
- * numbers to the specified value. Rounding is performed as necessary,
- * as specified by BigDecimal.mode.
- *
- * A limit of 0, the default, means no upper limit.
- *
- * The limit specified by this method takes less priority over any limit
- * specified to instance methods such as ceil, floor, truncate, or round.
- */
-static VALUE
-BigDecimal_limit(int argc, VALUE *argv, VALUE self)
-{
- VALUE nFig;
- VALUE nCur = SIZET2NUM(VpGetPrecLimit());
-
- if (rb_scan_args(argc, argv, "01", &nFig) == 1) {
- int nf;
- if (NIL_P(nFig)) return nCur;
- nf = NUM2INT(nFig);
- if (nf < 0) {
- rb_raise(rb_eArgError, "argument must be positive");
- }
- VpSetPrecLimit(nf);
- }
- return nCur;
-}
-
-/* Returns the sign of the value.
- *
- * Returns a positive value if > 0, a negative value if < 0.
- * It behaves the same with zeros -
- * it returns a positive value for a positive zero (BigDecimal('0')) and
- * a negative value for a negative zero (BigDecimal('-0')).
- *
- * The specific value returned indicates the type and sign of the BigDecimal,
- * as follows:
- *
- * BigDecimal::SIGN_NaN:: value is Not a Number
- * BigDecimal::SIGN_POSITIVE_ZERO:: value is +0
- * BigDecimal::SIGN_NEGATIVE_ZERO:: value is -0
- * BigDecimal::SIGN_POSITIVE_INFINITE:: value is +Infinity
- * BigDecimal::SIGN_NEGATIVE_INFINITE:: value is -Infinity
- * BigDecimal::SIGN_POSITIVE_FINITE:: value is positive
- * BigDecimal::SIGN_NEGATIVE_FINITE:: value is negative
- */
-static VALUE
-BigDecimal_sign(VALUE self)
-{ /* sign */
- int s = GetVpValue(self, 1)->sign;
- return INT2FIX(s);
-}
-
-/*
- * call-seq: BigDecimal.save_exception_mode { ... }
- *
- * Execute the provided block, but preserve the exception mode
- *
- * BigDecimal.save_exception_mode do
- * BigDecimal.mode(BigDecimal::EXCEPTION_OVERFLOW, false)
- * BigDecimal.mode(BigDecimal::EXCEPTION_NaN, false)
- *
- * BigDecimal(BigDecimal('Infinity'))
- * BigDecimal(BigDecimal('-Infinity'))
- * BigDecimal(BigDecimal('NaN'))
- * end
- *
- * For use with the BigDecimal::EXCEPTION_*
- *
- * See BigDecimal.mode
- */
-static VALUE
-BigDecimal_save_exception_mode(VALUE self)
-{
- unsigned short const exception_mode = VpGetException();
- int state;
- VALUE ret = rb_protect(rb_yield, Qnil, &state);
- VpSetException(exception_mode);
- if (state) rb_jump_tag(state);
- return ret;
-}
-
-/*
- * call-seq: BigDecimal.save_rounding_mode { ... }
- *
- * Execute the provided block, but preserve the rounding mode
- *
- * BigDecimal.save_rounding_mode do
- * BigDecimal.mode(BigDecimal::ROUND_MODE, :up)
- * puts BigDecimal.mode(BigDecimal::ROUND_MODE)
- * end
- *
- * For use with the BigDecimal::ROUND_*
- *
- * See BigDecimal.mode
- */
-static VALUE
-BigDecimal_save_rounding_mode(VALUE self)
-{
- unsigned short const round_mode = VpGetRoundMode();
- int state;
- VALUE ret = rb_protect(rb_yield, Qnil, &state);
- VpSetRoundMode(round_mode);
- if (state) rb_jump_tag(state);
- return ret;
-}
-
-/*
- * call-seq: BigDecimal.save_limit { ... }
- *
- * Execute the provided block, but preserve the precision limit
- *
- * BigDecimal.limit(100)
- * puts BigDecimal.limit
- * BigDecimal.save_limit do
- * BigDecimal.limit(200)
- * puts BigDecimal.limit
- * end
- * puts BigDecimal.limit
- *
- */
-static VALUE
-BigDecimal_save_limit(VALUE self)
-{
- size_t const limit = VpGetPrecLimit();
- int state;
- VALUE ret = rb_protect(rb_yield, Qnil, &state);
- VpSetPrecLimit(limit);
- if (state) rb_jump_tag(state);
- return ret;
-}
-
-/* call-seq:
- * BigMath.exp(decimal, numeric) -> BigDecimal
- *
- * Computes the value of e (the base of natural logarithms) raised to the
- * power of +decimal+, to the specified number of digits of precision.
- *
- * If +decimal+ is infinity, returns Infinity.
- *
- * If +decimal+ is NaN, returns NaN.
- */
-static VALUE
-BigMath_s_exp(VALUE klass, VALUE x, VALUE vprec)
-{
- ssize_t prec, n, i;
- Real* vx = NULL;
- VALUE one, d, y;
- int negative = 0;
- int infinite = 0;
- int nan = 0;
- double flo;
-
- prec = NUM2SSIZET(vprec);
- if (prec <= 0) {
- rb_raise(rb_eArgError, "Zero or negative precision for exp");
- }
-
- /* TODO: the following switch statement is almost same as one in the
- * BigDecimalCmp function. */
- switch (TYPE(x)) {
- case T_DATA:
- if (!is_kind_of_BigDecimal(x)) break;
- vx = DATA_PTR(x);
- negative = BIGDECIMAL_NEGATIVE_P(vx);
- infinite = VpIsPosInf(vx) || VpIsNegInf(vx);
- nan = VpIsNaN(vx);
- break;
-
- case T_FIXNUM:
- /* fall through */
- case T_BIGNUM:
- vx = GetVpValue(x, 0);
- break;
-
- case T_FLOAT:
- flo = RFLOAT_VALUE(x);
- negative = flo < 0;
- infinite = isinf(flo);
- nan = isnan(flo);
- if (!infinite && !nan) {
- vx = GetVpValueWithPrec(x, 0, 0);
- }
- break;
-
- case T_RATIONAL:
- vx = GetVpValueWithPrec(x, prec, 0);
- break;
-
- default:
- break;
- }
- if (infinite) {
- if (negative) {
- return VpCheckGetValue(GetVpValueWithPrec(INT2FIX(0), prec, 1));
- }
- else {
- Real* vy = NewZeroWrapNolimit(1, prec);
- VpSetInf(vy, VP_SIGN_POSITIVE_INFINITE);
- RB_GC_GUARD(vy->obj);
- return VpCheckGetValue(vy);
- }
- }
- else if (nan) {
- Real* vy = NewZeroWrapNolimit(1, prec);
- VpSetNaN(vy);
- RB_GC_GUARD(vy->obj);
- return VpCheckGetValue(vy);
- }
- else if (vx == NULL) {
- cannot_be_coerced_into_BigDecimal(rb_eArgError, x);
- }
- x = vx->obj;
-
- n = prec + BIGDECIMAL_DOUBLE_FIGURES;
- negative = BIGDECIMAL_NEGATIVE_P(vx);
- if (negative) {
- VALUE x_zero = INT2NUM(1);
- VALUE x_copy = f_BigDecimal(1, &x_zero, klass);
- x = BigDecimal_initialize_copy(x_copy, x);
- vx = DATA_PTR(x);
- VpSetSign(vx, 1);
- }
-
- one = VpCheckGetValue(NewOneWrapLimited(1, 1));
- y = one;
- d = y;
- i = 1;
-
- while (!VpIsZero((Real*)DATA_PTR(d))) {
- SIGNED_VALUE const ey = VpExponent10(DATA_PTR(y));
- SIGNED_VALUE const ed = VpExponent10(DATA_PTR(d));
- ssize_t m = n - vabs(ey - ed);
-
- rb_thread_check_ints();
-
- if (m <= 0) {
- break;
- }
- else if ((size_t)m < BIGDECIMAL_DOUBLE_FIGURES) {
- m = BIGDECIMAL_DOUBLE_FIGURES;
- }
-
- d = BigDecimal_mult(d, x); /* d <- d * x */
- d = BigDecimal_div2(d, SSIZET2NUM(i), SSIZET2NUM(m)); /* d <- d / i */
- y = BigDecimal_add(y, d); /* y <- y + d */
- ++i; /* i <- i + 1 */
- }
-
- if (negative) {
- return BigDecimal_div2(one, y, vprec);
- }
- else {
- vprec = SSIZET2NUM(prec - VpExponent10(DATA_PTR(y)));
- return BigDecimal_round(1, &vprec, y);
- }
-
- RB_GC_GUARD(one);
- RB_GC_GUARD(x);
- RB_GC_GUARD(y);
- RB_GC_GUARD(d);
-}
-
-/* call-seq:
- * BigMath.log(decimal, numeric) -> BigDecimal
- *
- * Computes the natural logarithm of +decimal+ to the specified number of
- * digits of precision, +numeric+.
- *
- * If +decimal+ is zero or negative, raises Math::DomainError.
- *
- * If +decimal+ is positive infinity, returns Infinity.
- *
- * If +decimal+ is NaN, returns NaN.
- */
-static VALUE
-BigMath_s_log(VALUE klass, VALUE x, VALUE vprec)
-{
- ssize_t prec, n, i;
- SIGNED_VALUE expo;
- Real* vx = NULL;
- VALUE vn, one, two, w, x2, y, d;
- int zero = 0;
- int negative = 0;
- int infinite = 0;
- int nan = 0;
- double flo;
- long fix;
-
- if (!is_integer(vprec)) {
- rb_raise(rb_eArgError, "precision must be an Integer");
- }
-
- prec = NUM2SSIZET(vprec);
- if (prec <= 0) {
- rb_raise(rb_eArgError, "Zero or negative precision for exp");
- }
-
- /* TODO: the following switch statement is almost same as one in the
- * BigDecimalCmp function. */
- switch (TYPE(x)) {
- case T_DATA:
- if (!is_kind_of_BigDecimal(x)) break;
- vx = DATA_PTR(x);
- zero = VpIsZero(vx);
- negative = BIGDECIMAL_NEGATIVE_P(vx);
- infinite = VpIsPosInf(vx) || VpIsNegInf(vx);
- nan = VpIsNaN(vx);
- break;
-
- case T_FIXNUM:
- fix = FIX2LONG(x);
- zero = fix == 0;
- negative = fix < 0;
- goto get_vp_value;
-
- case T_BIGNUM:
- i = FIX2INT(rb_big_cmp(x, INT2FIX(0)));
- zero = i == 0;
- negative = i < 0;
-get_vp_value:
- if (zero || negative) break;
- vx = GetVpValue(x, 0);
- break;
-
- case T_FLOAT:
- flo = RFLOAT_VALUE(x);
- zero = flo == 0;
- negative = flo < 0;
- infinite = isinf(flo);
- nan = isnan(flo);
- if (!zero && !negative && !infinite && !nan) {
- vx = GetVpValueWithPrec(x, 0, 1);
- }
- break;
-
- case T_RATIONAL:
- zero = RRATIONAL_ZERO_P(x);
- negative = RRATIONAL_NEGATIVE_P(x);
- if (zero || negative) break;
- vx = GetVpValueWithPrec(x, prec, 1);
- break;
-
- case T_COMPLEX:
- rb_raise(rb_eMathDomainError,
- "Complex argument for BigMath.log");
-
- default:
- break;
- }
- if (infinite && !negative) {
- Real *vy = NewZeroWrapNolimit(1, prec);
- RB_GC_GUARD(vy->obj);
- VpSetInf(vy, VP_SIGN_POSITIVE_INFINITE);
- return VpCheckGetValue(vy);
- }
- else if (nan) {
- Real* vy = NewZeroWrapNolimit(1, prec);
- RB_GC_GUARD(vy->obj);
- VpSetNaN(vy);
- return VpCheckGetValue(vy);
- }
- else if (zero || negative) {
- rb_raise(rb_eMathDomainError,
- "Zero or negative argument for log");
- }
- else if (vx == NULL) {
- cannot_be_coerced_into_BigDecimal(rb_eArgError, x);
- }
- x = VpCheckGetValue(vx);
-
- one = VpCheckGetValue(NewOneWrapLimited(1, 1));
- two = VpCheckGetValue(VpCreateRbObject(1, "2", true));
-
- n = prec + BIGDECIMAL_DOUBLE_FIGURES;
- vn = SSIZET2NUM(n);
- expo = VpExponent10(vx);
- if (expo < 0 || expo >= 3) {
- char buf[DECIMAL_SIZE_OF_BITS(SIZEOF_VALUE * CHAR_BIT) + 4];
- snprintf(buf, sizeof(buf), "1E%"PRIdVALUE, -expo);
- x = BigDecimal_mult2(x, VpCheckGetValue(VpCreateRbObject(1, buf, true)), vn);
- }
- else {
- expo = 0;
- }
- w = BigDecimal_sub(x, one);
- x = BigDecimal_div2(w, BigDecimal_add(x, one), vn);
- x2 = BigDecimal_mult2(x, x, vn);
- y = x;
- d = y;
- i = 1;
- while (!VpIsZero((Real*)DATA_PTR(d))) {
- SIGNED_VALUE const ey = VpExponent10(DATA_PTR(y));
- SIGNED_VALUE const ed = VpExponent10(DATA_PTR(d));
- ssize_t m = n - vabs(ey - ed);
- if (m <= 0) {
- break;
- }
- else if ((size_t)m < BIGDECIMAL_DOUBLE_FIGURES) {
- m = BIGDECIMAL_DOUBLE_FIGURES;
- }
-
- x = BigDecimal_mult2(x2, x, vn);
- i += 2;
- d = BigDecimal_div2(x, SSIZET2NUM(i), SSIZET2NUM(m));
- y = BigDecimal_add(y, d);
- }
-
- y = BigDecimal_mult(y, two);
- if (expo != 0) {
- VALUE log10, vexpo, dy;
- log10 = BigMath_s_log(klass, INT2FIX(10), vprec);
- vexpo = VpCheckGetValue(GetVpValue(SSIZET2NUM(expo), 1));
- dy = BigDecimal_mult(log10, vexpo);
- y = BigDecimal_add(y, dy);
- }
-
- RB_GC_GUARD(one);
- RB_GC_GUARD(two);
- RB_GC_GUARD(vn);
- RB_GC_GUARD(x2);
- RB_GC_GUARD(y);
- RB_GC_GUARD(d);
-
- return y;
-}
-
-static VALUE BIGDECIMAL_NAN = Qnil;
-
-static VALUE
-BigDecimal_nan(void)
-{
- return BIGDECIMAL_NAN;
-}
-
-static VALUE BIGDECIMAL_POSITIVE_INFINITY = Qnil;
-
-static VALUE
-BigDecimal_positive_infinity(void)
-{
- return BIGDECIMAL_POSITIVE_INFINITY;
-}
-
-static VALUE BIGDECIMAL_NEGATIVE_INFINITY = Qnil;
-
-static VALUE
-BigDecimal_negative_infinity(void)
-{
- return BIGDECIMAL_NEGATIVE_INFINITY;
-}
-
-static VALUE BIGDECIMAL_POSITIVE_ZERO = Qnil;
-
-static VALUE
-BigDecimal_positive_zero(void)
-{
- return BIGDECIMAL_POSITIVE_ZERO;
-}
-
-static VALUE BIGDECIMAL_NEGATIVE_ZERO = Qnil;
-
-static VALUE
-BigDecimal_negative_zero(void)
-{
- return BIGDECIMAL_NEGATIVE_ZERO;
-}
-
-/* Document-class: BigDecimal
- * BigDecimal provides arbitrary-precision floating point decimal arithmetic.
- *
- * == Introduction
- *
- * Ruby provides built-in support for arbitrary precision integer arithmetic.
- *
- * For example:
- *
- * 42**13 #=> 1265437718438866624512
- *
- * BigDecimal provides similar support for very large or very accurate floating
- * point numbers.
- *
- * Decimal arithmetic is also useful for general calculation, because it
- * provides the correct answers people expect--whereas normal binary floating
- * point arithmetic often introduces subtle errors because of the conversion
- * between base 10 and base 2.
- *
- * For example, try:
- *
- * sum = 0
- * 10_000.times do
- * sum = sum + 0.0001
- * end
- * print sum #=> 0.9999999999999062
- *
- * and contrast with the output from:
- *
- * require 'bigdecimal'
- *
- * sum = BigDecimal("0")
- * 10_000.times do
- * sum = sum + BigDecimal("0.0001")
- * end
- * print sum #=> 0.1E1
- *
- * Similarly:
- *
- * (BigDecimal("1.2") - BigDecimal("1.0")) == BigDecimal("0.2") #=> true
- *
- * (1.2 - 1.0) == 0.2 #=> false
- *
- * == A Note About Precision
- *
- * For a calculation using a \BigDecimal and another +value+,
- * the precision of the result depends on the type of +value+:
- *
- * - If +value+ is a \Float,
- * the precision is Float::DIG + 1.
- * - If +value+ is a \Rational, the precision is larger than Float::DIG + 1.
- * - If +value+ is a \BigDecimal, the precision is +value+'s precision in the
- * internal representation, which is platform-dependent.
- * - If +value+ is other object, the precision is determined by the result of +BigDecimal(value)+.
- *
- * == Special features of accurate decimal arithmetic
- *
- * Because BigDecimal is more accurate than normal binary floating point
- * arithmetic, it requires some special values.
- *
- * === Infinity
- *
- * BigDecimal sometimes needs to return infinity, for example if you divide
- * a value by zero.
- *
- * BigDecimal("1.0") / BigDecimal("0.0") #=> Infinity
- * BigDecimal("-1.0") / BigDecimal("0.0") #=> -Infinity
- *
- * You can represent infinite numbers to BigDecimal using the strings
- * 'Infinity', '+Infinity' and
- * '-Infinity' (case-sensitive)
- *
- * === Not a Number
- *
- * When a computation results in an undefined value, the special value +NaN+
- * (for 'not a number') is returned.
- *
- * Example:
- *
- * BigDecimal("0.0") / BigDecimal("0.0") #=> NaN
- *
- * You can also create undefined values.
- *
- * NaN is never considered to be the same as any other value, even NaN itself:
- *
- * n = BigDecimal('NaN')
- * n == 0.0 #=> false
- * n == n #=> false
- *
- * === Positive and negative zero
- *
- * If a computation results in a value which is too small to be represented as
- * a BigDecimal within the currently specified limits of precision, zero must
- * be returned.
- *
- * If the value which is too small to be represented is negative, a BigDecimal
- * value of negative zero is returned.
- *
- * BigDecimal("1.0") / BigDecimal("-Infinity") #=> -0.0
- *
- * If the value is positive, a value of positive zero is returned.
- *
- * BigDecimal("1.0") / BigDecimal("Infinity") #=> 0.0
- *
- * (See BigDecimal.mode for how to specify limits of precision.)
- *
- * Note that +-0.0+ and +0.0+ are considered to be the same for the purposes of
- * comparison.
- *
- * Note also that in mathematics, there is no particular concept of negative
- * or positive zero; true mathematical zero has no sign.
- *
- * == bigdecimal/util
- *
- * When you require +bigdecimal/util+, the #to_d method will be
- * available on BigDecimal and the native Integer, Float, Rational,
- * and String classes:
- *
- * require 'bigdecimal/util'
- *
- * 42.to_d # => 0.42e2
- * 0.5.to_d # => 0.5e0
- * (2/3r).to_d(3) # => 0.667e0
- * "0.5".to_d # => 0.5e0
- *
- * == License
- *
- * Copyright (C) 2002 by Shigeo Kobayashi .
- *
- * BigDecimal is released under the Ruby and 2-clause BSD licenses.
- * See LICENSE.txt for details.
- *
- * Maintained by mrkn and ruby-core members.
- *
- * Documented by zzak , mathew , and
- * many other contributors.
- */
-void
-Init_bigdecimal(void)
-{
-#ifdef HAVE_RB_EXT_RACTOR_SAFE
- rb_ext_ractor_safe(true);
-#endif
- VALUE arg;
-
- id_BigDecimal_exception_mode = rb_intern_const("BigDecimal.exception_mode");
- id_BigDecimal_rounding_mode = rb_intern_const("BigDecimal.rounding_mode");
- id_BigDecimal_precision_limit = rb_intern_const("BigDecimal.precision_limit");
-
- /* Initialize VP routines */
- VpInit(0UL);
-
- /* Class and method registration */
- rb_cBigDecimal = rb_define_class("BigDecimal", rb_cNumeric);
-
- /* Global function */
- rb_define_global_function("BigDecimal", f_BigDecimal, -1);
-
- /* Class methods */
- rb_undef_alloc_func(rb_cBigDecimal);
- rb_undef_method(CLASS_OF(rb_cBigDecimal), "new");
- rb_define_singleton_method(rb_cBigDecimal, "interpret_loosely", BigDecimal_s_interpret_loosely, 1);
- rb_define_singleton_method(rb_cBigDecimal, "mode", BigDecimal_mode, -1);
- rb_define_singleton_method(rb_cBigDecimal, "limit", BigDecimal_limit, -1);
- rb_define_singleton_method(rb_cBigDecimal, "double_fig", BigDecimal_double_fig, 0);
- rb_define_singleton_method(rb_cBigDecimal, "_load", BigDecimal_load, 1);
-
- rb_define_singleton_method(rb_cBigDecimal, "save_exception_mode", BigDecimal_save_exception_mode, 0);
- rb_define_singleton_method(rb_cBigDecimal, "save_rounding_mode", BigDecimal_save_rounding_mode, 0);
- rb_define_singleton_method(rb_cBigDecimal, "save_limit", BigDecimal_save_limit, 0);
-
- /* Constants definition */
-
- /*
- * The version of bigdecimal library
- */
- rb_define_const(rb_cBigDecimal, "VERSION", rb_str_new2(BIGDECIMAL_VERSION));
-
- /*
- * Base value used in internal calculations. On a 32 bit system, BASE
- * is 10000, indicating that calculation is done in groups of 4 digits.
- * (If it were larger, BASE**2 wouldn't fit in 32 bits, so you couldn't
- * guarantee that two groups could always be multiplied together without
- * overflow.)
- */
- rb_define_const(rb_cBigDecimal, "BASE", INT2FIX((SIGNED_VALUE)VpBaseVal()));
-
- /* Exceptions */
-
- /*
- * 0xff: Determines whether overflow, underflow or zero divide result in
- * an exception being thrown. See BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "EXCEPTION_ALL", INT2FIX(VP_EXCEPTION_ALL));
-
- /*
- * 0x02: Determines what happens when the result of a computation is not a
- * number (NaN). See BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "EXCEPTION_NaN", INT2FIX(VP_EXCEPTION_NaN));
-
- /*
- * 0x01: Determines what happens when the result of a computation is
- * infinity. See BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "EXCEPTION_INFINITY", INT2FIX(VP_EXCEPTION_INFINITY));
-
- /*
- * 0x04: Determines what happens when the result of a computation is an
- * underflow (a result too small to be represented). See BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "EXCEPTION_UNDERFLOW", INT2FIX(VP_EXCEPTION_UNDERFLOW));
-
- /*
- * 0x01: Determines what happens when the result of a computation is an
- * overflow (a result too large to be represented). See BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "EXCEPTION_OVERFLOW", INT2FIX(VP_EXCEPTION_OVERFLOW));
-
- /*
- * 0x10: Determines what happens when a division by zero is performed.
- * See BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "EXCEPTION_ZERODIVIDE", INT2FIX(VP_EXCEPTION_ZERODIVIDE));
-
- /*
- * 0x100: Determines what happens when a result must be rounded in order to
- * fit in the appropriate number of significant digits. See
- * BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "ROUND_MODE", INT2FIX(VP_ROUND_MODE));
-
- /* 1: Indicates that values should be rounded away from zero. See
- * BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "ROUND_UP", INT2FIX(VP_ROUND_UP));
-
- /* 2: Indicates that values should be rounded towards zero. See
- * BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "ROUND_DOWN", INT2FIX(VP_ROUND_DOWN));
-
- /* 3: Indicates that digits >= 5 should be rounded up, others rounded down.
- * See BigDecimal.mode. */
- rb_define_const(rb_cBigDecimal, "ROUND_HALF_UP", INT2FIX(VP_ROUND_HALF_UP));
-
- /* 4: Indicates that digits >= 6 should be rounded up, others rounded down.
- * See BigDecimal.mode.
- */
- rb_define_const(rb_cBigDecimal, "ROUND_HALF_DOWN", INT2FIX(VP_ROUND_HALF_DOWN));
- /* 5: Round towards +Infinity. See BigDecimal.mode. */
- rb_define_const(rb_cBigDecimal, "ROUND_CEILING", INT2FIX(VP_ROUND_CEIL));
-
- /* 6: Round towards -Infinity. See BigDecimal.mode. */
- rb_define_const(rb_cBigDecimal, "ROUND_FLOOR", INT2FIX(VP_ROUND_FLOOR));
-
- /* 7: Round towards the even neighbor. See BigDecimal.mode. */
- rb_define_const(rb_cBigDecimal, "ROUND_HALF_EVEN", INT2FIX(VP_ROUND_HALF_EVEN));
-
- /* 0: Indicates that a value is not a number. See BigDecimal.sign. */
- rb_define_const(rb_cBigDecimal, "SIGN_NaN", INT2FIX(VP_SIGN_NaN));
-
- /* 1: Indicates that a value is +0. See BigDecimal.sign. */
- rb_define_const(rb_cBigDecimal, "SIGN_POSITIVE_ZERO", INT2FIX(VP_SIGN_POSITIVE_ZERO));
-
- /* -1: Indicates that a value is -0. See BigDecimal.sign. */
- rb_define_const(rb_cBigDecimal, "SIGN_NEGATIVE_ZERO", INT2FIX(VP_SIGN_NEGATIVE_ZERO));
-
- /* 2: Indicates that a value is positive and finite. See BigDecimal.sign. */
- rb_define_const(rb_cBigDecimal, "SIGN_POSITIVE_FINITE", INT2FIX(VP_SIGN_POSITIVE_FINITE));
-
- /* -2: Indicates that a value is negative and finite. See BigDecimal.sign. */
- rb_define_const(rb_cBigDecimal, "SIGN_NEGATIVE_FINITE", INT2FIX(VP_SIGN_NEGATIVE_FINITE));
-
- /* 3: Indicates that a value is positive and infinite. See BigDecimal.sign. */
- rb_define_const(rb_cBigDecimal, "SIGN_POSITIVE_INFINITE", INT2FIX(VP_SIGN_POSITIVE_INFINITE));
-
- /* -3: Indicates that a value is negative and infinite. See BigDecimal.sign. */
- rb_define_const(rb_cBigDecimal, "SIGN_NEGATIVE_INFINITE", INT2FIX(VP_SIGN_NEGATIVE_INFINITE));
-
- /* Positive zero value. */
- arg = rb_str_new2("+0");
- BIGDECIMAL_POSITIVE_ZERO = f_BigDecimal(1, &arg, rb_cBigDecimal);
- rb_gc_register_mark_object(BIGDECIMAL_POSITIVE_ZERO);
-
- /* Negative zero value. */
- arg = rb_str_new2("-0");
- BIGDECIMAL_NEGATIVE_ZERO = f_BigDecimal(1, &arg, rb_cBigDecimal);
- rb_gc_register_mark_object(BIGDECIMAL_NEGATIVE_ZERO);
-
- /* Positive infinity value. */
- arg = rb_str_new2("+Infinity");
- BIGDECIMAL_POSITIVE_INFINITY = f_BigDecimal(1, &arg, rb_cBigDecimal);
- rb_gc_register_mark_object(BIGDECIMAL_POSITIVE_INFINITY);
-
- /* Negative infinity value. */
- arg = rb_str_new2("-Infinity");
- BIGDECIMAL_NEGATIVE_INFINITY = f_BigDecimal(1, &arg, rb_cBigDecimal);
- rb_gc_register_mark_object(BIGDECIMAL_NEGATIVE_INFINITY);
-
- /* 'Not a Number' value. */
- arg = rb_str_new2("NaN");
- BIGDECIMAL_NAN = f_BigDecimal(1, &arg, rb_cBigDecimal);
- rb_gc_register_mark_object(BIGDECIMAL_NAN);
-
- /* Special value constants */
- rb_define_const(rb_cBigDecimal, "INFINITY", BIGDECIMAL_POSITIVE_INFINITY);
- rb_define_const(rb_cBigDecimal, "NAN", BIGDECIMAL_NAN);
-
- /* instance methods */
- rb_define_method(rb_cBigDecimal, "precs", BigDecimal_prec, 0);
- rb_define_method(rb_cBigDecimal, "precision", BigDecimal_precision, 0);
- rb_define_method(rb_cBigDecimal, "scale", BigDecimal_scale, 0);
- rb_define_method(rb_cBigDecimal, "precision_scale", BigDecimal_precision_scale, 0);
- rb_define_method(rb_cBigDecimal, "n_significant_digits", BigDecimal_n_significant_digits, 0);
-
- rb_define_method(rb_cBigDecimal, "add", BigDecimal_add2, 2);
- rb_define_method(rb_cBigDecimal, "sub", BigDecimal_sub2, 2);
- rb_define_method(rb_cBigDecimal, "mult", BigDecimal_mult2, 2);
- rb_define_method(rb_cBigDecimal, "div", BigDecimal_div3, -1);
- rb_define_method(rb_cBigDecimal, "hash", BigDecimal_hash, 0);
- rb_define_method(rb_cBigDecimal, "to_s", BigDecimal_to_s, -1);
- rb_define_method(rb_cBigDecimal, "to_i", BigDecimal_to_i, 0);
- rb_define_method(rb_cBigDecimal, "to_int", BigDecimal_to_i, 0);
- rb_define_method(rb_cBigDecimal, "to_r", BigDecimal_to_r, 0);
- rb_define_method(rb_cBigDecimal, "split", BigDecimal_split, 0);
- rb_define_method(rb_cBigDecimal, "+", BigDecimal_add, 1);
- rb_define_method(rb_cBigDecimal, "-", BigDecimal_sub, 1);
- rb_define_method(rb_cBigDecimal, "+@", BigDecimal_uplus, 0);
- rb_define_method(rb_cBigDecimal, "-@", BigDecimal_neg, 0);
- rb_define_method(rb_cBigDecimal, "*", BigDecimal_mult, 1);
- rb_define_method(rb_cBigDecimal, "/", BigDecimal_div, 1);
- rb_define_method(rb_cBigDecimal, "quo", BigDecimal_quo, -1);
- rb_define_method(rb_cBigDecimal, "%", BigDecimal_mod, 1);
- rb_define_method(rb_cBigDecimal, "modulo", BigDecimal_mod, 1);
- rb_define_method(rb_cBigDecimal, "remainder", BigDecimal_remainder, 1);
- rb_define_method(rb_cBigDecimal, "divmod", BigDecimal_divmod, 1);
- rb_define_method(rb_cBigDecimal, "clone", BigDecimal_clone, 0);
- rb_define_method(rb_cBigDecimal, "dup", BigDecimal_clone, 0);
- rb_define_method(rb_cBigDecimal, "to_f", BigDecimal_to_f, 0);
- rb_define_method(rb_cBigDecimal, "abs", BigDecimal_abs, 0);
- rb_define_method(rb_cBigDecimal, "sqrt", BigDecimal_sqrt, 1);
- rb_define_method(rb_cBigDecimal, "fix", BigDecimal_fix, 0);
- rb_define_method(rb_cBigDecimal, "round", BigDecimal_round, -1);
- rb_define_method(rb_cBigDecimal, "frac", BigDecimal_frac, 0);
- rb_define_method(rb_cBigDecimal, "floor", BigDecimal_floor, -1);
- rb_define_method(rb_cBigDecimal, "ceil", BigDecimal_ceil, -1);
- rb_define_method(rb_cBigDecimal, "power", BigDecimal_power, -1);
- rb_define_method(rb_cBigDecimal, "**", BigDecimal_power_op, 1);
- rb_define_method(rb_cBigDecimal, "<=>", BigDecimal_comp, 1);
- rb_define_method(rb_cBigDecimal, "==", BigDecimal_eq, 1);
- rb_define_method(rb_cBigDecimal, "===", BigDecimal_eq, 1);
- rb_define_method(rb_cBigDecimal, "eql?", BigDecimal_eq, 1);
- rb_define_method(rb_cBigDecimal, "<", BigDecimal_lt, 1);
- rb_define_method(rb_cBigDecimal, "<=", BigDecimal_le, 1);
- rb_define_method(rb_cBigDecimal, ">", BigDecimal_gt, 1);
- rb_define_method(rb_cBigDecimal, ">=", BigDecimal_ge, 1);
- rb_define_method(rb_cBigDecimal, "zero?", BigDecimal_zero, 0);
- rb_define_method(rb_cBigDecimal, "nonzero?", BigDecimal_nonzero, 0);
- rb_define_method(rb_cBigDecimal, "coerce", BigDecimal_coerce, 1);
- rb_define_method(rb_cBigDecimal, "inspect", BigDecimal_inspect, 0);
- rb_define_method(rb_cBigDecimal, "exponent", BigDecimal_exponent, 0);
- rb_define_method(rb_cBigDecimal, "sign", BigDecimal_sign, 0);
- rb_define_method(rb_cBigDecimal, "nan?", BigDecimal_IsNaN, 0);
- rb_define_method(rb_cBigDecimal, "infinite?", BigDecimal_IsInfinite, 0);
- rb_define_method(rb_cBigDecimal, "finite?", BigDecimal_IsFinite, 0);
- rb_define_method(rb_cBigDecimal, "truncate", BigDecimal_truncate, -1);
- rb_define_method(rb_cBigDecimal, "_dump", BigDecimal_dump, -1);
-
- rb_mBigMath = rb_define_module("BigMath");
- rb_define_singleton_method(rb_mBigMath, "exp", BigMath_s_exp, 2);
- rb_define_singleton_method(rb_mBigMath, "log", BigMath_s_log, 2);
-
-#define ROUNDING_MODE(i, name, value) \
- id_##name = rb_intern_const(#name); \
- rbd_rounding_modes[i].id = id_##name; \
- rbd_rounding_modes[i].mode = value;
-
- ROUNDING_MODE(0, up, RBD_ROUND_UP);
- ROUNDING_MODE(1, down, RBD_ROUND_DOWN);
- ROUNDING_MODE(2, half_up, RBD_ROUND_HALF_UP);
- ROUNDING_MODE(3, half_down, RBD_ROUND_HALF_DOWN);
- ROUNDING_MODE(4, ceil, RBD_ROUND_CEIL);
- ROUNDING_MODE(5, floor, RBD_ROUND_FLOOR);
- ROUNDING_MODE(6, half_even, RBD_ROUND_HALF_EVEN);
-
- ROUNDING_MODE(7, default, RBD_ROUND_DEFAULT);
- ROUNDING_MODE(8, truncate, RBD_ROUND_TRUNCATE);
- ROUNDING_MODE(9, banker, RBD_ROUND_BANKER);
- ROUNDING_MODE(10, ceiling, RBD_ROUND_CEILING);
-
-#undef ROUNDING_MODE
-
- id_to_r = rb_intern_const("to_r");
- id_eq = rb_intern_const("==");
- id_half = rb_intern_const("half");
-
- (void)VPrint; /* suppress unused warning */
-}
-
-/*
- *
- * ============================================================================
- *
- * vp_ routines begin from here.
- *
- * ============================================================================
- *
- */
-#ifdef BIGDECIMAL_DEBUG
-static int gfDebug = 1; /* Debug switch */
-#if 0
-static int gfCheckVal = 1; /* Value checking flag in VpNmlz() */
-#endif
-#endif /* BIGDECIMAL_DEBUG */
-
-static Real *VpConstOne; /* constant 1.0 */
-static Real *VpConstPt5; /* constant 0.5 */
-#define maxnr 100UL /* Maximum iterations for calculating sqrt. */
- /* used in VpSqrt() */
-
-/* ETC */
-#define MemCmp(x,y,z) memcmp(x,y,z)
-#define StrCmp(x,y) strcmp(x,y)
-
-enum op_sw {
- OP_SW_ADD = 1, /* + */
- OP_SW_SUB, /* - */
- OP_SW_MULT, /* * */
- OP_SW_DIV /* / */
-};
-
-static int VpIsDefOP(Real *c, Real *a, Real *b, enum op_sw sw);
-static int AddExponent(Real *a, SIGNED_VALUE n);
-static DECDIG VpAddAbs(Real *a,Real *b,Real *c);
-static DECDIG VpSubAbs(Real *a,Real *b,Real *c);
-static size_t VpSetPTR(Real *a, Real *b, Real *c, size_t *a_pos, size_t *b_pos, size_t *c_pos, DECDIG *av, DECDIG *bv);
-static int VpNmlz(Real *a);
-static void VpFormatSt(char *psz, size_t fFmt);
-static int VpRdup(Real *m, size_t ind_m);
-
-#ifdef BIGDECIMAL_DEBUG
-# ifdef HAVE_RB_EXT_RACTOR_SAFE
-# error Need to make rewiting gnAlloc atomic
-# endif
-static int gnAlloc = 0; /* Memory allocation counter */
-#endif /* BIGDECIMAL_DEBUG */
-
-/*
- * EXCEPTION Handling.
- */
-
-#define bigdecimal_set_thread_local_exception_mode(mode) \
- rb_thread_local_aset( \
- rb_thread_current(), \
- id_BigDecimal_exception_mode, \
- INT2FIX((int)(mode)) \
- )
-
-static unsigned short
-VpGetException (void)
-{
- VALUE const vmode = rb_thread_local_aref(
- rb_thread_current(),
- id_BigDecimal_exception_mode
- );
-
- if (NIL_P(vmode)) {
- bigdecimal_set_thread_local_exception_mode(BIGDECIMAL_EXCEPTION_MODE_DEFAULT);
- return BIGDECIMAL_EXCEPTION_MODE_DEFAULT;
- }
-
- return NUM2USHORT(vmode);
-}
-
-static void
-VpSetException(unsigned short f)
-{
- bigdecimal_set_thread_local_exception_mode(f);
-}
-
-static void
-VpCheckException(Real *p, bool always)
-{
- if (VpIsNaN(p)) {
- VpException(VP_EXCEPTION_NaN, "Computation results in 'NaN' (Not a Number)", always);
- }
- else if (VpIsPosInf(p)) {
- VpException(VP_EXCEPTION_INFINITY, "Computation results in 'Infinity'", always);
- }
- else if (VpIsNegInf(p)) {
- VpException(VP_EXCEPTION_INFINITY, "Computation results in '-Infinity'", always);
- }
-}
-
-static VALUE
-VpCheckGetValue(Real *p)
-{
- VpCheckException(p, false);
- return p->obj;
-}
-
-/*
- * Precision limit.
- */
-
-#define bigdecimal_set_thread_local_precision_limit(limit) \
- rb_thread_local_aset( \
- rb_thread_current(), \
- id_BigDecimal_precision_limit, \
- SIZET2NUM(limit) \
- )
-#define BIGDECIMAL_PRECISION_LIMIT_DEFAULT ((size_t)0)
-
-/* These 2 functions added at v1.1.7 */
-VP_EXPORT size_t
-VpGetPrecLimit(void)
-{
- VALUE const vlimit = rb_thread_local_aref(
- rb_thread_current(),
- id_BigDecimal_precision_limit
- );
-
- if (NIL_P(vlimit)) {
- bigdecimal_set_thread_local_precision_limit(BIGDECIMAL_PRECISION_LIMIT_DEFAULT);
- return BIGDECIMAL_PRECISION_LIMIT_DEFAULT;
- }
-
- return NUM2SIZET(vlimit);
-}
-
-VP_EXPORT size_t
-VpSetPrecLimit(size_t n)
-{
- size_t const s = VpGetPrecLimit();
- bigdecimal_set_thread_local_precision_limit(n);
- return s;
-}
-
-/*
- * Rounding mode.
- */
-
-#define bigdecimal_set_thread_local_rounding_mode(mode) \
- rb_thread_local_aset( \
- rb_thread_current(), \
- id_BigDecimal_rounding_mode, \
- INT2FIX((int)(mode)) \
- )
-
-VP_EXPORT unsigned short
-VpGetRoundMode(void)
-{
- VALUE const vmode = rb_thread_local_aref(
- rb_thread_current(),
- id_BigDecimal_rounding_mode
- );
-
- if (NIL_P(vmode)) {
- bigdecimal_set_thread_local_rounding_mode(BIGDECIMAL_ROUNDING_MODE_DEFAULT);
- return BIGDECIMAL_ROUNDING_MODE_DEFAULT;
- }
-
- return NUM2USHORT(vmode);
-}
-
-VP_EXPORT int
-VpIsRoundMode(unsigned short n)
-{
- switch (n) {
- case VP_ROUND_UP:
- case VP_ROUND_DOWN:
- case VP_ROUND_HALF_UP:
- case VP_ROUND_HALF_DOWN:
- case VP_ROUND_CEIL:
- case VP_ROUND_FLOOR:
- case VP_ROUND_HALF_EVEN:
- return 1;
-
- default:
- return 0;
- }
-}
-
-VP_EXPORT unsigned short
-VpSetRoundMode(unsigned short n)
-{
- if (VpIsRoundMode(n)) {
- bigdecimal_set_thread_local_rounding_mode(n);
- return n;
- }
-
- return VpGetRoundMode();
-}
-
-/*
- * 0.0 & 1.0 generator
- * These gZero_..... and gOne_..... can be any name
- * referenced from nowhere except Zero() and One().
- * gZero_..... and gOne_..... must have global scope
- * (to let the compiler know they may be changed in outside
- * (... but not actually..)).
- */
-volatile const double gOne_ABCED9B4_CE73__00400511F31D = 1.0;
-
-static double
-One(void)
-{
- return gOne_ABCED9B4_CE73__00400511F31D;
-}
-
-/*
- ----------------------------------------------------------------
- Value of sign in Real structure is reserved for future use.
- short sign;
- ==0 : NaN
- 1 : Positive zero
- -1 : Negative zero
- 2 : Positive number
- -2 : Negative number
- 3 : Positive infinite number
- -3 : Negative infinite number
- ----------------------------------------------------------------
-*/
-
-VP_EXPORT double
-VpGetDoubleNaN(void) /* Returns the value of NaN */
-{
- return nan("");
-}
-
-VP_EXPORT double
-VpGetDoublePosInf(void) /* Returns the value of +Infinity */
-{
- return HUGE_VAL;
-}
-
-VP_EXPORT double
-VpGetDoubleNegInf(void) /* Returns the value of -Infinity */
-{
- return -HUGE_VAL;
-}
-
-VP_EXPORT double
-VpGetDoubleNegZero(void) /* Returns the value of -0 */
-{
- static double nzero = 1000.0;
- if (nzero != 0.0) nzero = (One()/VpGetDoubleNegInf());
- return nzero;
-}
-
-#if 0 /* unused */
-VP_EXPORT int
-VpIsNegDoubleZero(double v)
-{
- double z = VpGetDoubleNegZero();
- return MemCmp(&v,&z,sizeof(v))==0;
-}
-#endif
-
-VP_EXPORT int
-VpException(unsigned short f, const char *str,int always)
-{
- unsigned short const exception_mode = VpGetException();
-
- if (f == VP_EXCEPTION_OP) always = 1;
-
- if (always || (exception_mode & f)) {
- switch(f) {
- /* case VP_EXCEPTION_OVERFLOW: */
- case VP_EXCEPTION_ZERODIVIDE:
- case VP_EXCEPTION_INFINITY:
- case VP_EXCEPTION_NaN:
- case VP_EXCEPTION_UNDERFLOW:
- case VP_EXCEPTION_OP:
- rb_raise(rb_eFloatDomainError, "%s", str);
- break;
- default:
- rb_fatal("%s", str);
- }
- }
- return 0; /* 0 Means VpException() raised no exception */
-}
-
-/* Throw exception or returns 0,when resulting c is Inf or NaN */
-/* sw=1:+ 2:- 3:* 4:/ */
-static int
-VpIsDefOP(Real *c, Real *a, Real *b, enum op_sw sw)
-{
- if (VpIsNaN(a) || VpIsNaN(b)) {
- /* at least a or b is NaN */
- VpSetNaN(c);
- goto NaN;
- }
-
- if (VpIsInf(a)) {
- if (VpIsInf(b)) {
- switch(sw) {
- case OP_SW_ADD: /* + */
- if (VpGetSign(a) == VpGetSign(b)) {
- VpSetInf(c, VpGetSign(a));
- goto Inf;
- }
- else {
- VpSetNaN(c);
- goto NaN;
- }
- case OP_SW_SUB: /* - */
- if (VpGetSign(a) != VpGetSign(b)) {
- VpSetInf(c, VpGetSign(a));
- goto Inf;
- }
- else {
- VpSetNaN(c);
- goto NaN;
- }
- case OP_SW_MULT: /* * */
- VpSetInf(c, VpGetSign(a)*VpGetSign(b));
- goto Inf;
- case OP_SW_DIV: /* / */
- VpSetNaN(c);
- goto NaN;
- }
- VpSetNaN(c);
- goto NaN;
- }
- /* Inf op Finite */
- switch(sw) {
- case OP_SW_ADD: /* + */
- case OP_SW_SUB: /* - */
- VpSetInf(c, VpGetSign(a));
- break;
- case OP_SW_MULT: /* * */
- if (VpIsZero(b)) {
- VpSetNaN(c);
- goto NaN;
- }
- VpSetInf(c, VpGetSign(a)*VpGetSign(b));
- break;
- case OP_SW_DIV: /* / */
- VpSetInf(c, VpGetSign(a)*VpGetSign(b));
- }
- goto Inf;
- }
-
- if (VpIsInf(b)) {
- switch(sw) {
- case OP_SW_ADD: /* + */
- VpSetInf(c, VpGetSign(b));
- break;
- case OP_SW_SUB: /* - */
- VpSetInf(c, -VpGetSign(b));
- break;
- case OP_SW_MULT: /* * */
- if (VpIsZero(a)) {
- VpSetNaN(c);
- goto NaN;
- }
- VpSetInf(c, VpGetSign(a)*VpGetSign(b));
- break;
- case OP_SW_DIV: /* / */
- VpSetZero(c, VpGetSign(a)*VpGetSign(b));
- }
- goto Inf;
- }
- return 1; /* Results OK */
-
-Inf:
- if (VpIsPosInf(c)) {
- return VpException(VP_EXCEPTION_INFINITY, "Computation results to 'Infinity'", 0);
- }
- else {
- return VpException(VP_EXCEPTION_INFINITY, "Computation results to '-Infinity'", 0);
- }
-
-NaN:
- return VpException(VP_EXCEPTION_NaN, "Computation results to 'NaN'", 0);
-}
-
-/*
- ----------------------------------------------------------------
-*/
-
-/*
- * returns number of chars needed to represent vp in specified format.
- */
-VP_EXPORT size_t
-VpNumOfChars(Real *vp,const char *pszFmt)
-{
- SIGNED_VALUE ex;
- size_t nc;
-
- if (vp == NULL) return BASE_FIG*2+6;
- if (!VpIsDef(vp)) return 32; /* not sure,may be OK */
-
- switch(*pszFmt) {
- case 'F':
- nc = BASE_FIG*(vp->Prec + 1)+2;
- ex = vp->exponent;
- if (ex < 0) {
- nc += BASE_FIG*(size_t)(-ex);
- }
- else {
- if ((size_t)ex > vp->Prec) {
- nc += BASE_FIG*((size_t)ex - vp->Prec);
- }
- }
- break;
- case 'E':
- /* fall through */
- default:
- nc = BASE_FIG*(vp->Prec + 2)+6; /* 3: sign + exponent chars */
- }
- return nc;
-}
-
-/*
- * Initializer for Vp routines and constants used.
- * [Input]
- * BaseVal: Base value(assigned to BASE) for Vp calculation.
- * It must be the form BaseVal=10**n.(n=1,2,3,...)
- * If Base <= 0L,then the BASE will be calculated so
- * that BASE is as large as possible satisfying the
- * relation MaxVal <= BASE*(BASE+1). Where the value
- * MaxVal is the largest value which can be represented
- * by one DECDIG word in the computer used.
- *
- * [Returns]
- * BIGDECIMAL_DOUBLE_FIGURES ... OK
- */
-VP_EXPORT size_t
-VpInit(DECDIG BaseVal)
-{
- /* Setup +/- Inf NaN -0 */
- VpGetDoubleNegZero();
-
- /* Const 1.0 */
- VpConstOne = NewOneNolimit(1, 1);
-
- /* Const 0.5 */
- VpConstPt5 = NewOneNolimit(1, 1);
- VpConstPt5->exponent = 0;
- VpConstPt5->frac[0] = 5*BASE1;
-
-#ifdef BIGDECIMAL_DEBUG
- gnAlloc = 0;
-#endif /* BIGDECIMAL_DEBUG */
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- printf("VpInit: BaseVal = %"PRIuDECDIG"\n", BaseVal);
- printf("\tBASE = %"PRIuDECDIG"\n", BASE);
- printf("\tHALF_BASE = %"PRIuDECDIG"\n", HALF_BASE);
- printf("\tBASE1 = %"PRIuDECDIG"\n", BASE1);
- printf("\tBASE_FIG = %u\n", BASE_FIG);
- printf("\tBIGDECIMAL_DOUBLE_FIGURES = %d\n", BIGDECIMAL_DOUBLE_FIGURES);
- }
-#endif /* BIGDECIMAL_DEBUG */
-
- return BIGDECIMAL_DOUBLE_FIGURES;
-}
-
-VP_EXPORT Real *
-VpOne(void)
-{
- return VpConstOne;
-}
-
-/* If exponent overflows,then raise exception or returns 0 */
-static int
-AddExponent(Real *a, SIGNED_VALUE n)
-{
- SIGNED_VALUE e = a->exponent;
- SIGNED_VALUE m = e+n;
- SIGNED_VALUE eb, mb;
- if (e > 0) {
- if (n > 0) {
- if (MUL_OVERFLOW_SIGNED_VALUE_P(m, (SIGNED_VALUE)BASE_FIG) ||
- MUL_OVERFLOW_SIGNED_VALUE_P(e, (SIGNED_VALUE)BASE_FIG))
- goto overflow;
- mb = m*(SIGNED_VALUE)BASE_FIG;
- eb = e*(SIGNED_VALUE)BASE_FIG;
- if (eb - mb > 0) goto overflow;
- }
- }
- else if (n < 0) {
- if (MUL_OVERFLOW_SIGNED_VALUE_P(m, (SIGNED_VALUE)BASE_FIG) ||
- MUL_OVERFLOW_SIGNED_VALUE_P(e, (SIGNED_VALUE)BASE_FIG))
- goto underflow;
- mb = m*(SIGNED_VALUE)BASE_FIG;
- eb = e*(SIGNED_VALUE)BASE_FIG;
- if (mb - eb > 0) goto underflow;
- }
- a->exponent = m;
- return 1;
-
-/* Overflow/Underflow ==> Raise exception or returns 0 */
-underflow:
- VpSetZero(a, VpGetSign(a));
- return VpException(VP_EXCEPTION_UNDERFLOW, "Exponent underflow", 0);
-
-overflow:
- VpSetInf(a, VpGetSign(a));
- return VpException(VP_EXCEPTION_OVERFLOW, "Exponent overflow", 0);
-}
-
-Real *
-bigdecimal_parse_special_string(const char *str)
-{
- static const struct {
- const char *str;
- size_t len;
- int sign;
- } table[] = {
- { SZ_INF, sizeof(SZ_INF) - 1, VP_SIGN_POSITIVE_INFINITE },
- { SZ_PINF, sizeof(SZ_PINF) - 1, VP_SIGN_POSITIVE_INFINITE },
- { SZ_NINF, sizeof(SZ_NINF) - 1, VP_SIGN_NEGATIVE_INFINITE },
- { SZ_NaN, sizeof(SZ_NaN) - 1, VP_SIGN_NaN }
- };
- static const size_t table_length = sizeof(table) / sizeof(table[0]);
- size_t i;
-
- for (i = 0; i < table_length; ++i) {
- const char *p;
- if (strncmp(str, table[i].str, table[i].len) != 0) {
- continue;
- }
-
- p = str + table[i].len;
- while (*p && ISSPACE(*p)) ++p;
- if (*p == '\0') {
- Real *vp = rbd_allocate_struct(1);
- vp->MaxPrec = 1;
- switch (table[i].sign) {
- default:
- UNREACHABLE; break;
- case VP_SIGN_POSITIVE_INFINITE:
- VpSetPosInf(vp);
- return vp;
- case VP_SIGN_NEGATIVE_INFINITE:
- VpSetNegInf(vp);
- return vp;
- case VP_SIGN_NaN:
- VpSetNaN(vp);
- return vp;
- }
- }
- }
-
- return NULL;
-}
-
-/*
- * Allocates variable.
- * [Input]
- * mx ... The number of decimal digits to be allocated, if zero then mx is determined by szVal.
- * The mx will be the number of significant digits can to be stored.
- * szVal ... The value assigned(char). If szVal==NULL, then zero is assumed.
- * If szVal[0]=='#' then MaxPrec is not affected by the precision limit
- * so that the full precision specified by szVal is allocated.
- *
- * [Returns]
- * Pointer to the newly allocated variable, or
- * NULL be returned if memory allocation is failed,or any error.
- */
-VP_EXPORT Real *
-VpAlloc(size_t mx, const char *szVal, int strict_p, int exc)
-{
- const char *orig_szVal = szVal;
- size_t i, j, ni, ipf, nf, ipe, ne, dot_seen, exp_seen, nalloc;
- size_t len;
- char v, *psz;
- int sign=1;
- Real *vp = NULL;
- VALUE buf;
-
- if (szVal == NULL) {
- return_zero:
- /* necessary to be able to store */
- /* at least mx digits. */
- /* szVal==NULL ==> allocate zero value. */
- vp = rbd_allocate_struct(mx);
- vp->MaxPrec = rbd_calculate_internal_digits(mx, false); /* Must false */
- VpSetZero(vp, 1); /* initialize vp to zero. */
- return vp;
- }
-
- /* Skipping leading spaces */
- while (ISSPACE(*szVal)) szVal++;
-
- /* Check on Inf & NaN */
- if ((vp = bigdecimal_parse_special_string(szVal)) != NULL) {
- return vp;
- }
-
- /* Processing the leading one `#` */
- if (*szVal != '#') {
- len = rbd_calculate_internal_digits(mx, true);
- }
- else {
- len = rbd_calculate_internal_digits(mx, false);
- ++szVal;
- }
-
- /* Scanning digits */
-
- /* A buffer for keeping scanned digits */
- buf = rb_str_tmp_new(strlen(szVal) + 1);
- psz = RSTRING_PTR(buf);
-
- /* cursor: i for psz, and j for szVal */
- i = j = 0;
-
- /* Scanning: sign part */
- v = psz[i] = szVal[j];
- if ((v == '-') || (v == '+')) {
- sign = -(v == '-');
- ++i;
- ++j;
- }
-
- /* Scanning: integer part */
- ni = 0; /* number of digits in the integer part */
- while ((v = psz[i] = szVal[j]) != '\0') {
- if (!strict_p && ISSPACE(v)) {
- v = psz[i] = '\0';
- break;
- }
- if (v == '_') {
- if (ni > 0) {
- v = szVal[j+1];
- if (v == '\0' || ISSPACE(v) || ISDIGIT(v)) {
- ++j;
- continue;
- }
- if (!strict_p) {
- v = psz[i] = '\0';
- break;
- }
- }
- goto invalid_value;
- }
- if (!ISDIGIT(v)) {
- break;
- }
- ++ni;
- ++i;
- ++j;
- }
-
- /* Scanning: fractional part */
- nf = 0; /* number of digits in the fractional part */
- ne = 0; /* number of digits in the exponential part */
- ipf = 0; /* index of the beginning of the fractional part */
- ipe = 0; /* index of the beginning of the exponential part */
- dot_seen = 0;
- exp_seen = 0;
-
- if (v != '\0') {
- /* Scanning fractional part */
- if ((psz[i] = szVal[j]) == '.') {
- dot_seen = 1;
- ++i;
- ++j;
- ipf = i;
- while ((v = psz[i] = szVal[j]) != '\0') {
- if (!strict_p && ISSPACE(v)) {
- v = psz[i] = '\0';
- break;
- }
- if (v == '_') {
- if (nf > 0 && ISDIGIT(szVal[j+1])) {
- ++j;
- continue;
- }
- if (!strict_p) {
- v = psz[i] = '\0';
- if (nf == 0) {
- dot_seen = 0;
- }
- break;
- }
- goto invalid_value;
- }
- if (!ISDIGIT(v)) break;
- ++i;
- ++j;
- ++nf;
- }
- }
-
- /* Scanning exponential part */
- if (v != '\0') {
- switch ((psz[i] = szVal[j])) {
- case '\0':
- break;
- case 'e': case 'E':
- case 'd': case 'D':
- exp_seen = 1;
- ++i;
- ++j;
- ipe = i;
- v = psz[i] = szVal[j];
- if ((v == '-') || (v == '+')) {
- ++i;
- ++j;
- }
- while ((v = psz[i] = szVal[j]) != '\0') {
- if (!strict_p && ISSPACE(v)) {
- v = psz[i] = '\0';
- break;
- }
- if (v == '_') {
- if (ne > 0 && ISDIGIT(szVal[j+1])) {
- ++j;
- continue;
- }
- if (!strict_p) {
- v = psz[i] = '\0';
- if (ne == 0) {
- exp_seen = 0;
- }
- break;
- }
- goto invalid_value;
- }
- if (!ISDIGIT(v)) break;
- ++i;
- ++j;
- ++ne;
- }
- break;
- default:
- break;
- }
- }
-
- if (v != '\0') {
- /* Scanning trailing spaces */
- while (ISSPACE(szVal[j])) ++j;
-
- /* Invalid character */
- if (szVal[j] && strict_p) {
- goto invalid_value;
- }
- }
- }
-
- psz[i] = '\0';
-
- if (strict_p && (((ni == 0 || dot_seen) && nf == 0) || (exp_seen && ne == 0))) {
- VALUE str;
- invalid_value:
- if (!strict_p) {
- goto return_zero;
- }
- if (!exc) {
- return NULL;
- }
- str = rb_str_new2(orig_szVal);
- rb_raise(rb_eArgError, "invalid value for BigDecimal(): \"%"PRIsVALUE"\"", str);
- }
-
- nalloc = (ni + nf + BASE_FIG - 1) / BASE_FIG + 1; /* set effective allocation */
- /* units for szVal[] */
- if (len == 0) len = 1;
- nalloc = Max(nalloc, len);
- len = nalloc;
- vp = rbd_allocate_struct(len);
- vp->MaxPrec = len; /* set max precision */
- VpSetZero(vp, sign);
- VpCtoV(vp, psz, ni, psz + ipf, nf, psz + ipe, ne);
- rb_str_resize(buf, 0);
- return vp;
-}
-
-/*
- * Assignment(c=a).
- * [Input]
- * a ... RHSV
- * isw ... switch for assignment.
- * c = a when isw > 0
- * c = -a when isw < 0
- * if c->MaxPrec < a->Prec,then round operation
- * will be performed.
- * [Output]
- * c ... LHSV
- */
-VP_EXPORT size_t
-VpAsgn(Real *c, Real *a, int isw)
-{
- size_t n;
- if (VpIsNaN(a)) {
- VpSetNaN(c);
- return 0;
- }
- if (VpIsInf(a)) {
- VpSetInf(c, isw * VpGetSign(a));
- return 0;
- }
-
- /* check if the RHS is zero */
- if (!VpIsZero(a)) {
- c->exponent = a->exponent; /* store exponent */
- VpSetSign(c, isw * VpGetSign(a)); /* set sign */
- n = (a->Prec < c->MaxPrec) ? (a->Prec) : (c->MaxPrec);
- c->Prec = n;
- memcpy(c->frac, a->frac, n * sizeof(DECDIG));
- /* Needs round ? */
- if (isw != 10) {
- /* Not in ActiveRound */
- if(c->Prec < a->Prec) {
- VpInternalRound(c, n, (n>0) ? a->frac[n-1] : 0, a->frac[n]);
- }
- else {
- VpLimitRound(c,0);
- }
- }
- }
- else {
- /* The value of 'a' is zero. */
- VpSetZero(c, isw * VpGetSign(a));
- return 1;
- }
- return c->Prec * BASE_FIG;
-}
-
-/*
- * c = a + b when operation = 1 or 2
- * c = a - b when operation = -1 or -2.
- * Returns number of significant digits of c
- */
-VP_EXPORT size_t
-VpAddSub(Real *c, Real *a, Real *b, int operation)
-{
- short sw, isw;
- Real *a_ptr, *b_ptr;
- size_t n, na, nb, i;
- DECDIG mrv;
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpAddSub(enter) a=% \n", a);
- VPrint(stdout, " b=% \n", b);
- printf(" operation=%d\n", operation);
- }
-#endif /* BIGDECIMAL_DEBUG */
-
- if (!VpIsDefOP(c, a, b, (operation > 0) ? OP_SW_ADD : OP_SW_SUB)) return 0; /* No significant digits */
-
- /* check if a or b is zero */
- if (VpIsZero(a)) {
- /* a is zero,then assign b to c */
- if (!VpIsZero(b)) {
- VpAsgn(c, b, operation);
- }
- else {
- /* Both a and b are zero. */
- if (VpGetSign(a) < 0 && operation * VpGetSign(b) < 0) {
- /* -0 -0 */
- VpSetZero(c, -1);
- }
- else {
- VpSetZero(c, 1);
- }
- return 1; /* 0: 1 significant digits */
- }
- return c->Prec * BASE_FIG;
- }
- if (VpIsZero(b)) {
- /* b is zero,then assign a to c. */
- VpAsgn(c, a, 1);
- return c->Prec*BASE_FIG;
- }
-
- if (operation < 0) sw = -1;
- else sw = 1;
-
- /* compare absolute value. As a result,|a_ptr|>=|b_ptr| */
- if (a->exponent > b->exponent) {
- a_ptr = a;
- b_ptr = b;
- } /* |a|>|b| */
- else if (a->exponent < b->exponent) {
- a_ptr = b;
- b_ptr = a;
- } /* |a|<|b| */
- else {
- /* Exponent part of a and b is the same,then compare fraction */
- /* part */
- na = a->Prec;
- nb = b->Prec;
- n = Min(na, nb);
- for (i=0; i < n; ++i) {
- if (a->frac[i] > b->frac[i]) {
- a_ptr = a;
- b_ptr = b;
- goto end_if;
- }
- else if (a->frac[i] < b->frac[i]) {
- a_ptr = b;
- b_ptr = a;
- goto end_if;
- }
- }
- if (na > nb) {
- a_ptr = a;
- b_ptr = b;
- goto end_if;
- }
- else if (na < nb) {
- a_ptr = b;
- b_ptr = a;
- goto end_if;
- }
- /* |a| == |b| */
- if (VpGetSign(a) + sw *VpGetSign(b) == 0) {
- VpSetZero(c, 1); /* abs(a)=abs(b) and operation = '-' */
- return c->Prec * BASE_FIG;
- }
- a_ptr = a;
- b_ptr = b;
- }
-
-end_if:
- isw = VpGetSign(a) + sw *VpGetSign(b);
- /*
- * isw = 0 ...( 1)+(-1),( 1)-( 1),(-1)+(1),(-1)-(-1)
- * = 2 ...( 1)+( 1),( 1)-(-1)
- * =-2 ...(-1)+(-1),(-1)-( 1)
- * If isw==0, then c =(Sign a_ptr)(|a_ptr|-|b_ptr|)
- * else c =(Sign ofisw)(|a_ptr|+|b_ptr|)
- */
- if (isw) { /* addition */
- VpSetSign(c, 1);
- mrv = VpAddAbs(a_ptr, b_ptr, c);
- VpSetSign(c, isw / 2);
- }
- else { /* subtraction */
- VpSetSign(c, 1);
- mrv = VpSubAbs(a_ptr, b_ptr, c);
- if (a_ptr == a) {
- VpSetSign(c,VpGetSign(a));
- }
- else {
- VpSetSign(c, VpGetSign(a_ptr) * sw);
- }
- }
- VpInternalRound(c, 0, (c->Prec > 0) ? c->frac[c->Prec-1] : 0, mrv);
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpAddSub(result) c=% \n", c);
- VPrint(stdout, " a=% \n", a);
- VPrint(stdout, " b=% \n", b);
- printf(" operation=%d\n", operation);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return c->Prec * BASE_FIG;
-}
-
-/*
- * Addition of two values with variable precision
- * a and b assuming abs(a)>abs(b).
- * c = abs(a) + abs(b) ; where |a|>=|b|
- */
-static DECDIG
-VpAddAbs(Real *a, Real *b, Real *c)
-{
- size_t word_shift;
- size_t ap;
- size_t bp;
- size_t cp;
- size_t a_pos;
- size_t b_pos, b_pos_with_word_shift;
- size_t c_pos;
- DECDIG av, bv, carry, mrv;
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpAddAbs called: a = %\n", a);
- VPrint(stdout, " b = %\n", b);
- }
-#endif /* BIGDECIMAL_DEBUG */
-
- word_shift = VpSetPTR(a, b, c, &ap, &bp, &cp, &av, &bv);
- a_pos = ap;
- b_pos = bp;
- c_pos = cp;
-
- if (word_shift == (size_t)-1L) return 0; /* Overflow */
- if (b_pos == (size_t)-1L) goto Assign_a;
-
- mrv = av + bv; /* Most right val. Used for round. */
-
- /* Just assign the last few digits of b to c because a has no */
- /* corresponding digits to be added. */
- if (b_pos > 0) {
- while (b_pos > 0 && b_pos + word_shift > a_pos) {
- c->frac[--c_pos] = b->frac[--b_pos];
- }
- }
- if (b_pos == 0 && word_shift > a_pos) {
- while (word_shift-- > a_pos) {
- c->frac[--c_pos] = 0;
- }
- }
-
- /* Just assign the last few digits of a to c because b has no */
- /* corresponding digits to be added. */
- b_pos_with_word_shift = b_pos + word_shift;
- while (a_pos > b_pos_with_word_shift) {
- c->frac[--c_pos] = a->frac[--a_pos];
- }
- carry = 0; /* set first carry be zero */
-
- /* Now perform addition until every digits of b will be */
- /* exhausted. */
- while (b_pos > 0) {
- c->frac[--c_pos] = a->frac[--a_pos] + b->frac[--b_pos] + carry;
- if (c->frac[c_pos] >= BASE) {
- c->frac[c_pos] -= BASE;
- carry = 1;
- }
- else {
- carry = 0;
- }
- }
-
- /* Just assign the first few digits of a with considering */
- /* the carry obtained so far because b has been exhausted. */
- while (a_pos > 0) {
- c->frac[--c_pos] = a->frac[--a_pos] + carry;
- if (c->frac[c_pos] >= BASE) {
- c->frac[c_pos] -= BASE;
- carry = 1;
- }
- else {
- carry = 0;
- }
- }
- if (c_pos) c->frac[c_pos - 1] += carry;
- goto Exit;
-
-Assign_a:
- VpAsgn(c, a, 1);
- mrv = 0;
-
-Exit:
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpAddAbs exit: c=% \n", c);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return mrv;
-}
-
-/*
- * c = abs(a) - abs(b)
- */
-static DECDIG
-VpSubAbs(Real *a, Real *b, Real *c)
-{
- size_t word_shift;
- size_t ap;
- size_t bp;
- size_t cp;
- size_t a_pos;
- size_t b_pos, b_pos_with_word_shift;
- size_t c_pos;
- DECDIG av, bv, borrow, mrv;
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpSubAbs called: a = %\n", a);
- VPrint(stdout, " b = %\n", b);
- }
-#endif /* BIGDECIMAL_DEBUG */
-
- word_shift = VpSetPTR(a, b, c, &ap, &bp, &cp, &av, &bv);
- a_pos = ap;
- b_pos = bp;
- c_pos = cp;
- if (word_shift == (size_t)-1L) return 0; /* Overflow */
- if (b_pos == (size_t)-1L) goto Assign_a;
-
- if (av >= bv) {
- mrv = av - bv;
- borrow = 0;
- }
- else {
- mrv = 0;
- borrow = 1;
- }
-
- /* Just assign the values which are the BASE subtracted by */
- /* each of the last few digits of the b because the a has no */
- /* corresponding digits to be subtracted. */
- if (b_pos + word_shift > a_pos) {
- while (b_pos > 0 && b_pos + word_shift > a_pos) {
- c->frac[--c_pos] = BASE - b->frac[--b_pos] - borrow;
- borrow = 1;
- }
- if (b_pos == 0) {
- while (word_shift > a_pos) {
- --word_shift;
- c->frac[--c_pos] = BASE - borrow;
- borrow = 1;
- }
- }
- }
- /* Just assign the last few digits of a to c because b has no */
- /* corresponding digits to subtract. */
-
- b_pos_with_word_shift = b_pos + word_shift;
- while (a_pos > b_pos_with_word_shift) {
- c->frac[--c_pos] = a->frac[--a_pos];
- }
-
- /* Now perform subtraction until every digits of b will be */
- /* exhausted. */
- while (b_pos > 0) {
- --c_pos;
- if (a->frac[--a_pos] < b->frac[--b_pos] + borrow) {
- c->frac[c_pos] = BASE + a->frac[a_pos] - b->frac[b_pos] - borrow;
- borrow = 1;
- }
- else {
- c->frac[c_pos] = a->frac[a_pos] - b->frac[b_pos] - borrow;
- borrow = 0;
- }
- }
-
- /* Just assign the first few digits of a with considering */
- /* the borrow obtained so far because b has been exhausted. */
- while (a_pos > 0) {
- --c_pos;
- if (a->frac[--a_pos] < borrow) {
- c->frac[c_pos] = BASE + a->frac[a_pos] - borrow;
- borrow = 1;
- }
- else {
- c->frac[c_pos] = a->frac[a_pos] - borrow;
- borrow = 0;
- }
- }
- if (c_pos) c->frac[c_pos - 1] -= borrow;
- goto Exit;
-
-Assign_a:
- VpAsgn(c, a, 1);
- mrv = 0;
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpSubAbs exit: c=% \n", c);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return mrv;
-}
-
-/*
- * Note: If(av+bv)>= HALF_BASE,then 1 will be added to the least significant
- * digit of c(In case of addition).
- * ------------------------- figure of output -----------------------------------
- * a = xxxxxxxxxxx
- * b = xxxxxxxxxx
- * c =xxxxxxxxxxxxxxx
- * word_shift = | |
- * right_word = | | (Total digits in RHSV)
- * left_word = | | (Total digits in LHSV)
- * a_pos = |
- * b_pos = |
- * c_pos = |
- */
-static size_t
-VpSetPTR(Real *a, Real *b, Real *c, size_t *a_pos, size_t *b_pos, size_t *c_pos, DECDIG *av, DECDIG *bv)
-{
- size_t left_word, right_word, word_shift;
-
- size_t const round_limit = (VpGetPrecLimit() + BASE_FIG - 1) / BASE_FIG;
-
- assert(a->exponent >= b->exponent);
-
- c->frac[0] = 0;
- *av = *bv = 0;
-
- word_shift = (a->exponent - b->exponent);
- left_word = b->Prec + word_shift;
- right_word = Max(a->Prec, left_word);
- left_word = c->MaxPrec - 1; /* -1 ... prepare for round up */
-
- /*
- * check if 'round' is needed.
- */
- if (right_word > left_word) { /* round ? */
- /*---------------------------------
- * Actual size of a = xxxxxxAxx
- * Actual size of b = xxxBxxxxx
- * Max. size of c = xxxxxx
- * Round off = |-----|
- * c_pos = |
- * right_word = |
- * a_pos = |
- */
- *c_pos = right_word = left_word + 1; /* Set resulting precision */
- /* be equal to that of c */
- if (a->Prec >= c->MaxPrec) {
- /*
- * a = xxxxxxAxxx
- * c = xxxxxx
- * a_pos = |
- */
- *a_pos = left_word;
- if (*a_pos <= round_limit) {
- *av = a->frac[*a_pos]; /* av is 'A' shown in above. */
- }
- }
- else {
- /*
- * a = xxxxxxx
- * c = xxxxxxxxxx
- * a_pos = |
- */
- *a_pos = a->Prec;
- }
- if (b->Prec + word_shift >= c->MaxPrec) {
- /*
- * a = xxxxxxxxx
- * b = xxxxxxxBxxx
- * c = xxxxxxxxxxx
- * b_pos = |
- */
- if (c->MaxPrec >= word_shift + 1) {
- *b_pos = c->MaxPrec - word_shift - 1;
- if (*b_pos + word_shift <= round_limit) {
- *bv = b->frac[*b_pos];
- }
- }
- else {
- *b_pos = -1L;
- }
- }
- else {
- /*
- * a = xxxxxxxxxxxxxxxx
- * b = xxxxxx
- * c = xxxxxxxxxxxxx
- * b_pos = |
- */
- *b_pos = b->Prec;
- }
- }
- else { /* The MaxPrec of c - 1 > The Prec of a + b */
- /*
- * a = xxxxxxx
- * b = xxxxxx
- * c = xxxxxxxxxxx
- * c_pos = |
- */
- *b_pos = b->Prec;
- *a_pos = a->Prec;
- *c_pos = right_word + 1;
- }
- c->Prec = *c_pos;
- c->exponent = a->exponent;
- if (!AddExponent(c, 1)) return (size_t)-1L;
- return word_shift;
-}
-
-/*
- * Return number of significant digits
- * c = a * b , Where a = a0a1a2 ... an
- * b = b0b1b2 ... bm
- * c = c0c1c2 ... cl
- * a0 a1 ... an * bm
- * a0 a1 ... an * bm-1
- * . . .
- * . . .
- * a0 a1 .... an * b0
- * +_____________________________
- * c0 c1 c2 ...... cl
- * nc <---|
- * MaxAB |--------------------|
- */
-VP_EXPORT size_t
-VpMult(Real *c, Real *a, Real *b)
-{
- size_t MxIndA, MxIndB, MxIndAB, MxIndC;
- size_t ind_c, i, ii, nc;
- size_t ind_as, ind_ae, ind_bs;
- DECDIG carry;
- DECDIG_DBL s;
- Real *w;
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpMult(Enter): a=% \n", a);
- VPrint(stdout, " b=% \n", b);
- }
-#endif /* BIGDECIMAL_DEBUG */
-
- if (!VpIsDefOP(c, a, b, OP_SW_MULT)) return 0; /* No significant digit */
-
- if (VpIsZero(a) || VpIsZero(b)) {
- /* at least a or b is zero */
- VpSetZero(c, VpGetSign(a) * VpGetSign(b));
- return 1; /* 0: 1 significant digit */
- }
-
- if (VpIsOne(a)) {
- VpAsgn(c, b, VpGetSign(a));
- goto Exit;
- }
- if (VpIsOne(b)) {
- VpAsgn(c, a, VpGetSign(b));
- goto Exit;
- }
- if (b->Prec > a->Prec) {
- /* Adjust so that digits(a)>digits(b) */
- w = a;
- a = b;
- b = w;
- }
- w = NULL;
- MxIndA = a->Prec - 1;
- MxIndB = b->Prec - 1;
- MxIndC = c->MaxPrec - 1;
- MxIndAB = a->Prec + b->Prec - 1;
-
- if (MxIndC < MxIndAB) { /* The Max. prec. of c < Prec(a)+Prec(b) */
- w = c;
- c = NewZeroNolimit(1, (size_t)((MxIndAB + 1) * BASE_FIG));
- MxIndC = MxIndAB;
- }
-
- /* set LHSV c info */
-
- c->exponent = a->exponent; /* set exponent */
- if (!AddExponent(c, b->exponent)) {
- if (w) rbd_free_struct(c);
- return 0;
- }
- VpSetSign(c, VpGetSign(a) * VpGetSign(b)); /* set sign */
- carry = 0;
- nc = ind_c = MxIndAB;
- memset(c->frac, 0, (nc + 1) * sizeof(DECDIG)); /* Initialize c */
- c->Prec = nc + 1; /* set precision */
- for (nc = 0; nc < MxIndAB; ++nc, --ind_c) {
- if (nc < MxIndB) { /* The left triangle of the Fig. */
- ind_as = MxIndA - nc;
- ind_ae = MxIndA;
- ind_bs = MxIndB;
- }
- else if (nc <= MxIndA) { /* The middle rectangular of the Fig. */
- ind_as = MxIndA - nc;
- ind_ae = MxIndA - (nc - MxIndB);
- ind_bs = MxIndB;
- }
- else /* if (nc > MxIndA) */ { /* The right triangle of the Fig. */
- ind_as = 0;
- ind_ae = MxIndAB - nc - 1;
- ind_bs = MxIndB - (nc - MxIndA);
- }
-
- for (i = ind_as; i <= ind_ae; ++i) {
- s = (DECDIG_DBL)a->frac[i] * b->frac[ind_bs--];
- carry = (DECDIG)(s / BASE);
- s -= (DECDIG_DBL)carry * BASE;
- c->frac[ind_c] += (DECDIG)s;
- if (c->frac[ind_c] >= BASE) {
- s = c->frac[ind_c] / BASE;
- carry += (DECDIG)s;
- c->frac[ind_c] -= (DECDIG)(s * BASE);
- }
- if (carry) {
- ii = ind_c;
- while (ii-- > 0) {
- c->frac[ii] += carry;
- if (c->frac[ii] >= BASE) {
- carry = c->frac[ii] / BASE;
- c->frac[ii] -= (carry * BASE);
- }
- else {
- break;
- }
- }
- }
- }
- }
- if (w != NULL) { /* free work variable */
- VpNmlz(c);
- VpAsgn(w, c, 1);
- rbd_free_struct(c);
- c = w;
- }
- else {
- VpLimitRound(c,0);
- }
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpMult(c=a*b): c=% \n", c);
- VPrint(stdout, " a=% \n", a);
- VPrint(stdout, " b=% \n", b);
- }
-#endif /*BIGDECIMAL_DEBUG */
- return c->Prec*BASE_FIG;
-}
-
-/*
- * c = a / b, remainder = r
- */
-VP_EXPORT size_t
-VpDivd(Real *c, Real *r, Real *a, Real *b)
-{
- size_t word_a, word_b, word_c, word_r;
- size_t i, n, ind_a, ind_b, ind_c, ind_r;
- size_t nLoop;
- DECDIG_DBL q, b1, b1p1, b1b2, b1b2p1, r1r2;
- DECDIG borrow, borrow1, borrow2;
- DECDIG_DBL qb;
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, " VpDivd(c=a/b) a=% \n", a);
- VPrint(stdout, " b=% \n", b);
- }
-#endif /*BIGDECIMAL_DEBUG */
-
- VpSetNaN(r);
- if (!VpIsDefOP(c, a, b, OP_SW_DIV)) goto Exit;
- if (VpIsZero(a) && VpIsZero(b)) {
- VpSetNaN(c);
- return VpException(VP_EXCEPTION_NaN, "Computation results to 'NaN'", 0);
- }
- if (VpIsZero(b)) {
- VpSetInf(c, VpGetSign(a) * VpGetSign(b));
- return VpException(VP_EXCEPTION_ZERODIVIDE, "Divide by zero", 0);
- }
- if (VpIsZero(a)) {
- /* numerator a is zero */
- VpSetZero(c, VpGetSign(a) * VpGetSign(b));
- VpSetZero(r, VpGetSign(a) * VpGetSign(b));
- goto Exit;
- }
- if (VpIsOne(b)) {
- /* divide by one */
- VpAsgn(c, a, VpGetSign(b));
- VpSetZero(r, VpGetSign(a));
- goto Exit;
- }
-
- word_a = a->Prec;
- word_b = b->Prec;
- word_c = c->MaxPrec;
- word_r = r->MaxPrec;
-
- if (word_a >= word_r) goto space_error;
-
- ind_r = 1;
- r->frac[0] = 0;
- while (ind_r <= word_a) {
- r->frac[ind_r] = a->frac[ind_r - 1];
- ++ind_r;
- }
- while (ind_r < word_r) r->frac[ind_r++] = 0;
-
- ind_c = 0;
- while (ind_c < word_c) c->frac[ind_c++] = 0;
-
- /* initial procedure */
- b1 = b1p1 = b->frac[0];
- if (b->Prec <= 1) {
- b1b2p1 = b1b2 = b1p1 * BASE;
- }
- else {
- b1p1 = b1 + 1;
- b1b2p1 = b1b2 = b1 * BASE + b->frac[1];
- if (b->Prec > 2) ++b1b2p1;
- }
-
- /* */
- /* loop start */
- ind_c = word_r - 1;
- nLoop = Min(word_c,ind_c);
- ind_c = 1;
- while (ind_c < nLoop) {
- if (r->frac[ind_c] == 0) {
- ++ind_c;
- continue;
- }
- r1r2 = (DECDIG_DBL)r->frac[ind_c] * BASE + r->frac[ind_c + 1];
- if (r1r2 == b1b2) {
- /* The first two word digits is the same */
- ind_b = 2;
- ind_a = ind_c + 2;
- while (ind_b < word_b) {
- if (r->frac[ind_a] < b->frac[ind_b]) goto div_b1p1;
- if (r->frac[ind_a] > b->frac[ind_b]) break;
- ++ind_a;
- ++ind_b;
- }
- /* The first few word digits of r and b is the same and */
- /* the first different word digit of w is greater than that */
- /* of b, so quotient is 1 and just subtract b from r. */
- borrow = 0; /* quotient=1, then just r-b */
- ind_b = b->Prec - 1;
- ind_r = ind_c + ind_b;
- if (ind_r >= word_r) goto space_error;
- n = ind_b;
- for (i = 0; i <= n; ++i) {
- if (r->frac[ind_r] < b->frac[ind_b] + borrow) {
- r->frac[ind_r] += (BASE - (b->frac[ind_b] + borrow));
- borrow = 1;
- }
- else {
- r->frac[ind_r] = r->frac[ind_r] - b->frac[ind_b] - borrow;
- borrow = 0;
- }
- --ind_r;
- --ind_b;
- }
- ++c->frac[ind_c];
- goto carry;
- }
- /* The first two word digits is not the same, */
- /* then compare magnitude, and divide actually. */
- if (r1r2 >= b1b2p1) {
- q = r1r2 / b1b2p1; /* q == (DECDIG)q */
- c->frac[ind_c] += (DECDIG)q;
- ind_r = b->Prec + ind_c - 1;
- goto sub_mult;
- }
-
-div_b1p1:
- if (ind_c + 1 >= word_c) goto out_side;
- q = r1r2 / b1p1; /* q == (DECDIG)q */
- c->frac[ind_c + 1] += (DECDIG)q;
- ind_r = b->Prec + ind_c;
-
-sub_mult:
- borrow1 = borrow2 = 0;
- ind_b = word_b - 1;
- if (ind_r >= word_r) goto space_error;
- n = ind_b;
- for (i = 0; i <= n; ++i) {
- /* now, perform r = r - q * b */
- qb = q * b->frac[ind_b];
- if (qb < BASE) borrow1 = 0;
- else {
- borrow1 = (DECDIG)(qb / BASE);
- qb -= (DECDIG_DBL)borrow1 * BASE; /* get qb < BASE */
- }
- if(r->frac[ind_r] < qb) {
- r->frac[ind_r] += (DECDIG)(BASE - qb);
- borrow2 = borrow2 + borrow1 + 1;
- }
- else {
- r->frac[ind_r] -= (DECDIG)qb;
- borrow2 += borrow1;
- }
- if (borrow2) {
- if(r->frac[ind_r - 1] < borrow2) {
- r->frac[ind_r - 1] += (BASE - borrow2);
- borrow2 = 1;
- }
- else {
- r->frac[ind_r - 1] -= borrow2;
- borrow2 = 0;
- }
- }
- --ind_r;
- --ind_b;
- }
-
- r->frac[ind_r] -= borrow2;
-carry:
- ind_r = ind_c;
- while (c->frac[ind_r] >= BASE) {
- c->frac[ind_r] -= BASE;
- --ind_r;
- ++c->frac[ind_r];
- }
- }
- /* End of operation, now final arrangement */
-out_side:
- c->Prec = word_c;
- c->exponent = a->exponent;
- if (!AddExponent(c, 2)) return 0;
- if (!AddExponent(c, -(b->exponent))) return 0;
-
- VpSetSign(c, VpGetSign(a) * VpGetSign(b));
- VpNmlz(c); /* normalize c */
- r->Prec = word_r;
- r->exponent = a->exponent;
- if (!AddExponent(r, 1)) return 0;
- VpSetSign(r, VpGetSign(a));
- VpNmlz(r); /* normalize r(remainder) */
- goto Exit;
-
-space_error:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- printf(" word_a=%"PRIuSIZE"\n", word_a);
- printf(" word_b=%"PRIuSIZE"\n", word_b);
- printf(" word_c=%"PRIuSIZE"\n", word_c);
- printf(" word_r=%"PRIuSIZE"\n", word_r);
- printf(" ind_r =%"PRIuSIZE"\n", ind_r);
- }
-#endif /* BIGDECIMAL_DEBUG */
- rb_bug("ERROR(VpDivd): space for remainder too small.");
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, " VpDivd(c=a/b), c=% \n", c);
- VPrint(stdout, " r=% \n", r);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return c->Prec * BASE_FIG;
-}
-
-/*
- * Input a = 00000xxxxxxxx En(5 preceding zeros)
- * Output a = xxxxxxxx En-5
- */
-static int
-VpNmlz(Real *a)
-{
- size_t ind_a, i;
-
- if (!VpIsDef(a)) goto NoVal;
- if (VpIsZero(a)) goto NoVal;
-
- ind_a = a->Prec;
- while (ind_a--) {
- if (a->frac[ind_a]) {
- a->Prec = ind_a + 1;
- i = 0;
- while (a->frac[i] == 0) ++i; /* skip the first few zeros */
- if (i) {
- a->Prec -= i;
- if (!AddExponent(a, -(SIGNED_VALUE)i)) return 0;
- memmove(&a->frac[0], &a->frac[i], a->Prec*sizeof(DECDIG));
- }
- return 1;
- }
- }
- /* a is zero(no non-zero digit) */
- VpSetZero(a, VpGetSign(a));
- return 0;
-
-NoVal:
- a->frac[0] = 0;
- a->Prec = 1;
- return 0;
-}
-
-/*
- * VpComp = 0 ... if a=b,
- * Pos ... a>b,
- * Neg ... asign - b->sign;
- else e = a->sign;
-
- if (e > 0) return 1;
- else if (e < 0) return -1;
- else return 0;
- }
- if (!VpIsDef(b)) {
- e = -b->sign;
- if (e > 0) return 1;
- else return -1;
- }
- /* Zero check */
- if (VpIsZero(a)) {
- if (VpIsZero(b)) return 0; /* both zero */
- val = -VpGetSign(b);
- goto Exit;
- }
- if (VpIsZero(b)) {
- val = VpGetSign(a);
- goto Exit;
- }
-
- /* compare sign */
- if (VpGetSign(a) > VpGetSign(b)) {
- val = 1; /* a>b */
- goto Exit;
- }
- if (VpGetSign(a) < VpGetSign(b)) {
- val = -1; /* aexponent > b->exponent) {
- val = VpGetSign(a);
- goto Exit;
- }
- if (a->exponent < b->exponent) {
- val = -VpGetSign(b);
- goto Exit;
- }
-
- /* a and b have same exponent, then compare their significand. */
- mx = (a->Prec < b->Prec) ? a->Prec : b->Prec;
- ind = 0;
- while (ind < mx) {
- if (a->frac[ind] > b->frac[ind]) {
- val = VpGetSign(a);
- goto Exit;
- }
- if (a->frac[ind] < b->frac[ind]) {
- val = -VpGetSign(b);
- goto Exit;
- }
- ++ind;
- }
- if (a->Prec > b->Prec) {
- val = VpGetSign(a);
- }
- else if (a->Prec < b->Prec) {
- val = -VpGetSign(b);
- }
-
-Exit:
- if (val > 1) val = 1;
- else if (val < -1) val = -1;
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, " VpComp a=%\n", a);
- VPrint(stdout, " b=%\n", b);
- printf(" ans=%d\n", val);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return (int)val;
-}
-
-/*
- * cntl_chr ... ASCIIZ Character, print control characters
- * Available control codes:
- * % ... VP variable. To print '%', use '%%'.
- * \n ... new line
- * \b ... backspace
- * \t ... tab
- * Note: % must not appear more than once
- * a ... VP variable to be printed
- */
-static int
-VPrint(FILE *fp, const char *cntl_chr, Real *a)
-{
- size_t i, j, nc, nd, ZeroSup, sep = 10;
- DECDIG m, e, nn;
-
- j = 0;
- nd = nc = 0; /* nd : number of digits in fraction part(every 10 digits, */
- /* nd<=10). */
- /* nc : number of characters printed */
- ZeroSup = 1; /* Flag not to print the leading zeros as 0.00xxxxEnn */
- while (*(cntl_chr + j)) {
- if (*(cntl_chr + j) == '%' && *(cntl_chr + j + 1) != '%') {
- nc = 0;
- if (VpIsNaN(a)) {
- fprintf(fp, SZ_NaN);
- nc += 8;
- }
- else if (VpIsPosInf(a)) {
- fprintf(fp, SZ_INF);
- nc += 8;
- }
- else if (VpIsNegInf(a)) {
- fprintf(fp, SZ_NINF);
- nc += 9;
- }
- else if (!VpIsZero(a)) {
- if (BIGDECIMAL_NEGATIVE_P(a)) {
- fprintf(fp, "-");
- ++nc;
- }
- nc += fprintf(fp, "0.");
- switch (*(cntl_chr + j + 1)) {
- default:
- break;
-
- case '0': case 'z':
- ZeroSup = 0;
- ++j;
- sep = cntl_chr[j] == 'z' ? BIGDECIMAL_COMPONENT_FIGURES : 10;
- break;
- }
- for (i = 0; i < a->Prec; ++i) {
- m = BASE1;
- e = a->frac[i];
- while (m) {
- nn = e / m;
- if (!ZeroSup || nn) {
- nc += fprintf(fp, "%lu", (unsigned long)nn); /* The leading zero(s) */
- /* as 0.00xx will not */
- /* be printed. */
- ++nd;
- ZeroSup = 0; /* Set to print succeeding zeros */
- }
- if (nd >= sep) { /* print ' ' after every 10 digits */
- nd = 0;
- nc += fprintf(fp, " ");
- }
- e = e - nn * m;
- m /= 10;
- }
- }
- nc += fprintf(fp, "E%"PRIdSIZE, VpExponent10(a));
- nc += fprintf(fp, " (%"PRIdVALUE", %"PRIuSIZE", %"PRIuSIZE")", a->exponent, a->Prec, a->MaxPrec);
- }
- else {
- nc += fprintf(fp, "0.0");
- }
- }
- else {
- ++nc;
- if (*(cntl_chr + j) == '\\') {
- switch (*(cntl_chr + j + 1)) {
- case 'n':
- fprintf(fp, "\n");
- ++j;
- break;
- case 't':
- fprintf(fp, "\t");
- ++j;
- break;
- case 'b':
- fprintf(fp, "\n");
- ++j;
- break;
- default:
- fprintf(fp, "%c", *(cntl_chr + j));
- break;
- }
- }
- else {
- fprintf(fp, "%c", *(cntl_chr + j));
- if (*(cntl_chr + j) == '%') ++j;
- }
- }
- j++;
- }
-
- return (int)nc;
-}
-
-static void
-VpFormatSt(char *psz, size_t fFmt)
-{
- size_t ie, i, nf = 0;
- char ch;
-
- if (fFmt == 0) return;
-
- ie = strlen(psz);
- for (i = 0; i < ie; ++i) {
- ch = psz[i];
- if (!ch) break;
- if (ISSPACE(ch) || ch=='-' || ch=='+') continue;
- if (ch == '.') { nf = 0; continue; }
- if (ch == 'E' || ch == 'e') break;
-
- if (++nf > fFmt) {
- memmove(psz + i + 1, psz + i, ie - i + 1);
- ++ie;
- nf = 0;
- psz[i] = ' ';
- }
- }
-}
-
-VP_EXPORT ssize_t
-VpExponent10(Real *a)
-{
- ssize_t ex;
- size_t n;
-
- if (!VpHasVal(a)) return 0;
-
- ex = a->exponent * (ssize_t)BASE_FIG;
- n = BASE1;
- while ((a->frac[0] / n) == 0) {
- --ex;
- n /= 10;
- }
- return ex;
-}
-
-VP_EXPORT void
-VpSzMantissa(Real *a, char *buf, size_t buflen)
-{
- size_t i, n, ZeroSup;
- DECDIG_DBL m, e, nn;
-
- if (VpIsNaN(a)) {
- snprintf(buf, buflen, SZ_NaN);
- return;
- }
- if (VpIsPosInf(a)) {
- snprintf(buf, buflen, SZ_INF);
- return;
- }
- if (VpIsNegInf(a)) {
- snprintf(buf, buflen, SZ_NINF);
- return;
- }
-
- ZeroSup = 1; /* Flag not to print the leading zeros as 0.00xxxxEnn */
- if (!VpIsZero(a)) {
- if (BIGDECIMAL_NEGATIVE_P(a)) *buf++ = '-';
- n = a->Prec;
- for (i = 0; i < n; ++i) {
- m = BASE1;
- e = a->frac[i];
- while (m) {
- nn = e / m;
- if (!ZeroSup || nn) {
- snprintf(buf, buflen, "%lu", (unsigned long)nn); /* The leading zero(s) */
- buf += strlen(buf);
- /* as 0.00xx will be ignored. */
- ZeroSup = 0; /* Set to print succeeding zeros */
- }
- e = e - nn * m;
- m /= 10;
- }
- }
- *buf = 0;
- while (buf[-1] == '0') *(--buf) = 0;
- }
- else {
- if (VpIsPosZero(a)) snprintf(buf, buflen, "0");
- else snprintf(buf, buflen, "-0");
- }
-}
-
-VP_EXPORT int
-VpToSpecialString(Real *a, char *buf, size_t buflen, int fPlus)
-/* fPlus = 0: default, 1: set ' ' before digits, 2: set '+' before digits. */
-{
- if (VpIsNaN(a)) {
- snprintf(buf, buflen, SZ_NaN);
- return 1;
- }
-
- if (VpIsPosInf(a)) {
- if (fPlus == 1) {
- *buf++ = ' ';
- }
- else if (fPlus == 2) {
- *buf++ = '+';
- }
- snprintf(buf, buflen, SZ_INF);
- return 1;
- }
- if (VpIsNegInf(a)) {
- snprintf(buf, buflen, SZ_NINF);
- return 1;
- }
- if (VpIsZero(a)) {
- if (VpIsPosZero(a)) {
- if (fPlus == 1) snprintf(buf, buflen, " 0.0");
- else if (fPlus == 2) snprintf(buf, buflen, "+0.0");
- else snprintf(buf, buflen, "0.0");
- }
- else snprintf(buf, buflen, "-0.0");
- return 1;
- }
- return 0;
-}
-
-VP_EXPORT void
-VpToString(Real *a, char *buf, size_t buflen, size_t fFmt, int fPlus)
-/* fPlus = 0: default, 1: set ' ' before digits, 2: set '+' before digits. */
-{
- size_t i, n, ZeroSup;
- DECDIG shift, m, e, nn;
- char *p = buf;
- size_t plen = buflen;
- ssize_t ex;
-
- if (VpToSpecialString(a, buf, buflen, fPlus)) return;
-
- ZeroSup = 1; /* Flag not to print the leading zeros as 0.00xxxxEnn */
-
-#define ADVANCE(n) do { \
- if (plen < n) goto overflow; \
- p += n; \
- plen -= n; \
-} while (0)
-
- if (BIGDECIMAL_NEGATIVE_P(a)) {
- *p = '-';
- ADVANCE(1);
- }
- else if (fPlus == 1) {
- *p = ' ';
- ADVANCE(1);
- }
- else if (fPlus == 2) {
- *p = '+';
- ADVANCE(1);
- }
-
- *p = '0'; ADVANCE(1);
- *p = '.'; ADVANCE(1);
-
- n = a->Prec;
- for (i = 0; i < n; ++i) {
- m = BASE1;
- e = a->frac[i];
- while (m) {
- nn = e / m;
- if (!ZeroSup || nn) {
- /* The reading zero(s) */
- size_t n = (size_t)snprintf(p, plen, "%lu", (unsigned long)nn);
- if (n > plen) goto overflow;
- ADVANCE(n);
- /* as 0.00xx will be ignored. */
- ZeroSup = 0; /* Set to print succeeding zeros */
- }
- e = e - nn * m;
- m /= 10;
- }
- }
-
- ex = a->exponent * (ssize_t)BASE_FIG;
- shift = BASE1;
- while (a->frac[0] / shift == 0) {
- --ex;
- shift /= 10;
- }
- while (p - 1 > buf && p[-1] == '0') {
- *(--p) = '\0';
- ++plen;
- }
- snprintf(p, plen, "e%"PRIdSIZE, ex);
- if (fFmt) VpFormatSt(buf, fFmt);
-
- overflow:
- return;
-#undef ADVANCE
-}
-
-VP_EXPORT void
-VpToFString(Real *a, char *buf, size_t buflen, size_t fFmt, int fPlus)
-/* fPlus = 0: default, 1: set ' ' before digits, 2: set '+' before digits. */
-{
- size_t i, n;
- DECDIG m, e, nn;
- char *p = buf;
- size_t plen = buflen;
- ssize_t ex;
-
- if (VpToSpecialString(a, buf, buflen, fPlus)) return;
-
-#define ADVANCE(n) do { \
- if (plen < n) goto overflow; \
- p += n; \
- plen -= n; \
-} while (0)
-
-
- if (BIGDECIMAL_NEGATIVE_P(a)) {
- *p = '-';
- ADVANCE(1);
- }
- else if (fPlus == 1) {
- *p = ' ';
- ADVANCE(1);
- }
- else if (fPlus == 2) {
- *p = '+';
- ADVANCE(1);
- }
-
- n = a->Prec;
- ex = a->exponent;
- if (ex <= 0) {
- *p = '0'; ADVANCE(1);
- *p = '.'; ADVANCE(1);
- while (ex < 0) {
- for (i=0; i < BASE_FIG; ++i) {
- *p = '0'; ADVANCE(1);
- }
- ++ex;
- }
- ex = -1;
- }
-
- for (i = 0; i < n; ++i) {
- --ex;
- if (i == 0 && ex >= 0) {
- size_t n = snprintf(p, plen, "%lu", (unsigned long)a->frac[i]);
- if (n > plen) goto overflow;
- ADVANCE(n);
- }
- else {
- m = BASE1;
- e = a->frac[i];
- while (m) {
- nn = e / m;
- *p = (char)(nn + '0');
- ADVANCE(1);
- e = e - nn * m;
- m /= 10;
- }
- }
- if (ex == 0) {
- *p = '.';
- ADVANCE(1);
- }
- }
- while (--ex>=0) {
- m = BASE;
- while (m /= 10) {
- *p = '0';
- ADVANCE(1);
- }
- if (ex == 0) {
- *p = '.';
- ADVANCE(1);
- }
- }
-
- *p = '\0';
- while (p - 1 > buf && p[-1] == '0') {
- *(--p) = '\0';
- ++plen;
- }
- if (p - 1 > buf && p[-1] == '.') {
- snprintf(p, plen, "0");
- }
- if (fFmt) VpFormatSt(buf, fFmt);
-
- overflow:
- return;
-#undef ADVANCE
-}
-
-/*
- * [Output]
- * a[] ... variable to be assigned the value.
- * [Input]
- * int_chr[] ... integer part(may include '+/-').
- * ni ... number of characters in int_chr[],not including '+/-'.
- * frac[] ... fraction part.
- * nf ... number of characters in frac[].
- * exp_chr[] ... exponent part(including '+/-').
- * ne ... number of characters in exp_chr[],not including '+/-'.
- */
-VP_EXPORT int
-VpCtoV(Real *a, const char *int_chr, size_t ni, const char *frac, size_t nf, const char *exp_chr, size_t ne)
-{
- size_t i, j, ind_a, ma, mi, me;
- SIGNED_VALUE e, es, eb, ef;
- int sign, signe, exponent_overflow;
-
- /* get exponent part */
- e = 0;
- ma = a->MaxPrec;
- mi = ni;
- me = ne;
- signe = 1;
- exponent_overflow = 0;
- memset(a->frac, 0, ma * sizeof(DECDIG));
- if (ne > 0) {
- i = 0;
- if (exp_chr[0] == '-') {
- signe = -1;
- ++i;
- ++me;
- }
- else if (exp_chr[0] == '+') {
- ++i;
- ++me;
- }
- while (i < me) {
- if (MUL_OVERFLOW_SIGNED_VALUE_P(e, (SIGNED_VALUE)BASE_FIG)) {
- es = e;
- goto exp_overflow;
- }
- es = e * (SIGNED_VALUE)BASE_FIG;
- if (MUL_OVERFLOW_SIGNED_VALUE_P(e, 10) ||
- SIGNED_VALUE_MAX - (exp_chr[i] - '0') < e * 10)
- goto exp_overflow;
- e = e * 10 + exp_chr[i] - '0';
- if (MUL_OVERFLOW_SIGNED_VALUE_P(e, (SIGNED_VALUE)BASE_FIG))
- goto exp_overflow;
- if (es > (SIGNED_VALUE)(e * BASE_FIG)) {
- exp_overflow:
- exponent_overflow = 1;
- e = es; /* keep sign */
- break;
- }
- ++i;
- }
- }
-
- /* get integer part */
- i = 0;
- sign = 1;
- if (1 /*ni >= 0*/) {
- if (int_chr[0] == '-') {
- sign = -1;
- ++i;
- ++mi;
- }
- else if (int_chr[0] == '+') {
- ++i;
- ++mi;
- }
- }
-
- e = signe * e; /* e: The value of exponent part. */
- e = e + ni; /* set actual exponent size. */
-
- if (e > 0) signe = 1;
- else signe = -1;
-
- /* Adjust the exponent so that it is the multiple of BASE_FIG. */
- j = 0;
- ef = 1;
- while (ef) {
- if (e >= 0) eb = e;
- else eb = -e;
- ef = eb / (SIGNED_VALUE)BASE_FIG;
- ef = eb - ef * (SIGNED_VALUE)BASE_FIG;
- if (ef) {
- ++j; /* Means to add one more preceding zero */
- ++e;
- }
- }
-
- eb = e / (SIGNED_VALUE)BASE_FIG;
-
- if (exponent_overflow) {
- int zero = 1;
- for ( ; i < mi && zero; i++) zero = int_chr[i] == '0';
- for (i = 0; i < nf && zero; i++) zero = frac[i] == '0';
- if (!zero && signe > 0) {
- VpSetInf(a, sign);
- VpException(VP_EXCEPTION_INFINITY, "exponent overflow",0);
- }
- else VpSetZero(a, sign);
- return 1;
- }
-
- ind_a = 0;
- while (i < mi) {
- a->frac[ind_a] = 0;
- while (j < BASE_FIG && i < mi) {
- a->frac[ind_a] = a->frac[ind_a] * 10 + int_chr[i] - '0';
- ++j;
- ++i;
- }
- if (i < mi) {
- ++ind_a;
- if (ind_a >= ma) goto over_flow;
- j = 0;
- }
- }
-
- /* get fraction part */
-
- i = 0;
- while (i < nf) {
- while (j < BASE_FIG && i < nf) {
- a->frac[ind_a] = a->frac[ind_a] * 10 + frac[i] - '0';
- ++j;
- ++i;
- }
- if (i < nf) {
- ++ind_a;
- if (ind_a >= ma) goto over_flow;
- j = 0;
- }
- }
- goto Final;
-
-over_flow:
- rb_warn("Conversion from String to BigDecimal overflow (last few digits discarded).");
-
-Final:
- if (ind_a >= ma) ind_a = ma - 1;
- while (j < BASE_FIG) {
- a->frac[ind_a] = a->frac[ind_a] * 10;
- ++j;
- }
- a->Prec = ind_a + 1;
- a->exponent = eb;
- VpSetSign(a, sign);
- VpNmlz(a);
- return 1;
-}
-
-/*
- * [Input]
- * *m ... Real
- * [Output]
- * *d ... fraction part of m(d = 0.xxxxxxx). where # of 'x's is fig.
- * *e ... exponent of m.
- * BIGDECIMAL_DOUBLE_FIGURES ... Number of digits in a double variable.
- *
- * m -> d*10**e, 0Prec);
- *d = 0.0;
- div = 1.;
- while (ind_m < mm) {
- div /= (double)BASE;
- *d = *d + (double)m->frac[ind_m++] * div;
- }
- *e = m->exponent * (SIGNED_VALUE)BASE_FIG;
- *d *= VpGetSign(m);
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, " VpVtoD: m=%\n", m);
- printf(" d=%e * 10 **%ld\n", *d, *e);
- printf(" BIGDECIMAL_DOUBLE_FIGURES = %d\n", BIGDECIMAL_DOUBLE_FIGURES);
- }
-#endif /*BIGDECIMAL_DEBUG */
- return f;
-}
-
-/*
- * m <- d
- */
-VP_EXPORT void
-VpDtoV(Real *m, double d)
-{
- size_t ind_m, mm;
- SIGNED_VALUE ne;
- DECDIG i;
- double val, val2;
-
- if (isnan(d)) {
- VpSetNaN(m);
- goto Exit;
- }
- if (isinf(d)) {
- if (d > 0.0) VpSetPosInf(m);
- else VpSetNegInf(m);
- goto Exit;
- }
-
- if (d == 0.0) {
- VpSetZero(m, 1);
- goto Exit;
- }
- val = (d > 0.) ? d : -d;
- ne = 0;
- if (val >= 1.0) {
- while (val >= 1.0) {
- val /= (double)BASE;
- ++ne;
- }
- }
- else {
- val2 = 1.0 / (double)BASE;
- while (val < val2) {
- val *= (double)BASE;
- --ne;
- }
- }
- /* Now val = 0.xxxxx*BASE**ne */
-
- mm = m->MaxPrec;
- memset(m->frac, 0, mm * sizeof(DECDIG));
- for (ind_m = 0; val > 0.0 && ind_m < mm; ind_m++) {
- val *= (double)BASE;
- i = (DECDIG)val;
- val -= (double)i;
- m->frac[ind_m] = i;
- }
- if (ind_m >= mm) ind_m = mm - 1;
- VpSetSign(m, (d > 0.0) ? 1 : -1);
- m->Prec = ind_m + 1;
- m->exponent = ne;
-
- VpInternalRound(m, 0, (m->Prec > 0) ? m->frac[m->Prec-1] : 0,
- (DECDIG)(val*(double)BASE));
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- printf("VpDtoV d=%30.30e\n", d);
- VPrint(stdout, " m=%\n", m);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return;
-}
-
-/*
- * m <- ival
- */
-#if 0 /* unused */
-VP_EXPORT void
-VpItoV(Real *m, SIGNED_VALUE ival)
-{
- size_t mm, ind_m;
- size_t val, v1, v2, v;
- int isign;
- SIGNED_VALUE ne;
-
- if (ival == 0) {
- VpSetZero(m, 1);
- goto Exit;
- }
- isign = 1;
- val = ival;
- if (ival < 0) {
- isign = -1;
- val =(size_t)(-ival);
- }
- ne = 0;
- ind_m = 0;
- mm = m->MaxPrec;
- while (ind_m < mm) {
- m->frac[ind_m] = 0;
- ++ind_m;
- }
- ind_m = 0;
- while (val > 0) {
- if (val) {
- v1 = val;
- v2 = 1;
- while (v1 >= BASE) {
- v1 /= BASE;
- v2 *= BASE;
- }
- val = val - v2 * v1;
- v = v1;
- }
- else {
- v = 0;
- }
- m->frac[ind_m] = v;
- ++ind_m;
- ++ne;
- }
- m->Prec = ind_m - 1;
- m->exponent = ne;
- VpSetSign(m, isign);
- VpNmlz(m);
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- printf(" VpItoV i=%d\n", ival);
- VPrint(stdout, " m=%\n", m);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return;
-}
-#endif
-
-/*
- * y = SQRT(x), y*y - x =>0
- */
-VP_EXPORT int
-VpSqrt(Real *y, Real *x)
-{
- Real *f = NULL;
- Real *r = NULL;
- size_t y_prec;
- SIGNED_VALUE n, e;
- SIGNED_VALUE prec;
- ssize_t nr;
- double val;
-
- /* Zero or +Infinity ? */
- if (VpIsZero(x) || VpIsPosInf(x)) {
- VpAsgn(y,x,1);
- goto Exit;
- }
-
- /* Negative ? */
- if (BIGDECIMAL_NEGATIVE_P(x)) {
- VpSetNaN(y);
- return VpException(VP_EXCEPTION_OP, "sqrt of negative value", 0);
- }
-
- /* NaN ? */
- if (VpIsNaN(x)) {
- VpSetNaN(y);
- return VpException(VP_EXCEPTION_OP, "sqrt of 'NaN'(Not a Number)", 0);
- }
-
- /* One ? */
- if (VpIsOne(x)) {
- VpSetOne(y);
- goto Exit;
- }
-
- n = (SIGNED_VALUE)y->MaxPrec;
- if (x->MaxPrec > (size_t)n) n = (ssize_t)x->MaxPrec;
-
- /* allocate temporally variables */
- /* TODO: reconsider MaxPrec of f and r */
- f = NewOneNolimit(1, y->MaxPrec * (BASE_FIG + 2));
- r = NewOneNolimit(1, (n + n) * (BASE_FIG + 2));
-
- nr = 0;
- y_prec = y->MaxPrec;
-
- prec = x->exponent - (ssize_t)y_prec;
- if (x->exponent > 0)
- ++prec;
- else
- --prec;
-
- VpVtoD(&val, &e, x); /* val <- x */
- e /= (SIGNED_VALUE)BASE_FIG;
- n = e / 2;
- if (e - n * 2 != 0) {
- val /= BASE;
- n = (e + 1) / 2;
- }
- VpDtoV(y, sqrt(val)); /* y <- sqrt(val) */
- y->exponent += n;
- n = (SIGNED_VALUE)roomof(BIGDECIMAL_DOUBLE_FIGURES, BASE_FIG);
- y->MaxPrec = Min((size_t)n , y_prec);
- f->MaxPrec = y->MaxPrec + 1;
- n = (SIGNED_VALUE)(y_prec * BASE_FIG);
- if (n < (SIGNED_VALUE)maxnr) n = (SIGNED_VALUE)maxnr;
-
- /*
- * Perform: y_{n+1} = (y_n - x/y_n) / 2
- */
- do {
- y->MaxPrec *= 2;
- if (y->MaxPrec > y_prec) y->MaxPrec = y_prec;
- f->MaxPrec = y->MaxPrec;
- VpDivd(f, r, x, y); /* f = x/y */
- VpAddSub(r, f, y, -1); /* r = f - y */
- VpMult(f, VpConstPt5, r); /* f = 0.5*r */
- if (VpIsZero(f))
- goto converge;
- VpAddSub(r, f, y, 1); /* r = y + f */
- VpAsgn(y, r, 1); /* y = r */
- } while (++nr < n);
-
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- printf("ERROR(VpSqrt): did not converge within %ld iterations.\n", nr);
- }
-#endif /* BIGDECIMAL_DEBUG */
- y->MaxPrec = y_prec;
-
-converge:
- VpChangeSign(y, 1);
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VpMult(r, y, y);
- VpAddSub(f, x, r, -1);
- printf("VpSqrt: iterations = %"PRIdSIZE"\n", nr);
- VPrint(stdout, " y =% \n", y);
- VPrint(stdout, " x =% \n", x);
- VPrint(stdout, " x-y*y = % \n", f);
- }
-#endif /* BIGDECIMAL_DEBUG */
- y->MaxPrec = y_prec;
-
-Exit:
- rbd_free_struct(f);
- rbd_free_struct(r);
- return 1;
-}
-
-/*
- * Round relatively from the decimal point.
- * f: rounding mode
- * nf: digit location to round from the decimal point.
- */
-VP_EXPORT int
-VpMidRound(Real *y, unsigned short f, ssize_t nf)
-{
- /* fracf: any positive digit under rounding position? */
- /* fracf_1further: any positive digits under one further than the rounding position? */
- /* exptoadd: number of digits needed to compensate negative nf */
- int fracf, fracf_1further;
- ssize_t n,i,ix,ioffset, exptoadd;
- DECDIG v, shifter;
- DECDIG div;
-
- nf += y->exponent * (ssize_t)BASE_FIG;
- exptoadd=0;
- if (nf < 0) {
- /* rounding position too left(large). */
- if (f != VP_ROUND_CEIL && f != VP_ROUND_FLOOR) {
- VpSetZero(y, VpGetSign(y)); /* truncate everything */
- return 0;
- }
- exptoadd = -nf;
- nf = 0;
- }
-
- ix = nf / (ssize_t)BASE_FIG;
- if ((size_t)ix >= y->Prec) return 0; /* rounding position too right(small). */
- v = y->frac[ix];
-
- ioffset = nf - ix*(ssize_t)BASE_FIG;
- n = (ssize_t)BASE_FIG - ioffset - 1;
- for (shifter = 1, i = 0; i < n; ++i) shifter *= 10;
-
- /* so the representation used (in y->frac) is an array of DECDIG, where
- each DECDIG contains a value between 0 and BASE-1, consisting of BASE_FIG
- decimal places.
-
- (that numbers of decimal places are typed as ssize_t is somewhat confusing)
-
- nf is now position (in decimal places) of the digit from the start of
- the array.
-
- ix is the position (in DECDIGs) of the DECDIG containing the decimal digit,
- from the start of the array.
-
- v is the value of this DECDIG
-
- ioffset is the number of extra decimal places along of this decimal digit
- within v.
-
- n is the number of decimal digits remaining within v after this decimal digit
- shifter is 10**n,
-
- v % shifter are the remaining digits within v
- v % (shifter * 10) are the digit together with the remaining digits within v
- v / shifter are the digit's predecessors together with the digit
- div = v / shifter / 10 is just the digit's precessors
- (v / shifter) - div*10 is just the digit, which is what v ends up being reassigned to.
- */
-
- fracf = (v % (shifter * 10) > 0);
- fracf_1further = ((v % shifter) > 0);
-
- v /= shifter;
- div = v / 10;
- v = v - div*10;
- /* now v is just the digit required.
- now fracf is whether the digit or any of the remaining digits within v are non-zero
- now fracf_1further is whether any of the remaining digits within v are non-zero
- */
-
- /* now check all the remaining DECDIGs for zero-ness a whole DECDIG at a time.
- if we spot any non-zeroness, that means that we found a positive digit under
- rounding position, and we also found a positive digit under one further than
- the rounding position, so both searches (to see if any such non-zero digit exists)
- can stop */
-
- for (i = ix + 1; (size_t)i < y->Prec; i++) {
- if (y->frac[i] % BASE) {
- fracf = fracf_1further = 1;
- break;
- }
- }
-
- /* now fracf = does any positive digit exist under the rounding position?
- now fracf_1further = does any positive digit exist under one further than the
- rounding position?
- now v = the first digit under the rounding position */
-
- /* drop digits after pointed digit */
- memset(y->frac + ix + 1, 0, (y->Prec - (ix + 1)) * sizeof(DECDIG));
-
- switch (f) {
- case VP_ROUND_DOWN: /* Truncate */
- break;
- case VP_ROUND_UP: /* Roundup */
- if (fracf) ++div;
- break;
- case VP_ROUND_HALF_UP:
- if (v>=5) ++div;
- break;
- case VP_ROUND_HALF_DOWN:
- if (v > 5 || (v == 5 && fracf_1further)) ++div;
- break;
- case VP_ROUND_CEIL:
- if (fracf && BIGDECIMAL_POSITIVE_P(y)) ++div;
- break;
- case VP_ROUND_FLOOR:
- if (fracf && BIGDECIMAL_NEGATIVE_P(y)) ++div;
- break;
- case VP_ROUND_HALF_EVEN: /* Banker's rounding */
- if (v > 5) ++div;
- else if (v == 5) {
- if (fracf_1further) {
- ++div;
- }
- else {
- if (ioffset == 0) {
- /* v is the first decimal digit of its DECDIG;
- need to grab the previous DECDIG if present
- to check for evenness of the previous decimal
- digit (which is same as that of the DECDIG since
- base 10 has a factor of 2) */
- if (ix && (y->frac[ix-1] % 2)) ++div;
- }
- else {
- if (div % 2) ++div;
- }
- }
- }
- break;
- }
- for (i = 0; i <= n; ++i) div *= 10;
- if (div >= BASE) {
- if (ix) {
- y->frac[ix] = 0;
- VpRdup(y, ix);
- }
- else {
- short s = VpGetSign(y);
- SIGNED_VALUE e = y->exponent;
- VpSetOne(y);
- VpSetSign(y, s);
- y->exponent = e + 1;
- }
- }
- else {
- y->frac[ix] = div;
- VpNmlz(y);
- }
- if (exptoadd > 0) {
- y->exponent += (SIGNED_VALUE)(exptoadd / BASE_FIG);
- exptoadd %= (ssize_t)BASE_FIG;
- for (i = 0; i < exptoadd; i++) {
- y->frac[0] *= 10;
- if (y->frac[0] >= BASE) {
- y->frac[0] /= BASE;
- y->exponent++;
- }
- }
- }
- return 1;
-}
-
-VP_EXPORT int
-VpLeftRound(Real *y, unsigned short f, ssize_t nf)
-/*
- * Round from the left hand side of the digits.
- */
-{
- DECDIG v;
- if (!VpHasVal(y)) return 0; /* Unable to round */
- v = y->frac[0];
- nf -= VpExponent(y) * (ssize_t)BASE_FIG;
- while ((v /= 10) != 0) nf--;
- nf += (ssize_t)BASE_FIG-1;
- return VpMidRound(y, f, nf);
-}
-
-VP_EXPORT int
-VpActiveRound(Real *y, Real *x, unsigned short f, ssize_t nf)
-{
- /* First,assign whole value in truncation mode */
- if (VpAsgn(y, x, 10) <= 1) return 0; /* Zero,NaN,or Infinity */
- return VpMidRound(y, f, nf);
-}
-
-static int
-VpLimitRound(Real *c, size_t ixDigit)
-{
- size_t ix = VpGetPrecLimit();
- if (!VpNmlz(c)) return -1;
- if (!ix) return 0;
- if (!ixDigit) ixDigit = c->Prec-1;
- if ((ix + BASE_FIG - 1) / BASE_FIG > ixDigit + 1) return 0;
- return VpLeftRound(c, VpGetRoundMode(), (ssize_t)ix);
-}
-
-/* If I understand correctly, this is only ever used to round off the final decimal
- digit of precision */
-static void
-VpInternalRound(Real *c, size_t ixDigit, DECDIG vPrev, DECDIG v)
-{
- int f = 0;
-
- unsigned short const rounding_mode = VpGetRoundMode();
-
- if (VpLimitRound(c, ixDigit)) return;
- if (!v) return;
-
- v /= BASE1;
- switch (rounding_mode) {
- case VP_ROUND_DOWN:
- break;
- case VP_ROUND_UP:
- if (v) f = 1;
- break;
- case VP_ROUND_HALF_UP:
- if (v >= 5) f = 1;
- break;
- case VP_ROUND_HALF_DOWN:
- /* this is ok - because this is the last digit of precision,
- the case where v == 5 and some further digits are nonzero
- will never occur */
- if (v >= 6) f = 1;
- break;
- case VP_ROUND_CEIL:
- if (v && BIGDECIMAL_POSITIVE_P(c)) f = 1;
- break;
- case VP_ROUND_FLOOR:
- if (v && BIGDECIMAL_NEGATIVE_P(c)) f = 1;
- break;
- case VP_ROUND_HALF_EVEN: /* Banker's rounding */
- /* as per VP_ROUND_HALF_DOWN, because this is the last digit of precision,
- there is no case to worry about where v == 5 and some further digits are nonzero */
- if (v > 5) f = 1;
- else if (v == 5 && vPrev % 2) f = 1;
- break;
- }
- if (f) {
- VpRdup(c, ixDigit);
- VpNmlz(c);
- }
-}
-
-/*
- * Rounds up m(plus one to final digit of m).
- */
-static int
-VpRdup(Real *m, size_t ind_m)
-{
- DECDIG carry;
-
- if (!ind_m) ind_m = m->Prec;
-
- carry = 1;
- while (carry > 0 && ind_m--) {
- m->frac[ind_m] += carry;
- if (m->frac[ind_m] >= BASE) m->frac[ind_m] -= BASE;
- else carry = 0;
- }
- if (carry > 0) { /* Overflow,count exponent and set fraction part be 1 */
- if (!AddExponent(m, 1)) return 0;
- m->Prec = m->frac[0] = 1;
- }
- else {
- VpNmlz(m);
- }
- return 1;
-}
-
-/*
- * y = x - fix(x)
- */
-VP_EXPORT void
-VpFrac(Real *y, Real *x)
-{
- size_t my, ind_y, ind_x;
-
- if (!VpHasVal(x)) {
- VpAsgn(y, x, 1);
- goto Exit;
- }
-
- if (x->exponent > 0 && (size_t)x->exponent >= x->Prec) {
- VpSetZero(y, VpGetSign(x));
- goto Exit;
- }
- else if (x->exponent <= 0) {
- VpAsgn(y, x, 1);
- goto Exit;
- }
-
- /* satisfy: x->exponent > 0 */
-
- y->Prec = x->Prec - (size_t)x->exponent;
- y->Prec = Min(y->Prec, y->MaxPrec);
- y->exponent = 0;
- VpSetSign(y, VpGetSign(x));
- ind_y = 0;
- my = y->Prec;
- ind_x = x->exponent;
- while (ind_y < my) {
- y->frac[ind_y] = x->frac[ind_x];
- ++ind_y;
- ++ind_x;
- }
- VpNmlz(y);
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpFrac y=%\n", y);
- VPrint(stdout, " x=%\n", x);
- }
-#endif /* BIGDECIMAL_DEBUG */
- return;
-}
-
-/*
- * y = x ** n
- */
-VP_EXPORT int
-VpPowerByInt(Real *y, Real *x, SIGNED_VALUE n)
-{
- size_t s, ss;
- ssize_t sign;
- Real *w1 = NULL;
- Real *w2 = NULL;
-
- if (VpIsZero(x)) {
- if (n == 0) {
- VpSetOne(y);
- goto Exit;
- }
- sign = VpGetSign(x);
- if (n < 0) {
- n = -n;
- if (sign < 0) sign = (n % 2) ? -1 : 1;
- VpSetInf(y, sign);
- }
- else {
- if (sign < 0) sign = (n % 2) ? -1 : 1;
- VpSetZero(y,sign);
- }
- goto Exit;
- }
- if (VpIsNaN(x)) {
- VpSetNaN(y);
- goto Exit;
- }
- if (VpIsInf(x)) {
- if (n == 0) {
- VpSetOne(y);
- goto Exit;
- }
- if (n > 0) {
- VpSetInf(y, (n % 2 == 0 || VpIsPosInf(x)) ? 1 : -1);
- goto Exit;
- }
- VpSetZero(y, (n % 2 == 0 || VpIsPosInf(x)) ? 1 : -1);
- goto Exit;
- }
-
- if (x->exponent == 1 && x->Prec == 1 && x->frac[0] == 1) {
- /* abs(x) = 1 */
- VpSetOne(y);
- if (BIGDECIMAL_POSITIVE_P(x)) goto Exit;
- if ((n % 2) == 0) goto Exit;
- VpSetSign(y, -1);
- goto Exit;
- }
-
- if (n > 0) sign = 1;
- else if (n < 0) {
- sign = -1;
- n = -n;
- }
- else {
- VpSetOne(y);
- goto Exit;
- }
-
- /* Allocate working variables */
- /* TODO: reconsider MaxPrec of w1 and w2 */
- w1 = NewZeroNolimit(1, (y->MaxPrec + 2) * BASE_FIG);
- w2 = NewZeroNolimit(1, (w1->MaxPrec * 2 + 1) * BASE_FIG);
-
- /* calculation start */
-
- VpAsgn(y, x, 1);
- --n;
- while (n > 0) {
- VpAsgn(w1, x, 1);
- s = 1;
- while (ss = s, (s += s) <= (size_t)n) {
- VpMult(w2, w1, w1);
- VpAsgn(w1, w2, 1);
- }
- n -= (SIGNED_VALUE)ss;
- VpMult(w2, y, w1);
- VpAsgn(y, w2, 1);
- }
- if (sign < 0) {
- VpDivd(w1, w2, VpConstOne, y);
- VpAsgn(y, w1, 1);
- }
-
-Exit:
-#ifdef BIGDECIMAL_DEBUG
- if (gfDebug) {
- VPrint(stdout, "VpPowerByInt y=%\n", y);
- VPrint(stdout, "VpPowerByInt x=%\n", x);
- printf(" n=%"PRIdVALUE"\n", n);
- }
-#endif /* BIGDECIMAL_DEBUG */
- rbd_free_struct(w2);
- rbd_free_struct(w1);
- return 1;
-}
-
-#ifdef BIGDECIMAL_DEBUG
-int
-VpVarCheck(Real * v)
-/*
- * Checks the validity of the Real variable v.
- * [Input]
- * v ... Real *, variable to be checked.
- * [Returns]
- * 0 ... correct v.
- * other ... error
- */
-{
- size_t i;
-
- if (v->MaxPrec == 0) {
- printf("ERROR(VpVarCheck): Illegal Max. Precision(=%"PRIuSIZE")\n",
- v->MaxPrec);
- return 1;
- }
- if (v->Prec == 0 || v->Prec > v->MaxPrec) {
- printf("ERROR(VpVarCheck): Illegal Precision(=%"PRIuSIZE")\n", v->Prec);
- printf(" Max. Prec.=%"PRIuSIZE"\n", v->MaxPrec);
- return 2;
- }
- for (i = 0; i < v->Prec; ++i) {
- if (v->frac[i] >= BASE) {
- printf("ERROR(VpVarCheck): Illegal fraction\n");
- printf(" Frac[%"PRIuSIZE"]=%"PRIuDECDIG"\n", i, v->frac[i]);
- printf(" Prec. =%"PRIuSIZE"\n", v->Prec);
- printf(" Exp. =%"PRIdVALUE"\n", v->exponent);
- printf(" BASE =%"PRIuDECDIG"\n", BASE);
- return 3;
- }
- }
- return 0;
-}
-#endif /* BIGDECIMAL_DEBUG */
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.h
deleted file mode 100644
index 54fed81..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.h
+++ /dev/null
@@ -1,313 +0,0 @@
-/*
- *
- * Ruby BigDecimal(Variable decimal precision) extension library.
- *
- * Copyright(C) 2002 by Shigeo Kobayashi(shigeo@tinyforest.gr.jp)
- *
- */
-
-#ifndef RUBY_BIG_DECIMAL_H
-#define RUBY_BIG_DECIMAL_H 1
-
-#define RUBY_NO_OLD_COMPATIBILITY
-#include "ruby/ruby.h"
-#include "missing.h"
-
-#ifdef HAVE_FLOAT_H
-# include
-#endif
-
-#ifdef HAVE_INT64_T
-# define DECDIG uint32_t
-# define DECDIG_DBL uint64_t
-# define DECDIG_DBL_SIGNED int64_t
-# define SIZEOF_DECDIG 4
-# define PRI_DECDIG_PREFIX ""
-# ifdef PRI_LL_PREFIX
-# define PRI_DECDIG_DBL_PREFIX PRI_LL_PREFIX
-# else
-# define PRI_DECDIG_DBL_PREFIX "l"
-# endif
-#else
-# define DECDIG uint16_t
-# define DECDIG_DBL uint32_t
-# define DECDIG_DBL_SIGNED int32_t
-# define SIZEOF_DECDIG 2
-# define PRI_DECDIG_PREFIX "h"
-# define PRI_DECDIG_DBL_PREFIX ""
-#endif
-
-#define PRIdDECDIG PRI_DECDIG_PREFIX"d"
-#define PRIiDECDIG PRI_DECDIG_PREFIX"i"
-#define PRIoDECDIG PRI_DECDIG_PREFIX"o"
-#define PRIuDECDIG PRI_DECDIG_PREFIX"u"
-#define PRIxDECDIG PRI_DECDIG_PREFIX"x"
-#define PRIXDECDIG PRI_DECDIG_PREFIX"X"
-
-#define PRIdDECDIG_DBL PRI_DECDIG_DBL_PREFIX"d"
-#define PRIiDECDIG_DBL PRI_DECDIG_DBL_PREFIX"i"
-#define PRIoDECDIG_DBL PRI_DECDIG_DBL_PREFIX"o"
-#define PRIuDECDIG_DBL PRI_DECDIG_DBL_PREFIX"u"
-#define PRIxDECDIG_DBL PRI_DECDIG_DBL_PREFIX"x"
-#define PRIXDECDIG_DBL PRI_DECDIG_DBL_PREFIX"X"
-
-#if SIZEOF_DECDIG == 4
-# define BIGDECIMAL_BASE ((DECDIG)1000000000U)
-# define BIGDECIMAL_COMPONENT_FIGURES 9
-/*
- * The number of components required for a 64-bit integer.
- *
- * INT64_MAX: 9_223372036_854775807
- * UINT64_MAX: 18_446744073_709551615
- */
-# define BIGDECIMAL_INT64_MAX_LENGTH 3
-
-#elif SIZEOF_DECDIG == 2
-# define BIGDECIMAL_BASE ((DECDIG)10000U)
-# define BIGDECIMAL_COMPONENT_FIGURES 4
-/*
- * The number of components required for a 64-bit integer.
- *
- * INT64_MAX: 922_3372_0368_5477_5807
- * UINT64_MAX: 1844_6744_0737_0955_1615
- */
-# define BIGDECIMAL_INT64_MAX_LENGTH 5
-
-#else
-# error Unknown size of DECDIG
-#endif
-
-#define BIGDECIMAL_DOUBLE_FIGURES (1+DBL_DIG)
-
-#if defined(__cplusplus)
-extern "C" {
-#if 0
-} /* satisfy cc-mode */
-#endif
-#endif
-
-extern VALUE rb_cBigDecimal;
-
-/*
- * NaN & Infinity
- */
-#define SZ_NaN "NaN"
-#define SZ_INF "Infinity"
-#define SZ_PINF "+Infinity"
-#define SZ_NINF "-Infinity"
-
-/*
- * #define VP_EXPORT other than static to let VP_ routines
- * be called from outside of this module.
- */
-#define VP_EXPORT static
-
-/* Exception mode */
-#define VP_EXCEPTION_ALL ((unsigned short)0x00FF)
-#define VP_EXCEPTION_INFINITY ((unsigned short)0x0001)
-#define VP_EXCEPTION_NaN ((unsigned short)0x0002)
-#define VP_EXCEPTION_UNDERFLOW ((unsigned short)0x0004)
-#define VP_EXCEPTION_OVERFLOW ((unsigned short)0x0001) /* 0x0008) */
-#define VP_EXCEPTION_ZERODIVIDE ((unsigned short)0x0010)
-
-/* Following 2 exceptions can't controlled by user */
-#define VP_EXCEPTION_OP ((unsigned short)0x0020)
-
-#define BIGDECIMAL_EXCEPTION_MODE_DEFAULT 0U
-
-/* This is used in BigDecimal#mode */
-#define VP_ROUND_MODE ((unsigned short)0x0100)
-
-/* Rounding mode */
-#define VP_ROUND_UP RBD_ROUND_UP
-#define VP_ROUND_DOWN RBD_ROUND_DOWN
-#define VP_ROUND_HALF_UP RBD_ROUND_HALF_UP
-#define VP_ROUND_HALF_DOWN RBD_ROUND_HALF_DOWN
-#define VP_ROUND_CEIL RBD_ROUND_CEIL
-#define VP_ROUND_FLOOR RBD_ROUND_FLOOR
-#define VP_ROUND_HALF_EVEN RBD_ROUND_HALF_EVEN
-
-enum rbd_rounding_mode {
- RBD_ROUND_UP = 1,
- RBD_ROUND_DOWN = 2,
- RBD_ROUND_HALF_UP = 3,
- RBD_ROUND_HALF_DOWN = 4,
- RBD_ROUND_CEIL = 5,
- RBD_ROUND_FLOOR = 6,
- RBD_ROUND_HALF_EVEN = 7,
-
- RBD_ROUND_DEFAULT = RBD_ROUND_HALF_UP,
- RBD_ROUND_TRUNCATE = RBD_ROUND_DOWN,
- RBD_ROUND_BANKER = RBD_ROUND_HALF_EVEN,
- RBD_ROUND_CEILING = RBD_ROUND_CEIL
-};
-
-#define BIGDECIMAL_ROUNDING_MODE_DEFAULT VP_ROUND_HALF_UP
-
-/* Sign flag */
-#define VP_SIGN_NaN 0 /* NaN */
-#define VP_SIGN_POSITIVE_ZERO 1 /* Positive zero */
-#define VP_SIGN_NEGATIVE_ZERO -1 /* Negative zero */
-#define VP_SIGN_POSITIVE_FINITE 2 /* Positive finite number */
-#define VP_SIGN_NEGATIVE_FINITE -2 /* Negative finite number */
-#define VP_SIGN_POSITIVE_INFINITE 3 /* Positive infinite number */
-#define VP_SIGN_NEGATIVE_INFINITE -3 /* Negative infinite number */
-
-/* The size of fraction part array */
-#if defined(__STDC_VERSION__) && (__STDC_VERSION__ >= 199901L)
-#define FLEXIBLE_ARRAY_SIZE /* */
-#elif defined(__GNUC__) && !defined(__STRICT_ANSI__)
-#define FLEXIBLE_ARRAY_SIZE 0
-#else
-#define FLEXIBLE_ARRAY_SIZE 1
-#endif
-
-/*
- * VP representation
- * r = 0.xxxxxxxxx *BASE**exponent
- */
-typedef struct {
- VALUE obj; /* Back pointer(VALUE) for Ruby object. */
- size_t MaxPrec; /* Maximum precision size */
- /* This is the actual size of frac[] */
- /*(frac[0] to frac[MaxPrec] are available). */
- size_t Prec; /* Current precision size. */
- /* This indicates how much the */
- /* array frac[] is actually used. */
- SIGNED_VALUE exponent; /* Exponent part. */
- short sign; /* Attributes of the value. */
- /*
- * ==0 : NaN
- * 1 : Positive zero
- * -1 : Negative zero
- * 2 : Positive number
- * -2 : Negative number
- * 3 : Positive infinite number
- * -3 : Negative infinite number
- */
- short flag; /* Not used in vp_routines,space for user. */
- DECDIG frac[FLEXIBLE_ARRAY_SIZE]; /* Array of fraction part. */
-} Real;
-
-/*
- * ------------------
- * EXPORTables.
- * ------------------
- */
-
-VP_EXPORT Real *VpNewRbClass(size_t mx, char const *str, VALUE klass, bool strict_p, bool raise_exception);
-
-VP_EXPORT Real *VpCreateRbObject(size_t mx, const char *str, bool raise_exception);
-
-#define VpBaseFig() BIGDECIMAL_COMPONENT_FIGURES
-#define VpDblFig() BIGDECIMAL_DOUBLE_FIGURES
-#define VpBaseVal() BIGDECIMAL_BASE
-
-/* Zero,Inf,NaN (isinf(),isnan() used to check) */
-VP_EXPORT double VpGetDoubleNaN(void);
-VP_EXPORT double VpGetDoublePosInf(void);
-VP_EXPORT double VpGetDoubleNegInf(void);
-VP_EXPORT double VpGetDoubleNegZero(void);
-
-/* These 2 functions added at v1.1.7 */
-VP_EXPORT size_t VpGetPrecLimit(void);
-VP_EXPORT size_t VpSetPrecLimit(size_t n);
-
-/* Round mode */
-VP_EXPORT int VpIsRoundMode(unsigned short n);
-VP_EXPORT unsigned short VpGetRoundMode(void);
-VP_EXPORT unsigned short VpSetRoundMode(unsigned short n);
-
-VP_EXPORT int VpException(unsigned short f,const char *str,int always);
-#if 0 /* unused */
-VP_EXPORT int VpIsNegDoubleZero(double v);
-#endif
-VP_EXPORT size_t VpNumOfChars(Real *vp,const char *pszFmt);
-VP_EXPORT size_t VpInit(DECDIG BaseVal);
-VP_EXPORT Real *VpAlloc(size_t mx, const char *szVal, int strict_p, int exc);
-VP_EXPORT size_t VpAsgn(Real *c, Real *a, int isw);
-VP_EXPORT size_t VpAddSub(Real *c,Real *a,Real *b,int operation);
-VP_EXPORT size_t VpMult(Real *c,Real *a,Real *b);
-VP_EXPORT size_t VpDivd(Real *c,Real *r,Real *a,Real *b);
-VP_EXPORT int VpComp(Real *a,Real *b);
-VP_EXPORT ssize_t VpExponent10(Real *a);
-VP_EXPORT void VpSzMantissa(Real *a, char *buf, size_t bufsize);
-VP_EXPORT int VpToSpecialString(Real *a, char *buf, size_t bufsize, int fPlus);
-VP_EXPORT void VpToString(Real *a, char *buf, size_t bufsize, size_t fFmt, int fPlus);
-VP_EXPORT void VpToFString(Real *a, char *buf, size_t bufsize, size_t fFmt, int fPlus);
-VP_EXPORT int VpCtoV(Real *a, const char *int_chr, size_t ni, const char *frac, size_t nf, const char *exp_chr, size_t ne);
-VP_EXPORT int VpVtoD(double *d, SIGNED_VALUE *e, Real *m);
-VP_EXPORT void VpDtoV(Real *m,double d);
-#if 0 /* unused */
-VP_EXPORT void VpItoV(Real *m,S_INT ival);
-#endif
-VP_EXPORT int VpSqrt(Real *y,Real *x);
-VP_EXPORT int VpActiveRound(Real *y, Real *x, unsigned short f, ssize_t il);
-VP_EXPORT int VpMidRound(Real *y, unsigned short f, ssize_t nf);
-VP_EXPORT int VpLeftRound(Real *y, unsigned short f, ssize_t nf);
-VP_EXPORT void VpFrac(Real *y, Real *x);
-VP_EXPORT int VpPowerByInt(Real *y, Real *x, SIGNED_VALUE n);
-#define VpPower VpPowerByInt
-
-/* VP constants */
-VP_EXPORT Real *VpOne(void);
-
-/*
- * ------------------
- * MACRO definitions.
- * ------------------
- */
-#define Abs(a) (((a)>= 0)?(a):(-(a)))
-#define Max(a, b) (((a)>(b))?(a):(b))
-#define Min(a, b) (((a)>(b))?(b):(a))
-
-#define VpMaxPrec(a) ((a)->MaxPrec)
-#define VpPrec(a) ((a)->Prec)
-#define VpGetFlag(a) ((a)->flag)
-
-/* Sign */
-
-/* VpGetSign(a) returns 1,-1 if a>0,a<0 respectively */
-#define VpGetSign(a) (((a)->sign>0)?1:(-1))
-/* Change sign of a to a>0,a<0 if s = 1,-1 respectively */
-#define VpChangeSign(a,s) {if((s)>0) (a)->sign=(short)Abs((ssize_t)(a)->sign);else (a)->sign=-(short)Abs((ssize_t)(a)->sign);}
-/* Sets sign of a to a>0,a<0 if s = 1,-1 respectively */
-#define VpSetSign(a,s) {if((s)>0) (a)->sign=(short)VP_SIGN_POSITIVE_FINITE;else (a)->sign=(short)VP_SIGN_NEGATIVE_FINITE;}
-
-/* 1 */
-#define VpSetOne(a) {(a)->Prec=(a)->exponent=(a)->frac[0]=1;(a)->sign=VP_SIGN_POSITIVE_FINITE;}
-
-/* ZEROs */
-#define VpIsPosZero(a) ((a)->sign==VP_SIGN_POSITIVE_ZERO)
-#define VpIsNegZero(a) ((a)->sign==VP_SIGN_NEGATIVE_ZERO)
-#define VpIsZero(a) (VpIsPosZero(a) || VpIsNegZero(a))
-#define VpSetPosZero(a) ((a)->frac[0]=0,(a)->Prec=1,(a)->sign=VP_SIGN_POSITIVE_ZERO)
-#define VpSetNegZero(a) ((a)->frac[0]=0,(a)->Prec=1,(a)->sign=VP_SIGN_NEGATIVE_ZERO)
-#define VpSetZero(a,s) (void)(((s)>0)?VpSetPosZero(a):VpSetNegZero(a))
-
-/* NaN */
-#define VpIsNaN(a) ((a)->sign==VP_SIGN_NaN)
-#define VpSetNaN(a) ((a)->frac[0]=0,(a)->Prec=1,(a)->sign=VP_SIGN_NaN)
-
-/* Infinity */
-#define VpIsPosInf(a) ((a)->sign==VP_SIGN_POSITIVE_INFINITE)
-#define VpIsNegInf(a) ((a)->sign==VP_SIGN_NEGATIVE_INFINITE)
-#define VpIsInf(a) (VpIsPosInf(a) || VpIsNegInf(a))
-#define VpIsDef(a) ( !(VpIsNaN(a)||VpIsInf(a)) )
-#define VpSetPosInf(a) ((a)->frac[0]=0,(a)->Prec=1,(a)->sign=VP_SIGN_POSITIVE_INFINITE)
-#define VpSetNegInf(a) ((a)->frac[0]=0,(a)->Prec=1,(a)->sign=VP_SIGN_NEGATIVE_INFINITE)
-#define VpSetInf(a,s) (void)(((s)>0)?VpSetPosInf(a):VpSetNegInf(a))
-#define VpHasVal(a) (a->frac[0])
-#define VpIsOne(a) ((a->Prec==1)&&(a->frac[0]==1)&&(a->exponent==1))
-#define VpExponent(a) (a->exponent)
-#ifdef BIGDECIMAL_DEBUG
-int VpVarCheck(Real * v);
-#endif /* BIGDECIMAL_DEBUG */
-
-#if defined(__cplusplus)
-#if 0
-{ /* satisfy cc-mode */
-#endif
-} /* extern "C" { */
-#endif
-#endif /* RUBY_BIG_DECIMAL_H */
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.o b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.o
deleted file mode 100644
index 9497337..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bigdecimal.o and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bits.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bits.h
deleted file mode 100644
index 6e1e477..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/bits.h
+++ /dev/null
@@ -1,141 +0,0 @@
-#ifndef BIGDECIMAL_BITS_H
-#define BIGDECIMAL_BITS_H
-
-#include "feature.h"
-#include "static_assert.h"
-
-#if defined(__x86_64__) && defined(HAVE_X86INTRIN_H)
-# include /* for _lzcnt_u64, etc. */
-#elif defined(_MSC_VER) && defined(HAVE_INTRIN_H)
-# include /* for the following intrinsics */
-#endif
-
-#if defined(_MSC_VER) && defined(__AVX2__)
-# pragma intrinsic(__lzcnt)
-# pragma intrinsic(__lzcnt64)
-#endif
-
-#define numberof(array) ((int)(sizeof(array) / sizeof((array)[0])))
-#define roomof(x, y) (((x) + (y) - 1) / (y))
-#define type_roomof(x, y) roomof(sizeof(x), sizeof(y))
-
-#define MUL_OVERFLOW_SIGNED_INTEGER_P(a, b, min, max) ( \
- (a) == 0 ? 0 : \
- (a) == -1 ? (b) < -(max) : \
- (a) > 0 ? \
- ((b) > 0 ? (max) / (a) < (b) : (min) / (a) > (b)) : \
- ((b) > 0 ? (min) / (a) < (b) : (max) / (a) > (b)))
-
-#ifdef HAVE_UINT128_T
-# define bit_length(x) \
- (unsigned int) \
- (sizeof(x) <= sizeof(int32_t) ? 32 - nlz_int32((uint32_t)(x)) : \
- sizeof(x) <= sizeof(int64_t) ? 64 - nlz_int64((uint64_t)(x)) : \
- 128 - nlz_int128((uint128_t)(x)))
-#else
-# define bit_length(x) \
- (unsigned int) \
- (sizeof(x) <= sizeof(int32_t) ? 32 - nlz_int32((uint32_t)(x)) : \
- 64 - nlz_int64((uint64_t)(x)))
-#endif
-
-static inline unsigned nlz_int32(uint32_t x);
-static inline unsigned nlz_int64(uint64_t x);
-#ifdef HAVE_UINT128_T
-static inline unsigned nlz_int128(uint128_t x);
-#endif
-
-static inline unsigned int
-nlz_int32(uint32_t x)
-{
-#if defined(_MSC_VER) && defined(__AVX2__) && defined(HAVE___LZCNT)
- /* Note: It seems there is no such thing like __LZCNT__ predefined in MSVC.
- * AMD CPUs have had this instruction for decades (since K10) but for
- * Intel, Haswell is the oldest one. We need to use __AVX2__ for maximum
- * safety. */
- return (unsigned int)__lzcnt(x);
-
-#elif defined(__x86_64__) && defined(__LZCNT__) && defined(HAVE__LZCNT_U32)
- return (unsigned int)_lzcnt_u32(x);
-
-#elif defined(_MSC_VER) && defined(HAVE__BITSCANREVERSE)
- unsigned long r;
- return _BitScanReverse(&r, x) ? (31 - (int)r) : 32;
-
-#elif __has_builtin(__builtin_clz)
- STATIC_ASSERT(sizeof_int, sizeof(int) * CHAR_BIT == 32);
- return x ? (unsigned int)__builtin_clz(x) : 32;
-
-#else
- uint32_t y;
- unsigned n = 32;
- y = x >> 16; if (y) {n -= 16; x = y;}
- y = x >> 8; if (y) {n -= 8; x = y;}
- y = x >> 4; if (y) {n -= 4; x = y;}
- y = x >> 2; if (y) {n -= 2; x = y;}
- y = x >> 1; if (y) {return n - 2;}
- return (unsigned int)(n - x);
-#endif
-}
-
-static inline unsigned int
-nlz_int64(uint64_t x)
-{
-#if defined(_MSC_VER) && defined(__AVX2__) && defined(HAVE___LZCNT64)
- return (unsigned int)__lzcnt64(x);
-
-#elif defined(__x86_64__) && defined(__LZCNT__) && defined(HAVE__LZCNT_U64)
- return (unsigned int)_lzcnt_u64(x);
-
-#elif defined(_WIN64) && defined(_MSC_VER) && defined(HAVE__BITSCANREVERSE64)
- unsigned long r;
- return _BitScanReverse64(&r, x) ? (63u - (unsigned int)r) : 64;
-
-#elif __has_builtin(__builtin_clzl) && __has_builtin(__builtin_clzll) && !(defined(__sun) && defined(__sparc))
- if (x == 0) {
- return 64;
- }
- else if (sizeof(long) * CHAR_BIT == 64) {
- return (unsigned int)__builtin_clzl((unsigned long)x);
- }
- else if (sizeof(long long) * CHAR_BIT == 64) {
- return (unsigned int)__builtin_clzll((unsigned long long)x);
- }
- else {
- /* :FIXME: Is there a way to make this branch a compile-time error? */
- __builtin_unreachable();
- }
-
-#else
- uint64_t y;
- unsigned int n = 64;
- y = x >> 32; if (y) {n -= 32; x = y;}
- y = x >> 16; if (y) {n -= 16; x = y;}
- y = x >> 8; if (y) {n -= 8; x = y;}
- y = x >> 4; if (y) {n -= 4; x = y;}
- y = x >> 2; if (y) {n -= 2; x = y;}
- y = x >> 1; if (y) {return n - 2;}
- return (unsigned int)(n - x);
-
-#endif
-}
-
-#ifdef HAVE_UINT128_T
-static inline unsigned int
-nlz_int128(uint128_t x)
-{
- uint64_t y = (uint64_t)(x >> 64);
-
- if (x == 0) {
- return 128;
- }
- else if (y == 0) {
- return (unsigned int)nlz_int64(x) + 64;
- }
- else {
- return (unsigned int)nlz_int64(y);
- }
-}
-#endif
-
-#endif /* BIGDECIMAL_BITS_H */
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/extconf.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/extconf.rb
deleted file mode 100644
index 23904ed..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/extconf.rb
+++ /dev/null
@@ -1,62 +0,0 @@
-# frozen_string_literal: false
-require 'mkmf'
-
-def have_builtin_func(name, check_expr, opt = "", &b)
- checking_for checking_message(name.funcall_style, nil, opt) do
- if try_compile(<
-#endif
-
-#ifdef RBIMPL_HAS_BUILTIN
-# define BIGDECIMAL_HAS_BUILTIN(...) RBIMPL_HAS_BUILTIN(__VA_ARGS__)
-
-#else
-# /* The following section is copied from CRuby's builtin.h */
-#
-# ifdef __has_builtin
-# if defined(__INTEL_COMPILER)
-# /* :TODO: Intel C Compiler has __has_builtin (since 19.1 maybe?), and is
-# * reportedly broken. We have to skip them. However the situation can
-# * change. They might improve someday. We need to revisit here later. */
-# elif defined(__GNUC__) && ! __has_builtin(__builtin_alloca)
-# /* FreeBSD's defines its own *broken* version of
-# * __has_builtin. Cygwin copied that content to be a victim of the
-# * broken-ness. We don't take them into account. */
-# else
-# define HAVE___HAS_BUILTIN 1
-# endif
-# endif
-#
-# if defined(HAVE___HAS_BUILTIN)
-# define BIGDECIMAL_HAS_BUILTIN(_) __has_builtin(_)
-#
-# elif defined(__GNUC__)
-# define BIGDECIMAL_HAS_BUILTIN(_) BIGDECIMAL_HAS_BUILTIN_ ## _
-# if defined(__GNUC__) && (__GNUC__ > 3 || (__GNUC__ == 3 && __GNUC_MINOR__ >= 6))
-# define BIGDECIMAL_HAS_BUILTIN___builtin_clz 1
-# define BIGDECIMAL_HAS_BUILTIN___builtin_clzl 1
-# else
-# define BIGDECIMAL_HAS_BUILTIN___builtin_clz 0
-# define BIGDECIMAL_HAS_BUILTIN___builtin_clzl 0
-# endif
-# elif defined(_MSC_VER)
-# define BIGDECIMAL_HAS_BUILTIN(_) 0
-#
-# else
-# define BIGDECIMAL_HAS_BUILTIN(_) BIGDECIMAL_HAS_BUILTIN_ ## _
-# define BIGDECIMAL_HAS_BUILTIN___builtin_clz HAVE_BUILTIN___BUILTIN_CLZ
-# define BIGDECIMAL_HAS_BUILTIN___builtin_clzl HAVE_BUILTIN___BUILTIN_CLZL
-# endif
-#endif /* RBIMPL_HAS_BUILTIN */
-
-#ifndef __has_builtin
-# define __has_builtin(...) BIGDECIMAL_HAS_BUILTIN(__VA_ARGS__)
-#endif
-
-#endif /* BIGDECIMAL_HAS_FEATURE_H */
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.c b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.c
deleted file mode 100644
index 703232d..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.c
+++ /dev/null
@@ -1,27 +0,0 @@
-#include
-
-#ifdef HAVE_RUBY_ATOMIC_H
-# include
-#endif
-
-#ifdef RUBY_ATOMIC_PTR_CAS
-# define ATOMIC_PTR_CAS(var, old, new) RUBY_ATOMIC_PTR_CAS(var, old, new)
-#endif
-
-#if defined(__GNUC__) && (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6))
-/* GCC warns about unknown sanitizer, which is annoying. */
-# undef NO_SANITIZE
-# define NO_SANITIZE(x, y) \
- _Pragma("GCC diagnostic push") \
- _Pragma("GCC diagnostic ignored \"-Wattributes\"") \
- __attribute__((__no_sanitize__(x))) y; \
- _Pragma("GCC diagnostic pop")
-#endif
-
-#undef strtod
-#define strtod BigDecimal_strtod
-#undef dtoa
-#define dtoa BigDecimal_dtoa
-#undef hdtoa
-#define hdtoa BigDecimal_hdtoa
-#include "missing/dtoa.c"
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.h
deleted file mode 100644
index 325554b..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.h
+++ /dev/null
@@ -1,196 +0,0 @@
-#ifndef MISSING_H
-#define MISSING_H 1
-
-#if defined(__cplusplus)
-extern "C" {
-#if 0
-} /* satisfy cc-mode */
-#endif
-#endif
-
-#ifdef HAVE_STDLIB_H
-# include
-#endif
-
-#ifdef HAVE_MATH_H
-# include
-#endif
-
-#ifndef RB_UNUSED_VAR
-# if defined(_MSC_VER) && _MSC_VER >= 1911
-# define RB_UNUSED_VAR(x) x [[maybe_unused]]
-
-# elif defined(__has_cpp_attribute) && __has_cpp_attribute(maybe_unused)
-# define RB_UNUSED_VAR(x) x [[maybe_unused]]
-
-# elif defined(__has_c_attribute) && __has_c_attribute(maybe_unused)
-# define RB_UNUSED_VAR(x) x [[maybe_unused]]
-
-# elif defined(__GNUC__)
-# define RB_UNUSED_VAR(x) x __attribute__ ((unused))
-
-# else
-# define RB_UNUSED_VAR(x) x
-# endif
-#endif /* RB_UNUSED_VAR */
-
-#if defined(_MSC_VER) && _MSC_VER >= 1310
-# define HAVE___ASSUME 1
-
-#elif defined(__INTEL_COMPILER) && __INTEL_COMPILER >= 1300
-# define HAVE___ASSUME 1
-#endif
-
-#ifndef UNREACHABLE
-# if __has_builtin(__builtin_unreachable)
-# define UNREACHABLE __builtin_unreachable()
-
-# elif defined(HAVE___ASSUME)
-# define UNREACHABLE __assume(0)
-
-# else
-# define UNREACHABLE /* unreachable */
-# endif
-#endif /* UNREACHABLE */
-
-/* bool */
-
-#if defined(__bool_true_false_are_defined)
-# /* Take that. */
-
-#elif defined(HAVE_STDBOOL_H)
-# include
-
-#else
-typedef unsigned char _Bool;
-# define bool _Bool
-# define true ((_Bool)+1)
-# define false ((_Bool)-1)
-# define __bool_true_false_are_defined
-#endif
-
-/* abs */
-
-#ifndef HAVE_LABS
-static inline long
-labs(long const x)
-{
- if (x < 0) return -x;
- return x;
-}
-#endif
-
-#ifndef HAVE_LLABS
-static inline LONG_LONG
-llabs(LONG_LONG const x)
-{
- if (x < 0) return -x;
- return x;
-}
-#endif
-
-#ifdef vabs
-# undef vabs
-#endif
-#if SIZEOF_VALUE <= SIZEOF_INT
-# define vabs abs
-#elif SIZEOF_VALUE <= SIZEOF_LONG
-# define vabs labs
-#elif SIZEOF_VALUE <= SIZEOF_LONG_LONG
-# define vabs llabs
-#endif
-
-/* finite */
-
-#ifndef HAVE_FINITE
-static int
-finite(double)
-{
- return !isnan(n) && !isinf(n);
-}
-#endif
-
-#ifndef isfinite
-# ifndef HAVE_ISFINITE
-# define HAVE_ISFINITE 1
-# define isfinite(x) finite(x)
-# endif
-#endif
-
-/* dtoa */
-char *BigDecimal_dtoa(double d_, int mode, int ndigits, int *decpt, int *sign, char **rve);
-
-/* rational */
-
-#ifndef HAVE_RB_RATIONAL_NUM
-static inline VALUE
-rb_rational_num(VALUE rat)
-{
-#ifdef RRATIONAL
- return RRATIONAL(rat)->num;
-#else
- return rb_funcall(rat, rb_intern("numerator"), 0);
-#endif
-}
-#endif
-
-#ifndef HAVE_RB_RATIONAL_DEN
-static inline VALUE
-rb_rational_den(VALUE rat)
-{
-#ifdef RRATIONAL
- return RRATIONAL(rat)->den;
-#else
- return rb_funcall(rat, rb_intern("denominator"), 0);
-#endif
-}
-#endif
-
-/* complex */
-
-#ifndef HAVE_RB_COMPLEX_REAL
-static inline VALUE
-rb_complex_real(VALUE cmp)
-{
-#ifdef RCOMPLEX
- return RCOMPLEX(cmp)->real;
-#else
- return rb_funcall(cmp, rb_intern("real"), 0);
-#endif
-}
-#endif
-
-#ifndef HAVE_RB_COMPLEX_IMAG
-static inline VALUE
-rb_complex_imag(VALUE cmp)
-{
-# ifdef RCOMPLEX
- return RCOMPLEX(cmp)->imag;
-# else
- return rb_funcall(cmp, rb_intern("imag"), 0);
-# endif
-}
-#endif
-
-/* st */
-
-#ifndef ST2FIX
-# undef RB_ST2FIX
-# define RB_ST2FIX(h) LONG2FIX((long)(h))
-# define ST2FIX(h) RB_ST2FIX(h)
-#endif
-
-/* warning */
-
-#if !defined(HAVE_RB_CATEGORY_WARN) || !defined(HAVE_CONST_RB_WARN_CATEGORY_DEPRECATED)
-# define rb_category_warn(category, ...) rb_warn(__VA_ARGS__)
-#endif
-
-#if defined(__cplusplus)
-#if 0
-{ /* satisfy cc-mode */
-#endif
-} /* extern "C" { */
-#endif
-
-#endif /* MISSING_H */
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.o b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.o
deleted file mode 100644
index 27b36a1..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing.o and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing/dtoa.c b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing/dtoa.c
deleted file mode 100644
index 41b0a22..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/missing/dtoa.c
+++ /dev/null
@@ -1,3462 +0,0 @@
-/****************************************************************
- *
- * The author of this software is David M. Gay.
- *
- * Copyright (c) 1991, 2000, 2001 by Lucent Technologies.
- *
- * Permission to use, copy, modify, and distribute this software for any
- * purpose without fee is hereby granted, provided that this entire notice
- * is included in all copies of any software which is or includes a copy
- * or modification of this software and in all copies of the supporting
- * documentation for such software.
- *
- * THIS SOFTWARE IS BEING PROVIDED "AS IS", WITHOUT ANY EXPRESS OR IMPLIED
- * WARRANTY. IN PARTICULAR, NEITHER THE AUTHOR NOR LUCENT MAKES ANY
- * REPRESENTATION OR WARRANTY OF ANY KIND CONCERNING THE MERCHANTABILITY
- * OF THIS SOFTWARE OR ITS FITNESS FOR ANY PARTICULAR PURPOSE.
- *
- ***************************************************************/
-
-/* Please send bug reports to David M. Gay (dmg at acm dot org,
- * with " at " changed at "@" and " dot " changed to "."). */
-
-/* On a machine with IEEE extended-precision registers, it is
- * necessary to specify double-precision (53-bit) rounding precision
- * before invoking strtod or dtoa. If the machine uses (the equivalent
- * of) Intel 80x87 arithmetic, the call
- * _control87(PC_53, MCW_PC);
- * does this with many compilers. Whether this or another call is
- * appropriate depends on the compiler; for this to work, it may be
- * necessary to #include "float.h" or another system-dependent header
- * file.
- */
-
-/* strtod for IEEE-, VAX-, and IBM-arithmetic machines.
- *
- * This strtod returns a nearest machine number to the input decimal
- * string (or sets errno to ERANGE). With IEEE arithmetic, ties are
- * broken by the IEEE round-even rule. Otherwise ties are broken by
- * biased rounding (add half and chop).
- *
- * Inspired loosely by William D. Clinger's paper "How to Read Floating
- * Point Numbers Accurately" [Proc. ACM SIGPLAN '90, pp. 92-101].
- *
- * Modifications:
- *
- * 1. We only require IEEE, IBM, or VAX double-precision
- * arithmetic (not IEEE double-extended).
- * 2. We get by with floating-point arithmetic in a case that
- * Clinger missed -- when we're computing d * 10^n
- * for a small integer d and the integer n is not too
- * much larger than 22 (the maximum integer k for which
- * we can represent 10^k exactly), we may be able to
- * compute (d*10^k) * 10^(e-k) with just one roundoff.
- * 3. Rather than a bit-at-a-time adjustment of the binary
- * result in the hard case, we use floating-point
- * arithmetic to determine the adjustment to within
- * one bit; only in really hard cases do we need to
- * compute a second residual.
- * 4. Because of 3., we don't need a large table of powers of 10
- * for ten-to-e (just some small tables, e.g. of 10^k
- * for 0 <= k <= 22).
- */
-
-/*
- * #define IEEE_LITTLE_ENDIAN for IEEE-arithmetic machines where the least
- * significant byte has the lowest address.
- * #define IEEE_BIG_ENDIAN for IEEE-arithmetic machines where the most
- * significant byte has the lowest address.
- * #define Long int on machines with 32-bit ints and 64-bit longs.
- * #define IBM for IBM mainframe-style floating-point arithmetic.
- * #define VAX for VAX-style floating-point arithmetic (D_floating).
- * #define No_leftright to omit left-right logic in fast floating-point
- * computation of dtoa.
- * #define Honor_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3
- * and strtod and dtoa should round accordingly.
- * #define Check_FLT_ROUNDS if FLT_ROUNDS can assume the values 2 or 3
- * and Honor_FLT_ROUNDS is not #defined.
- * #define RND_PRODQUOT to use rnd_prod and rnd_quot (assembly routines
- * that use extended-precision instructions to compute rounded
- * products and quotients) with IBM.
- * #define ROUND_BIASED for IEEE-format with biased rounding.
- * #define Inaccurate_Divide for IEEE-format with correctly rounded
- * products but inaccurate quotients, e.g., for Intel i860.
- * #define NO_LONG_LONG on machines that do not have a "long long"
- * integer type (of >= 64 bits). On such machines, you can
- * #define Just_16 to store 16 bits per 32-bit Long when doing
- * high-precision integer arithmetic. Whether this speeds things
- * up or slows things down depends on the machine and the number
- * being converted. If long long is available and the name is
- * something other than "long long", #define Llong to be the name,
- * and if "unsigned Llong" does not work as an unsigned version of
- * Llong, #define #ULLong to be the corresponding unsigned type.
- * #define KR_headers for old-style C function headers.
- * #define Bad_float_h if your system lacks a float.h or if it does not
- * define some or all of DBL_DIG, DBL_MAX_10_EXP, DBL_MAX_EXP,
- * FLT_RADIX, FLT_ROUNDS, and DBL_MAX.
- * #define MALLOC your_malloc, where your_malloc(n) acts like malloc(n)
- * if memory is available and otherwise does something you deem
- * appropriate. If MALLOC is undefined, malloc will be invoked
- * directly -- and assumed always to succeed.
- * #define Omit_Private_Memory to omit logic (added Jan. 1998) for making
- * memory allocations from a private pool of memory when possible.
- * When used, the private pool is PRIVATE_MEM bytes long: 2304 bytes,
- * unless #defined to be a different length. This default length
- * suffices to get rid of MALLOC calls except for unusual cases,
- * such as decimal-to-binary conversion of a very long string of
- * digits. The longest string dtoa can return is about 751 bytes
- * long. For conversions by strtod of strings of 800 digits and
- * all dtoa conversions in single-threaded executions with 8-byte
- * pointers, PRIVATE_MEM >= 7400 appears to suffice; with 4-byte
- * pointers, PRIVATE_MEM >= 7112 appears adequate.
- * #define INFNAN_CHECK on IEEE systems to cause strtod to check for
- * Infinity and NaN (case insensitively). On some systems (e.g.,
- * some HP systems), it may be necessary to #define NAN_WORD0
- * appropriately -- to the most significant word of a quiet NaN.
- * (On HP Series 700/800 machines, -DNAN_WORD0=0x7ff40000 works.)
- * When INFNAN_CHECK is #defined and No_Hex_NaN is not #defined,
- * strtod also accepts (case insensitively) strings of the form
- * NaN(x), where x is a string of hexadecimal digits and spaces;
- * if there is only one string of hexadecimal digits, it is taken
- * for the 52 fraction bits of the resulting NaN; if there are two
- * or more strings of hex digits, the first is for the high 20 bits,
- * the second and subsequent for the low 32 bits, with intervening
- * white space ignored; but if this results in none of the 52
- * fraction bits being on (an IEEE Infinity symbol), then NAN_WORD0
- * and NAN_WORD1 are used instead.
- * #define MULTIPLE_THREADS if the system offers preemptively scheduled
- * multiple threads. In this case, you must provide (or suitably
- * #define) two locks, acquired by ACQUIRE_DTOA_LOCK(n) and freed
- * by FREE_DTOA_LOCK(n) for n = 0 or 1. (The second lock, accessed
- * in pow5mult, ensures lazy evaluation of only one copy of high
- * powers of 5; omitting this lock would introduce a small
- * probability of wasting memory, but would otherwise be harmless.)
- * You must also invoke freedtoa(s) to free the value s returned by
- * dtoa. You may do so whether or not MULTIPLE_THREADS is #defined.
- * #define NO_IEEE_Scale to disable new (Feb. 1997) logic in strtod that
- * avoids underflows on inputs whose result does not underflow.
- * If you #define NO_IEEE_Scale on a machine that uses IEEE-format
- * floating-point numbers and flushes underflows to zero rather
- * than implementing gradual underflow, then you must also #define
- * Sudden_Underflow.
- * #define YES_ALIAS to permit aliasing certain double values with
- * arrays of ULongs. This leads to slightly better code with
- * some compilers and was always used prior to 19990916, but it
- * is not strictly legal and can cause trouble with aggressively
- * optimizing compilers (e.g., gcc 2.95.1 under -O2).
- * #define USE_LOCALE to use the current locale's decimal_point value.
- * #define SET_INEXACT if IEEE arithmetic is being used and extra
- * computation should be done to set the inexact flag when the
- * result is inexact and avoid setting inexact when the result
- * is exact. In this case, dtoa.c must be compiled in
- * an environment, perhaps provided by #include "dtoa.c" in a
- * suitable wrapper, that defines two functions,
- * int get_inexact(void);
- * void clear_inexact(void);
- * such that get_inexact() returns a nonzero value if the
- * inexact bit is already set, and clear_inexact() sets the
- * inexact bit to 0. When SET_INEXACT is #defined, strtod
- * also does extra computations to set the underflow and overflow
- * flags when appropriate (i.e., when the result is tiny and
- * inexact or when it is a numeric value rounded to +-infinity).
- * #define NO_ERRNO if strtod should not assign errno = ERANGE when
- * the result overflows to +-Infinity or underflows to 0.
- */
-
-#ifdef WORDS_BIGENDIAN
-#define IEEE_BIG_ENDIAN
-#else
-#define IEEE_LITTLE_ENDIAN
-#endif
-
-#ifdef __vax__
-#define VAX
-#undef IEEE_BIG_ENDIAN
-#undef IEEE_LITTLE_ENDIAN
-#endif
-
-#if defined(__arm__) && !defined(__VFP_FP__)
-#define IEEE_BIG_ENDIAN
-#undef IEEE_LITTLE_ENDIAN
-#endif
-
-#undef Long
-#undef ULong
-
-#include
-
-#if (INT_MAX >> 30) && !(INT_MAX >> 31)
-#define Long int
-#define ULong unsigned int
-#elif (LONG_MAX >> 30) && !(LONG_MAX >> 31)
-#define Long long int
-#define ULong unsigned long int
-#else
-#error No 32bit integer
-#endif
-
-#if HAVE_LONG_LONG
-#define Llong LONG_LONG
-#else
-#define NO_LONG_LONG
-#endif
-
-#ifdef DEBUG
-#include
-#define Bug(x) {fprintf(stderr, "%s\n", (x)); exit(EXIT_FAILURE);}
-#endif
-
-#ifndef ISDIGIT
-#include
-#define ISDIGIT(c) isdigit(c)
-#endif
-#include
-#include
-#include
-
-#ifdef USE_LOCALE
-#include
-#endif
-
-#ifdef MALLOC
-extern void *MALLOC(size_t);
-#else
-#define MALLOC xmalloc
-#endif
-#ifdef FREE
-extern void FREE(void*);
-#else
-#define FREE xfree
-#endif
-#ifndef NO_SANITIZE
-#define NO_SANITIZE(x, y) y
-#endif
-
-#ifndef Omit_Private_Memory
-#ifndef PRIVATE_MEM
-#define PRIVATE_MEM 2304
-#endif
-#define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double))
-static double private_mem[PRIVATE_mem], *pmem_next = private_mem;
-#endif
-
-#undef IEEE_Arith
-#undef Avoid_Underflow
-#ifdef IEEE_BIG_ENDIAN
-#define IEEE_Arith
-#endif
-#ifdef IEEE_LITTLE_ENDIAN
-#define IEEE_Arith
-#endif
-
-#ifdef Bad_float_h
-
-#ifdef IEEE_Arith
-#define DBL_DIG 15
-#define DBL_MAX_10_EXP 308
-#define DBL_MAX_EXP 1024
-#define FLT_RADIX 2
-#endif /*IEEE_Arith*/
-
-#ifdef IBM
-#define DBL_DIG 16
-#define DBL_MAX_10_EXP 75
-#define DBL_MAX_EXP 63
-#define FLT_RADIX 16
-#define DBL_MAX 7.2370055773322621e+75
-#endif
-
-#ifdef VAX
-#define DBL_DIG 16
-#define DBL_MAX_10_EXP 38
-#define DBL_MAX_EXP 127
-#define FLT_RADIX 2
-#define DBL_MAX 1.7014118346046923e+38
-#endif
-
-#ifndef LONG_MAX
-#define LONG_MAX 2147483647
-#endif
-
-#else /* ifndef Bad_float_h */
-#include
-#endif /* Bad_float_h */
-
-#include
-
-#ifdef __cplusplus
-extern "C" {
-#if 0
-} /* satisfy cc-mode */
-#endif
-#endif
-
-#ifndef hexdigit
-static const char hexdigit[] = "0123456789abcdef0123456789ABCDEF";
-#endif
-
-#if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN) + defined(VAX) + defined(IBM) != 1
-Exactly one of IEEE_LITTLE_ENDIAN, IEEE_BIG_ENDIAN, VAX, or IBM should be defined.
-#endif
-
-typedef union { double d; ULong L[2]; } U;
-
-#ifdef YES_ALIAS
-typedef double double_u;
-# define dval(x) (x)
-# ifdef IEEE_LITTLE_ENDIAN
-# define word0(x) (((ULong *)&(x))[1])
-# define word1(x) (((ULong *)&(x))[0])
-# else
-# define word0(x) (((ULong *)&(x))[0])
-# define word1(x) (((ULong *)&(x))[1])
-# endif
-#else
-typedef U double_u;
-# ifdef IEEE_LITTLE_ENDIAN
-# define word0(x) ((x).L[1])
-# define word1(x) ((x).L[0])
-# else
-# define word0(x) ((x).L[0])
-# define word1(x) ((x).L[1])
-# endif
-# define dval(x) ((x).d)
-#endif
-
-/* The following definition of Storeinc is appropriate for MIPS processors.
- * An alternative that might be better on some machines is
- * #define Storeinc(a,b,c) (*a++ = b << 16 | c & 0xffff)
- */
-#if defined(IEEE_LITTLE_ENDIAN) + defined(VAX) + defined(__arm__)
-#define Storeinc(a,b,c) (((unsigned short *)(a))[1] = (unsigned short)(b), \
-((unsigned short *)(a))[0] = (unsigned short)(c), (a)++)
-#else
-#define Storeinc(a,b,c) (((unsigned short *)(a))[0] = (unsigned short)(b), \
-((unsigned short *)(a))[1] = (unsigned short)(c), (a)++)
-#endif
-
-/* #define P DBL_MANT_DIG */
-/* Ten_pmax = floor(P*log(2)/log(5)) */
-/* Bletch = (highest power of 2 < DBL_MAX_10_EXP) / 16 */
-/* Quick_max = floor((P-1)*log(FLT_RADIX)/log(10) - 1) */
-/* Int_max = floor(P*log(FLT_RADIX)/log(10) - 1) */
-
-#ifdef IEEE_Arith
-#define Exp_shift 20
-#define Exp_shift1 20
-#define Exp_msk1 0x100000
-#define Exp_msk11 0x100000
-#define Exp_mask 0x7ff00000
-#define P 53
-#define Bias 1023
-#define Emin (-1022)
-#define Exp_1 0x3ff00000
-#define Exp_11 0x3ff00000
-#define Ebits 11
-#define Frac_mask 0xfffff
-#define Frac_mask1 0xfffff
-#define Ten_pmax 22
-#define Bletch 0x10
-#define Bndry_mask 0xfffff
-#define Bndry_mask1 0xfffff
-#define LSB 1
-#define Sign_bit 0x80000000
-#define Log2P 1
-#define Tiny0 0
-#define Tiny1 1
-#define Quick_max 14
-#define Int_max 14
-#ifndef NO_IEEE_Scale
-#define Avoid_Underflow
-#ifdef Flush_Denorm /* debugging option */
-#undef Sudden_Underflow
-#endif
-#endif
-
-#ifndef Flt_Rounds
-#ifdef FLT_ROUNDS
-#define Flt_Rounds FLT_ROUNDS
-#else
-#define Flt_Rounds 1
-#endif
-#endif /*Flt_Rounds*/
-
-#ifdef Honor_FLT_ROUNDS
-#define Rounding rounding
-#undef Check_FLT_ROUNDS
-#define Check_FLT_ROUNDS
-#else
-#define Rounding Flt_Rounds
-#endif
-
-#else /* ifndef IEEE_Arith */
-#undef Check_FLT_ROUNDS
-#undef Honor_FLT_ROUNDS
-#undef SET_INEXACT
-#undef Sudden_Underflow
-#define Sudden_Underflow
-#ifdef IBM
-#undef Flt_Rounds
-#define Flt_Rounds 0
-#define Exp_shift 24
-#define Exp_shift1 24
-#define Exp_msk1 0x1000000
-#define Exp_msk11 0x1000000
-#define Exp_mask 0x7f000000
-#define P 14
-#define Bias 65
-#define Exp_1 0x41000000
-#define Exp_11 0x41000000
-#define Ebits 8 /* exponent has 7 bits, but 8 is the right value in b2d */
-#define Frac_mask 0xffffff
-#define Frac_mask1 0xffffff
-#define Bletch 4
-#define Ten_pmax 22
-#define Bndry_mask 0xefffff
-#define Bndry_mask1 0xffffff
-#define LSB 1
-#define Sign_bit 0x80000000
-#define Log2P 4
-#define Tiny0 0x100000
-#define Tiny1 0
-#define Quick_max 14
-#define Int_max 15
-#else /* VAX */
-#undef Flt_Rounds
-#define Flt_Rounds 1
-#define Exp_shift 23
-#define Exp_shift1 7
-#define Exp_msk1 0x80
-#define Exp_msk11 0x800000
-#define Exp_mask 0x7f80
-#define P 56
-#define Bias 129
-#define Exp_1 0x40800000
-#define Exp_11 0x4080
-#define Ebits 8
-#define Frac_mask 0x7fffff
-#define Frac_mask1 0xffff007f
-#define Ten_pmax 24
-#define Bletch 2
-#define Bndry_mask 0xffff007f
-#define Bndry_mask1 0xffff007f
-#define LSB 0x10000
-#define Sign_bit 0x8000
-#define Log2P 1
-#define Tiny0 0x80
-#define Tiny1 0
-#define Quick_max 15
-#define Int_max 15
-#endif /* IBM, VAX */
-#endif /* IEEE_Arith */
-
-#ifndef IEEE_Arith
-#define ROUND_BIASED
-#endif
-
-#ifdef RND_PRODQUOT
-#define rounded_product(a,b) ((a) = rnd_prod((a), (b)))
-#define rounded_quotient(a,b) ((a) = rnd_quot((a), (b)))
-extern double rnd_prod(double, double), rnd_quot(double, double);
-#else
-#define rounded_product(a,b) ((a) *= (b))
-#define rounded_quotient(a,b) ((a) /= (b))
-#endif
-
-#define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))
-#define Big1 0xffffffff
-
-#ifndef Pack_32
-#define Pack_32
-#endif
-
-#define FFFFFFFF 0xffffffffUL
-
-#ifdef NO_LONG_LONG
-#undef ULLong
-#ifdef Just_16
-#undef Pack_32
-/* When Pack_32 is not defined, we store 16 bits per 32-bit Long.
- * This makes some inner loops simpler and sometimes saves work
- * during multiplications, but it often seems to make things slightly
- * slower. Hence the default is now to store 32 bits per Long.
- */
-#endif
-#else /* long long available */
-#ifndef Llong
-#define Llong long long
-#endif
-#ifndef ULLong
-#define ULLong unsigned Llong
-#endif
-#endif /* NO_LONG_LONG */
-
-#define MULTIPLE_THREADS 1
-
-#ifndef MULTIPLE_THREADS
-#define ACQUIRE_DTOA_LOCK(n) /*nothing*/
-#define FREE_DTOA_LOCK(n) /*nothing*/
-#else
-#define ACQUIRE_DTOA_LOCK(n) /*unused right now*/
-#define FREE_DTOA_LOCK(n) /*unused right now*/
-#endif
-
-#ifndef ATOMIC_PTR_CAS
-#define ATOMIC_PTR_CAS(var, old, new) ((var) = (new), (old))
-#endif
-#ifndef LIKELY
-#define LIKELY(x) (x)
-#endif
-#ifndef UNLIKELY
-#define UNLIKELY(x) (x)
-#endif
-#ifndef ASSUME
-#define ASSUME(x) (void)(x)
-#endif
-
-#define Kmax 15
-
-struct Bigint {
- struct Bigint *next;
- int k, maxwds, sign, wds;
- ULong x[1];
-};
-
-typedef struct Bigint Bigint;
-
-static Bigint *freelist[Kmax+1];
-
-static Bigint *
-Balloc(int k)
-{
- int x;
- Bigint *rv;
-#ifndef Omit_Private_Memory
- size_t len;
-#endif
-
- rv = 0;
- ACQUIRE_DTOA_LOCK(0);
- if (k <= Kmax) {
- rv = freelist[k];
- while (rv) {
- Bigint *rvn = rv;
- rv = ATOMIC_PTR_CAS(freelist[k], rv, rv->next);
- if (LIKELY(rvn == rv)) {
- ASSUME(rv);
- break;
- }
- }
- }
- if (!rv) {
- x = 1 << k;
-#ifdef Omit_Private_Memory
- rv = (Bigint *)MALLOC(sizeof(Bigint) + (x-1)*sizeof(ULong));
-#else
- len = (sizeof(Bigint) + (x-1)*sizeof(ULong) + sizeof(double) - 1)
- /sizeof(double);
- if (k <= Kmax) {
- double *pnext = pmem_next;
- while (pnext - private_mem + len <= PRIVATE_mem) {
- double *p = pnext;
- pnext = ATOMIC_PTR_CAS(pmem_next, pnext, pnext + len);
- if (LIKELY(p == pnext)) {
- rv = (Bigint*)pnext;
- ASSUME(rv);
- break;
- }
- }
- }
- if (!rv)
- rv = (Bigint*)MALLOC(len*sizeof(double));
-#endif
- rv->k = k;
- rv->maxwds = x;
- }
- FREE_DTOA_LOCK(0);
- rv->sign = rv->wds = 0;
- return rv;
-}
-
-static void
-Bfree(Bigint *v)
-{
- Bigint *vn;
- if (v) {
- if (v->k > Kmax) {
- FREE(v);
- return;
- }
- ACQUIRE_DTOA_LOCK(0);
- do {
- vn = v->next = freelist[v->k];
- } while (UNLIKELY(ATOMIC_PTR_CAS(freelist[v->k], vn, v) != vn));
- FREE_DTOA_LOCK(0);
- }
-}
-
-#define Bcopy(x,y) memcpy((char *)&(x)->sign, (char *)&(y)->sign, \
-(y)->wds*sizeof(Long) + 2*sizeof(int))
-
-static Bigint *
-multadd(Bigint *b, int m, int a) /* multiply by m and add a */
-{
- int i, wds;
- ULong *x;
-#ifdef ULLong
- ULLong carry, y;
-#else
- ULong carry, y;
-#ifdef Pack_32
- ULong xi, z;
-#endif
-#endif
- Bigint *b1;
-
- wds = b->wds;
- x = b->x;
- i = 0;
- carry = a;
- do {
-#ifdef ULLong
- y = *x * (ULLong)m + carry;
- carry = y >> 32;
- *x++ = (ULong)(y & FFFFFFFF);
-#else
-#ifdef Pack_32
- xi = *x;
- y = (xi & 0xffff) * m + carry;
- z = (xi >> 16) * m + (y >> 16);
- carry = z >> 16;
- *x++ = (z << 16) + (y & 0xffff);
-#else
- y = *x * m + carry;
- carry = y >> 16;
- *x++ = y & 0xffff;
-#endif
-#endif
- } while (++i < wds);
- if (carry) {
- if (wds >= b->maxwds) {
- b1 = Balloc(b->k+1);
- Bcopy(b1, b);
- Bfree(b);
- b = b1;
- }
- b->x[wds++] = (ULong)carry;
- b->wds = wds;
- }
- return b;
-}
-
-static Bigint *
-s2b(const char *s, int nd0, int nd, ULong y9)
-{
- Bigint *b;
- int i, k;
- Long x, y;
-
- x = (nd + 8) / 9;
- for (k = 0, y = 1; x > y; y <<= 1, k++) ;
-#ifdef Pack_32
- b = Balloc(k);
- b->x[0] = y9;
- b->wds = 1;
-#else
- b = Balloc(k+1);
- b->x[0] = y9 & 0xffff;
- b->wds = (b->x[1] = y9 >> 16) ? 2 : 1;
-#endif
-
- i = 9;
- if (9 < nd0) {
- s += 9;
- do {
- b = multadd(b, 10, *s++ - '0');
- } while (++i < nd0);
- s++;
- }
- else
- s += 10;
- for (; i < nd; i++)
- b = multadd(b, 10, *s++ - '0');
- return b;
-}
-
-static int
-hi0bits(register ULong x)
-{
- register int k = 0;
-
- if (!(x & 0xffff0000)) {
- k = 16;
- x <<= 16;
- }
- if (!(x & 0xff000000)) {
- k += 8;
- x <<= 8;
- }
- if (!(x & 0xf0000000)) {
- k += 4;
- x <<= 4;
- }
- if (!(x & 0xc0000000)) {
- k += 2;
- x <<= 2;
- }
- if (!(x & 0x80000000)) {
- k++;
- if (!(x & 0x40000000))
- return 32;
- }
- return k;
-}
-
-static int
-lo0bits(ULong *y)
-{
- register int k;
- register ULong x = *y;
-
- if (x & 7) {
- if (x & 1)
- return 0;
- if (x & 2) {
- *y = x >> 1;
- return 1;
- }
- *y = x >> 2;
- return 2;
- }
- k = 0;
- if (!(x & 0xffff)) {
- k = 16;
- x >>= 16;
- }
- if (!(x & 0xff)) {
- k += 8;
- x >>= 8;
- }
- if (!(x & 0xf)) {
- k += 4;
- x >>= 4;
- }
- if (!(x & 0x3)) {
- k += 2;
- x >>= 2;
- }
- if (!(x & 1)) {
- k++;
- x >>= 1;
- if (!x)
- return 32;
- }
- *y = x;
- return k;
-}
-
-static Bigint *
-i2b(int i)
-{
- Bigint *b;
-
- b = Balloc(1);
- b->x[0] = i;
- b->wds = 1;
- return b;
-}
-
-static Bigint *
-mult(Bigint *a, Bigint *b)
-{
- Bigint *c;
- int k, wa, wb, wc;
- ULong *x, *xa, *xae, *xb, *xbe, *xc, *xc0;
- ULong y;
-#ifdef ULLong
- ULLong carry, z;
-#else
- ULong carry, z;
-#ifdef Pack_32
- ULong z2;
-#endif
-#endif
-
- if (a->wds < b->wds) {
- c = a;
- a = b;
- b = c;
- }
- k = a->k;
- wa = a->wds;
- wb = b->wds;
- wc = wa + wb;
- if (wc > a->maxwds)
- k++;
- c = Balloc(k);
- for (x = c->x, xa = x + wc; x < xa; x++)
- *x = 0;
- xa = a->x;
- xae = xa + wa;
- xb = b->x;
- xbe = xb + wb;
- xc0 = c->x;
-#ifdef ULLong
- for (; xb < xbe; xc0++) {
- if ((y = *xb++) != 0) {
- x = xa;
- xc = xc0;
- carry = 0;
- do {
- z = *x++ * (ULLong)y + *xc + carry;
- carry = z >> 32;
- *xc++ = (ULong)(z & FFFFFFFF);
- } while (x < xae);
- *xc = (ULong)carry;
- }
- }
-#else
-#ifdef Pack_32
- for (; xb < xbe; xb++, xc0++) {
- if ((y = *xb & 0xffff) != 0) {
- x = xa;
- xc = xc0;
- carry = 0;
- do {
- z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
- carry = z >> 16;
- z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
- carry = z2 >> 16;
- Storeinc(xc, z2, z);
- } while (x < xae);
- *xc = (ULong)carry;
- }
- if ((y = *xb >> 16) != 0) {
- x = xa;
- xc = xc0;
- carry = 0;
- z2 = *xc;
- do {
- z = (*x & 0xffff) * y + (*xc >> 16) + carry;
- carry = z >> 16;
- Storeinc(xc, z, z2);
- z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
- carry = z2 >> 16;
- } while (x < xae);
- *xc = z2;
- }
- }
-#else
- for (; xb < xbe; xc0++) {
- if (y = *xb++) {
- x = xa;
- xc = xc0;
- carry = 0;
- do {
- z = *x++ * y + *xc + carry;
- carry = z >> 16;
- *xc++ = z & 0xffff;
- } while (x < xae);
- *xc = (ULong)carry;
- }
- }
-#endif
-#endif
- for (xc0 = c->x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
- c->wds = wc;
- return c;
-}
-
-static Bigint *p5s;
-
-static Bigint *
-pow5mult(Bigint *b, int k)
-{
- Bigint *b1, *p5, *p51;
- Bigint *p5tmp;
- int i;
- static const int p05[3] = { 5, 25, 125 };
-
- if ((i = k & 3) != 0)
- b = multadd(b, p05[i-1], 0);
-
- if (!(k >>= 2))
- return b;
- if (!(p5 = p5s)) {
- /* first time */
- ACQUIRE_DTOA_LOCK(1);
- if (!(p5 = p5s)) {
- p5 = i2b(625);
- p5->next = 0;
- p5tmp = ATOMIC_PTR_CAS(p5s, NULL, p5);
- if (UNLIKELY(p5tmp)) {
- Bfree(p5);
- p5 = p5tmp;
- }
- }
- FREE_DTOA_LOCK(1);
- }
- for (;;) {
- if (k & 1) {
- b1 = mult(b, p5);
- Bfree(b);
- b = b1;
- }
- if (!(k >>= 1))
- break;
- if (!(p51 = p5->next)) {
- ACQUIRE_DTOA_LOCK(1);
- if (!(p51 = p5->next)) {
- p51 = mult(p5,p5);
- p51->next = 0;
- p5tmp = ATOMIC_PTR_CAS(p5->next, NULL, p51);
- if (UNLIKELY(p5tmp)) {
- Bfree(p51);
- p51 = p5tmp;
- }
- }
- FREE_DTOA_LOCK(1);
- }
- p5 = p51;
- }
- return b;
-}
-
-static Bigint *
-lshift(Bigint *b, int k)
-{
- int i, k1, n, n1;
- Bigint *b1;
- ULong *x, *x1, *xe, z;
-
-#ifdef Pack_32
- n = k >> 5;
-#else
- n = k >> 4;
-#endif
- k1 = b->k;
- n1 = n + b->wds + 1;
- for (i = b->maxwds; n1 > i; i <<= 1)
- k1++;
- b1 = Balloc(k1);
- x1 = b1->x;
- for (i = 0; i < n; i++)
- *x1++ = 0;
- x = b->x;
- xe = x + b->wds;
-#ifdef Pack_32
- if (k &= 0x1f) {
- k1 = 32 - k;
- z = 0;
- do {
- *x1++ = *x << k | z;
- z = *x++ >> k1;
- } while (x < xe);
- if ((*x1 = z) != 0)
- ++n1;
- }
-#else
- if (k &= 0xf) {
- k1 = 16 - k;
- z = 0;
- do {
- *x1++ = *x << k & 0xffff | z;
- z = *x++ >> k1;
- } while (x < xe);
- if (*x1 = z)
- ++n1;
- }
-#endif
- else
- do {
- *x1++ = *x++;
- } while (x < xe);
- b1->wds = n1 - 1;
- Bfree(b);
- return b1;
-}
-
-static int
-cmp(Bigint *a, Bigint *b)
-{
- ULong *xa, *xa0, *xb, *xb0;
- int i, j;
-
- i = a->wds;
- j = b->wds;
-#ifdef DEBUG
- if (i > 1 && !a->x[i-1])
- Bug("cmp called with a->x[a->wds-1] == 0");
- if (j > 1 && !b->x[j-1])
- Bug("cmp called with b->x[b->wds-1] == 0");
-#endif
- if (i -= j)
- return i;
- xa0 = a->x;
- xa = xa0 + j;
- xb0 = b->x;
- xb = xb0 + j;
- for (;;) {
- if (*--xa != *--xb)
- return *xa < *xb ? -1 : 1;
- if (xa <= xa0)
- break;
- }
- return 0;
-}
-
-NO_SANITIZE("unsigned-integer-overflow", static Bigint * diff(Bigint *a, Bigint *b));
-static Bigint *
-diff(Bigint *a, Bigint *b)
-{
- Bigint *c;
- int i, wa, wb;
- ULong *xa, *xae, *xb, *xbe, *xc;
-#ifdef ULLong
- ULLong borrow, y;
-#else
- ULong borrow, y;
-#ifdef Pack_32
- ULong z;
-#endif
-#endif
-
- i = cmp(a,b);
- if (!i) {
- c = Balloc(0);
- c->wds = 1;
- c->x[0] = 0;
- return c;
- }
- if (i < 0) {
- c = a;
- a = b;
- b = c;
- i = 1;
- }
- else
- i = 0;
- c = Balloc(a->k);
- c->sign = i;
- wa = a->wds;
- xa = a->x;
- xae = xa + wa;
- wb = b->wds;
- xb = b->x;
- xbe = xb + wb;
- xc = c->x;
- borrow = 0;
-#ifdef ULLong
- do {
- y = (ULLong)*xa++ - *xb++ - borrow;
- borrow = y >> 32 & (ULong)1;
- *xc++ = (ULong)(y & FFFFFFFF);
- } while (xb < xbe);
- while (xa < xae) {
- y = *xa++ - borrow;
- borrow = y >> 32 & (ULong)1;
- *xc++ = (ULong)(y & FFFFFFFF);
- }
-#else
-#ifdef Pack_32
- do {
- y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
- borrow = (y & 0x10000) >> 16;
- z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
- borrow = (z & 0x10000) >> 16;
- Storeinc(xc, z, y);
- } while (xb < xbe);
- while (xa < xae) {
- y = (*xa & 0xffff) - borrow;
- borrow = (y & 0x10000) >> 16;
- z = (*xa++ >> 16) - borrow;
- borrow = (z & 0x10000) >> 16;
- Storeinc(xc, z, y);
- }
-#else
- do {
- y = *xa++ - *xb++ - borrow;
- borrow = (y & 0x10000) >> 16;
- *xc++ = y & 0xffff;
- } while (xb < xbe);
- while (xa < xae) {
- y = *xa++ - borrow;
- borrow = (y & 0x10000) >> 16;
- *xc++ = y & 0xffff;
- }
-#endif
-#endif
- while (!*--xc)
- wa--;
- c->wds = wa;
- return c;
-}
-
-static double
-ulp(double x_)
-{
- register Long L;
- double_u x, a;
- dval(x) = x_;
-
- L = (word0(x) & Exp_mask) - (P-1)*Exp_msk1;
-#ifndef Avoid_Underflow
-#ifndef Sudden_Underflow
- if (L > 0) {
-#endif
-#endif
-#ifdef IBM
- L |= Exp_msk1 >> 4;
-#endif
- word0(a) = L;
- word1(a) = 0;
-#ifndef Avoid_Underflow
-#ifndef Sudden_Underflow
- }
- else {
- L = -L >> Exp_shift;
- if (L < Exp_shift) {
- word0(a) = 0x80000 >> L;
- word1(a) = 0;
- }
- else {
- word0(a) = 0;
- L -= Exp_shift;
- word1(a) = L >= 31 ? 1 : 1 << 31 - L;
- }
- }
-#endif
-#endif
- return dval(a);
-}
-
-static double
-b2d(Bigint *a, int *e)
-{
- ULong *xa, *xa0, w, y, z;
- int k;
- double_u d;
-#ifdef VAX
- ULong d0, d1;
-#else
-#define d0 word0(d)
-#define d1 word1(d)
-#endif
-
- xa0 = a->x;
- xa = xa0 + a->wds;
- y = *--xa;
-#ifdef DEBUG
- if (!y) Bug("zero y in b2d");
-#endif
- k = hi0bits(y);
- *e = 32 - k;
-#ifdef Pack_32
- if (k < Ebits) {
- d0 = Exp_1 | y >> (Ebits - k);
- w = xa > xa0 ? *--xa : 0;
- d1 = y << ((32-Ebits) + k) | w >> (Ebits - k);
- goto ret_d;
- }
- z = xa > xa0 ? *--xa : 0;
- if (k -= Ebits) {
- d0 = Exp_1 | y << k | z >> (32 - k);
- y = xa > xa0 ? *--xa : 0;
- d1 = z << k | y >> (32 - k);
- }
- else {
- d0 = Exp_1 | y;
- d1 = z;
- }
-#else
- if (k < Ebits + 16) {
- z = xa > xa0 ? *--xa : 0;
- d0 = Exp_1 | y << k - Ebits | z >> Ebits + 16 - k;
- w = xa > xa0 ? *--xa : 0;
- y = xa > xa0 ? *--xa : 0;
- d1 = z << k + 16 - Ebits | w << k - Ebits | y >> 16 + Ebits - k;
- goto ret_d;
- }
- z = xa > xa0 ? *--xa : 0;
- w = xa > xa0 ? *--xa : 0;
- k -= Ebits + 16;
- d0 = Exp_1 | y << k + 16 | z << k | w >> 16 - k;
- y = xa > xa0 ? *--xa : 0;
- d1 = w << k + 16 | y << k;
-#endif
-ret_d:
-#ifdef VAX
- word0(d) = d0 >> 16 | d0 << 16;
- word1(d) = d1 >> 16 | d1 << 16;
-#else
-#undef d0
-#undef d1
-#endif
- return dval(d);
-}
-
-static Bigint *
-d2b(double d_, int *e, int *bits)
-{
- double_u d;
- Bigint *b;
- int de, k;
- ULong *x, y, z;
-#ifndef Sudden_Underflow
- int i;
-#endif
-#ifdef VAX
- ULong d0, d1;
-#endif
- dval(d) = d_;
-#ifdef VAX
- d0 = word0(d) >> 16 | word0(d) << 16;
- d1 = word1(d) >> 16 | word1(d) << 16;
-#else
-#define d0 word0(d)
-#define d1 word1(d)
-#endif
-
-#ifdef Pack_32
- b = Balloc(1);
-#else
- b = Balloc(2);
-#endif
- x = b->x;
-
- z = d0 & Frac_mask;
- d0 &= 0x7fffffff; /* clear sign bit, which we ignore */
-#ifdef Sudden_Underflow
- de = (int)(d0 >> Exp_shift);
-#ifndef IBM
- z |= Exp_msk11;
-#endif
-#else
- if ((de = (int)(d0 >> Exp_shift)) != 0)
- z |= Exp_msk1;
-#endif
-#ifdef Pack_32
- if ((y = d1) != 0) {
- if ((k = lo0bits(&y)) != 0) {
- x[0] = y | z << (32 - k);
- z >>= k;
- }
- else
- x[0] = y;
-#ifndef Sudden_Underflow
- i =
-#endif
- b->wds = (x[1] = z) ? 2 : 1;
- }
- else {
-#ifdef DEBUG
- if (!z)
- Bug("Zero passed to d2b");
-#endif
- k = lo0bits(&z);
- x[0] = z;
-#ifndef Sudden_Underflow
- i =
-#endif
- b->wds = 1;
- k += 32;
- }
-#else
- if (y = d1) {
- if (k = lo0bits(&y))
- if (k >= 16) {
- x[0] = y | z << 32 - k & 0xffff;
- x[1] = z >> k - 16 & 0xffff;
- x[2] = z >> k;
- i = 2;
- }
- else {
- x[0] = y & 0xffff;
- x[1] = y >> 16 | z << 16 - k & 0xffff;
- x[2] = z >> k & 0xffff;
- x[3] = z >> k+16;
- i = 3;
- }
- else {
- x[0] = y & 0xffff;
- x[1] = y >> 16;
- x[2] = z & 0xffff;
- x[3] = z >> 16;
- i = 3;
- }
- }
- else {
-#ifdef DEBUG
- if (!z)
- Bug("Zero passed to d2b");
-#endif
- k = lo0bits(&z);
- if (k >= 16) {
- x[0] = z;
- i = 0;
- }
- else {
- x[0] = z & 0xffff;
- x[1] = z >> 16;
- i = 1;
- }
- k += 32;
- }
- while (!x[i])
- --i;
- b->wds = i + 1;
-#endif
-#ifndef Sudden_Underflow
- if (de) {
-#endif
-#ifdef IBM
- *e = (de - Bias - (P-1) << 2) + k;
- *bits = 4*P + 8 - k - hi0bits(word0(d) & Frac_mask);
-#else
- *e = de - Bias - (P-1) + k;
- *bits = P - k;
-#endif
-#ifndef Sudden_Underflow
- }
- else {
- *e = de - Bias - (P-1) + 1 + k;
-#ifdef Pack_32
- *bits = 32*i - hi0bits(x[i-1]);
-#else
- *bits = (i+2)*16 - hi0bits(x[i]);
-#endif
- }
-#endif
- return b;
-}
-#undef d0
-#undef d1
-
-static double
-ratio(Bigint *a, Bigint *b)
-{
- double_u da, db;
- int k, ka, kb;
-
- dval(da) = b2d(a, &ka);
- dval(db) = b2d(b, &kb);
-#ifdef Pack_32
- k = ka - kb + 32*(a->wds - b->wds);
-#else
- k = ka - kb + 16*(a->wds - b->wds);
-#endif
-#ifdef IBM
- if (k > 0) {
- word0(da) += (k >> 2)*Exp_msk1;
- if (k &= 3)
- dval(da) *= 1 << k;
- }
- else {
- k = -k;
- word0(db) += (k >> 2)*Exp_msk1;
- if (k &= 3)
- dval(db) *= 1 << k;
- }
-#else
- if (k > 0)
- word0(da) += k*Exp_msk1;
- else {
- k = -k;
- word0(db) += k*Exp_msk1;
- }
-#endif
- return dval(da) / dval(db);
-}
-
-static const double
-tens[] = {
- 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
- 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
- 1e20, 1e21, 1e22
-#ifdef VAX
- , 1e23, 1e24
-#endif
-};
-
-static const double
-#ifdef IEEE_Arith
-bigtens[] = { 1e16, 1e32, 1e64, 1e128, 1e256 };
-static const double tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128,
-#ifdef Avoid_Underflow
- 9007199254740992.*9007199254740992.e-256
- /* = 2^106 * 1e-53 */
-#else
- 1e-256
-#endif
-};
-/* The factor of 2^53 in tinytens[4] helps us avoid setting the underflow */
-/* flag unnecessarily. It leads to a song and dance at the end of strtod. */
-#define Scale_Bit 0x10
-#define n_bigtens 5
-#else
-#ifdef IBM
-bigtens[] = { 1e16, 1e32, 1e64 };
-static const double tinytens[] = { 1e-16, 1e-32, 1e-64 };
-#define n_bigtens 3
-#else
-bigtens[] = { 1e16, 1e32 };
-static const double tinytens[] = { 1e-16, 1e-32 };
-#define n_bigtens 2
-#endif
-#endif
-
-#ifndef IEEE_Arith
-#undef INFNAN_CHECK
-#endif
-
-#ifdef INFNAN_CHECK
-
-#ifndef NAN_WORD0
-#define NAN_WORD0 0x7ff80000
-#endif
-
-#ifndef NAN_WORD1
-#define NAN_WORD1 0
-#endif
-
-static int
-match(const char **sp, char *t)
-{
- int c, d;
- const char *s = *sp;
-
- while (d = *t++) {
- if ((c = *++s) >= 'A' && c <= 'Z')
- c += 'a' - 'A';
- if (c != d)
- return 0;
- }
- *sp = s + 1;
- return 1;
-}
-
-#ifndef No_Hex_NaN
-static void
-hexnan(double *rvp, const char **sp)
-{
- ULong c, x[2];
- const char *s;
- int havedig, udx0, xshift;
-
- x[0] = x[1] = 0;
- havedig = xshift = 0;
- udx0 = 1;
- s = *sp;
- while (c = *(const unsigned char*)++s) {
- if (c >= '0' && c <= '9')
- c -= '0';
- else if (c >= 'a' && c <= 'f')
- c += 10 - 'a';
- else if (c >= 'A' && c <= 'F')
- c += 10 - 'A';
- else if (c <= ' ') {
- if (udx0 && havedig) {
- udx0 = 0;
- xshift = 1;
- }
- continue;
- }
- else if (/*(*/ c == ')' && havedig) {
- *sp = s + 1;
- break;
- }
- else
- return; /* invalid form: don't change *sp */
- havedig = 1;
- if (xshift) {
- xshift = 0;
- x[0] = x[1];
- x[1] = 0;
- }
- if (udx0)
- x[0] = (x[0] << 4) | (x[1] >> 28);
- x[1] = (x[1] << 4) | c;
- }
- if ((x[0] &= 0xfffff) || x[1]) {
- word0(*rvp) = Exp_mask | x[0];
- word1(*rvp) = x[1];
- }
-}
-#endif /*No_Hex_NaN*/
-#endif /* INFNAN_CHECK */
-
-NO_SANITIZE("unsigned-integer-overflow", double strtod(const char *s00, char **se));
-double
-strtod(const char *s00, char **se)
-{
-#ifdef Avoid_Underflow
- int scale;
-#endif
- int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
- e, e1, esign, i, j, k, nd, nd0, nf, nz, nz0, sign;
- const char *s, *s0, *s1;
- double aadj, adj;
- double_u aadj1, rv, rv0;
- Long L;
- ULong y, z;
- Bigint *bb, *bb1, *bd, *bd0, *bs, *delta;
-#ifdef SET_INEXACT
- int inexact, oldinexact;
-#endif
-#ifdef Honor_FLT_ROUNDS
- int rounding;
-#endif
-#ifdef USE_LOCALE
- const char *s2;
-#endif
-
- errno = 0;
- sign = nz0 = nz = 0;
- dval(rv) = 0.;
- for (s = s00;;s++)
- switch (*s) {
- case '-':
- sign = 1;
- /* no break */
- case '+':
- if (*++s)
- goto break2;
- /* no break */
- case 0:
- goto ret0;
- case '\t':
- case '\n':
- case '\v':
- case '\f':
- case '\r':
- case ' ':
- continue;
- default:
- goto break2;
- }
-break2:
- if (*s == '0') {
- if (s[1] == 'x' || s[1] == 'X') {
- s0 = ++s;
- adj = 0;
- aadj = 1.0;
- nd0 = -4;
-
- if (!*++s || !(s1 = strchr(hexdigit, *s))) goto ret0;
- if (*s == '0') {
- while (*++s == '0');
- s1 = strchr(hexdigit, *s);
- }
- if (s1 != NULL) {
- do {
- adj += aadj * ((s1 - hexdigit) & 15);
- nd0 += 4;
- aadj /= 16;
- } while (*++s && (s1 = strchr(hexdigit, *s)));
- }
-
- if (*s == '.') {
- dsign = 1;
- if (!*++s || !(s1 = strchr(hexdigit, *s))) goto ret0;
- if (nd0 < 0) {
- while (*s == '0') {
- s++;
- nd0 -= 4;
- }
- }
- for (; *s && (s1 = strchr(hexdigit, *s)); ++s) {
- adj += aadj * ((s1 - hexdigit) & 15);
- if ((aadj /= 16) == 0.0) {
- while (strchr(hexdigit, *++s));
- break;
- }
- }
- }
- else {
- dsign = 0;
- }
-
- if (*s == 'P' || *s == 'p') {
- dsign = 0x2C - *++s; /* +: 2B, -: 2D */
- if (abs(dsign) == 1) s++;
- else dsign = 1;
-
- nd = 0;
- c = *s;
- if (c < '0' || '9' < c) goto ret0;
- do {
- nd *= 10;
- nd += c;
- nd -= '0';
- c = *++s;
- /* Float("0x0."+("0"*267)+"1fp2095") */
- if (nd + dsign * nd0 > 2095) {
- while ('0' <= c && c <= '9') c = *++s;
- break;
- }
- } while ('0' <= c && c <= '9');
- nd0 += nd * dsign;
- }
- else {
- if (dsign) goto ret0;
- }
- dval(rv) = ldexp(adj, nd0);
- goto ret;
- }
- nz0 = 1;
- while (*++s == '0') ;
- if (!*s)
- goto ret;
- }
- s0 = s;
- y = z = 0;
- for (nd = nf = 0; (c = *s) >= '0' && c <= '9'; nd++, s++)
- if (nd < 9)
- y = 10*y + c - '0';
- else if (nd < DBL_DIG + 2)
- z = 10*z + c - '0';
- nd0 = nd;
-#ifdef USE_LOCALE
- s1 = localeconv()->decimal_point;
- if (c == *s1) {
- c = '.';
- if (*++s1) {
- s2 = s;
- for (;;) {
- if (*++s2 != *s1) {
- c = 0;
- break;
- }
- if (!*++s1) {
- s = s2;
- break;
- }
- }
- }
- }
-#endif
- if (c == '.') {
- if (!ISDIGIT(s[1]))
- goto dig_done;
- c = *++s;
- if (!nd) {
- for (; c == '0'; c = *++s)
- nz++;
- if (c > '0' && c <= '9') {
- s0 = s;
- nf += nz;
- nz = 0;
- goto have_dig;
- }
- goto dig_done;
- }
- for (; c >= '0' && c <= '9'; c = *++s) {
-have_dig:
- nz++;
- if (nd > DBL_DIG * 4) {
- continue;
- }
- if (c -= '0') {
- nf += nz;
- for (i = 1; i < nz; i++)
- if (nd++ < 9)
- y *= 10;
- else if (nd <= DBL_DIG + 2)
- z *= 10;
- if (nd++ < 9)
- y = 10*y + c;
- else if (nd <= DBL_DIG + 2)
- z = 10*z + c;
- nz = 0;
- }
- }
- }
-dig_done:
- e = 0;
- if (c == 'e' || c == 'E') {
- if (!nd && !nz && !nz0) {
- goto ret0;
- }
- s00 = s;
- esign = 0;
- switch (c = *++s) {
- case '-':
- esign = 1;
- case '+':
- c = *++s;
- }
- if (c >= '0' && c <= '9') {
- while (c == '0')
- c = *++s;
- if (c > '0' && c <= '9') {
- L = c - '0';
- s1 = s;
- while ((c = *++s) >= '0' && c <= '9')
- L = 10*L + c - '0';
- if (s - s1 > 8 || L > 19999)
- /* Avoid confusion from exponents
- * so large that e might overflow.
- */
- e = 19999; /* safe for 16 bit ints */
- else
- e = (int)L;
- if (esign)
- e = -e;
- }
- else
- e = 0;
- }
- else
- s = s00;
- }
- if (!nd) {
- if (!nz && !nz0) {
-#ifdef INFNAN_CHECK
- /* Check for Nan and Infinity */
- switch (c) {
- case 'i':
- case 'I':
- if (match(&s,"nf")) {
- --s;
- if (!match(&s,"inity"))
- ++s;
- word0(rv) = 0x7ff00000;
- word1(rv) = 0;
- goto ret;
- }
- break;
- case 'n':
- case 'N':
- if (match(&s, "an")) {
- word0(rv) = NAN_WORD0;
- word1(rv) = NAN_WORD1;
-#ifndef No_Hex_NaN
- if (*s == '(') /*)*/
- hexnan(&rv, &s);
-#endif
- goto ret;
- }
- }
-#endif /* INFNAN_CHECK */
-ret0:
- s = s00;
- sign = 0;
- }
- goto ret;
- }
- e1 = e -= nf;
-
- /* Now we have nd0 digits, starting at s0, followed by a
- * decimal point, followed by nd-nd0 digits. The number we're
- * after is the integer represented by those digits times
- * 10**e */
-
- if (!nd0)
- nd0 = nd;
- k = nd < DBL_DIG + 2 ? nd : DBL_DIG + 2;
- dval(rv) = y;
- if (k > 9) {
-#ifdef SET_INEXACT
- if (k > DBL_DIG)
- oldinexact = get_inexact();
-#endif
- dval(rv) = tens[k - 9] * dval(rv) + z;
- }
- bd0 = bb = bd = bs = delta = 0;
- if (nd <= DBL_DIG
-#ifndef RND_PRODQUOT
-#ifndef Honor_FLT_ROUNDS
- && Flt_Rounds == 1
-#endif
-#endif
- ) {
- if (!e)
- goto ret;
- if (e > 0) {
- if (e <= Ten_pmax) {
-#ifdef VAX
- goto vax_ovfl_check;
-#else
-#ifdef Honor_FLT_ROUNDS
- /* round correctly FLT_ROUNDS = 2 or 3 */
- if (sign) {
- dval(rv) = -dval(rv);
- sign = 0;
- }
-#endif
- /* rv = */ rounded_product(dval(rv), tens[e]);
- goto ret;
-#endif
- }
- i = DBL_DIG - nd;
- if (e <= Ten_pmax + i) {
- /* A fancier test would sometimes let us do
- * this for larger i values.
- */
-#ifdef Honor_FLT_ROUNDS
- /* round correctly FLT_ROUNDS = 2 or 3 */
- if (sign) {
- dval(rv) = -dval(rv);
- sign = 0;
- }
-#endif
- e -= i;
- dval(rv) *= tens[i];
-#ifdef VAX
- /* VAX exponent range is so narrow we must
- * worry about overflow here...
- */
-vax_ovfl_check:
- word0(rv) -= P*Exp_msk1;
- /* rv = */ rounded_product(dval(rv), tens[e]);
- if ((word0(rv) & Exp_mask)
- > Exp_msk1*(DBL_MAX_EXP+Bias-1-P))
- goto ovfl;
- word0(rv) += P*Exp_msk1;
-#else
- /* rv = */ rounded_product(dval(rv), tens[e]);
-#endif
- goto ret;
- }
- }
-#ifndef Inaccurate_Divide
- else if (e >= -Ten_pmax) {
-#ifdef Honor_FLT_ROUNDS
- /* round correctly FLT_ROUNDS = 2 or 3 */
- if (sign) {
- dval(rv) = -dval(rv);
- sign = 0;
- }
-#endif
- /* rv = */ rounded_quotient(dval(rv), tens[-e]);
- goto ret;
- }
-#endif
- }
- e1 += nd - k;
-
-#ifdef IEEE_Arith
-#ifdef SET_INEXACT
- inexact = 1;
- if (k <= DBL_DIG)
- oldinexact = get_inexact();
-#endif
-#ifdef Avoid_Underflow
- scale = 0;
-#endif
-#ifdef Honor_FLT_ROUNDS
- if ((rounding = Flt_Rounds) >= 2) {
- if (sign)
- rounding = rounding == 2 ? 0 : 2;
- else
- if (rounding != 2)
- rounding = 0;
- }
-#endif
-#endif /*IEEE_Arith*/
-
- /* Get starting approximation = rv * 10**e1 */
-
- if (e1 > 0) {
- if ((i = e1 & 15) != 0)
- dval(rv) *= tens[i];
- if (e1 &= ~15) {
- if (e1 > DBL_MAX_10_EXP) {
-ovfl:
-#ifndef NO_ERRNO
- errno = ERANGE;
-#endif
- /* Can't trust HUGE_VAL */
-#ifdef IEEE_Arith
-#ifdef Honor_FLT_ROUNDS
- switch (rounding) {
- case 0: /* toward 0 */
- case 3: /* toward -infinity */
- word0(rv) = Big0;
- word1(rv) = Big1;
- break;
- default:
- word0(rv) = Exp_mask;
- word1(rv) = 0;
- }
-#else /*Honor_FLT_ROUNDS*/
- word0(rv) = Exp_mask;
- word1(rv) = 0;
-#endif /*Honor_FLT_ROUNDS*/
-#ifdef SET_INEXACT
- /* set overflow bit */
- dval(rv0) = 1e300;
- dval(rv0) *= dval(rv0);
-#endif
-#else /*IEEE_Arith*/
- word0(rv) = Big0;
- word1(rv) = Big1;
-#endif /*IEEE_Arith*/
- if (bd0)
- goto retfree;
- goto ret;
- }
- e1 >>= 4;
- for (j = 0; e1 > 1; j++, e1 >>= 1)
- if (e1 & 1)
- dval(rv) *= bigtens[j];
- /* The last multiplication could overflow. */
- word0(rv) -= P*Exp_msk1;
- dval(rv) *= bigtens[j];
- if ((z = word0(rv) & Exp_mask)
- > Exp_msk1*(DBL_MAX_EXP+Bias-P))
- goto ovfl;
- if (z > Exp_msk1*(DBL_MAX_EXP+Bias-1-P)) {
- /* set to largest number */
- /* (Can't trust DBL_MAX) */
- word0(rv) = Big0;
- word1(rv) = Big1;
- }
- else
- word0(rv) += P*Exp_msk1;
- }
- }
- else if (e1 < 0) {
- e1 = -e1;
- if ((i = e1 & 15) != 0)
- dval(rv) /= tens[i];
- if (e1 >>= 4) {
- if (e1 >= 1 << n_bigtens)
- goto undfl;
-#ifdef Avoid_Underflow
- if (e1 & Scale_Bit)
- scale = 2*P;
- for (j = 0; e1 > 0; j++, e1 >>= 1)
- if (e1 & 1)
- dval(rv) *= tinytens[j];
- if (scale && (j = 2*P + 1 - ((word0(rv) & Exp_mask)
- >> Exp_shift)) > 0) {
- /* scaled rv is denormal; zap j low bits */
- if (j >= 32) {
- word1(rv) = 0;
- if (j >= 53)
- word0(rv) = (P+2)*Exp_msk1;
- else
- word0(rv) &= 0xffffffff << (j-32);
- }
- else
- word1(rv) &= 0xffffffff << j;
- }
-#else
- for (j = 0; e1 > 1; j++, e1 >>= 1)
- if (e1 & 1)
- dval(rv) *= tinytens[j];
- /* The last multiplication could underflow. */
- dval(rv0) = dval(rv);
- dval(rv) *= tinytens[j];
- if (!dval(rv)) {
- dval(rv) = 2.*dval(rv0);
- dval(rv) *= tinytens[j];
-#endif
- if (!dval(rv)) {
-undfl:
- dval(rv) = 0.;
-#ifndef NO_ERRNO
- errno = ERANGE;
-#endif
- if (bd0)
- goto retfree;
- goto ret;
- }
-#ifndef Avoid_Underflow
- word0(rv) = Tiny0;
- word1(rv) = Tiny1;
- /* The refinement below will clean
- * this approximation up.
- */
- }
-#endif
- }
- }
-
- /* Now the hard part -- adjusting rv to the correct value.*/
-
- /* Put digits into bd: true value = bd * 10^e */
-
- bd0 = s2b(s0, nd0, nd, y);
-
- for (;;) {
- bd = Balloc(bd0->k);
- Bcopy(bd, bd0);
- bb = d2b(dval(rv), &bbe, &bbbits); /* rv = bb * 2^bbe */
- bs = i2b(1);
-
- if (e >= 0) {
- bb2 = bb5 = 0;
- bd2 = bd5 = e;
- }
- else {
- bb2 = bb5 = -e;
- bd2 = bd5 = 0;
- }
- if (bbe >= 0)
- bb2 += bbe;
- else
- bd2 -= bbe;
- bs2 = bb2;
-#ifdef Honor_FLT_ROUNDS
- if (rounding != 1)
- bs2++;
-#endif
-#ifdef Avoid_Underflow
- j = bbe - scale;
- i = j + bbbits - 1; /* logb(rv) */
- if (i < Emin) /* denormal */
- j += P - Emin;
- else
- j = P + 1 - bbbits;
-#else /*Avoid_Underflow*/
-#ifdef Sudden_Underflow
-#ifdef IBM
- j = 1 + 4*P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
-#else
- j = P + 1 - bbbits;
-#endif
-#else /*Sudden_Underflow*/
- j = bbe;
- i = j + bbbits - 1; /* logb(rv) */
- if (i < Emin) /* denormal */
- j += P - Emin;
- else
- j = P + 1 - bbbits;
-#endif /*Sudden_Underflow*/
-#endif /*Avoid_Underflow*/
- bb2 += j;
- bd2 += j;
-#ifdef Avoid_Underflow
- bd2 += scale;
-#endif
- i = bb2 < bd2 ? bb2 : bd2;
- if (i > bs2)
- i = bs2;
- if (i > 0) {
- bb2 -= i;
- bd2 -= i;
- bs2 -= i;
- }
- if (bb5 > 0) {
- bs = pow5mult(bs, bb5);
- bb1 = mult(bs, bb);
- Bfree(bb);
- bb = bb1;
- }
- if (bb2 > 0)
- bb = lshift(bb, bb2);
- if (bd5 > 0)
- bd = pow5mult(bd, bd5);
- if (bd2 > 0)
- bd = lshift(bd, bd2);
- if (bs2 > 0)
- bs = lshift(bs, bs2);
- delta = diff(bb, bd);
- dsign = delta->sign;
- delta->sign = 0;
- i = cmp(delta, bs);
-#ifdef Honor_FLT_ROUNDS
- if (rounding != 1) {
- if (i < 0) {
- /* Error is less than an ulp */
- if (!delta->x[0] && delta->wds <= 1) {
- /* exact */
-#ifdef SET_INEXACT
- inexact = 0;
-#endif
- break;
- }
- if (rounding) {
- if (dsign) {
- adj = 1.;
- goto apply_adj;
- }
- }
- else if (!dsign) {
- adj = -1.;
- if (!word1(rv)
- && !(word0(rv) & Frac_mask)) {
- y = word0(rv) & Exp_mask;
-#ifdef Avoid_Underflow
- if (!scale || y > 2*P*Exp_msk1)
-#else
- if (y)
-#endif
- {
- delta = lshift(delta,Log2P);
- if (cmp(delta, bs) <= 0)
- adj = -0.5;
- }
- }
-apply_adj:
-#ifdef Avoid_Underflow
- if (scale && (y = word0(rv) & Exp_mask)
- <= 2*P*Exp_msk1)
- word0(adj) += (2*P+1)*Exp_msk1 - y;
-#else
-#ifdef Sudden_Underflow
- if ((word0(rv) & Exp_mask) <=
- P*Exp_msk1) {
- word0(rv) += P*Exp_msk1;
- dval(rv) += adj*ulp(dval(rv));
- word0(rv) -= P*Exp_msk1;
- }
- else
-#endif /*Sudden_Underflow*/
-#endif /*Avoid_Underflow*/
- dval(rv) += adj*ulp(dval(rv));
- }
- break;
- }
- adj = ratio(delta, bs);
- if (adj < 1.)
- adj = 1.;
- if (adj <= 0x7ffffffe) {
- /* adj = rounding ? ceil(adj) : floor(adj); */
- y = adj;
- if (y != adj) {
- if (!((rounding>>1) ^ dsign))
- y++;
- adj = y;
- }
- }
-#ifdef Avoid_Underflow
- if (scale && (y = word0(rv) & Exp_mask) <= 2*P*Exp_msk1)
- word0(adj) += (2*P+1)*Exp_msk1 - y;
-#else
-#ifdef Sudden_Underflow
- if ((word0(rv) & Exp_mask) <= P*Exp_msk1) {
- word0(rv) += P*Exp_msk1;
- adj *= ulp(dval(rv));
- if (dsign)
- dval(rv) += adj;
- else
- dval(rv) -= adj;
- word0(rv) -= P*Exp_msk1;
- goto cont;
- }
-#endif /*Sudden_Underflow*/
-#endif /*Avoid_Underflow*/
- adj *= ulp(dval(rv));
- if (dsign)
- dval(rv) += adj;
- else
- dval(rv) -= adj;
- goto cont;
- }
-#endif /*Honor_FLT_ROUNDS*/
-
- if (i < 0) {
- /* Error is less than half an ulp -- check for
- * special case of mantissa a power of two.
- */
- if (dsign || word1(rv) || word0(rv) & Bndry_mask
-#ifdef IEEE_Arith
-#ifdef Avoid_Underflow
- || (word0(rv) & Exp_mask) <= (2*P+1)*Exp_msk1
-#else
- || (word0(rv) & Exp_mask) <= Exp_msk1
-#endif
-#endif
- ) {
-#ifdef SET_INEXACT
- if (!delta->x[0] && delta->wds <= 1)
- inexact = 0;
-#endif
- break;
- }
- if (!delta->x[0] && delta->wds <= 1) {
- /* exact result */
-#ifdef SET_INEXACT
- inexact = 0;
-#endif
- break;
- }
- delta = lshift(delta,Log2P);
- if (cmp(delta, bs) > 0)
- goto drop_down;
- break;
- }
- if (i == 0) {
- /* exactly half-way between */
- if (dsign) {
- if ((word0(rv) & Bndry_mask1) == Bndry_mask1
- && word1(rv) == (
-#ifdef Avoid_Underflow
- (scale && (y = word0(rv) & Exp_mask) <= 2*P*Exp_msk1)
- ? (0xffffffff & (0xffffffff << (2*P+1-(y>>Exp_shift)))) :
-#endif
- 0xffffffff)) {
- /*boundary case -- increment exponent*/
- word0(rv) = (word0(rv) & Exp_mask)
- + Exp_msk1
-#ifdef IBM
- | Exp_msk1 >> 4
-#endif
- ;
- word1(rv) = 0;
-#ifdef Avoid_Underflow
- dsign = 0;
-#endif
- break;
- }
- }
- else if (!(word0(rv) & Bndry_mask) && !word1(rv)) {
-drop_down:
- /* boundary case -- decrement exponent */
-#ifdef Sudden_Underflow /*{{*/
- L = word0(rv) & Exp_mask;
-#ifdef IBM
- if (L < Exp_msk1)
-#else
-#ifdef Avoid_Underflow
- if (L <= (scale ? (2*P+1)*Exp_msk1 : Exp_msk1))
-#else
- if (L <= Exp_msk1)
-#endif /*Avoid_Underflow*/
-#endif /*IBM*/
- goto undfl;
- L -= Exp_msk1;
-#else /*Sudden_Underflow}{*/
-#ifdef Avoid_Underflow
- if (scale) {
- L = word0(rv) & Exp_mask;
- if (L <= (2*P+1)*Exp_msk1) {
- if (L > (P+2)*Exp_msk1)
- /* round even ==> */
- /* accept rv */
- break;
- /* rv = smallest denormal */
- goto undfl;
- }
- }
-#endif /*Avoid_Underflow*/
- L = (word0(rv) & Exp_mask) - Exp_msk1;
-#endif /*Sudden_Underflow}}*/
- word0(rv) = L | Bndry_mask1;
- word1(rv) = 0xffffffff;
-#ifdef IBM
- goto cont;
-#else
- break;
-#endif
- }
-#ifndef ROUND_BIASED
- if (!(word1(rv) & LSB))
- break;
-#endif
- if (dsign)
- dval(rv) += ulp(dval(rv));
-#ifndef ROUND_BIASED
- else {
- dval(rv) -= ulp(dval(rv));
-#ifndef Sudden_Underflow
- if (!dval(rv))
- goto undfl;
-#endif
- }
-#ifdef Avoid_Underflow
- dsign = 1 - dsign;
-#endif
-#endif
- break;
- }
- if ((aadj = ratio(delta, bs)) <= 2.) {
- if (dsign)
- aadj = dval(aadj1) = 1.;
- else if (word1(rv) || word0(rv) & Bndry_mask) {
-#ifndef Sudden_Underflow
- if (word1(rv) == Tiny1 && !word0(rv))
- goto undfl;
-#endif
- aadj = 1.;
- dval(aadj1) = -1.;
- }
- else {
- /* special case -- power of FLT_RADIX to be */
- /* rounded down... */
-
- if (aadj < 2./FLT_RADIX)
- aadj = 1./FLT_RADIX;
- else
- aadj *= 0.5;
- dval(aadj1) = -aadj;
- }
- }
- else {
- aadj *= 0.5;
- dval(aadj1) = dsign ? aadj : -aadj;
-#ifdef Check_FLT_ROUNDS
- switch (Rounding) {
- case 2: /* towards +infinity */
- dval(aadj1) -= 0.5;
- break;
- case 0: /* towards 0 */
- case 3: /* towards -infinity */
- dval(aadj1) += 0.5;
- }
-#else
- if (Flt_Rounds == 0)
- dval(aadj1) += 0.5;
-#endif /*Check_FLT_ROUNDS*/
- }
- y = word0(rv) & Exp_mask;
-
- /* Check for overflow */
-
- if (y == Exp_msk1*(DBL_MAX_EXP+Bias-1)) {
- dval(rv0) = dval(rv);
- word0(rv) -= P*Exp_msk1;
- adj = dval(aadj1) * ulp(dval(rv));
- dval(rv) += adj;
- if ((word0(rv) & Exp_mask) >=
- Exp_msk1*(DBL_MAX_EXP+Bias-P)) {
- if (word0(rv0) == Big0 && word1(rv0) == Big1)
- goto ovfl;
- word0(rv) = Big0;
- word1(rv) = Big1;
- goto cont;
- }
- else
- word0(rv) += P*Exp_msk1;
- }
- else {
-#ifdef Avoid_Underflow
- if (scale && y <= 2*P*Exp_msk1) {
- if (aadj <= 0x7fffffff) {
- if ((z = (int)aadj) <= 0)
- z = 1;
- aadj = z;
- dval(aadj1) = dsign ? aadj : -aadj;
- }
- word0(aadj1) += (2*P+1)*Exp_msk1 - y;
- }
- adj = dval(aadj1) * ulp(dval(rv));
- dval(rv) += adj;
-#else
-#ifdef Sudden_Underflow
- if ((word0(rv) & Exp_mask) <= P*Exp_msk1) {
- dval(rv0) = dval(rv);
- word0(rv) += P*Exp_msk1;
- adj = dval(aadj1) * ulp(dval(rv));
- dval(rv) += adj;
-#ifdef IBM
- if ((word0(rv) & Exp_mask) < P*Exp_msk1)
-#else
- if ((word0(rv) & Exp_mask) <= P*Exp_msk1)
-#endif
- {
- if (word0(rv0) == Tiny0 && word1(rv0) == Tiny1)
- goto undfl;
- word0(rv) = Tiny0;
- word1(rv) = Tiny1;
- goto cont;
- }
- else
- word0(rv) -= P*Exp_msk1;
- }
- else {
- adj = dval(aadj1) * ulp(dval(rv));
- dval(rv) += adj;
- }
-#else /*Sudden_Underflow*/
- /* Compute adj so that the IEEE rounding rules will
- * correctly round rv + adj in some half-way cases.
- * If rv * ulp(rv) is denormalized (i.e.,
- * y <= (P-1)*Exp_msk1), we must adjust aadj to avoid
- * trouble from bits lost to denormalization;
- * example: 1.2e-307 .
- */
- if (y <= (P-1)*Exp_msk1 && aadj > 1.) {
- dval(aadj1) = (double)(int)(aadj + 0.5);
- if (!dsign)
- dval(aadj1) = -dval(aadj1);
- }
- adj = dval(aadj1) * ulp(dval(rv));
- dval(rv) += adj;
-#endif /*Sudden_Underflow*/
-#endif /*Avoid_Underflow*/
- }
- z = word0(rv) & Exp_mask;
-#ifndef SET_INEXACT
-#ifdef Avoid_Underflow
- if (!scale)
-#endif
- if (y == z) {
- /* Can we stop now? */
- L = (Long)aadj;
- aadj -= L;
- /* The tolerances below are conservative. */
- if (dsign || word1(rv) || word0(rv) & Bndry_mask) {
- if (aadj < .4999999 || aadj > .5000001)
- break;
- }
- else if (aadj < .4999999/FLT_RADIX)
- break;
- }
-#endif
-cont:
- Bfree(bb);
- Bfree(bd);
- Bfree(bs);
- Bfree(delta);
- }
-#ifdef SET_INEXACT
- if (inexact) {
- if (!oldinexact) {
- word0(rv0) = Exp_1 + (70 << Exp_shift);
- word1(rv0) = 0;
- dval(rv0) += 1.;
- }
- }
- else if (!oldinexact)
- clear_inexact();
-#endif
-#ifdef Avoid_Underflow
- if (scale) {
- word0(rv0) = Exp_1 - 2*P*Exp_msk1;
- word1(rv0) = 0;
- dval(rv) *= dval(rv0);
-#ifndef NO_ERRNO
- /* try to avoid the bug of testing an 8087 register value */
- if (word0(rv) == 0 && word1(rv) == 0)
- errno = ERANGE;
-#endif
- }
-#endif /* Avoid_Underflow */
-#ifdef SET_INEXACT
- if (inexact && !(word0(rv) & Exp_mask)) {
- /* set underflow bit */
- dval(rv0) = 1e-300;
- dval(rv0) *= dval(rv0);
- }
-#endif
-retfree:
- Bfree(bb);
- Bfree(bd);
- Bfree(bs);
- Bfree(bd0);
- Bfree(delta);
-ret:
- if (se)
- *se = (char *)s;
- return sign ? -dval(rv) : dval(rv);
-}
-
-NO_SANITIZE("unsigned-integer-overflow", static int quorem(Bigint *b, Bigint *S));
-static int
-quorem(Bigint *b, Bigint *S)
-{
- int n;
- ULong *bx, *bxe, q, *sx, *sxe;
-#ifdef ULLong
- ULLong borrow, carry, y, ys;
-#else
- ULong borrow, carry, y, ys;
-#ifdef Pack_32
- ULong si, z, zs;
-#endif
-#endif
-
- n = S->wds;
-#ifdef DEBUG
- /*debug*/ if (b->wds > n)
- /*debug*/ Bug("oversize b in quorem");
-#endif
- if (b->wds < n)
- return 0;
- sx = S->x;
- sxe = sx + --n;
- bx = b->x;
- bxe = bx + n;
- q = *bxe / (*sxe + 1); /* ensure q <= true quotient */
-#ifdef DEBUG
- /*debug*/ if (q > 9)
- /*debug*/ Bug("oversized quotient in quorem");
-#endif
- if (q) {
- borrow = 0;
- carry = 0;
- do {
-#ifdef ULLong
- ys = *sx++ * (ULLong)q + carry;
- carry = ys >> 32;
- y = *bx - (ys & FFFFFFFF) - borrow;
- borrow = y >> 32 & (ULong)1;
- *bx++ = (ULong)(y & FFFFFFFF);
-#else
-#ifdef Pack_32
- si = *sx++;
- ys = (si & 0xffff) * q + carry;
- zs = (si >> 16) * q + (ys >> 16);
- carry = zs >> 16;
- y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
- borrow = (y & 0x10000) >> 16;
- z = (*bx >> 16) - (zs & 0xffff) - borrow;
- borrow = (z & 0x10000) >> 16;
- Storeinc(bx, z, y);
-#else
- ys = *sx++ * q + carry;
- carry = ys >> 16;
- y = *bx - (ys & 0xffff) - borrow;
- borrow = (y & 0x10000) >> 16;
- *bx++ = y & 0xffff;
-#endif
-#endif
- } while (sx <= sxe);
- if (!*bxe) {
- bx = b->x;
- while (--bxe > bx && !*bxe)
- --n;
- b->wds = n;
- }
- }
- if (cmp(b, S) >= 0) {
- q++;
- borrow = 0;
- carry = 0;
- bx = b->x;
- sx = S->x;
- do {
-#ifdef ULLong
- ys = *sx++ + carry;
- carry = ys >> 32;
- y = *bx - (ys & FFFFFFFF) - borrow;
- borrow = y >> 32 & (ULong)1;
- *bx++ = (ULong)(y & FFFFFFFF);
-#else
-#ifdef Pack_32
- si = *sx++;
- ys = (si & 0xffff) + carry;
- zs = (si >> 16) + (ys >> 16);
- carry = zs >> 16;
- y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
- borrow = (y & 0x10000) >> 16;
- z = (*bx >> 16) - (zs & 0xffff) - borrow;
- borrow = (z & 0x10000) >> 16;
- Storeinc(bx, z, y);
-#else
- ys = *sx++ + carry;
- carry = ys >> 16;
- y = *bx - (ys & 0xffff) - borrow;
- borrow = (y & 0x10000) >> 16;
- *bx++ = y & 0xffff;
-#endif
-#endif
- } while (sx <= sxe);
- bx = b->x;
- bxe = bx + n;
- if (!*bxe) {
- while (--bxe > bx && !*bxe)
- --n;
- b->wds = n;
- }
- }
- return q;
-}
-
-#ifndef MULTIPLE_THREADS
-static char *dtoa_result;
-#endif
-
-#ifndef MULTIPLE_THREADS
-static char *
-rv_alloc(int i)
-{
- return dtoa_result = MALLOC(i);
-}
-#else
-#define rv_alloc(i) MALLOC(i)
-#endif
-
-static char *
-nrv_alloc(const char *s, char **rve, size_t n)
-{
- char *rv, *t;
-
- t = rv = rv_alloc(n);
- while ((*t = *s++) != 0) t++;
- if (rve)
- *rve = t;
- return rv;
-}
-
-#define rv_strdup(s, rve) nrv_alloc((s), (rve), strlen(s)+1)
-
-#ifndef MULTIPLE_THREADS
-/* freedtoa(s) must be used to free values s returned by dtoa
- * when MULTIPLE_THREADS is #defined. It should be used in all cases,
- * but for consistency with earlier versions of dtoa, it is optional
- * when MULTIPLE_THREADS is not defined.
- */
-
-static void
-freedtoa(char *s)
-{
- FREE(s);
-}
-#endif
-
-static const char INFSTR[] = "Infinity";
-static const char NANSTR[] = "NaN";
-static const char ZEROSTR[] = "0";
-
-/* dtoa for IEEE arithmetic (dmg): convert double to ASCII string.
- *
- * Inspired by "How to Print Floating-Point Numbers Accurately" by
- * Guy L. Steele, Jr. and Jon L. White [Proc. ACM SIGPLAN '90, pp. 112-126].
- *
- * Modifications:
- * 1. Rather than iterating, we use a simple numeric overestimate
- * to determine k = floor(log10(d)). We scale relevant
- * quantities using O(log2(k)) rather than O(k) multiplications.
- * 2. For some modes > 2 (corresponding to ecvt and fcvt), we don't
- * try to generate digits strictly left to right. Instead, we
- * compute with fewer bits and propagate the carry if necessary
- * when rounding the final digit up. This is often faster.
- * 3. Under the assumption that input will be rounded nearest,
- * mode 0 renders 1e23 as 1e23 rather than 9.999999999999999e22.
- * That is, we allow equality in stopping tests when the
- * round-nearest rule will give the same floating-point value
- * as would satisfaction of the stopping test with strict
- * inequality.
- * 4. We remove common factors of powers of 2 from relevant
- * quantities.
- * 5. When converting floating-point integers less than 1e16,
- * we use floating-point arithmetic rather than resorting
- * to multiple-precision integers.
- * 6. When asked to produce fewer than 15 digits, we first try
- * to get by with floating-point arithmetic; we resort to
- * multiple-precision integer arithmetic only if we cannot
- * guarantee that the floating-point calculation has given
- * the correctly rounded result. For k requested digits and
- * "uniformly" distributed input, the probability is
- * something like 10^(k-15) that we must resort to the Long
- * calculation.
- */
-
-char *
-dtoa(double d_, int mode, int ndigits, int *decpt, int *sign, char **rve)
-{
- /* Arguments ndigits, decpt, sign are similar to those
- of ecvt and fcvt; trailing zeros are suppressed from
- the returned string. If not null, *rve is set to point
- to the end of the return value. If d is +-Infinity or NaN,
- then *decpt is set to 9999.
-
- mode:
- 0 ==> shortest string that yields d when read in
- and rounded to nearest.
- 1 ==> like 0, but with Steele & White stopping rule;
- e.g. with IEEE P754 arithmetic , mode 0 gives
- 1e23 whereas mode 1 gives 9.999999999999999e22.
- 2 ==> max(1,ndigits) significant digits. This gives a
- return value similar to that of ecvt, except
- that trailing zeros are suppressed.
- 3 ==> through ndigits past the decimal point. This
- gives a return value similar to that from fcvt,
- except that trailing zeros are suppressed, and
- ndigits can be negative.
- 4,5 ==> similar to 2 and 3, respectively, but (in
- round-nearest mode) with the tests of mode 0 to
- possibly return a shorter string that rounds to d.
- With IEEE arithmetic and compilation with
- -DHonor_FLT_ROUNDS, modes 4 and 5 behave the same
- as modes 2 and 3 when FLT_ROUNDS != 1.
- 6-9 ==> Debugging modes similar to mode - 4: don't try
- fast floating-point estimate (if applicable).
-
- Values of mode other than 0-9 are treated as mode 0.
-
- Sufficient space is allocated to the return value
- to hold the suppressed trailing zeros.
- */
-
- int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1,
- j, j1, k, k0, k_check, leftright, m2, m5, s2, s5,
- spec_case, try_quick, half = 0;
- Long L;
-#ifndef Sudden_Underflow
- int denorm;
- ULong x;
-#endif
- Bigint *b, *b1, *delta, *mlo = 0, *mhi = 0, *S;
- double ds;
- double_u d, d2, eps;
- char *s, *s0;
-#ifdef Honor_FLT_ROUNDS
- int rounding;
-#endif
-#ifdef SET_INEXACT
- int inexact, oldinexact;
-#endif
-
- dval(d) = d_;
-
-#ifndef MULTIPLE_THREADS
- if (dtoa_result) {
- freedtoa(dtoa_result);
- dtoa_result = 0;
- }
-#endif
-
- if (word0(d) & Sign_bit) {
- /* set sign for everything, including 0's and NaNs */
- *sign = 1;
- word0(d) &= ~Sign_bit; /* clear sign bit */
- }
- else
- *sign = 0;
-
-#if defined(IEEE_Arith) + defined(VAX)
-#ifdef IEEE_Arith
- if ((word0(d) & Exp_mask) == Exp_mask)
-#else
- if (word0(d) == 0x8000)
-#endif
- {
- /* Infinity or NaN */
- *decpt = 9999;
-#ifdef IEEE_Arith
- if (!word1(d) && !(word0(d) & 0xfffff))
- return rv_strdup(INFSTR, rve);
-#endif
- return rv_strdup(NANSTR, rve);
- }
-#endif
-#ifdef IBM
- dval(d) += 0; /* normalize */
-#endif
- if (!dval(d)) {
- *decpt = 1;
- return rv_strdup(ZEROSTR, rve);
- }
-
-#ifdef SET_INEXACT
- try_quick = oldinexact = get_inexact();
- inexact = 1;
-#endif
-#ifdef Honor_FLT_ROUNDS
- if ((rounding = Flt_Rounds) >= 2) {
- if (*sign)
- rounding = rounding == 2 ? 0 : 2;
- else
- if (rounding != 2)
- rounding = 0;
- }
-#endif
-
- b = d2b(dval(d), &be, &bbits);
-#ifdef Sudden_Underflow
- i = (int)(word0(d) >> Exp_shift1 & (Exp_mask>>Exp_shift1));
-#else
- if ((i = (int)(word0(d) >> Exp_shift1 & (Exp_mask>>Exp_shift1))) != 0) {
-#endif
- dval(d2) = dval(d);
- word0(d2) &= Frac_mask1;
- word0(d2) |= Exp_11;
-#ifdef IBM
- if (j = 11 - hi0bits(word0(d2) & Frac_mask))
- dval(d2) /= 1 << j;
-#endif
-
- /* log(x) ~=~ log(1.5) + (x-1.5)/1.5
- * log10(x) = log(x) / log(10)
- * ~=~ log(1.5)/log(10) + (x-1.5)/(1.5*log(10))
- * log10(d) = (i-Bias)*log(2)/log(10) + log10(d2)
- *
- * This suggests computing an approximation k to log10(d) by
- *
- * k = (i - Bias)*0.301029995663981
- * + ( (d2-1.5)*0.289529654602168 + 0.176091259055681 );
- *
- * We want k to be too large rather than too small.
- * The error in the first-order Taylor series approximation
- * is in our favor, so we just round up the constant enough
- * to compensate for any error in the multiplication of
- * (i - Bias) by 0.301029995663981; since |i - Bias| <= 1077,
- * and 1077 * 0.30103 * 2^-52 ~=~ 7.2e-14,
- * adding 1e-13 to the constant term more than suffices.
- * Hence we adjust the constant term to 0.1760912590558.
- * (We could get a more accurate k by invoking log10,
- * but this is probably not worthwhile.)
- */
-
- i -= Bias;
-#ifdef IBM
- i <<= 2;
- i += j;
-#endif
-#ifndef Sudden_Underflow
- denorm = 0;
- }
- else {
- /* d is denormalized */
-
- i = bbits + be + (Bias + (P-1) - 1);
- x = i > 32 ? word0(d) << (64 - i) | word1(d) >> (i - 32)
- : word1(d) << (32 - i);
- dval(d2) = x;
- word0(d2) -= 31*Exp_msk1; /* adjust exponent */
- i -= (Bias + (P-1) - 1) + 1;
- denorm = 1;
- }
-#endif
- ds = (dval(d2)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
- k = (int)ds;
- if (ds < 0. && ds != k)
- k--; /* want k = floor(ds) */
- k_check = 1;
- if (k >= 0 && k <= Ten_pmax) {
- if (dval(d) < tens[k])
- k--;
- k_check = 0;
- }
- j = bbits - i - 1;
- if (j >= 0) {
- b2 = 0;
- s2 = j;
- }
- else {
- b2 = -j;
- s2 = 0;
- }
- if (k >= 0) {
- b5 = 0;
- s5 = k;
- s2 += k;
- }
- else {
- b2 -= k;
- b5 = -k;
- s5 = 0;
- }
- if (mode < 0 || mode > 9)
- mode = 0;
-
-#ifndef SET_INEXACT
-#ifdef Check_FLT_ROUNDS
- try_quick = Rounding == 1;
-#else
- try_quick = 1;
-#endif
-#endif /*SET_INEXACT*/
-
- if (mode > 5) {
- mode -= 4;
- try_quick = 0;
- }
- leftright = 1;
- ilim = ilim1 = -1;
- switch (mode) {
- case 0:
- case 1:
- i = 18;
- ndigits = 0;
- break;
- case 2:
- leftright = 0;
- /* no break */
- case 4:
- if (ndigits <= 0)
- ndigits = 1;
- ilim = ilim1 = i = ndigits;
- break;
- case 3:
- leftright = 0;
- /* no break */
- case 5:
- i = ndigits + k + 1;
- ilim = i;
- ilim1 = i - 1;
- if (i <= 0)
- i = 1;
- }
- s = s0 = rv_alloc(i+1);
-
-#ifdef Honor_FLT_ROUNDS
- if (mode > 1 && rounding != 1)
- leftright = 0;
-#endif
-
- if (ilim >= 0 && ilim <= Quick_max && try_quick) {
-
- /* Try to get by with floating-point arithmetic. */
-
- i = 0;
- dval(d2) = dval(d);
- k0 = k;
- ilim0 = ilim;
- ieps = 2; /* conservative */
- if (k > 0) {
- ds = tens[k&0xf];
- j = k >> 4;
- if (j & Bletch) {
- /* prevent overflows */
- j &= Bletch - 1;
- dval(d) /= bigtens[n_bigtens-1];
- ieps++;
- }
- for (; j; j >>= 1, i++)
- if (j & 1) {
- ieps++;
- ds *= bigtens[i];
- }
- dval(d) /= ds;
- }
- else if ((j1 = -k) != 0) {
- dval(d) *= tens[j1 & 0xf];
- for (j = j1 >> 4; j; j >>= 1, i++)
- if (j & 1) {
- ieps++;
- dval(d) *= bigtens[i];
- }
- }
- if (k_check && dval(d) < 1. && ilim > 0) {
- if (ilim1 <= 0)
- goto fast_failed;
- ilim = ilim1;
- k--;
- dval(d) *= 10.;
- ieps++;
- }
- dval(eps) = ieps*dval(d) + 7.;
- word0(eps) -= (P-1)*Exp_msk1;
- if (ilim == 0) {
- S = mhi = 0;
- dval(d) -= 5.;
- if (dval(d) > dval(eps))
- goto one_digit;
- if (dval(d) < -dval(eps))
- goto no_digits;
- goto fast_failed;
- }
-#ifndef No_leftright
- if (leftright) {
- /* Use Steele & White method of only
- * generating digits needed.
- */
- dval(eps) = 0.5/tens[ilim-1] - dval(eps);
- for (i = 0;;) {
- L = (int)dval(d);
- dval(d) -= L;
- *s++ = '0' + (int)L;
- if (dval(d) < dval(eps))
- goto ret1;
- if (1. - dval(d) < dval(eps))
- goto bump_up;
- if (++i >= ilim)
- break;
- dval(eps) *= 10.;
- dval(d) *= 10.;
- }
- }
- else {
-#endif
- /* Generate ilim digits, then fix them up. */
- dval(eps) *= tens[ilim-1];
- for (i = 1;; i++, dval(d) *= 10.) {
- L = (Long)(dval(d));
- if (!(dval(d) -= L))
- ilim = i;
- *s++ = '0' + (int)L;
- if (i == ilim) {
- if (dval(d) > 0.5 + dval(eps))
- goto bump_up;
- else if (dval(d) < 0.5 - dval(eps)) {
- while (*--s == '0') ;
- s++;
- goto ret1;
- }
- half = 1;
- if ((*(s-1) - '0') & 1) {
- goto bump_up;
- }
- break;
- }
- }
-#ifndef No_leftright
- }
-#endif
-fast_failed:
- s = s0;
- dval(d) = dval(d2);
- k = k0;
- ilim = ilim0;
- }
-
- /* Do we have a "small" integer? */
-
- if (be >= 0 && k <= Int_max) {
- /* Yes. */
- ds = tens[k];
- if (ndigits < 0 && ilim <= 0) {
- S = mhi = 0;
- if (ilim < 0 || dval(d) <= 5*ds)
- goto no_digits;
- goto one_digit;
- }
- for (i = 1;; i++, dval(d) *= 10.) {
- L = (Long)(dval(d) / ds);
- dval(d) -= L*ds;
-#ifdef Check_FLT_ROUNDS
- /* If FLT_ROUNDS == 2, L will usually be high by 1 */
- if (dval(d) < 0) {
- L--;
- dval(d) += ds;
- }
-#endif
- *s++ = '0' + (int)L;
- if (!dval(d)) {
-#ifdef SET_INEXACT
- inexact = 0;
-#endif
- break;
- }
- if (i == ilim) {
-#ifdef Honor_FLT_ROUNDS
- if (mode > 1)
- switch (rounding) {
- case 0: goto ret1;
- case 2: goto bump_up;
- }
-#endif
- dval(d) += dval(d);
- if (dval(d) > ds || (dval(d) == ds && (L & 1))) {
-bump_up:
- while (*--s == '9')
- if (s == s0) {
- k++;
- *s = '0';
- break;
- }
- ++*s++;
- }
- break;
- }
- }
- goto ret1;
- }
-
- m2 = b2;
- m5 = b5;
- if (leftright) {
- i =
-#ifndef Sudden_Underflow
- denorm ? be + (Bias + (P-1) - 1 + 1) :
-#endif
-#ifdef IBM
- 1 + 4*P - 3 - bbits + ((bbits + be - 1) & 3);
-#else
- 1 + P - bbits;
-#endif
- b2 += i;
- s2 += i;
- mhi = i2b(1);
- }
- if (m2 > 0 && s2 > 0) {
- i = m2 < s2 ? m2 : s2;
- b2 -= i;
- m2 -= i;
- s2 -= i;
- }
- if (b5 > 0) {
- if (leftright) {
- if (m5 > 0) {
- mhi = pow5mult(mhi, m5);
- b1 = mult(mhi, b);
- Bfree(b);
- b = b1;
- }
- if ((j = b5 - m5) != 0)
- b = pow5mult(b, j);
- }
- else
- b = pow5mult(b, b5);
- }
- S = i2b(1);
- if (s5 > 0)
- S = pow5mult(S, s5);
-
- /* Check for special case that d is a normalized power of 2. */
-
- spec_case = 0;
- if ((mode < 2 || leftright)
-#ifdef Honor_FLT_ROUNDS
- && rounding == 1
-#endif
- ) {
- if (!word1(d) && !(word0(d) & Bndry_mask)
-#ifndef Sudden_Underflow
- && word0(d) & (Exp_mask & ~Exp_msk1)
-#endif
- ) {
- /* The special case */
- b2 += Log2P;
- s2 += Log2P;
- spec_case = 1;
- }
- }
-
- /* Arrange for convenient computation of quotients:
- * shift left if necessary so divisor has 4 leading 0 bits.
- *
- * Perhaps we should just compute leading 28 bits of S once
- * and for all and pass them and a shift to quorem, so it
- * can do shifts and ors to compute the numerator for q.
- */
-#ifdef Pack_32
- if ((i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0x1f) != 0)
- i = 32 - i;
-#else
- if ((i = ((s5 ? 32 - hi0bits(S->x[S->wds-1]) : 1) + s2) & 0xf) != 0)
- i = 16 - i;
-#endif
- if (i > 4) {
- i -= 4;
- b2 += i;
- m2 += i;
- s2 += i;
- }
- else if (i < 4) {
- i += 28;
- b2 += i;
- m2 += i;
- s2 += i;
- }
- if (b2 > 0)
- b = lshift(b, b2);
- if (s2 > 0)
- S = lshift(S, s2);
- if (k_check) {
- if (cmp(b,S) < 0) {
- k--;
- b = multadd(b, 10, 0); /* we botched the k estimate */
- if (leftright)
- mhi = multadd(mhi, 10, 0);
- ilim = ilim1;
- }
- }
- if (ilim <= 0 && (mode == 3 || mode == 5)) {
- if (ilim < 0 || cmp(b,S = multadd(S,5,0)) <= 0) {
- /* no digits, fcvt style */
-no_digits:
- k = -1 - ndigits;
- goto ret;
- }
-one_digit:
- *s++ = '1';
- k++;
- goto ret;
- }
- if (leftright) {
- if (m2 > 0)
- mhi = lshift(mhi, m2);
-
- /* Compute mlo -- check for special case
- * that d is a normalized power of 2.
- */
-
- mlo = mhi;
- if (spec_case) {
- mhi = Balloc(mhi->k);
- Bcopy(mhi, mlo);
- mhi = lshift(mhi, Log2P);
- }
-
- for (i = 1;;i++) {
- dig = quorem(b,S) + '0';
- /* Do we yet have the shortest decimal string
- * that will round to d?
- */
- j = cmp(b, mlo);
- delta = diff(S, mhi);
- j1 = delta->sign ? 1 : cmp(b, delta);
- Bfree(delta);
-#ifndef ROUND_BIASED
- if (j1 == 0 && mode != 1 && !(word1(d) & 1)
-#ifdef Honor_FLT_ROUNDS
- && rounding >= 1
-#endif
- ) {
- if (dig == '9')
- goto round_9_up;
- if (j > 0)
- dig++;
-#ifdef SET_INEXACT
- else if (!b->x[0] && b->wds <= 1)
- inexact = 0;
-#endif
- *s++ = dig;
- goto ret;
- }
-#endif
- if (j < 0 || (j == 0 && mode != 1
-#ifndef ROUND_BIASED
- && !(word1(d) & 1)
-#endif
- )) {
- if (!b->x[0] && b->wds <= 1) {
-#ifdef SET_INEXACT
- inexact = 0;
-#endif
- goto accept_dig;
- }
-#ifdef Honor_FLT_ROUNDS
- if (mode > 1)
- switch (rounding) {
- case 0: goto accept_dig;
- case 2: goto keep_dig;
- }
-#endif /*Honor_FLT_ROUNDS*/
- if (j1 > 0) {
- b = lshift(b, 1);
- j1 = cmp(b, S);
- if ((j1 > 0 || (j1 == 0 && (dig & 1))) && dig++ == '9')
- goto round_9_up;
- }
-accept_dig:
- *s++ = dig;
- goto ret;
- }
- if (j1 > 0) {
-#ifdef Honor_FLT_ROUNDS
- if (!rounding)
- goto accept_dig;
-#endif
- if (dig == '9') { /* possible if i == 1 */
-round_9_up:
- *s++ = '9';
- goto roundoff;
- }
- *s++ = dig + 1;
- goto ret;
- }
-#ifdef Honor_FLT_ROUNDS
-keep_dig:
-#endif
- *s++ = dig;
- if (i == ilim)
- break;
- b = multadd(b, 10, 0);
- if (mlo == mhi)
- mlo = mhi = multadd(mhi, 10, 0);
- else {
- mlo = multadd(mlo, 10, 0);
- mhi = multadd(mhi, 10, 0);
- }
- }
- }
- else
- for (i = 1;; i++) {
- *s++ = dig = quorem(b,S) + '0';
- if (!b->x[0] && b->wds <= 1) {
-#ifdef SET_INEXACT
- inexact = 0;
-#endif
- goto ret;
- }
- if (i >= ilim)
- break;
- b = multadd(b, 10, 0);
- }
-
- /* Round off last digit */
-
-#ifdef Honor_FLT_ROUNDS
- switch (rounding) {
- case 0: goto trimzeros;
- case 2: goto roundoff;
- }
-#endif
- b = lshift(b, 1);
- j = cmp(b, S);
- if (j > 0 || (j == 0 && (dig & 1))) {
- roundoff:
- while (*--s == '9')
- if (s == s0) {
- k++;
- *s++ = '1';
- goto ret;
- }
- if (!half || (*s - '0') & 1)
- ++*s;
- }
- else {
- while (*--s == '0') ;
- }
- s++;
-ret:
- Bfree(S);
- if (mhi) {
- if (mlo && mlo != mhi)
- Bfree(mlo);
- Bfree(mhi);
- }
-ret1:
-#ifdef SET_INEXACT
- if (inexact) {
- if (!oldinexact) {
- word0(d) = Exp_1 + (70 << Exp_shift);
- word1(d) = 0;
- dval(d) += 1.;
- }
- }
- else if (!oldinexact)
- clear_inexact();
-#endif
- Bfree(b);
- *s = 0;
- *decpt = k + 1;
- if (rve)
- *rve = s;
- return s0;
-}
-
-/*-
- * Copyright (c) 2004-2008 David Schultz
- * All rights reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in the
- * documentation and/or other materials provided with the distribution.
- *
- * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
- * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
- * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
- * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
- * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
- * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
- * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
- * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
- * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- */
-
-#define DBL_MANH_SIZE 20
-#define DBL_MANL_SIZE 32
-#define DBL_ADJ (DBL_MAX_EXP - 2)
-#define SIGFIGS ((DBL_MANT_DIG + 3) / 4 + 1)
-#define dexp_get(u) ((int)(word0(u) >> Exp_shift) & ~Exp_msk1)
-#define dexp_set(u,v) (word0(u) = (((int)(word0(u)) & ~Exp_mask) | ((v) << Exp_shift)))
-#define dmanh_get(u) ((uint32_t)(word0(u) & Frac_mask))
-#define dmanl_get(u) ((uint32_t)word1(u))
-
-
-/*
- * This procedure converts a double-precision number in IEEE format
- * into a string of hexadecimal digits and an exponent of 2. Its
- * behavior is bug-for-bug compatible with dtoa() in mode 2, with the
- * following exceptions:
- *
- * - An ndigits < 0 causes it to use as many digits as necessary to
- * represent the number exactly.
- * - The additional xdigs argument should point to either the string
- * "0123456789ABCDEF" or the string "0123456789abcdef", depending on
- * which case is desired.
- * - This routine does not repeat dtoa's mistake of setting decpt
- * to 9999 in the case of an infinity or NaN. INT_MAX is used
- * for this purpose instead.
- *
- * Note that the C99 standard does not specify what the leading digit
- * should be for non-zero numbers. For instance, 0x1.3p3 is the same
- * as 0x2.6p2 is the same as 0x4.cp3. This implementation always makes
- * the leading digit a 1. This ensures that the exponent printed is the
- * actual base-2 exponent, i.e., ilogb(d).
- *
- * Inputs: d, xdigs, ndigits
- * Outputs: decpt, sign, rve
- */
-char *
-hdtoa(double d, const char *xdigs, int ndigits, int *decpt, int *sign, char **rve)
-{
- U u;
- char *s, *s0;
- int bufsize;
- uint32_t manh, manl;
-
- u.d = d;
- if (word0(u) & Sign_bit) {
- /* set sign for everything, including 0's and NaNs */
- *sign = 1;
- word0(u) &= ~Sign_bit; /* clear sign bit */
- }
- else
- *sign = 0;
-
- if (isinf(d)) { /* FP_INFINITE */
- *decpt = INT_MAX;
- return rv_strdup(INFSTR, rve);
- }
- else if (isnan(d)) { /* FP_NAN */
- *decpt = INT_MAX;
- return rv_strdup(NANSTR, rve);
- }
- else if (d == 0.0) { /* FP_ZERO */
- *decpt = 1;
- return rv_strdup(ZEROSTR, rve);
- }
- else if (dexp_get(u)) { /* FP_NORMAL */
- *decpt = dexp_get(u) - DBL_ADJ;
- }
- else { /* FP_SUBNORMAL */
- u.d *= 5.363123171977039e+154 /* 0x1p514 */;
- *decpt = dexp_get(u) - (514 + DBL_ADJ);
- }
-
- if (ndigits == 0) /* dtoa() compatibility */
- ndigits = 1;
-
- /*
- * If ndigits < 0, we are expected to auto-size, so we allocate
- * enough space for all the digits.
- */
- bufsize = (ndigits > 0) ? ndigits : SIGFIGS;
- s0 = rv_alloc(bufsize+1);
-
- /* Round to the desired number of digits. */
- if (SIGFIGS > ndigits && ndigits > 0) {
- float redux = 1.0f;
- int offset = 4 * ndigits + DBL_MAX_EXP - 4 - DBL_MANT_DIG;
- dexp_set(u, offset);
- u.d += redux;
- u.d -= redux;
- *decpt += dexp_get(u) - offset;
- }
-
- manh = dmanh_get(u);
- manl = dmanl_get(u);
- *s0 = '1';
- for (s = s0 + 1; s < s0 + bufsize; s++) {
- *s = xdigs[(manh >> (DBL_MANH_SIZE - 4)) & 0xf];
- manh = (manh << 4) | (manl >> (DBL_MANL_SIZE - 4));
- manl <<= 4;
- }
-
- /* If ndigits < 0, we are expected to auto-size the precision. */
- if (ndigits < 0) {
- for (ndigits = SIGFIGS; s0[ndigits - 1] == '0'; ndigits--)
- ;
- }
-
- s = s0 + ndigits;
- *s = '\0';
- if (rve != NULL)
- *rve = s;
- return (s0);
-}
-
-#ifdef __cplusplus
-#if 0
-{ /* satisfy cc-mode */
-#endif
-}
-#endif
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/static_assert.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/static_assert.h
deleted file mode 100644
index 9295729..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/ext/bigdecimal/static_assert.h
+++ /dev/null
@@ -1,54 +0,0 @@
-#ifndef BIGDECIMAL_STATIC_ASSERT_H
-#define BIGDECIMAL_STATIC_ASSERT_H
-
-#include "feature.h"
-
-#ifdef HAVE_RUBY_INTERNAL_STATIC_ASSERT_H
-# include
-#endif
-
-#ifdef RBIMPL_STATIC_ASSERT
-# define STATIC_ASSERT RBIMPL_STATIC_ASSERT
-#endif
-
-#ifndef STATIC_ASSERT
-# /* The following section is copied from CRuby's static_assert.h */
-
-# if defined(__cplusplus) && defined(__cpp_static_assert)
-# /* https://isocpp.org/std/standing-documents/sd-6-sg10-feature-test-recommendations */
-# define BIGDECIMAL_STATIC_ASSERT0 static_assert
-
-# elif defined(__cplusplus) && defined(_MSC_VER) && _MSC_VER >= 1600
-# define BIGDECIMAL_STATIC_ASSERT0 static_assert
-
-# elif defined(__INTEL_CXX11_MODE__)
-# define BIGDECIMAL_STATIC_ASSERT0 static_assert
-
-# elif defined(__cplusplus) && __cplusplus >= 201103L
-# define BIGDECIMAL_STATIC_ASSERT0 static_assert
-
-# elif defined(__cplusplus) && __has_extension(cxx_static_assert)
-# define BIGDECIMAL_STATIC_ASSERT0 __extension__ static_assert
-
-# elif defined(__STDC_VERSION__) && __has_extension(c_static_assert)
-# define BIGDECIMAL_STATIC_ASSERT0 __extension__ _Static_assert
-
-# elif defined(__STDC_VERSION__) && defined(__GNUC__) && (__GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 6))
-# define BIGDECIMAL_STATIC_ASSERT0 __extension__ _Static_assert
-#endif
-
-# if defined(__DOXYGEN__)
-# define STATIC_ASSERT static_assert
-
-# elif defined(BIGDECIMAL_STATIC_ASSERT0)
-# define STATIC_ASSERT(name, expr) \
- BIGDECIMAL_STATIC_ASSERT0(expr, #name ": " #expr)
-
-# else
-# define STATIC_ASSERT(name, expr) \
- typedef int static_assert_ ## name ## _check[1 - 2 * !(expr)]
-# endif
-#endif /* STATIC_ASSERT */
-
-
-#endif /* BIGDECIMAL_STATIC_ASSERT_H */
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/linear.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/linear.rb
deleted file mode 100644
index 516c247..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/linear.rb
+++ /dev/null
@@ -1,74 +0,0 @@
-#!/usr/local/bin/ruby
-# frozen_string_literal: false
-
-#
-# linear.rb
-#
-# Solves linear equation system(A*x = b) by LU decomposition method.
-# where A is a coefficient matrix,x is an answer vector,b is a constant vector.
-#
-# USAGE:
-# ruby linear.rb [input file solved]
-#
-
-# :stopdoc:
-require "bigdecimal"
-require "bigdecimal/ludcmp"
-
-#
-# NOTE:
-# Change following BigDecimal.limit() if needed.
-BigDecimal.limit(100)
-#
-
-include LUSolve
-def rd_order(na)
- printf("Number of equations ?") if(na <= 0)
- n = ARGF.gets().to_i
-end
-
-na = ARGV.size
-zero = BigDecimal("0.0")
-one = BigDecimal("1.0")
-
-while (n=rd_order(na))>0
- a = []
- as= []
- b = []
- if na <= 0
- # Read data from console.
- printf("\nEnter coefficient matrix element A[i,j]\n")
- for i in 0...n do
- for j in 0...n do
- printf("A[%d,%d]? ",i,j); s = ARGF.gets
- a << BigDecimal(s)
- as << BigDecimal(s)
- end
- printf("Contatant vector element b[%d] ? ",i)
- b << BigDecimal(ARGF.gets)
- end
- else
- # Read data from specified file.
- printf("Coefficient matrix and constant vector.\n")
- for i in 0...n do
- s = ARGF.gets
- printf("%d) %s",i,s)
- s = s.split
- for j in 0...n do
- a << BigDecimal(s[j])
- as << BigDecimal(s[j])
- end
- b << BigDecimal(s[n])
- end
- end
- x = lusolve(a,b,ludecomp(a,n,zero,one),zero)
- printf("Answer(x[i] & (A*x-b)[i]) follows\n")
- for i in 0...n do
- printf("x[%d]=%s ",i,x[i].to_s)
- s = zero
- for j in 0...n do
- s = s + as[i*n+j]*x[j]
- end
- printf(" & %s\n",(s-b[i]).to_s)
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/nlsolve.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/nlsolve.rb
deleted file mode 100644
index c2227da..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/nlsolve.rb
+++ /dev/null
@@ -1,40 +0,0 @@
-#!/usr/local/bin/ruby
-# frozen_string_literal: false
-
-#
-# nlsolve.rb
-# An example for solving nonlinear algebraic equation system.
-#
-
-require "bigdecimal"
-require "bigdecimal/newton"
-include Newton
-
-class Function # :nodoc: all
- def initialize()
- @zero = BigDecimal("0.0")
- @one = BigDecimal("1.0")
- @two = BigDecimal("2.0")
- @ten = BigDecimal("10.0")
- @eps = BigDecimal("1.0e-16")
- end
- def zero;@zero;end
- def one ;@one ;end
- def two ;@two ;end
- def ten ;@ten ;end
- def eps ;@eps ;end
- def values(x) # <= defines functions solved
- f = []
- f1 = x[0]*x[0] + x[1]*x[1] - @two # f1 = x**2 + y**2 - 2 => 0
- f2 = x[0] - x[1] # f2 = x - y => 0
- f <<= f1
- f <<= f2
- f
- end
-end
-
-f = BigDecimal.limit(100)
-f = Function.new
-x = [f.zero,f.zero] # Initial values
-n = nlsolve(f,x)
-p x
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/pi.rb b/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/pi.rb
deleted file mode 100644
index ea96638..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/bigdecimal-3.1.4/sample/pi.rb
+++ /dev/null
@@ -1,21 +0,0 @@
-#!/usr/local/bin/ruby
-# frozen_string_literal: false
-
-#
-# pi.rb
-#
-# Calculates 3.1415.... (the number of times that a circle's diameter
-# will fit around the circle) using J. Machin's formula.
-#
-
-require "bigdecimal"
-require "bigdecimal/math.rb"
-
-include BigMath
-
-if ARGV.size == 1
- print "PI("+ARGV[0]+"):\n"
- p PI(ARGV[0].to_i)
-else
- print "TRY: ruby pi.rb 1000 \n"
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/coffee-script-2.4.1/LICENSE b/docs/website/vendor/bundle/ruby/3.0.0/gems/coffee-script-2.4.1/LICENSE
deleted file mode 100644
index 35f79f5..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/coffee-script-2.4.1/LICENSE
+++ /dev/null
@@ -1,22 +0,0 @@
-Copyright (c) 2010 Joshua Peek
-
-Permission is hereby granted, free of charge, to any person
-obtaining a copy of this software and associated documentation
-files (the "Software"), to deal in the Software without
-restriction, including without limitation the rights to use,
-copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the
-Software is furnished to do so, subject to the following
-conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
-OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
-HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
-WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
-OTHER DEALINGS IN THE SOFTWARE.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/coffee-script-2.4.1/README.md b/docs/website/vendor/bundle/ruby/3.0.0/gems/coffee-script-2.4.1/README.md
deleted file mode 100644
index a76e8e2..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/coffee-script-2.4.1/README.md
+++ /dev/null
@@ -1,43 +0,0 @@
-Ruby CoffeeScript
-=================
-
-Ruby CoffeeScript is a bridge to the official CoffeeScript compiler.
-
- CoffeeScript.compile File.read("script.coffee")
-
-
-Installation
-------------
-
- gem install coffee-script
-
-*Note: This compiler library has replaced the original CoffeeScript
- compiler that was written in Ruby.*
-
-
-Dependencies
-------------
-
-This library depends on the `coffee-script-source` gem which is
-updated any time a new version of CoffeeScript is released. (The
-`coffee-script-source` gem's version number is synced with each
-official CoffeeScript release.) This way you can build against
-different versions of CoffeeScript by requiring the correct version of
-the `coffee-script-source` gem.
-
-In addition, you can use this library with unreleased versions of
-CoffeeScript by setting the `COFFEESCRIPT_SOURCE_PATH` environment
-variable:
-
- export COFFEESCRIPT_SOURCE_PATH=/path/to/coffee-script/extras/coffee-script.js
-
-### JSON
-
-The `json` library is also required but is not explicitly stated as a
-gem dependency. If you're on Ruby 1.8 you'll need to install the
-`json` or `json_pure` gem. On Ruby 1.9, `json` is included in the
-standard library.
-
-### ExecJS
-
-The [ExecJS](https://github.com/sstephenson/execjs) library is used to automatically choose the best JavaScript engine for your platform. Check out its [README](https://github.com/sstephenson/execjs/blob/master/README.md) for a complete list of supported engines.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/Gemfile b/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/Gemfile
deleted file mode 100644
index 044fba3..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/Gemfile
+++ /dev/null
@@ -1,11 +0,0 @@
-source "https://rubygems.org"
-gemspec
-
-gem "rake"
-group :development do
- gem "rspec-helpers", :require => false
- gem "luna-rspec-formatters", :require => false
- gem "pry", :require => false unless ENV[
- "CI"
- ]
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/History.markdown b/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/History.markdown
deleted file mode 100644
index bac4270..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/History.markdown
+++ /dev/null
@@ -1,25 +0,0 @@
-## 1.1.0 / 2016-06-28
-
-### Minor Enhancements
-
-* Support jruby (#8)
-
-## 1.0.0 / 2016-04-28
-
-### Major enhancements
-
-- Merge Simple::ANSI and Colorator. (#7)
-
-### Minor Enhancements
-
-- Delete unnecessary `Symbol#to_sym` (#2)
-- Change argument name of `Enumerator#each` for better code legibility (#3)
-
-### Development Fixes
-
-- Convert to new RSpec expectation syntax (#1)
-- Fix `String#blue` result in README (#4)
-
-## 0.1 / 2013-04-13
-
-Birthday!
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/LICENSE b/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/LICENSE
deleted file mode 100644
index b3b6be9..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/LICENSE
+++ /dev/null
@@ -1,21 +0,0 @@
-The MIT License
-
-Copyright (c) Parker Moore
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
\ No newline at end of file
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/README.markdown b/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/README.markdown
deleted file mode 100644
index 9cf886d..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/README.markdown
+++ /dev/null
@@ -1,47 +0,0 @@
-# colorator
-
-Colorize your text for the terminal
-
-[](https://travis-ci.org/octopress/colorator)
-
-## Example
-
-```ruby
-"this string".red
-# => \e[31mthis string\e[0m
-"my string".blue
-# => \e[34mmy string\e[0m
-# etc...
-```
-
-## Supported Colors
-
-- `red`
-- `black`
-- `green`
-- `yellow`
-- `magenta`
-- `white`
-- `blue`
-- `cyan`
-- `bold`
-
-## Other supported Ansi methods
-
-- `clear_line`
-- `has_ansi?`, `has_color?`
-- `strip_ansi`, `strip_color`
-- `reset_ansi`, `reset_color`
-- `clear_screen`
-- `ansi_jump`
-
-## Why
-
-There are a bunch of gems that provide functionality like this, but none have
-as simple an API as this. Just call `"string".color` and your text will be
-colorized.
-
-## License
-
-MIT. Written as a single Ruby file by Brandon Mathis, converted into a gem by
-Parker Moore.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/Rakefile b/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/Rakefile
deleted file mode 100644
index b7e9ed5..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/Rakefile
+++ /dev/null
@@ -1,6 +0,0 @@
-require "bundler/gem_tasks"
-require "rspec/core/rake_task"
-
-RSpec::Core::RakeTask.new(:spec)
-
-task :default => :spec
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/colorator.gemspec b/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/colorator.gemspec
deleted file mode 100644
index a4bd0cd..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/colorator-1.1.0/colorator.gemspec
+++ /dev/null
@@ -1,23 +0,0 @@
-# coding: utf-8
-
-require File.expand_path('lib/colorator.rb', __dir__)
-
-Gem::Specification.new do |spec|
- spec.name = "colorator"
- spec.summary = "Colorize your text in the terminal."
- spec.version = Colorator::VERSION
- spec.authors = ["Parker Moore", "Brandon Mathis"]
- spec.email = ["parkrmoore@gmail.com", "brandon@imathis.com"]
- spec.homepage = "https://github.com/octopress/colorator"
- spec.licenses = ["MIT"]
-
- all = `git ls-files -z`.split("\x0").reject { |f| f.start_with?(".") }
- spec.files = all.select { |f| File.basename(f) == f || f =~ %r{^(bin|lib)/} }
- spec.executables = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
- spec.require_paths = ["lib"]
-
- spec.extra_rdoc_files = ["README.markdown", "LICENSE"]
- spec.rdoc_options = ["--charset=UTF-8"]
-
- spec.add_development_dependency "rspec", "~> 3.1"
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/LICENSE.txt b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/LICENSE.txt
deleted file mode 100644
index 452887a..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/LICENSE.txt
+++ /dev/null
@@ -1,22 +0,0 @@
-Copyright (c) 2015 Garen J. Torikian
-
-MIT License
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/README.md b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/README.md
deleted file mode 100644
index 84fcd07..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/README.md
+++ /dev/null
@@ -1,288 +0,0 @@
-# CommonMarker
-
- [](http://badge.fury.io/rb/commonmarker)
-
-Ruby wrapper for [libcmark-gfm](https://github.com/github/cmark),
-GitHub's fork of the reference parser for CommonMark. It passes all of the C tests, and is therefore spec-complete. It also includes extensions to the CommonMark spec as documented in the [GitHub Flavored Markdown spec](http://github.github.com/gfm/), such as support for tables, strikethroughs, and autolinking.
-
-For more information on available extensions, see [the documentation below](#extensions).
-
-## Installation
-
-Add this line to your application's Gemfile:
-
- gem 'commonmarker'
-
-And then execute:
-
- $ bundle
-
-Or install it yourself as:
-
- $ gem install commonmarker
-
-## Usage
-
-### Converting to HTML
-
-Call `render_html` on a string to convert it to HTML:
-
-``` ruby
-require 'commonmarker'
-CommonMarker.render_html('Hi *there*', :DEFAULT)
-#
Hi there
\n
-```
-
-The second argument is optional--[see below](#options) for more information.
-
-### Generating a document
-
-You can also parse a string to receive a `Document` node. You can then print that node to HTML, iterate over the children, and other fun node stuff. For example:
-
-``` ruby
-require 'commonmarker'
-
-doc = CommonMarker.render_doc('*Hello* world', :DEFAULT)
-puts(doc.to_html) #
Hi there
\n
-
-doc.walk do |node|
- puts node.type # [:document, :paragraph, :text, :emph, :text]
-end
-```
-
-The second argument is optional--[see below](#options) for more information.
-
-#### Example: walking the AST
-
-You can use `walk` or `each` to iterate over nodes:
-
-- `walk` will iterate on a node and recursively iterate on a node's children.
-- `each` will iterate on a node and its children, but no further.
-
-``` ruby
-require 'commonmarker'
-
-# parse the files specified on the command line
-doc = CommonMarker.render_doc("# The site\n\n [GitHub](https://www.github.com)")
-
-# Walk tree and print out URLs for links
-doc.walk do |node|
- if node.type == :link
- printf("URL = %s\n", node.url)
- end
-end
-
-# Capitalize all regular text in headers
-doc.walk do |node|
- if node.type == :header
- node.each do |subnode|
- if subnode.type == :text
- subnode.string_content = subnode.string_content.upcase
- end
- end
- end
-end
-
-# Transform links to regular text
-doc.walk do |node|
- if node.type == :link
- node.insert_before(node.first_child)
- node.delete
- end
-end
-```
-
-### Creating a custom renderer
-
-You can also derive a class from CommonMarker's `HtmlRenderer` class. This produces slower output, but is far more customizable. For example:
-
-``` ruby
-class MyHtmlRenderer < CommonMarker::HtmlRenderer
- def initialize
- super
- @headerid = 1
- end
-
- def header(node)
- block do
- out("",
- :children, "")
- @headerid += 1
- end
- end
-end
-
-myrenderer = MyHtmlRenderer.new
-puts myrenderer.render(doc)
-
-# Print any warnings to STDERR
-renderer.warnings.each do |w|
- STDERR.write("#{w}\n")
-end
-```
-
-## Options
-
-CommonMarker accepts the same options that CMark does, as symbols. Note that there is a distinction in CMark for "parse" options and "render" options, which are represented in the tables below.
-
-### Parse options
-
-| Name | Description
-| ----------------------------- | -----------
-| `:DEFAULT` | The default parsing system.
-| `:SOURCEPOS` | Include source position in nodes
-| `:UNSAFE` | Allow raw/custom HTML and unsafe links.
-| `:VALIDATE_UTF8` | Replace illegal sequences with the replacement character `U+FFFD`.
-| `:SMART` | Use smart punctuation (curly quotes, etc.).
-| `:LIBERAL_HTML_TAG` | Support liberal parsing of inline HTML tags.
-| `:FOOTNOTES` | Parse footnotes.
-| `:STRIKETHROUGH_DOUBLE_TILDE` | Parse strikethroughs by double tildes (compatibility with [redcarpet](https://github.com/vmg/redcarpet))
-
-### Render options
-
-| Name | Description |
-| ------------------ | ----------- |
-| `:DEFAULT` | The default rendering system. |
-| `:SOURCEPOS` | Include source position in rendered HTML. |
-| `:HARDBREAKS` | Treat `\n` as hardbreaks (by adding ` `). |
-| `:UNSAFE` | Allow raw/custom HTML and unsafe links. |
-| `:NOBREAKS` | Translate `\n` in the source to a single whitespace. |
-| `:VALIDATE_UTF8` | Replace illegal sequences with the replacement character `U+FFFD`. |
-| `:SMART` | Use smart punctuation (curly quotes, etc.). |
-| `:GITHUB_PRE_LANG` | Use GitHub-style `
` for fenced code blocks. |
-| `:LIBERAL_HTML_TAG` | Support liberal parsing of inline HTML tags. |
-| `:FOOTNOTES` | Render footnotes. |
-| `:STRIKETHROUGH_DOUBLE_TILDE` | Parse strikethroughs by double tildes (compatibility with [redcarpet](https://github.com/vmg/redcarpet)) |
-| `:TABLE_PREFER_STYLE_ATTRIBUTES` | Use `style` insted of `align` for table cells. |
-| `:FULL_INFO_STRING` | Include full info strings of code blocks in separate attribute. |
-
-### Passing options
-
-To apply a single option, pass it in as a symbol argument:
-
-``` ruby
-CommonMarker.render_doc("\"Hello,\" said the spider.", :SMART)
-#
“Hello,” said the spider.
\n
-```
-
-To have multiple options applied, pass in an array of symbols:
-
-``` ruby
-CommonMarker.render_html("\"'Shelob' is my name.\"", [:HARDBREAKS, :SOURCEPOS])
-```
-
-For more information on these options, see [the CMark documentation](https://git.io/v7nh1).
-
-## Extensions
-
-Both `render_html` and `render_doc` take an optional third argument defining the extensions you want enabled as your CommonMark document is being processed. The documentation for these extensions are [defined in this spec](https://github.github.com/gfm/), and the rationale is provided [in this blog post](https://githubengineering.com/a-formal-spec-for-github-markdown/).
-
-The available extensions are:
-
-* `:table` - This provides support for tables.
-* `:tasklist` - This provides support for task list items.
-* `:strikethrough` - This provides support for strikethroughs.
-* `:autolink` - This provides support for automatically converting URLs to anchor tags.
-* `:tagfilter` - This escapes [several "unsafe" HTML tags](https://github.github.com/gfm/#disallowed-raw-html-extension-), causing them to not have any effect.
-
-## Output formats
-
-Like CMark, CommonMarker can generate output in several formats: HTML, XML, plaintext, and commonmark are currently supported.
-
-### HTML
-
-The default output format, HTML, will be generated when calling `to_html` or using `--to=html` on the command line.
-
-```ruby
-doc = CommonMarker.render_doc('*Hello* world!', :DEFAULT)
-puts(doc.to_html)
-
-
Hello world!
-```
-
-### XML
-
-XML will be generated when calling `to_xml` or using `--to=xml` on the command line.
-
-```ruby
-doc = CommonMarker.render_doc('*Hello* world!', :DEFAULT)
-puts(doc.to_xml)
-
-
-
-
-
-
- Hello
-
- world!
-
-
-```
-
-### Plaintext
-
-Plaintext will be generated when calling `to_plaintext` or using `--to=plaintext` on the command line.
-
-```ruby
-doc = CommonMarker.render_doc('*Hello* world!', :DEFAULT)
-puts(doc.to_plaintext)
-
-Hello world!
-```
-
-### Commonmark
-
-Commonmark will be generated when calling `to_commonmark` or using `--to=commonmark` on the command line.
-
-``` ruby
-text = <<-TEXT
-1. I am a numeric list.
-2. I continue the list.
-* Suddenly, an unordered list!
-* What fun!
-TEXT
-
-doc = CommonMarker.render_doc(text, :DEFAULT)
-puts(doc.to_commonmark)
-
-1. I am a numeric list.
-2. I continue the list.
-
-
-
- - Suddenly, an unordered list\!
- - What fun\!
-```
-
-## Developing locally
-
-After cloning the repo:
-
-```
-script/bootstrap
-bundle exec rake compile
-```
-
-If there were no errors, you're done! Otherwise, make sure to follow the CMark dependency instructions.
-
-## Benchmarks
-
-Some rough benchmarks:
-
-```
-$ bundle exec rake benchmark
-
-input size = 11063727 bytes
-
-redcarpet
- 0.070000 0.020000 0.090000 ( 0.079641)
-github-markdown
- 0.070000 0.010000 0.080000 ( 0.083535)
-commonmarker with to_html
- 0.100000 0.010000 0.110000 ( 0.111947)
-commonmarker with ruby HtmlRenderer
- 1.830000 0.030000 1.860000 ( 1.866203)
-kramdown
- 4.610000 0.070000 4.680000 ( 4.678398)
-```
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/Rakefile b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/Rakefile
deleted file mode 100644
index 4daed66..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/Rakefile
+++ /dev/null
@@ -1,109 +0,0 @@
-# frozen_string_literal: true
-
-require "date"
-require "rake/clean"
-require "rake/extensiontask"
-require "digest/md5"
-
-host_os = RbConfig::CONFIG["host_os"]
-require "devkit" if host_os == "mingw32"
-
-task default: [:test]
-
-# Gem Spec
-gem_spec = Gem::Specification.load("commonmarker.gemspec")
-
-# Ruby Extension
-Rake::ExtensionTask.new("commonmarker", gem_spec) do |ext|
- ext.lib_dir = File.join("lib", "commonmarker")
-end
-
-# Packaging
-require "bundler/gem_tasks"
-
-# Testing
-require "rake/testtask"
-
-Rake::TestTask.new("test:unit") do |t|
- t.libs << "lib"
- t.libs << "test"
- t.pattern = "test/test_*.rb"
- t.verbose = true
- t.warning = false
-end
-
-desc "Run unit tests"
-task "test:unit" => :compile
-
-desc "Run unit and conformance tests"
-task test: ["test:unit"]
-
-require "rubocop/rake_task"
-
-RuboCop::RakeTask.new(:rubocop)
-
-desc "Run benchmarks"
-task :benchmark do
- if ENV["FETCH_PROGIT"]
- %x(rm -rf test/progit)
- %x(git clone https://github.com/progit/progit.git test/progit)
- langs = ["ar", "az", "be", "ca", "cs", "de", "en", "eo", "es", "es-ni", "fa", "fi", "fr", "hi", "hu", "id", "it", "ja", "ko", "mk", "nl", "no-nb", "pl", "pt-br", "ro", "ru", "sr", "th", "tr", "uk", "vi", "zh", "zh-tw"]
- langs.each do |lang|
- %x(cat test/progit/#{lang}/*/*.markdown >> test/benchinput.md)
- end
- end
- $LOAD_PATH.unshift("lib")
- load "test/benchmark.rb"
-end
-
-desc "Match C style of cmark"
-task :format do
- sh "clang-format -style llvm -i ext/commonmarker/*.c ext/commonmarker/*.h"
-end
-
-# Documentation
-require "rdoc/task"
-
-desc "Generate API documentation"
-RDoc::Task.new do |rd|
- rd.rdoc_dir = "docs"
- rd.main = "README.md"
- rd.rdoc_files.include("README.md", "lib/**/*.rb", "ext/commonmarker/commonmarker.c")
-
- rd.options << "--markup tomdoc"
- rd.options << "--inline-source"
- rd.options << "--line-numbers"
- rd.options << "--all"
- rd.options << "--fileboxes"
-end
-
-desc "Generate the documentation and run a web server"
-task serve: [:rdoc] do
- require "webrick"
-
- puts "Navigate to http://localhost:3000 to see the docs"
-
- server = WEBrick::HTTPServer.new(Port: 3000)
- server.mount("/", WEBrick::HTTPServlet::FileHandler, "docs")
- trap("INT") { server.stop }
- server.start
-end
-
-desc "Generate and publish docs to gh-pages"
-task publish: [:rdoc] do
- require "tmpdir"
- require "shellwords"
-
- Dir.mktmpdir do |tmp|
- system "mv docs/* #{tmp}"
- system "git checkout origin/gh-pages"
- system "rm -rf *"
- system "mv #{tmp}/* ."
- message = Shellwords.escape("Site updated at #{Time.now.utc}")
- system "git add ."
- system "git commit -am #{message}"
- system "git push origin gh-pages --force"
- system "git checkout master"
- system "echo yolo"
- end
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/bin/commonmarker b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/bin/commonmarker
deleted file mode 100755
index 3bfabe0..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/bin/commonmarker
+++ /dev/null
@@ -1,118 +0,0 @@
-#!/usr/bin/env ruby
-# frozen_string_literal: true
-
-require 'optparse'
-
-$LOAD_PATH.unshift File.join(File.dirname(__FILE__), '..', 'lib')
-require 'commonmarker'
-
-root = File.expand_path('..', __dir__)
-$LOAD_PATH.unshift File.expand_path('lib', root)
-
-def parse_options
- options = Struct.new(:active_extensions, :active_parse_options, :active_render_options, :output_format, :renderer)
- .new([], [:DEFAULT], [:DEFAULT], :html)
- extensions = CommonMarker.extensions
- parse_options = CommonMarker::Config::OPTS.fetch(:parse)
- render_options = CommonMarker::Config::OPTS.fetch(:render)
- format_options = CommonMarker::Config::OPTS.fetch(:format)
-
- option_parser = OptionParser.new do |opts|
- opts.banner = 'Usage: commonmarker [--html-renderer] [--extension=EXTENSION]'
- opts.separator ' [--to=FORMAT]'
- opts.separator ' [--parse-option=OPTION]'
- opts.separator ' [--render-option=OPTION]'
- opts.separator ' [FILE..]'
- opts.separator ''
- opts.separator 'Convert one or more CommonMark files to HTML and write to standard output.'
- opts.separator 'If no FILE argument is provided, text will be read from STDIN.'
- opts.separator ''
-
- opts.on('--extension=EXTENSION', Array, 'Use EXTENSION for parsing and HTML output (unless --html-renderer is specified)') do |values|
- values.each do |value|
- if extensions.include?(value)
- options.active_extensions << value.to_sym
- else
- abort("extension '#{value}' not found")
- end
- end
- end
-
- opts.on('-h', '--help', 'Prints this help') do
- puts opts
- puts
- puts "Available formats: #{format_options.join(', ')}"
- puts "Available extentions: #{extensions.join(', ')}"
- puts "Available parse options: #{parse_options.keys.join(', ')}"
- puts "Available render options: #{render_options.keys.join(', ')}"
- puts
- puts 'See the README for more information on these.'
- exit
- end
-
- opts.on('-tFORMAT', '--to=FORMAT', String, 'Specify output FORMAT') do |value|
- value = value.to_sym
- if format_options.include?(value)
- options.output_format = value
- else
- abort("format '#{value}' not found")
- end
- end
-
- opts.on('--html-renderer', 'Use the HtmlRenderer renderer rather than the native C renderer (only valid when format is html)') do
- options.renderer = true
- end
-
- opts.on('--parse-option=OPTION', Array, 'OPTION passed during parsing') do |values|
- values.each do |value|
- if parse_options.key?(value.to_sym)
- options.active_parse_options << value.to_sym
- else
- abort("parse-option '#{value}' not found")
- end
- end
- end
-
- opts.on('--render-option=OPTION', Array, 'OPTION passed during rendering') do |values|
- values.each do |value|
- if render_options.key?(value.to_sym)
- options.active_render_options << value.to_sym
- else
- abort("render-option '#{value}' not found")
- end
- end
- end
-
- opts.on('-v', '--version', 'Version information') do
- puts "commonmarker #{CommonMarker::VERSION}"
- exit
- end
- end
-
- option_parser.parse!
-
- options
-end
-
-options = parse_options
-
-abort("format '#{options.output_format}' does not support using the HtmlRenderer renderer") if
- options.renderer && options.output_format != :html
-
-doc = CommonMarker.render_doc(ARGF.read, options.active_parse_options, options.active_extensions)
-
-case options.output_format
-when :html
- if options.renderer
- renderer = CommonMarker::HtmlRenderer.new(options: options.active_render_options, extensions: options.active_extensions)
- $stdout.write(renderer.render(doc))
- else
- $stdout.write(doc.to_html(options.active_render_options, options.active_extensions))
- end
-when :xml
- $stdout.write(doc.to_xml(options.active_render_options))
-when :commonmark
- $stdout.write(doc.to_commonmark(options.active_render_options))
-when :plaintext
- $stdout.write(doc.to_plaintext(options.active_render_options))
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/commonmarker.gemspec b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/commonmarker.gemspec
deleted file mode 100644
index b2d5884..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/commonmarker.gemspec
+++ /dev/null
@@ -1,38 +0,0 @@
-# frozen_string_literal: true
-
-lib = File.expand_path("lib", __dir__)
-$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
-require "commonmarker/version"
-
-Gem::Specification.new do |s|
- s.name = "commonmarker"
- s.version = CommonMarker::VERSION
- s.summary = "CommonMark parser and renderer. Written in C, wrapped in Ruby."
- s.description = "A fast, safe, extensible parser for CommonMark. This wraps the official libcmark library."
- s.authors = ["Garen Torikian", "Ashe Connor"]
- s.homepage = "https://github.com/gjtorikian/commonmarker"
- s.license = "MIT"
-
- s.files = ["LICENSE.txt", "README.md", "Rakefile", "commonmarker.gemspec", "bin/commonmarker"]
- s.files += Dir.glob("lib/**/*.rb")
- s.files += Dir.glob("ext/commonmarker/*.*")
- s.extensions = ["ext/commonmarker/extconf.rb"]
-
- s.executables = ["commonmarker"]
- s.require_paths = ["lib", "ext"]
- s.required_ruby_version = [">= 2.6", "< 4.0"]
-
- s.metadata["rubygems_mfa_required"] = "true"
-
- s.rdoc_options += ["-x", "ext/commonmarker/cmark/.*"]
-
- s.add_development_dependency("awesome_print")
- s.add_development_dependency("json", "~> 2.3")
- s.add_development_dependency("minitest", "~> 5.6")
- s.add_development_dependency("minitest-focus", "~> 1.1")
- s.add_development_dependency("rake")
- s.add_development_dependency("rake-compiler", "~> 0.9")
- s.add_development_dependency("rdoc", "~> 6.2")
- s.add_development_dependency("rubocop")
- s.add_development_dependency("rubocop-standard")
-end
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/.sitearchdir.-.commonmarker.time b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/.sitearchdir.-.commonmarker.time
deleted file mode 100644
index e69de29..0000000
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/Makefile b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/Makefile
deleted file mode 100644
index a0ec3fd..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/Makefile
+++ /dev/null
@@ -1,266 +0,0 @@
-
-SHELL = /bin/sh
-
-# V=0 quiet, V=1 verbose. other values don't work.
-V = 0
-Q1 = $(V:1=)
-Q = $(Q1:0=@)
-ECHO1 = $(V:1=@ :)
-ECHO = $(ECHO1:0=@ echo)
-NULLCMD = :
-
-#### Start of system configuration section. ####
-
-srcdir = .
-topdir = /usr/include/ruby-3.0.0
-hdrdir = $(topdir)
-arch_hdrdir = /usr/include/x86_64-linux-gnu/ruby-3.0.0
-PATH_SEPARATOR = :
-VPATH = $(srcdir):$(arch_hdrdir)/ruby:$(hdrdir)/ruby
-prefix = $(DESTDIR)/usr
-rubysitearchprefix = $(sitearchlibdir)/$(RUBY_BASE_NAME)
-rubyarchprefix = $(archlibdir)/$(RUBY_BASE_NAME)
-rubylibprefix = $(libdir)/$(RUBY_BASE_NAME)
-exec_prefix = $(prefix)
-vendorarchhdrdir = $(sitearchincludedir)/$(RUBY_VERSION_NAME)/vendor_ruby
-sitearchhdrdir = $(sitearchincludedir)/$(RUBY_VERSION_NAME)/site_ruby
-rubyarchhdrdir = $(archincludedir)/$(RUBY_VERSION_NAME)
-vendorhdrdir = $(rubyhdrdir)/vendor_ruby
-sitehdrdir = $(rubyhdrdir)/site_ruby
-rubyhdrdir = $(includedir)/$(RUBY_VERSION_NAME)
-vendorarchdir = $(rubysitearchprefix)/vendor_ruby/$(ruby_version)
-vendorlibdir = $(vendordir)/$(ruby_version)
-vendordir = $(rubylibprefix)/vendor_ruby
-sitearchdir = $(DESTDIR)./.gem.20231104-11184-9modoq
-sitelibdir = $(DESTDIR)./.gem.20231104-11184-9modoq
-sitedir = $(DESTDIR)/usr/local/lib/site_ruby
-rubyarchdir = $(rubyarchprefix)/$(ruby_version)
-rubylibdir = $(rubylibprefix)/$(ruby_version)
-sitearchincludedir = $(includedir)/$(sitearch)
-archincludedir = $(includedir)/$(arch)
-sitearchlibdir = $(libdir)/$(sitearch)
-archlibdir = $(libdir)/$(arch)
-ridir = $(datarootdir)/$(RI_BASE_NAME)
-mandir = $(datarootdir)/man
-localedir = $(datarootdir)/locale
-libdir = $(exec_prefix)/lib
-psdir = $(docdir)
-pdfdir = $(docdir)
-dvidir = $(docdir)
-htmldir = $(docdir)
-infodir = $(datarootdir)/info
-docdir = $(datarootdir)/doc/$(PACKAGE)
-oldincludedir = $(DESTDIR)/usr/include
-includedir = $(prefix)/include
-runstatedir = $(DESTDIR)/var/run
-localstatedir = $(DESTDIR)/var
-sharedstatedir = $(prefix)/com
-sysconfdir = $(DESTDIR)/etc
-datadir = $(datarootdir)
-datarootdir = $(prefix)/share
-libexecdir = $(exec_prefix)/libexec
-sbindir = $(exec_prefix)/sbin
-bindir = $(exec_prefix)/bin
-archdir = $(rubyarchdir)
-
-
-CC_WRAPPER =
-CC = x86_64-linux-gnu-gcc
-CXX = x86_64-linux-gnu-g++
-LIBRUBY = $(LIBRUBY_SO)
-LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a
-LIBRUBYARG_SHARED = -l$(RUBY_SO_NAME)
-LIBRUBYARG_STATIC = -l$(RUBY_SO_NAME)-static $(MAINLIBS)
-empty =
-OUTFLAG = -o $(empty)
-COUTFLAG = -o $(empty)
-CSRCFLAG = $(empty)
-
-RUBY_EXTCONF_H =
-cflags = $(optflags) $(debugflags) $(warnflags)
-cxxflags =
-optflags = -O3
-debugflags = -ggdb3
-warnflags = -Wall -Wextra -Wdeprecated-declarations -Wduplicated-cond -Wimplicit-function-declaration -Wimplicit-int -Wmisleading-indentation -Wpointer-arith -Wwrite-strings -Wimplicit-fallthrough=0 -Wmissing-noreturn -Wno-cast-function-type -Wno-constant-logical-operand -Wno-long-long -Wno-missing-field-initializers -Wno-overlength-strings -Wno-packed-bitfield-compat -Wno-parentheses-equality -Wno-self-assign -Wno-tautological-compare -Wno-unused-parameter -Wno-unused-value -Wsuggest-attribute=format -Wsuggest-attribute=noreturn -Wunused-variable
-cppflags =
-CCDLFLAGS = -fPIC
-CFLAGS = $(CCDLFLAGS) -g -O2 -ffile-prefix-map=/build/ruby3.0-ohOwi0/ruby3.0-3.0.2=. -fstack-protector-strong -Wformat -Werror=format-security -fPIC -std=c99 $(ARCH_FLAG)
-INCFLAGS = -I. -I$(arch_hdrdir) -I$(hdrdir)/ruby/backward -I$(hdrdir) -I$(srcdir)
-DEFS =
-CPPFLAGS = -Wdate-time -D_FORTIFY_SOURCE=2 $(DEFS) $(cppflags)
-CXXFLAGS = $(CCDLFLAGS) -g -O2 -ffile-prefix-map=/build/ruby3.0-ohOwi0/ruby3.0-3.0.2=. -fstack-protector-strong -Wformat -Werror=format-security $(ARCH_FLAG)
-ldflags = -L. -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now -fstack-protector-strong -rdynamic -Wl,-export-dynamic
-dldflags = -Wl,-Bsymbolic-functions -Wl,-z,relro -Wl,-z,now
-ARCH_FLAG =
-DLDFLAGS = $(ldflags) $(dldflags) $(ARCH_FLAG)
-LDSHARED = $(CC) -shared
-LDSHAREDXX = $(CXX) -shared
-AR = x86_64-linux-gnu-gcc-ar
-EXEEXT =
-
-RUBY_INSTALL_NAME = $(RUBY_BASE_NAME)3.0
-RUBY_SO_NAME = ruby-3.0
-RUBYW_INSTALL_NAME =
-RUBY_VERSION_NAME = $(RUBY_BASE_NAME)-$(ruby_version)
-RUBYW_BASE_NAME = rubyw
-RUBY_BASE_NAME = ruby
-
-arch = x86_64-linux-gnu
-sitearch = $(arch)
-ruby_version = 3.0.0
-ruby = $(bindir)/$(RUBY_BASE_NAME)3.0
-RUBY = $(ruby)
-ruby_headers = $(hdrdir)/ruby.h $(hdrdir)/ruby/backward.h $(hdrdir)/ruby/ruby.h $(hdrdir)/ruby/defines.h $(hdrdir)/ruby/missing.h $(hdrdir)/ruby/intern.h $(hdrdir)/ruby/st.h $(hdrdir)/ruby/subst.h $(arch_hdrdir)/ruby/config.h
-
-RM = rm -f
-RM_RF = $(RUBY) -run -e rm -- -rf
-RMDIRS = rmdir --ignore-fail-on-non-empty -p
-MAKEDIRS = /usr/bin/mkdir -p
-INSTALL = /usr/bin/install -c
-INSTALL_PROG = $(INSTALL) -m 0755
-INSTALL_DATA = $(INSTALL) -m 644
-COPY = cp
-TOUCH = exit >
-
-#### End of system configuration section. ####
-
-preload =
-libpath = . $(archlibdir)
-LIBPATH = -L. -L$(archlibdir)
-DEFFILE =
-
-CLEANFILES = mkmf.log
-DISTCLEANFILES =
-DISTCLEANDIRS =
-
-extout =
-extout_prefix =
-target_prefix = /commonmarker
-LOCAL_LIBS =
-LIBS = $(LIBRUBYARG_SHARED) -lm -lc
-ORIG_SRCS = arena.c autolink.c blocks.c buffer.c cmark.c cmark_ctype.c commonmark.c commonmarker.c core-extensions.c ext_scanners.c footnotes.c houdini_href_e.c houdini_html_e.c houdini_html_u.c html.c inlines.c iterator.c latex.c linked_list.c man.c map.c node.c plaintext.c plugin.c references.c registry.c render.c scanners.c strikethrough.c syntax_extension.c table.c tagfilter.c tasklist.c utf8.c xml.c
-SRCS = $(ORIG_SRCS)
-OBJS = arena.o autolink.o blocks.o buffer.o cmark.o cmark_ctype.o commonmark.o commonmarker.o core-extensions.o ext_scanners.o footnotes.o houdini_href_e.o houdini_html_e.o houdini_html_u.o html.o inlines.o iterator.o latex.o linked_list.o man.o map.o node.o plaintext.o plugin.o references.o registry.o render.o scanners.o strikethrough.o syntax_extension.o table.o tagfilter.o tasklist.o utf8.o xml.o
-HDRS = $(srcdir)/autolink.h $(srcdir)/buffer.h $(srcdir)/chunk.h $(srcdir)/cmark-gfm-core-extensions.h $(srcdir)/cmark-gfm-extension_api.h $(srcdir)/cmark-gfm-extensions_export.h $(srcdir)/cmark-gfm.h $(srcdir)/cmark-gfm_export.h $(srcdir)/cmark-gfm_version.h $(srcdir)/cmark_ctype.h $(srcdir)/commonmarker.h $(srcdir)/config.h $(srcdir)/ext_scanners.h $(srcdir)/footnotes.h $(srcdir)/houdini.h $(srcdir)/html.h $(srcdir)/inlines.h $(srcdir)/iterator.h $(srcdir)/map.h $(srcdir)/node.h $(srcdir)/parser.h $(srcdir)/plugin.h $(srcdir)/references.h $(srcdir)/registry.h $(srcdir)/render.h $(srcdir)/scanners.h $(srcdir)/strikethrough.h $(srcdir)/syntax_extension.h $(srcdir)/table.h $(srcdir)/tagfilter.h $(srcdir)/tasklist.h $(srcdir)/utf8.h
-LOCAL_HDRS =
-TARGET = commonmarker
-TARGET_NAME = commonmarker
-TARGET_ENTRY = Init_$(TARGET_NAME)
-DLLIB = $(TARGET).so
-EXTSTATIC =
-STATIC_LIB =
-
-TIMESTAMP_DIR = .
-BINDIR = $(bindir)
-RUBYCOMMONDIR = $(sitedir)$(target_prefix)
-RUBYLIBDIR = $(sitelibdir)$(target_prefix)
-RUBYARCHDIR = $(sitearchdir)$(target_prefix)
-HDRDIR = $(sitehdrdir)$(target_prefix)
-ARCHHDRDIR = $(sitearchhdrdir)$(target_prefix)
-TARGET_SO_DIR =
-TARGET_SO = $(TARGET_SO_DIR)$(DLLIB)
-CLEANLIBS = $(TARGET_SO)
-CLEANOBJS = *.o *.bak
-
-all: $(DLLIB)
-static: $(STATIC_LIB)
-.PHONY: all install static install-so install-rb
-.PHONY: clean clean-so clean-static clean-rb
-
-clean-static::
-clean-rb-default::
-clean-rb::
-clean-so::
-clean: clean-so clean-static clean-rb-default clean-rb
- -$(Q)$(RM) $(CLEANLIBS) $(CLEANOBJS) $(CLEANFILES) .*.time
-
-distclean-rb-default::
-distclean-rb::
-distclean-so::
-distclean-static::
-distclean: clean distclean-so distclean-static distclean-rb-default distclean-rb
- -$(Q)$(RM) Makefile $(RUBY_EXTCONF_H) conftest.* mkmf.log
- -$(Q)$(RM) core ruby$(EXEEXT) *~ $(DISTCLEANFILES)
- -$(Q)$(RMDIRS) $(DISTCLEANDIRS) 2> /dev/null || true
-
-realclean: distclean
-install: install-so install-rb
-
-install-so: $(DLLIB) $(TIMESTAMP_DIR)/.sitearchdir.-.commonmarker.time
- $(INSTALL_PROG) $(DLLIB) $(RUBYARCHDIR)
-clean-static::
- -$(Q)$(RM) $(STATIC_LIB)
-install-rb: pre-install-rb do-install-rb install-rb-default
-install-rb-default: pre-install-rb-default do-install-rb-default
-pre-install-rb: Makefile
-pre-install-rb-default: Makefile
-do-install-rb:
-do-install-rb-default:
-pre-install-rb-default:
- @$(NULLCMD)
-$(TIMESTAMP_DIR)/.sitearchdir.-.commonmarker.time:
- $(Q) $(MAKEDIRS) $(@D) $(RUBYARCHDIR)
- $(Q) $(TOUCH) $@
-
-site-install: site-install-so site-install-rb
-site-install-so: install-so
-site-install-rb: install-rb
-
-.SUFFIXES: .c .m .cc .mm .cxx .cpp .o .S
-
-.cc.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.cc.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.mm.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.mm.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.cxx.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.cxx.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.cpp.o:
- $(ECHO) compiling $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.cpp.S:
- $(ECHO) translating $(<)
- $(Q) $(CXX) $(INCFLAGS) $(CPPFLAGS) $(CXXFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.c.o:
- $(ECHO) compiling $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.c.S:
- $(ECHO) translating $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-.m.o:
- $(ECHO) compiling $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -c $(CSRCFLAG)$<
-
-.m.S:
- $(ECHO) translating $(<)
- $(Q) $(CC) $(INCFLAGS) $(CPPFLAGS) $(CFLAGS) $(COUTFLAG)$@ -S $(CSRCFLAG)$<
-
-$(TARGET_SO): $(OBJS) Makefile
- $(ECHO) linking shared-object commonmarker/$(DLLIB)
- -$(Q)$(RM) $(@)
- $(Q) $(LDSHARED) -o $@ $(OBJS) $(LIBPATH) $(DLDFLAGS) $(LOCAL_LIBS) $(LIBS)
-
-
-
-$(OBJS): $(HDRS) $(ruby_headers)
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/arena.c b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/arena.c
deleted file mode 100644
index da1a70e..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/arena.c
+++ /dev/null
@@ -1,104 +0,0 @@
-#include
-#include
-#include
-#include "cmark-gfm.h"
-#include "cmark-gfm-extension_api.h"
-
-static struct arena_chunk {
- size_t sz, used;
- uint8_t push_point;
- void *ptr;
- struct arena_chunk *prev;
-} *A = NULL;
-
-static struct arena_chunk *alloc_arena_chunk(size_t sz, struct arena_chunk *prev) {
- struct arena_chunk *c = (struct arena_chunk *)calloc(1, sizeof(*c));
- if (!c)
- abort();
- c->sz = sz;
- c->ptr = calloc(1, sz);
- if (!c->ptr)
- abort();
- c->prev = prev;
- return c;
-}
-
-void cmark_arena_push(void) {
- if (!A)
- return;
- A->push_point = 1;
- A = alloc_arena_chunk(10240, A);
-}
-
-int cmark_arena_pop(void) {
- if (!A)
- return 0;
- while (A && !A->push_point) {
- free(A->ptr);
- struct arena_chunk *n = A->prev;
- free(A);
- A = n;
- }
- if (A)
- A->push_point = 0;
- return 1;
-}
-
-static void init_arena(void) {
- A = alloc_arena_chunk(4 * 1048576, NULL);
-}
-
-void cmark_arena_reset(void) {
- while (A) {
- free(A->ptr);
- struct arena_chunk *n = A->prev;
- free(A);
- A = n;
- }
-}
-
-static void *arena_calloc(size_t nmem, size_t size) {
- if (!A)
- init_arena();
-
- size_t sz = nmem * size + sizeof(size_t);
-
- // Round allocation sizes to largest integer size to
- // ensure returned memory is correctly aligned
- const size_t align = sizeof(size_t) - 1;
- sz = (sz + align) & ~align;
-
- struct arena_chunk *chunk;
- if (sz > A->sz) {
- A->prev = chunk = alloc_arena_chunk(sz, A->prev);
- } else if (sz > A->sz - A->used) {
- A = chunk = alloc_arena_chunk(A->sz + A->sz / 2, A);
- } else {
- chunk = A;
- }
- void *ptr = (uint8_t *) chunk->ptr + chunk->used;
- chunk->used += sz;
- *((size_t *) ptr) = sz - sizeof(size_t);
- return (uint8_t *) ptr + sizeof(size_t);
-}
-
-static void *arena_realloc(void *ptr, size_t size) {
- if (!A)
- init_arena();
-
- void *new_ptr = arena_calloc(1, size);
- if (ptr)
- memcpy(new_ptr, ptr, ((size_t *) ptr)[-1]);
- return new_ptr;
-}
-
-static void arena_free(void *ptr) {
- (void) ptr;
- /* no-op */
-}
-
-cmark_mem CMARK_ARENA_MEM_ALLOCATOR = {arena_calloc, arena_realloc, arena_free};
-
-cmark_mem *cmark_get_arena_mem_allocator(void) {
- return &CMARK_ARENA_MEM_ALLOCATOR;
-}
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/arena.o b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/arena.o
deleted file mode 100644
index e514221..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/arena.o and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.c b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.c
deleted file mode 100644
index d898cd2..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.c
+++ /dev/null
@@ -1,508 +0,0 @@
-#include "autolink.h"
-#include
-#include
-#include
-#include
-
-#if defined(_WIN32)
-#define strncasecmp _strnicmp
-#else
-#include
-#endif
-
-static int is_valid_hostchar(const uint8_t *link, size_t link_len) {
- int32_t ch;
- int r = cmark_utf8proc_iterate(link, (bufsize_t)link_len, &ch);
- if (r < 0)
- return 0;
- return !cmark_utf8proc_is_space(ch) && !cmark_utf8proc_is_punctuation(ch);
-}
-
-static int sd_autolink_issafe(const uint8_t *link, size_t link_len) {
- static const size_t valid_uris_count = 3;
- static const char *valid_uris[] = {"http://", "https://", "ftp://"};
-
- size_t i;
-
- for (i = 0; i < valid_uris_count; ++i) {
- size_t len = strlen(valid_uris[i]);
-
- if (link_len > len && strncasecmp((char *)link, valid_uris[i], len) == 0 &&
- is_valid_hostchar(link + len, link_len - len))
- return 1;
- }
-
- return 0;
-}
-
-static size_t autolink_delim(uint8_t *data, size_t link_end) {
- size_t i;
- size_t closing = 0;
- size_t opening = 0;
-
- for (i = 0; i < link_end; ++i) {
- const uint8_t c = data[i];
- if (c == '<') {
- link_end = i;
- break;
- } else if (c == '(') {
- opening++;
- } else if (c == ')') {
- closing++;
- }
- }
-
- while (link_end > 0) {
- switch (data[link_end - 1]) {
- case ')':
- /* Allow any number of matching brackets (as recognised in copen/cclose)
- * at the end of the URL. If there is a greater number of closing
- * brackets than opening ones, we remove one character from the end of
- * the link.
- *
- * Examples (input text => output linked portion):
- *
- * http://www.pokemon.com/Pikachu_(Electric)
- * => http://www.pokemon.com/Pikachu_(Electric)
- *
- * http://www.pokemon.com/Pikachu_((Electric)
- * => http://www.pokemon.com/Pikachu_((Electric)
- *
- * http://www.pokemon.com/Pikachu_(Electric))
- * => http://www.pokemon.com/Pikachu_(Electric)
- *
- * http://www.pokemon.com/Pikachu_((Electric))
- * => http://www.pokemon.com/Pikachu_((Electric))
- */
- if (closing <= opening) {
- return link_end;
- }
- closing--;
- link_end--;
- break;
- case '?':
- case '!':
- case '.':
- case ',':
- case ':':
- case '*':
- case '_':
- case '~':
- case '\'':
- case '"':
- link_end--;
- break;
- case ';': {
- size_t new_end = link_end - 2;
-
- while (new_end > 0 && cmark_isalpha(data[new_end]))
- new_end--;
-
- if (new_end < link_end - 2 && data[new_end] == '&')
- link_end = new_end;
- else
- link_end--;
- break;
- }
-
- default:
- return link_end;
- }
- }
-
- return link_end;
-}
-
-static size_t check_domain(uint8_t *data, size_t size, int allow_short) {
- size_t i, np = 0, uscore1 = 0, uscore2 = 0;
-
- /* The purpose of this code is to reject urls that contain an underscore
- * in one of the last two segments. Examples:
- *
- * www.xxx.yyy.zzz autolinked
- * www.xxx.yyy._zzz not autolinked
- * www.xxx._yyy.zzz not autolinked
- * www._xxx.yyy.zzz autolinked
- *
- * The reason is that domain names are allowed to include underscores,
- * but host names are not. See: https://stackoverflow.com/a/2183140
- */
- for (i = 1; i < size - 1; i++) {
- if (data[i] == '\\' && i < size - 2)
- i++;
- if (data[i] == '_')
- uscore2++;
- else if (data[i] == '.') {
- uscore1 = uscore2;
- uscore2 = 0;
- np++;
- } else if (!is_valid_hostchar(data + i, size - i) && data[i] != '-')
- break;
- }
-
- if (uscore1 > 0 || uscore2 > 0) {
- /* If the url is very long then accept it despite the underscores,
- * to avoid quadratic behavior causing a denial of service. See:
- * https://github.com/github/cmark-gfm/security/advisories/GHSA-29g3-96g3-jg6c
- * Reasonable urls are unlikely to have more than 10 segments, so
- * this extra condition shouldn't have any impact on normal usage.
- */
- if (np <= 10) {
- return 0;
- }
- }
-
- if (allow_short) {
- /* We don't need a valid domain in the strict sense (with
- * least one dot; so just make sure it's composed of valid
- * domain characters and return the length of the the valid
- * sequence. */
- return i;
- } else {
- /* a valid domain needs to have at least a dot.
- * that's as far as we get */
- return np ? i : 0;
- }
-}
-
-static cmark_node *www_match(cmark_parser *parser, cmark_node *parent,
- cmark_inline_parser *inline_parser) {
- cmark_chunk *chunk = cmark_inline_parser_get_chunk(inline_parser);
- size_t max_rewind = cmark_inline_parser_get_offset(inline_parser);
- uint8_t *data = chunk->data + max_rewind;
- size_t size = chunk->len - max_rewind;
- int start = cmark_inline_parser_get_column(inline_parser);
-
- size_t link_end;
-
- if (max_rewind > 0 && strchr("*_~(", data[-1]) == NULL &&
- !cmark_isspace(data[-1]))
- return 0;
-
- if (size < 4 || memcmp(data, "www.", strlen("www.")) != 0)
- return 0;
-
- link_end = check_domain(data, size, 0);
-
- if (link_end == 0)
- return NULL;
-
- while (link_end < size && !cmark_isspace(data[link_end]) && data[link_end] != '<')
- link_end++;
-
- link_end = autolink_delim(data, link_end);
-
- if (link_end == 0)
- return NULL;
-
- cmark_inline_parser_set_offset(inline_parser, (int)(max_rewind + link_end));
-
- cmark_node *node = cmark_node_new_with_mem(CMARK_NODE_LINK, parser->mem);
-
- cmark_strbuf buf;
- cmark_strbuf_init(parser->mem, &buf, 10);
- cmark_strbuf_puts(&buf, "http://");
- cmark_strbuf_put(&buf, data, (bufsize_t)link_end);
- node->as.link.url = cmark_chunk_buf_detach(&buf);
-
- cmark_node *text = cmark_node_new_with_mem(CMARK_NODE_TEXT, parser->mem);
- text->as.literal =
- cmark_chunk_dup(chunk, (bufsize_t)max_rewind, (bufsize_t)link_end);
- cmark_node_append_child(node, text);
-
- node->start_line = text->start_line =
- node->end_line = text->end_line =
- cmark_inline_parser_get_line(inline_parser);
-
- node->start_column = text->start_column = start - 1;
- node->end_column = text->end_column = cmark_inline_parser_get_column(inline_parser) - 1;
-
- return node;
-}
-
-static cmark_node *url_match(cmark_parser *parser, cmark_node *parent,
- cmark_inline_parser *inline_parser) {
- size_t link_end, domain_len;
- int rewind = 0;
-
- cmark_chunk *chunk = cmark_inline_parser_get_chunk(inline_parser);
- int max_rewind = cmark_inline_parser_get_offset(inline_parser);
- uint8_t *data = chunk->data + max_rewind;
- size_t size = chunk->len - max_rewind;
-
- if (size < 4 || data[1] != '/' || data[2] != '/')
- return 0;
-
- while (rewind < max_rewind && cmark_isalpha(data[-rewind - 1]))
- rewind++;
-
- if (!sd_autolink_issafe(data - rewind, size + rewind))
- return 0;
-
- link_end = strlen("://");
-
- domain_len = check_domain(data + link_end, size - link_end, 1);
-
- if (domain_len == 0)
- return 0;
-
- link_end += domain_len;
- while (link_end < size && !cmark_isspace(data[link_end]) && data[link_end] != '<')
- link_end++;
-
- link_end = autolink_delim(data, link_end);
-
- if (link_end == 0)
- return NULL;
-
- cmark_inline_parser_set_offset(inline_parser, (int)(max_rewind + link_end));
- cmark_node_unput(parent, rewind);
-
- cmark_node *node = cmark_node_new_with_mem(CMARK_NODE_LINK, parser->mem);
-
- cmark_chunk url = cmark_chunk_dup(chunk, max_rewind - rewind,
- (bufsize_t)(link_end + rewind));
- node->as.link.url = url;
-
- cmark_node *text = cmark_node_new_with_mem(CMARK_NODE_TEXT, parser->mem);
- text->as.literal = url;
- cmark_node_append_child(node, text);
-
- node->start_line = text->start_line = node->end_line = text->end_line = cmark_inline_parser_get_line(inline_parser);
-
- node->start_column = text->start_column = max_rewind - rewind;
- node->end_column = text->end_column = cmark_inline_parser_get_column(inline_parser) - 1;
-
- return node;
-}
-
-static cmark_node *match(cmark_syntax_extension *ext, cmark_parser *parser,
- cmark_node *parent, unsigned char c,
- cmark_inline_parser *inline_parser) {
- if (cmark_inline_parser_in_bracket(inline_parser, false) ||
- cmark_inline_parser_in_bracket(inline_parser, true))
- return NULL;
-
- if (c == ':')
- return url_match(parser, parent, inline_parser);
-
- if (c == 'w')
- return www_match(parser, parent, inline_parser);
-
- return NULL;
-
- // note that we could end up re-consuming something already a
- // part of an inline, because we don't track when the last
- // inline was finished in inlines.c.
-}
-
-static bool validate_protocol(const char protocol[], uint8_t *data, size_t rewind, size_t max_rewind) {
- size_t len = strlen(protocol);
-
- if (len > (max_rewind - rewind)) {
- return false;
- }
-
- // Check that the protocol matches
- if (memcmp(data - rewind - len, protocol, len) != 0) {
- return false;
- }
-
- if (len == (max_rewind - rewind)) {
- return true;
- }
-
- char prev_char = data[-((ptrdiff_t)rewind) - len - 1];
-
- // Make sure the character before the protocol is non-alphanumeric
- return !cmark_isalnum(prev_char);
-}
-
-static void postprocess_text(cmark_parser *parser, cmark_node *text) {
- size_t start = 0;
- size_t offset = 0;
- // `text` is going to be split into a list of nodes containing shorter segments
- // of text, so we detach the memory buffer from text and use `cmark_chunk_dup` to
- // create references to it. Later, `cmark_chunk_to_cstr` is used to convert
- // the references into allocated buffers. The detached buffer is freed before we
- // return.
- cmark_chunk detached_chunk = text->as.literal;
- text->as.literal = cmark_chunk_dup(&detached_chunk, 0, detached_chunk.len);
-
- uint8_t *data = text->as.literal.data;
- size_t remaining = text->as.literal.len;
-
- while (true) {
- size_t link_end;
- uint8_t *at;
- bool auto_mailto = true;
- bool is_xmpp = false;
- size_t rewind;
- size_t max_rewind;
- size_t np = 0;
-
- if (offset >= remaining)
- break;
-
- at = (uint8_t *)memchr(data + start + offset, '@', remaining - offset);
- if (!at)
- break;
-
- max_rewind = at - (data + start + offset);
-
-found_at:
- for (rewind = 0; rewind < max_rewind; ++rewind) {
- uint8_t c = data[start + offset + max_rewind - rewind - 1];
-
- if (cmark_isalnum(c))
- continue;
-
- if (strchr(".+-_", c) != NULL)
- continue;
-
- if (strchr(":", c) != NULL) {
- if (validate_protocol("mailto:", data + start + offset + max_rewind, rewind, max_rewind)) {
- auto_mailto = false;
- continue;
- }
-
- if (validate_protocol("xmpp:", data + start + offset + max_rewind, rewind, max_rewind)) {
- auto_mailto = false;
- is_xmpp = true;
- continue;
- }
- }
-
- break;
- }
-
- if (rewind == 0) {
- offset += max_rewind + 1;
- continue;
- }
-
- assert(data[start + offset + max_rewind] == '@');
- for (link_end = 1; link_end < remaining - offset - max_rewind; ++link_end) {
- uint8_t c = data[start + offset + max_rewind + link_end];
-
- if (cmark_isalnum(c))
- continue;
-
- if (c == '@') {
- // Found another '@', so go back and try again with an updated offset and max_rewind.
- offset += max_rewind + 1;
- max_rewind = link_end - 1;
- goto found_at;
- } else if (c == '.' && link_end < remaining - offset - max_rewind - 1 &&
- cmark_isalnum(data[start + offset + max_rewind + link_end + 1]))
- np++;
- else if (c == '/' && is_xmpp)
- continue;
- else if (c != '-' && c != '_')
- break;
- }
-
- if (link_end < 2 || np == 0 ||
- (!cmark_isalpha(data[start + offset + max_rewind + link_end - 1]) &&
- data[start + offset + max_rewind + link_end - 1] != '.')) {
- offset += max_rewind + link_end;
- continue;
- }
-
- link_end = autolink_delim(data + start + offset + max_rewind, link_end);
-
- if (link_end == 0) {
- offset += max_rewind + 1;
- continue;
- }
-
- cmark_node *link_node = cmark_node_new_with_mem(CMARK_NODE_LINK, parser->mem);
- cmark_strbuf buf;
- cmark_strbuf_init(parser->mem, &buf, 10);
- if (auto_mailto)
- cmark_strbuf_puts(&buf, "mailto:");
- cmark_strbuf_put(&buf, data + start + offset + max_rewind - rewind, (bufsize_t)(link_end + rewind));
- link_node->as.link.url = cmark_chunk_buf_detach(&buf);
-
- cmark_node *link_text = cmark_node_new_with_mem(CMARK_NODE_TEXT, parser->mem);
- cmark_chunk email = cmark_chunk_dup(
- &detached_chunk,
- (bufsize_t)(start + offset + max_rewind - rewind),
- (bufsize_t)(link_end + rewind));
- cmark_chunk_to_cstr(parser->mem, &email);
- link_text->as.literal = email;
- cmark_node_append_child(link_node, link_text);
-
- cmark_node_insert_after(text, link_node);
-
- cmark_node *post = cmark_node_new_with_mem(CMARK_NODE_TEXT, parser->mem);
- post->as.literal = cmark_chunk_dup(&detached_chunk,
- (bufsize_t)(start + offset + max_rewind + link_end),
- (bufsize_t)(remaining - offset - max_rewind - link_end));
-
- cmark_node_insert_after(link_node, post);
-
- text->as.literal = cmark_chunk_dup(&detached_chunk, (bufsize_t)start, (bufsize_t)(offset + max_rewind - rewind));
- cmark_chunk_to_cstr(parser->mem, &text->as.literal);
-
- text = post;
- start += offset + max_rewind + link_end;
- remaining -= offset + max_rewind + link_end;
- offset = 0;
- }
-
- // Convert the reference to allocated memory.
- assert(!text->as.literal.alloc);
- cmark_chunk_to_cstr(parser->mem, &text->as.literal);
-
- // Free the detached buffer.
- cmark_chunk_free(parser->mem, &detached_chunk);
-}
-
-static cmark_node *postprocess(cmark_syntax_extension *ext, cmark_parser *parser, cmark_node *root) {
- cmark_iter *iter;
- cmark_event_type ev;
- cmark_node *node;
- bool in_link = false;
-
- cmark_consolidate_text_nodes(root);
- iter = cmark_iter_new(root);
-
- while ((ev = cmark_iter_next(iter)) != CMARK_EVENT_DONE) {
- node = cmark_iter_get_node(iter);
- if (in_link) {
- if (ev == CMARK_EVENT_EXIT && node->type == CMARK_NODE_LINK) {
- in_link = false;
- }
- continue;
- }
-
- if (ev == CMARK_EVENT_ENTER && node->type == CMARK_NODE_LINK) {
- in_link = true;
- continue;
- }
-
- if (ev == CMARK_EVENT_ENTER && node->type == CMARK_NODE_TEXT) {
- postprocess_text(parser, node);
- }
- }
-
- cmark_iter_free(iter);
-
- return root;
-}
-
-cmark_syntax_extension *create_autolink_extension(void) {
- cmark_syntax_extension *ext = cmark_syntax_extension_new("autolink");
- cmark_llist *special_chars = NULL;
-
- cmark_syntax_extension_set_match_inline_func(ext, match);
- cmark_syntax_extension_set_postprocess_func(ext, postprocess);
-
- cmark_mem *mem = cmark_get_default_mem_allocator();
- special_chars = cmark_llist_append(mem, special_chars, (void *)':');
- special_chars = cmark_llist_append(mem, special_chars, (void *)'w');
- cmark_syntax_extension_set_special_inline_chars(ext, special_chars);
-
- return ext;
-}
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.h
deleted file mode 100644
index 4e17937..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.h
+++ /dev/null
@@ -1,8 +0,0 @@
-#ifndef CMARK_GFM_AUTOLINK_H
-#define CMARK_GFM_AUTOLINK_H
-
-#include "cmark-gfm-core-extensions.h"
-
-cmark_syntax_extension *create_autolink_extension(void);
-
-#endif
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.o b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.o
deleted file mode 100644
index cba3c69..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/autolink.o and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/blocks.c b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/blocks.c
deleted file mode 100644
index 3b5da56..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/blocks.c
+++ /dev/null
@@ -1,1622 +0,0 @@
-/**
- * Block parsing implementation.
- *
- * For a high-level overview of the block parsing process,
- * see http://spec.commonmark.org/0.24/#phase-1-block-structure
- */
-
-#include
-#include
-#include
-#include
-
-#include "cmark_ctype.h"
-#include "syntax_extension.h"
-#include "config.h"
-#include "parser.h"
-#include "cmark-gfm.h"
-#include "node.h"
-#include "references.h"
-#include "utf8.h"
-#include "scanners.h"
-#include "inlines.h"
-#include "houdini.h"
-#include "buffer.h"
-#include "footnotes.h"
-
-#define CODE_INDENT 4
-#define TAB_STOP 4
-
-/**
- * Very deeply nested lists can cause quadratic performance issues.
- * This constant is used in open_new_blocks() to limit the nesting
- * depth. It is unlikely that a non-contrived markdown document will
- * be nested this deeply.
- */
-#define MAX_LIST_DEPTH 100
-
-#ifndef MIN
-#define MIN(x, y) ((x < y) ? x : y)
-#endif
-
-#define peek_at(i, n) (i)->data[n]
-
-static bool S_last_line_blank(const cmark_node *node) {
- return (node->flags & CMARK_NODE__LAST_LINE_BLANK) != 0;
-}
-
-static bool S_last_line_checked(const cmark_node *node) {
- return (node->flags & CMARK_NODE__LAST_LINE_CHECKED) != 0;
-}
-
-static CMARK_INLINE cmark_node_type S_type(const cmark_node *node) {
- return (cmark_node_type)node->type;
-}
-
-static void S_set_last_line_blank(cmark_node *node, bool is_blank) {
- if (is_blank)
- node->flags |= CMARK_NODE__LAST_LINE_BLANK;
- else
- node->flags &= ~CMARK_NODE__LAST_LINE_BLANK;
-}
-
-static void S_set_last_line_checked(cmark_node *node) {
- node->flags |= CMARK_NODE__LAST_LINE_CHECKED;
-}
-
-static CMARK_INLINE bool S_is_line_end_char(char c) {
- return (c == '\n' || c == '\r');
-}
-
-static CMARK_INLINE bool S_is_space_or_tab(char c) {
- return (c == ' ' || c == '\t');
-}
-
-static void S_parser_feed(cmark_parser *parser, const unsigned char *buffer,
- size_t len, bool eof);
-
-static void S_process_line(cmark_parser *parser, const unsigned char *buffer,
- bufsize_t bytes);
-
-static cmark_node *make_block(cmark_mem *mem, cmark_node_type tag,
- int start_line, int start_column) {
- cmark_node *e;
-
- e = (cmark_node *)mem->calloc(1, sizeof(*e));
- cmark_strbuf_init(mem, &e->content, 32);
- e->type = (uint16_t)tag;
- e->flags = CMARK_NODE__OPEN;
- e->start_line = start_line;
- e->start_column = start_column;
- e->end_line = start_line;
-
- return e;
-}
-
-// Create a root document node.
-static cmark_node *make_document(cmark_mem *mem) {
- cmark_node *e = make_block(mem, CMARK_NODE_DOCUMENT, 1, 1);
- return e;
-}
-
-int cmark_parser_attach_syntax_extension(cmark_parser *parser,
- cmark_syntax_extension *extension) {
- parser->syntax_extensions = cmark_llist_append(parser->mem, parser->syntax_extensions, extension);
- if (extension->match_inline || extension->insert_inline_from_delim) {
- parser->inline_syntax_extensions = cmark_llist_append(
- parser->mem, parser->inline_syntax_extensions, extension);
- }
-
- return 1;
-}
-
-static void cmark_parser_dispose(cmark_parser *parser) {
- if (parser->root)
- cmark_node_free(parser->root);
-
- if (parser->refmap)
- cmark_map_free(parser->refmap);
-}
-
-static void cmark_parser_reset(cmark_parser *parser) {
- cmark_llist *saved_exts = parser->syntax_extensions;
- cmark_llist *saved_inline_exts = parser->inline_syntax_extensions;
- int saved_options = parser->options;
- cmark_mem *saved_mem = parser->mem;
-
- cmark_parser_dispose(parser);
-
- memset(parser, 0, sizeof(cmark_parser));
- parser->mem = saved_mem;
-
- cmark_strbuf_init(parser->mem, &parser->curline, 256);
- cmark_strbuf_init(parser->mem, &parser->linebuf, 0);
-
- cmark_node *document = make_document(parser->mem);
-
- parser->refmap = cmark_reference_map_new(parser->mem);
- parser->root = document;
- parser->current = document;
-
- parser->syntax_extensions = saved_exts;
- parser->inline_syntax_extensions = saved_inline_exts;
- parser->options = saved_options;
-}
-
-cmark_parser *cmark_parser_new_with_mem(int options, cmark_mem *mem) {
- cmark_parser *parser = (cmark_parser *)mem->calloc(1, sizeof(cmark_parser));
- parser->mem = mem;
- parser->options = options;
- cmark_parser_reset(parser);
- return parser;
-}
-
-cmark_parser *cmark_parser_new(int options) {
- extern cmark_mem CMARK_DEFAULT_MEM_ALLOCATOR;
- return cmark_parser_new_with_mem(options, &CMARK_DEFAULT_MEM_ALLOCATOR);
-}
-
-void cmark_parser_free(cmark_parser *parser) {
- cmark_mem *mem = parser->mem;
- cmark_parser_dispose(parser);
- cmark_strbuf_free(&parser->curline);
- cmark_strbuf_free(&parser->linebuf);
- cmark_llist_free(parser->mem, parser->syntax_extensions);
- cmark_llist_free(parser->mem, parser->inline_syntax_extensions);
- mem->free(parser);
-}
-
-static cmark_node *finalize(cmark_parser *parser, cmark_node *b);
-
-// Returns true if line has only space characters, else false.
-static bool is_blank(cmark_strbuf *s, bufsize_t offset) {
- while (offset < s->size) {
- switch (s->ptr[offset]) {
- case '\r':
- case '\n':
- return true;
- case ' ':
- offset++;
- break;
- case '\t':
- offset++;
- break;
- default:
- return false;
- }
- }
-
- return true;
-}
-
-static CMARK_INLINE bool accepts_lines(cmark_node_type block_type) {
- return (block_type == CMARK_NODE_PARAGRAPH ||
- block_type == CMARK_NODE_HEADING ||
- block_type == CMARK_NODE_CODE_BLOCK);
-}
-
-static CMARK_INLINE bool contains_inlines(cmark_node *node) {
- if (node->extension && node->extension->contains_inlines_func) {
- return node->extension->contains_inlines_func(node->extension, node) != 0;
- }
-
- return (node->type == CMARK_NODE_PARAGRAPH ||
- node->type == CMARK_NODE_HEADING);
-}
-
-static void add_line(cmark_node *node, cmark_chunk *ch, cmark_parser *parser) {
- int chars_to_tab;
- int i;
- assert(node->flags & CMARK_NODE__OPEN);
- if (parser->partially_consumed_tab) {
- parser->offset += 1; // skip over tab
- // add space characters:
- chars_to_tab = TAB_STOP - (parser->column % TAB_STOP);
- for (i = 0; i < chars_to_tab; i++) {
- cmark_strbuf_putc(&node->content, ' ');
- }
- }
- cmark_strbuf_put(&node->content, ch->data + parser->offset,
- ch->len - parser->offset);
-}
-
-static void remove_trailing_blank_lines(cmark_strbuf *ln) {
- bufsize_t i;
- unsigned char c;
-
- for (i = ln->size - 1; i >= 0; --i) {
- c = ln->ptr[i];
-
- if (c != ' ' && c != '\t' && !S_is_line_end_char(c))
- break;
- }
-
- if (i < 0) {
- cmark_strbuf_clear(ln);
- return;
- }
-
- for (; i < ln->size; ++i) {
- c = ln->ptr[i];
-
- if (!S_is_line_end_char(c))
- continue;
-
- cmark_strbuf_truncate(ln, i);
- break;
- }
-}
-
-// Check to see if a node ends with a blank line, descending
-// if needed into lists and sublists.
-static bool S_ends_with_blank_line(cmark_node *node) {
- if (S_last_line_checked(node)) {
- return(S_last_line_blank(node));
- } else if ((S_type(node) == CMARK_NODE_LIST ||
- S_type(node) == CMARK_NODE_ITEM) && node->last_child) {
- S_set_last_line_checked(node);
- return(S_ends_with_blank_line(node->last_child));
- } else {
- S_set_last_line_checked(node);
- return (S_last_line_blank(node));
- }
-}
-
-// returns true if content remains after link defs are resolved.
-static bool resolve_reference_link_definitions(
- cmark_parser *parser,
- cmark_node *b) {
- bufsize_t pos;
- cmark_strbuf *node_content = &b->content;
- cmark_chunk chunk = {node_content->ptr, node_content->size, 0};
- while (chunk.len && chunk.data[0] == '[' &&
- (pos = cmark_parse_reference_inline(parser->mem, &chunk,
- parser->refmap))) {
-
- chunk.data += pos;
- chunk.len -= pos;
- }
- cmark_strbuf_drop(node_content, (node_content->size - chunk.len));
- return !is_blank(&b->content, 0);
-}
-
-static cmark_node *finalize(cmark_parser *parser, cmark_node *b) {
- bufsize_t pos;
- cmark_node *item;
- cmark_node *subitem;
- cmark_node *parent;
- bool has_content;
-
- parent = b->parent;
- assert(b->flags &
- CMARK_NODE__OPEN); // shouldn't call finalize on closed blocks
- b->flags &= ~CMARK_NODE__OPEN;
-
- if (parser->curline.size == 0) {
- // end of input - line number has not been incremented
- b->end_line = parser->line_number;
- b->end_column = parser->last_line_length;
- } else if (S_type(b) == CMARK_NODE_DOCUMENT ||
- (S_type(b) == CMARK_NODE_CODE_BLOCK && b->as.code.fenced) ||
- (S_type(b) == CMARK_NODE_HEADING && b->as.heading.setext)) {
- b->end_line = parser->line_number;
- b->end_column = parser->curline.size;
- if (b->end_column && parser->curline.ptr[b->end_column - 1] == '\n')
- b->end_column -= 1;
- if (b->end_column && parser->curline.ptr[b->end_column - 1] == '\r')
- b->end_column -= 1;
- } else {
- b->end_line = parser->line_number - 1;
- b->end_column = parser->last_line_length;
- }
-
- cmark_strbuf *node_content = &b->content;
-
- switch (S_type(b)) {
- case CMARK_NODE_PARAGRAPH:
- {
- has_content = resolve_reference_link_definitions(parser, b);
- if (!has_content) {
- // remove blank node (former reference def)
- cmark_node_free(b);
- }
- break;
- }
-
- case CMARK_NODE_CODE_BLOCK:
- if (!b->as.code.fenced) { // indented code
- remove_trailing_blank_lines(node_content);
- cmark_strbuf_putc(node_content, '\n');
- } else {
- // first line of contents becomes info
- for (pos = 0; pos < node_content->size; ++pos) {
- if (S_is_line_end_char(node_content->ptr[pos]))
- break;
- }
- assert(pos < node_content->size);
-
- cmark_strbuf tmp = CMARK_BUF_INIT(parser->mem);
- houdini_unescape_html_f(&tmp, node_content->ptr, pos);
- cmark_strbuf_trim(&tmp);
- cmark_strbuf_unescape(&tmp);
- b->as.code.info = cmark_chunk_buf_detach(&tmp);
-
- if (node_content->ptr[pos] == '\r')
- pos += 1;
- if (node_content->ptr[pos] == '\n')
- pos += 1;
- cmark_strbuf_drop(node_content, pos);
- }
- b->as.code.literal = cmark_chunk_buf_detach(node_content);
- break;
-
- case CMARK_NODE_HTML_BLOCK:
- b->as.literal = cmark_chunk_buf_detach(node_content);
- break;
-
- case CMARK_NODE_LIST: // determine tight/loose status
- b->as.list.tight = true; // tight by default
- item = b->first_child;
-
- while (item) {
- // check for non-final non-empty list item ending with blank line:
- if (S_last_line_blank(item) && item->next) {
- b->as.list.tight = false;
- break;
- }
- // recurse into children of list item, to see if there are
- // spaces between them:
- subitem = item->first_child;
- while (subitem) {
- if ((item->next || subitem->next) &&
- S_ends_with_blank_line(subitem)) {
- b->as.list.tight = false;
- break;
- }
- subitem = subitem->next;
- }
- if (!(b->as.list.tight)) {
- break;
- }
- item = item->next;
- }
-
- break;
-
- default:
- break;
- }
-
- return parent;
-}
-
-// Add a node as child of another. Return pointer to child.
-static cmark_node *add_child(cmark_parser *parser, cmark_node *parent,
- cmark_node_type block_type, int start_column) {
- assert(parent);
-
- // if 'parent' isn't the kind of node that can accept this child,
- // then back up til we hit a node that can.
- while (!cmark_node_can_contain_type(parent, block_type)) {
- parent = finalize(parser, parent);
- }
-
- cmark_node *child =
- make_block(parser->mem, block_type, parser->line_number, start_column);
- child->parent = parent;
-
- if (parent->last_child) {
- parent->last_child->next = child;
- child->prev = parent->last_child;
- } else {
- parent->first_child = child;
- child->prev = NULL;
- }
- parent->last_child = child;
- return child;
-}
-
-void cmark_manage_extensions_special_characters(cmark_parser *parser, int add) {
- cmark_llist *tmp_ext;
-
- for (tmp_ext = parser->inline_syntax_extensions; tmp_ext; tmp_ext=tmp_ext->next) {
- cmark_syntax_extension *ext = (cmark_syntax_extension *) tmp_ext->data;
- cmark_llist *tmp_char;
- for (tmp_char = ext->special_inline_chars; tmp_char; tmp_char=tmp_char->next) {
- unsigned char c = (unsigned char)(size_t)tmp_char->data;
- if (add)
- cmark_inlines_add_special_character(c, ext->emphasis);
- else
- cmark_inlines_remove_special_character(c, ext->emphasis);
- }
- }
-}
-
-// Walk through node and all children, recursively, parsing
-// string content into inline content where appropriate.
-static void process_inlines(cmark_parser *parser,
- cmark_map *refmap, int options) {
- cmark_iter *iter = cmark_iter_new(parser->root);
- cmark_node *cur;
- cmark_event_type ev_type;
-
- cmark_manage_extensions_special_characters(parser, true);
-
- while ((ev_type = cmark_iter_next(iter)) != CMARK_EVENT_DONE) {
- cur = cmark_iter_get_node(iter);
- if (ev_type == CMARK_EVENT_ENTER) {
- if (contains_inlines(cur)) {
- cmark_parse_inlines(parser, cur, refmap, options);
- }
- }
- }
-
- cmark_manage_extensions_special_characters(parser, false);
-
- cmark_iter_free(iter);
-}
-
-static int sort_footnote_by_ix(const void *_a, const void *_b) {
- cmark_footnote *a = *(cmark_footnote **)_a;
- cmark_footnote *b = *(cmark_footnote **)_b;
- return (int)a->ix - (int)b->ix;
-}
-
-static void process_footnotes(cmark_parser *parser) {
- // * Collect definitions in a map.
- // * Iterate the references in the document in order, assigning indices to
- // definitions in the order they're seen.
- // * Write out the footnotes at the bottom of the document in index order.
-
- cmark_map *map = cmark_footnote_map_new(parser->mem);
-
- cmark_iter *iter = cmark_iter_new(parser->root);
- cmark_node *cur;
- cmark_event_type ev_type;
-
- while ((ev_type = cmark_iter_next(iter)) != CMARK_EVENT_DONE) {
- cur = cmark_iter_get_node(iter);
- if (ev_type == CMARK_EVENT_EXIT && cur->type == CMARK_NODE_FOOTNOTE_DEFINITION) {
- cmark_footnote_create(map, cur);
- }
- }
-
- cmark_iter_free(iter);
- iter = cmark_iter_new(parser->root);
- unsigned int ix = 0;
-
- while ((ev_type = cmark_iter_next(iter)) != CMARK_EVENT_DONE) {
- cur = cmark_iter_get_node(iter);
- if (ev_type == CMARK_EVENT_EXIT && cur->type == CMARK_NODE_FOOTNOTE_REFERENCE) {
- cmark_footnote *footnote = (cmark_footnote *)cmark_map_lookup(map, &cur->as.literal);
- if (footnote) {
- if (!footnote->ix)
- footnote->ix = ++ix;
-
- // store a reference to this footnote reference's footnote definition
- // this is used by renderers when generating label ids
- cur->parent_footnote_def = footnote->node;
-
- // keep track of a) count of how many times this footnote def has been
- // referenced, and b) which reference index this footnote ref is at.
- // this is used by renderers when generating links and backreferences.
- cur->footnote.ref_ix = ++footnote->node->footnote.def_count;
-
- char n[32];
- snprintf(n, sizeof(n), "%d", footnote->ix);
- cmark_chunk_free(parser->mem, &cur->as.literal);
- cmark_strbuf buf = CMARK_BUF_INIT(parser->mem);
- cmark_strbuf_puts(&buf, n);
-
- cur->as.literal = cmark_chunk_buf_detach(&buf);
- } else {
- cmark_node *text = (cmark_node *)parser->mem->calloc(1, sizeof(*text));
- cmark_strbuf_init(parser->mem, &text->content, 0);
- text->type = (uint16_t) CMARK_NODE_TEXT;
-
- cmark_strbuf buf = CMARK_BUF_INIT(parser->mem);
- cmark_strbuf_puts(&buf, "[^");
- cmark_strbuf_put(&buf, cur->as.literal.data, cur->as.literal.len);
- cmark_strbuf_putc(&buf, ']');
-
- text->as.literal = cmark_chunk_buf_detach(&buf);
- cmark_node_insert_after(cur, text);
- cmark_node_free(cur);
- }
- }
- }
-
- cmark_iter_free(iter);
-
- if (map->sorted) {
- qsort(map->sorted, map->size, sizeof(cmark_map_entry *), sort_footnote_by_ix);
- for (unsigned int i = 0; i < map->size; ++i) {
- cmark_footnote *footnote = (cmark_footnote *)map->sorted[i];
- if (!footnote->ix) {
- cmark_node_unlink(footnote->node);
- continue;
- }
- cmark_node_append_child(parser->root, footnote->node);
- footnote->node = NULL;
- }
- }
-
- cmark_unlink_footnotes_map(map);
- cmark_map_free(map);
-}
-
-// Attempts to parse a list item marker (bullet or enumerated).
-// On success, returns length of the marker, and populates
-// data with the details. On failure, returns 0.
-static bufsize_t parse_list_marker(cmark_mem *mem, cmark_chunk *input,
- bufsize_t pos, bool interrupts_paragraph,
- cmark_list **dataptr) {
- unsigned char c;
- bufsize_t startpos;
- cmark_list *data;
- bufsize_t i;
-
- startpos = pos;
- c = peek_at(input, pos);
-
- if (c == '*' || c == '-' || c == '+') {
- pos++;
- if (!cmark_isspace(peek_at(input, pos))) {
- return 0;
- }
-
- if (interrupts_paragraph) {
- i = pos;
- // require non-blank content after list marker:
- while (S_is_space_or_tab(peek_at(input, i))) {
- i++;
- }
- if (peek_at(input, i) == '\n') {
- return 0;
- }
- }
-
- data = (cmark_list *)mem->calloc(1, sizeof(*data));
- data->marker_offset = 0; // will be adjusted later
- data->list_type = CMARK_BULLET_LIST;
- data->bullet_char = c;
- data->start = 0;
- data->delimiter = CMARK_NO_DELIM;
- data->tight = false;
- } else if (cmark_isdigit(c)) {
- int start = 0;
- int digits = 0;
-
- do {
- start = (10 * start) + (peek_at(input, pos) - '0');
- pos++;
- digits++;
- // We limit to 9 digits to avoid overflow,
- // assuming max int is 2^31 - 1
- // This also seems to be the limit for 'start' in some browsers.
- } while (digits < 9 && cmark_isdigit(peek_at(input, pos)));
-
- if (interrupts_paragraph && start != 1) {
- return 0;
- }
- c = peek_at(input, pos);
- if (c == '.' || c == ')') {
- pos++;
- if (!cmark_isspace(peek_at(input, pos))) {
- return 0;
- }
- if (interrupts_paragraph) {
- // require non-blank content after list marker:
- i = pos;
- while (S_is_space_or_tab(peek_at(input, i))) {
- i++;
- }
- if (S_is_line_end_char(peek_at(input, i))) {
- return 0;
- }
- }
-
- data = (cmark_list *)mem->calloc(1, sizeof(*data));
- data->marker_offset = 0; // will be adjusted later
- data->list_type = CMARK_ORDERED_LIST;
- data->bullet_char = 0;
- data->start = start;
- data->delimiter = (c == '.' ? CMARK_PERIOD_DELIM : CMARK_PAREN_DELIM);
- data->tight = false;
- } else {
- return 0;
- }
- } else {
- return 0;
- }
-
- *dataptr = data;
- return (pos - startpos);
-}
-
-// Return 1 if list item belongs in list, else 0.
-static int lists_match(cmark_list *list_data, cmark_list *item_data) {
- return (list_data->list_type == item_data->list_type &&
- list_data->delimiter == item_data->delimiter &&
- // list_data->marker_offset == item_data.marker_offset &&
- list_data->bullet_char == item_data->bullet_char);
-}
-
-static cmark_node *finalize_document(cmark_parser *parser) {
- while (parser->current != parser->root) {
- parser->current = finalize(parser, parser->current);
- }
-
- finalize(parser, parser->root);
-
- // Limit total size of extra content created from reference links to
- // document size to avoid superlinear growth. Always allow 100KB.
- if (parser->total_size > 100000)
- parser->refmap->max_ref_size = parser->total_size;
- else
- parser->refmap->max_ref_size = 100000;
-
- process_inlines(parser, parser->refmap, parser->options);
- if (parser->options & CMARK_OPT_FOOTNOTES)
- process_footnotes(parser);
-
- return parser->root;
-}
-
-cmark_node *cmark_parse_file(FILE *f, int options) {
- unsigned char buffer[4096];
- cmark_parser *parser = cmark_parser_new(options);
- size_t bytes;
- cmark_node *document;
-
- while ((bytes = fread(buffer, 1, sizeof(buffer), f)) > 0) {
- bool eof = bytes < sizeof(buffer);
- S_parser_feed(parser, buffer, bytes, eof);
- if (eof) {
- break;
- }
- }
-
- document = cmark_parser_finish(parser);
- cmark_parser_free(parser);
- return document;
-}
-
-cmark_node *cmark_parse_document(const char *buffer, size_t len, int options) {
- cmark_parser *parser = cmark_parser_new(options);
- cmark_node *document;
-
- S_parser_feed(parser, (const unsigned char *)buffer, len, true);
-
- document = cmark_parser_finish(parser);
- cmark_parser_free(parser);
- return document;
-}
-
-void cmark_parser_feed(cmark_parser *parser, const char *buffer, size_t len) {
- S_parser_feed(parser, (const unsigned char *)buffer, len, false);
-}
-
-void cmark_parser_feed_reentrant(cmark_parser *parser, const char *buffer, size_t len) {
- cmark_strbuf saved_linebuf;
-
- cmark_strbuf_init(parser->mem, &saved_linebuf, 0);
- cmark_strbuf_puts(&saved_linebuf, cmark_strbuf_cstr(&parser->linebuf));
- cmark_strbuf_clear(&parser->linebuf);
-
- S_parser_feed(parser, (const unsigned char *)buffer, len, true);
-
- cmark_strbuf_sets(&parser->linebuf, cmark_strbuf_cstr(&saved_linebuf));
- cmark_strbuf_free(&saved_linebuf);
-}
-
-static void S_parser_feed(cmark_parser *parser, const unsigned char *buffer,
- size_t len, bool eof) {
- const unsigned char *end = buffer + len;
- static const uint8_t repl[] = {239, 191, 189};
-
- if (len > UINT_MAX - parser->total_size)
- parser->total_size = UINT_MAX;
- else
- parser->total_size += len;
-
- if (parser->last_buffer_ended_with_cr && *buffer == '\n') {
- // skip NL if last buffer ended with CR ; see #117
- buffer++;
- }
- parser->last_buffer_ended_with_cr = false;
- while (buffer < end) {
- const unsigned char *eol;
- bufsize_t chunk_len;
- bool process = false;
- for (eol = buffer; eol < end; ++eol) {
- if (S_is_line_end_char(*eol)) {
- process = true;
- break;
- }
- if (*eol == '\0' && eol < end) {
- break;
- }
- }
- if (eol >= end && eof) {
- process = true;
- }
-
- chunk_len = (bufsize_t)(eol - buffer);
- if (process) {
- if (parser->linebuf.size > 0) {
- cmark_strbuf_put(&parser->linebuf, buffer, chunk_len);
- S_process_line(parser, parser->linebuf.ptr, parser->linebuf.size);
- cmark_strbuf_clear(&parser->linebuf);
- } else {
- S_process_line(parser, buffer, chunk_len);
- }
- } else {
- if (eol < end && *eol == '\0') {
- // omit NULL byte
- cmark_strbuf_put(&parser->linebuf, buffer, chunk_len);
- // add replacement character
- cmark_strbuf_put(&parser->linebuf, repl, 3);
- } else {
- cmark_strbuf_put(&parser->linebuf, buffer, chunk_len);
- }
- }
-
- buffer += chunk_len;
- if (buffer < end) {
- if (*buffer == '\0') {
- // skip over NULL
- buffer++;
- } else {
- // skip over line ending characters
- if (*buffer == '\r') {
- buffer++;
- if (buffer == end)
- parser->last_buffer_ended_with_cr = true;
- }
- if (buffer < end && *buffer == '\n')
- buffer++;
- }
- }
- }
-}
-
-static void chop_trailing_hashtags(cmark_chunk *ch) {
- bufsize_t n, orig_n;
-
- cmark_chunk_rtrim(ch);
- orig_n = n = ch->len - 1;
-
- // if string ends in space followed by #s, remove these:
- while (n >= 0 && peek_at(ch, n) == '#')
- n--;
-
- // Check for a space before the final #s:
- if (n != orig_n && n >= 0 && S_is_space_or_tab(peek_at(ch, n))) {
- ch->len = n;
- cmark_chunk_rtrim(ch);
- }
-}
-
-// Check for thematic break. On failure, return 0 and update
-// thematic_break_kill_pos with the index at which the
-// parse fails. On success, return length of match.
-// "...three or more hyphens, asterisks,
-// or underscores on a line by themselves. If you wish, you may use
-// spaces between the hyphens or asterisks."
-static int S_scan_thematic_break(cmark_parser *parser, cmark_chunk *input,
- bufsize_t offset) {
- bufsize_t i;
- char c;
- char nextc = '\0';
- int count;
- i = offset;
- c = peek_at(input, i);
- if (!(c == '*' || c == '_' || c == '-')) {
- parser->thematic_break_kill_pos = i;
- return 0;
- }
- count = 1;
- while ((nextc = peek_at(input, ++i))) {
- if (nextc == c) {
- count++;
- } else if (nextc != ' ' && nextc != '\t') {
- break;
- }
- }
- if (count >= 3 && (nextc == '\r' || nextc == '\n')) {
- return (i - offset) + 1;
- } else {
- parser->thematic_break_kill_pos = i;
- return 0;
- }
-}
-
-// Find first nonspace character from current offset, setting
-// parser->first_nonspace, parser->first_nonspace_column,
-// parser->indent, and parser->blank. Does not advance parser->offset.
-static void S_find_first_nonspace(cmark_parser *parser, cmark_chunk *input) {
- char c;
- int chars_to_tab = TAB_STOP - (parser->column % TAB_STOP);
-
- if (parser->first_nonspace <= parser->offset) {
- parser->first_nonspace = parser->offset;
- parser->first_nonspace_column = parser->column;
- while ((c = peek_at(input, parser->first_nonspace))) {
- if (c == ' ') {
- parser->first_nonspace += 1;
- parser->first_nonspace_column += 1;
- chars_to_tab = chars_to_tab - 1;
- if (chars_to_tab == 0) {
- chars_to_tab = TAB_STOP;
- }
- } else if (c == '\t') {
- parser->first_nonspace += 1;
- parser->first_nonspace_column += chars_to_tab;
- chars_to_tab = TAB_STOP;
- } else {
- break;
- }
- }
- }
-
- parser->indent = parser->first_nonspace_column - parser->column;
- parser->blank = S_is_line_end_char(peek_at(input, parser->first_nonspace));
-}
-
-// Advance parser->offset and parser->column. parser->offset is the
-// byte position in input; parser->column is a virtual column number
-// that takes into account tabs. (Multibyte characters are not taken
-// into account, because the Markdown line prefixes we are interested in
-// analyzing are entirely ASCII.) The count parameter indicates
-// how far to advance the offset. If columns is true, then count
-// indicates a number of columns; otherwise, a number of bytes.
-// If advancing a certain number of columns partially consumes
-// a tab character, parser->partially_consumed_tab is set to true.
-static void S_advance_offset(cmark_parser *parser, cmark_chunk *input,
- bufsize_t count, bool columns) {
- char c;
- int chars_to_tab;
- int chars_to_advance;
- while (count > 0 && (c = peek_at(input, parser->offset))) {
- if (c == '\t') {
- chars_to_tab = TAB_STOP - (parser->column % TAB_STOP);
- if (columns) {
- parser->partially_consumed_tab = chars_to_tab > count;
- chars_to_advance = MIN(count, chars_to_tab);
- parser->column += chars_to_advance;
- parser->offset += (parser->partially_consumed_tab ? 0 : 1);
- count -= chars_to_advance;
- } else {
- parser->partially_consumed_tab = false;
- parser->column += chars_to_tab;
- parser->offset += 1;
- count -= 1;
- }
- } else {
- parser->partially_consumed_tab = false;
- parser->offset += 1;
- parser->column += 1; // assume ascii; block starts are ascii
- count -= 1;
- }
- }
-}
-
-static bool S_last_child_is_open(cmark_node *container) {
- return container->last_child &&
- (container->last_child->flags & CMARK_NODE__OPEN);
-}
-
-static bool parse_block_quote_prefix(cmark_parser *parser, cmark_chunk *input) {
- bool res = false;
- bufsize_t matched = 0;
-
- matched =
- parser->indent <= 3 && peek_at(input, parser->first_nonspace) == '>';
- if (matched) {
-
- S_advance_offset(parser, input, parser->indent + 1, true);
-
- if (S_is_space_or_tab(peek_at(input, parser->offset))) {
- S_advance_offset(parser, input, 1, true);
- }
-
- res = true;
- }
- return res;
-}
-
-static bool parse_footnote_definition_block_prefix(cmark_parser *parser, cmark_chunk *input,
- cmark_node *container) {
- if (parser->indent >= 4) {
- S_advance_offset(parser, input, 4, true);
- return true;
- } else if (input->len > 0 && (input->data[0] == '\n' || (input->data[0] == '\r' && input->data[1] == '\n'))) {
- return true;
- }
-
- return false;
-}
-
-static bool parse_node_item_prefix(cmark_parser *parser, cmark_chunk *input,
- cmark_node *container) {
- bool res = false;
-
- if (parser->indent >=
- container->as.list.marker_offset + container->as.list.padding) {
- S_advance_offset(parser, input, container->as.list.marker_offset +
- container->as.list.padding,
- true);
- res = true;
- } else if (parser->blank && container->first_child != NULL) {
- // if container->first_child is NULL, then the opening line
- // of the list item was blank after the list marker; in this
- // case, we are done with the list item.
- S_advance_offset(parser, input, parser->first_nonspace - parser->offset,
- false);
- res = true;
- }
- return res;
-}
-
-static bool parse_code_block_prefix(cmark_parser *parser, cmark_chunk *input,
- cmark_node *container,
- bool *should_continue) {
- bool res = false;
-
- if (!container->as.code.fenced) { // indented
- if (parser->indent >= CODE_INDENT) {
- S_advance_offset(parser, input, CODE_INDENT, true);
- res = true;
- } else if (parser->blank) {
- S_advance_offset(parser, input, parser->first_nonspace - parser->offset,
- false);
- res = true;
- }
- } else { // fenced
- bufsize_t matched = 0;
-
- if (parser->indent <= 3 && (peek_at(input, parser->first_nonspace) ==
- container->as.code.fence_char)) {
- matched = scan_close_code_fence(input, parser->first_nonspace);
- }
-
- if (matched >= container->as.code.fence_length) {
- // closing fence - and since we're at
- // the end of a line, we can stop processing it:
- *should_continue = false;
- S_advance_offset(parser, input, matched, false);
- parser->current = finalize(parser, container);
- } else {
- // skip opt. spaces of fence parser->offset
- int i = container->as.code.fence_offset;
-
- while (i > 0 && S_is_space_or_tab(peek_at(input, parser->offset))) {
- S_advance_offset(parser, input, 1, true);
- i--;
- }
- res = true;
- }
- }
-
- return res;
-}
-
-static bool parse_html_block_prefix(cmark_parser *parser,
- cmark_node *container) {
- bool res = false;
- int html_block_type = container->as.html_block_type;
-
- assert(html_block_type >= 1 && html_block_type <= 7);
- switch (html_block_type) {
- case 1:
- case 2:
- case 3:
- case 4:
- case 5:
- // these types of blocks can accept blanks
- res = true;
- break;
- case 6:
- case 7:
- res = !parser->blank;
- break;
- }
-
- return res;
-}
-
-static bool parse_extension_block(cmark_parser *parser,
- cmark_node *container,
- cmark_chunk *input)
-{
- bool res = false;
-
- if (container->extension->last_block_matches) {
- if (container->extension->last_block_matches(
- container->extension, parser, input->data, input->len, container))
- res = true;
- }
-
- return res;
-}
-
-/**
- * For each containing node, try to parse the associated line start.
- *
- * Will not close unmatched blocks, as we may have a lazy continuation
- * line -> http://spec.commonmark.org/0.24/#lazy-continuation-line
- *
- * Returns: The last matching node, or NULL
- */
-static cmark_node *check_open_blocks(cmark_parser *parser, cmark_chunk *input,
- bool *all_matched) {
- bool should_continue = true;
- *all_matched = false;
- cmark_node *container = parser->root;
- cmark_node_type cont_type;
-
- while (S_last_child_is_open(container)) {
- container = container->last_child;
- cont_type = S_type(container);
-
- S_find_first_nonspace(parser, input);
-
- if (container->extension) {
- if (!parse_extension_block(parser, container, input))
- goto done;
- continue;
- }
-
- switch (cont_type) {
- case CMARK_NODE_BLOCK_QUOTE:
- if (!parse_block_quote_prefix(parser, input))
- goto done;
- break;
- case CMARK_NODE_ITEM:
- if (!parse_node_item_prefix(parser, input, container))
- goto done;
- break;
- case CMARK_NODE_CODE_BLOCK:
- if (!parse_code_block_prefix(parser, input, container, &should_continue))
- goto done;
- break;
- case CMARK_NODE_HEADING:
- // a heading can never contain more than one line
- goto done;
- case CMARK_NODE_HTML_BLOCK:
- if (!parse_html_block_prefix(parser, container))
- goto done;
- break;
- case CMARK_NODE_PARAGRAPH:
- if (parser->blank)
- goto done;
- break;
- case CMARK_NODE_FOOTNOTE_DEFINITION:
- if (!parse_footnote_definition_block_prefix(parser, input, container))
- goto done;
- break;
- default:
- break;
- }
- }
-
- *all_matched = true;
-
-done:
- if (!*all_matched) {
- container = container->parent; // back up to last matching node
- }
-
- if (!should_continue) {
- container = NULL;
- }
-
- return container;
-}
-
-static void open_new_blocks(cmark_parser *parser, cmark_node **container,
- cmark_chunk *input, bool all_matched) {
- bool indented;
- cmark_list *data = NULL;
- bool maybe_lazy = S_type(parser->current) == CMARK_NODE_PARAGRAPH;
- cmark_node_type cont_type = S_type(*container);
- bufsize_t matched = 0;
- int lev = 0;
- bool save_partially_consumed_tab;
- bool has_content;
- int save_offset;
- int save_column;
- size_t depth = 0;
-
- while (cont_type != CMARK_NODE_CODE_BLOCK &&
- cont_type != CMARK_NODE_HTML_BLOCK) {
- depth++;
- S_find_first_nonspace(parser, input);
- indented = parser->indent >= CODE_INDENT;
-
- if (!indented && peek_at(input, parser->first_nonspace) == '>') {
-
- bufsize_t blockquote_startpos = parser->first_nonspace;
-
- S_advance_offset(parser, input,
- parser->first_nonspace + 1 - parser->offset, false);
- // optional following character
- if (S_is_space_or_tab(peek_at(input, parser->offset))) {
- S_advance_offset(parser, input, 1, true);
- }
- *container = add_child(parser, *container, CMARK_NODE_BLOCK_QUOTE,
- blockquote_startpos + 1);
-
- } else if (!indented && (matched = scan_atx_heading_start(
- input, parser->first_nonspace))) {
- bufsize_t hashpos;
- int level = 0;
- bufsize_t heading_startpos = parser->first_nonspace;
-
- S_advance_offset(parser, input,
- parser->first_nonspace + matched - parser->offset,
- false);
- *container = add_child(parser, *container, CMARK_NODE_HEADING,
- heading_startpos + 1);
-
- hashpos = cmark_chunk_strchr(input, '#', parser->first_nonspace);
-
- while (peek_at(input, hashpos) == '#') {
- level++;
- hashpos++;
- }
-
- (*container)->as.heading.level = level;
- (*container)->as.heading.setext = false;
- (*container)->internal_offset = matched;
-
- } else if (!indented && (matched = scan_open_code_fence(
- input, parser->first_nonspace))) {
- *container = add_child(parser, *container, CMARK_NODE_CODE_BLOCK,
- parser->first_nonspace + 1);
- (*container)->as.code.fenced = true;
- (*container)->as.code.fence_char = peek_at(input, parser->first_nonspace);
- (*container)->as.code.fence_length = (matched > 255) ? 255 : (uint8_t)matched;
- (*container)->as.code.fence_offset =
- (int8_t)(parser->first_nonspace - parser->offset);
- (*container)->as.code.info = cmark_chunk_literal("");
- S_advance_offset(parser, input,
- parser->first_nonspace + matched - parser->offset,
- false);
-
- } else if (!indented && ((matched = scan_html_block_start(
- input, parser->first_nonspace)) ||
- (cont_type != CMARK_NODE_PARAGRAPH &&
- (matched = scan_html_block_start_7(
- input, parser->first_nonspace))))) {
- *container = add_child(parser, *container, CMARK_NODE_HTML_BLOCK,
- parser->first_nonspace + 1);
- (*container)->as.html_block_type = matched;
- // note, we don't adjust parser->offset because the tag is part of the
- // text
- } else if (!indented && cont_type == CMARK_NODE_PARAGRAPH &&
- (lev =
- scan_setext_heading_line(input, parser->first_nonspace))) {
- // finalize paragraph, resolving reference links
- has_content = resolve_reference_link_definitions(parser, *container);
-
- if (has_content) {
-
- (*container)->type = (uint16_t)CMARK_NODE_HEADING;
- (*container)->as.heading.level = lev;
- (*container)->as.heading.setext = true;
- S_advance_offset(parser, input, input->len - 1 - parser->offset, false);
- }
- } else if (!indented &&
- !(cont_type == CMARK_NODE_PARAGRAPH && !all_matched) &&
- (parser->thematic_break_kill_pos <= parser->first_nonspace) &&
- (matched = S_scan_thematic_break(parser, input, parser->first_nonspace))) {
- // it's only now that we know the line is not part of a setext heading:
- *container = add_child(parser, *container, CMARK_NODE_THEMATIC_BREAK,
- parser->first_nonspace + 1);
- S_advance_offset(parser, input, input->len - 1 - parser->offset, false);
- } else if (!indented &&
- (parser->options & CMARK_OPT_FOOTNOTES) &&
- depth < MAX_LIST_DEPTH &&
- (matched = scan_footnote_definition(input, parser->first_nonspace))) {
- cmark_chunk c = cmark_chunk_dup(input, parser->first_nonspace + 2, matched - 2);
-
- while (c.data[c.len - 1] != ']')
- --c.len;
- --c.len;
-
- cmark_chunk_to_cstr(parser->mem, &c);
-
- S_advance_offset(parser, input, parser->first_nonspace + matched - parser->offset, false);
- *container = add_child(parser, *container, CMARK_NODE_FOOTNOTE_DEFINITION, parser->first_nonspace + matched + 1);
- (*container)->as.literal = c;
-
- (*container)->internal_offset = matched;
- } else if ((!indented || cont_type == CMARK_NODE_LIST) &&
- parser->indent < 4 &&
- depth < MAX_LIST_DEPTH &&
- (matched = parse_list_marker(
- parser->mem, input, parser->first_nonspace,
- (*container)->type == CMARK_NODE_PARAGRAPH, &data))) {
-
- // Note that we can have new list items starting with >= 4
- // spaces indent, as long as the list container is still open.
- int i = 0;
-
- // compute padding:
- S_advance_offset(parser, input,
- parser->first_nonspace + matched - parser->offset,
- false);
-
- save_partially_consumed_tab = parser->partially_consumed_tab;
- save_offset = parser->offset;
- save_column = parser->column;
-
- while (parser->column - save_column <= 5 &&
- S_is_space_or_tab(peek_at(input, parser->offset))) {
- S_advance_offset(parser, input, 1, true);
- }
-
- i = parser->column - save_column;
- if (i >= 5 || i < 1 ||
- // only spaces after list marker:
- S_is_line_end_char(peek_at(input, parser->offset))) {
- data->padding = matched + 1;
- parser->offset = save_offset;
- parser->column = save_column;
- parser->partially_consumed_tab = save_partially_consumed_tab;
- if (i > 0) {
- S_advance_offset(parser, input, 1, true);
- }
- } else {
- data->padding = matched + i;
- }
-
- // check container; if it's a list, see if this list item
- // can continue the list; otherwise, create a list container.
-
- data->marker_offset = parser->indent;
-
- if (cont_type != CMARK_NODE_LIST ||
- !lists_match(&((*container)->as.list), data)) {
- *container = add_child(parser, *container, CMARK_NODE_LIST,
- parser->first_nonspace + 1);
-
- memcpy(&((*container)->as.list), data, sizeof(*data));
- }
-
- // add the list item
- *container = add_child(parser, *container, CMARK_NODE_ITEM,
- parser->first_nonspace + 1);
- /* TODO: static */
- memcpy(&((*container)->as.list), data, sizeof(*data));
- parser->mem->free(data);
- } else if (indented && !maybe_lazy && !parser->blank) {
- S_advance_offset(parser, input, CODE_INDENT, true);
- *container = add_child(parser, *container, CMARK_NODE_CODE_BLOCK,
- parser->offset + 1);
- (*container)->as.code.fenced = false;
- (*container)->as.code.fence_char = 0;
- (*container)->as.code.fence_length = 0;
- (*container)->as.code.fence_offset = 0;
- (*container)->as.code.info = cmark_chunk_literal("");
- } else {
- cmark_llist *tmp;
- cmark_node *new_container = NULL;
-
- for (tmp = parser->syntax_extensions; tmp; tmp=tmp->next) {
- cmark_syntax_extension *ext = (cmark_syntax_extension *) tmp->data;
-
- if (ext->try_opening_block) {
- new_container = ext->try_opening_block(
- ext, indented, parser, *container, input->data, input->len);
-
- if (new_container) {
- *container = new_container;
- break;
- }
- }
- }
-
- if (!new_container) {
- break;
- }
- }
-
- if (accepts_lines(S_type(*container))) {
- // if it's a line container, it can't contain other containers
- break;
- }
-
- cont_type = S_type(*container);
- maybe_lazy = false;
- }
-}
-
-static void add_text_to_container(cmark_parser *parser, cmark_node *container,
- cmark_node *last_matched_container,
- cmark_chunk *input) {
- cmark_node *tmp;
- // what remains at parser->offset is a text line. add the text to the
- // appropriate container.
-
- S_find_first_nonspace(parser, input);
-
- if (parser->blank && container->last_child)
- S_set_last_line_blank(container->last_child, true);
-
- // block quote lines are never blank as they start with >
- // and we don't count blanks in fenced code for purposes of tight/loose
- // lists or breaking out of lists. we also don't set last_line_blank
- // on an empty list item.
- const cmark_node_type ctype = S_type(container);
- const bool last_line_blank =
- (parser->blank && ctype != CMARK_NODE_BLOCK_QUOTE &&
- ctype != CMARK_NODE_HEADING && ctype != CMARK_NODE_THEMATIC_BREAK &&
- !(ctype == CMARK_NODE_CODE_BLOCK && container->as.code.fenced) &&
- !(ctype == CMARK_NODE_ITEM && container->first_child == NULL &&
- container->start_line == parser->line_number));
-
- S_set_last_line_blank(container, last_line_blank);
-
- tmp = container;
- while (tmp->parent) {
- S_set_last_line_blank(tmp->parent, false);
- tmp = tmp->parent;
- }
-
- // If the last line processed belonged to a paragraph node,
- // and we didn't match all of the line prefixes for the open containers,
- // and we didn't start any new containers,
- // and the line isn't blank,
- // then treat this as a "lazy continuation line" and add it to
- // the open paragraph.
- if (parser->current != last_matched_container &&
- container == last_matched_container && !parser->blank &&
- S_type(parser->current) == CMARK_NODE_PARAGRAPH) {
- add_line(parser->current, input, parser);
- } else { // not a lazy continuation
- // Finalize any blocks that were not matched and set cur to container:
- while (parser->current != last_matched_container) {
- parser->current = finalize(parser, parser->current);
- assert(parser->current != NULL);
- }
-
- if (S_type(container) == CMARK_NODE_CODE_BLOCK) {
- add_line(container, input, parser);
- } else if (S_type(container) == CMARK_NODE_HTML_BLOCK) {
- add_line(container, input, parser);
-
- int matches_end_condition;
- switch (container->as.html_block_type) {
- case 1:
- // , ,
- matches_end_condition =
- scan_html_block_end_1(input, parser->first_nonspace);
- break;
- case 2:
- // -->
- matches_end_condition =
- scan_html_block_end_2(input, parser->first_nonspace);
- break;
- case 3:
- // ?>
- matches_end_condition =
- scan_html_block_end_3(input, parser->first_nonspace);
- break;
- case 4:
- // >
- matches_end_condition =
- scan_html_block_end_4(input, parser->first_nonspace);
- break;
- case 5:
- // ]]>
- matches_end_condition =
- scan_html_block_end_5(input, parser->first_nonspace);
- break;
- default:
- matches_end_condition = 0;
- break;
- }
-
- if (matches_end_condition) {
- container = finalize(parser, container);
- assert(parser->current != NULL);
- }
- } else if (parser->blank) {
- // ??? do nothing
- } else if (accepts_lines(S_type(container))) {
- if (S_type(container) == CMARK_NODE_HEADING &&
- container->as.heading.setext == false) {
- chop_trailing_hashtags(input);
- }
- S_advance_offset(parser, input, parser->first_nonspace - parser->offset,
- false);
- add_line(container, input, parser);
- } else {
- // create paragraph container for line
- container = add_child(parser, container, CMARK_NODE_PARAGRAPH,
- parser->first_nonspace + 1);
- S_advance_offset(parser, input, parser->first_nonspace - parser->offset,
- false);
- add_line(container, input, parser);
- }
-
- parser->current = container;
- }
-}
-
-/* See http://spec.commonmark.org/0.24/#phase-1-block-structure */
-static void S_process_line(cmark_parser *parser, const unsigned char *buffer,
- bufsize_t bytes) {
- cmark_node *last_matched_container;
- bool all_matched = true;
- cmark_node *container;
- cmark_chunk input;
- cmark_node *current;
-
- cmark_strbuf_clear(&parser->curline);
-
- if (parser->options & CMARK_OPT_VALIDATE_UTF8)
- cmark_utf8proc_check(&parser->curline, buffer, bytes);
- else
- cmark_strbuf_put(&parser->curline, buffer, bytes);
-
- bytes = parser->curline.size;
-
- // ensure line ends with a newline:
- if (bytes == 0 || !S_is_line_end_char(parser->curline.ptr[bytes - 1]))
- cmark_strbuf_putc(&parser->curline, '\n');
-
- parser->offset = 0;
- parser->column = 0;
- parser->first_nonspace = 0;
- parser->first_nonspace_column = 0;
- parser->thematic_break_kill_pos = 0;
- parser->indent = 0;
- parser->blank = false;
- parser->partially_consumed_tab = false;
-
- input.data = parser->curline.ptr;
- input.len = parser->curline.size;
- input.alloc = 0;
-
- // Skip UTF-8 BOM.
- if (parser->line_number == 0 &&
- input.len >= 3 &&
- memcmp(input.data, "\xef\xbb\xbf", 3) == 0)
- parser->offset += 3;
-
- parser->line_number++;
-
- last_matched_container = check_open_blocks(parser, &input, &all_matched);
-
- if (!last_matched_container)
- goto finished;
-
- container = last_matched_container;
-
- current = parser->current;
-
- open_new_blocks(parser, &container, &input, all_matched);
-
- /* parser->current might have changed if feed_reentrant was called */
- if (current == parser->current)
- add_text_to_container(parser, container, last_matched_container, &input);
-
-finished:
- parser->last_line_length = input.len;
- if (parser->last_line_length &&
- input.data[parser->last_line_length - 1] == '\n')
- parser->last_line_length -= 1;
- if (parser->last_line_length &&
- input.data[parser->last_line_length - 1] == '\r')
- parser->last_line_length -= 1;
-
- cmark_strbuf_clear(&parser->curline);
-}
-
-cmark_node *cmark_parser_finish(cmark_parser *parser) {
- cmark_node *res;
- cmark_llist *extensions;
-
- /* Parser was already finished once */
- if (parser->root == NULL)
- return NULL;
-
- if (parser->linebuf.size) {
- S_process_line(parser, parser->linebuf.ptr, parser->linebuf.size);
- cmark_strbuf_clear(&parser->linebuf);
- }
-
- finalize_document(parser);
-
- cmark_consolidate_text_nodes(parser->root);
-
- cmark_strbuf_free(&parser->curline);
- cmark_strbuf_free(&parser->linebuf);
-
-#if CMARK_DEBUG_NODES
- if (cmark_node_check(parser->root, stderr)) {
- abort();
- }
-#endif
-
- for (extensions = parser->syntax_extensions; extensions; extensions = extensions->next) {
- cmark_syntax_extension *ext = (cmark_syntax_extension *) extensions->data;
- if (ext->postprocess_func) {
- cmark_node *processed = ext->postprocess_func(ext, parser, parser->root);
- if (processed)
- parser->root = processed;
- }
- }
-
- res = parser->root;
- parser->root = NULL;
-
- cmark_parser_reset(parser);
-
- return res;
-}
-
-int cmark_parser_get_line_number(cmark_parser *parser) {
- return parser->line_number;
-}
-
-bufsize_t cmark_parser_get_offset(cmark_parser *parser) {
- return parser->offset;
-}
-
-bufsize_t cmark_parser_get_column(cmark_parser *parser) {
- return parser->column;
-}
-
-int cmark_parser_get_first_nonspace(cmark_parser *parser) {
- return parser->first_nonspace;
-}
-
-int cmark_parser_get_first_nonspace_column(cmark_parser *parser) {
- return parser->first_nonspace_column;
-}
-
-int cmark_parser_get_indent(cmark_parser *parser) {
- return parser->indent;
-}
-
-int cmark_parser_is_blank(cmark_parser *parser) {
- return parser->blank;
-}
-
-int cmark_parser_has_partially_consumed_tab(cmark_parser *parser) {
- return parser->partially_consumed_tab;
-}
-
-int cmark_parser_get_last_line_length(cmark_parser *parser) {
- return parser->last_line_length;
-}
-
-cmark_node *cmark_parser_add_child(cmark_parser *parser,
- cmark_node *parent,
- cmark_node_type block_type,
- int start_column) {
- return add_child(parser, parent, block_type, start_column);
-}
-
-void cmark_parser_advance_offset(cmark_parser *parser,
- const char *input,
- int count,
- int columns) {
- cmark_chunk input_chunk = cmark_chunk_literal(input);
-
- S_advance_offset(parser, &input_chunk, count, columns != 0);
-}
-
-void cmark_parser_set_backslash_ispunct_func(cmark_parser *parser,
- cmark_ispunct_func func) {
- parser->backslash_ispunct = func;
-}
-
-cmark_llist *cmark_parser_get_syntax_extensions(cmark_parser *parser) {
- return parser->syntax_extensions;
-}
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/blocks.o b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/blocks.o
deleted file mode 100644
index 9ecdb1f..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/blocks.o and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.c b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.c
deleted file mode 100644
index c7934e5..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.c
+++ /dev/null
@@ -1,278 +0,0 @@
-#include
-#include
-#include
-#include
-#include
-#include
-#include
-#include
-
-#include "config.h"
-#include "cmark_ctype.h"
-#include "buffer.h"
-
-/* Used as default value for cmark_strbuf->ptr so that people can always
- * assume ptr is non-NULL and zero terminated even for new cmark_strbufs.
- */
-unsigned char cmark_strbuf__initbuf[1];
-
-#ifndef MIN
-#define MIN(x, y) ((x < y) ? x : y)
-#endif
-
-void cmark_strbuf_init(cmark_mem *mem, cmark_strbuf *buf,
- bufsize_t initial_size) {
- buf->mem = mem;
- buf->asize = 0;
- buf->size = 0;
- buf->ptr = cmark_strbuf__initbuf;
-
- if (initial_size > 0)
- cmark_strbuf_grow(buf, initial_size);
-}
-
-static CMARK_INLINE void S_strbuf_grow_by(cmark_strbuf *buf, bufsize_t add) {
- cmark_strbuf_grow(buf, buf->size + add);
-}
-
-void cmark_strbuf_grow(cmark_strbuf *buf, bufsize_t target_size) {
- assert(target_size > 0);
-
- if (target_size < buf->asize)
- return;
-
- if (target_size > (bufsize_t)(INT32_MAX / 2)) {
- fprintf(stderr,
- "[cmark] cmark_strbuf_grow requests buffer with size > %d, aborting\n",
- (INT32_MAX / 2));
- abort();
- }
-
- /* Oversize the buffer by 50% to guarantee amortized linear time
- * complexity on append operations. */
- bufsize_t new_size = target_size + target_size / 2;
- new_size += 1;
- new_size = (new_size + 7) & ~7;
-
- buf->ptr = (unsigned char *)buf->mem->realloc(buf->asize ? buf->ptr : NULL,
- new_size);
- buf->asize = new_size;
-}
-
-bufsize_t cmark_strbuf_len(const cmark_strbuf *buf) { return buf->size; }
-
-void cmark_strbuf_free(cmark_strbuf *buf) {
- if (!buf)
- return;
-
- if (buf->ptr != cmark_strbuf__initbuf)
- buf->mem->free(buf->ptr);
-
- cmark_strbuf_init(buf->mem, buf, 0);
-}
-
-void cmark_strbuf_clear(cmark_strbuf *buf) {
- buf->size = 0;
-
- if (buf->asize > 0)
- buf->ptr[0] = '\0';
-}
-
-void cmark_strbuf_set(cmark_strbuf *buf, const unsigned char *data,
- bufsize_t len) {
- if (len <= 0 || data == NULL) {
- cmark_strbuf_clear(buf);
- } else {
- if (data != buf->ptr) {
- if (len >= buf->asize)
- cmark_strbuf_grow(buf, len);
- memmove(buf->ptr, data, len);
- }
- buf->size = len;
- buf->ptr[buf->size] = '\0';
- }
-}
-
-void cmark_strbuf_sets(cmark_strbuf *buf, const char *string) {
- cmark_strbuf_set(buf, (const unsigned char *)string,
- string ? (bufsize_t)strlen(string) : 0);
-}
-
-void cmark_strbuf_putc(cmark_strbuf *buf, int c) {
- S_strbuf_grow_by(buf, 1);
- buf->ptr[buf->size++] = (unsigned char)(c & 0xFF);
- buf->ptr[buf->size] = '\0';
-}
-
-void cmark_strbuf_put(cmark_strbuf *buf, const unsigned char *data,
- bufsize_t len) {
- if (len <= 0)
- return;
-
- S_strbuf_grow_by(buf, len);
- memmove(buf->ptr + buf->size, data, len);
- buf->size += len;
- buf->ptr[buf->size] = '\0';
-}
-
-void cmark_strbuf_puts(cmark_strbuf *buf, const char *string) {
- cmark_strbuf_put(buf, (const unsigned char *)string, (bufsize_t)strlen(string));
-}
-
-void cmark_strbuf_copy_cstr(char *data, bufsize_t datasize,
- const cmark_strbuf *buf) {
- bufsize_t copylen;
-
- assert(buf);
- if (!data || datasize <= 0)
- return;
-
- data[0] = '\0';
-
- if (buf->size == 0 || buf->asize <= 0)
- return;
-
- copylen = buf->size;
- if (copylen > datasize - 1)
- copylen = datasize - 1;
- memmove(data, buf->ptr, copylen);
- data[copylen] = '\0';
-}
-
-void cmark_strbuf_swap(cmark_strbuf *buf_a, cmark_strbuf *buf_b) {
- cmark_strbuf t = *buf_a;
- *buf_a = *buf_b;
- *buf_b = t;
-}
-
-unsigned char *cmark_strbuf_detach(cmark_strbuf *buf) {
- unsigned char *data = buf->ptr;
-
- if (buf->asize == 0) {
- /* return an empty string */
- return (unsigned char *)buf->mem->calloc(1, 1);
- }
-
- cmark_strbuf_init(buf->mem, buf, 0);
- return data;
-}
-
-int cmark_strbuf_cmp(const cmark_strbuf *a, const cmark_strbuf *b) {
- int result = memcmp(a->ptr, b->ptr, MIN(a->size, b->size));
- return (result != 0) ? result
- : (a->size < b->size) ? -1 : (a->size > b->size) ? 1 : 0;
-}
-
-bufsize_t cmark_strbuf_strchr(const cmark_strbuf *buf, int c, bufsize_t pos) {
- if (pos >= buf->size)
- return -1;
- if (pos < 0)
- pos = 0;
-
- const unsigned char *p =
- (unsigned char *)memchr(buf->ptr + pos, c, buf->size - pos);
- if (!p)
- return -1;
-
- return (bufsize_t)(p - (const unsigned char *)buf->ptr);
-}
-
-bufsize_t cmark_strbuf_strrchr(const cmark_strbuf *buf, int c, bufsize_t pos) {
- if (pos < 0 || buf->size == 0)
- return -1;
- if (pos >= buf->size)
- pos = buf->size - 1;
-
- bufsize_t i;
- for (i = pos; i >= 0; i--) {
- if (buf->ptr[i] == (unsigned char)c)
- return i;
- }
-
- return -1;
-}
-
-void cmark_strbuf_truncate(cmark_strbuf *buf, bufsize_t len) {
- if (len < 0)
- len = 0;
-
- if (len < buf->size) {
- buf->size = len;
- buf->ptr[buf->size] = '\0';
- }
-}
-
-void cmark_strbuf_drop(cmark_strbuf *buf, bufsize_t n) {
- if (n > 0) {
- if (n > buf->size)
- n = buf->size;
- buf->size = buf->size - n;
- if (buf->size)
- memmove(buf->ptr, buf->ptr + n, buf->size);
-
- buf->ptr[buf->size] = '\0';
- }
-}
-
-void cmark_strbuf_rtrim(cmark_strbuf *buf) {
- if (!buf->size)
- return;
-
- while (buf->size > 0) {
- if (!cmark_isspace(buf->ptr[buf->size - 1]))
- break;
-
- buf->size--;
- }
-
- buf->ptr[buf->size] = '\0';
-}
-
-void cmark_strbuf_trim(cmark_strbuf *buf) {
- bufsize_t i = 0;
-
- if (!buf->size)
- return;
-
- while (i < buf->size && cmark_isspace(buf->ptr[i]))
- i++;
-
- cmark_strbuf_drop(buf, i);
-
- cmark_strbuf_rtrim(buf);
-}
-
-// Destructively modify string, collapsing consecutive
-// space and newline characters into a single space.
-void cmark_strbuf_normalize_whitespace(cmark_strbuf *s) {
- bool last_char_was_space = false;
- bufsize_t r, w;
-
- for (r = 0, w = 0; r < s->size; ++r) {
- if (cmark_isspace(s->ptr[r])) {
- if (!last_char_was_space) {
- s->ptr[w++] = ' ';
- last_char_was_space = true;
- }
- } else {
- s->ptr[w++] = s->ptr[r];
- last_char_was_space = false;
- }
- }
-
- cmark_strbuf_truncate(s, w);
-}
-
-// Destructively unescape a string: remove backslashes before punctuation chars.
-extern void cmark_strbuf_unescape(cmark_strbuf *buf) {
- bufsize_t r, w;
-
- for (r = 0, w = 0; r < buf->size; ++r) {
- if (buf->ptr[r] == '\\' && cmark_ispunct(buf->ptr[r + 1]))
- r++;
-
- buf->ptr[w++] = buf->ptr[r];
- }
-
- cmark_strbuf_truncate(buf, w);
-}
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.h
deleted file mode 100644
index b85bb44..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.h
+++ /dev/null
@@ -1,116 +0,0 @@
-#ifndef CMARK_BUFFER_H
-#define CMARK_BUFFER_H
-
-#include
-#include
-#include
-#include
-#include
-#include "config.h"
-#include "cmark-gfm.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef struct {
- cmark_mem *mem;
- unsigned char *ptr;
- bufsize_t asize, size;
-} cmark_strbuf;
-
-extern unsigned char cmark_strbuf__initbuf[];
-
-#define CMARK_BUF_INIT(mem) \
- { mem, cmark_strbuf__initbuf, 0, 0 }
-
-/**
- * Initialize a cmark_strbuf structure.
- *
- * For the cases where CMARK_BUF_INIT cannot be used to do static
- * initialization.
- */
-CMARK_GFM_EXPORT
-void cmark_strbuf_init(cmark_mem *mem, cmark_strbuf *buf,
- bufsize_t initial_size);
-
-/**
- * Grow the buffer to hold at least `target_size` bytes.
- */
-CMARK_GFM_EXPORT
-void cmark_strbuf_grow(cmark_strbuf *buf, bufsize_t target_size);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_free(cmark_strbuf *buf);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_swap(cmark_strbuf *buf_a, cmark_strbuf *buf_b);
-
-CMARK_GFM_EXPORT
-bufsize_t cmark_strbuf_len(const cmark_strbuf *buf);
-
-CMARK_GFM_EXPORT
-int cmark_strbuf_cmp(const cmark_strbuf *a, const cmark_strbuf *b);
-
-CMARK_GFM_EXPORT
-unsigned char *cmark_strbuf_detach(cmark_strbuf *buf);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_copy_cstr(char *data, bufsize_t datasize,
- const cmark_strbuf *buf);
-
-static CMARK_INLINE const char *cmark_strbuf_cstr(const cmark_strbuf *buf) {
- return (char *)buf->ptr;
-}
-
-#define cmark_strbuf_at(buf, n) ((buf)->ptr[n])
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_set(cmark_strbuf *buf, const unsigned char *data,
- bufsize_t len);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_sets(cmark_strbuf *buf, const char *string);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_putc(cmark_strbuf *buf, int c);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_put(cmark_strbuf *buf, const unsigned char *data,
- bufsize_t len);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_puts(cmark_strbuf *buf, const char *string);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_clear(cmark_strbuf *buf);
-
-CMARK_GFM_EXPORT
-bufsize_t cmark_strbuf_strchr(const cmark_strbuf *buf, int c, bufsize_t pos);
-
-CMARK_GFM_EXPORT
-bufsize_t cmark_strbuf_strrchr(const cmark_strbuf *buf, int c, bufsize_t pos);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_drop(cmark_strbuf *buf, bufsize_t n);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_truncate(cmark_strbuf *buf, bufsize_t len);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_rtrim(cmark_strbuf *buf);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_trim(cmark_strbuf *buf);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_normalize_whitespace(cmark_strbuf *s);
-
-CMARK_GFM_EXPORT
-void cmark_strbuf_unescape(cmark_strbuf *s);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.o b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.o
deleted file mode 100644
index 4732920..0000000
Binary files a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/buffer.o and /dev/null differ
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/case_fold_switch.inc b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/case_fold_switch.inc
deleted file mode 100644
index 28e223e..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/case_fold_switch.inc
+++ /dev/null
@@ -1,4327 +0,0 @@
- switch (c) {
- case 0x0041:
- bufpush(0x0061);
- break;
- case 0x0042:
- bufpush(0x0062);
- break;
- case 0x0043:
- bufpush(0x0063);
- break;
- case 0x0044:
- bufpush(0x0064);
- break;
- case 0x0045:
- bufpush(0x0065);
- break;
- case 0x0046:
- bufpush(0x0066);
- break;
- case 0x0047:
- bufpush(0x0067);
- break;
- case 0x0048:
- bufpush(0x0068);
- break;
- case 0x0049:
- bufpush(0x0069);
- break;
- case 0x004A:
- bufpush(0x006A);
- break;
- case 0x004B:
- bufpush(0x006B);
- break;
- case 0x004C:
- bufpush(0x006C);
- break;
- case 0x004D:
- bufpush(0x006D);
- break;
- case 0x004E:
- bufpush(0x006E);
- break;
- case 0x004F:
- bufpush(0x006F);
- break;
- case 0x0050:
- bufpush(0x0070);
- break;
- case 0x0051:
- bufpush(0x0071);
- break;
- case 0x0052:
- bufpush(0x0072);
- break;
- case 0x0053:
- bufpush(0x0073);
- break;
- case 0x0054:
- bufpush(0x0074);
- break;
- case 0x0055:
- bufpush(0x0075);
- break;
- case 0x0056:
- bufpush(0x0076);
- break;
- case 0x0057:
- bufpush(0x0077);
- break;
- case 0x0058:
- bufpush(0x0078);
- break;
- case 0x0059:
- bufpush(0x0079);
- break;
- case 0x005A:
- bufpush(0x007A);
- break;
- case 0x00B5:
- bufpush(0x03BC);
- break;
- case 0x00C0:
- bufpush(0x00E0);
- break;
- case 0x00C1:
- bufpush(0x00E1);
- break;
- case 0x00C2:
- bufpush(0x00E2);
- break;
- case 0x00C3:
- bufpush(0x00E3);
- break;
- case 0x00C4:
- bufpush(0x00E4);
- break;
- case 0x00C5:
- bufpush(0x00E5);
- break;
- case 0x00C6:
- bufpush(0x00E6);
- break;
- case 0x00C7:
- bufpush(0x00E7);
- break;
- case 0x00C8:
- bufpush(0x00E8);
- break;
- case 0x00C9:
- bufpush(0x00E9);
- break;
- case 0x00CA:
- bufpush(0x00EA);
- break;
- case 0x00CB:
- bufpush(0x00EB);
- break;
- case 0x00CC:
- bufpush(0x00EC);
- break;
- case 0x00CD:
- bufpush(0x00ED);
- break;
- case 0x00CE:
- bufpush(0x00EE);
- break;
- case 0x00CF:
- bufpush(0x00EF);
- break;
- case 0x00D0:
- bufpush(0x00F0);
- break;
- case 0x00D1:
- bufpush(0x00F1);
- break;
- case 0x00D2:
- bufpush(0x00F2);
- break;
- case 0x00D3:
- bufpush(0x00F3);
- break;
- case 0x00D4:
- bufpush(0x00F4);
- break;
- case 0x00D5:
- bufpush(0x00F5);
- break;
- case 0x00D6:
- bufpush(0x00F6);
- break;
- case 0x00D8:
- bufpush(0x00F8);
- break;
- case 0x00D9:
- bufpush(0x00F9);
- break;
- case 0x00DA:
- bufpush(0x00FA);
- break;
- case 0x00DB:
- bufpush(0x00FB);
- break;
- case 0x00DC:
- bufpush(0x00FC);
- break;
- case 0x00DD:
- bufpush(0x00FD);
- break;
- case 0x00DE:
- bufpush(0x00FE);
- break;
- case 0x00DF:
- bufpush(0x0073);
- bufpush(0x0073);
- break;
- case 0x0100:
- bufpush(0x0101);
- break;
- case 0x0102:
- bufpush(0x0103);
- break;
- case 0x0104:
- bufpush(0x0105);
- break;
- case 0x0106:
- bufpush(0x0107);
- break;
- case 0x0108:
- bufpush(0x0109);
- break;
- case 0x010A:
- bufpush(0x010B);
- break;
- case 0x010C:
- bufpush(0x010D);
- break;
- case 0x010E:
- bufpush(0x010F);
- break;
- case 0x0110:
- bufpush(0x0111);
- break;
- case 0x0112:
- bufpush(0x0113);
- break;
- case 0x0114:
- bufpush(0x0115);
- break;
- case 0x0116:
- bufpush(0x0117);
- break;
- case 0x0118:
- bufpush(0x0119);
- break;
- case 0x011A:
- bufpush(0x011B);
- break;
- case 0x011C:
- bufpush(0x011D);
- break;
- case 0x011E:
- bufpush(0x011F);
- break;
- case 0x0120:
- bufpush(0x0121);
- break;
- case 0x0122:
- bufpush(0x0123);
- break;
- case 0x0124:
- bufpush(0x0125);
- break;
- case 0x0126:
- bufpush(0x0127);
- break;
- case 0x0128:
- bufpush(0x0129);
- break;
- case 0x012A:
- bufpush(0x012B);
- break;
- case 0x012C:
- bufpush(0x012D);
- break;
- case 0x012E:
- bufpush(0x012F);
- break;
- case 0x0130:
- bufpush(0x0069);
- bufpush(0x0307);
- break;
- case 0x0132:
- bufpush(0x0133);
- break;
- case 0x0134:
- bufpush(0x0135);
- break;
- case 0x0136:
- bufpush(0x0137);
- break;
- case 0x0139:
- bufpush(0x013A);
- break;
- case 0x013B:
- bufpush(0x013C);
- break;
- case 0x013D:
- bufpush(0x013E);
- break;
- case 0x013F:
- bufpush(0x0140);
- break;
- case 0x0141:
- bufpush(0x0142);
- break;
- case 0x0143:
- bufpush(0x0144);
- break;
- case 0x0145:
- bufpush(0x0146);
- break;
- case 0x0147:
- bufpush(0x0148);
- break;
- case 0x0149:
- bufpush(0x02BC);
- bufpush(0x006E);
- break;
- case 0x014A:
- bufpush(0x014B);
- break;
- case 0x014C:
- bufpush(0x014D);
- break;
- case 0x014E:
- bufpush(0x014F);
- break;
- case 0x0150:
- bufpush(0x0151);
- break;
- case 0x0152:
- bufpush(0x0153);
- break;
- case 0x0154:
- bufpush(0x0155);
- break;
- case 0x0156:
- bufpush(0x0157);
- break;
- case 0x0158:
- bufpush(0x0159);
- break;
- case 0x015A:
- bufpush(0x015B);
- break;
- case 0x015C:
- bufpush(0x015D);
- break;
- case 0x015E:
- bufpush(0x015F);
- break;
- case 0x0160:
- bufpush(0x0161);
- break;
- case 0x0162:
- bufpush(0x0163);
- break;
- case 0x0164:
- bufpush(0x0165);
- break;
- case 0x0166:
- bufpush(0x0167);
- break;
- case 0x0168:
- bufpush(0x0169);
- break;
- case 0x016A:
- bufpush(0x016B);
- break;
- case 0x016C:
- bufpush(0x016D);
- break;
- case 0x016E:
- bufpush(0x016F);
- break;
- case 0x0170:
- bufpush(0x0171);
- break;
- case 0x0172:
- bufpush(0x0173);
- break;
- case 0x0174:
- bufpush(0x0175);
- break;
- case 0x0176:
- bufpush(0x0177);
- break;
- case 0x0178:
- bufpush(0x00FF);
- break;
- case 0x0179:
- bufpush(0x017A);
- break;
- case 0x017B:
- bufpush(0x017C);
- break;
- case 0x017D:
- bufpush(0x017E);
- break;
- case 0x017F:
- bufpush(0x0073);
- break;
- case 0x0181:
- bufpush(0x0253);
- break;
- case 0x0182:
- bufpush(0x0183);
- break;
- case 0x0184:
- bufpush(0x0185);
- break;
- case 0x0186:
- bufpush(0x0254);
- break;
- case 0x0187:
- bufpush(0x0188);
- break;
- case 0x0189:
- bufpush(0x0256);
- break;
- case 0x018A:
- bufpush(0x0257);
- break;
- case 0x018B:
- bufpush(0x018C);
- break;
- case 0x018E:
- bufpush(0x01DD);
- break;
- case 0x018F:
- bufpush(0x0259);
- break;
- case 0x0190:
- bufpush(0x025B);
- break;
- case 0x0191:
- bufpush(0x0192);
- break;
- case 0x0193:
- bufpush(0x0260);
- break;
- case 0x0194:
- bufpush(0x0263);
- break;
- case 0x0196:
- bufpush(0x0269);
- break;
- case 0x0197:
- bufpush(0x0268);
- break;
- case 0x0198:
- bufpush(0x0199);
- break;
- case 0x019C:
- bufpush(0x026F);
- break;
- case 0x019D:
- bufpush(0x0272);
- break;
- case 0x019F:
- bufpush(0x0275);
- break;
- case 0x01A0:
- bufpush(0x01A1);
- break;
- case 0x01A2:
- bufpush(0x01A3);
- break;
- case 0x01A4:
- bufpush(0x01A5);
- break;
- case 0x01A6:
- bufpush(0x0280);
- break;
- case 0x01A7:
- bufpush(0x01A8);
- break;
- case 0x01A9:
- bufpush(0x0283);
- break;
- case 0x01AC:
- bufpush(0x01AD);
- break;
- case 0x01AE:
- bufpush(0x0288);
- break;
- case 0x01AF:
- bufpush(0x01B0);
- break;
- case 0x01B1:
- bufpush(0x028A);
- break;
- case 0x01B2:
- bufpush(0x028B);
- break;
- case 0x01B3:
- bufpush(0x01B4);
- break;
- case 0x01B5:
- bufpush(0x01B6);
- break;
- case 0x01B7:
- bufpush(0x0292);
- break;
- case 0x01B8:
- bufpush(0x01B9);
- break;
- case 0x01BC:
- bufpush(0x01BD);
- break;
- case 0x01C4:
- bufpush(0x01C6);
- break;
- case 0x01C5:
- bufpush(0x01C6);
- break;
- case 0x01C7:
- bufpush(0x01C9);
- break;
- case 0x01C8:
- bufpush(0x01C9);
- break;
- case 0x01CA:
- bufpush(0x01CC);
- break;
- case 0x01CB:
- bufpush(0x01CC);
- break;
- case 0x01CD:
- bufpush(0x01CE);
- break;
- case 0x01CF:
- bufpush(0x01D0);
- break;
- case 0x01D1:
- bufpush(0x01D2);
- break;
- case 0x01D3:
- bufpush(0x01D4);
- break;
- case 0x01D5:
- bufpush(0x01D6);
- break;
- case 0x01D7:
- bufpush(0x01D8);
- break;
- case 0x01D9:
- bufpush(0x01DA);
- break;
- case 0x01DB:
- bufpush(0x01DC);
- break;
- case 0x01DE:
- bufpush(0x01DF);
- break;
- case 0x01E0:
- bufpush(0x01E1);
- break;
- case 0x01E2:
- bufpush(0x01E3);
- break;
- case 0x01E4:
- bufpush(0x01E5);
- break;
- case 0x01E6:
- bufpush(0x01E7);
- break;
- case 0x01E8:
- bufpush(0x01E9);
- break;
- case 0x01EA:
- bufpush(0x01EB);
- break;
- case 0x01EC:
- bufpush(0x01ED);
- break;
- case 0x01EE:
- bufpush(0x01EF);
- break;
- case 0x01F0:
- bufpush(0x006A);
- bufpush(0x030C);
- break;
- case 0x01F1:
- bufpush(0x01F3);
- break;
- case 0x01F2:
- bufpush(0x01F3);
- break;
- case 0x01F4:
- bufpush(0x01F5);
- break;
- case 0x01F6:
- bufpush(0x0195);
- break;
- case 0x01F7:
- bufpush(0x01BF);
- break;
- case 0x01F8:
- bufpush(0x01F9);
- break;
- case 0x01FA:
- bufpush(0x01FB);
- break;
- case 0x01FC:
- bufpush(0x01FD);
- break;
- case 0x01FE:
- bufpush(0x01FF);
- break;
- case 0x0200:
- bufpush(0x0201);
- break;
- case 0x0202:
- bufpush(0x0203);
- break;
- case 0x0204:
- bufpush(0x0205);
- break;
- case 0x0206:
- bufpush(0x0207);
- break;
- case 0x0208:
- bufpush(0x0209);
- break;
- case 0x020A:
- bufpush(0x020B);
- break;
- case 0x020C:
- bufpush(0x020D);
- break;
- case 0x020E:
- bufpush(0x020F);
- break;
- case 0x0210:
- bufpush(0x0211);
- break;
- case 0x0212:
- bufpush(0x0213);
- break;
- case 0x0214:
- bufpush(0x0215);
- break;
- case 0x0216:
- bufpush(0x0217);
- break;
- case 0x0218:
- bufpush(0x0219);
- break;
- case 0x021A:
- bufpush(0x021B);
- break;
- case 0x021C:
- bufpush(0x021D);
- break;
- case 0x021E:
- bufpush(0x021F);
- break;
- case 0x0220:
- bufpush(0x019E);
- break;
- case 0x0222:
- bufpush(0x0223);
- break;
- case 0x0224:
- bufpush(0x0225);
- break;
- case 0x0226:
- bufpush(0x0227);
- break;
- case 0x0228:
- bufpush(0x0229);
- break;
- case 0x022A:
- bufpush(0x022B);
- break;
- case 0x022C:
- bufpush(0x022D);
- break;
- case 0x022E:
- bufpush(0x022F);
- break;
- case 0x0230:
- bufpush(0x0231);
- break;
- case 0x0232:
- bufpush(0x0233);
- break;
- case 0x023A:
- bufpush(0x2C65);
- break;
- case 0x023B:
- bufpush(0x023C);
- break;
- case 0x023D:
- bufpush(0x019A);
- break;
- case 0x023E:
- bufpush(0x2C66);
- break;
- case 0x0241:
- bufpush(0x0242);
- break;
- case 0x0243:
- bufpush(0x0180);
- break;
- case 0x0244:
- bufpush(0x0289);
- break;
- case 0x0245:
- bufpush(0x028C);
- break;
- case 0x0246:
- bufpush(0x0247);
- break;
- case 0x0248:
- bufpush(0x0249);
- break;
- case 0x024A:
- bufpush(0x024B);
- break;
- case 0x024C:
- bufpush(0x024D);
- break;
- case 0x024E:
- bufpush(0x024F);
- break;
- case 0x0345:
- bufpush(0x03B9);
- break;
- case 0x0370:
- bufpush(0x0371);
- break;
- case 0x0372:
- bufpush(0x0373);
- break;
- case 0x0376:
- bufpush(0x0377);
- break;
- case 0x037F:
- bufpush(0x03F3);
- break;
- case 0x0386:
- bufpush(0x03AC);
- break;
- case 0x0388:
- bufpush(0x03AD);
- break;
- case 0x0389:
- bufpush(0x03AE);
- break;
- case 0x038A:
- bufpush(0x03AF);
- break;
- case 0x038C:
- bufpush(0x03CC);
- break;
- case 0x038E:
- bufpush(0x03CD);
- break;
- case 0x038F:
- bufpush(0x03CE);
- break;
- case 0x0390:
- bufpush(0x03B9);
- bufpush(0x0308);
- bufpush(0x0301);
- break;
- case 0x0391:
- bufpush(0x03B1);
- break;
- case 0x0392:
- bufpush(0x03B2);
- break;
- case 0x0393:
- bufpush(0x03B3);
- break;
- case 0x0394:
- bufpush(0x03B4);
- break;
- case 0x0395:
- bufpush(0x03B5);
- break;
- case 0x0396:
- bufpush(0x03B6);
- break;
- case 0x0397:
- bufpush(0x03B7);
- break;
- case 0x0398:
- bufpush(0x03B8);
- break;
- case 0x0399:
- bufpush(0x03B9);
- break;
- case 0x039A:
- bufpush(0x03BA);
- break;
- case 0x039B:
- bufpush(0x03BB);
- break;
- case 0x039C:
- bufpush(0x03BC);
- break;
- case 0x039D:
- bufpush(0x03BD);
- break;
- case 0x039E:
- bufpush(0x03BE);
- break;
- case 0x039F:
- bufpush(0x03BF);
- break;
- case 0x03A0:
- bufpush(0x03C0);
- break;
- case 0x03A1:
- bufpush(0x03C1);
- break;
- case 0x03A3:
- bufpush(0x03C3);
- break;
- case 0x03A4:
- bufpush(0x03C4);
- break;
- case 0x03A5:
- bufpush(0x03C5);
- break;
- case 0x03A6:
- bufpush(0x03C6);
- break;
- case 0x03A7:
- bufpush(0x03C7);
- break;
- case 0x03A8:
- bufpush(0x03C8);
- break;
- case 0x03A9:
- bufpush(0x03C9);
- break;
- case 0x03AA:
- bufpush(0x03CA);
- break;
- case 0x03AB:
- bufpush(0x03CB);
- break;
- case 0x03B0:
- bufpush(0x03C5);
- bufpush(0x0308);
- bufpush(0x0301);
- break;
- case 0x03C2:
- bufpush(0x03C3);
- break;
- case 0x03CF:
- bufpush(0x03D7);
- break;
- case 0x03D0:
- bufpush(0x03B2);
- break;
- case 0x03D1:
- bufpush(0x03B8);
- break;
- case 0x03D5:
- bufpush(0x03C6);
- break;
- case 0x03D6:
- bufpush(0x03C0);
- break;
- case 0x03D8:
- bufpush(0x03D9);
- break;
- case 0x03DA:
- bufpush(0x03DB);
- break;
- case 0x03DC:
- bufpush(0x03DD);
- break;
- case 0x03DE:
- bufpush(0x03DF);
- break;
- case 0x03E0:
- bufpush(0x03E1);
- break;
- case 0x03E2:
- bufpush(0x03E3);
- break;
- case 0x03E4:
- bufpush(0x03E5);
- break;
- case 0x03E6:
- bufpush(0x03E7);
- break;
- case 0x03E8:
- bufpush(0x03E9);
- break;
- case 0x03EA:
- bufpush(0x03EB);
- break;
- case 0x03EC:
- bufpush(0x03ED);
- break;
- case 0x03EE:
- bufpush(0x03EF);
- break;
- case 0x03F0:
- bufpush(0x03BA);
- break;
- case 0x03F1:
- bufpush(0x03C1);
- break;
- case 0x03F4:
- bufpush(0x03B8);
- break;
- case 0x03F5:
- bufpush(0x03B5);
- break;
- case 0x03F7:
- bufpush(0x03F8);
- break;
- case 0x03F9:
- bufpush(0x03F2);
- break;
- case 0x03FA:
- bufpush(0x03FB);
- break;
- case 0x03FD:
- bufpush(0x037B);
- break;
- case 0x03FE:
- bufpush(0x037C);
- break;
- case 0x03FF:
- bufpush(0x037D);
- break;
- case 0x0400:
- bufpush(0x0450);
- break;
- case 0x0401:
- bufpush(0x0451);
- break;
- case 0x0402:
- bufpush(0x0452);
- break;
- case 0x0403:
- bufpush(0x0453);
- break;
- case 0x0404:
- bufpush(0x0454);
- break;
- case 0x0405:
- bufpush(0x0455);
- break;
- case 0x0406:
- bufpush(0x0456);
- break;
- case 0x0407:
- bufpush(0x0457);
- break;
- case 0x0408:
- bufpush(0x0458);
- break;
- case 0x0409:
- bufpush(0x0459);
- break;
- case 0x040A:
- bufpush(0x045A);
- break;
- case 0x040B:
- bufpush(0x045B);
- break;
- case 0x040C:
- bufpush(0x045C);
- break;
- case 0x040D:
- bufpush(0x045D);
- break;
- case 0x040E:
- bufpush(0x045E);
- break;
- case 0x040F:
- bufpush(0x045F);
- break;
- case 0x0410:
- bufpush(0x0430);
- break;
- case 0x0411:
- bufpush(0x0431);
- break;
- case 0x0412:
- bufpush(0x0432);
- break;
- case 0x0413:
- bufpush(0x0433);
- break;
- case 0x0414:
- bufpush(0x0434);
- break;
- case 0x0415:
- bufpush(0x0435);
- break;
- case 0x0416:
- bufpush(0x0436);
- break;
- case 0x0417:
- bufpush(0x0437);
- break;
- case 0x0418:
- bufpush(0x0438);
- break;
- case 0x0419:
- bufpush(0x0439);
- break;
- case 0x041A:
- bufpush(0x043A);
- break;
- case 0x041B:
- bufpush(0x043B);
- break;
- case 0x041C:
- bufpush(0x043C);
- break;
- case 0x041D:
- bufpush(0x043D);
- break;
- case 0x041E:
- bufpush(0x043E);
- break;
- case 0x041F:
- bufpush(0x043F);
- break;
- case 0x0420:
- bufpush(0x0440);
- break;
- case 0x0421:
- bufpush(0x0441);
- break;
- case 0x0422:
- bufpush(0x0442);
- break;
- case 0x0423:
- bufpush(0x0443);
- break;
- case 0x0424:
- bufpush(0x0444);
- break;
- case 0x0425:
- bufpush(0x0445);
- break;
- case 0x0426:
- bufpush(0x0446);
- break;
- case 0x0427:
- bufpush(0x0447);
- break;
- case 0x0428:
- bufpush(0x0448);
- break;
- case 0x0429:
- bufpush(0x0449);
- break;
- case 0x042A:
- bufpush(0x044A);
- break;
- case 0x042B:
- bufpush(0x044B);
- break;
- case 0x042C:
- bufpush(0x044C);
- break;
- case 0x042D:
- bufpush(0x044D);
- break;
- case 0x042E:
- bufpush(0x044E);
- break;
- case 0x042F:
- bufpush(0x044F);
- break;
- case 0x0460:
- bufpush(0x0461);
- break;
- case 0x0462:
- bufpush(0x0463);
- break;
- case 0x0464:
- bufpush(0x0465);
- break;
- case 0x0466:
- bufpush(0x0467);
- break;
- case 0x0468:
- bufpush(0x0469);
- break;
- case 0x046A:
- bufpush(0x046B);
- break;
- case 0x046C:
- bufpush(0x046D);
- break;
- case 0x046E:
- bufpush(0x046F);
- break;
- case 0x0470:
- bufpush(0x0471);
- break;
- case 0x0472:
- bufpush(0x0473);
- break;
- case 0x0474:
- bufpush(0x0475);
- break;
- case 0x0476:
- bufpush(0x0477);
- break;
- case 0x0478:
- bufpush(0x0479);
- break;
- case 0x047A:
- bufpush(0x047B);
- break;
- case 0x047C:
- bufpush(0x047D);
- break;
- case 0x047E:
- bufpush(0x047F);
- break;
- case 0x0480:
- bufpush(0x0481);
- break;
- case 0x048A:
- bufpush(0x048B);
- break;
- case 0x048C:
- bufpush(0x048D);
- break;
- case 0x048E:
- bufpush(0x048F);
- break;
- case 0x0490:
- bufpush(0x0491);
- break;
- case 0x0492:
- bufpush(0x0493);
- break;
- case 0x0494:
- bufpush(0x0495);
- break;
- case 0x0496:
- bufpush(0x0497);
- break;
- case 0x0498:
- bufpush(0x0499);
- break;
- case 0x049A:
- bufpush(0x049B);
- break;
- case 0x049C:
- bufpush(0x049D);
- break;
- case 0x049E:
- bufpush(0x049F);
- break;
- case 0x04A0:
- bufpush(0x04A1);
- break;
- case 0x04A2:
- bufpush(0x04A3);
- break;
- case 0x04A4:
- bufpush(0x04A5);
- break;
- case 0x04A6:
- bufpush(0x04A7);
- break;
- case 0x04A8:
- bufpush(0x04A9);
- break;
- case 0x04AA:
- bufpush(0x04AB);
- break;
- case 0x04AC:
- bufpush(0x04AD);
- break;
- case 0x04AE:
- bufpush(0x04AF);
- break;
- case 0x04B0:
- bufpush(0x04B1);
- break;
- case 0x04B2:
- bufpush(0x04B3);
- break;
- case 0x04B4:
- bufpush(0x04B5);
- break;
- case 0x04B6:
- bufpush(0x04B7);
- break;
- case 0x04B8:
- bufpush(0x04B9);
- break;
- case 0x04BA:
- bufpush(0x04BB);
- break;
- case 0x04BC:
- bufpush(0x04BD);
- break;
- case 0x04BE:
- bufpush(0x04BF);
- break;
- case 0x04C0:
- bufpush(0x04CF);
- break;
- case 0x04C1:
- bufpush(0x04C2);
- break;
- case 0x04C3:
- bufpush(0x04C4);
- break;
- case 0x04C5:
- bufpush(0x04C6);
- break;
- case 0x04C7:
- bufpush(0x04C8);
- break;
- case 0x04C9:
- bufpush(0x04CA);
- break;
- case 0x04CB:
- bufpush(0x04CC);
- break;
- case 0x04CD:
- bufpush(0x04CE);
- break;
- case 0x04D0:
- bufpush(0x04D1);
- break;
- case 0x04D2:
- bufpush(0x04D3);
- break;
- case 0x04D4:
- bufpush(0x04D5);
- break;
- case 0x04D6:
- bufpush(0x04D7);
- break;
- case 0x04D8:
- bufpush(0x04D9);
- break;
- case 0x04DA:
- bufpush(0x04DB);
- break;
- case 0x04DC:
- bufpush(0x04DD);
- break;
- case 0x04DE:
- bufpush(0x04DF);
- break;
- case 0x04E0:
- bufpush(0x04E1);
- break;
- case 0x04E2:
- bufpush(0x04E3);
- break;
- case 0x04E4:
- bufpush(0x04E5);
- break;
- case 0x04E6:
- bufpush(0x04E7);
- break;
- case 0x04E8:
- bufpush(0x04E9);
- break;
- case 0x04EA:
- bufpush(0x04EB);
- break;
- case 0x04EC:
- bufpush(0x04ED);
- break;
- case 0x04EE:
- bufpush(0x04EF);
- break;
- case 0x04F0:
- bufpush(0x04F1);
- break;
- case 0x04F2:
- bufpush(0x04F3);
- break;
- case 0x04F4:
- bufpush(0x04F5);
- break;
- case 0x04F6:
- bufpush(0x04F7);
- break;
- case 0x04F8:
- bufpush(0x04F9);
- break;
- case 0x04FA:
- bufpush(0x04FB);
- break;
- case 0x04FC:
- bufpush(0x04FD);
- break;
- case 0x04FE:
- bufpush(0x04FF);
- break;
- case 0x0500:
- bufpush(0x0501);
- break;
- case 0x0502:
- bufpush(0x0503);
- break;
- case 0x0504:
- bufpush(0x0505);
- break;
- case 0x0506:
- bufpush(0x0507);
- break;
- case 0x0508:
- bufpush(0x0509);
- break;
- case 0x050A:
- bufpush(0x050B);
- break;
- case 0x050C:
- bufpush(0x050D);
- break;
- case 0x050E:
- bufpush(0x050F);
- break;
- case 0x0510:
- bufpush(0x0511);
- break;
- case 0x0512:
- bufpush(0x0513);
- break;
- case 0x0514:
- bufpush(0x0515);
- break;
- case 0x0516:
- bufpush(0x0517);
- break;
- case 0x0518:
- bufpush(0x0519);
- break;
- case 0x051A:
- bufpush(0x051B);
- break;
- case 0x051C:
- bufpush(0x051D);
- break;
- case 0x051E:
- bufpush(0x051F);
- break;
- case 0x0520:
- bufpush(0x0521);
- break;
- case 0x0522:
- bufpush(0x0523);
- break;
- case 0x0524:
- bufpush(0x0525);
- break;
- case 0x0526:
- bufpush(0x0527);
- break;
- case 0x0528:
- bufpush(0x0529);
- break;
- case 0x052A:
- bufpush(0x052B);
- break;
- case 0x052C:
- bufpush(0x052D);
- break;
- case 0x052E:
- bufpush(0x052F);
- break;
- case 0x0531:
- bufpush(0x0561);
- break;
- case 0x0532:
- bufpush(0x0562);
- break;
- case 0x0533:
- bufpush(0x0563);
- break;
- case 0x0534:
- bufpush(0x0564);
- break;
- case 0x0535:
- bufpush(0x0565);
- break;
- case 0x0536:
- bufpush(0x0566);
- break;
- case 0x0537:
- bufpush(0x0567);
- break;
- case 0x0538:
- bufpush(0x0568);
- break;
- case 0x0539:
- bufpush(0x0569);
- break;
- case 0x053A:
- bufpush(0x056A);
- break;
- case 0x053B:
- bufpush(0x056B);
- break;
- case 0x053C:
- bufpush(0x056C);
- break;
- case 0x053D:
- bufpush(0x056D);
- break;
- case 0x053E:
- bufpush(0x056E);
- break;
- case 0x053F:
- bufpush(0x056F);
- break;
- case 0x0540:
- bufpush(0x0570);
- break;
- case 0x0541:
- bufpush(0x0571);
- break;
- case 0x0542:
- bufpush(0x0572);
- break;
- case 0x0543:
- bufpush(0x0573);
- break;
- case 0x0544:
- bufpush(0x0574);
- break;
- case 0x0545:
- bufpush(0x0575);
- break;
- case 0x0546:
- bufpush(0x0576);
- break;
- case 0x0547:
- bufpush(0x0577);
- break;
- case 0x0548:
- bufpush(0x0578);
- break;
- case 0x0549:
- bufpush(0x0579);
- break;
- case 0x054A:
- bufpush(0x057A);
- break;
- case 0x054B:
- bufpush(0x057B);
- break;
- case 0x054C:
- bufpush(0x057C);
- break;
- case 0x054D:
- bufpush(0x057D);
- break;
- case 0x054E:
- bufpush(0x057E);
- break;
- case 0x054F:
- bufpush(0x057F);
- break;
- case 0x0550:
- bufpush(0x0580);
- break;
- case 0x0551:
- bufpush(0x0581);
- break;
- case 0x0552:
- bufpush(0x0582);
- break;
- case 0x0553:
- bufpush(0x0583);
- break;
- case 0x0554:
- bufpush(0x0584);
- break;
- case 0x0555:
- bufpush(0x0585);
- break;
- case 0x0556:
- bufpush(0x0586);
- break;
- case 0x0587:
- bufpush(0x0565);
- bufpush(0x0582);
- break;
- case 0x10A0:
- bufpush(0x2D00);
- break;
- case 0x10A1:
- bufpush(0x2D01);
- break;
- case 0x10A2:
- bufpush(0x2D02);
- break;
- case 0x10A3:
- bufpush(0x2D03);
- break;
- case 0x10A4:
- bufpush(0x2D04);
- break;
- case 0x10A5:
- bufpush(0x2D05);
- break;
- case 0x10A6:
- bufpush(0x2D06);
- break;
- case 0x10A7:
- bufpush(0x2D07);
- break;
- case 0x10A8:
- bufpush(0x2D08);
- break;
- case 0x10A9:
- bufpush(0x2D09);
- break;
- case 0x10AA:
- bufpush(0x2D0A);
- break;
- case 0x10AB:
- bufpush(0x2D0B);
- break;
- case 0x10AC:
- bufpush(0x2D0C);
- break;
- case 0x10AD:
- bufpush(0x2D0D);
- break;
- case 0x10AE:
- bufpush(0x2D0E);
- break;
- case 0x10AF:
- bufpush(0x2D0F);
- break;
- case 0x10B0:
- bufpush(0x2D10);
- break;
- case 0x10B1:
- bufpush(0x2D11);
- break;
- case 0x10B2:
- bufpush(0x2D12);
- break;
- case 0x10B3:
- bufpush(0x2D13);
- break;
- case 0x10B4:
- bufpush(0x2D14);
- break;
- case 0x10B5:
- bufpush(0x2D15);
- break;
- case 0x10B6:
- bufpush(0x2D16);
- break;
- case 0x10B7:
- bufpush(0x2D17);
- break;
- case 0x10B8:
- bufpush(0x2D18);
- break;
- case 0x10B9:
- bufpush(0x2D19);
- break;
- case 0x10BA:
- bufpush(0x2D1A);
- break;
- case 0x10BB:
- bufpush(0x2D1B);
- break;
- case 0x10BC:
- bufpush(0x2D1C);
- break;
- case 0x10BD:
- bufpush(0x2D1D);
- break;
- case 0x10BE:
- bufpush(0x2D1E);
- break;
- case 0x10BF:
- bufpush(0x2D1F);
- break;
- case 0x10C0:
- bufpush(0x2D20);
- break;
- case 0x10C1:
- bufpush(0x2D21);
- break;
- case 0x10C2:
- bufpush(0x2D22);
- break;
- case 0x10C3:
- bufpush(0x2D23);
- break;
- case 0x10C4:
- bufpush(0x2D24);
- break;
- case 0x10C5:
- bufpush(0x2D25);
- break;
- case 0x10C7:
- bufpush(0x2D27);
- break;
- case 0x10CD:
- bufpush(0x2D2D);
- break;
- case 0x13F8:
- bufpush(0x13F0);
- break;
- case 0x13F9:
- bufpush(0x13F1);
- break;
- case 0x13FA:
- bufpush(0x13F2);
- break;
- case 0x13FB:
- bufpush(0x13F3);
- break;
- case 0x13FC:
- bufpush(0x13F4);
- break;
- case 0x13FD:
- bufpush(0x13F5);
- break;
- case 0x1C80:
- bufpush(0x0432);
- break;
- case 0x1C81:
- bufpush(0x0434);
- break;
- case 0x1C82:
- bufpush(0x043E);
- break;
- case 0x1C83:
- bufpush(0x0441);
- break;
- case 0x1C84:
- bufpush(0x0442);
- break;
- case 0x1C85:
- bufpush(0x0442);
- break;
- case 0x1C86:
- bufpush(0x044A);
- break;
- case 0x1C87:
- bufpush(0x0463);
- break;
- case 0x1C88:
- bufpush(0xA64B);
- break;
- case 0x1E00:
- bufpush(0x1E01);
- break;
- case 0x1E02:
- bufpush(0x1E03);
- break;
- case 0x1E04:
- bufpush(0x1E05);
- break;
- case 0x1E06:
- bufpush(0x1E07);
- break;
- case 0x1E08:
- bufpush(0x1E09);
- break;
- case 0x1E0A:
- bufpush(0x1E0B);
- break;
- case 0x1E0C:
- bufpush(0x1E0D);
- break;
- case 0x1E0E:
- bufpush(0x1E0F);
- break;
- case 0x1E10:
- bufpush(0x1E11);
- break;
- case 0x1E12:
- bufpush(0x1E13);
- break;
- case 0x1E14:
- bufpush(0x1E15);
- break;
- case 0x1E16:
- bufpush(0x1E17);
- break;
- case 0x1E18:
- bufpush(0x1E19);
- break;
- case 0x1E1A:
- bufpush(0x1E1B);
- break;
- case 0x1E1C:
- bufpush(0x1E1D);
- break;
- case 0x1E1E:
- bufpush(0x1E1F);
- break;
- case 0x1E20:
- bufpush(0x1E21);
- break;
- case 0x1E22:
- bufpush(0x1E23);
- break;
- case 0x1E24:
- bufpush(0x1E25);
- break;
- case 0x1E26:
- bufpush(0x1E27);
- break;
- case 0x1E28:
- bufpush(0x1E29);
- break;
- case 0x1E2A:
- bufpush(0x1E2B);
- break;
- case 0x1E2C:
- bufpush(0x1E2D);
- break;
- case 0x1E2E:
- bufpush(0x1E2F);
- break;
- case 0x1E30:
- bufpush(0x1E31);
- break;
- case 0x1E32:
- bufpush(0x1E33);
- break;
- case 0x1E34:
- bufpush(0x1E35);
- break;
- case 0x1E36:
- bufpush(0x1E37);
- break;
- case 0x1E38:
- bufpush(0x1E39);
- break;
- case 0x1E3A:
- bufpush(0x1E3B);
- break;
- case 0x1E3C:
- bufpush(0x1E3D);
- break;
- case 0x1E3E:
- bufpush(0x1E3F);
- break;
- case 0x1E40:
- bufpush(0x1E41);
- break;
- case 0x1E42:
- bufpush(0x1E43);
- break;
- case 0x1E44:
- bufpush(0x1E45);
- break;
- case 0x1E46:
- bufpush(0x1E47);
- break;
- case 0x1E48:
- bufpush(0x1E49);
- break;
- case 0x1E4A:
- bufpush(0x1E4B);
- break;
- case 0x1E4C:
- bufpush(0x1E4D);
- break;
- case 0x1E4E:
- bufpush(0x1E4F);
- break;
- case 0x1E50:
- bufpush(0x1E51);
- break;
- case 0x1E52:
- bufpush(0x1E53);
- break;
- case 0x1E54:
- bufpush(0x1E55);
- break;
- case 0x1E56:
- bufpush(0x1E57);
- break;
- case 0x1E58:
- bufpush(0x1E59);
- break;
- case 0x1E5A:
- bufpush(0x1E5B);
- break;
- case 0x1E5C:
- bufpush(0x1E5D);
- break;
- case 0x1E5E:
- bufpush(0x1E5F);
- break;
- case 0x1E60:
- bufpush(0x1E61);
- break;
- case 0x1E62:
- bufpush(0x1E63);
- break;
- case 0x1E64:
- bufpush(0x1E65);
- break;
- case 0x1E66:
- bufpush(0x1E67);
- break;
- case 0x1E68:
- bufpush(0x1E69);
- break;
- case 0x1E6A:
- bufpush(0x1E6B);
- break;
- case 0x1E6C:
- bufpush(0x1E6D);
- break;
- case 0x1E6E:
- bufpush(0x1E6F);
- break;
- case 0x1E70:
- bufpush(0x1E71);
- break;
- case 0x1E72:
- bufpush(0x1E73);
- break;
- case 0x1E74:
- bufpush(0x1E75);
- break;
- case 0x1E76:
- bufpush(0x1E77);
- break;
- case 0x1E78:
- bufpush(0x1E79);
- break;
- case 0x1E7A:
- bufpush(0x1E7B);
- break;
- case 0x1E7C:
- bufpush(0x1E7D);
- break;
- case 0x1E7E:
- bufpush(0x1E7F);
- break;
- case 0x1E80:
- bufpush(0x1E81);
- break;
- case 0x1E82:
- bufpush(0x1E83);
- break;
- case 0x1E84:
- bufpush(0x1E85);
- break;
- case 0x1E86:
- bufpush(0x1E87);
- break;
- case 0x1E88:
- bufpush(0x1E89);
- break;
- case 0x1E8A:
- bufpush(0x1E8B);
- break;
- case 0x1E8C:
- bufpush(0x1E8D);
- break;
- case 0x1E8E:
- bufpush(0x1E8F);
- break;
- case 0x1E90:
- bufpush(0x1E91);
- break;
- case 0x1E92:
- bufpush(0x1E93);
- break;
- case 0x1E94:
- bufpush(0x1E95);
- break;
- case 0x1E96:
- bufpush(0x0068);
- bufpush(0x0331);
- break;
- case 0x1E97:
- bufpush(0x0074);
- bufpush(0x0308);
- break;
- case 0x1E98:
- bufpush(0x0077);
- bufpush(0x030A);
- break;
- case 0x1E99:
- bufpush(0x0079);
- bufpush(0x030A);
- break;
- case 0x1E9A:
- bufpush(0x0061);
- bufpush(0x02BE);
- break;
- case 0x1E9B:
- bufpush(0x1E61);
- break;
- case 0x1E9E:
- bufpush(0x0073);
- bufpush(0x0073);
- break;
- case 0x1EA0:
- bufpush(0x1EA1);
- break;
- case 0x1EA2:
- bufpush(0x1EA3);
- break;
- case 0x1EA4:
- bufpush(0x1EA5);
- break;
- case 0x1EA6:
- bufpush(0x1EA7);
- break;
- case 0x1EA8:
- bufpush(0x1EA9);
- break;
- case 0x1EAA:
- bufpush(0x1EAB);
- break;
- case 0x1EAC:
- bufpush(0x1EAD);
- break;
- case 0x1EAE:
- bufpush(0x1EAF);
- break;
- case 0x1EB0:
- bufpush(0x1EB1);
- break;
- case 0x1EB2:
- bufpush(0x1EB3);
- break;
- case 0x1EB4:
- bufpush(0x1EB5);
- break;
- case 0x1EB6:
- bufpush(0x1EB7);
- break;
- case 0x1EB8:
- bufpush(0x1EB9);
- break;
- case 0x1EBA:
- bufpush(0x1EBB);
- break;
- case 0x1EBC:
- bufpush(0x1EBD);
- break;
- case 0x1EBE:
- bufpush(0x1EBF);
- break;
- case 0x1EC0:
- bufpush(0x1EC1);
- break;
- case 0x1EC2:
- bufpush(0x1EC3);
- break;
- case 0x1EC4:
- bufpush(0x1EC5);
- break;
- case 0x1EC6:
- bufpush(0x1EC7);
- break;
- case 0x1EC8:
- bufpush(0x1EC9);
- break;
- case 0x1ECA:
- bufpush(0x1ECB);
- break;
- case 0x1ECC:
- bufpush(0x1ECD);
- break;
- case 0x1ECE:
- bufpush(0x1ECF);
- break;
- case 0x1ED0:
- bufpush(0x1ED1);
- break;
- case 0x1ED2:
- bufpush(0x1ED3);
- break;
- case 0x1ED4:
- bufpush(0x1ED5);
- break;
- case 0x1ED6:
- bufpush(0x1ED7);
- break;
- case 0x1ED8:
- bufpush(0x1ED9);
- break;
- case 0x1EDA:
- bufpush(0x1EDB);
- break;
- case 0x1EDC:
- bufpush(0x1EDD);
- break;
- case 0x1EDE:
- bufpush(0x1EDF);
- break;
- case 0x1EE0:
- bufpush(0x1EE1);
- break;
- case 0x1EE2:
- bufpush(0x1EE3);
- break;
- case 0x1EE4:
- bufpush(0x1EE5);
- break;
- case 0x1EE6:
- bufpush(0x1EE7);
- break;
- case 0x1EE8:
- bufpush(0x1EE9);
- break;
- case 0x1EEA:
- bufpush(0x1EEB);
- break;
- case 0x1EEC:
- bufpush(0x1EED);
- break;
- case 0x1EEE:
- bufpush(0x1EEF);
- break;
- case 0x1EF0:
- bufpush(0x1EF1);
- break;
- case 0x1EF2:
- bufpush(0x1EF3);
- break;
- case 0x1EF4:
- bufpush(0x1EF5);
- break;
- case 0x1EF6:
- bufpush(0x1EF7);
- break;
- case 0x1EF8:
- bufpush(0x1EF9);
- break;
- case 0x1EFA:
- bufpush(0x1EFB);
- break;
- case 0x1EFC:
- bufpush(0x1EFD);
- break;
- case 0x1EFE:
- bufpush(0x1EFF);
- break;
- case 0x1F08:
- bufpush(0x1F00);
- break;
- case 0x1F09:
- bufpush(0x1F01);
- break;
- case 0x1F0A:
- bufpush(0x1F02);
- break;
- case 0x1F0B:
- bufpush(0x1F03);
- break;
- case 0x1F0C:
- bufpush(0x1F04);
- break;
- case 0x1F0D:
- bufpush(0x1F05);
- break;
- case 0x1F0E:
- bufpush(0x1F06);
- break;
- case 0x1F0F:
- bufpush(0x1F07);
- break;
- case 0x1F18:
- bufpush(0x1F10);
- break;
- case 0x1F19:
- bufpush(0x1F11);
- break;
- case 0x1F1A:
- bufpush(0x1F12);
- break;
- case 0x1F1B:
- bufpush(0x1F13);
- break;
- case 0x1F1C:
- bufpush(0x1F14);
- break;
- case 0x1F1D:
- bufpush(0x1F15);
- break;
- case 0x1F28:
- bufpush(0x1F20);
- break;
- case 0x1F29:
- bufpush(0x1F21);
- break;
- case 0x1F2A:
- bufpush(0x1F22);
- break;
- case 0x1F2B:
- bufpush(0x1F23);
- break;
- case 0x1F2C:
- bufpush(0x1F24);
- break;
- case 0x1F2D:
- bufpush(0x1F25);
- break;
- case 0x1F2E:
- bufpush(0x1F26);
- break;
- case 0x1F2F:
- bufpush(0x1F27);
- break;
- case 0x1F38:
- bufpush(0x1F30);
- break;
- case 0x1F39:
- bufpush(0x1F31);
- break;
- case 0x1F3A:
- bufpush(0x1F32);
- break;
- case 0x1F3B:
- bufpush(0x1F33);
- break;
- case 0x1F3C:
- bufpush(0x1F34);
- break;
- case 0x1F3D:
- bufpush(0x1F35);
- break;
- case 0x1F3E:
- bufpush(0x1F36);
- break;
- case 0x1F3F:
- bufpush(0x1F37);
- break;
- case 0x1F48:
- bufpush(0x1F40);
- break;
- case 0x1F49:
- bufpush(0x1F41);
- break;
- case 0x1F4A:
- bufpush(0x1F42);
- break;
- case 0x1F4B:
- bufpush(0x1F43);
- break;
- case 0x1F4C:
- bufpush(0x1F44);
- break;
- case 0x1F4D:
- bufpush(0x1F45);
- break;
- case 0x1F50:
- bufpush(0x03C5);
- bufpush(0x0313);
- break;
- case 0x1F52:
- bufpush(0x03C5);
- bufpush(0x0313);
- bufpush(0x0300);
- break;
- case 0x1F54:
- bufpush(0x03C5);
- bufpush(0x0313);
- bufpush(0x0301);
- break;
- case 0x1F56:
- bufpush(0x03C5);
- bufpush(0x0313);
- bufpush(0x0342);
- break;
- case 0x1F59:
- bufpush(0x1F51);
- break;
- case 0x1F5B:
- bufpush(0x1F53);
- break;
- case 0x1F5D:
- bufpush(0x1F55);
- break;
- case 0x1F5F:
- bufpush(0x1F57);
- break;
- case 0x1F68:
- bufpush(0x1F60);
- break;
- case 0x1F69:
- bufpush(0x1F61);
- break;
- case 0x1F6A:
- bufpush(0x1F62);
- break;
- case 0x1F6B:
- bufpush(0x1F63);
- break;
- case 0x1F6C:
- bufpush(0x1F64);
- break;
- case 0x1F6D:
- bufpush(0x1F65);
- break;
- case 0x1F6E:
- bufpush(0x1F66);
- break;
- case 0x1F6F:
- bufpush(0x1F67);
- break;
- case 0x1F80:
- bufpush(0x1F00);
- bufpush(0x03B9);
- break;
- case 0x1F81:
- bufpush(0x1F01);
- bufpush(0x03B9);
- break;
- case 0x1F82:
- bufpush(0x1F02);
- bufpush(0x03B9);
- break;
- case 0x1F83:
- bufpush(0x1F03);
- bufpush(0x03B9);
- break;
- case 0x1F84:
- bufpush(0x1F04);
- bufpush(0x03B9);
- break;
- case 0x1F85:
- bufpush(0x1F05);
- bufpush(0x03B9);
- break;
- case 0x1F86:
- bufpush(0x1F06);
- bufpush(0x03B9);
- break;
- case 0x1F87:
- bufpush(0x1F07);
- bufpush(0x03B9);
- break;
- case 0x1F88:
- bufpush(0x1F00);
- bufpush(0x03B9);
- break;
- case 0x1F89:
- bufpush(0x1F01);
- bufpush(0x03B9);
- break;
- case 0x1F8A:
- bufpush(0x1F02);
- bufpush(0x03B9);
- break;
- case 0x1F8B:
- bufpush(0x1F03);
- bufpush(0x03B9);
- break;
- case 0x1F8C:
- bufpush(0x1F04);
- bufpush(0x03B9);
- break;
- case 0x1F8D:
- bufpush(0x1F05);
- bufpush(0x03B9);
- break;
- case 0x1F8E:
- bufpush(0x1F06);
- bufpush(0x03B9);
- break;
- case 0x1F8F:
- bufpush(0x1F07);
- bufpush(0x03B9);
- break;
- case 0x1F90:
- bufpush(0x1F20);
- bufpush(0x03B9);
- break;
- case 0x1F91:
- bufpush(0x1F21);
- bufpush(0x03B9);
- break;
- case 0x1F92:
- bufpush(0x1F22);
- bufpush(0x03B9);
- break;
- case 0x1F93:
- bufpush(0x1F23);
- bufpush(0x03B9);
- break;
- case 0x1F94:
- bufpush(0x1F24);
- bufpush(0x03B9);
- break;
- case 0x1F95:
- bufpush(0x1F25);
- bufpush(0x03B9);
- break;
- case 0x1F96:
- bufpush(0x1F26);
- bufpush(0x03B9);
- break;
- case 0x1F97:
- bufpush(0x1F27);
- bufpush(0x03B9);
- break;
- case 0x1F98:
- bufpush(0x1F20);
- bufpush(0x03B9);
- break;
- case 0x1F99:
- bufpush(0x1F21);
- bufpush(0x03B9);
- break;
- case 0x1F9A:
- bufpush(0x1F22);
- bufpush(0x03B9);
- break;
- case 0x1F9B:
- bufpush(0x1F23);
- bufpush(0x03B9);
- break;
- case 0x1F9C:
- bufpush(0x1F24);
- bufpush(0x03B9);
- break;
- case 0x1F9D:
- bufpush(0x1F25);
- bufpush(0x03B9);
- break;
- case 0x1F9E:
- bufpush(0x1F26);
- bufpush(0x03B9);
- break;
- case 0x1F9F:
- bufpush(0x1F27);
- bufpush(0x03B9);
- break;
- case 0x1FA0:
- bufpush(0x1F60);
- bufpush(0x03B9);
- break;
- case 0x1FA1:
- bufpush(0x1F61);
- bufpush(0x03B9);
- break;
- case 0x1FA2:
- bufpush(0x1F62);
- bufpush(0x03B9);
- break;
- case 0x1FA3:
- bufpush(0x1F63);
- bufpush(0x03B9);
- break;
- case 0x1FA4:
- bufpush(0x1F64);
- bufpush(0x03B9);
- break;
- case 0x1FA5:
- bufpush(0x1F65);
- bufpush(0x03B9);
- break;
- case 0x1FA6:
- bufpush(0x1F66);
- bufpush(0x03B9);
- break;
- case 0x1FA7:
- bufpush(0x1F67);
- bufpush(0x03B9);
- break;
- case 0x1FA8:
- bufpush(0x1F60);
- bufpush(0x03B9);
- break;
- case 0x1FA9:
- bufpush(0x1F61);
- bufpush(0x03B9);
- break;
- case 0x1FAA:
- bufpush(0x1F62);
- bufpush(0x03B9);
- break;
- case 0x1FAB:
- bufpush(0x1F63);
- bufpush(0x03B9);
- break;
- case 0x1FAC:
- bufpush(0x1F64);
- bufpush(0x03B9);
- break;
- case 0x1FAD:
- bufpush(0x1F65);
- bufpush(0x03B9);
- break;
- case 0x1FAE:
- bufpush(0x1F66);
- bufpush(0x03B9);
- break;
- case 0x1FAF:
- bufpush(0x1F67);
- bufpush(0x03B9);
- break;
- case 0x1FB2:
- bufpush(0x1F70);
- bufpush(0x03B9);
- break;
- case 0x1FB3:
- bufpush(0x03B1);
- bufpush(0x03B9);
- break;
- case 0x1FB4:
- bufpush(0x03AC);
- bufpush(0x03B9);
- break;
- case 0x1FB6:
- bufpush(0x03B1);
- bufpush(0x0342);
- break;
- case 0x1FB7:
- bufpush(0x03B1);
- bufpush(0x0342);
- bufpush(0x03B9);
- break;
- case 0x1FB8:
- bufpush(0x1FB0);
- break;
- case 0x1FB9:
- bufpush(0x1FB1);
- break;
- case 0x1FBA:
- bufpush(0x1F70);
- break;
- case 0x1FBB:
- bufpush(0x1F71);
- break;
- case 0x1FBC:
- bufpush(0x03B1);
- bufpush(0x03B9);
- break;
- case 0x1FBE:
- bufpush(0x03B9);
- break;
- case 0x1FC2:
- bufpush(0x1F74);
- bufpush(0x03B9);
- break;
- case 0x1FC3:
- bufpush(0x03B7);
- bufpush(0x03B9);
- break;
- case 0x1FC4:
- bufpush(0x03AE);
- bufpush(0x03B9);
- break;
- case 0x1FC6:
- bufpush(0x03B7);
- bufpush(0x0342);
- break;
- case 0x1FC7:
- bufpush(0x03B7);
- bufpush(0x0342);
- bufpush(0x03B9);
- break;
- case 0x1FC8:
- bufpush(0x1F72);
- break;
- case 0x1FC9:
- bufpush(0x1F73);
- break;
- case 0x1FCA:
- bufpush(0x1F74);
- break;
- case 0x1FCB:
- bufpush(0x1F75);
- break;
- case 0x1FCC:
- bufpush(0x03B7);
- bufpush(0x03B9);
- break;
- case 0x1FD2:
- bufpush(0x03B9);
- bufpush(0x0308);
- bufpush(0x0300);
- break;
- case 0x1FD3:
- bufpush(0x03B9);
- bufpush(0x0308);
- bufpush(0x0301);
- break;
- case 0x1FD6:
- bufpush(0x03B9);
- bufpush(0x0342);
- break;
- case 0x1FD7:
- bufpush(0x03B9);
- bufpush(0x0308);
- bufpush(0x0342);
- break;
- case 0x1FD8:
- bufpush(0x1FD0);
- break;
- case 0x1FD9:
- bufpush(0x1FD1);
- break;
- case 0x1FDA:
- bufpush(0x1F76);
- break;
- case 0x1FDB:
- bufpush(0x1F77);
- break;
- case 0x1FE2:
- bufpush(0x03C5);
- bufpush(0x0308);
- bufpush(0x0300);
- break;
- case 0x1FE3:
- bufpush(0x03C5);
- bufpush(0x0308);
- bufpush(0x0301);
- break;
- case 0x1FE4:
- bufpush(0x03C1);
- bufpush(0x0313);
- break;
- case 0x1FE6:
- bufpush(0x03C5);
- bufpush(0x0342);
- break;
- case 0x1FE7:
- bufpush(0x03C5);
- bufpush(0x0308);
- bufpush(0x0342);
- break;
- case 0x1FE8:
- bufpush(0x1FE0);
- break;
- case 0x1FE9:
- bufpush(0x1FE1);
- break;
- case 0x1FEA:
- bufpush(0x1F7A);
- break;
- case 0x1FEB:
- bufpush(0x1F7B);
- break;
- case 0x1FEC:
- bufpush(0x1FE5);
- break;
- case 0x1FF2:
- bufpush(0x1F7C);
- bufpush(0x03B9);
- break;
- case 0x1FF3:
- bufpush(0x03C9);
- bufpush(0x03B9);
- break;
- case 0x1FF4:
- bufpush(0x03CE);
- bufpush(0x03B9);
- break;
- case 0x1FF6:
- bufpush(0x03C9);
- bufpush(0x0342);
- break;
- case 0x1FF7:
- bufpush(0x03C9);
- bufpush(0x0342);
- bufpush(0x03B9);
- break;
- case 0x1FF8:
- bufpush(0x1F78);
- break;
- case 0x1FF9:
- bufpush(0x1F79);
- break;
- case 0x1FFA:
- bufpush(0x1F7C);
- break;
- case 0x1FFB:
- bufpush(0x1F7D);
- break;
- case 0x1FFC:
- bufpush(0x03C9);
- bufpush(0x03B9);
- break;
- case 0x2126:
- bufpush(0x03C9);
- break;
- case 0x212A:
- bufpush(0x006B);
- break;
- case 0x212B:
- bufpush(0x00E5);
- break;
- case 0x2132:
- bufpush(0x214E);
- break;
- case 0x2160:
- bufpush(0x2170);
- break;
- case 0x2161:
- bufpush(0x2171);
- break;
- case 0x2162:
- bufpush(0x2172);
- break;
- case 0x2163:
- bufpush(0x2173);
- break;
- case 0x2164:
- bufpush(0x2174);
- break;
- case 0x2165:
- bufpush(0x2175);
- break;
- case 0x2166:
- bufpush(0x2176);
- break;
- case 0x2167:
- bufpush(0x2177);
- break;
- case 0x2168:
- bufpush(0x2178);
- break;
- case 0x2169:
- bufpush(0x2179);
- break;
- case 0x216A:
- bufpush(0x217A);
- break;
- case 0x216B:
- bufpush(0x217B);
- break;
- case 0x216C:
- bufpush(0x217C);
- break;
- case 0x216D:
- bufpush(0x217D);
- break;
- case 0x216E:
- bufpush(0x217E);
- break;
- case 0x216F:
- bufpush(0x217F);
- break;
- case 0x2183:
- bufpush(0x2184);
- break;
- case 0x24B6:
- bufpush(0x24D0);
- break;
- case 0x24B7:
- bufpush(0x24D1);
- break;
- case 0x24B8:
- bufpush(0x24D2);
- break;
- case 0x24B9:
- bufpush(0x24D3);
- break;
- case 0x24BA:
- bufpush(0x24D4);
- break;
- case 0x24BB:
- bufpush(0x24D5);
- break;
- case 0x24BC:
- bufpush(0x24D6);
- break;
- case 0x24BD:
- bufpush(0x24D7);
- break;
- case 0x24BE:
- bufpush(0x24D8);
- break;
- case 0x24BF:
- bufpush(0x24D9);
- break;
- case 0x24C0:
- bufpush(0x24DA);
- break;
- case 0x24C1:
- bufpush(0x24DB);
- break;
- case 0x24C2:
- bufpush(0x24DC);
- break;
- case 0x24C3:
- bufpush(0x24DD);
- break;
- case 0x24C4:
- bufpush(0x24DE);
- break;
- case 0x24C5:
- bufpush(0x24DF);
- break;
- case 0x24C6:
- bufpush(0x24E0);
- break;
- case 0x24C7:
- bufpush(0x24E1);
- break;
- case 0x24C8:
- bufpush(0x24E2);
- break;
- case 0x24C9:
- bufpush(0x24E3);
- break;
- case 0x24CA:
- bufpush(0x24E4);
- break;
- case 0x24CB:
- bufpush(0x24E5);
- break;
- case 0x24CC:
- bufpush(0x24E6);
- break;
- case 0x24CD:
- bufpush(0x24E7);
- break;
- case 0x24CE:
- bufpush(0x24E8);
- break;
- case 0x24CF:
- bufpush(0x24E9);
- break;
- case 0x2C00:
- bufpush(0x2C30);
- break;
- case 0x2C01:
- bufpush(0x2C31);
- break;
- case 0x2C02:
- bufpush(0x2C32);
- break;
- case 0x2C03:
- bufpush(0x2C33);
- break;
- case 0x2C04:
- bufpush(0x2C34);
- break;
- case 0x2C05:
- bufpush(0x2C35);
- break;
- case 0x2C06:
- bufpush(0x2C36);
- break;
- case 0x2C07:
- bufpush(0x2C37);
- break;
- case 0x2C08:
- bufpush(0x2C38);
- break;
- case 0x2C09:
- bufpush(0x2C39);
- break;
- case 0x2C0A:
- bufpush(0x2C3A);
- break;
- case 0x2C0B:
- bufpush(0x2C3B);
- break;
- case 0x2C0C:
- bufpush(0x2C3C);
- break;
- case 0x2C0D:
- bufpush(0x2C3D);
- break;
- case 0x2C0E:
- bufpush(0x2C3E);
- break;
- case 0x2C0F:
- bufpush(0x2C3F);
- break;
- case 0x2C10:
- bufpush(0x2C40);
- break;
- case 0x2C11:
- bufpush(0x2C41);
- break;
- case 0x2C12:
- bufpush(0x2C42);
- break;
- case 0x2C13:
- bufpush(0x2C43);
- break;
- case 0x2C14:
- bufpush(0x2C44);
- break;
- case 0x2C15:
- bufpush(0x2C45);
- break;
- case 0x2C16:
- bufpush(0x2C46);
- break;
- case 0x2C17:
- bufpush(0x2C47);
- break;
- case 0x2C18:
- bufpush(0x2C48);
- break;
- case 0x2C19:
- bufpush(0x2C49);
- break;
- case 0x2C1A:
- bufpush(0x2C4A);
- break;
- case 0x2C1B:
- bufpush(0x2C4B);
- break;
- case 0x2C1C:
- bufpush(0x2C4C);
- break;
- case 0x2C1D:
- bufpush(0x2C4D);
- break;
- case 0x2C1E:
- bufpush(0x2C4E);
- break;
- case 0x2C1F:
- bufpush(0x2C4F);
- break;
- case 0x2C20:
- bufpush(0x2C50);
- break;
- case 0x2C21:
- bufpush(0x2C51);
- break;
- case 0x2C22:
- bufpush(0x2C52);
- break;
- case 0x2C23:
- bufpush(0x2C53);
- break;
- case 0x2C24:
- bufpush(0x2C54);
- break;
- case 0x2C25:
- bufpush(0x2C55);
- break;
- case 0x2C26:
- bufpush(0x2C56);
- break;
- case 0x2C27:
- bufpush(0x2C57);
- break;
- case 0x2C28:
- bufpush(0x2C58);
- break;
- case 0x2C29:
- bufpush(0x2C59);
- break;
- case 0x2C2A:
- bufpush(0x2C5A);
- break;
- case 0x2C2B:
- bufpush(0x2C5B);
- break;
- case 0x2C2C:
- bufpush(0x2C5C);
- break;
- case 0x2C2D:
- bufpush(0x2C5D);
- break;
- case 0x2C2E:
- bufpush(0x2C5E);
- break;
- case 0x2C60:
- bufpush(0x2C61);
- break;
- case 0x2C62:
- bufpush(0x026B);
- break;
- case 0x2C63:
- bufpush(0x1D7D);
- break;
- case 0x2C64:
- bufpush(0x027D);
- break;
- case 0x2C67:
- bufpush(0x2C68);
- break;
- case 0x2C69:
- bufpush(0x2C6A);
- break;
- case 0x2C6B:
- bufpush(0x2C6C);
- break;
- case 0x2C6D:
- bufpush(0x0251);
- break;
- case 0x2C6E:
- bufpush(0x0271);
- break;
- case 0x2C6F:
- bufpush(0x0250);
- break;
- case 0x2C70:
- bufpush(0x0252);
- break;
- case 0x2C72:
- bufpush(0x2C73);
- break;
- case 0x2C75:
- bufpush(0x2C76);
- break;
- case 0x2C7E:
- bufpush(0x023F);
- break;
- case 0x2C7F:
- bufpush(0x0240);
- break;
- case 0x2C80:
- bufpush(0x2C81);
- break;
- case 0x2C82:
- bufpush(0x2C83);
- break;
- case 0x2C84:
- bufpush(0x2C85);
- break;
- case 0x2C86:
- bufpush(0x2C87);
- break;
- case 0x2C88:
- bufpush(0x2C89);
- break;
- case 0x2C8A:
- bufpush(0x2C8B);
- break;
- case 0x2C8C:
- bufpush(0x2C8D);
- break;
- case 0x2C8E:
- bufpush(0x2C8F);
- break;
- case 0x2C90:
- bufpush(0x2C91);
- break;
- case 0x2C92:
- bufpush(0x2C93);
- break;
- case 0x2C94:
- bufpush(0x2C95);
- break;
- case 0x2C96:
- bufpush(0x2C97);
- break;
- case 0x2C98:
- bufpush(0x2C99);
- break;
- case 0x2C9A:
- bufpush(0x2C9B);
- break;
- case 0x2C9C:
- bufpush(0x2C9D);
- break;
- case 0x2C9E:
- bufpush(0x2C9F);
- break;
- case 0x2CA0:
- bufpush(0x2CA1);
- break;
- case 0x2CA2:
- bufpush(0x2CA3);
- break;
- case 0x2CA4:
- bufpush(0x2CA5);
- break;
- case 0x2CA6:
- bufpush(0x2CA7);
- break;
- case 0x2CA8:
- bufpush(0x2CA9);
- break;
- case 0x2CAA:
- bufpush(0x2CAB);
- break;
- case 0x2CAC:
- bufpush(0x2CAD);
- break;
- case 0x2CAE:
- bufpush(0x2CAF);
- break;
- case 0x2CB0:
- bufpush(0x2CB1);
- break;
- case 0x2CB2:
- bufpush(0x2CB3);
- break;
- case 0x2CB4:
- bufpush(0x2CB5);
- break;
- case 0x2CB6:
- bufpush(0x2CB7);
- break;
- case 0x2CB8:
- bufpush(0x2CB9);
- break;
- case 0x2CBA:
- bufpush(0x2CBB);
- break;
- case 0x2CBC:
- bufpush(0x2CBD);
- break;
- case 0x2CBE:
- bufpush(0x2CBF);
- break;
- case 0x2CC0:
- bufpush(0x2CC1);
- break;
- case 0x2CC2:
- bufpush(0x2CC3);
- break;
- case 0x2CC4:
- bufpush(0x2CC5);
- break;
- case 0x2CC6:
- bufpush(0x2CC7);
- break;
- case 0x2CC8:
- bufpush(0x2CC9);
- break;
- case 0x2CCA:
- bufpush(0x2CCB);
- break;
- case 0x2CCC:
- bufpush(0x2CCD);
- break;
- case 0x2CCE:
- bufpush(0x2CCF);
- break;
- case 0x2CD0:
- bufpush(0x2CD1);
- break;
- case 0x2CD2:
- bufpush(0x2CD3);
- break;
- case 0x2CD4:
- bufpush(0x2CD5);
- break;
- case 0x2CD6:
- bufpush(0x2CD7);
- break;
- case 0x2CD8:
- bufpush(0x2CD9);
- break;
- case 0x2CDA:
- bufpush(0x2CDB);
- break;
- case 0x2CDC:
- bufpush(0x2CDD);
- break;
- case 0x2CDE:
- bufpush(0x2CDF);
- break;
- case 0x2CE0:
- bufpush(0x2CE1);
- break;
- case 0x2CE2:
- bufpush(0x2CE3);
- break;
- case 0x2CEB:
- bufpush(0x2CEC);
- break;
- case 0x2CED:
- bufpush(0x2CEE);
- break;
- case 0x2CF2:
- bufpush(0x2CF3);
- break;
- case 0xA640:
- bufpush(0xA641);
- break;
- case 0xA642:
- bufpush(0xA643);
- break;
- case 0xA644:
- bufpush(0xA645);
- break;
- case 0xA646:
- bufpush(0xA647);
- break;
- case 0xA648:
- bufpush(0xA649);
- break;
- case 0xA64A:
- bufpush(0xA64B);
- break;
- case 0xA64C:
- bufpush(0xA64D);
- break;
- case 0xA64E:
- bufpush(0xA64F);
- break;
- case 0xA650:
- bufpush(0xA651);
- break;
- case 0xA652:
- bufpush(0xA653);
- break;
- case 0xA654:
- bufpush(0xA655);
- break;
- case 0xA656:
- bufpush(0xA657);
- break;
- case 0xA658:
- bufpush(0xA659);
- break;
- case 0xA65A:
- bufpush(0xA65B);
- break;
- case 0xA65C:
- bufpush(0xA65D);
- break;
- case 0xA65E:
- bufpush(0xA65F);
- break;
- case 0xA660:
- bufpush(0xA661);
- break;
- case 0xA662:
- bufpush(0xA663);
- break;
- case 0xA664:
- bufpush(0xA665);
- break;
- case 0xA666:
- bufpush(0xA667);
- break;
- case 0xA668:
- bufpush(0xA669);
- break;
- case 0xA66A:
- bufpush(0xA66B);
- break;
- case 0xA66C:
- bufpush(0xA66D);
- break;
- case 0xA680:
- bufpush(0xA681);
- break;
- case 0xA682:
- bufpush(0xA683);
- break;
- case 0xA684:
- bufpush(0xA685);
- break;
- case 0xA686:
- bufpush(0xA687);
- break;
- case 0xA688:
- bufpush(0xA689);
- break;
- case 0xA68A:
- bufpush(0xA68B);
- break;
- case 0xA68C:
- bufpush(0xA68D);
- break;
- case 0xA68E:
- bufpush(0xA68F);
- break;
- case 0xA690:
- bufpush(0xA691);
- break;
- case 0xA692:
- bufpush(0xA693);
- break;
- case 0xA694:
- bufpush(0xA695);
- break;
- case 0xA696:
- bufpush(0xA697);
- break;
- case 0xA698:
- bufpush(0xA699);
- break;
- case 0xA69A:
- bufpush(0xA69B);
- break;
- case 0xA722:
- bufpush(0xA723);
- break;
- case 0xA724:
- bufpush(0xA725);
- break;
- case 0xA726:
- bufpush(0xA727);
- break;
- case 0xA728:
- bufpush(0xA729);
- break;
- case 0xA72A:
- bufpush(0xA72B);
- break;
- case 0xA72C:
- bufpush(0xA72D);
- break;
- case 0xA72E:
- bufpush(0xA72F);
- break;
- case 0xA732:
- bufpush(0xA733);
- break;
- case 0xA734:
- bufpush(0xA735);
- break;
- case 0xA736:
- bufpush(0xA737);
- break;
- case 0xA738:
- bufpush(0xA739);
- break;
- case 0xA73A:
- bufpush(0xA73B);
- break;
- case 0xA73C:
- bufpush(0xA73D);
- break;
- case 0xA73E:
- bufpush(0xA73F);
- break;
- case 0xA740:
- bufpush(0xA741);
- break;
- case 0xA742:
- bufpush(0xA743);
- break;
- case 0xA744:
- bufpush(0xA745);
- break;
- case 0xA746:
- bufpush(0xA747);
- break;
- case 0xA748:
- bufpush(0xA749);
- break;
- case 0xA74A:
- bufpush(0xA74B);
- break;
- case 0xA74C:
- bufpush(0xA74D);
- break;
- case 0xA74E:
- bufpush(0xA74F);
- break;
- case 0xA750:
- bufpush(0xA751);
- break;
- case 0xA752:
- bufpush(0xA753);
- break;
- case 0xA754:
- bufpush(0xA755);
- break;
- case 0xA756:
- bufpush(0xA757);
- break;
- case 0xA758:
- bufpush(0xA759);
- break;
- case 0xA75A:
- bufpush(0xA75B);
- break;
- case 0xA75C:
- bufpush(0xA75D);
- break;
- case 0xA75E:
- bufpush(0xA75F);
- break;
- case 0xA760:
- bufpush(0xA761);
- break;
- case 0xA762:
- bufpush(0xA763);
- break;
- case 0xA764:
- bufpush(0xA765);
- break;
- case 0xA766:
- bufpush(0xA767);
- break;
- case 0xA768:
- bufpush(0xA769);
- break;
- case 0xA76A:
- bufpush(0xA76B);
- break;
- case 0xA76C:
- bufpush(0xA76D);
- break;
- case 0xA76E:
- bufpush(0xA76F);
- break;
- case 0xA779:
- bufpush(0xA77A);
- break;
- case 0xA77B:
- bufpush(0xA77C);
- break;
- case 0xA77D:
- bufpush(0x1D79);
- break;
- case 0xA77E:
- bufpush(0xA77F);
- break;
- case 0xA780:
- bufpush(0xA781);
- break;
- case 0xA782:
- bufpush(0xA783);
- break;
- case 0xA784:
- bufpush(0xA785);
- break;
- case 0xA786:
- bufpush(0xA787);
- break;
- case 0xA78B:
- bufpush(0xA78C);
- break;
- case 0xA78D:
- bufpush(0x0265);
- break;
- case 0xA790:
- bufpush(0xA791);
- break;
- case 0xA792:
- bufpush(0xA793);
- break;
- case 0xA796:
- bufpush(0xA797);
- break;
- case 0xA798:
- bufpush(0xA799);
- break;
- case 0xA79A:
- bufpush(0xA79B);
- break;
- case 0xA79C:
- bufpush(0xA79D);
- break;
- case 0xA79E:
- bufpush(0xA79F);
- break;
- case 0xA7A0:
- bufpush(0xA7A1);
- break;
- case 0xA7A2:
- bufpush(0xA7A3);
- break;
- case 0xA7A4:
- bufpush(0xA7A5);
- break;
- case 0xA7A6:
- bufpush(0xA7A7);
- break;
- case 0xA7A8:
- bufpush(0xA7A9);
- break;
- case 0xA7AA:
- bufpush(0x0266);
- break;
- case 0xA7AB:
- bufpush(0x025C);
- break;
- case 0xA7AC:
- bufpush(0x0261);
- break;
- case 0xA7AD:
- bufpush(0x026C);
- break;
- case 0xA7AE:
- bufpush(0x026A);
- break;
- case 0xA7B0:
- bufpush(0x029E);
- break;
- case 0xA7B1:
- bufpush(0x0287);
- break;
- case 0xA7B2:
- bufpush(0x029D);
- break;
- case 0xA7B3:
- bufpush(0xAB53);
- break;
- case 0xA7B4:
- bufpush(0xA7B5);
- break;
- case 0xA7B6:
- bufpush(0xA7B7);
- break;
- case 0xAB70:
- bufpush(0x13A0);
- break;
- case 0xAB71:
- bufpush(0x13A1);
- break;
- case 0xAB72:
- bufpush(0x13A2);
- break;
- case 0xAB73:
- bufpush(0x13A3);
- break;
- case 0xAB74:
- bufpush(0x13A4);
- break;
- case 0xAB75:
- bufpush(0x13A5);
- break;
- case 0xAB76:
- bufpush(0x13A6);
- break;
- case 0xAB77:
- bufpush(0x13A7);
- break;
- case 0xAB78:
- bufpush(0x13A8);
- break;
- case 0xAB79:
- bufpush(0x13A9);
- break;
- case 0xAB7A:
- bufpush(0x13AA);
- break;
- case 0xAB7B:
- bufpush(0x13AB);
- break;
- case 0xAB7C:
- bufpush(0x13AC);
- break;
- case 0xAB7D:
- bufpush(0x13AD);
- break;
- case 0xAB7E:
- bufpush(0x13AE);
- break;
- case 0xAB7F:
- bufpush(0x13AF);
- break;
- case 0xAB80:
- bufpush(0x13B0);
- break;
- case 0xAB81:
- bufpush(0x13B1);
- break;
- case 0xAB82:
- bufpush(0x13B2);
- break;
- case 0xAB83:
- bufpush(0x13B3);
- break;
- case 0xAB84:
- bufpush(0x13B4);
- break;
- case 0xAB85:
- bufpush(0x13B5);
- break;
- case 0xAB86:
- bufpush(0x13B6);
- break;
- case 0xAB87:
- bufpush(0x13B7);
- break;
- case 0xAB88:
- bufpush(0x13B8);
- break;
- case 0xAB89:
- bufpush(0x13B9);
- break;
- case 0xAB8A:
- bufpush(0x13BA);
- break;
- case 0xAB8B:
- bufpush(0x13BB);
- break;
- case 0xAB8C:
- bufpush(0x13BC);
- break;
- case 0xAB8D:
- bufpush(0x13BD);
- break;
- case 0xAB8E:
- bufpush(0x13BE);
- break;
- case 0xAB8F:
- bufpush(0x13BF);
- break;
- case 0xAB90:
- bufpush(0x13C0);
- break;
- case 0xAB91:
- bufpush(0x13C1);
- break;
- case 0xAB92:
- bufpush(0x13C2);
- break;
- case 0xAB93:
- bufpush(0x13C3);
- break;
- case 0xAB94:
- bufpush(0x13C4);
- break;
- case 0xAB95:
- bufpush(0x13C5);
- break;
- case 0xAB96:
- bufpush(0x13C6);
- break;
- case 0xAB97:
- bufpush(0x13C7);
- break;
- case 0xAB98:
- bufpush(0x13C8);
- break;
- case 0xAB99:
- bufpush(0x13C9);
- break;
- case 0xAB9A:
- bufpush(0x13CA);
- break;
- case 0xAB9B:
- bufpush(0x13CB);
- break;
- case 0xAB9C:
- bufpush(0x13CC);
- break;
- case 0xAB9D:
- bufpush(0x13CD);
- break;
- case 0xAB9E:
- bufpush(0x13CE);
- break;
- case 0xAB9F:
- bufpush(0x13CF);
- break;
- case 0xABA0:
- bufpush(0x13D0);
- break;
- case 0xABA1:
- bufpush(0x13D1);
- break;
- case 0xABA2:
- bufpush(0x13D2);
- break;
- case 0xABA3:
- bufpush(0x13D3);
- break;
- case 0xABA4:
- bufpush(0x13D4);
- break;
- case 0xABA5:
- bufpush(0x13D5);
- break;
- case 0xABA6:
- bufpush(0x13D6);
- break;
- case 0xABA7:
- bufpush(0x13D7);
- break;
- case 0xABA8:
- bufpush(0x13D8);
- break;
- case 0xABA9:
- bufpush(0x13D9);
- break;
- case 0xABAA:
- bufpush(0x13DA);
- break;
- case 0xABAB:
- bufpush(0x13DB);
- break;
- case 0xABAC:
- bufpush(0x13DC);
- break;
- case 0xABAD:
- bufpush(0x13DD);
- break;
- case 0xABAE:
- bufpush(0x13DE);
- break;
- case 0xABAF:
- bufpush(0x13DF);
- break;
- case 0xABB0:
- bufpush(0x13E0);
- break;
- case 0xABB1:
- bufpush(0x13E1);
- break;
- case 0xABB2:
- bufpush(0x13E2);
- break;
- case 0xABB3:
- bufpush(0x13E3);
- break;
- case 0xABB4:
- bufpush(0x13E4);
- break;
- case 0xABB5:
- bufpush(0x13E5);
- break;
- case 0xABB6:
- bufpush(0x13E6);
- break;
- case 0xABB7:
- bufpush(0x13E7);
- break;
- case 0xABB8:
- bufpush(0x13E8);
- break;
- case 0xABB9:
- bufpush(0x13E9);
- break;
- case 0xABBA:
- bufpush(0x13EA);
- break;
- case 0xABBB:
- bufpush(0x13EB);
- break;
- case 0xABBC:
- bufpush(0x13EC);
- break;
- case 0xABBD:
- bufpush(0x13ED);
- break;
- case 0xABBE:
- bufpush(0x13EE);
- break;
- case 0xABBF:
- bufpush(0x13EF);
- break;
- case 0xFB00:
- bufpush(0x0066);
- bufpush(0x0066);
- break;
- case 0xFB01:
- bufpush(0x0066);
- bufpush(0x0069);
- break;
- case 0xFB02:
- bufpush(0x0066);
- bufpush(0x006C);
- break;
- case 0xFB03:
- bufpush(0x0066);
- bufpush(0x0066);
- bufpush(0x0069);
- break;
- case 0xFB04:
- bufpush(0x0066);
- bufpush(0x0066);
- bufpush(0x006C);
- break;
- case 0xFB05:
- bufpush(0x0073);
- bufpush(0x0074);
- break;
- case 0xFB06:
- bufpush(0x0073);
- bufpush(0x0074);
- break;
- case 0xFB13:
- bufpush(0x0574);
- bufpush(0x0576);
- break;
- case 0xFB14:
- bufpush(0x0574);
- bufpush(0x0565);
- break;
- case 0xFB15:
- bufpush(0x0574);
- bufpush(0x056B);
- break;
- case 0xFB16:
- bufpush(0x057E);
- bufpush(0x0576);
- break;
- case 0xFB17:
- bufpush(0x0574);
- bufpush(0x056D);
- break;
- case 0xFF21:
- bufpush(0xFF41);
- break;
- case 0xFF22:
- bufpush(0xFF42);
- break;
- case 0xFF23:
- bufpush(0xFF43);
- break;
- case 0xFF24:
- bufpush(0xFF44);
- break;
- case 0xFF25:
- bufpush(0xFF45);
- break;
- case 0xFF26:
- bufpush(0xFF46);
- break;
- case 0xFF27:
- bufpush(0xFF47);
- break;
- case 0xFF28:
- bufpush(0xFF48);
- break;
- case 0xFF29:
- bufpush(0xFF49);
- break;
- case 0xFF2A:
- bufpush(0xFF4A);
- break;
- case 0xFF2B:
- bufpush(0xFF4B);
- break;
- case 0xFF2C:
- bufpush(0xFF4C);
- break;
- case 0xFF2D:
- bufpush(0xFF4D);
- break;
- case 0xFF2E:
- bufpush(0xFF4E);
- break;
- case 0xFF2F:
- bufpush(0xFF4F);
- break;
- case 0xFF30:
- bufpush(0xFF50);
- break;
- case 0xFF31:
- bufpush(0xFF51);
- break;
- case 0xFF32:
- bufpush(0xFF52);
- break;
- case 0xFF33:
- bufpush(0xFF53);
- break;
- case 0xFF34:
- bufpush(0xFF54);
- break;
- case 0xFF35:
- bufpush(0xFF55);
- break;
- case 0xFF36:
- bufpush(0xFF56);
- break;
- case 0xFF37:
- bufpush(0xFF57);
- break;
- case 0xFF38:
- bufpush(0xFF58);
- break;
- case 0xFF39:
- bufpush(0xFF59);
- break;
- case 0xFF3A:
- bufpush(0xFF5A);
- break;
- case 0x10400:
- bufpush(0x10428);
- break;
- case 0x10401:
- bufpush(0x10429);
- break;
- case 0x10402:
- bufpush(0x1042A);
- break;
- case 0x10403:
- bufpush(0x1042B);
- break;
- case 0x10404:
- bufpush(0x1042C);
- break;
- case 0x10405:
- bufpush(0x1042D);
- break;
- case 0x10406:
- bufpush(0x1042E);
- break;
- case 0x10407:
- bufpush(0x1042F);
- break;
- case 0x10408:
- bufpush(0x10430);
- break;
- case 0x10409:
- bufpush(0x10431);
- break;
- case 0x1040A:
- bufpush(0x10432);
- break;
- case 0x1040B:
- bufpush(0x10433);
- break;
- case 0x1040C:
- bufpush(0x10434);
- break;
- case 0x1040D:
- bufpush(0x10435);
- break;
- case 0x1040E:
- bufpush(0x10436);
- break;
- case 0x1040F:
- bufpush(0x10437);
- break;
- case 0x10410:
- bufpush(0x10438);
- break;
- case 0x10411:
- bufpush(0x10439);
- break;
- case 0x10412:
- bufpush(0x1043A);
- break;
- case 0x10413:
- bufpush(0x1043B);
- break;
- case 0x10414:
- bufpush(0x1043C);
- break;
- case 0x10415:
- bufpush(0x1043D);
- break;
- case 0x10416:
- bufpush(0x1043E);
- break;
- case 0x10417:
- bufpush(0x1043F);
- break;
- case 0x10418:
- bufpush(0x10440);
- break;
- case 0x10419:
- bufpush(0x10441);
- break;
- case 0x1041A:
- bufpush(0x10442);
- break;
- case 0x1041B:
- bufpush(0x10443);
- break;
- case 0x1041C:
- bufpush(0x10444);
- break;
- case 0x1041D:
- bufpush(0x10445);
- break;
- case 0x1041E:
- bufpush(0x10446);
- break;
- case 0x1041F:
- bufpush(0x10447);
- break;
- case 0x10420:
- bufpush(0x10448);
- break;
- case 0x10421:
- bufpush(0x10449);
- break;
- case 0x10422:
- bufpush(0x1044A);
- break;
- case 0x10423:
- bufpush(0x1044B);
- break;
- case 0x10424:
- bufpush(0x1044C);
- break;
- case 0x10425:
- bufpush(0x1044D);
- break;
- case 0x10426:
- bufpush(0x1044E);
- break;
- case 0x10427:
- bufpush(0x1044F);
- break;
- case 0x104B0:
- bufpush(0x104D8);
- break;
- case 0x104B1:
- bufpush(0x104D9);
- break;
- case 0x104B2:
- bufpush(0x104DA);
- break;
- case 0x104B3:
- bufpush(0x104DB);
- break;
- case 0x104B4:
- bufpush(0x104DC);
- break;
- case 0x104B5:
- bufpush(0x104DD);
- break;
- case 0x104B6:
- bufpush(0x104DE);
- break;
- case 0x104B7:
- bufpush(0x104DF);
- break;
- case 0x104B8:
- bufpush(0x104E0);
- break;
- case 0x104B9:
- bufpush(0x104E1);
- break;
- case 0x104BA:
- bufpush(0x104E2);
- break;
- case 0x104BB:
- bufpush(0x104E3);
- break;
- case 0x104BC:
- bufpush(0x104E4);
- break;
- case 0x104BD:
- bufpush(0x104E5);
- break;
- case 0x104BE:
- bufpush(0x104E6);
- break;
- case 0x104BF:
- bufpush(0x104E7);
- break;
- case 0x104C0:
- bufpush(0x104E8);
- break;
- case 0x104C1:
- bufpush(0x104E9);
- break;
- case 0x104C2:
- bufpush(0x104EA);
- break;
- case 0x104C3:
- bufpush(0x104EB);
- break;
- case 0x104C4:
- bufpush(0x104EC);
- break;
- case 0x104C5:
- bufpush(0x104ED);
- break;
- case 0x104C6:
- bufpush(0x104EE);
- break;
- case 0x104C7:
- bufpush(0x104EF);
- break;
- case 0x104C8:
- bufpush(0x104F0);
- break;
- case 0x104C9:
- bufpush(0x104F1);
- break;
- case 0x104CA:
- bufpush(0x104F2);
- break;
- case 0x104CB:
- bufpush(0x104F3);
- break;
- case 0x104CC:
- bufpush(0x104F4);
- break;
- case 0x104CD:
- bufpush(0x104F5);
- break;
- case 0x104CE:
- bufpush(0x104F6);
- break;
- case 0x104CF:
- bufpush(0x104F7);
- break;
- case 0x104D0:
- bufpush(0x104F8);
- break;
- case 0x104D1:
- bufpush(0x104F9);
- break;
- case 0x104D2:
- bufpush(0x104FA);
- break;
- case 0x104D3:
- bufpush(0x104FB);
- break;
- case 0x10C80:
- bufpush(0x10CC0);
- break;
- case 0x10C81:
- bufpush(0x10CC1);
- break;
- case 0x10C82:
- bufpush(0x10CC2);
- break;
- case 0x10C83:
- bufpush(0x10CC3);
- break;
- case 0x10C84:
- bufpush(0x10CC4);
- break;
- case 0x10C85:
- bufpush(0x10CC5);
- break;
- case 0x10C86:
- bufpush(0x10CC6);
- break;
- case 0x10C87:
- bufpush(0x10CC7);
- break;
- case 0x10C88:
- bufpush(0x10CC8);
- break;
- case 0x10C89:
- bufpush(0x10CC9);
- break;
- case 0x10C8A:
- bufpush(0x10CCA);
- break;
- case 0x10C8B:
- bufpush(0x10CCB);
- break;
- case 0x10C8C:
- bufpush(0x10CCC);
- break;
- case 0x10C8D:
- bufpush(0x10CCD);
- break;
- case 0x10C8E:
- bufpush(0x10CCE);
- break;
- case 0x10C8F:
- bufpush(0x10CCF);
- break;
- case 0x10C90:
- bufpush(0x10CD0);
- break;
- case 0x10C91:
- bufpush(0x10CD1);
- break;
- case 0x10C92:
- bufpush(0x10CD2);
- break;
- case 0x10C93:
- bufpush(0x10CD3);
- break;
- case 0x10C94:
- bufpush(0x10CD4);
- break;
- case 0x10C95:
- bufpush(0x10CD5);
- break;
- case 0x10C96:
- bufpush(0x10CD6);
- break;
- case 0x10C97:
- bufpush(0x10CD7);
- break;
- case 0x10C98:
- bufpush(0x10CD8);
- break;
- case 0x10C99:
- bufpush(0x10CD9);
- break;
- case 0x10C9A:
- bufpush(0x10CDA);
- break;
- case 0x10C9B:
- bufpush(0x10CDB);
- break;
- case 0x10C9C:
- bufpush(0x10CDC);
- break;
- case 0x10C9D:
- bufpush(0x10CDD);
- break;
- case 0x10C9E:
- bufpush(0x10CDE);
- break;
- case 0x10C9F:
- bufpush(0x10CDF);
- break;
- case 0x10CA0:
- bufpush(0x10CE0);
- break;
- case 0x10CA1:
- bufpush(0x10CE1);
- break;
- case 0x10CA2:
- bufpush(0x10CE2);
- break;
- case 0x10CA3:
- bufpush(0x10CE3);
- break;
- case 0x10CA4:
- bufpush(0x10CE4);
- break;
- case 0x10CA5:
- bufpush(0x10CE5);
- break;
- case 0x10CA6:
- bufpush(0x10CE6);
- break;
- case 0x10CA7:
- bufpush(0x10CE7);
- break;
- case 0x10CA8:
- bufpush(0x10CE8);
- break;
- case 0x10CA9:
- bufpush(0x10CE9);
- break;
- case 0x10CAA:
- bufpush(0x10CEA);
- break;
- case 0x10CAB:
- bufpush(0x10CEB);
- break;
- case 0x10CAC:
- bufpush(0x10CEC);
- break;
- case 0x10CAD:
- bufpush(0x10CED);
- break;
- case 0x10CAE:
- bufpush(0x10CEE);
- break;
- case 0x10CAF:
- bufpush(0x10CEF);
- break;
- case 0x10CB0:
- bufpush(0x10CF0);
- break;
- case 0x10CB1:
- bufpush(0x10CF1);
- break;
- case 0x10CB2:
- bufpush(0x10CF2);
- break;
- case 0x118A0:
- bufpush(0x118C0);
- break;
- case 0x118A1:
- bufpush(0x118C1);
- break;
- case 0x118A2:
- bufpush(0x118C2);
- break;
- case 0x118A3:
- bufpush(0x118C3);
- break;
- case 0x118A4:
- bufpush(0x118C4);
- break;
- case 0x118A5:
- bufpush(0x118C5);
- break;
- case 0x118A6:
- bufpush(0x118C6);
- break;
- case 0x118A7:
- bufpush(0x118C7);
- break;
- case 0x118A8:
- bufpush(0x118C8);
- break;
- case 0x118A9:
- bufpush(0x118C9);
- break;
- case 0x118AA:
- bufpush(0x118CA);
- break;
- case 0x118AB:
- bufpush(0x118CB);
- break;
- case 0x118AC:
- bufpush(0x118CC);
- break;
- case 0x118AD:
- bufpush(0x118CD);
- break;
- case 0x118AE:
- bufpush(0x118CE);
- break;
- case 0x118AF:
- bufpush(0x118CF);
- break;
- case 0x118B0:
- bufpush(0x118D0);
- break;
- case 0x118B1:
- bufpush(0x118D1);
- break;
- case 0x118B2:
- bufpush(0x118D2);
- break;
- case 0x118B3:
- bufpush(0x118D3);
- break;
- case 0x118B4:
- bufpush(0x118D4);
- break;
- case 0x118B5:
- bufpush(0x118D5);
- break;
- case 0x118B6:
- bufpush(0x118D6);
- break;
- case 0x118B7:
- bufpush(0x118D7);
- break;
- case 0x118B8:
- bufpush(0x118D8);
- break;
- case 0x118B9:
- bufpush(0x118D9);
- break;
- case 0x118BA:
- bufpush(0x118DA);
- break;
- case 0x118BB:
- bufpush(0x118DB);
- break;
- case 0x118BC:
- bufpush(0x118DC);
- break;
- case 0x118BD:
- bufpush(0x118DD);
- break;
- case 0x118BE:
- bufpush(0x118DE);
- break;
- case 0x118BF:
- bufpush(0x118DF);
- break;
- case 0x1E900:
- bufpush(0x1E922);
- break;
- case 0x1E901:
- bufpush(0x1E923);
- break;
- case 0x1E902:
- bufpush(0x1E924);
- break;
- case 0x1E903:
- bufpush(0x1E925);
- break;
- case 0x1E904:
- bufpush(0x1E926);
- break;
- case 0x1E905:
- bufpush(0x1E927);
- break;
- case 0x1E906:
- bufpush(0x1E928);
- break;
- case 0x1E907:
- bufpush(0x1E929);
- break;
- case 0x1E908:
- bufpush(0x1E92A);
- break;
- case 0x1E909:
- bufpush(0x1E92B);
- break;
- case 0x1E90A:
- bufpush(0x1E92C);
- break;
- case 0x1E90B:
- bufpush(0x1E92D);
- break;
- case 0x1E90C:
- bufpush(0x1E92E);
- break;
- case 0x1E90D:
- bufpush(0x1E92F);
- break;
- case 0x1E90E:
- bufpush(0x1E930);
- break;
- case 0x1E90F:
- bufpush(0x1E931);
- break;
- case 0x1E910:
- bufpush(0x1E932);
- break;
- case 0x1E911:
- bufpush(0x1E933);
- break;
- case 0x1E912:
- bufpush(0x1E934);
- break;
- case 0x1E913:
- bufpush(0x1E935);
- break;
- case 0x1E914:
- bufpush(0x1E936);
- break;
- case 0x1E915:
- bufpush(0x1E937);
- break;
- case 0x1E916:
- bufpush(0x1E938);
- break;
- case 0x1E917:
- bufpush(0x1E939);
- break;
- case 0x1E918:
- bufpush(0x1E93A);
- break;
- case 0x1E919:
- bufpush(0x1E93B);
- break;
- case 0x1E91A:
- bufpush(0x1E93C);
- break;
- case 0x1E91B:
- bufpush(0x1E93D);
- break;
- case 0x1E91C:
- bufpush(0x1E93E);
- break;
- case 0x1E91D:
- bufpush(0x1E93F);
- break;
- case 0x1E91E:
- bufpush(0x1E940);
- break;
- case 0x1E91F:
- bufpush(0x1E941);
- break;
- case 0x1E920:
- bufpush(0x1E942);
- break;
- case 0x1E921:
- bufpush(0x1E943);
- break;
- default:
- bufpush(c);
- }
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/chunk.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/chunk.h
deleted file mode 100644
index c411c04..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/chunk.h
+++ /dev/null
@@ -1,135 +0,0 @@
-#ifndef CMARK_CHUNK_H
-#define CMARK_CHUNK_H
-
-#include
-#include
-#include
-#include "cmark-gfm.h"
-#include "buffer.h"
-#include "cmark_ctype.h"
-
-#define CMARK_CHUNK_EMPTY \
- { NULL, 0, 0 }
-
-typedef struct cmark_chunk {
- unsigned char *data;
- bufsize_t len;
- bufsize_t alloc; // also implies a NULL-terminated string
-} cmark_chunk;
-
-static CMARK_INLINE void cmark_chunk_free(cmark_mem *mem, cmark_chunk *c) {
- if (c->alloc)
- mem->free(c->data);
-
- c->data = NULL;
- c->alloc = 0;
- c->len = 0;
-}
-
-static CMARK_INLINE void cmark_chunk_ltrim(cmark_chunk *c) {
- assert(!c->alloc);
-
- while (c->len && cmark_isspace(c->data[0])) {
- c->data++;
- c->len--;
- }
-}
-
-static CMARK_INLINE void cmark_chunk_rtrim(cmark_chunk *c) {
- assert(!c->alloc);
-
- while (c->len > 0) {
- if (!cmark_isspace(c->data[c->len - 1]))
- break;
-
- c->len--;
- }
-}
-
-static CMARK_INLINE void cmark_chunk_trim(cmark_chunk *c) {
- cmark_chunk_ltrim(c);
- cmark_chunk_rtrim(c);
-}
-
-static CMARK_INLINE bufsize_t cmark_chunk_strchr(cmark_chunk *ch, int c,
- bufsize_t offset) {
- const unsigned char *p =
- (unsigned char *)memchr(ch->data + offset, c, ch->len - offset);
- return p ? (bufsize_t)(p - ch->data) : ch->len;
-}
-
-static CMARK_INLINE const char *cmark_chunk_to_cstr(cmark_mem *mem,
- cmark_chunk *c) {
- unsigned char *str;
-
- if (c->alloc) {
- return (char *)c->data;
- }
- str = (unsigned char *)mem->calloc(c->len + 1, 1);
- if (c->len > 0) {
- memcpy(str, c->data, c->len);
- }
- str[c->len] = 0;
- c->data = str;
- c->alloc = 1;
-
- return (char *)str;
-}
-
-static CMARK_INLINE void cmark_chunk_set_cstr(cmark_mem *mem, cmark_chunk *c,
- const char *str) {
- unsigned char *old = c->alloc ? c->data : NULL;
- if (str == NULL) {
- c->len = 0;
- c->data = NULL;
- c->alloc = 0;
- } else {
- c->len = (bufsize_t)strlen(str);
- c->data = (unsigned char *)mem->calloc(c->len + 1, 1);
- c->alloc = 1;
- memcpy(c->data, str, c->len + 1);
- }
- if (old != NULL) {
- mem->free(old);
- }
-}
-
-static CMARK_INLINE cmark_chunk cmark_chunk_literal(const char *data) {
- bufsize_t len = data ? (bufsize_t)strlen(data) : 0;
- cmark_chunk c = {(unsigned char *)data, len, 0};
- return c;
-}
-
-static CMARK_INLINE cmark_chunk cmark_chunk_dup(const cmark_chunk *ch,
- bufsize_t pos, bufsize_t len) {
- cmark_chunk c = {ch->data + pos, len, 0};
- return c;
-}
-
-static CMARK_INLINE cmark_chunk cmark_chunk_buf_detach(cmark_strbuf *buf) {
- cmark_chunk c;
-
- c.len = buf->size;
- c.data = cmark_strbuf_detach(buf);
- c.alloc = 1;
-
- return c;
-}
-
-/* trim_new variants are to be used when the source chunk may or may not be
- * allocated; forces a newly allocated chunk. */
-static CMARK_INLINE cmark_chunk cmark_chunk_ltrim_new(cmark_mem *mem, cmark_chunk *c) {
- cmark_chunk r = cmark_chunk_dup(c, 0, c->len);
- cmark_chunk_ltrim(&r);
- cmark_chunk_to_cstr(mem, &r);
- return r;
-}
-
-static CMARK_INLINE cmark_chunk cmark_chunk_rtrim_new(cmark_mem *mem, cmark_chunk *c) {
- cmark_chunk r = cmark_chunk_dup(c, 0, c->len);
- cmark_chunk_rtrim(&r);
- cmark_chunk_to_cstr(mem, &r);
- return r;
-}
-
-#endif
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-core-extensions.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-core-extensions.h
deleted file mode 100644
index bc29ffd..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-core-extensions.h
+++ /dev/null
@@ -1,54 +0,0 @@
-#ifndef CMARK_GFM_CORE_EXTENSIONS_H
-#define CMARK_GFM_CORE_EXTENSIONS_H
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include "cmark-gfm-extension_api.h"
-#include "cmark-gfm_export.h"
-#include
-#include
-
-CMARK_GFM_EXPORT
-void cmark_gfm_core_extensions_ensure_registered(void);
-
-CMARK_GFM_EXPORT
-uint16_t cmark_gfm_extensions_get_table_columns(cmark_node *node);
-
-/** Sets the number of columns for the table, returning 1 on success and 0 on error.
- */
-CMARK_GFM_EXPORT
-int cmark_gfm_extensions_set_table_columns(cmark_node *node, uint16_t n_columns);
-
-CMARK_GFM_EXPORT
-uint8_t *cmark_gfm_extensions_get_table_alignments(cmark_node *node);
-
-/** Sets the alignments for the table, returning 1 on success and 0 on error.
- */
-CMARK_GFM_EXPORT
-int cmark_gfm_extensions_set_table_alignments(cmark_node *node, uint16_t ncols, uint8_t *alignments);
-
-CMARK_GFM_EXPORT
-int cmark_gfm_extensions_get_table_row_is_header(cmark_node *node);
-
-/** Sets whether the node is a table header row, returning 1 on success and 0 on error.
- */
-CMARK_GFM_EXPORT
-int cmark_gfm_extensions_set_table_row_is_header(cmark_node *node, int is_header);
-
-CMARK_GFM_EXPORT
-bool cmark_gfm_extensions_get_tasklist_item_checked(cmark_node *node);
-/* For backwards compatibility */
-#define cmark_gfm_extensions_tasklist_is_checked cmark_gfm_extensions_get_tasklist_item_checked
-
-/** Sets whether a tasklist item is "checked" (completed), returning 1 on success and 0 on error.
- */
-CMARK_GFM_EXPORT
-int cmark_gfm_extensions_set_tasklist_item_checked(cmark_node *node, bool is_checked);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-extension_api.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-extension_api.h
deleted file mode 100644
index bb92a59..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-extension_api.h
+++ /dev/null
@@ -1,737 +0,0 @@
-#ifndef CMARK_GFM_EXTENSION_API_H
-#define CMARK_GFM_EXTENSION_API_H
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#include "cmark-gfm.h"
-
-struct cmark_renderer;
-struct cmark_html_renderer;
-struct cmark_chunk;
-
-/**
- * ## Extension Support
- *
- * While the "core" of libcmark is strictly compliant with the
- * specification, an API is provided for extension writers to
- * hook into the parsing process.
- *
- * It should be noted that the cmark_node API already offers
- * room for customization, with methods offered to traverse and
- * modify the AST, and even define custom blocks.
- * When the desired customization is achievable in an error-proof
- * way using that API, it should be the preferred method.
- *
- * The following API requires a more in-depth understanding
- * of libcmark's parsing strategy, which is exposed
- * [here](http://spec.commonmark.org/0.24/#appendix-a-parsing-strategy).
- *
- * It should be used when "a posteriori" modification of the AST
- * proves to be too difficult / impossible to implement correctly.
- *
- * It can also serve as an intermediary step before extending
- * the specification, as an extension implemented using this API
- * will be trivially integrated in the core if it proves to be
- * desirable.
- */
-
-typedef struct cmark_plugin cmark_plugin;
-
-/** A syntax extension that can be attached to a cmark_parser
- * with cmark_parser_attach_syntax_extension().
- *
- * Extension writers should assign functions matching
- * the signature of the following 'virtual methods' to
- * implement new functionality.
- *
- * Their calling order and expected behaviour match the procedure outlined
- * at :
- *
- * During step 1, cmark will call the function provided through
- * 'cmark_syntax_extension_set_match_block_func' when it
- * iterates over an open block created by this extension,
- * to determine whether it could contain the new line.
- * If no function was provided, cmark will close the block.
- *
- * During step 2, if and only if the new line doesn't match any
- * of the standard syntax rules, cmark will call the function
- * provided through 'cmark_syntax_extension_set_open_block_func'
- * to let the extension determine whether that new line matches
- * one of its syntax rules.
- * It is the responsibility of the parser to create and add the
- * new block with cmark_parser_make_block and cmark_parser_add_child.
- * If no function was provided is NULL, the extension will have
- * no effect at all on the final block structure of the AST.
- *
- * #### Inline parsing phase hooks
- *
- * For each character provided by the extension through
- * 'cmark_syntax_extension_set_special_inline_chars',
- * the function provided by the extension through
- * 'cmark_syntax_extension_set_match_inline_func'
- * will get called, it is the responsibility of the extension
- * to scan the characters located at the current inline parsing offset
- * with the cmark_inline_parser API.
- *
- * Depending on the type of the extension, it can either:
- *
- * * Scan forward, determine that the syntax matches and return
- * a newly-created inline node with the appropriate type.
- * This is the technique that would be used if inline code
- * (with backticks) was implemented as an extension.
- * * Scan only the character(s) that its syntax rules require
- * for opening and closing nodes, push a delimiter on the
- * delimiter stack, and return a simple text node with its
- * contents set to the character(s) consumed.
- * This is the technique that would be used if emphasis
- * inlines were implemented as an extension.
- *
- * When an extension has pushed delimiters on the stack,
- * the function provided through
- * 'cmark_syntax_extension_set_inline_from_delim_func'
- * will get called in a latter phase,
- * when the inline parser has matched opener and closer delimiters
- * created by the extension together.
- *
- * It is then the responsibility of the extension to modify
- * and populate the opener inline text node, and to remove
- * the necessary delimiters from the delimiter stack.
- *
- * Finally, the extension should return NULL if its scan didn't
- * match its syntax rules.
- *
- * The extension can store whatever private data it might need
- * with 'cmark_syntax_extension_set_private',
- * and optionally define a free function for this data.
- */
-typedef struct subject cmark_inline_parser;
-
-/** Exposed raw for now */
-
-typedef struct delimiter {
- struct delimiter *previous;
- struct delimiter *next;
- cmark_node *inl_text;
- bufsize_t position;
- bufsize_t length;
- unsigned char delim_char;
- int can_open;
- int can_close;
-} delimiter;
-
-/**
- * ### Plugin API.
- *
- * Extensions should be distributed as dynamic libraries,
- * with a single exported function named after the distributed
- * filename.
- *
- * When discovering extensions (see cmark_init), cmark will
- * try to load a symbol named "init_{{filename}}" in all the
- * dynamic libraries it encounters.
- *
- * For example, given a dynamic library named myextension.so
- * (or myextension.dll), cmark will try to load the symbol
- * named "init_myextension". This means that the filename
- * must lend itself to forming a valid C identifier, with
- * the notable exception of dashes, which will be translated
- * to underscores, which means cmark will look for a function
- * named "init_my_extension" if it encounters a dynamic library
- * named "my-extension.so".
- *
- * See the 'cmark_plugin_init_func' typedef for the exact prototype
- * this function should follow.
- *
- * For now the extensibility of cmark is not complete, as
- * it only offers API to hook into the block parsing phase
- * ().
- *
- * See 'cmark_plugin_register_syntax_extension' for more information.
- */
-
-/** The prototype plugins' init function should follow.
- */
-typedef int (*cmark_plugin_init_func)(cmark_plugin *plugin);
-
-/** Register a syntax 'extension' with the 'plugin', it will be made
- * available as an extension and, if attached to a cmark_parser
- * with 'cmark_parser_attach_syntax_extension', it will contribute
- * to the block parsing process.
- *
- * See the documentation for 'cmark_syntax_extension' for information
- * on how to implement one.
- *
- * This function will typically be called from the init function
- * of external modules.
- *
- * This takes ownership of 'extension', one should not call
- * 'cmark_syntax_extension_free' on a registered extension.
- */
-CMARK_GFM_EXPORT
-int cmark_plugin_register_syntax_extension(cmark_plugin *plugin,
- cmark_syntax_extension *extension);
-
-/** This will search for the syntax extension named 'name' among the
- * registered syntax extensions.
- *
- * It can then be attached to a cmark_parser
- * with the cmark_parser_attach_syntax_extension method.
- */
-CMARK_GFM_EXPORT
-cmark_syntax_extension *cmark_find_syntax_extension(const char *name);
-
-/** Should create and add a new open block to 'parent_container' if
- * 'input' matches a syntax rule for that block type. It is allowed
- * to modify the type of 'parent_container'.
- *
- * Should return the newly created block if there is one, or
- * 'parent_container' if its type was modified, or NULL.
- */
-typedef cmark_node * (*cmark_open_block_func) (cmark_syntax_extension *extension,
- int indented,
- cmark_parser *parser,
- cmark_node *parent_container,
- unsigned char *input,
- int len);
-
-typedef cmark_node *(*cmark_match_inline_func)(cmark_syntax_extension *extension,
- cmark_parser *parser,
- cmark_node *parent,
- unsigned char character,
- cmark_inline_parser *inline_parser);
-
-typedef delimiter *(*cmark_inline_from_delim_func)(cmark_syntax_extension *extension,
- cmark_parser *parser,
- cmark_inline_parser *inline_parser,
- delimiter *opener,
- delimiter *closer);
-
-/** Should return 'true' if 'input' can be contained in 'container',
- * 'false' otherwise.
- */
-typedef int (*cmark_match_block_func) (cmark_syntax_extension *extension,
- cmark_parser *parser,
- unsigned char *input,
- int len,
- cmark_node *container);
-
-typedef const char *(*cmark_get_type_string_func) (cmark_syntax_extension *extension,
- cmark_node *node);
-
-typedef int (*cmark_can_contain_func) (cmark_syntax_extension *extension,
- cmark_node *node,
- cmark_node_type child);
-
-typedef int (*cmark_contains_inlines_func) (cmark_syntax_extension *extension,
- cmark_node *node);
-
-typedef void (*cmark_common_render_func) (cmark_syntax_extension *extension,
- struct cmark_renderer *renderer,
- cmark_node *node,
- cmark_event_type ev_type,
- int options);
-
-typedef int (*cmark_commonmark_escape_func) (cmark_syntax_extension *extension,
- cmark_node *node,
- int c);
-
-typedef const char* (*cmark_xml_attr_func) (cmark_syntax_extension *extension,
- cmark_node *node);
-
-typedef void (*cmark_html_render_func) (cmark_syntax_extension *extension,
- struct cmark_html_renderer *renderer,
- cmark_node *node,
- cmark_event_type ev_type,
- int options);
-
-typedef int (*cmark_html_filter_func) (cmark_syntax_extension *extension,
- const unsigned char *tag,
- size_t tag_len);
-
-typedef cmark_node *(*cmark_postprocess_func) (cmark_syntax_extension *extension,
- cmark_parser *parser,
- cmark_node *root);
-
-typedef int (*cmark_ispunct_func) (char c);
-
-typedef void (*cmark_opaque_alloc_func) (cmark_syntax_extension *extension,
- cmark_mem *mem,
- cmark_node *node);
-
-typedef void (*cmark_opaque_free_func) (cmark_syntax_extension *extension,
- cmark_mem *mem,
- cmark_node *node);
-
-/** Free a cmark_syntax_extension.
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_free (cmark_mem *mem, cmark_syntax_extension *extension);
-
-/** Return a newly-constructed cmark_syntax_extension, named 'name'.
- */
-CMARK_GFM_EXPORT
-cmark_syntax_extension *cmark_syntax_extension_new (const char *name);
-
-CMARK_GFM_EXPORT
-cmark_node_type cmark_syntax_extension_add_node(int is_inline);
-
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_emphasis(cmark_syntax_extension *extension, int emphasis);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_open_block_func(cmark_syntax_extension *extension,
- cmark_open_block_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_match_block_func(cmark_syntax_extension *extension,
- cmark_match_block_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_match_inline_func(cmark_syntax_extension *extension,
- cmark_match_inline_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_inline_from_delim_func(cmark_syntax_extension *extension,
- cmark_inline_from_delim_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_special_inline_chars(cmark_syntax_extension *extension,
- cmark_llist *special_chars);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_get_type_string_func(cmark_syntax_extension *extension,
- cmark_get_type_string_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_can_contain_func(cmark_syntax_extension *extension,
- cmark_can_contain_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_contains_inlines_func(cmark_syntax_extension *extension,
- cmark_contains_inlines_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_commonmark_render_func(cmark_syntax_extension *extension,
- cmark_common_render_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_plaintext_render_func(cmark_syntax_extension *extension,
- cmark_common_render_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_latex_render_func(cmark_syntax_extension *extension,
- cmark_common_render_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_xml_attr_func(cmark_syntax_extension *extension,
- cmark_xml_attr_func func);
-
- /** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_man_render_func(cmark_syntax_extension *extension,
- cmark_common_render_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_html_render_func(cmark_syntax_extension *extension,
- cmark_html_render_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_html_filter_func(cmark_syntax_extension *extension,
- cmark_html_filter_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_commonmark_escape_func(cmark_syntax_extension *extension,
- cmark_commonmark_escape_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_private(cmark_syntax_extension *extension,
- void *priv,
- cmark_free_func free_func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void *cmark_syntax_extension_get_private(cmark_syntax_extension *extension);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_postprocess_func(cmark_syntax_extension *extension,
- cmark_postprocess_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_opaque_alloc_func(cmark_syntax_extension *extension,
- cmark_opaque_alloc_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_syntax_extension_set_opaque_free_func(cmark_syntax_extension *extension,
- cmark_opaque_free_func func);
-
-/** See the documentation for 'cmark_syntax_extension'
- */
-CMARK_GFM_EXPORT
-void cmark_parser_set_backslash_ispunct_func(cmark_parser *parser,
- cmark_ispunct_func func);
-
-/** Return the index of the line currently being parsed, starting with 1.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_get_line_number(cmark_parser *parser);
-
-/** Return the offset in bytes in the line being processed.
- *
- * Example:
- *
- * ### foo
- *
- * Here, offset will first be 0, then 5 (the index of the 'f' character).
- */
-CMARK_GFM_EXPORT
-int cmark_parser_get_offset(cmark_parser *parser);
-
-/**
- * Return the offset in 'columns' in the line being processed.
- *
- * This value may differ from the value returned by
- * cmark_parser_get_offset() in that it accounts for tabs,
- * and as such should not be used as an index in the current line's
- * buffer.
- *
- * Example:
- *
- * cmark_parser_advance_offset() can be called to advance the
- * offset by a number of columns, instead of a number of bytes.
- *
- * In that case, if offset falls "in the middle" of a tab
- * character, 'column' and offset will differ.
- *
- * ```
- * foo \t bar
- * ^ ^^
- * offset (0) 20
- * ```
- *
- * If cmark_parser_advance_offset is called here with 'columns'
- * set to 'true' and 'offset' set to 22, cmark_parser_get_offset()
- * will return 20, whereas cmark_parser_get_column() will return
- * 22.
- *
- * Additionally, as tabs expand to the next multiple of 4 column,
- * cmark_parser_has_partially_consumed_tab() will now return
- * 'true'.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_get_column(cmark_parser *parser);
-
-/** Return the absolute index in bytes of the first nonspace
- * character coming after the offset as returned by
- * cmark_parser_get_offset() in the line currently being processed.
- *
- * Example:
- *
- * ```
- * foo bar baz \n
- * ^ ^ ^
- * 0 offset (16) first_nonspace (28)
- * ```
- */
-CMARK_GFM_EXPORT
-int cmark_parser_get_first_nonspace(cmark_parser *parser);
-
-/** Return the absolute index of the first nonspace column coming after 'offset'
- * in the line currently being processed, counting tabs as multiple
- * columns as appropriate.
- *
- * See the documentation for cmark_parser_get_first_nonspace() and
- * cmark_parser_get_column() for more information.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_get_first_nonspace_column(cmark_parser *parser);
-
-/** Return the difference between the values returned by
- * cmark_parser_get_first_nonspace_column() and
- * cmark_parser_get_column().
- *
- * This is not a byte offset, as it can count one tab as multiple
- * characters.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_get_indent(cmark_parser *parser);
-
-/** Return 'true' if the line currently being processed has been entirely
- * consumed, 'false' otherwise.
- *
- * Example:
- *
- * ```
- * foo bar baz \n
- * ^
- * offset
- * ```
- *
- * This function will return 'false' here.
- *
- * ```
- * foo bar baz \n
- * ^
- * offset
- * ```
- * This function will still return 'false'.
- *
- * ```
- * foo bar baz \n
- * ^
- * offset
- * ```
- *
- * At this point, this function will now return 'true'.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_is_blank(cmark_parser *parser);
-
-/** Return 'true' if the value returned by cmark_parser_get_offset()
- * is 'inside' an expanded tab.
- *
- * See the documentation for cmark_parser_get_column() for more
- * information.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_has_partially_consumed_tab(cmark_parser *parser);
-
-/** Return the length in bytes of the previously processed line, excluding potential
- * newline (\n) and carriage return (\r) trailing characters.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_get_last_line_length(cmark_parser *parser);
-
-/** Add a child to 'parent' during the parsing process.
- *
- * If 'parent' isn't the kind of node that can accept this child,
- * this function will back up till it hits a node that can, closing
- * blocks as appropriate.
- */
-CMARK_GFM_EXPORT
-cmark_node*cmark_parser_add_child(cmark_parser *parser,
- cmark_node *parent,
- cmark_node_type block_type,
- int start_column);
-
-/** Advance the 'offset' of the parser in the current line.
- *
- * See the documentation of cmark_parser_get_offset() and
- * cmark_parser_get_column() for more information.
- */
-CMARK_GFM_EXPORT
-void cmark_parser_advance_offset(cmark_parser *parser,
- const char *input,
- int count,
- int columns);
-
-
-CMARK_GFM_EXPORT
-void cmark_parser_feed_reentrant(cmark_parser *parser, const char *buffer, size_t len);
-
-/** Attach the syntax 'extension' to the 'parser', to provide extra syntax
- * rules.
- * See the documentation for cmark_syntax_extension for more information.
- *
- * Returns 'true' if the 'extension' was successfully attached,
- * 'false' otherwise.
- */
-CMARK_GFM_EXPORT
-int cmark_parser_attach_syntax_extension(cmark_parser *parser, cmark_syntax_extension *extension);
-
-/** Change the type of 'node'.
- *
- * Return 0 if the type could be changed, 1 otherwise.
- */
-CMARK_GFM_EXPORT int cmark_node_set_type(cmark_node *node, cmark_node_type type);
-
-/** Return the string content for all types of 'node'.
- * The pointer stays valid as long as 'node' isn't freed.
- */
-CMARK_GFM_EXPORT const char *cmark_node_get_string_content(cmark_node *node);
-
-/** Set the string 'content' for all types of 'node'.
- * Copies 'content'.
- */
-CMARK_GFM_EXPORT int cmark_node_set_string_content(cmark_node *node, const char *content);
-
-/** Get the syntax extension responsible for the creation of 'node'.
- * Return NULL if 'node' was created because it matched standard syntax rules.
- */
-CMARK_GFM_EXPORT cmark_syntax_extension *cmark_node_get_syntax_extension(cmark_node *node);
-
-/** Set the syntax extension responsible for creating 'node'.
- */
-CMARK_GFM_EXPORT int cmark_node_set_syntax_extension(cmark_node *node,
- cmark_syntax_extension *extension);
-
-/**
- * ## Inline syntax extension helpers
- *
- * The inline parsing process is described in detail at
- *
- */
-
-/** Should return 'true' if the predicate matches 'c', 'false' otherwise
- */
-typedef int (*cmark_inline_predicate)(int c);
-
-/** Advance the current inline parsing offset */
-CMARK_GFM_EXPORT
-void cmark_inline_parser_advance_offset(cmark_inline_parser *parser);
-
-/** Get the current inline parsing offset */
-CMARK_GFM_EXPORT
-int cmark_inline_parser_get_offset(cmark_inline_parser *parser);
-
-/** Set the offset in bytes in the chunk being processed by the given inline parser.
- */
-CMARK_GFM_EXPORT
-void cmark_inline_parser_set_offset(cmark_inline_parser *parser, int offset);
-
-/** Gets the cmark_chunk being operated on by the given inline parser.
- * Use cmark_inline_parser_get_offset to get our current position in the chunk.
- */
-CMARK_GFM_EXPORT
-struct cmark_chunk *cmark_inline_parser_get_chunk(cmark_inline_parser *parser);
-
-/** Returns 1 if the inline parser is currently in a bracket; pass 1 for 'image'
- * if you want to know about an image-type bracket, 0 for link-type. */
-CMARK_GFM_EXPORT
-int cmark_inline_parser_in_bracket(cmark_inline_parser *parser, int image);
-
-/** Remove the last n characters from the last child of the given node.
- * This only works where all n characters are in the single last child, and the last
- * child is CMARK_NODE_TEXT.
- */
-CMARK_GFM_EXPORT
-void cmark_node_unput(cmark_node *node, int n);
-
-
-/** Get the character located at the current inline parsing offset
- */
-CMARK_GFM_EXPORT
-unsigned char cmark_inline_parser_peek_char(cmark_inline_parser *parser);
-
-/** Get the character located 'pos' bytes in the current line.
- */
-CMARK_GFM_EXPORT
-unsigned char cmark_inline_parser_peek_at(cmark_inline_parser *parser, int pos);
-
-/** Whether the inline parser has reached the end of the current line
- */
-CMARK_GFM_EXPORT
-int cmark_inline_parser_is_eof(cmark_inline_parser *parser);
-
-/** Get the characters located after the current inline parsing offset
- * while 'pred' matches. Free after usage.
- */
-CMARK_GFM_EXPORT
-char *cmark_inline_parser_take_while(cmark_inline_parser *parser, cmark_inline_predicate pred);
-
-/** Push a delimiter on the delimiter stack.
- * See < for
- * more information on the parameters
- */
-CMARK_GFM_EXPORT
-void cmark_inline_parser_push_delimiter(cmark_inline_parser *parser,
- unsigned char c,
- int can_open,
- int can_close,
- cmark_node *inl_text);
-
-/** Remove 'delim' from the delimiter stack
- */
-CMARK_GFM_EXPORT
-void cmark_inline_parser_remove_delimiter(cmark_inline_parser *parser, delimiter *delim);
-
-CMARK_GFM_EXPORT
-delimiter *cmark_inline_parser_get_last_delimiter(cmark_inline_parser *parser);
-
-CMARK_GFM_EXPORT
-int cmark_inline_parser_get_line(cmark_inline_parser *parser);
-
-CMARK_GFM_EXPORT
-int cmark_inline_parser_get_column(cmark_inline_parser *parser);
-
-/** Convenience function to scan a given delimiter.
- *
- * 'left_flanking' and 'right_flanking' will be set to true if they
- * respectively precede and follow a non-space, non-punctuation
- * character.
- *
- * Additionally, 'punct_before' and 'punct_after' will respectively be set
- * if the preceding or following character is a punctuation character.
- *
- * Note that 'left_flanking' and 'right_flanking' can both be 'true'.
- *
- * Returns the number of delimiters encountered, in the limit
- * of 'max_delims', and advances the inline parsing offset.
- */
-CMARK_GFM_EXPORT
-int cmark_inline_parser_scan_delimiters(cmark_inline_parser *parser,
- int max_delims,
- unsigned char c,
- int *left_flanking,
- int *right_flanking,
- int *punct_before,
- int *punct_after);
-
-CMARK_GFM_EXPORT
-void cmark_manage_extensions_special_characters(cmark_parser *parser, int add);
-
-CMARK_GFM_EXPORT
-cmark_llist *cmark_parser_get_syntax_extensions(cmark_parser *parser);
-
-CMARK_GFM_EXPORT
-void cmark_arena_push(void);
-
-CMARK_GFM_EXPORT
-int cmark_arena_pop(void);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-extensions_export.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-extensions_export.h
deleted file mode 100644
index 69c0bd7..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm-extensions_export.h
+++ /dev/null
@@ -1,42 +0,0 @@
-
-#ifndef CMARK_GFM_EXTENSIONS_EXPORT_H
-#define CMARK_GFM_EXTENSIONS_EXPORT_H
-
-#ifdef CMARK_GFM_EXTENSIONS_STATIC_DEFINE
-# define CMARK_GFM_EXTENSIONS_EXPORT
-# define CMARK_GFM_EXTENSIONS_NO_EXPORT
-#else
-# ifndef CMARK_GFM_EXTENSIONS_EXPORT
-# ifdef libcmark_gfm_extensions_EXPORTS
- /* We are building this library */
-# define CMARK_GFM_EXTENSIONS_EXPORT __attribute__((visibility("default")))
-# else
- /* We are using this library */
-# define CMARK_GFM_EXTENSIONS_EXPORT __attribute__((visibility("default")))
-# endif
-# endif
-
-# ifndef CMARK_GFM_EXTENSIONS_NO_EXPORT
-# define CMARK_GFM_EXTENSIONS_NO_EXPORT __attribute__((visibility("hidden")))
-# endif
-#endif
-
-#ifndef CMARK_GFM_EXTENSIONS_DEPRECATED
-# define CMARK_GFM_EXTENSIONS_DEPRECATED __attribute__ ((__deprecated__))
-#endif
-
-#ifndef CMARK_GFM_EXTENSIONS_DEPRECATED_EXPORT
-# define CMARK_GFM_EXTENSIONS_DEPRECATED_EXPORT CMARK_GFM_EXTENSIONS_EXPORT CMARK_GFM_EXTENSIONS_DEPRECATED
-#endif
-
-#ifndef CMARK_GFM_EXTENSIONS_DEPRECATED_NO_EXPORT
-# define CMARK_GFM_EXTENSIONS_DEPRECATED_NO_EXPORT CMARK_GFM_EXTENSIONS_NO_EXPORT CMARK_GFM_EXTENSIONS_DEPRECATED
-#endif
-
-#if 0 /* DEFINE_NO_DEPRECATED */
-# ifndef CMARK_GFM_EXTENSIONS_NO_DEPRECATED
-# define CMARK_GFM_EXTENSIONS_NO_DEPRECATED
-# endif
-#endif
-
-#endif /* CMARK_GFM_EXTENSIONS_EXPORT_H */
diff --git a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm.h b/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm.h
deleted file mode 100644
index 0544057..0000000
--- a/docs/website/vendor/bundle/ruby/3.0.0/gems/commonmarker-0.23.10/ext/commonmarker/cmark-gfm.h
+++ /dev/null
@@ -1,833 +0,0 @@
-#ifndef CMARK_GFM_H
-#define CMARK_GFM_H
-
-#include
-#include
-#include "cmark-gfm_export.h"
-#include "cmark-gfm_version.h"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/** # NAME
- *
- * **cmark-gfm** - CommonMark parsing, manipulating, and rendering
- */
-
-/** # DESCRIPTION
- *
- * ## Simple Interface
- */
-
-/** Convert 'text' (assumed to be a UTF-8 encoded string with length
- * 'len') from CommonMark Markdown to HTML, returning a null-terminated,
- * UTF-8-encoded string. It is the caller's responsibility
- * to free the returned buffer.
- */
-CMARK_GFM_EXPORT
-char *cmark_markdown_to_html(const char *text, size_t len, int options);
-
-/** ## Node Structure
- */
-
-#define CMARK_NODE_TYPE_PRESENT (0x8000)
-#define CMARK_NODE_TYPE_BLOCK (CMARK_NODE_TYPE_PRESENT | 0x0000)
-#define CMARK_NODE_TYPE_INLINE (CMARK_NODE_TYPE_PRESENT | 0x4000)
-#define CMARK_NODE_TYPE_MASK (0xc000)
-#define CMARK_NODE_VALUE_MASK (0x3fff)
-
-typedef enum {
- /* Error status */
- CMARK_NODE_NONE = 0x0000,
-
- /* Block */
- CMARK_NODE_DOCUMENT = CMARK_NODE_TYPE_BLOCK | 0x0001,
- CMARK_NODE_BLOCK_QUOTE = CMARK_NODE_TYPE_BLOCK | 0x0002,
- CMARK_NODE_LIST = CMARK_NODE_TYPE_BLOCK | 0x0003,
- CMARK_NODE_ITEM = CMARK_NODE_TYPE_BLOCK | 0x0004,
- CMARK_NODE_CODE_BLOCK = CMARK_NODE_TYPE_BLOCK | 0x0005,
- CMARK_NODE_HTML_BLOCK = CMARK_NODE_TYPE_BLOCK | 0x0006,
- CMARK_NODE_CUSTOM_BLOCK = CMARK_NODE_TYPE_BLOCK | 0x0007,
- CMARK_NODE_PARAGRAPH = CMARK_NODE_TYPE_BLOCK | 0x0008,
- CMARK_NODE_HEADING = CMARK_NODE_TYPE_BLOCK | 0x0009,
- CMARK_NODE_THEMATIC_BREAK = CMARK_NODE_TYPE_BLOCK | 0x000a,
- CMARK_NODE_FOOTNOTE_DEFINITION = CMARK_NODE_TYPE_BLOCK | 0x000b,
-
- /* Inline */
- CMARK_NODE_TEXT = CMARK_NODE_TYPE_INLINE | 0x0001,
- CMARK_NODE_SOFTBREAK = CMARK_NODE_TYPE_INLINE | 0x0002,
- CMARK_NODE_LINEBREAK = CMARK_NODE_TYPE_INLINE | 0x0003,
- CMARK_NODE_CODE = CMARK_NODE_TYPE_INLINE | 0x0004,
- CMARK_NODE_HTML_INLINE = CMARK_NODE_TYPE_INLINE | 0x0005,
- CMARK_NODE_CUSTOM_INLINE = CMARK_NODE_TYPE_INLINE | 0x0006,
- CMARK_NODE_EMPH = CMARK_NODE_TYPE_INLINE | 0x0007,
- CMARK_NODE_STRONG = CMARK_NODE_TYPE_INLINE | 0x0008,
- CMARK_NODE_LINK = CMARK_NODE_TYPE_INLINE | 0x0009,
- CMARK_NODE_IMAGE = CMARK_NODE_TYPE_INLINE | 0x000a,
- CMARK_NODE_FOOTNOTE_REFERENCE = CMARK_NODE_TYPE_INLINE | 0x000b,
-} cmark_node_type;
-
-extern cmark_node_type CMARK_NODE_LAST_BLOCK;
-extern cmark_node_type CMARK_NODE_LAST_INLINE;
-
-/* For backwards compatibility: */
-#define CMARK_NODE_HEADER CMARK_NODE_HEADING
-#define CMARK_NODE_HRULE CMARK_NODE_THEMATIC_BREAK
-#define CMARK_NODE_HTML CMARK_NODE_HTML_BLOCK
-#define CMARK_NODE_INLINE_HTML CMARK_NODE_HTML_INLINE
-
-typedef enum {
- CMARK_NO_LIST,
- CMARK_BULLET_LIST,
- CMARK_ORDERED_LIST
-} cmark_list_type;
-
-typedef enum {
- CMARK_NO_DELIM,
- CMARK_PERIOD_DELIM,
- CMARK_PAREN_DELIM
-} cmark_delim_type;
-
-typedef struct cmark_node cmark_node;
-typedef struct cmark_parser cmark_parser;
-typedef struct cmark_iter cmark_iter;
-typedef struct cmark_syntax_extension cmark_syntax_extension;
-
-/**
- * ## Custom memory allocator support
- */
-
-/** Defines the memory allocation functions to be used by CMark
- * when parsing and allocating a document tree
- */
-typedef struct cmark_mem {
- void *(*calloc)(size_t, size_t);
- void *(*realloc)(void *, size_t);
- void (*free)(void *);
-} cmark_mem;
-
-/** The default memory allocator; uses the system's calloc,
- * realloc and free.
- */
-CMARK_GFM_EXPORT
-cmark_mem *cmark_get_default_mem_allocator(void);
-
-/** An arena allocator; uses system calloc to allocate large
- * slabs of memory. Memory in these slabs is not reused at all.
- */
-CMARK_GFM_EXPORT
-cmark_mem *cmark_get_arena_mem_allocator(void);
-
-/** Resets the arena allocator, quickly returning all used memory
- * to the operating system.
- */
-CMARK_GFM_EXPORT
-void cmark_arena_reset(void);
-
-/** Callback for freeing user data with a 'cmark_mem' context.
- */
-typedef void (*cmark_free_func) (cmark_mem *mem, void *user_data);
-
-
-/*
- * ## Basic data structures
- *
- * To keep dependencies to the strict minimum, libcmark implements
- * its own versions of "classic" data structures.
- */
-
-/**
- * ### Linked list
- */
-
-/** A generic singly linked list.
- */
-typedef struct _cmark_llist
-{
- struct _cmark_llist *next;
- void *data;
-} cmark_llist;
-
-/** Append an element to the linked list, return the possibly modified
- * head of the list.
- */
-CMARK_GFM_EXPORT
-cmark_llist * cmark_llist_append (cmark_mem * mem,
- cmark_llist * head,
- void * data);
-
-/** Free the list starting with 'head', calling 'free_func' with the
- * data pointer of each of its elements
- */
-CMARK_GFM_EXPORT
-void cmark_llist_free_full (cmark_mem * mem,
- cmark_llist * head,
- cmark_free_func free_func);
-
-/** Free the list starting with 'head'
- */
-CMARK_GFM_EXPORT
-void cmark_llist_free (cmark_mem * mem,
- cmark_llist * head);
-
-/**
- * ## Creating and Destroying Nodes
- */
-
-/** Creates a new node of type 'type'. Note that the node may have
- * other required properties, which it is the caller's responsibility
- * to assign.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_new(cmark_node_type type);
-
-/** Same as `cmark_node_new`, but explicitly listing the memory
- * allocator used to allocate the node. Note: be sure to use the same
- * allocator for every node in a tree, or bad things can happen.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_new_with_mem(cmark_node_type type,
- cmark_mem *mem);
-
-CMARK_GFM_EXPORT cmark_node *cmark_node_new_with_ext(cmark_node_type type,
- cmark_syntax_extension *extension);
-
-CMARK_GFM_EXPORT cmark_node *cmark_node_new_with_mem_and_ext(cmark_node_type type,
- cmark_mem *mem,
- cmark_syntax_extension *extension);
-
-/** Frees the memory allocated for a node and any children.
- */
-CMARK_GFM_EXPORT void cmark_node_free(cmark_node *node);
-
-/**
- * ## Tree Traversal
- */
-
-/** Returns the next node in the sequence after 'node', or NULL if
- * there is none.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_next(cmark_node *node);
-
-/** Returns the previous node in the sequence after 'node', or NULL if
- * there is none.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_previous(cmark_node *node);
-
-/** Returns the parent of 'node', or NULL if there is none.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_parent(cmark_node *node);
-
-/** Returns the first child of 'node', or NULL if 'node' has no children.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_first_child(cmark_node *node);
-
-/** Returns the last child of 'node', or NULL if 'node' has no children.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_last_child(cmark_node *node);
-
-/** Returns the footnote reference of 'node', or NULL if 'node' doesn't have a
- * footnote reference.
- */
-CMARK_GFM_EXPORT cmark_node *cmark_node_parent_footnote_def(cmark_node *node);
-
-/**
- * ## Iterator
- *
- * An iterator will walk through a tree of nodes, starting from a root
- * node, returning one node at a time, together with information about
- * whether the node is being entered or exited. The iterator will
- * first descend to a child node, if there is one. When there is no
- * child, the iterator will go to the next sibling. When there is no
- * next sibling, the iterator will return to the parent (but with
- * a 'cmark_event_type' of `CMARK_EVENT_EXIT`). The iterator will
- * return `CMARK_EVENT_DONE` when it reaches the root node again.
- * One natural application is an HTML renderer, where an `ENTER` event
- * outputs an open tag and an `EXIT` event outputs a close tag.
- * An iterator might also be used to transform an AST in some systematic
- * way, for example, turning all level-3 headings into regular paragraphs.
- *
- * void
- * usage_example(cmark_node *root) {
- * cmark_event_type ev_type;
- * cmark_iter *iter = cmark_iter_new(root);
- *
- * while ((ev_type = cmark_iter_next(iter)) != CMARK_EVENT_DONE) {
- * cmark_node *cur = cmark_iter_get_node(iter);
- * // Do something with `cur` and `ev_type`
- * }
- *
- * cmark_iter_free(iter);
- * }
- *
- * Iterators will never return `EXIT` events for leaf nodes, which are nodes
- * of type:
- *
- * * CMARK_NODE_HTML_BLOCK
- * * CMARK_NODE_THEMATIC_BREAK
- * * CMARK_NODE_CODE_BLOCK
- * * CMARK_NODE_TEXT
- * * CMARK_NODE_SOFTBREAK
- * * CMARK_NODE_LINEBREAK
- * * CMARK_NODE_CODE
- * * CMARK_NODE_HTML_INLINE
- *
- * Nodes must only be modified after an `EXIT` event, or an `ENTER` event for
- * leaf nodes.
- */
-
-typedef enum {
- CMARK_EVENT_NONE,
- CMARK_EVENT_DONE,
- CMARK_EVENT_ENTER,
- CMARK_EVENT_EXIT
-} cmark_event_type;
-
-/** Creates a new iterator starting at 'root'. The current node and event
- * type are undefined until 'cmark_iter_next' is called for the first time.
- * The memory allocated for the iterator should be released using
- * 'cmark_iter_free' when it is no longer needed.
- */
-CMARK_GFM_EXPORT
-cmark_iter *cmark_iter_new(cmark_node *root);
-
-/** Frees the memory allocated for an iterator.
- */
-CMARK_GFM_EXPORT
-void cmark_iter_free(cmark_iter *iter);
-
-/** Advances to the next node and returns the event type (`CMARK_EVENT_ENTER`,
- * `CMARK_EVENT_EXIT` or `CMARK_EVENT_DONE`).
- */
-CMARK_GFM_EXPORT
-cmark_event_type cmark_iter_next(cmark_iter *iter);
-
-/** Returns the current node.
- */
-CMARK_GFM_EXPORT
-cmark_node *cmark_iter_get_node(cmark_iter *iter);
-
-/** Returns the current event type.
- */
-CMARK_GFM_EXPORT
-cmark_event_type cmark_iter_get_event_type(cmark_iter *iter);
-
-/** Returns the root node.
- */
-CMARK_GFM_EXPORT
-cmark_node *cmark_iter_get_root(cmark_iter *iter);
-
-/** Resets the iterator so that the current node is 'current' and
- * the event type is 'event_type'. The new current node must be a
- * descendant of the root node or the root node itself.
- */
-CMARK_GFM_EXPORT
-void cmark_iter_reset(cmark_iter *iter, cmark_node *current,
- cmark_event_type event_type);
-
-/**
- * ## Accessors
- */
-
-/** Returns the user data of 'node'.
- */
-CMARK_GFM_EXPORT void *cmark_node_get_user_data(cmark_node *node);
-
-/** Sets arbitrary user data for 'node'. Returns 1 on success,
- * 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_user_data(cmark_node *node, void *user_data);
-
-/** Set free function for user data */
-CMARK_GFM_EXPORT
-int cmark_node_set_user_data_free_func(cmark_node *node,
- cmark_free_func free_func);
-
-/** Returns the type of 'node', or `CMARK_NODE_NONE` on error.
- */
-CMARK_GFM_EXPORT cmark_node_type cmark_node_get_type(cmark_node *node);
-
-/** Like 'cmark_node_get_type', but returns a string representation
- of the type, or `""`.
- */
-CMARK_GFM_EXPORT
-const char *cmark_node_get_type_string(cmark_node *node);
-
-/** Returns the string contents of 'node', or an empty
- string if none is set. Returns NULL if called on a
- node that does not have string content.
- */
-CMARK_GFM_EXPORT const char *cmark_node_get_literal(cmark_node *node);
-
-/** Sets the string contents of 'node'. Returns 1 on success,
- * 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_literal(cmark_node *node, const char *content);
-
-/** Returns the heading level of 'node', or 0 if 'node' is not a heading.
- */
-CMARK_GFM_EXPORT int cmark_node_get_heading_level(cmark_node *node);
-
-/* For backwards compatibility */
-#define cmark_node_get_header_level cmark_node_get_heading_level
-#define cmark_node_set_header_level cmark_node_set_heading_level
-
-/** Sets the heading level of 'node', returning 1 on success and 0 on error.
- */
-CMARK_GFM_EXPORT int cmark_node_set_heading_level(cmark_node *node, int level);
-
-/** Returns the list type of 'node', or `CMARK_NO_LIST` if 'node'
- * is not a list.
- */
-CMARK_GFM_EXPORT cmark_list_type cmark_node_get_list_type(cmark_node *node);
-
-/** Sets the list type of 'node', returning 1 on success and 0 on error.
- */
-CMARK_GFM_EXPORT int cmark_node_set_list_type(cmark_node *node,
- cmark_list_type type);
-
-/** Returns the list delimiter type of 'node', or `CMARK_NO_DELIM` if 'node'
- * is not a list.
- */
-CMARK_GFM_EXPORT cmark_delim_type cmark_node_get_list_delim(cmark_node *node);
-
-/** Sets the list delimiter type of 'node', returning 1 on success and 0
- * on error.
- */
-CMARK_GFM_EXPORT int cmark_node_set_list_delim(cmark_node *node,
- cmark_delim_type delim);
-
-/** Returns starting number of 'node', if it is an ordered list, otherwise 0.
- */
-CMARK_GFM_EXPORT int cmark_node_get_list_start(cmark_node *node);
-
-/** Sets starting number of 'node', if it is an ordered list. Returns 1
- * on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_list_start(cmark_node *node, int start);
-
-/** Returns 1 if 'node' is a tight list, 0 otherwise.
- */
-CMARK_GFM_EXPORT int cmark_node_get_list_tight(cmark_node *node);
-
-/** Sets the "tightness" of a list. Returns 1 on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_list_tight(cmark_node *node, int tight);
-
-/**
- * Returns item index of 'node'. This is only used when rendering output
- * formats such as commonmark, which need to output the index. It is not
- * required for formats such as html or latex.
- */
-CMARK_GFM_EXPORT int cmark_node_get_item_index(cmark_node *node);
-
-/** Sets item index of 'node'. Returns 1 on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_item_index(cmark_node *node, int idx);
-
-/** Returns the info string from a fenced code block.
- */
-CMARK_GFM_EXPORT const char *cmark_node_get_fence_info(cmark_node *node);
-
-/** Sets the info string in a fenced code block, returning 1 on
- * success and 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_fence_info(cmark_node *node, const char *info);
-
-/** Sets code blocks fencing details
- */
-CMARK_GFM_EXPORT int cmark_node_set_fenced(cmark_node * node, int fenced,
- int length, int offset, char character);
-
-/** Returns code blocks fencing details
- */
-CMARK_GFM_EXPORT int cmark_node_get_fenced(cmark_node *node, int *length, int *offset, char *character);
-
-/** Returns the URL of a link or image 'node', or an empty string
- if no URL is set. Returns NULL if called on a node that is
- not a link or image.
- */
-CMARK_GFM_EXPORT const char *cmark_node_get_url(cmark_node *node);
-
-/** Sets the URL of a link or image 'node'. Returns 1 on success,
- * 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_url(cmark_node *node, const char *url);
-
-/** Returns the title of a link or image 'node', or an empty
- string if no title is set. Returns NULL if called on a node
- that is not a link or image.
- */
-CMARK_GFM_EXPORT const char *cmark_node_get_title(cmark_node *node);
-
-/** Sets the title of a link or image 'node'. Returns 1 on success,
- * 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_title(cmark_node *node, const char *title);
-
-/** Returns the literal "on enter" text for a custom 'node', or
- an empty string if no on_enter is set. Returns NULL if called
- on a non-custom node.
- */
-CMARK_GFM_EXPORT const char *cmark_node_get_on_enter(cmark_node *node);
-
-/** Sets the literal text to render "on enter" for a custom 'node'.
- Any children of the node will be rendered after this text.
- Returns 1 on success 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_on_enter(cmark_node *node,
- const char *on_enter);
-
-/** Returns the literal "on exit" text for a custom 'node', or
- an empty string if no on_exit is set. Returns NULL if
- called on a non-custom node.
- */
-CMARK_GFM_EXPORT const char *cmark_node_get_on_exit(cmark_node *node);
-
-/** Sets the literal text to render "on exit" for a custom 'node'.
- Any children of the node will be rendered before this text.
- Returns 1 on success 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_set_on_exit(cmark_node *node, const char *on_exit);
-
-/** Returns the line on which 'node' begins.
- */
-CMARK_GFM_EXPORT int cmark_node_get_start_line(cmark_node *node);
-
-/** Returns the column at which 'node' begins.
- */
-CMARK_GFM_EXPORT int cmark_node_get_start_column(cmark_node *node);
-
-/** Returns the line on which 'node' ends.
- */
-CMARK_GFM_EXPORT int cmark_node_get_end_line(cmark_node *node);
-
-/** Returns the column at which 'node' ends.
- */
-CMARK_GFM_EXPORT int cmark_node_get_end_column(cmark_node *node);
-
-/**
- * ## Tree Manipulation
- */
-
-/** Unlinks a 'node', removing it from the tree, but not freeing its
- * memory. (Use 'cmark_node_free' for that.)
- */
-CMARK_GFM_EXPORT void cmark_node_unlink(cmark_node *node);
-
-/** Inserts 'sibling' before 'node'. Returns 1 on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_insert_before(cmark_node *node,
- cmark_node *sibling);
-
-/** Inserts 'sibling' after 'node'. Returns 1 on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_insert_after(cmark_node *node, cmark_node *sibling);
-
-/** Replaces 'oldnode' with 'newnode' and unlinks 'oldnode' (but does
- * not free its memory).
- * Returns 1 on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_replace(cmark_node *oldnode, cmark_node *newnode);
-
-/** Adds 'child' to the beginning of the children of 'node'.
- * Returns 1 on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_prepend_child(cmark_node *node, cmark_node *child);
-
-/** Adds 'child' to the end of the children of 'node'.
- * Returns 1 on success, 0 on failure.
- */
-CMARK_GFM_EXPORT int cmark_node_append_child(cmark_node *node, cmark_node *child);
-
-/** Consolidates adjacent text nodes.
- */
-CMARK_GFM_EXPORT void cmark_consolidate_text_nodes(cmark_node *root);
-
-/** Ensures a node and all its children own their own chunk memory.
- */
-CMARK_GFM_EXPORT void cmark_node_own(cmark_node *root);
-
-/**
- * ## Parsing
- *
- * Simple interface:
- *
- * cmark_node *document = cmark_parse_document("Hello *world*", 13,
- * CMARK_OPT_DEFAULT);
- *
- * Streaming interface:
- *
- * cmark_parser *parser = cmark_parser_new(CMARK_OPT_DEFAULT);
- * FILE *fp = fopen("myfile.md", "rb");
- * while ((bytes = fread(buffer, 1, sizeof(buffer), fp)) > 0) {
- * cmark_parser_feed(parser, buffer, bytes);
- * if (bytes < sizeof(buffer)) {
- * break;
- * }
- * }
- * document = cmark_parser_finish(parser);
- * cmark_parser_free(parser);
- */
-
-/** Creates a new parser object.
- */
-CMARK_GFM_EXPORT
-cmark_parser *cmark_parser_new(int options);
-
-/** Creates a new parser object with the given memory allocator
- */
-CMARK_GFM_EXPORT
-cmark_parser *cmark_parser_new_with_mem(int options, cmark_mem *mem);
-
-/** Frees memory allocated for a parser object.
- */
-CMARK_GFM_EXPORT
-void cmark_parser_free(cmark_parser *parser);
-
-/** Feeds a string of length 'len' to 'parser'.
- */
-CMARK_GFM_EXPORT
-void cmark_parser_feed(cmark_parser *parser, const char *buffer, size_t len);
-
-/** Finish parsing and return a pointer to a tree of nodes.
- */
-CMARK_GFM_EXPORT
-cmark_node *cmark_parser_finish(cmark_parser *parser);
-
-/** Parse a CommonMark document in 'buffer' of length 'len'.
- * Returns a pointer to a tree of nodes. The memory allocated for
- * the node tree should be released using 'cmark_node_free'
- * when it is no longer needed.
- */
-CMARK_GFM_EXPORT
-cmark_node *cmark_parse_document(const char *buffer, size_t len, int options);
-
-/** Parse a CommonMark document in file 'f', returning a pointer to
- * a tree of nodes. The memory allocated for the node tree should be
- * released using 'cmark_node_free' when it is no longer needed.
- */
-CMARK_GFM_EXPORT
-cmark_node *cmark_parse_file(FILE *f, int options);
-
-/**
- * ## Rendering
- */
-
-/** Render a 'node' tree as XML. It is the caller's responsibility
- * to free the returned buffer.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_xml(cmark_node *root, int options);
-
-/** As for 'cmark_render_xml', but specifying the allocator to use for
- * the resulting string.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_xml_with_mem(cmark_node *root, int options, cmark_mem *mem);
-
-/** Render a 'node' tree as an HTML fragment. It is up to the user
- * to add an appropriate header and footer. It is the caller's
- * responsibility to free the returned buffer.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_html(cmark_node *root, int options, cmark_llist *extensions);
-
-/** As for 'cmark_render_html', but specifying the allocator to use for
- * the resulting string.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_html_with_mem(cmark_node *root, int options, cmark_llist *extensions, cmark_mem *mem);
-
-/** Render a 'node' tree as a groff man page, without the header.
- * It is the caller's responsibility to free the returned buffer.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_man(cmark_node *root, int options, int width);
-
-/** As for 'cmark_render_man', but specifying the allocator to use for
- * the resulting string.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_man_with_mem(cmark_node *root, int options, int width, cmark_mem *mem);
-
-/** Render a 'node' tree as a commonmark document.
- * It is the caller's responsibility to free the returned buffer.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_commonmark(cmark_node *root, int options, int width);
-
-/** As for 'cmark_render_commonmark', but specifying the allocator to use for
- * the resulting string.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_commonmark_with_mem(cmark_node *root, int options, int width, cmark_mem *mem);
-
-/** Render a 'node' tree as a plain text document.
- * It is the caller's responsibility to free the returned buffer.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_plaintext(cmark_node *root, int options, int width);
-
-/** As for 'cmark_render_plaintext', but specifying the allocator to use for
- * the resulting string.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_plaintext_with_mem(cmark_node *root, int options, int width, cmark_mem *mem);
-
-/** Render a 'node' tree as a LaTeX document.
- * It is the caller's responsibility to free the returned buffer.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_latex(cmark_node *root, int options, int width);
-
-/** As for 'cmark_render_latex', but specifying the allocator to use for
- * the resulting string.
- */
-CMARK_GFM_EXPORT
-char *cmark_render_latex_with_mem(cmark_node *root, int options, int width, cmark_mem *mem);
-
-/**
- * ## Options
- */
-
-/** Default options.
- */
-#define CMARK_OPT_DEFAULT 0
-
-/**
- * ### Options affecting rendering
- */
-
-/** Include a `data-sourcepos` attribute on all block elements.
- */
-#define CMARK_OPT_SOURCEPOS (1 << 1)
-
-/** Render `softbreak` elements as hard line breaks.
- */
-#define CMARK_OPT_HARDBREAKS (1 << 2)
-
-/** `CMARK_OPT_SAFE` is defined here for API compatibility,
- but it no longer has any effect. "Safe" mode is now the default:
- set `CMARK_OPT_UNSAFE` to disable it.
- */
-#define CMARK_OPT_SAFE (1 << 3)
-
-/** Render raw HTML and unsafe links (`javascript:`, `vbscript:`,
- * `file:`, and `data:`, except for `image/png`, `image/gif`,
- * `image/jpeg`, or `image/webp` mime types). By default,
- * raw HTML is replaced by a placeholder HTML comment. Unsafe
- * links are replaced by empty strings.
- */
-#define CMARK_OPT_UNSAFE (1 << 17)
-
-/** Render `softbreak` elements as spaces.
- */
-#define CMARK_OPT_NOBREAKS (1 << 4)
-
-/**
- * ### Options affecting parsing
- */
-
-/** Legacy option (no effect).
- */
-#define CMARK_OPT_NORMALIZE (1 << 8)
-
-/** Validate UTF-8 in the input before parsing, replacing illegal
- * sequences with the replacement character U+FFFD.
- */
-#define CMARK_OPT_VALIDATE_UTF8 (1 << 9)
-
-/** Convert straight quotes to curly, --- to em dashes, -- to en dashes.
- */
-#define CMARK_OPT_SMART (1 << 10)
-
-/** Use GitHub-style
Retrieval operations (including {@code get}) generally do not
- * block, so may overlap with update operations (including {@code put}
- * and {@code remove}). Retrievals reflect the results of the most
- * recently completed update operations holding upon their
- * onset. (More formally, an update operation for a given key bears a
- * happens-before relation with any (non-null) retrieval for
- * that key reporting the updated value.) For aggregate operations
- * such as {@code putAll} and {@code clear}, concurrent retrievals may
- * reflect insertion or removal of only some entries. Similarly,
- * Iterators and Enumerations return elements reflecting the state of
- * the hash table at some point at or since the creation of the
- * iterator/enumeration. They do not throw {@link
- * ConcurrentModificationException}. However, iterators are designed
- * to be used by only one thread at a time. Bear in mind that the
- * results of aggregate status methods including {@code size}, {@code
- * isEmpty}, and {@code containsValue} are typically useful only when
- * a map is not undergoing concurrent updates in other threads.
- * Otherwise the results of these methods reflect transient states
- * that may be adequate for monitoring or estimation purposes, but not
- * for program control.
- *
- *
The table is dynamically expanded when there are too many
- * collisions (i.e., keys that have distinct hash codes but fall into
- * the same slot modulo the table size), with the expected average
- * effect of maintaining roughly two bins per mapping (corresponding
- * to a 0.75 load factor threshold for resizing). There may be much
- * variance around this average as mappings are added and removed, but
- * overall, this maintains a commonly accepted time/space tradeoff for
- * hash tables. However, resizing this or any other kind of hash
- * table may be a relatively slow operation. When possible, it is a
- * good idea to provide a size estimate as an optional {@code
- * initialCapacity} constructor argument. An additional optional
- * {@code loadFactor} constructor argument provides a further means of
- * customizing initial table capacity by specifying the table density
- * to be used in calculating the amount of space to allocate for the
- * given number of elements. Also, for compatibility with previous
- * versions of this class, constructors may optionally specify an
- * expected {@code concurrencyLevel} as an additional hint for
- * internal sizing. Note that using many keys with exactly the same
- * {@code hashCode()} is a sure way to slow down performance of any
- * hash table.
- *
- *
A {@link Set} projection of a ConcurrentHashMapV8 may be created
- * (using {@link #newKeySet()} or {@link #newKeySet(int)}), or viewed
- * (using {@link #keySet(Object)} when only keys are of interest, and the
- * mapped values are (perhaps transiently) not used or all take the
- * same mapping value.
- *
- *
A ConcurrentHashMapV8 can be used as scalable frequency map (a
- * form of histogram or multiset) by using {@link LongAdder} values
- * and initializing via {@link #computeIfAbsent}. For example, to add
- * a count to a {@code ConcurrentHashMapV8 freqs}, you
- * can use {@code freqs.computeIfAbsent(k -> new
- * LongAdder()).increment();}
- *
- *
This class and its views and iterators implement all of the
- * optional methods of the {@link Map} and {@link Iterator}
- * interfaces.
- *
- *
Like {@link Hashtable} but unlike {@link HashMap}, this class
- * does not allow {@code null} to be used as a key or value.
- *
- *
ConcurrentHashMapV8s support parallel operations using the {@link
- * ForkJoinPool#commonPool}. (Tasks that may be used in other contexts
- * are available in class {@link ForkJoinTasks}). These operations are
- * designed to be safely, and often sensibly, applied even with maps
- * that are being concurrently updated by other threads; for example,
- * when computing a snapshot summary of the values in a shared
- * registry. There are three kinds of operation, each with four
- * forms, accepting functions with Keys, Values, Entries, and (Key,
- * Value) arguments and/or return values. (The first three forms are
- * also available via the {@link #keySet()}, {@link #values()} and
- * {@link #entrySet()} views). Because the elements of a
- * ConcurrentHashMapV8 are not ordered in any particular way, and may be
- * processed in different orders in different parallel executions, the
- * correctness of supplied functions should not depend on any
- * ordering, or on any other objects or values that may transiently
- * change while computation is in progress; and except for forEach
- * actions, should ideally be side-effect-free.
- *
- *
- *
forEach: Perform a given action on each element.
- * A variant form applies a given transformation on each element
- * before performing the action.
- *
- *
search: Return the first available non-null result of
- * applying a given function on each element; skipping further
- * search when a result is found.
- *
- *
reduce: Accumulate each element. The supplied reduction
- * function cannot rely on ordering (more formally, it should be
- * both associative and commutative). There are five variants:
- *
- *
- *
- *
Plain reductions. (There is not a form of this method for
- * (key, value) function arguments since there is no corresponding
- * return type.)
- *
- *
Mapped reductions that accumulate the results of a given
- * function applied to each element.
- *
- *
Reductions to scalar doubles, longs, and ints, using a
- * given basis value.
- *
- *
- *
- *
- *
- *
The concurrency properties of bulk operations follow
- * from those of ConcurrentHashMapV8: Any non-null result returned
- * from {@code get(key)} and related access methods bears a
- * happens-before relation with the associated insertion or
- * update. The result of any bulk operation reflects the
- * composition of these per-element relations (but is not
- * necessarily atomic with respect to the map as a whole unless it
- * is somehow known to be quiescent). Conversely, because keys
- * and values in the map are never null, null serves as a reliable
- * atomic indicator of the current lack of any result. To
- * maintain this property, null serves as an implicit basis for
- * all non-scalar reduction operations. For the double, long, and
- * int versions, the basis should be one that, when combined with
- * any other value, returns that other value (more formally, it
- * should be the identity element for the reduction). Most common
- * reductions have these properties; for example, computing a sum
- * with basis 0 or a minimum with basis MAX_VALUE.
- *
- *
Search and transformation functions provided as arguments
- * should similarly return null to indicate the lack of any result
- * (in which case it is not used). In the case of mapped
- * reductions, this also enables transformations to serve as
- * filters, returning null (or, in the case of primitive
- * specializations, the identity basis) if the element should not
- * be combined. You can create compound transformations and
- * filterings by composing them yourself under this "null means
- * there is nothing there now" rule before using them in search or
- * reduce operations.
- *
- *
Methods accepting and/or returning Entry arguments maintain
- * key-value associations. They may be useful for example when
- * finding the key for the greatest value. Note that "plain" Entry
- * arguments can be supplied using {@code new
- * AbstractMap.SimpleEntry(k,v)}.
- *
- *
Bulk operations may complete abruptly, throwing an
- * exception encountered in the application of a supplied
- * function. Bear in mind when handling such exceptions that other
- * concurrently executing functions could also have thrown
- * exceptions, or would have done so if the first exception had
- * not occurred.
- *
- *
Parallel speedups for bulk operations compared to sequential
- * processing are common but not guaranteed. Operations involving
- * brief functions on small maps may execute more slowly than
- * sequential loops if the underlying work to parallelize the
- * computation is more expensive than the computation itself.
- * Similarly, parallelization may not lead to much actual parallelism
- * if all processors are busy performing unrelated tasks.
- *
- *
All arguments to all task methods must be non-null.
- *
- *
jsr166e note: During transition, this class
- * uses nested functional interfaces with different names but the
- * same forms as those expected for JDK8.
- *
- *
This class is a member of the
- *
- * Java Collections Framework.
- *
- * @since 1.5
- * @author Doug Lea
- * @param the type of keys maintained by this map
- * @param the type of mapped values
- */
-public class ConcurrentHashMapV8
- implements ConcurrentMap, Serializable, ConcurrentHashMap {
- private static final long serialVersionUID = 7249069246763182397L;
-
- /**
- * A partitionable iterator. A Spliterator can be traversed
- * directly, but can also be partitioned (before traversal) by
- * creating another Spliterator that covers a non-overlapping
- * portion of the elements, and so may be amenable to parallel
- * execution.
- *
- *
This interface exports a subset of expected JDK8
- * functionality.
- *
- *
Sample usage: Here is one (of the several) ways to compute
- * the sum of the values held in a map using the ForkJoin
- * framework. As illustrated here, Spliterators are well suited to
- * designs in which a task repeatedly splits off half its work
- * into forked subtasks until small enough to process directly,
- * and then joins these subtasks. Variants of this style can also
- * be used in completion-based designs.
- *
- *
- * {@code ConcurrentHashMapV8 m = ...
- * // split as if have 8 * parallelism, for load balance
- * int n = m.size();
- * int p = aForkJoinPool.getParallelism() * 8;
- * int split = (n < p)? n : p;
- * long sum = aForkJoinPool.invoke(new SumValues(m.valueSpliterator(), split, null));
- * // ...
- * static class SumValues extends RecursiveTask {
- * final Spliterator s;
- * final int split; // split while > 1
- * final SumValues nextJoin; // records forked subtasks to join
- * SumValues(Spliterator s, int depth, SumValues nextJoin) {
- * this.s = s; this.depth = depth; this.nextJoin = nextJoin;
- * }
- * public Long compute() {
- * long sum = 0;
- * SumValues subtasks = null; // fork subtasks
- * for (int s = split >>> 1; s > 0; s >>>= 1)
- * (subtasks = new SumValues(s.split(), s, subtasks)).fork();
- * while (s.hasNext()) // directly process remaining elements
- * sum += s.next();
- * for (SumValues t = subtasks; t != null; t = t.nextJoin)
- * sum += t.join(); // collect subtask results
- * return sum;
- * }
- * }
- * }
- */
- public static interface Spliterator extends Iterator {
- /**
- * Returns a Spliterator covering approximately half of the
- * elements, guaranteed not to overlap with those subsequently
- * returned by this Spliterator. After invoking this method,
- * the current Spliterator will not produce any of
- * the elements of the returned Spliterator, but the two
- * Spliterators together will produce all of the elements that
- * would have been produced by this Spliterator had this
- * method not been called. The exact number of elements
- * produced by the returned Spliterator is not guaranteed, and
- * may be zero (i.e., with {@code hasNext()} reporting {@code
- * false}) if this Spliterator cannot be further split.
- *
- * @return a Spliterator covering approximately half of the
- * elements
- * @throws IllegalStateException if this Spliterator has
- * already commenced traversing elements
- */
- Spliterator split();
- }
-
-
- /*
- * Overview:
- *
- * The primary design goal of this hash table is to maintain
- * concurrent readability (typically method get(), but also
- * iterators and related methods) while minimizing update
- * contention. Secondary goals are to keep space consumption about
- * the same or better than java.util.HashMap, and to support high
- * initial insertion rates on an empty table by many threads.
- *
- * Each key-value mapping is held in a Node. Because Node fields
- * can contain special values, they are defined using plain Object
- * types. Similarly in turn, all internal methods that use them
- * work off Object types. And similarly, so do the internal
- * methods of auxiliary iterator and view classes. All public
- * generic typed methods relay in/out of these internal methods,
- * supplying null-checks and casts as needed. This also allows
- * many of the public methods to be factored into a smaller number
- * of internal methods (although sadly not so for the five
- * variants of put-related operations). The validation-based
- * approach explained below leads to a lot of code sprawl because
- * retry-control precludes factoring into smaller methods.
- *
- * The table is lazily initialized to a power-of-two size upon the
- * first insertion. Each bin in the table normally contains a
- * list of Nodes (most often, the list has only zero or one Node).
- * Table accesses require volatile/atomic reads, writes, and
- * CASes. Because there is no other way to arrange this without
- * adding further indirections, we use intrinsics
- * (sun.misc.Unsafe) operations. The lists of nodes within bins
- * are always accurately traversable under volatile reads, so long
- * as lookups check hash code and non-nullness of value before
- * checking key equality.
- *
- * We use the top two bits of Node hash fields for control
- * purposes -- they are available anyway because of addressing
- * constraints. As explained further below, these top bits are
- * used as follows:
- * 00 - Normal
- * 01 - Locked
- * 11 - Locked and may have a thread waiting for lock
- * 10 - Node is a forwarding node
- *
- * The lower 30 bits of each Node's hash field contain a
- * transformation of the key's hash code, except for forwarding
- * nodes, for which the lower bits are zero (and so always have
- * hash field == MOVED).
- *
- * Insertion (via put or its variants) of the first node in an
- * empty bin is performed by just CASing it to the bin. This is
- * by far the most common case for put operations under most
- * key/hash distributions. Other update operations (insert,
- * delete, and replace) require locks. We do not want to waste
- * the space required to associate a distinct lock object with
- * each bin, so instead use the first node of a bin list itself as
- * a lock. Blocking support for these locks relies on the builtin
- * "synchronized" monitors. However, we also need a tryLock
- * construction, so we overlay these by using bits of the Node
- * hash field for lock control (see above), and so normally use
- * builtin monitors only for blocking and signalling using
- * wait/notifyAll constructions. See Node.tryAwaitLock.
- *
- * Using the first node of a list as a lock does not by itself
- * suffice though: When a node is locked, any update must first
- * validate that it is still the first node after locking it, and
- * retry if not. Because new nodes are always appended to lists,
- * once a node is first in a bin, it remains first until deleted
- * or the bin becomes invalidated (upon resizing). However,
- * operations that only conditionally update may inspect nodes
- * until the point of update. This is a converse of sorts to the
- * lazy locking technique described by Herlihy & Shavit.
- *
- * The main disadvantage of per-bin locks is that other update
- * operations on other nodes in a bin list protected by the same
- * lock can stall, for example when user equals() or mapping
- * functions take a long time. However, statistically, under
- * random hash codes, this is not a common problem. Ideally, the
- * frequency of nodes in bins follows a Poisson distribution
- * (http://en.wikipedia.org/wiki/Poisson_distribution) with a
- * parameter of about 0.5 on average, given the resizing threshold
- * of 0.75, although with a large variance because of resizing
- * granularity. Ignoring variance, the expected occurrences of
- * list size k are (exp(-0.5) * pow(0.5, k) / factorial(k)). The
- * first values are:
- *
- * 0: 0.60653066
- * 1: 0.30326533
- * 2: 0.07581633
- * 3: 0.01263606
- * 4: 0.00157952
- * 5: 0.00015795
- * 6: 0.00001316
- * 7: 0.00000094
- * 8: 0.00000006
- * more: less than 1 in ten million
- *
- * Lock contention probability for two threads accessing distinct
- * elements is roughly 1 / (8 * #elements) under random hashes.
- *
- * Actual hash code distributions encountered in practice
- * sometimes deviate significantly from uniform randomness. This
- * includes the case when N > (1<<30), so some keys MUST collide.
- * Similarly for dumb or hostile usages in which multiple keys are
- * designed to have identical hash codes. Also, although we guard
- * against the worst effects of this (see method spread), sets of
- * hashes may differ only in bits that do not impact their bin
- * index for a given power-of-two mask. So we use a secondary
- * strategy that applies when the number of nodes in a bin exceeds
- * a threshold, and at least one of the keys implements
- * Comparable. These TreeBins use a balanced tree to hold nodes
- * (a specialized form of red-black trees), bounding search time
- * to O(log N). Each search step in a TreeBin is around twice as
- * slow as in a regular list, but given that N cannot exceed
- * (1<<64) (before running out of addresses) this bounds search
- * steps, lock hold times, etc, to reasonable constants (roughly
- * 100 nodes inspected per operation worst case) so long as keys
- * are Comparable (which is very common -- String, Long, etc).
- * TreeBin nodes (TreeNodes) also maintain the same "next"
- * traversal pointers as regular nodes, so can be traversed in
- * iterators in the same way.
- *
- * The table is resized when occupancy exceeds a percentage
- * threshold (nominally, 0.75, but see below). Only a single
- * thread performs the resize (using field "sizeCtl", to arrange
- * exclusion), but the table otherwise remains usable for reads
- * and updates. Resizing proceeds by transferring bins, one by
- * one, from the table to the next table. Because we are using
- * power-of-two expansion, the elements from each bin must either
- * stay at same index, or move with a power of two offset. We
- * eliminate unnecessary node creation by catching cases where old
- * nodes can be reused because their next fields won't change. On
- * average, only about one-sixth of them need cloning when a table
- * doubles. The nodes they replace will be garbage collectable as
- * soon as they are no longer referenced by any reader thread that
- * may be in the midst of concurrently traversing table. Upon
- * transfer, the old table bin contains only a special forwarding
- * node (with hash field "MOVED") that contains the next table as
- * its key. On encountering a forwarding node, access and update
- * operations restart, using the new table.
- *
- * Each bin transfer requires its bin lock. However, unlike other
- * cases, a transfer can skip a bin if it fails to acquire its
- * lock, and revisit it later (unless it is a TreeBin). Method
- * rebuild maintains a buffer of TRANSFER_BUFFER_SIZE bins that
- * have been skipped because of failure to acquire a lock, and
- * blocks only if none are available (i.e., only very rarely).
- * The transfer operation must also ensure that all accessible
- * bins in both the old and new table are usable by any traversal.
- * When there are no lock acquisition failures, this is arranged
- * simply by proceeding from the last bin (table.length - 1) up
- * towards the first. Upon seeing a forwarding node, traversals
- * (see class Iter) arrange to move to the new table
- * without revisiting nodes. However, when any node is skipped
- * during a transfer, all earlier table bins may have become
- * visible, so are initialized with a reverse-forwarding node back
- * to the old table until the new ones are established. (This
- * sometimes requires transiently locking a forwarding node, which
- * is possible under the above encoding.) These more expensive
- * mechanics trigger only when necessary.
- *
- * The traversal scheme also applies to partial traversals of
- * ranges of bins (via an alternate Traverser constructor)
- * to support partitioned aggregate operations. Also, read-only
- * operations give up if ever forwarded to a null table, which
- * provides support for shutdown-style clearing, which is also not
- * currently implemented.
- *
- * Lazy table initialization minimizes footprint until first use,
- * and also avoids resizings when the first operation is from a
- * putAll, constructor with map argument, or deserialization.
- * These cases attempt to override the initial capacity settings,
- * but harmlessly fail to take effect in cases of races.
- *
- * The element count is maintained using a LongAdder, which avoids
- * contention on updates but can encounter cache thrashing if read
- * too frequently during concurrent access. To avoid reading so
- * often, resizing is attempted either when a bin lock is
- * contended, or upon adding to a bin already holding two or more
- * nodes (checked before adding in the xIfAbsent methods, after
- * adding in others). Under uniform hash distributions, the
- * probability of this occurring at threshold is around 13%,
- * meaning that only about 1 in 8 puts check threshold (and after
- * resizing, many fewer do so). But this approximation has high
- * variance for small table sizes, so we check on any collision
- * for sizes <= 64. The bulk putAll operation further reduces
- * contention by only committing count updates upon these size
- * checks.
- *
- * Maintaining API and serialization compatibility with previous
- * versions of this class introduces several oddities. Mainly: We
- * leave untouched but unused constructor arguments refering to
- * concurrencyLevel. We accept a loadFactor constructor argument,
- * but apply it only to initial table capacity (which is the only
- * time that we can guarantee to honor it.) We also declare an
- * unused "Segment" class that is instantiated in minimal form
- * only when serializing.
- */
-
- /* ---------------- Constants -------------- */
-
- /**
- * The largest possible table capacity. This value must be
- * exactly 1<<30 to stay within Java array allocation and indexing
- * bounds for power of two table sizes, and is further required
- * because the top two bits of 32bit hash fields are used for
- * control purposes.
- */
- private static final int MAXIMUM_CAPACITY = 1 << 30;
-
- /**
- * The default initial table capacity. Must be a power of 2
- * (i.e., at least 1) and at most MAXIMUM_CAPACITY.
- */
- private static final int DEFAULT_CAPACITY = 16;
-
- /**
- * The largest possible (non-power of two) array size.
- * Needed by toArray and related methods.
- */
- static final int MAX_ARRAY_SIZE = Integer.MAX_VALUE - 8;
-
- /**
- * The default concurrency level for this table. Unused but
- * defined for compatibility with previous versions of this class.
- */
- private static final int DEFAULT_CONCURRENCY_LEVEL = 16;
-
- /**
- * The load factor for this table. Overrides of this value in
- * constructors affect only the initial table capacity. The
- * actual floating point value isn't normally used -- it is
- * simpler to use expressions such as {@code n - (n >>> 2)} for
- * the associated resizing threshold.
- */
- private static final float LOAD_FACTOR = 0.75f;
-
- /**
- * The buffer size for skipped bins during transfers. The
- * value is arbitrary but should be large enough to avoid
- * most locking stalls during resizes.
- */
- private static final int TRANSFER_BUFFER_SIZE = 32;
-
- /**
- * The bin count threshold for using a tree rather than list for a
- * bin. The value reflects the approximate break-even point for
- * using tree-based operations.
- * Note that Doug's version defaults to 8, but when dealing with
- * Ruby objects it is actually beneficial to avoid TreeNodes
- * as long as possible as it usually means going into Ruby land.
- */
- private static final int TREE_THRESHOLD = 16;
-
- /*
- * Encodings for special uses of Node hash fields. See above for
- * explanation.
- */
- static final int MOVED = 0x80000000; // hash field for forwarding nodes
- static final int LOCKED = 0x40000000; // set/tested only as a bit
- static final int WAITING = 0xc0000000; // both bits set/tested together
- static final int HASH_BITS = 0x3fffffff; // usable bits of normal node hash
-
- /* ---------------- Fields -------------- */
-
- /**
- * The array of bins. Lazily initialized upon first insertion.
- * Size is always a power of two. Accessed directly by iterators.
- */
- transient volatile Node[] table;
-
- /**
- * The counter maintaining number of elements.
- */
- private transient final LongAdder counter;
-
- /**
- * Table initialization and resizing control. When negative, the
- * table is being initialized or resized. Otherwise, when table is
- * null, holds the initial table size to use upon creation, or 0
- * for default. After initialization, holds the next element count
- * value upon which to resize the table.
- */
- private transient volatile int sizeCtl;
-
- // views
- private transient KeySetView keySet;
- private transient ValuesView values;
- private transient EntrySetView entrySet;
-
- /** For serialization compatibility. Null unless serialized; see below */
- private Segment[] segments;
-
- /* ---------------- Table element access -------------- */
-
- /*
- * Volatile access methods are used for table elements as well as
- * elements of in-progress next table while resizing. Uses are
- * null checked by callers, and implicitly bounds-checked, relying
- * on the invariants that tab arrays have non-zero size, and all
- * indices are masked with (tab.length - 1) which is never
- * negative and always less than length. Note that, to be correct
- * wrt arbitrary concurrency errors by users, bounds checks must
- * operate on local variables, which accounts for some odd-looking
- * inline assignments below.
- */
-
- static final Node tabAt(Node[] tab, int i) { // used by Iter
- return (Node)UNSAFE.getObjectVolatile(tab, ((long)i< 1 ? 64 : 1;
-
- /**
- * Spins a while if LOCKED bit set and this node is the first
- * of its bin, and then sets WAITING bits on hash field and
- * blocks (once) if they are still set. It is OK for this
- * method to return even if lock is not available upon exit,
- * which enables these simple single-wait mechanics.
- *
- * The corresponding signalling operation is performed within
- * callers: Upon detecting that WAITING has been set when
- * unlocking lock (via a failed CAS from non-waiting LOCKED
- * state), unlockers acquire the sync lock and perform a
- * notifyAll.
- *
- * The initial sanity check on tab and bounds is not currently
- * necessary in the only usages of this method, but enables
- * use in other future contexts.
- */
- final void tryAwaitLock(Node[] tab, int i) {
- if (tab != null && i >= 0 && i < tab.length) { // sanity check
- int r = ThreadLocalRandom.current().nextInt(); // randomize spins
- int spins = MAX_SPINS, h;
- while (tabAt(tab, i) == this && ((h = hash) & LOCKED) != 0) {
- if (spins >= 0) {
- r ^= r << 1; r ^= r >>> 3; r ^= r << 10; // xorshift
- if (r >= 0 && --spins == 0)
- Thread.yield(); // yield before block
- }
- else if (casHash(h, h | WAITING)) {
- synchronized (this) {
- if (tabAt(tab, i) == this &&
- (hash & WAITING) == WAITING) {
- try {
- wait();
- } catch (InterruptedException ie) {
- Thread.currentThread().interrupt();
- }
- }
- else
- notifyAll(); // possibly won race vs signaller
- }
- break;
- }
- }
- }
- }
-
- // Unsafe mechanics for casHash
- private static final sun.misc.Unsafe UNSAFE;
- private static final long hashOffset;
-
- static {
- try {
- UNSAFE = getUnsafe();
- Class k = Node.class;
- hashOffset = UNSAFE.objectFieldOffset
- (k.getDeclaredField("hash"));
- } catch (Exception e) {
- throw new Error(e);
- }
- }
- }
-
- /* ---------------- TreeBins -------------- */
-
- /**
- * Nodes for use in TreeBins
- */
- static final class TreeNode extends Node {
- TreeNode parent; // red-black tree links
- TreeNode left;
- TreeNode right;
- TreeNode prev; // needed to unlink next upon deletion
- boolean red;
-
- TreeNode(int hash, Object key, Object val, Node next, TreeNode parent) {
- super(hash, key, val, next);
- this.parent = parent;
- }
- }
-
- /**
- * A specialized form of red-black tree for use in bins
- * whose size exceeds a threshold.
- *
- * TreeBins use a special form of comparison for search and
- * related operations (which is the main reason we cannot use
- * existing collections such as TreeMaps). TreeBins contain
- * Comparable elements, but may contain others, as well as
- * elements that are Comparable but not necessarily Comparable
- * for the same T, so we cannot invoke compareTo among them. To
- * handle this, the tree is ordered primarily by hash value, then
- * by getClass().getName() order, and then by Comparator order
- * among elements of the same class. On lookup at a node, if
- * elements are not comparable or compare as 0, both left and
- * right children may need to be searched in the case of tied hash
- * values. (This corresponds to the full list search that would be
- * necessary if all elements were non-Comparable and had tied
- * hashes.) The red-black balancing code is updated from
- * pre-jdk-collections
- * (http://gee.cs.oswego.edu/dl/classes/collections/RBCell.java)
- * based in turn on Cormen, Leiserson, and Rivest "Introduction to
- * Algorithms" (CLR).
- *
- * TreeBins also maintain a separate locking discipline than
- * regular bins. Because they are forwarded via special MOVED
- * nodes at bin heads (which can never change once established),
- * we cannot use those nodes as locks. Instead, TreeBin
- * extends AbstractQueuedSynchronizer to support a simple form of
- * read-write lock. For update operations and table validation,
- * the exclusive form of lock behaves in the same way as bin-head
- * locks. However, lookups use shared read-lock mechanics to allow
- * multiple readers in the absence of writers. Additionally,
- * these lookups do not ever block: While the lock is not
- * available, they proceed along the slow traversal path (via
- * next-pointers) until the lock becomes available or the list is
- * exhausted, whichever comes first. (These cases are not fast,
- * but maximize aggregate expected throughput.) The AQS mechanics
- * for doing this are straightforward. The lock state is held as
- * AQS getState(). Read counts are negative; the write count (1)
- * is positive. There are no signalling preferences among readers
- * and writers. Since we don't need to export full Lock API, we
- * just override the minimal AQS methods and use them directly.
- */
- static final class TreeBin extends AbstractQueuedSynchronizer {
- private static final long serialVersionUID = 2249069246763182397L;
- transient TreeNode root; // root of tree
- transient TreeNode first; // head of next-pointer list
-
- /* AQS overrides */
- public final boolean isHeldExclusively() { return getState() > 0; }
- public final boolean tryAcquire(int ignore) {
- if (compareAndSetState(0, 1)) {
- setExclusiveOwnerThread(Thread.currentThread());
- return true;
- }
- return false;
- }
- public final boolean tryRelease(int ignore) {
- setExclusiveOwnerThread(null);
- setState(0);
- return true;
- }
- public final int tryAcquireShared(int ignore) {
- for (int c;;) {
- if ((c = getState()) > 0)
- return -1;
- if (compareAndSetState(c, c -1))
- return 1;
- }
- }
- public final boolean tryReleaseShared(int ignore) {
- int c;
- do {} while (!compareAndSetState(c = getState(), c + 1));
- return c == -1;
- }
-
- /** From CLR */
- private void rotateLeft(TreeNode p) {
- if (p != null) {
- TreeNode r = p.right, pp, rl;
- if ((rl = p.right = r.left) != null)
- rl.parent = p;
- if ((pp = r.parent = p.parent) == null)
- root = r;
- else if (pp.left == p)
- pp.left = r;
- else
- pp.right = r;
- r.left = p;
- p.parent = r;
- }
- }
-
- /** From CLR */
- private void rotateRight(TreeNode p) {
- if (p != null) {
- TreeNode l = p.left, pp, lr;
- if ((lr = p.left = l.right) != null)
- lr.parent = p;
- if ((pp = l.parent = p.parent) == null)
- root = l;
- else if (pp.right == p)
- pp.right = l;
- else
- pp.left = l;
- l.right = p;
- p.parent = l;
- }
- }
-
- @SuppressWarnings("unchecked") final TreeNode getTreeNode
- (int h, Object k, TreeNode p) {
- return getTreeNode(h, (RubyObject)k, p);
- }
-
- /**
- * Returns the TreeNode (or null if not found) for the given key
- * starting at given root.
- */
- @SuppressWarnings("unchecked") final TreeNode getTreeNode
- (int h, RubyObject k, TreeNode p) {
- RubyClass c = k.getMetaClass(); boolean kNotComparable = !k.respondsTo("<=>");
- while (p != null) {
- int dir, ph; RubyObject pk; RubyClass pc;
- if ((ph = p.hash) == h) {
- if ((pk = (RubyObject)p.key) == k || k.equals(pk))
- return p;
- if (c != (pc = (RubyClass)pk.getMetaClass()) ||
- kNotComparable ||
- (dir = rubyCompare(k, pk)) == 0) {
- dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
- if (dir == 0) { // if still stuck, need to check both sides
- TreeNode r = null, pl, pr;
- // try to recurse on the right
- if ((pr = p.right) != null && h >= pr.hash && (r = getTreeNode(h, k, pr)) != null)
- return r;
- // try to continue iterating on the left side
- else if ((pl = p.left) != null && h <= pl.hash)
- dir = -1;
- else // no matching node found
- return null;
- }
- }
- }
- else
- dir = (h < ph) ? -1 : 1;
- p = (dir > 0) ? p.right : p.left;
- }
- return null;
- }
-
- int rubyCompare(RubyObject l, RubyObject r) {
- ThreadContext context = l.getMetaClass().getRuntime().getCurrentContext();
- IRubyObject result;
- try {
- result = l.callMethod(context, "<=>", r);
- } catch (RaiseException e) {
- // handle objects "lying" about responding to <=>, ie: an Array containing non-comparable keys
- if (context.runtime.getNoMethodError().isInstance(e.getException())) {
- return 0;
- }
- throw e;
- }
-
- return result.isNil() ? 0 : RubyNumeric.num2int(result.convertToInteger());
- }
-
- /**
- * Wrapper for getTreeNode used by CHM.get. Tries to obtain
- * read-lock to call getTreeNode, but during failure to get
- * lock, searches along next links.
- */
- final Object getValue(int h, Object k) {
- Node r = null;
- int c = getState(); // Must read lock state first
- for (Node e = first; e != null; e = e.next) {
- if (c <= 0 && compareAndSetState(c, c - 1)) {
- try {
- r = getTreeNode(h, k, root);
- } finally {
- releaseShared(0);
- }
- break;
- }
- else if ((e.hash & HASH_BITS) == h && k.equals(e.key)) {
- r = e;
- break;
- }
- else
- c = getState();
- }
- return r == null ? null : r.val;
- }
-
- @SuppressWarnings("unchecked") final TreeNode putTreeNode
- (int h, Object k, Object v) {
- return putTreeNode(h, (RubyObject)k, v);
- }
-
- /**
- * Finds or adds a node.
- * @return null if added
- */
- @SuppressWarnings("unchecked") final TreeNode putTreeNode
- (int h, RubyObject k, Object v) {
- RubyClass c = k.getMetaClass();
- boolean kNotComparable = !k.respondsTo("<=>");
- TreeNode pp = root, p = null;
- int dir = 0;
- while (pp != null) { // find existing node or leaf to insert at
- int ph; RubyObject pk; RubyClass pc;
- p = pp;
- if ((ph = p.hash) == h) {
- if ((pk = (RubyObject)p.key) == k || k.equals(pk))
- return p;
- if (c != (pc = pk.getMetaClass()) ||
- kNotComparable ||
- (dir = rubyCompare(k, pk)) == 0) {
- dir = (c == pc) ? 0 : c.getName().compareTo(pc.getName());
- if (dir == 0) { // if still stuck, need to check both sides
- TreeNode r = null, pr;
- // try to recurse on the right
- if ((pr = p.right) != null && h >= pr.hash && (r = getTreeNode(h, k, pr)) != null)
- return r;
- else // continue descending down the left subtree
- dir = -1;
- }
- }
- }
- else
- dir = (h < ph) ? -1 : 1;
- pp = (dir > 0) ? p.right : p.left;
- }
-
- TreeNode f = first;
- TreeNode x = first = new TreeNode(h, (Object)k, v, f, p);
- if (p == null)
- root = x;
- else { // attach and rebalance; adapted from CLR
- TreeNode xp, xpp;
- if (f != null)
- f.prev = x;
- if (dir <= 0)
- p.left = x;
- else
- p.right = x;
- x.red = true;
- while (x != null && (xp = x.parent) != null && xp.red &&
- (xpp = xp.parent) != null) {
- TreeNode xppl = xpp.left;
- if (xp == xppl) {
- TreeNode y = xpp.right;
- if (y != null && y.red) {
- y.red = false;
- xp.red = false;
- xpp.red = true;
- x = xpp;
- }
- else {
- if (x == xp.right) {
- rotateLeft(x = xp);
- xpp = (xp = x.parent) == null ? null : xp.parent;
- }
- if (xp != null) {
- xp.red = false;
- if (xpp != null) {
- xpp.red = true;
- rotateRight(xpp);
- }
- }
- }
- }
- else {
- TreeNode y = xppl;
- if (y != null && y.red) {
- y.red = false;
- xp.red = false;
- xpp.red = true;
- x = xpp;
- }
- else {
- if (x == xp.left) {
- rotateRight(x = xp);
- xpp = (xp = x.parent) == null ? null : xp.parent;
- }
- if (xp != null) {
- xp.red = false;
- if (xpp != null) {
- xpp.red = true;
- rotateLeft(xpp);
- }
- }
- }
- }
- }
- TreeNode r = root;
- if (r != null && r.red)
- r.red = false;
- }
- return null;
- }
-
- /**
- * Removes the given node, that must be present before this
- * call. This is messier than typical red-black deletion code
- * because we cannot swap the contents of an interior node
- * with a leaf successor that is pinned by "next" pointers
- * that are accessible independently of lock. So instead we
- * swap the tree linkages.
- */
- final void deleteTreeNode(TreeNode p) {
- TreeNode next = (TreeNode)p.next; // unlink traversal pointers
- TreeNode pred = p.prev;
- if (pred == null)
- first = next;
- else
- pred.next = next;
- if (next != null)
- next.prev = pred;
- TreeNode replacement;
- TreeNode pl = p.left;
- TreeNode pr = p.right;
- if (pl != null && pr != null) {
- TreeNode s = pr, sl;
- while ((sl = s.left) != null) // find successor
- s = sl;
- boolean c = s.red; s.red = p.red; p.red = c; // swap colors
- TreeNode sr = s.right;
- TreeNode pp = p.parent;
- if (s == pr) { // p was s's direct parent
- p.parent = s;
- s.right = p;
- }
- else {
- TreeNode sp = s.parent;
- if ((p.parent = sp) != null) {
- if (s == sp.left)
- sp.left = p;
- else
- sp.right = p;
- }
- if ((s.right = pr) != null)
- pr.parent = s;
- }
- p.left = null;
- if ((p.right = sr) != null)
- sr.parent = p;
- if ((s.left = pl) != null)
- pl.parent = s;
- if ((s.parent = pp) == null)
- root = s;
- else if (p == pp.left)
- pp.left = s;
- else
- pp.right = s;
- replacement = sr;
- }
- else
- replacement = (pl != null) ? pl : pr;
- TreeNode pp = p.parent;
- if (replacement == null) {
- if (pp == null) {
- root = null;
- return;
- }
- replacement = p;
- }
- else {
- replacement.parent = pp;
- if (pp == null)
- root = replacement;
- else if (p == pp.left)
- pp.left = replacement;
- else
- pp.right = replacement;
- p.left = p.right = p.parent = null;
- }
- if (!p.red) { // rebalance, from CLR
- TreeNode x = replacement;
- while (x != null) {
- TreeNode xp, xpl;
- if (x.red || (xp = x.parent) == null) {
- x.red = false;
- break;
- }
- if (x == (xpl = xp.left)) {
- TreeNode sib = xp.right;
- if (sib != null && sib.red) {
- sib.red = false;
- xp.red = true;
- rotateLeft(xp);
- sib = (xp = x.parent) == null ? null : xp.right;
- }
- if (sib == null)
- x = xp;
- else {
- TreeNode sl = sib.left, sr = sib.right;
- if ((sr == null || !sr.red) &&
- (sl == null || !sl.red)) {
- sib.red = true;
- x = xp;
- }
- else {
- if (sr == null || !sr.red) {
- if (sl != null)
- sl.red = false;
- sib.red = true;
- rotateRight(sib);
- sib = (xp = x.parent) == null ? null : xp.right;
- }
- if (sib != null) {
- sib.red = (xp == null) ? false : xp.red;
- if ((sr = sib.right) != null)
- sr.red = false;
- }
- if (xp != null) {
- xp.red = false;
- rotateLeft(xp);
- }
- x = root;
- }
- }
- }
- else { // symmetric
- TreeNode sib = xpl;
- if (sib != null && sib.red) {
- sib.red = false;
- xp.red = true;
- rotateRight(xp);
- sib = (xp = x.parent) == null ? null : xp.left;
- }
- if (sib == null)
- x = xp;
- else {
- TreeNode sl = sib.left, sr = sib.right;
- if ((sl == null || !sl.red) &&
- (sr == null || !sr.red)) {
- sib.red = true;
- x = xp;
- }
- else {
- if (sl == null || !sl.red) {
- if (sr != null)
- sr.red = false;
- sib.red = true;
- rotateLeft(sib);
- sib = (xp = x.parent) == null ? null : xp.left;
- }
- if (sib != null) {
- sib.red = (xp == null) ? false : xp.red;
- if ((sl = sib.left) != null)
- sl.red = false;
- }
- if (xp != null) {
- xp.red = false;
- rotateRight(xp);
- }
- x = root;
- }
- }
- }
- }
- }
- if (p == replacement && (pp = p.parent) != null) {
- if (p == pp.left) // detach pointers
- pp.left = null;
- else if (p == pp.right)
- pp.right = null;
- p.parent = null;
- }
- }
- }
-
- /* ---------------- Collision reduction methods -------------- */
-
- /**
- * Spreads higher bits to lower, and also forces top 2 bits to 0.
- * Because the table uses power-of-two masking, sets of hashes
- * that vary only in bits above the current mask will always
- * collide. (Among known examples are sets of Float keys holding
- * consecutive whole numbers in small tables.) To counter this,
- * we apply a transform that spreads the impact of higher bits
- * downward. There is a tradeoff between speed, utility, and
- * quality of bit-spreading. Because many common sets of hashes
- * are already reasonably distributed across bits (so don't benefit
- * from spreading), and because we use trees to handle large sets
- * of collisions in bins, we don't need excessively high quality.
- */
- private static final int spread(int h) {
- h ^= (h >>> 18) ^ (h >>> 12);
- return (h ^ (h >>> 10)) & HASH_BITS;
- }
-
- /**
- * Replaces a list bin with a tree bin. Call only when locked.
- * Fails to replace if the given key is non-comparable or table
- * is, or needs, resizing.
- */
- private final void replaceWithTreeBin(Node[] tab, int index, Object key) {
- if ((key instanceof Comparable) &&
- (tab.length >= MAXIMUM_CAPACITY || counter.sum() < (long)sizeCtl)) {
- TreeBin t = new TreeBin();
- for (Node e = tabAt(tab, index); e != null; e = e.next)
- t.putTreeNode(e.hash & HASH_BITS, e.key, e.val);
- setTabAt(tab, index, new Node(MOVED, t, null, null));
- }
- }
-
- /* ---------------- Internal access and update methods -------------- */
-
- /** Implementation for get and containsKey */
- private final Object internalGet(Object k) {
- int h = spread(k.hashCode());
- retry: for (Node[] tab = table; tab != null;) {
- Node e, p; Object ek, ev; int eh; // locals to read fields once
- for (e = tabAt(tab, (tab.length - 1) & h); e != null; e = e.next) {
- if ((eh = e.hash) == MOVED) {
- if ((ek = e.key) instanceof TreeBin) // search TreeBin
- return ((TreeBin)ek).getValue(h, k);
- else { // restart with new table
- tab = (Node[])ek;
- continue retry;
- }
- }
- else if ((eh & HASH_BITS) == h && (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek)))
- return ev;
- }
- break;
- }
- return null;
- }
-
- /**
- * Implementation for the four public remove/replace methods:
- * Replaces node value with v, conditional upon match of cv if
- * non-null. If resulting value is null, delete.
- */
- private final Object internalReplace(Object k, Object v, Object cv) {
- int h = spread(k.hashCode());
- Object oldVal = null;
- for (Node[] tab = table;;) {
- Node f; int i, fh; Object fk;
- if (tab == null ||
- (f = tabAt(tab, i = (tab.length - 1) & h)) == null)
- break;
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- boolean validated = false;
- boolean deleted = false;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- validated = true;
- TreeNode p = t.getTreeNode(h, k, t.root);
- if (p != null) {
- Object pv = p.val;
- if (cv == null || cv == pv || cv.equals(pv)) {
- oldVal = pv;
- if ((p.val = v) == null) {
- deleted = true;
- t.deleteTreeNode(p);
- }
- }
- }
- }
- } finally {
- t.release(0);
- }
- if (validated) {
- if (deleted)
- counter.add(-1L);
- break;
- }
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & HASH_BITS) != h && f.next == null) // precheck
- break; // rules out possible existence
- else if ((fh & LOCKED) != 0) {
- checkForResize(); // try resizing if can't get lock
- f.tryAwaitLock(tab, i);
- }
- else if (f.casHash(fh, fh | LOCKED)) {
- boolean validated = false;
- boolean deleted = false;
- try {
- if (tabAt(tab, i) == f) {
- validated = true;
- for (Node e = f, pred = null;;) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h &&
- ((ev = e.val) != null) &&
- ((ek = e.key) == k || k.equals(ek))) {
- if (cv == null || cv == ev || cv.equals(ev)) {
- oldVal = ev;
- if ((e.val = v) == null) {
- deleted = true;
- Node en = e.next;
- if (pred != null)
- pred.next = en;
- else
- setTabAt(tab, i, en);
- }
- }
- break;
- }
- pred = e;
- if ((e = e.next) == null)
- break;
- }
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (validated) {
- if (deleted)
- counter.add(-1L);
- break;
- }
- }
- }
- return oldVal;
- }
-
- /*
- * Internal versions of the six insertion methods, each a
- * little more complicated than the last. All have
- * the same basic structure as the first (internalPut):
- * 1. If table uninitialized, create
- * 2. If bin empty, try to CAS new node
- * 3. If bin stale, use new table
- * 4. if bin converted to TreeBin, validate and relay to TreeBin methods
- * 5. Lock and validate; if valid, scan and add or update
- *
- * The others interweave other checks and/or alternative actions:
- * * Plain put checks for and performs resize after insertion.
- * * putIfAbsent prescans for mapping without lock (and fails to add
- * if present), which also makes pre-emptive resize checks worthwhile.
- * * computeIfAbsent extends form used in putIfAbsent with additional
- * mechanics to deal with, calls, potential exceptions and null
- * returns from function call.
- * * compute uses the same function-call mechanics, but without
- * the prescans
- * * merge acts as putIfAbsent in the absent case, but invokes the
- * update function if present
- * * putAll attempts to pre-allocate enough table space
- * and more lazily performs count updates and checks.
- *
- * Someday when details settle down a bit more, it might be worth
- * some factoring to reduce sprawl.
- */
-
- /** Implementation for put */
- private final Object internalPut(Object k, Object v) {
- int h = spread(k.hashCode());
- int count = 0;
- for (Node[] tab = table;;) {
- int i; Node f; int fh; Object fk;
- if (tab == null)
- tab = initTable();
- else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
- if (casTabAt(tab, i, null, new Node(h, k, v, null)))
- break; // no lock when adding to empty bin
- }
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- Object oldVal = null;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- count = 2;
- TreeNode p = t.putTreeNode(h, k, v);
- if (p != null) {
- oldVal = p.val;
- p.val = v;
- }
- }
- } finally {
- t.release(0);
- }
- if (count != 0) {
- if (oldVal != null)
- return oldVal;
- break;
- }
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & LOCKED) != 0) {
- checkForResize();
- f.tryAwaitLock(tab, i);
- }
- else if (f.casHash(fh, fh | LOCKED)) {
- Object oldVal = null;
- try { // needed in case equals() throws
- if (tabAt(tab, i) == f) {
- count = 1;
- for (Node e = f;; ++count) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h &&
- (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek))) {
- oldVal = ev;
- e.val = v;
- break;
- }
- Node last = e;
- if ((e = e.next) == null) {
- last.next = new Node(h, k, v, null);
- if (count >= TREE_THRESHOLD)
- replaceWithTreeBin(tab, i, k);
- break;
- }
- }
- }
- } finally { // unlock and signal if needed
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (count != 0) {
- if (oldVal != null)
- return oldVal;
- if (tab.length <= 64)
- count = 2;
- break;
- }
- }
- }
- counter.add(1L);
- if (count > 1)
- checkForResize();
- return null;
- }
-
- /** Implementation for putIfAbsent */
- private final Object internalPutIfAbsent(Object k, Object v) {
- int h = spread(k.hashCode());
- int count = 0;
- for (Node[] tab = table;;) {
- int i; Node f; int fh; Object fk, fv;
- if (tab == null)
- tab = initTable();
- else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
- if (casTabAt(tab, i, null, new Node(h, k, v, null)))
- break;
- }
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- Object oldVal = null;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- count = 2;
- TreeNode p = t.putTreeNode(h, k, v);
- if (p != null)
- oldVal = p.val;
- }
- } finally {
- t.release(0);
- }
- if (count != 0) {
- if (oldVal != null)
- return oldVal;
- break;
- }
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
- ((fk = f.key) == k || k.equals(fk)))
- return fv;
- else {
- Node g = f.next;
- if (g != null) { // at least 2 nodes -- search and maybe resize
- for (Node e = g;;) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek)))
- return ev;
- if ((e = e.next) == null) {
- checkForResize();
- break;
- }
- }
- }
- if (((fh = f.hash) & LOCKED) != 0) {
- checkForResize();
- f.tryAwaitLock(tab, i);
- }
- else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
- Object oldVal = null;
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- for (Node e = f;; ++count) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h &&
- (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek))) {
- oldVal = ev;
- break;
- }
- Node last = e;
- if ((e = e.next) == null) {
- last.next = new Node(h, k, v, null);
- if (count >= TREE_THRESHOLD)
- replaceWithTreeBin(tab, i, k);
- break;
- }
- }
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (count != 0) {
- if (oldVal != null)
- return oldVal;
- if (tab.length <= 64)
- count = 2;
- break;
- }
- }
- }
- }
- counter.add(1L);
- if (count > 1)
- checkForResize();
- return null;
- }
-
- /** Implementation for computeIfAbsent */
- private final Object internalComputeIfAbsent(K k,
- Fun mf) {
- int h = spread(k.hashCode());
- Object val = null;
- int count = 0;
- for (Node[] tab = table;;) {
- Node f; int i, fh; Object fk, fv;
- if (tab == null)
- tab = initTable();
- else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
- Node node = new Node(fh = h | LOCKED, k, null, null);
- if (casTabAt(tab, i, null, node)) {
- count = 1;
- try {
- if ((val = mf.apply(k)) != null)
- node.val = val;
- } finally {
- if (val == null)
- setTabAt(tab, i, null);
- if (!node.casHash(fh, h)) {
- node.hash = h;
- synchronized (node) { node.notifyAll(); };
- }
- }
- }
- if (count != 0)
- break;
- }
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- boolean added = false;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- TreeNode p = t.getTreeNode(h, k, t.root);
- if (p != null)
- val = p.val;
- else if ((val = mf.apply(k)) != null) {
- added = true;
- count = 2;
- t.putTreeNode(h, k, val);
- }
- }
- } finally {
- t.release(0);
- }
- if (count != 0) {
- if (!added)
- return val;
- break;
- }
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & HASH_BITS) == h && (fv = f.val) != null &&
- ((fk = f.key) == k || k.equals(fk)))
- return fv;
- else {
- Node g = f.next;
- if (g != null) {
- for (Node e = g;;) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h && (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek)))
- return ev;
- if ((e = e.next) == null) {
- checkForResize();
- break;
- }
- }
- }
- if (((fh = f.hash) & LOCKED) != 0) {
- checkForResize();
- f.tryAwaitLock(tab, i);
- }
- else if (tabAt(tab, i) == f && f.casHash(fh, fh | LOCKED)) {
- boolean added = false;
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- for (Node e = f;; ++count) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h &&
- (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek))) {
- val = ev;
- break;
- }
- Node last = e;
- if ((e = e.next) == null) {
- if ((val = mf.apply(k)) != null) {
- added = true;
- last.next = new Node(h, k, val, null);
- if (count >= TREE_THRESHOLD)
- replaceWithTreeBin(tab, i, k);
- }
- break;
- }
- }
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (count != 0) {
- if (!added)
- return val;
- if (tab.length <= 64)
- count = 2;
- break;
- }
- }
- }
- }
- if (val != null) {
- counter.add(1L);
- if (count > 1)
- checkForResize();
- }
- return val;
- }
-
- /** Implementation for compute */
- @SuppressWarnings("unchecked") private final Object internalCompute
- (K k, boolean onlyIfPresent, BiFun mf) {
- int h = spread(k.hashCode());
- Object val = null;
- int delta = 0;
- int count = 0;
- for (Node[] tab = table;;) {
- Node f; int i, fh; Object fk;
- if (tab == null)
- tab = initTable();
- else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
- if (onlyIfPresent)
- break;
- Node node = new Node(fh = h | LOCKED, k, null, null);
- if (casTabAt(tab, i, null, node)) {
- try {
- count = 1;
- if ((val = mf.apply(k, null)) != null) {
- node.val = val;
- delta = 1;
- }
- } finally {
- if (delta == 0)
- setTabAt(tab, i, null);
- if (!node.casHash(fh, h)) {
- node.hash = h;
- synchronized (node) { node.notifyAll(); };
- }
- }
- }
- if (count != 0)
- break;
- }
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- TreeNode p = t.getTreeNode(h, k, t.root);
- Object pv;
- if (p == null) {
- if (onlyIfPresent)
- break;
- pv = null;
- } else
- pv = p.val;
- if ((val = mf.apply(k, (V)pv)) != null) {
- if (p != null)
- p.val = val;
- else {
- count = 2;
- delta = 1;
- t.putTreeNode(h, k, val);
- }
- }
- else if (p != null) {
- delta = -1;
- t.deleteTreeNode(p);
- }
- }
- } finally {
- t.release(0);
- }
- if (count != 0)
- break;
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & LOCKED) != 0) {
- checkForResize();
- f.tryAwaitLock(tab, i);
- }
- else if (f.casHash(fh, fh | LOCKED)) {
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- for (Node e = f, pred = null;; ++count) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h &&
- (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek))) {
- val = mf.apply(k, (V)ev);
- if (val != null)
- e.val = val;
- else {
- delta = -1;
- Node en = e.next;
- if (pred != null)
- pred.next = en;
- else
- setTabAt(tab, i, en);
- }
- break;
- }
- pred = e;
- if ((e = e.next) == null) {
- if (!onlyIfPresent && (val = mf.apply(k, null)) != null) {
- pred.next = new Node(h, k, val, null);
- delta = 1;
- if (count >= TREE_THRESHOLD)
- replaceWithTreeBin(tab, i, k);
- }
- break;
- }
- }
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (count != 0) {
- if (tab.length <= 64)
- count = 2;
- break;
- }
- }
- }
- if (delta != 0) {
- counter.add((long)delta);
- if (count > 1)
- checkForResize();
- }
- return val;
- }
-
- /** Implementation for merge */
- @SuppressWarnings("unchecked") private final Object internalMerge
- (K k, V v, BiFun mf) {
- int h = spread(k.hashCode());
- Object val = null;
- int delta = 0;
- int count = 0;
- for (Node[] tab = table;;) {
- int i; Node f; int fh; Object fk, fv;
- if (tab == null)
- tab = initTable();
- else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null) {
- if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
- delta = 1;
- val = v;
- break;
- }
- }
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- TreeNode p = t.getTreeNode(h, k, t.root);
- val = (p == null) ? v : mf.apply((V)p.val, v);
- if (val != null) {
- if (p != null)
- p.val = val;
- else {
- count = 2;
- delta = 1;
- t.putTreeNode(h, k, val);
- }
- }
- else if (p != null) {
- delta = -1;
- t.deleteTreeNode(p);
- }
- }
- } finally {
- t.release(0);
- }
- if (count != 0)
- break;
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & LOCKED) != 0) {
- checkForResize();
- f.tryAwaitLock(tab, i);
- }
- else if (f.casHash(fh, fh | LOCKED)) {
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- for (Node e = f, pred = null;; ++count) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h &&
- (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek))) {
- val = mf.apply((V)ev, v);
- if (val != null)
- e.val = val;
- else {
- delta = -1;
- Node en = e.next;
- if (pred != null)
- pred.next = en;
- else
- setTabAt(tab, i, en);
- }
- break;
- }
- pred = e;
- if ((e = e.next) == null) {
- val = v;
- pred.next = new Node(h, k, val, null);
- delta = 1;
- if (count >= TREE_THRESHOLD)
- replaceWithTreeBin(tab, i, k);
- break;
- }
- }
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (count != 0) {
- if (tab.length <= 64)
- count = 2;
- break;
- }
- }
- }
- if (delta != 0) {
- counter.add((long)delta);
- if (count > 1)
- checkForResize();
- }
- return val;
- }
-
- /** Implementation for putAll */
- private final void internalPutAll(Map m) {
- tryPresize(m.size());
- long delta = 0L; // number of uncommitted additions
- boolean npe = false; // to throw exception on exit for nulls
- try { // to clean up counts on other exceptions
- for (Map.Entry entry : m.entrySet()) {
- Object k, v;
- if (entry == null || (k = entry.getKey()) == null ||
- (v = entry.getValue()) == null) {
- npe = true;
- break;
- }
- int h = spread(k.hashCode());
- for (Node[] tab = table;;) {
- int i; Node f; int fh; Object fk;
- if (tab == null)
- tab = initTable();
- else if ((f = tabAt(tab, i = (tab.length - 1) & h)) == null){
- if (casTabAt(tab, i, null, new Node(h, k, v, null))) {
- ++delta;
- break;
- }
- }
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- boolean validated = false;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- validated = true;
- TreeNode p = t.getTreeNode(h, k, t.root);
- if (p != null)
- p.val = v;
- else {
- t.putTreeNode(h, k, v);
- ++delta;
- }
- }
- } finally {
- t.release(0);
- }
- if (validated)
- break;
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & LOCKED) != 0) {
- counter.add(delta);
- delta = 0L;
- checkForResize();
- f.tryAwaitLock(tab, i);
- }
- else if (f.casHash(fh, fh | LOCKED)) {
- int count = 0;
- try {
- if (tabAt(tab, i) == f) {
- count = 1;
- for (Node e = f;; ++count) {
- Object ek, ev;
- if ((e.hash & HASH_BITS) == h &&
- (ev = e.val) != null &&
- ((ek = e.key) == k || k.equals(ek))) {
- e.val = v;
- break;
- }
- Node last = e;
- if ((e = e.next) == null) {
- ++delta;
- last.next = new Node(h, k, v, null);
- if (count >= TREE_THRESHOLD)
- replaceWithTreeBin(tab, i, k);
- break;
- }
- }
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (count != 0) {
- if (count > 1) {
- counter.add(delta);
- delta = 0L;
- checkForResize();
- }
- break;
- }
- }
- }
- }
- } finally {
- if (delta != 0)
- counter.add(delta);
- }
- if (npe)
- throw new NullPointerException();
- }
-
- /* ---------------- Table Initialization and Resizing -------------- */
-
- /**
- * Returns a power of two table size for the given desired capacity.
- * See Hackers Delight, sec 3.2
- */
- private static final int tableSizeFor(int c) {
- int n = c - 1;
- n |= n >>> 1;
- n |= n >>> 2;
- n |= n >>> 4;
- n |= n >>> 8;
- n |= n >>> 16;
- return (n < 0) ? 1 : (n >= MAXIMUM_CAPACITY) ? MAXIMUM_CAPACITY : n + 1;
- }
-
- /**
- * Initializes table, using the size recorded in sizeCtl.
- */
- private final Node[] initTable() {
- Node[] tab; int sc;
- while ((tab = table) == null) {
- if ((sc = sizeCtl) < 0)
- Thread.yield(); // lost initialization race; just spin
- else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
- try {
- if ((tab = table) == null) {
- int n = (sc > 0) ? sc : DEFAULT_CAPACITY;
- tab = table = new Node[n];
- sc = n - (n >>> 2);
- }
- } finally {
- sizeCtl = sc;
- }
- break;
- }
- }
- return tab;
- }
-
- /**
- * If table is too small and not already resizing, creates next
- * table and transfers bins. Rechecks occupancy after a transfer
- * to see if another resize is already needed because resizings
- * are lagging additions.
- */
- private final void checkForResize() {
- Node[] tab; int n, sc;
- while ((tab = table) != null &&
- (n = tab.length) < MAXIMUM_CAPACITY &&
- (sc = sizeCtl) >= 0 && counter.sum() >= (long)sc &&
- UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
- try {
- if (tab == table) {
- table = rebuild(tab);
- sc = (n << 1) - (n >>> 1);
- }
- } finally {
- sizeCtl = sc;
- }
- }
- }
-
- /**
- * Tries to presize table to accommodate the given number of elements.
- *
- * @param size number of elements (doesn't need to be perfectly accurate)
- */
- private final void tryPresize(int size) {
- int c = (size >= (MAXIMUM_CAPACITY >>> 1)) ? MAXIMUM_CAPACITY :
- tableSizeFor(size + (size >>> 1) + 1);
- int sc;
- while ((sc = sizeCtl) >= 0) {
- Node[] tab = table; int n;
- if (tab == null || (n = tab.length) == 0) {
- n = (sc > c) ? sc : c;
- if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
- try {
- if (table == tab) {
- table = new Node[n];
- sc = n - (n >>> 2);
- }
- } finally {
- sizeCtl = sc;
- }
- }
- }
- else if (c <= sc || n >= MAXIMUM_CAPACITY)
- break;
- else if (UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
- try {
- if (table == tab) {
- table = rebuild(tab);
- sc = (n << 1) - (n >>> 1);
- }
- } finally {
- sizeCtl = sc;
- }
- }
- }
- }
-
- /*
- * Moves and/or copies the nodes in each bin to new table. See
- * above for explanation.
- *
- * @return the new table
- */
- private static final Node[] rebuild(Node[] tab) {
- int n = tab.length;
- Node[] nextTab = new Node[n << 1];
- Node fwd = new Node(MOVED, nextTab, null, null);
- int[] buffer = null; // holds bins to revisit; null until needed
- Node rev = null; // reverse forwarder; null until needed
- int nbuffered = 0; // the number of bins in buffer list
- int bufferIndex = 0; // buffer index of current buffered bin
- int bin = n - 1; // current non-buffered bin or -1 if none
-
- for (int i = bin;;) { // start upwards sweep
- int fh; Node f;
- if ((f = tabAt(tab, i)) == null) {
- if (bin >= 0) { // Unbuffered; no lock needed (or available)
- if (!casTabAt(tab, i, f, fwd))
- continue;
- }
- else { // transiently use a locked forwarding node
- Node g = new Node(MOVED|LOCKED, nextTab, null, null);
- if (!casTabAt(tab, i, f, g))
- continue;
- setTabAt(nextTab, i, null);
- setTabAt(nextTab, i + n, null);
- setTabAt(tab, i, fwd);
- if (!g.casHash(MOVED|LOCKED, MOVED)) {
- g.hash = MOVED;
- synchronized (g) { g.notifyAll(); }
- }
- }
- }
- else if ((fh = f.hash) == MOVED) {
- Object fk = f.key;
- if (fk instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- boolean validated = false;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- validated = true;
- splitTreeBin(nextTab, i, t);
- setTabAt(tab, i, fwd);
- }
- } finally {
- t.release(0);
- }
- if (!validated)
- continue;
- }
- }
- else if ((fh & LOCKED) == 0 && f.casHash(fh, fh|LOCKED)) {
- boolean validated = false;
- try { // split to lo and hi lists; copying as needed
- if (tabAt(tab, i) == f) {
- validated = true;
- splitBin(nextTab, i, f);
- setTabAt(tab, i, fwd);
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- if (!validated)
- continue;
- }
- else {
- if (buffer == null) // initialize buffer for revisits
- buffer = new int[TRANSFER_BUFFER_SIZE];
- if (bin < 0 && bufferIndex > 0) {
- int j = buffer[--bufferIndex];
- buffer[bufferIndex] = i;
- i = j; // swap with another bin
- continue;
- }
- if (bin < 0 || nbuffered >= TRANSFER_BUFFER_SIZE) {
- f.tryAwaitLock(tab, i);
- continue; // no other options -- block
- }
- if (rev == null) // initialize reverse-forwarder
- rev = new Node(MOVED, tab, null, null);
- if (tabAt(tab, i) != f || (f.hash & LOCKED) == 0)
- continue; // recheck before adding to list
- buffer[nbuffered++] = i;
- setTabAt(nextTab, i, rev); // install place-holders
- setTabAt(nextTab, i + n, rev);
- }
-
- if (bin > 0)
- i = --bin;
- else if (buffer != null && nbuffered > 0) {
- bin = -1;
- i = buffer[bufferIndex = --nbuffered];
- }
- else
- return nextTab;
- }
- }
-
- /**
- * Splits a normal bin with list headed by e into lo and hi parts;
- * installs in given table.
- */
- private static void splitBin(Node[] nextTab, int i, Node e) {
- int bit = nextTab.length >>> 1; // bit to split on
- int runBit = e.hash & bit;
- Node lastRun = e, lo = null, hi = null;
- for (Node p = e.next; p != null; p = p.next) {
- int b = p.hash & bit;
- if (b != runBit) {
- runBit = b;
- lastRun = p;
- }
- }
- if (runBit == 0)
- lo = lastRun;
- else
- hi = lastRun;
- for (Node p = e; p != lastRun; p = p.next) {
- int ph = p.hash & HASH_BITS;
- Object pk = p.key, pv = p.val;
- if ((ph & bit) == 0)
- lo = new Node(ph, pk, pv, lo);
- else
- hi = new Node(ph, pk, pv, hi);
- }
- setTabAt(nextTab, i, lo);
- setTabAt(nextTab, i + bit, hi);
- }
-
- /**
- * Splits a tree bin into lo and hi parts; installs in given table.
- */
- private static void splitTreeBin(Node[] nextTab, int i, TreeBin t) {
- int bit = nextTab.length >>> 1;
- TreeBin lt = new TreeBin();
- TreeBin ht = new TreeBin();
- int lc = 0, hc = 0;
- for (Node e = t.first; e != null; e = e.next) {
- int h = e.hash & HASH_BITS;
- Object k = e.key, v = e.val;
- if ((h & bit) == 0) {
- ++lc;
- lt.putTreeNode(h, k, v);
- }
- else {
- ++hc;
- ht.putTreeNode(h, k, v);
- }
- }
- Node ln, hn; // throw away trees if too small
- if (lc <= (TREE_THRESHOLD >>> 1)) {
- ln = null;
- for (Node p = lt.first; p != null; p = p.next)
- ln = new Node(p.hash, p.key, p.val, ln);
- }
- else
- ln = new Node(MOVED, lt, null, null);
- setTabAt(nextTab, i, ln);
- if (hc <= (TREE_THRESHOLD >>> 1)) {
- hn = null;
- for (Node p = ht.first; p != null; p = p.next)
- hn = new Node(p.hash, p.key, p.val, hn);
- }
- else
- hn = new Node(MOVED, ht, null, null);
- setTabAt(nextTab, i + bit, hn);
- }
-
- /**
- * Implementation for clear. Steps through each bin, removing all
- * nodes.
- */
- private final void internalClear() {
- long delta = 0L; // negative number of deletions
- int i = 0;
- Node[] tab = table;
- while (tab != null && i < tab.length) {
- int fh; Object fk;
- Node f = tabAt(tab, i);
- if (f == null)
- ++i;
- else if ((fh = f.hash) == MOVED) {
- if ((fk = f.key) instanceof TreeBin) {
- TreeBin t = (TreeBin)fk;
- t.acquire(0);
- try {
- if (tabAt(tab, i) == f) {
- for (Node p = t.first; p != null; p = p.next) {
- if (p.val != null) { // (currently always true)
- p.val = null;
- --delta;
- }
- }
- t.first = null;
- t.root = null;
- ++i;
- }
- } finally {
- t.release(0);
- }
- }
- else
- tab = (Node[])fk;
- }
- else if ((fh & LOCKED) != 0) {
- counter.add(delta); // opportunistically update count
- delta = 0L;
- f.tryAwaitLock(tab, i);
- }
- else if (f.casHash(fh, fh | LOCKED)) {
- try {
- if (tabAt(tab, i) == f) {
- for (Node e = f; e != null; e = e.next) {
- if (e.val != null) { // (currently always true)
- e.val = null;
- --delta;
- }
- }
- setTabAt(tab, i, null);
- ++i;
- }
- } finally {
- if (!f.casHash(fh | LOCKED, fh)) {
- f.hash = fh;
- synchronized (f) { f.notifyAll(); };
- }
- }
- }
- }
- if (delta != 0)
- counter.add(delta);
- }
-
- /* ----------------Table Traversal -------------- */
-
- /**
- * Encapsulates traversal for methods such as containsValue; also
- * serves as a base class for other iterators and bulk tasks.
- *
- * At each step, the iterator snapshots the key ("nextKey") and
- * value ("nextVal") of a valid node (i.e., one that, at point of
- * snapshot, has a non-null user value). Because val fields can
- * change (including to null, indicating deletion), field nextVal
- * might not be accurate at point of use, but still maintains the
- * weak consistency property of holding a value that was once
- * valid. To support iterator.remove, the nextKey field is not
- * updated (nulled out) when the iterator cannot advance.
- *
- * Internal traversals directly access these fields, as in:
- * {@code while (it.advance() != null) { process(it.nextKey); }}
- *
- * Exported iterators must track whether the iterator has advanced
- * (in hasNext vs next) (by setting/checking/nulling field
- * nextVal), and then extract key, value, or key-value pairs as
- * return values of next().
- *
- * The iterator visits once each still-valid node that was
- * reachable upon iterator construction. It might miss some that
- * were added to a bin after the bin was visited, which is OK wrt
- * consistency guarantees. Maintaining this property in the face
- * of possible ongoing resizes requires a fair amount of
- * bookkeeping state that is difficult to optimize away amidst
- * volatile accesses. Even so, traversal maintains reasonable
- * throughput.
- *
- * Normally, iteration proceeds bin-by-bin traversing lists.
- * However, if the table has been resized, then all future steps
- * must traverse both the bin at the current index as well as at
- * (index + baseSize); and so on for further resizings. To
- * paranoically cope with potential sharing by users of iterators
- * across threads, iteration terminates if a bounds checks fails
- * for a table read.
- *
- * This class extends ForkJoinTask to streamline parallel
- * iteration in bulk operations (see BulkTask). This adds only an
- * int of space overhead, which is close enough to negligible in
- * cases where it is not needed to not worry about it. Because
- * ForkJoinTask is Serializable, but iterators need not be, we
- * need to add warning suppressions.
- */
- @SuppressWarnings("serial") static class Traverser {
- final ConcurrentHashMapV8 map;
- Node next; // the next entry to use
- K nextKey; // cached key field of next
- V nextVal; // cached val field of next
- Node[] tab; // current table; updated if resized
- int index; // index of bin to use next
- int baseIndex; // current index of initial table
- int baseLimit; // index bound for initial table
- int baseSize; // initial table size
-
- /** Creates iterator for all entries in the table. */
- Traverser(ConcurrentHashMapV8 map) {
- this.map = map;
- }
-
- /** Creates iterator for split() methods */
- Traverser(Traverser it) {
- ConcurrentHashMapV8 m; Node[] t;
- if ((m = this.map = it.map) == null)
- t = null;
- else if ((t = it.tab) == null && // force parent tab initialization
- (t = it.tab = m.table) != null)
- it.baseLimit = it.baseSize = t.length;
- this.tab = t;
- this.baseSize = it.baseSize;
- it.baseLimit = this.index = this.baseIndex =
- ((this.baseLimit = it.baseLimit) + it.baseIndex + 1) >>> 1;
- }
-
- /**
- * Advances next; returns nextVal or null if terminated.
- * See above for explanation.
- */
- final V advance() {
- Node e = next;
- V ev = null;
- outer: do {
- if (e != null) // advance past used/skipped node
- e = e.next;
- while (e == null) { // get to next non-null bin
- ConcurrentHashMapV8 m;
- Node[] t; int b, i, n; Object ek; // checks must use locals
- if ((t = tab) != null)
- n = t.length;
- else if ((m = map) != null && (t = tab = m.table) != null)
- n = baseLimit = baseSize = t.length;
- else
- break outer;
- if ((b = baseIndex) >= baseLimit ||
- (i = index) < 0 || i >= n)
- break outer;
- if ((e = tabAt(t, i)) != null && e.hash == MOVED) {
- if ((ek = e.key) instanceof TreeBin)
- e = ((TreeBin)ek).first;
- else {
- tab = (Node[])ek;
- continue; // restarts due to null val
- }
- } // visit upper slots if present
- index = (i += baseSize) < n ? i : (baseIndex = b + 1);
- }
- nextKey = (K) e.key;
- } while ((ev = (V) e.val) == null); // skip deleted or special nodes
- next = e;
- return nextVal = ev;
- }
-
- public final void remove() {
- Object k = nextKey;
- if (k == null && (advance() == null || (k = nextKey) == null))
- throw new IllegalStateException();
- map.internalReplace(k, null, null);
- }
-
- public final boolean hasNext() {
- return nextVal != null || advance() != null;
- }
-
- public final boolean hasMoreElements() { return hasNext(); }
- public final void setRawResult(Object x) { }
- public R getRawResult() { return null; }
- public boolean exec() { return true; }
- }
-
- /* ---------------- Public operations -------------- */
-
- /**
- * Creates a new, empty map with the default initial table size (16).
- */
- public ConcurrentHashMapV8() {
- this.counter = new LongAdder();
- }
-
- /**
- * Creates a new, empty map with an initial table size
- * accommodating the specified number of elements without the need
- * to dynamically resize.
- *
- * @param initialCapacity The implementation performs internal
- * sizing to accommodate this many elements.
- * @throws IllegalArgumentException if the initial capacity of
- * elements is negative
- */
- public ConcurrentHashMapV8(int initialCapacity) {
- if (initialCapacity < 0)
- throw new IllegalArgumentException();
- int cap = ((initialCapacity >= (MAXIMUM_CAPACITY >>> 1)) ?
- MAXIMUM_CAPACITY :
- tableSizeFor(initialCapacity + (initialCapacity >>> 1) + 1));
- this.counter = new LongAdder();
- this.sizeCtl = cap;
- }
-
- /**
- * Creates a new map with the same mappings as the given map.
- *
- * @param m the map
- */
- public ConcurrentHashMapV8(Map m) {
- this.counter = new LongAdder();
- this.sizeCtl = DEFAULT_CAPACITY;
- internalPutAll(m);
- }
-
- /**
- * Creates a new, empty map with an initial table size based on
- * the given number of elements ({@code initialCapacity}) and
- * initial table density ({@code loadFactor}).
- *
- * @param initialCapacity the initial capacity. The implementation
- * performs internal sizing to accommodate this many elements,
- * given the specified load factor.
- * @param loadFactor the load factor (table density) for
- * establishing the initial table size
- * @throws IllegalArgumentException if the initial capacity of
- * elements is negative or the load factor is nonpositive
- *
- * @since 1.6
- */
- public ConcurrentHashMapV8(int initialCapacity, float loadFactor) {
- this(initialCapacity, loadFactor, 1);
- }
-
- /**
- * Creates a new, empty map with an initial table size based on
- * the given number of elements ({@code initialCapacity}), table
- * density ({@code loadFactor}), and number of concurrently
- * updating threads ({@code concurrencyLevel}).
- *
- * @param initialCapacity the initial capacity. The implementation
- * performs internal sizing to accommodate this many elements,
- * given the specified load factor.
- * @param loadFactor the load factor (table density) for
- * establishing the initial table size
- * @param concurrencyLevel the estimated number of concurrently
- * updating threads. The implementation may use this value as
- * a sizing hint.
- * @throws IllegalArgumentException if the initial capacity is
- * negative or the load factor or concurrencyLevel are
- * nonpositive
- */
- public ConcurrentHashMapV8(int initialCapacity,
- float loadFactor, int concurrencyLevel) {
- if (!(loadFactor > 0.0f) || initialCapacity < 0 || concurrencyLevel <= 0)
- throw new IllegalArgumentException();
- if (initialCapacity < concurrencyLevel) // Use at least as many bins
- initialCapacity = concurrencyLevel; // as estimated threads
- long size = (long)(1.0 + (long)initialCapacity / loadFactor);
- int cap = (size >= (long)MAXIMUM_CAPACITY) ?
- MAXIMUM_CAPACITY : tableSizeFor((int)size);
- this.counter = new LongAdder();
- this.sizeCtl = cap;
- }
-
- /**
- * Creates a new {@link Set} backed by a ConcurrentHashMapV8
- * from the given type to {@code Boolean.TRUE}.
- *
- * @return the new set
- */
- public static KeySetView newKeySet() {
- return new KeySetView(new ConcurrentHashMapV8(),
- Boolean.TRUE);
- }
-
- /**
- * Creates a new {@link Set} backed by a ConcurrentHashMapV8
- * from the given type to {@code Boolean.TRUE}.
- *
- * @param initialCapacity The implementation performs internal
- * sizing to accommodate this many elements.
- * @throws IllegalArgumentException if the initial capacity of
- * elements is negative
- * @return the new set
- */
- public static KeySetView newKeySet(int initialCapacity) {
- return new KeySetView(new ConcurrentHashMapV8(initialCapacity),
- Boolean.TRUE);
- }
-
- /**
- * {@inheritDoc}
- */
- public boolean isEmpty() {
- return counter.sum() <= 0L; // ignore transient negative values
- }
-
- /**
- * {@inheritDoc}
- */
- public int size() {
- long n = counter.sum();
- return ((n < 0L) ? 0 :
- (n > (long)Integer.MAX_VALUE) ? Integer.MAX_VALUE :
- (int)n);
- }
-
- /**
- * Returns the number of mappings. This method should be used
- * instead of {@link #size} because a ConcurrentHashMapV8 may
- * contain more mappings than can be represented as an int. The
- * value returned is a snapshot; the actual count may differ if
- * there are ongoing concurrent insertions or removals.
- *
- * @return the number of mappings
- */
- public long mappingCount() {
- long n = counter.sum();
- return (n < 0L) ? 0L : n; // ignore transient negative values
- }
-
- /**
- * Returns the value to which the specified key is mapped,
- * or {@code null} if this map contains no mapping for the key.
- *
- *
More formally, if this map contains a mapping from a key
- * {@code k} to a value {@code v} such that {@code key.equals(k)},
- * then this method returns {@code v}; otherwise it returns
- * {@code null}. (There can be at most one such mapping.)
- *
- * @throws NullPointerException if the specified key is null
- */
- @SuppressWarnings("unchecked") public V get(Object key) {
- if (key == null)
- throw new NullPointerException();
- return (V)internalGet(key);
- }
-
- /**
- * Returns the value to which the specified key is mapped,
- * or the given defaultValue if this map contains no mapping for the key.
- *
- * @param key the key
- * @param defaultValue the value to return if this map contains
- * no mapping for the given key
- * @return the mapping for the key, if present; else the defaultValue
- * @throws NullPointerException if the specified key is null
- */
- @SuppressWarnings("unchecked") public V getValueOrDefault(Object key, V defaultValue) {
- if (key == null)
- throw new NullPointerException();
- V v = (V) internalGet(key);
- return v == null ? defaultValue : v;
- }
-
- /**
- * Tests if the specified object is a key in this table.
- *
- * @param key possible key
- * @return {@code true} if and only if the specified object
- * is a key in this table, as determined by the
- * {@code equals} method; {@code false} otherwise
- * @throws NullPointerException if the specified key is null
- */
- public boolean containsKey(Object key) {
- if (key == null)
- throw new NullPointerException();
- return internalGet(key) != null;
- }
-
- /**
- * Returns {@code true} if this map maps one or more keys to the
- * specified value. Note: This method may require a full traversal
- * of the map, and is much slower than method {@code containsKey}.
- *
- * @param value value whose presence in this map is to be tested
- * @return {@code true} if this map maps one or more keys to the
- * specified value
- * @throws NullPointerException if the specified value is null
- */
- public boolean containsValue(Object value) {
- if (value == null)
- throw new NullPointerException();
- Object v;
- Traverser it = new Traverser(this);
- while ((v = it.advance()) != null) {
- if (v == value || value.equals(v))
- return true;
- }
- return false;
- }
-
- public K findKey(Object value) {
- if (value == null)
- throw new NullPointerException();
- Object v;
- Traverser it = new Traverser(this);
- while ((v = it.advance()) != null) {
- if (v == value || value.equals(v))
- return it.nextKey;
- }
- return null;
- }
-
- /**
- * Legacy method testing if some key maps into the specified value
- * in this table. This method is identical in functionality to
- * {@link #containsValue}, and exists solely to ensure
- * full compatibility with class {@link java.util.Hashtable},
- * which supported this method prior to introduction of the
- * Java Collections framework.
- *
- * @param value a value to search for
- * @return {@code true} if and only if some key maps to the
- * {@code value} argument in this table as
- * determined by the {@code equals} method;
- * {@code false} otherwise
- * @throws NullPointerException if the specified value is null
- */
- public boolean contains(Object value) {
- return containsValue(value);
- }
-
- /**
- * Maps the specified key to the specified value in this table.
- * Neither the key nor the value can be null.
- *
- *
The value can be retrieved by calling the {@code get} method
- * with a key that is equal to the original key.
- *
- * @param key key with which the specified value is to be associated
- * @param value value to be associated with the specified key
- * @return the previous value associated with {@code key}, or
- * {@code null} if there was no mapping for {@code key}
- * @throws NullPointerException if the specified key or value is null
- */
- @SuppressWarnings("unchecked") public V put(K key, V value) {
- if (key == null || value == null)
- throw new NullPointerException();
- return (V)internalPut(key, value);
- }
-
- /**
- * {@inheritDoc}
- *
- * @return the previous value associated with the specified key,
- * or {@code null} if there was no mapping for the key
- * @throws NullPointerException if the specified key or value is null
- */
- @SuppressWarnings("unchecked") public V putIfAbsent(K key, V value) {
- if (key == null || value == null)
- throw new NullPointerException();
- return (V)internalPutIfAbsent(key, value);
- }
-
- /**
- * Copies all of the mappings from the specified map to this one.
- * These mappings replace any mappings that this map had for any of the
- * keys currently in the specified map.
- *
- * @param m mappings to be stored in this map
- */
- public void putAll(Map m) {
- internalPutAll(m);
- }
-
- /**
- * If the specified key is not already associated with a value,
- * computes its value using the given mappingFunction and enters
- * it into the map unless null. This is equivalent to
- *
{@code
- * if (map.containsKey(key))
- * return map.get(key);
- * value = mappingFunction.apply(key);
- * if (value != null)
- * map.put(key, value);
- * return value;}
- *
- * except that the action is performed atomically. If the
- * function returns {@code null} no mapping is recorded. If the
- * function itself throws an (unchecked) exception, the exception
- * is rethrown to its caller, and no mapping is recorded. Some
- * attempted update operations on this map by other threads may be
- * blocked while computation is in progress, so the computation
- * should be short and simple, and must not attempt to update any
- * other mappings of this Map. The most appropriate usage is to
- * construct a new object serving as an initial mapped value, or
- * memoized result, as in:
- *
- *
{@code
- * map.computeIfAbsent(key, new Fun() {
- * public V map(K k) { return new Value(f(k)); }});}
- *
- * @param key key with which the specified value is to be associated
- * @param mappingFunction the function to compute a value
- * @return the current (existing or computed) value associated with
- * the specified key, or null if the computed value is null
- * @throws NullPointerException if the specified key or mappingFunction
- * is null
- * @throws IllegalStateException if the computation detectably
- * attempts a recursive update to this map that would
- * otherwise never complete
- * @throws RuntimeException or Error if the mappingFunction does so,
- * in which case the mapping is left unestablished
- */
- @SuppressWarnings("unchecked") public V computeIfAbsent
- (K key, Fun mappingFunction) {
- if (key == null || mappingFunction == null)
- throw new NullPointerException();
- return (V)internalComputeIfAbsent(key, mappingFunction);
- }
-
- /**
- * If the given key is present, computes a new mapping value given a key and
- * its current mapped value. This is equivalent to
- *
- *
- * except that the action is performed atomically. If the
- * function returns {@code null}, the mapping is removed. If the
- * function itself throws an (unchecked) exception, the exception
- * is rethrown to its caller, and the current mapping is left
- * unchanged. Some attempted update operations on this map by
- * other threads may be blocked while computation is in progress,
- * so the computation should be short and simple, and must not
- * attempt to update any other mappings of this Map. For example,
- * to either create or append new messages to a value mapping:
- *
- * @param key key with which the specified value is to be associated
- * @param remappingFunction the function to compute a value
- * @return the new value associated with the specified key, or null if none
- * @throws NullPointerException if the specified key or remappingFunction
- * is null
- * @throws IllegalStateException if the computation detectably
- * attempts a recursive update to this map that would
- * otherwise never complete
- * @throws RuntimeException or Error if the remappingFunction does so,
- * in which case the mapping is unchanged
- */
- @SuppressWarnings("unchecked") public V computeIfPresent
- (K key, BiFun remappingFunction) {
- if (key == null || remappingFunction == null)
- throw new NullPointerException();
- return (V)internalCompute(key, true, remappingFunction);
- }
-
- /**
- * Computes a new mapping value given a key and
- * its current mapped value (or {@code null} if there is no current
- * mapping). This is equivalent to
- *
- *
- * except that the action is performed atomically. If the
- * function returns {@code null}, the mapping is removed. If the
- * function itself throws an (unchecked) exception, the exception
- * is rethrown to its caller, and the current mapping is left
- * unchanged. Some attempted update operations on this map by
- * other threads may be blocked while computation is in progress,
- * so the computation should be short and simple, and must not
- * attempt to update any other mappings of this Map. For example,
- * to either create or append new messages to a value mapping:
- *
- *
{@code
- * Map map = ...;
- * final String msg = ...;
- * map.compute(key, new BiFun() {
- * public String apply(Key k, String v) {
- * return (v == null) ? msg : v + msg;});}}
- *
- * @param key key with which the specified value is to be associated
- * @param remappingFunction the function to compute a value
- * @return the new value associated with the specified key, or null if none
- * @throws NullPointerException if the specified key or remappingFunction
- * is null
- * @throws IllegalStateException if the computation detectably
- * attempts a recursive update to this map that would
- * otherwise never complete
- * @throws RuntimeException or Error if the remappingFunction does so,
- * in which case the mapping is unchanged
- */
- @SuppressWarnings("unchecked") public V compute
- (K key, BiFun remappingFunction) {
- if (key == null || remappingFunction == null)
- throw new NullPointerException();
- return (V)internalCompute(key, false, remappingFunction);
- }
-
- /**
- * If the specified key is not already associated
- * with a value, associate it with the given value.
- * Otherwise, replace the value with the results of
- * the given remapping function. This is equivalent to:
- *
- * except that the action is performed atomically. If the
- * function returns {@code null}, the mapping is removed. If the
- * function itself throws an (unchecked) exception, the exception
- * is rethrown to its caller, and the current mapping is left
- * unchanged. Some attempted update operations on this map by
- * other threads may be blocked while computation is in progress,
- * so the computation should be short and simple, and must not
- * attempt to update any other mappings of this Map.
- */
- @SuppressWarnings("unchecked") public V merge
- (K key, V value, BiFun remappingFunction) {
- if (key == null || value == null || remappingFunction == null)
- throw new NullPointerException();
- return (V)internalMerge(key, value, remappingFunction);
- }
-
- /**
- * Removes the key (and its corresponding value) from this map.
- * This method does nothing if the key is not in the map.
- *
- * @param key the key that needs to be removed
- * @return the previous value associated with {@code key}, or
- * {@code null} if there was no mapping for {@code key}
- * @throws NullPointerException if the specified key is null
- */
- @SuppressWarnings("unchecked") public V remove(Object key) {
- if (key == null)
- throw new NullPointerException();
- return (V)internalReplace(key, null, null);
- }
-
- /**
- * {@inheritDoc}
- *
- * @throws NullPointerException if the specified key is null
- */
- public boolean remove(Object key, Object value) {
- if (key == null)
- throw new NullPointerException();
- if (value == null)
- return false;
- return internalReplace(key, null, value) != null;
- }
-
- /**
- * {@inheritDoc}
- *
- * @throws NullPointerException if any of the arguments are null
- */
- public boolean replace(K key, V oldValue, V newValue) {
- if (key == null || oldValue == null || newValue == null)
- throw new NullPointerException();
- return internalReplace(key, newValue, oldValue) != null;
- }
-
- /**
- * {@inheritDoc}
- *
- * @return the previous value associated with the specified key,
- * or {@code null} if there was no mapping for the key
- * @throws NullPointerException if the specified key or value is null
- */
- @SuppressWarnings("unchecked") public V replace(K key, V value) {
- if (key == null || value == null)
- throw new NullPointerException();
- return (V)internalReplace(key, value, null);
- }
-
- /**
- * Removes all of the mappings from this map.
- */
- public void clear() {
- internalClear();
- }
-
- /**
- * Returns a {@link Set} view of the keys contained in this map.
- * The set is backed by the map, so changes to the map are
- * reflected in the set, and vice-versa.
- *
- * @return the set view
- */
- public KeySetView keySet() {
- KeySetView ks = keySet;
- return (ks != null) ? ks : (keySet = new KeySetView(this, null));
- }
-
- /**
- * Returns a {@link Set} view of the keys in this map, using the
- * given common mapped value for any additions (i.e., {@link
- * Collection#add} and {@link Collection#addAll}). This is of
- * course only appropriate if it is acceptable to use the same
- * value for all additions from this view.
- *
- * @param mappedValue the mapped value to use for any
- * additions.
- * @return the set view
- * @throws NullPointerException if the mappedValue is null
- */
- public KeySetView keySet(V mappedValue) {
- if (mappedValue == null)
- throw new NullPointerException();
- return new KeySetView(this, mappedValue);
- }
-
- /**
- * Returns a {@link Collection} view of the values contained in this map.
- * The collection is backed by the map, so changes to the map are
- * reflected in the collection, and vice-versa.
- */
- public ValuesView values() {
- ValuesView vs = values;
- return (vs != null) ? vs : (values = new ValuesView(this));
- }
-
- /**
- * Returns a {@link Set} view of the mappings contained in this map.
- * The set is backed by the map, so changes to the map are
- * reflected in the set, and vice-versa. The set supports element
- * removal, which removes the corresponding mapping from the map,
- * via the {@code Iterator.remove}, {@code Set.remove},
- * {@code removeAll}, {@code retainAll}, and {@code clear}
- * operations. It does not support the {@code add} or
- * {@code addAll} operations.
- *
- *
The view's {@code iterator} is a "weakly consistent" iterator
- * that will never throw {@link ConcurrentModificationException},
- * and guarantees to traverse elements as they existed upon
- * construction of the iterator, and may (but is not guaranteed to)
- * reflect any modifications subsequent to construction.
- */
- public Set> entrySet() {
- EntrySetView es = entrySet;
- return (es != null) ? es : (entrySet = new EntrySetView(this));
- }
-
- /**
- * Returns an enumeration of the keys in this table.
- *
- * @return an enumeration of the keys in this table
- * @see #keySet()
- */
- public Enumeration keys() {
- return new KeyIterator(this);
- }
-
- /**
- * Returns an enumeration of the values in this table.
- *
- * @return an enumeration of the values in this table
- * @see #values()
- */
- public Enumeration elements() {
- return new ValueIterator(this);
- }
-
- /**
- * Returns a partitionable iterator of the keys in this map.
- *
- * @return a partitionable iterator of the keys in this map
- */
- public Spliterator keySpliterator() {
- return new KeyIterator(this);
- }
-
- /**
- * Returns a partitionable iterator of the values in this map.
- *
- * @return a partitionable iterator of the values in this map
- */
- public Spliterator valueSpliterator() {
- return new ValueIterator(this);
- }
-
- /**
- * Returns a partitionable iterator of the entries in this map.
- *
- * @return a partitionable iterator of the entries in this map
- */
- public Spliterator> entrySpliterator() {
- return new EntryIterator(this);
- }
-
- /**
- * Returns the hash code value for this {@link Map}, i.e.,
- * the sum of, for each key-value pair in the map,
- * {@code key.hashCode() ^ value.hashCode()}.
- *
- * @return the hash code value for this map
- */
- public int hashCode() {
- int h = 0;
- Traverser it = new Traverser(this);
- Object v;
- while ((v = it.advance()) != null) {
- h += it.nextKey.hashCode() ^ v.hashCode();
- }
- return h;
- }
-
- /**
- * Returns a string representation of this map. The string
- * representation consists of a list of key-value mappings (in no
- * particular order) enclosed in braces ("{@code {}}"). Adjacent
- * mappings are separated by the characters {@code ", "} (comma
- * and space). Each key-value mapping is rendered as the key
- * followed by an equals sign ("{@code =}") followed by the
- * associated value.
- *
- * @return a string representation of this map
- */
- public String toString() {
- Traverser it = new Traverser(this);
- StringBuilder sb = new StringBuilder();
- sb.append('{');
- Object v;
- if ((v = it.advance()) != null) {
- for (;;) {
- Object k = it.nextKey;
- sb.append(k == this ? "(this Map)" : k);
- sb.append('=');
- sb.append(v == this ? "(this Map)" : v);
- if ((v = it.advance()) == null)
- break;
- sb.append(',').append(' ');
- }
- }
- return sb.append('}').toString();
- }
-
- /**
- * Compares the specified object with this map for equality.
- * Returns {@code true} if the given object is a map with the same
- * mappings as this map. This operation may return misleading
- * results if either map is concurrently modified during execution
- * of this method.
- *
- * @param o object to be compared for equality with this map
- * @return {@code true} if the specified object is equal to this map
- */
- public boolean equals(Object o) {
- if (o != this) {
- if (!(o instanceof Map))
- return false;
- Map m = (Map) o;
- Traverser it = new Traverser(this);
- Object val;
- while ((val = it.advance()) != null) {
- Object v = m.get(it.nextKey);
- if (v == null || (v != val && !v.equals(val)))
- return false;
- }
- for (Map.Entry e : m.entrySet()) {
- Object mk, mv, v;
- if ((mk = e.getKey()) == null ||
- (mv = e.getValue()) == null ||
- (v = internalGet(mk)) == null ||
- (mv != v && !mv.equals(v)))
- return false;
- }
- }
- return true;
- }
-
- /* ----------------Iterators -------------- */
-
- @SuppressWarnings("serial") static final class KeyIterator extends Traverser
- implements Spliterator, Enumeration {
- KeyIterator(ConcurrentHashMapV8 map) { super(map); }
- KeyIterator(Traverser it) {
- super(it);
- }
- public KeyIterator split() {
- if (nextKey != null)
- throw new IllegalStateException();
- return new KeyIterator(this);
- }
- @SuppressWarnings("unchecked") public final K next() {
- if (nextVal == null && advance() == null)
- throw new NoSuchElementException();
- Object k = nextKey;
- nextVal = null;
- return (K) k;
- }
-
- public final K nextElement() { return next(); }
- }
-
- @SuppressWarnings("serial") static final class ValueIterator extends Traverser
- implements Spliterator, Enumeration {
- ValueIterator(ConcurrentHashMapV8 map) { super(map); }
- ValueIterator(Traverser it) {
- super(it);
- }
- public ValueIterator split() {
- if (nextKey != null)
- throw new IllegalStateException();
- return new ValueIterator(this);
- }
-
- @SuppressWarnings("unchecked") public final V next() {
- Object v;
- if ((v = nextVal) == null && (v = advance()) == null)
- throw new NoSuchElementException();
- nextVal = null;
- return (V) v;
- }
-
- public final V nextElement() { return next(); }
- }
-
- @SuppressWarnings("serial") static final class EntryIterator extends Traverser
- implements Spliterator> {
- EntryIterator(ConcurrentHashMapV8 map) { super(map); }
- EntryIterator(Traverser it) {
- super(it);
- }
- public EntryIterator split() {
- if (nextKey != null)
- throw new IllegalStateException();
- return new EntryIterator(this);
- }
-
- @SuppressWarnings("unchecked") public final Map.Entry next() {
- Object v;
- if ((v = nextVal) == null && (v = advance()) == null)
- throw new NoSuchElementException();
- Object k = nextKey;
- nextVal = null;
- return new MapEntry((K)k, (V)v, map);
- }
- }
-
- /**
- * Exported Entry for iterators
- */
- static final class MapEntry implements Map.Entry {
- final K key; // non-null
- V val; // non-null
- final ConcurrentHashMapV8 map;
- MapEntry(K key, V val, ConcurrentHashMapV8 map) {
- this.key = key;
- this.val = val;
- this.map = map;
- }
- public final K getKey() { return key; }
- public final V getValue() { return val; }
- public final int hashCode() { return key.hashCode() ^ val.hashCode(); }
- public final String toString(){ return key + "=" + val; }
-
- public final boolean equals(Object o) {
- Object k, v; Map.Entry e;
- return ((o instanceof Map.Entry) &&
- (k = (e = (Map.Entry)o).getKey()) != null &&
- (v = e.getValue()) != null &&
- (k == key || k.equals(key)) &&
- (v == val || v.equals(val)));
- }
-
- /**
- * Sets our entry's value and writes through to the map. The
- * value to return is somewhat arbitrary here. Since we do not
- * necessarily track asynchronous changes, the most recent
- * "previous" value could be different from what we return (or
- * could even have been removed in which case the put will
- * re-establish). We do not and cannot guarantee more.
- */
- public final V setValue(V value) {
- if (value == null) throw new NullPointerException();
- V v = val;
- val = value;
- map.put(key, value);
- return v;
- }
- }
-
- /* ---------------- Serialization Support -------------- */
-
- /**
- * Stripped-down version of helper class used in previous version,
- * declared for the sake of serialization compatibility
- */
- static class Segment implements Serializable {
- private static final long serialVersionUID = 2249069246763182397L;
- final float loadFactor;
- Segment(float lf) { this.loadFactor = lf; }
- }
-
- /**
- * Saves the state of the {@code ConcurrentHashMapV8} instance to a
- * stream (i.e., serializes it).
- * @param s the stream
- * @serialData
- * the key (Object) and value (Object)
- * for each key-value mapping, followed by a null pair.
- * The key-value mappings are emitted in no particular order.
- */
- @SuppressWarnings("unchecked") private void writeObject(java.io.ObjectOutputStream s)
- throws java.io.IOException {
- if (segments == null) { // for serialization compatibility
- segments = (Segment[])
- new Segment[DEFAULT_CONCURRENCY_LEVEL];
- for (int i = 0; i < segments.length; ++i)
- segments[i] = new Segment(LOAD_FACTOR);
- }
- s.defaultWriteObject();
- Traverser it = new Traverser(this);
- Object v;
- while ((v = it.advance()) != null) {
- s.writeObject(it.nextKey);
- s.writeObject(v);
- }
- s.writeObject(null);
- s.writeObject(null);
- segments = null; // throw away
- }
-
- /**
- * Reconstitutes the instance from a stream (that is, deserializes it).
- * @param s the stream
- */
- @SuppressWarnings("unchecked") private void readObject(java.io.ObjectInputStream s)
- throws java.io.IOException, ClassNotFoundException {
- s.defaultReadObject();
- this.segments = null; // unneeded
- // initialize transient final field
- UNSAFE.putObjectVolatile(this, counterOffset, new LongAdder());
-
- // Create all nodes, then place in table once size is known
- long size = 0L;
- Node p = null;
- for (;;) {
- K k = (K) s.readObject();
- V v = (V) s.readObject();
- if (k != null && v != null) {
- int h = spread(k.hashCode());
- p = new Node(h, k, v, p);
- ++size;
- }
- else
- break;
- }
- if (p != null) {
- boolean init = false;
- int n;
- if (size >= (long)(MAXIMUM_CAPACITY >>> 1))
- n = MAXIMUM_CAPACITY;
- else {
- int sz = (int)size;
- n = tableSizeFor(sz + (sz >>> 1) + 1);
- }
- int sc = sizeCtl;
- boolean collide = false;
- if (n > sc &&
- UNSAFE.compareAndSwapInt(this, sizeCtlOffset, sc, -1)) {
- try {
- if (table == null) {
- init = true;
- Node[] tab = new Node[n];
- int mask = n - 1;
- while (p != null) {
- int j = p.hash & mask;
- Node next = p.next;
- Node q = p.next = tabAt(tab, j);
- setTabAt(tab, j, p);
- if (!collide && q != null && q.hash == p.hash)
- collide = true;
- p = next;
- }
- table = tab;
- counter.add(size);
- sc = n - (n >>> 2);
- }
- } finally {
- sizeCtl = sc;
- }
- if (collide) { // rescan and convert to TreeBins
- Node[] tab = table;
- for (int i = 0; i < tab.length; ++i) {
- int c = 0;
- for (Node e = tabAt(tab, i); e != null; e = e.next) {
- if (++c > TREE_THRESHOLD &&
- (e.key instanceof Comparable)) {
- replaceWithTreeBin(tab, i, e.key);
- break;
- }
- }
- }
- }
- }
- if (!init) { // Can only happen if unsafely published.
- while (p != null) {
- internalPut(p.key, p.val);
- p = p.next;
- }
- }
- }
- }
-
-
- // -------------------------------------------------------
-
- // Sams
- /** Interface describing a void action of one argument */
- public interface Action { void apply(A a); }
- /** Interface describing a void action of two arguments */
- public interface BiAction
- 
-
- 
- 
-
- 
-
- 
- 
-
- 
-
- 
-
- 
-
- 
- 
-
- 
- 
- 
-
-The design goals of this gem are:
-
-* Be an 'unopinionated' toolbox that provides useful utilities without debating which is better
- or why
-* Remain free of external gem dependencies
-* Stay true to the spirit of the languages providing inspiration
-* But implement in a way that makes sense for Ruby
-* Keep the semantics as idiomatic Ruby as possible
-* Support features that make sense in Ruby
-* Exclude features that don't make sense in Ruby
-* Be small, lean, and loosely coupled
-* Thread-safety
-* Backward compatibility
-
-## Contributing
-
-**This gem depends on
-[contributions](https://github.com/ruby-concurrency/concurrent-ruby/graphs/contributors) and we
-appreciate your help. Would you like to contribute? Great! Have a look at
-[issues with `looking-for-contributor` label](https://github.com/ruby-concurrency/concurrent-ruby/issues?q=is%3Aissue+is%3Aopen+label%3Alooking-for-contributor).** And if you pick something up let us know on the issue.
-
-You can also get started by triaging issues which may include reproducing bug reports or asking for vital information, such as version numbers or reproduction instructions. If you would like to start triaging issues, one easy way to get started is to [subscribe to concurrent-ruby on CodeTriage](https://www.codetriage.com/ruby-concurrency/concurrent-ruby). [](https://www.codetriage.com/ruby-concurrency/concurrent-ruby)
-
-## Thread Safety
-
-*Concurrent Ruby makes one of the strongest thread safety guarantees of any Ruby concurrency
-library, providing consistent behavior and guarantees on all three main Ruby interpreters
-(MRI/CRuby, JRuby, TruffleRuby).*
-
-Every abstraction in this library is thread safe. Specific thread safety guarantees are documented
-with each abstraction.
-
-It is critical to remember, however, that Ruby is a language of mutable references. *No*
-concurrency library for Ruby can ever prevent the user from making thread safety mistakes (such as
-sharing a mutable object between threads and modifying it on both threads) or from creating
-deadlocks through incorrect use of locks. All the library can do is provide safe abstractions which
-encourage safe practices. Concurrent Ruby provides more safe concurrency abstractions than any
-other Ruby library, many of which support the mantra of
-["Do not communicate by sharing memory; instead, share memory by communicating"](https://blog.golang.org/share-memory-by-communicating).
-Concurrent Ruby is also the only Ruby library which provides a full suite of thread safe and
-immutable variable types and data structures.
-
-We've also initiated discussion to document the [memory model](docs-source/synchronization.md) of Ruby which
-would provide consistent behaviour and guarantees on all three main Ruby interpreters
-(MRI/CRuby, JRuby, TruffleRuby).
-
-## Features & Documentation
-
-**The primary site for documentation is the automatically generated
-[API documentation](http://ruby-concurrency.github.io/concurrent-ruby/index.html) which is up to
-date with latest release.** This readme matches the master so may contain new stuff not yet
-released.
-
-We also have a [IRC (gitter)](https://gitter.im/ruby-concurrency/concurrent-ruby).
-
-### Versioning
-
-* `concurrent-ruby` uses [Semantic Versioning](http://semver.org/)
-* `concurrent-ruby-ext` has always same version as `concurrent-ruby`
-* `concurrent-ruby-edge` will always be 0.y.z therefore following
- [point 4](http://semver.org/#spec-item-4) applies *"Major version zero
- (0.y.z) is for initial development. Anything may change at any time. The
- public API should not be considered stable."* However we additionally use
- following rules:
- * Minor version increment means incompatible changes were made
- * Patch version increment means only compatible changes were made
-
-
-#### General-purpose Concurrency Abstractions
-
-* [Async](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Async.html):
- A mixin module that provides simple asynchronous behavior to a class. Loosely based on Erlang's
- [gen_server](http://www.erlang.org/doc/man/gen_server.html).
-* [ScheduledTask](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/ScheduledTask.html):
- Like a Future scheduled for a specific future time.
-* [TimerTask](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/TimerTask.html):
- A Thread that periodically wakes up to perform work at regular intervals.
-* [Promises](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promises.html):
- Unified implementation of futures and promises which combines features of previous `Future`,
- `Promise`, `IVar`, `Event`, `dataflow`, `Delay`, and (partially) `TimerTask` into a single
- framework. It extensively uses the new synchronization layer to make all the features
- **non-blocking** and **lock-free**, with the exception of obviously blocking operations like
- `#wait`, `#value`. It also offers better performance.
-
-#### Thread-safe Value Objects, Structures, and Collections
-
-Collection classes that were originally part of the (deprecated) `thread_safe` gem:
-
-* [Array](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Array.html) A thread-safe
- subclass of Ruby's standard [Array](http://ruby-doc.org/core/Array.html).
-* [Hash](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Hash.html) A thread-safe
- subclass of Ruby's standard [Hash](http://ruby-doc.org/core/Hash.html).
-* [Set](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Set.html) A thread-safe
- subclass of Ruby's standard [Set](http://ruby-doc.org/stdlib-2.4.0/libdoc/set/rdoc/Set.html).
-* [Map](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Map.html) A hash-like object
- that should have much better performance characteristics, especially under high concurrency,
- than `Concurrent::Hash`.
-* [Tuple](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Tuple.html) A fixed size
- array with volatile (synchronized, thread safe) getters/setters.
-
-Value objects inspired by other languages:
-
-* [Maybe](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Maybe.html) A thread-safe,
- immutable object representing an optional value, based on
- [Haskell Data.Maybe](https://hackage.haskell.org/package/base-4.2.0.1/docs/Data-Maybe.html).
-
-Structure classes derived from Ruby's [Struct](http://ruby-doc.org/core/Struct.html):
-
-* [ImmutableStruct](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/ImmutableStruct.html)
- Immutable struct where values are set at construction and cannot be changed later.
-* [MutableStruct](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/MutableStruct.html)
- Synchronized, mutable struct where values can be safely changed at any time.
-* [SettableStruct](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/SettableStruct.html)
- Synchronized, write-once struct where values can be set at most once, either at construction
- or any time thereafter.
-
-Thread-safe variables:
-
-* [Agent](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Agent.html): A way to
- manage shared, mutable, *asynchronous*, independent state. Based on Clojure's
- [Agent](http://clojure.org/agents).
-* [Atom](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Atom.html): A way to manage
- shared, mutable, *synchronous*, independent state. Based on Clojure's
- [Atom](http://clojure.org/atoms).
-* [AtomicBoolean](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/AtomicBoolean.html)
- A boolean value that can be updated atomically.
-* [AtomicFixnum](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/AtomicFixnum.html)
- A numeric value that can be updated atomically.
-* [AtomicReference](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/AtomicReference.html)
- An object reference that may be updated atomically.
-* [Exchanger](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Exchanger.html)
- A synchronization point at which threads can pair and swap elements within pairs. Based on
- Java's [Exchanger](http://docs.oracle.com/javase/7/docs/api/java/util/concurrent/Exchanger.html).
-* [MVar](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/MVar.html) A synchronized
- single element container. Based on Haskell's
- [MVar](https://hackage.haskell.org/package/base-4.8.1.0/docs/Control-Concurrent-MVar.html) and
- Scala's [MVar](http://docs.typelevel.org/api/scalaz/nightly/index.html#scalaz.concurrent.MVar$).
-* [ThreadLocalVar](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/ThreadLocalVar.html)
- A variable where the value is different for each thread.
-* [TVar](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/TVar.html) A transactional
- variable implementing software transactional memory (STM). Based on Clojure's
- [Ref](http://clojure.org/refs).
-
-#### Java-inspired ThreadPools and Other Executors
-
-* See the [thread pool](http://ruby-concurrency.github.io/concurrent-ruby/master/file.thread_pools.html)
- overview, which also contains a list of other Executors available.
-
-#### Thread Synchronization Classes and Algorithms
-
-* [CountDownLatch](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/CountDownLatch.html)
- A synchronization object that allows one thread to wait on multiple other threads.
-* [CyclicBarrier](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/CyclicBarrier.html)
- A synchronization aid that allows a set of threads to all wait for each other to reach a common barrier point.
-* [Event](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Event.html) Old school
- kernel-style event.
-* [ReadWriteLock](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/ReadWriteLock.html)
- A lock that supports multiple readers but only one writer.
-* [ReentrantReadWriteLock](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/ReentrantReadWriteLock.html)
- A read/write lock with reentrant and upgrade features.
-* [Semaphore](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Semaphore.html)
- A counting-based locking mechanism that uses permits.
-* [AtomicMarkableReference](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/AtomicMarkableReference.html)
-
-#### Deprecated
-
-Deprecated features are still available and bugs are being fixed, but new features will not be added.
-
-* ~~[Future](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Future.html):
- An asynchronous operation that produces a value.~~ Replaced by
- [Promises](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promises.html).
- * ~~[.dataflow](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent.html#dataflow-class_method):
- Built on Futures, Dataflow allows you to create a task that will be scheduled when all of
- its data dependencies are available.~~ Replaced by
- [Promises](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promises.html).
-* ~~[Promise](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promise.html): Similar
- to Futures, with more features.~~ Replaced by
- [Promises](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promises.html).
-* ~~[Delay](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Delay.html) Lazy evaluation
- of a block yielding an immutable result. Based on Clojure's
- [delay](https://clojuredocs.org/clojure.core/delay).~~ Replaced by
- [Promises](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promises.html).
-* ~~[IVar](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/IVar.html) Similar to a
- "future" but can be manually assigned once, after which it becomes immutable.~~ Replaced by
- [Promises](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promises.html).
-
-### Edge Features
-
-These are available in the `concurrent-ruby-edge` companion gem.
-
-These features are under active development and may change frequently. They are expected not to
-keep backward compatibility (there may also lack tests and documentation). Semantic versions will
-be obeyed though. Features developed in `concurrent-ruby-edge` are expected to move to
-`concurrent-ruby` when final.
-
-* [Actor](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Actor.html): Implements
- the Actor Model, where concurrent actors exchange messages.
- *Status: Partial documentation and tests; depends on new future/promise framework; stability is good.*
-* [Channel](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Channel.html):
- Communicating Sequential Processes ([CSP](https://en.wikipedia.org/wiki/Communicating_sequential_processes)).
- Functionally equivalent to Go [channels](https://tour.golang.org/concurrency/2) with additional
- inspiration from Clojure [core.async](https://clojure.github.io/core.async/).
- *Status: Partial documentation and tests.*
-* [LazyRegister](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/LazyRegister.html)
-* [LockFreeLinkedSet](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Edge/LockFreeLinkedSet.html)
- *Status: will be moved to core soon.*
-* [LockFreeStack](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/LockFreeStack.html)
- *Status: missing documentation and tests.*
-* [Promises::Channel](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Promises/Channel.html)
- A first in first out channel that accepts messages with push family of methods and returns
- messages with pop family of methods.
- Pop and push operations can be represented as futures, see `#pop_op` and `#push_op`.
- The capacity of the channel can be limited to support back pressure, use capacity option in `#initialize`.
- `#pop` method blocks ans `#pop_op` returns pending future if there is no message in the channel.
- If the capacity is limited the `#push` method blocks and `#push_op` returns pending future.
-* [Cancellation](http://ruby-concurrency.github.io/concurrent-ruby/master/Concurrent/Cancellation.html)
- The Cancellation abstraction provides cooperative cancellation.
-
- The standard methods `Thread#raise` of `Thread#kill` available in Ruby
- are very dangerous (see linked the blog posts bellow).
- Therefore concurrent-ruby provides an alternative.
-
- *