OpenLLM-France/wikimedia huggingface dataset:
# 99 Elm Problems/Problem 62

62.a) Collect the internal nodes of a binary tree in a list, that is all nodes that have at least one successor node.
62.b) Collect the nodes at a given level in a list.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 65

An alternative layout method is depicted in the illustration below:
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 60

60.a) Construct a height-­balanced binary trees with a given number of nodes.
Consider a height­-balanced binary tree of height H. What is the maximum number of nodes it can contain? Clearly, MaxN = 2**H ­ 1. However, what is the minimum number MinN? This question is more difficult.
60.b) Find the minimum number of nodes in a height-­balanced binary tree of height H.
60.c) Find the maximum height H a height­-balanced binary tree with N nodes can have. Find out how many height-­balanced trees exist for N = 15.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 61

61.a) Count the leaves of a binary tree.
61.b) Collect the leaves of a binary tree in a list.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 63

Construct a complete binary tree.
A complete binary tree with height H is defined as follows:
The levels 1,2,3,...,H-1 contain the maximum number of nodes.
In level H, which may contain less than the maximum possible number of nodes, all the nodes are "left-adjusted". This means that in a level-order tree traversal all internal nodes come first, the leaves come second, and empty successors come last.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 64

As a preparation for drawing the tree, a layout algorithm is required to determine the position of each node in a rectangular grid. In this layout strategy, the position of a node v is obtained by the following two rules:
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 59

Construct a height ­balanced binary trees, such that the difference in height between the left and right subtrees at each node is not greater than one.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 58

Apply the generate-­and-­test paradigm to construct all-symmetric, completely balanced binary trees with a given number of nodes.
# # # THIS IS A STUB # # #
Result:
Solutions
# 99 Elm Problems/Problem 6

Determine if a list is a palindrome, that is, the list is identical when read forward or backward.
Result:
Solutions
# 99 Elm Problems/Problem 6/Solutions

Using List.reverse
# Ada Programming/Representation clauses

There are several forms to specify the representation of items.

## Records

A record representation clause specifies the Layout aspect of a record. For any component, a component clause may be given specifying the location within the record object by its storage unit offset with respect to the address (called Position) and the bits occupied at this position (called First_Bit and Last_Bit):
These three expressions must be static, not negative and of any integer type; they have corresponding attributes 'Position, 'First_Bit and 'Last_Bit. Note that the bit range may extend well over storage unit boundaries. Components without a component clause are located at the compiler's choice.
Example:
Alternatively with identical result:
The layout depends of course on whether the machine architecture is little endian or big endian. The corresponding attribute is called 'Bit_Order.
For the Data component in the native bit order, 'Position, 'First_Bit and 'Last_Bit will in both cases return 1, 0 and 15.

### Biased Representation

For certain components, a so-called biased representation may be possible. For the type T, the attribute 'Size will return 10, but since it has only eight values, three bits would suffice. This can be forced with the following specification:
Note that no size clause is needed for type T. Thus, a change of representation is performed in either way when record components and stand-alone objects of type T are assigned to one another.
Also note that for component A the compiler is free to choose any of the remaining bits of position 0, but may also use at position 1 as many bits as an integer requires in the given implementation.

## Enumerations

An enumeration representation clause specifies the Coding aspect of an enumeration type with a named aggregate.
Another representation:
The expressions for the literals must be static and of any integer type. The values must not conflict with the order.

## The Aspect Pack

The aspect Pack may be used for arrays and records. It specifies that for each component as many bits are used as the attribute 'Size applied to its subtype returns.
# Ada Programming/Pragmas/Suppress
## Summary

