OpenLLM-France/wikimedia huggingface dataset:
# Ada Programming/Libraries/Ada.Strings.Fixed.Hash Case Insensitive

This language feature has been introduced in Ada 2012.
Ada.Strings.Fixed.Hash_Case_Insensitive is a unit of the Predefined Language Environment since Ada 2012.

## See also
### Wikibook

* Ada Programming/Libraries/Ada
* Ada Programming/Libraries/Ada.Strings
* Ada Programming/Libraries/Ada.Strings.Fixed

### External examples

* Search for examples of Ada.Strings.Fixed.Hash_Case_Insensitive in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Strings.Fixed.Hash_Case_Insensitive in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 2012

* A.4.9: String Hashing
# Ada Programming/Libraries/Ada.Strings.Bounded.Hash Case Insensitive

This language feature has been introduced in Ada 2012.
Ada.Strings.Bounded.Hash_Case_Insensitive is a unit of the Predefined Language Environment since Ada 2012.

## See also
### Wikibook

* Ada Programming/Libraries/Ada
* Ada Programming/Libraries/Ada.Strings
* Ada Programming/Libraries/Ada.Strings.Bounded

### External examples

* Search for examples of Ada.Strings.Bounded.Hash_Case_Insensitive in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Strings.Bounded.Hash_Case_Insensitive in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 2012

* A.4.9: String Hashing
# Ada Programming/Libraries/Ada.Strings.Bounded.Equal Case Insensitive

This language feature has been introduced in Ada 2012.
Ada.Strings.Bounded.Equal_Case_Insensitive is a unit of the Predefined Language Environment since Ada 2012.

## See also
### Wikibook

* Ada Programming/Libraries/Ada
* Ada Programming/Libraries/Ada.Strings
* Ada Programming/Libraries/Ada.Strings.Bounded

### External examples

* Search for examples of Ada.Strings.Bounded.Equal_Case_Insensitive in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Strings.Bounded.Equal_Case_Insensitive in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 2012

* A.4.10: String Comparison
# Ada Programming/Libraries/Ada.Strings.Fixed

This language feature is available from Ada 95 on.
Ada.Strings.Fixed is a unit of the Predefined Language Environment since Ada 95.

## See also
### Wikibook

* Ada Programming/Libraries/Ada
* Ada Programming/Strings

### External examples

* Search for examples of Ada.Strings.Fixed in: Rosetta Code, GitHub (gists), any Alire crate or this Wikibook.
* Search for posts related to Ada.Strings.Fixed in: Stack Overflow, comp.lang.ada or any Ada related page.

### Ada Reference Manual
#### Ada 95

* A.4.3: Fixed-Length String Handling

#### Ada 2005

* A.4.3: Fixed-Length String Handling

#### Ada 2012

* A.4.3: Fixed-Length String Handling

### Open-Source Implementations

FSF GNAT
* Specification: a-strfix.ads
* Body: a-strfix.adb
drake
* Specification: strings/a-strfix.ads
# Ada Programming/Algorithms/Chapter 6
## Chapter 6: Dynamic Programming
### Fibonacci numbers

The following codes are implementations of the Fibonacci-Numbers examples.

#### Simple Implementation

To calculate Fibonacci numbers negative values are not needed so we define an integer type which starts at 0. With the integer type defined you can calculate up until Fib (87). Fib (88) will result in an Constraint_Error.
You might notice that there is not equivalence for the assert (n >= 0) from the original example. Ada will test the correctness of the parameter before the function is called.

#### Cached Implementation

For this implementation we need a special cache type can also store a -1 as "not calculated" marker
The actual type for calculating the fibonacci numbers continues to start at 0. As it is a subtype of the cache type Ada will automatically convert between the two. (the conversion is - of course - checked for validity)
In order to know how large the cache need to be we first read the actual value from the command line.
The Cache array starts with element 2 since Fib (0) and Fib (1) are constants and ends with the value we want to calculate.
The Cache is initialized to the first valid value of the cache type — this is -1.
What follows is the actual algorithm.
This implementation is faithful to the original from the Algorithms book. However, in Ada you would normally do it a little different:
when you use a slightly larger array which also stores the elements 0 and 1 and initializes them to the correct values
and then you can remove the first if path.
This will save about 45% of the execution-time (measured on Linux i686) while needing only two more elements in the cache array.

#### Memory Optimized Implementation

This version looks just like the original in WikiCode.

#### No 64 bit integers

Your Ada compiler does not support 64 bit integer numbers? Then you could try to use decimal numbers instead. Using decimal numbers results in a slower program (takes about three times as long) but the result will be the same.
The following example shows you how to define a suitable decimal type. Do experiment with the digits and range parameters until you get the optimum out of your Ada compiler.
You should know that floating point numbers are unsuitable for the calculation of fibonacci numbers. They will not report an error condition when the number calculated becomes too large — instead they will lose in precision which makes the result meaningless.
# Ada Programming/Algorithms/Intro