The pragma Suppress suppresses compiler-generated run-time checks. If a run-time check is disabled, an exception may be suppressed and undefined behavior could result. pragma Suppress is used at the programmer's risk.
Checks that may be suppressed are:
* Access_Check - Check for dereference of a null access value. Constraint_Error suppressed.
* Accessibility_Check - Check for access of inaccessible object or subprogram. Program_Error suppressed.
* Discriminant_Check - Check for access of an unavailable component in a discriminant record (given the discriminant). Constraint_Error suppressed.
* Division_Check - Checks for divide by zero. Constraint_Error suppressed.
* Elaboration_Check - Checks for unelaborated package or subprogram body. Program_Error suppressed.
* Index_Check - Check for out-of-range array index. Constraint_Error suppressed.
* Length_Check - Check for array length violation. Constraint_Error suppressed.
* Overflow_Check - Check for numeric overflow. Constraint_Error suppressed.
* Range_Check - Check of scalar variable for out-of-range values. Constraint_Error suppressed.
* Storage_Check - Check for sufficient storage space to accommodate subprogram call. Storage_Error suppressed.
* Tag_Check - Checks for invalid object tag. Constraint_Error suppressed.
* All_Checks - All the above checks

## See also
### Wikibook

* Ada Programming/Pragmas/Unsuppress

### Ada Reference Manual

* 11.5 Suppressing Checks (Annotated)

### Ada 2005 Reference Manual

* J.10 Specific Suppression of Checks (Annotated)

### Ada Quality and Style Guide

* 10.7.6 Pragma Suppress
* 5.9.5 Suppression of Exception Check
# Ada Programming/Special/"

Used for:
* string literals
* operator overloading

## See also
### Wikibook

* Ada Programming
* Ada Programming/Delimiters

### Ada Reference Manual

* 2.1: Character Set

### Ada Quality and Style Guide

* 2.1.1 Horizontal Spacing — Use consistent spacing around delimiters.
# Ada Programming/Special/number sign

Used for:
Examples:

## See also
### Wikibook

* Ada Programming
* Ada Programming/Delimiters

### Ada Reference Manual

* 2.1: Character Set

### Ada Quality and Style Guide

* 2.1.1 Horizontal Spacing — Use consistent spacing around delimiters.
# Ada Programming/Pragmas/Reviewable
## Summary

The pragma Reviewable directs the compiler to provide information that aids inspection of the program's object code.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Pragmas
# Ada Programming/Statements

Note: there are some simplifications in the explanations below. Don't take anything too literally.
Most programming languages have the concept of a statement. A statement is a command that the programmer gives to the computer. For example:
This command has a verb ("Put_Line") and other details (what to print). In this case, the command "Put_Line" means "show on the screen," not "print on the printer." The programmer either gives the statement directly to the computer (by typing it while running a special program), or creates a text file with the command in it. You could create a file called "hi.txt", put the above command in it, and give the file to the computer.
If you have more than one command in the file, each will be performed in order, top to bottom. So the file could contain:
This does seem like a lot of typing but don't worry: Ada allows you to declare shorter aliasnames if you need a long statement very often.
# Annotated Republic of China Laws/Act of Criteria on Raise of Fines/Article 6

| ←Article 4 to Article 5 | Act of Criteria on Raise of Fines Abolished Republic of China (Taiwan) Law Article 6 |

## Promulgated amendment on 1983-06-24
### Article 6

    This Act shall come into force as of the date of promulgation.

## Promulgated amendment on 2006-05-17

Effective 2006-07-01

### Article 6

    This Act shall come into force as of the date of promulgation.
    The Articles amended on 28 April 2006 shall be enforced from 1 July 2006.

## Promulgated abolishment on 2009-04-29

Abolished

## Annotated by Wikibooks

* ↑ "Act of Criteria on Raise of Fines: Legislative History". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). As amended on February 5, 1993. Retrieved 2018-01-07. {{cite web}}: Check date values in: |date= (help)
* ↑ "Act of Criteria on Raise of Fines: Article 6". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2009-04-29. Retrieved 2018-01-07.
# Annotated Republic of China Laws/Act of Criteria on Raise of Fines
## History

* Promulgated on May 25, 1962
* As amended on February 5, 1993
* Amended on May 17, 2006
* Abolished on April 29, 2009

## Contents

Article 2 was amended then deleted. Articles 4 and 6 were amended.
Article 1 Where the law provides for the imposition of a fine, the amount of such fine as specified therein may be raised by two to ten times thereof, unless the amount of such fine or the multiplication thereof is specified by law at a specific rate, in which case such amount or multiplication shall apply.
Article 2 (later amended then deleted)
Article 3 The law providing for the raise of fines and the times by which fines shall be raised under this Act shall be established by the competent yuan of the government.
Article 4 (later amended)
Article 5 The provision of Article 1 hereof with respect to the times by which a fine may be raised shall be inapplicable to laws enacted after this Act undergoes amendment; nor is said article applicable to any law promulgated prior to amendment made to this Act, whereby the amount of fine specified therein has been changed after amendment made this Act or the amount of fine specified therein remains unchanged notwithstanding that an overall revision has been made to such law.
Article 6 (later amended)

## Annotated by Wikibooks

* ↑ "Act of Criteria on Raise of Fines: Legislative History". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2017-12-29. Retrieved 2018-01-07.
* ↑ Promulgated on Janiuary 9, 1970
* ↑ Promulgated on June 24, 1983
* ↑ Promulgated on May 6, 1991
* ↑ effective July 1, 2006
* ↑ "Act of Criteria on Raise of Fines: Legislative History". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). As amended on February 5, 1993. Retrieved 2018-01-07. {{cite web}}: Check date values in: |date= (help)
# Annotated Republic of China Laws/Act of Criteria on Raise of Fines/Article 2

| ←Article 1 | Act of Criteria on Raise of Fines Abolished Republic of China (Taiwan) Law Article 2 | Article 3 to Article 4→ |

## Promulgated amendment on 1993-02-05
### Article 2

    A fine commuted from detention or imprisonment under Article 41 of the Criminal Code or commuted into labor under Article 42, Paragraph 2, thereof shall be raised by one hundred times for each day. The same applies where the amount of fine specified by law has not been raised as herein prescribed or where the penal provision of any law does not specify the punishment of a fine.

## Promulgated deletion on 2006-05-17

Effective 2006-07-01

### Article 2

    （Deleted）

## Promulgated abolishment on 2009-04-29

Abolished

## Annotated by Wikibooks

* ↑ "Act of Criteria on Raise of Fines: Legislative History". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). As amended on February 5, 1993. Retrieved 2018-01-07. {{cite web}}: Check date values in: |date= (help)
* ↑ "Act of Criteria on Raise of Fines: Article 2". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2009-04-29. Retrieved 2018-01-07.
# Annotated Republic of China Laws/Act of Criteria on Raise of Fines/Article 4

| ←Article 2 to Article 3 | Act of Criteria on Raise of Fines Abolished Republic of China (Taiwan) Law Article 4 | Article 5 to Article 6→ |

## Promulgated amendment on 1993-02-05
### Article 4

    After amendment to this Act, a fine commuted from a punishment imposed by a decision rendered prior to the amendment hereto or a fine imposed but commuted into labor by such a decision shall be calculated on the basis of the ratio as may be ordered in the original irrevocable decision.

## Promulgated abolishment on 2009-04-29

Abolished

## Annotated by Wikibooks

* ↑ "Act of Criteria on Raise of Fines: Legislative History". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). As amended on February 5, 1993. Retrieved 2018-01-07. {{cite web}}: Check date values in: |date= (help)
# Annotated Republic of China Laws/Act of Military Service System
## History