Welcome to the Ada implementations of the Algorithms Wikibook. For those who are new to Ada Programming a few notes:
* All examples are fully functional with all the needed input and output operations. However, only the code needed to outline the algorithms at hand is copied into the text - the full samples are available via the download links. (Note: It can take up to 48 hours until the cvs is updated).
* The algorithms in the book are written in a pseudolanguage. Every computer language has its own conventions how to write identifiers; some languages are case sensitive, Ada isn't; some write identifiers in CamelCase. Ada uses the convention of separating words by underscores and capitalizing the first character of each word. For numerical values, Ada uses the convention to separate digit groups by underscores for better readability - compare 10000000 to 10_000_000 or 5000001 to 50_000_01 (e.g. 50 thousand € and one ¢).
* We seldom use predefined types in the sample code but define special types suitable for the algorithms at hand.
* Ada allows for default function parameters; however, we always fill in and name all parameters, so the reader can see which options are available.
* We seldom use shortcuts - like using the attributes Image or Value for String <=> Integer conversions.
All these rules make the code more elaborate than perhaps needed. However, we also hope it makes the code easier to understand
This page is added through transclusion to other modules in the Ada Programming Wikibook.
# Ada Programming/Aspects/Aggregate
## Description

Mechanism to define user-defined aggregates.
# Ada Programming/Algorithms/Chapter 1
## Chapter 1: Introduction

The following subprograms are implementations of the Inventing an Algorithm examples.

### To Lower

The Ada example code does not append to the array as the algorithms. Instead we create an empty array of the desired length and then replace the characters inside.
Would the append approach be impossible with Ada? No, but it would be significantly more complex and slower.
# Becoming a Linguistic Mastermind
## Abstract

* audience: people who are interested in languages or have to learn a language
* learning target: After reading you will be able to achieve respectable language skills within months, without forgetting the aspects of fun.
* contact person: Nowotoj
* co-authors: Strictly desirable. As my English isn’t best yet please be lenient toward me.
* scope and extent: This book should offer one possibility of learning languages and contain the suitable courses. This is not a scientific linguistic book. Grammatical terms are an exception here.
* table of contents:
** Introduction
** The method
** The results
** The courses
*** Workshop
# Becoming a Linguistic Mastermind/Introduction

All courses:
| target languages | source languages |
| English | none so far |
| German | English |
The task of learning a language is one which we all have to tackle sooner or later. It might be at school, where foreign languages are usually compulsory subjects. It might be in our adult lives, where bilingual workers have an advantage in the job market and where people frequently take holidays abroad. It might even be for none of those reasons —rumour has it that there are some people out there learning a language voluntarily!
In the opinion of most people, learning a new language is problematic. The received wisdom is that all languages are difficult to learn —even the relatively simple ones— and that serious progress can only be made after tedious hours of classes, homework, record cards, vocab trainers and boring monolingual dictionaries. Some people might suspect that even hard work is not enough, and that only those of us with the right DNA will have success.
So much for the 'irrefutable facts'. Now we will attempt the impossible; not only by arguing the converse, but by proving that black is white. I’m speaking in the plural because everyone should feel welcome to help the world's language learners out of their present dilemma.
Making child’s play out of learning isn’t such a far-fetched idea. In fact, it has been attempted a hundred times before. This approach has its origins in the observation that children learn their mother tongue through no fault of their own. Some people even learn multiple mother tongues; children whose parents speak different languages often become fluent in both. Furthermore we note that a feeling for a language develops automatically during a stay among native speakers.
We want to synthesize the causes of trouble-free learning so that a language can be spoken fluently and without an accent like in the conditions mentioned above. The end-product will be language courses for people who are suspicious of language courses.
The method will be formulated collectively. This assures a feedback channel from the learner to the textbook, allowing practical experience to help improve it. In addition, disagreements need not lead to partition, but in fact an enhancement of our project.
The following chapter—entitled “The Method”—is devoted to a simple way of becoming a linguistic mastermind. Its content is open to discussion. On no account could it be the last word on the subject.
# Getting Started with Necklaces