* Enacted and promulgated by Nationalist Government on June 17, 1933.
* Article 7 amended and promulgated by Nationalist Government on March 2, 1935 and put into practice from March 1, 1936.
* Amended and promulgated by Nationalist Government on March 15, 1943.
* Amended and promulgated by Nationalist Government on October 10, 1946.
* Amended and promulgated on December 29, 1951.
* Amended and promulgated on August 16, 1954.
* Article 14, 15, 17 and 49 amended and promulgated on July 31, 1959.
* Article 35 amended and promulgated on July 12, 1974.
* Amended and promulgated on February 2, 2000, and put into practice from the date of promulgation.
* Article 47 and 48 amended and promulgated on December 14, 2005.
* Article 3, 16 and 50 amended and promulgated on March 21, 2007.
* Article 16 amended and promulgated on December 30, 2008.
* Article 44 amended and promulgated on April 29, 2009.
* Article 4, 16, 25, 27, 32, 33, 34, 35, 44 and 45 amended and promulgated, and Article 16-1 and 20-1 enacted and promulgated on December 28, 2011.
* Article 16, 16-1 amended and promulgated on January 2, 2013.
* May 18, 2016 No. 10500042811 Order to amend section 17, 41 and 44
* Order No. 10600072481 of June 14, 2017 amended to amend sections 17 and 35; to add section 44-1
* President of the Republic of China, April 17, 2019, President Hua Yiyi, No. 10800037131 Order to amend section 16 of the amendment
* President Hua Zong Yi Zi No. 10900049611, May 13, 109, Republic of China
Order to amend and publish Articles 20, 43, 44

## Annotated by Wikibooks

* ↑ "Act of Military Service System: Legislative History". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2020-05-13. Retrieved 2022-12-26.
* 1 2 3 4 5 This complete amendment is in a separate page, and later partial amendments are in other separate pages per articles.
# Ada Programming/Attributes/'Fixed Value
## Description

For every fixed-point type S, S'Fixed_Value denotes a function with the following specification:
The value returned is the fixed-point value V such that:
The effect is thus similar to first converting the argument to the integer type used to represent S, and then doing an unchecked conversion to the fixed-point type. The difference is that there are full range checks, to ensure that the result is in range. This attribute is primarily intended for use in implementation of the input-output functions for fixed-point values.
# Ada Programming/Attributes/'Fraction
## Description

X'Fraction(Y) is an Ada attribute where X is any floating-point type and Y is any instance of that type.
X'Fraction(Y) returns the floating point number Y with the exponent replaced with 0. This is the same as X'Compose(Y, 0).

## See also
### Wikibook

* Ada Programming
* Ada Programming/Attributes
* Ada Programming/Attributes/'Compose

### Ada Reference Manual

* 5.3 Attributes of Floating Point Types (Annotated)
* Annex K Language-Defined Attributes (Annotated)
# Ada Programming/Attributes/'Has Discriminants
## Description

The prefix of the Has_Discriminants attribute is a type. The result is a Boolean value which is True if the type has discriminants, and False otherwise. The intended use of this attribute is in conjunction with generic definitions. If the attribute is applied to a generic private type, it indicates whether or not the corresponding actual type has discriminants.
# Ada Programming/Attributes/'Has Same Storage
## Description

Returns True if the representation of X2 occupies exactly the same bits as the representation of X and the objects occupy at least one bit.
For a prefix X that denotes an object:
X'Has_Same_Storage denotes a function with the following specification:
The actual parameter shall be a name that denotes an object. The object denoted by the actual parameter can be of any type. This function evaluates the names of the objects involved. It returns True if the representation of the object denoted by the actual parameter occupies exactly the same bits as the representation of the object denoted by X and the objects occupy at least one bit; otherwise, it returns False.
# Ada Programming/Attributes/'Floor
## Description

X'Floor(Y) is an Ada attribute where X is any floating-point type and Y is any instance of that type. This attribute represents the largest integer value that is less than or equal to Y.

## See also
### Wikibook

* Ada Programming
* Ada Programming/Attributes
* Ada Programming/Attributes/'Ceiling
* Ada Programming/Attributes/'Rounding

### Ada Reference Manual

* 13.3 Operational and Representation Attributes (Annotated)
* Annex K Language-Defined Attributes (Annotated)
# Ada Programming/Attributes/'Fore
## Description

Minimum number of characters needed before the decimal point.
S'Fore yields the minimum number of characters needed before the decimal point for the decimal representation of any value of the subtype S, assuming that the representation does not include an exponent, but includes a one-character prefix that is either a minus sign or a space. (
This minimum number does not include superfluous zeros or underlines, and is at least 2.)
The value of this attribute is of the type universal_integer.
# Ada Programming/Attributes/'From Any
## Description

This internal attribute is used for the generation of remote subprogram stubs in the context of the Distributed Systems Annex.
# Ada Programming/Attributes/'Finalization Size
## Description

The prefix of attribute Finalization_Size must be an object or a non-class-wide type. This attribute returns the size of any hidden data reserved by the compiler to handle finalization-related actions. The type of the attribute is universal_integer.
Finalization_Size yields a value of zero for a type with no controlled parts, an object whose type has no controlled parts, or an object of a class-wide type whose tag denotes a type with no controlled parts.
Note that only heap-allocated objects contain finalization data.
# Ada Programming/Attributes/'First
## Description

X'First, where X is any scalar subtype (for example integer, enumerated, real), is an attribute that represents the first value (lower bound) in the range of X.
A'First, where A is an array, denotes the first index value. For more-dimensional arrays, A'First(N) denotes the first index value of the Nth dimension (N must be static).

## See also
### Wikibook

* Ada Programming
* Ada Programming/Attributes
* Last
* Range

### Ada Reference Manual

* 13.3 Operational and Representation Attributes (Annotated)
* Annex K Language-Defined Attributes (Annotated)
# Ada Programming/Attributes/'Has Access Values
## Description

The prefix of the Has_Access_Values attribute is a type. The result is a Boolean value which is True if the is an access type, or is a composite type with a component (at any nesting depth) that is an access type, and is False otherwise. The intended use of this attribute is in conjunction with generic definitions. If the attribute is applied to a generic private type, it indicates whether or not the corresponding actual type has access values.
# Advanced Interactive Media/Design Team/Goals and Objectives

Below is a list of the team members and their task breakdowns

## Goals and Description

The role of the design team in the Multimedia Recruiting Project is one of the most essential and vital roles of all the teams. They are in charge of designing the look and style of all the elements of the project. They are developing design strategies and screen templates for the video and interactive teams as well as shooting VR's. They design the marketing materials and are striving to hit on alternative advertising. They will create innovative and creative electronic and print materials. They will form a focus group of high school students from the Tulsa area in order to understand the target market more in depth.
The team's goal and objective is to make the project appealing to the target market. Our vision is for not only the design be accepted and enjoyed by the target market, but also create a memorable experience that will make an impression on potential students. They understand the position of influence they have with their audience. They see beyond the design into the possibility that they have to help potential students realize God's call and purpose for their life.
# Advanced Interactive Media/Design Team/Job Description
## Goals and Description

The role of the design team in the Multimedia Recruiting Project is one of the most essential and vital roles of all the teams. They are in charge of designing the look and style of all the elements of the project. They are developing design strategies and screen templates for the video and interactive teams as well as shooting VR's. They design the marketing materials and are striving to hit on alternative advertising. They will create innovative and creative electronic and print materials. They will form a focus group of high school students from the Tulsa area in order to understand the target market more in depth.
The team's goal and objective is to make the project appealing to the target market. Our vision is for not only the design be accepted and enjoyed by the target market, but also create a memorable experience that will make an impression on potential students. They understand the position of influence they have with their audience. They see beyond the design into the possibility that they have to help potential students realize God's call and purpose for their life.
# Advanced Interactive Media/Design Team/Job Descriptions
## Task Breakdown

* Natalie Sullivan2007:
* PutNewDesignDirector'sNameHere2008:
The Design Director is responsible for the overall look and feel for the class project. This person is not responsible to create all graphics but must find ways to collect ideas from class members and, if necessary, make final decision regarding design commitments.
** Communication to all Groups
** Develop Design Strategy
** Design Cohesiveness
** Visual Effects
** Color Scheme
** Design Screen Templates
** Design Marketing Materials
* Jonathan Coussens2007:
** Visual Effects
** Color Scheme
** Design Screen Templates
** Design Marketing Materials
** Shooting VR's
* Nichole Beacham2007:
** Forming Focus Groups
** Writing for Marketing Materials
** Photography
** Design for Marketing Materials
* Natasha Johnson2007:
** Marketing Campaign
** Focus Group
** Alternative Advertising
** Target Market Research
** Production of Materials
** Search for Locations