Firstly, decide on what pattern you’re going to make. You can make any pattern, like a rainbow, or a two color pattern, or even use just one color in a whole project.
Then begin running each bead one by one into the string.
Be sure to measure the length of the string, and then trying it around your neck, whether it’s by getting someone else or putting it on yourself to get a good feeling of how your necklace should fit, and be sure to leave a little extra that you can then tie around and cut later. (See the bottom on a tip on how to measure it yourself.)
Here’s a tip: If you are measuring by yourself, make sure to put the middle part of your of the string at the back of your neck and run it until the two ends meet at the bottom of your neck, then make a knot around the top that you can easily unknot later.
Then, once you’re done making the rest, get someone to measure it and be sure it fits around your neck. If you are measuring by yourself, see the tip above, then put it around your neck.
Once you’re done, and you are confident in your design, make a secure and tight knot at the top of the necklace (you may need to a make extra knot below the first one you made) and cut off the extra string.
And you’re done! you’ve successfully made your first necklace!
# Becoming a Linguistic Mastermind/The results

All courses:
| target languages | source languages |
| English | none so far |
| German | English |
This book is explicitly not a collection of one teacher’s instructions. It represents the combined wisdom of many learners. Therefore, I would like to ask everyone who is beginning a course to announce it here. Please report on your progress and share your opinions.
Everyone should insert a section beginning with the code =[[User:Username|Username]]=. To help develop a review of the method, they should state how far they have advanced and how many weeks it has taken so far.
In this way we will be able to solve common problems and evaluate the project’s future prospects. (Is this book going in a right direction?)
If everyone shares their thoughts, soon there will be many language courses in various mother-tongues.
# Becoming a Linguistic Mastermind/The courses/Workshop

On this page the lesson texts for the English target language are prepared. Other languages are worked out on the partner projects of Wikibooks. The next steps are not taken until the English texts can be regarded to as discussed fully and ready for press: After that the word-by-word translation must be written and the spoken version must be recorded. These tasks are managed on the respective course page.

# Welcome, learners!

Olivia:
    Welcome ! I am Olivia and this is Jack. We are from England.
Jack:
    Our language is one of the easiest languages in the world.
Olivia:
    In a few months you will be able to understand the English we speak from day to day...
Jack:
    ...and you will be able to understand the Simple English Wikipedia.
Olivia:
    Are you ready ? We will now start learning English the easy way.
70 spoken words

# About the English language

Jack:
    Hello, Olivia!
Olivia:
    Hello, Jack! You said that English is one of the easiest languages in the world.
Jack:
    That's right.
Olivia:
    Why do you think so?
Jack:
    Well, more than half of our words come from Latin. If you speak Italian or French, then you already know many English words.
Olivia:
    I suppose that it's not so easy for Japanese and Finnish people to learn English. They don't know many Latin words.
Jack:
    Learning English is simple for them, too. I think that our language is more regular than others. There are only few irregular forms.
Olivia:
    What do you mean? Can you give an example?
Jack:
    Well, almost everything can be made plural by adding the letter S to the end of the word. One page has many letters, one book has many pages and I have many books. That's just one example.
141 spoken words
# Becoming a Medical Doctor

Becoming a Medical Doctor will be an informative guide to starting a career as a medical professional. It will eventually cover the process of prerequisite study, applications, admissions, medical education, registration and progression towards the medical specialities, for all countries.

## Table of contents

* Overview
* What Being a Doctor Involves
* Country-specific guides
** Australia

## Medical Disclaimer

Wikibooks contains books on many medical topics; however, no warranty whatsoever is made that any of the books are accurate. There is absolutely no assurance that any statement contained or cited in a book touching on medical matters is true, correct, precise, or up-to-date. The overwhelming majority of such books are written, in part or in whole, by nonprofessionals. Even if a statement made about medicine is accurate, it may not apply to you or your symptoms.
The medical information provided on Wikibooks is, at best, of a general nature and cannot substitute for the advice of a medical professional (for instance, a qualified doctor/physician, nurse, pharmacist/chemist, and so on). Wikibooks is not a doctor.
None of the individual contributors, system operators, developers, sponsors of Wikibooks nor anyone else connected to Wikibooks can take any responsibility for the results or consequences of any attempt to use or adopt any of the information presented on this web site.
Nothing on Wikibooks.org or included as part of any project of Wikimedia Foundation Inc., should be construed as an attempt to offer or render a medical opinion or otherwise engage in the practice of medicine.
# Introduction

This book is for kids who will be working with adults to make bead bracelets, as well as parents to learn how to introduce their child to fun and easy crafts.
Do you want to make beautiful bead bracelets and necklaces? If you said yes, then let’s get started!
Firstly, you will need beads. I suggest starting with the dollar store beads (Dollar Tree, Dollar General, etc.)
Next you need a pair of scissors. Kids, please get help from parents before using scissors.
Lastly, you will need string. Any string will work, however I have this one that stretches.
# Becoming a Linguistic Mastermind/The courses

| target languages | source languages |
| English | none so far |
| German | English |
# Applied History of Psychology/Cross-Battery Assessment (Cattell-Horn-Carroll) model
## Cross-Battery Assessment

The Cross Battery Assessment model takes as it starting point the idea of multiple intelligences in multiple areas. The model includes a distinction between fluid (ability to reason) and crystallized (facts) intelligence. This model has become quite popular of late. Recently, popular cognitive and achievement tests have started including this model explicitly in their structure. These include the Woodcock-Johnson Tests of Cognitive Abilities (WJ-III COG) and the Woodcock-Johnson Tests of Achievement, Third Edition (WJ-III ACH). The Kaufman Assessment Battery for Children, Second Edition (KABC-II) also specifically addresses this model.
# Applied History of Psychology/Dynamic Assessments
## Dynamic Assessment

Dynamic Assessment is characterized by an approach first forwarded by Feurstein (1979). Feurstein spoke of the Learning Potential Assessment Device. Feurstein's background was in Israel, working with children displaced by the Holocaust. Feurstein found that on traditional intelligence tests, these children often scored in the very delayed range, but he saw the progress they made with support and the "spark" for learning they had. He thus spoke of the "potential" of children and focused on this ability to change rather than any score. His approach is based on a series of learning tasks with children. Once a child's strategies are uncovered with support (we would characterize this now as "testing of the limits") he would use this knowledge to help children see how to apply these strategies in other situations, specifically within academic tasks.
# Applied History of Psychology/Establishment of the Field
## Wundt and his two psychologies

Wilhem Maximilian Wundt is generally recognized as the founder of experimental psychology, although he also contributed to social psychology (psychology of culture - Völkerpsychologie). Wundt was trained in physiology and psychology. His approach to the study of the mind was ground-breaking in that it was based on systematic and rigorous observation, laying the foundation for the modern psychological experiment. He systematically studied topics such as attention span, reaction time, vision, emotion and time perception.
Wundt's primary method of research was "introspection". This involved training people to concentrate and report on their conscious experiences as they reacted to stimuli. This approach is still used today in modern neuroscience research. For instance, Tibetan monks who have trained themselves to be able to sustain attention are asked to keep track of their inner experiences while undergoing neuroimaging (Carter, Presti, Callistemon, Ungerer, Liu, & Pettigrew, 2005).
Wundt had a very productive career in psychology. He founded the first laboratory dedicated to the scientific study of the mind, supervised a total of 186 doctoral dissertations, taught thousands of students, founded the first scholarly psychological journal (Philosophical Studies), and published a large volume of scientific studies.
# Annotated Republic of China Laws/Nationality Act/Article 5

| ←Article 4 | Nationality Act Republic of China (Taiwan) Law Article 5 | Article 6→ |

## Promulgated full amendment on 2000-02-09
### Article 5

    An alien or a stateless person who has, at present, a domicile in the territory of the Republic of China and who meets one of the requirements specified in sub-paragraphs (2) to (4) of Article 3 and also meets one of the following requirements may apply for naturalization:
* A person who was born in the territory of the Republic of China and whose father or mother was also born in the territory of the Republic of China.
* A person who has legally stayed in the territory of the Republic of China for more than 10 years without interruption.

## Promulgated amendment on 2005-06-15
### Article 5

    A foreign national or stateless person who now has a domicile in the territory of the ROC, if meeting the requisites provided in Subparagraph 2 to Subparagraph 5 of Paragraph 1 of Article 3, under any of the conditions provided by the following Subparagraphs, can also apply for naturalization:
* He/she was born in the territory of the ROC, and his/her father or mother was also born in the territory of the ROC.
* He/she has legally resided in the territory of the ROC for more than 10 consecutive years.

## Annotated by Wikibooks

* ↑ "Law of Nationality". Immigration Office (Taiwan). 2001-06-20. Retrieved 2016-12-28.
* ↑ "Nationality Act: Article 5". Laws & Regulations Database of The Republic of China. Ministry of Justice (Taiwan). 2006-01-27. Retrieved 2016-12-28.
# Annotated Republic of China Laws/Nationality Act/Article 9

| ←Article 6 to Article 8 | Nationality Act Republic of China (Taiwan) Law Article 9 | Article 10→ |

## Promulgated full amendment on 2000-02-09
### Article 9

    An alien who is naturalized in accordance with the provisions of Articles 3 to 7 shall submit a certificate to prove the loss of his (her) original nationality. However, this does not include cases in which responsibility for failing to obtain a certificate does not rest with the person and that the reason for failure has been verified by the Ministry of Foreign Affairs.

## Promulgated amendment on 2016-12-21
### Article 9

(no governmental translation yet)

## Annotated by Wikibooks

* ↑ "Law of Nationality". Immigration Office (Taiwan). 2001-06-20. Retrieved 2016-12-28.