OpenLLM-France/wikimedia huggingface dataset:
# Croatian/Main Contents/Level 1/Lesson 8

Sister: Sestra
Brother: Brat
Mother: Majka
Father: Otac
Mom: Mama
Dad: Tata
Aunt: Tetka, teta (father's or mother's sister), strina (father's brother's wife), ujna (mother's brother's wife)
Uncle: Ujak (mother's brother), stric (father's brother), tetak (uncle-in-law)
Cousin (female): Sestrična
Cousin (male): Bratić
Grandmother: Baka (usually) or Baba (Note: Calling your grandmother baba can be considered rude since it can also mean something like old hag. However, it is used daily in some parts of the Western Balkans)
Grandma: Baka
Grandfather: Djed
Grandpa: Djedica (It's usually called just djed, or dida and deda)
Next Lesson
# Croatian/Main Contents/Level 1/Lesson 9

Seasons: Godišnja doba (means: year ages)
Spring: Proljeće
Summer: Ljeto
Autumn: Jesen
Winter: Zima
Next Lesson
# Croatian/Main Contents/Level 2/Lesson 1
## Nominative case of Masculine, Feminine and Neuter nouns
### Singular/Jednina

Masculine nouns in the nominative case usually do not have a fixed ending. Student, pilot, profesor are all masculine nouns.
Feminine nouns have a fixed ending. If the student is female, the noun would change to studentica. The fixed ending is -ica, or occasionally, just an -a is there, like škola, school or plaža, beach.
Neuter nouns end with -o or -e. Neuter nouns usually can't be changed to masculine or feminine.
| Muški rod (Masculine) | Ženski rod (Feminine) | Srednji rod (Neuter) |
| Student | Student + -ica = Studentica | Vino |
| Professor | Professor + -ica = Profesorica | Jaje |

### Plural/Množina

Masculine nouns, when plural, add -i onto the end of the word. But some masculine nouns, usually those with one syllable and some with two syllables, end with -ov/-ev depending on whether they, in singular, end with palatal consonant, or not. Those masculine nouns, which end with palatal consonant, add -evi to the stem of the word, and those who don't end with a palatal consonant, add -ovi.
* Palatal consonants:
j, lj, nj, đ, dž, č, ć, š, ž
Feminine nouns, when plural, replace the -a with -e onto the end of the word.
Neuter nouns, when plural, replace the -o/-e with -a onto the end of the word. Some nouns insert -en- between the stem and the plural, like ramena, shoulders. Also, some neuter nouns only exist in plural form, such as vrata, door. Finally, some nouns have an irregular plural, meaning they don't always end with -a in plural form, such as uho, ear, in singular, and uši, ears, in plural, or oko, eye, in singular, and oči, eyes in plural.
| Muški rod (Masculine) | Ženski rod (Feminine) | Srednji rod (Neuter) |
| Student + -i = Studenti | Studentica -> Studentic + -e = Studentice | Vino -> Vin + -a = Vina |
| Kralj + -evi = Kraljevi | Profesorica -> Profesoric + -e = Profesorice | Jaje -> Jaj + -a = Jaja |
| Grad + -ovi = Gradovi | Škola -> Škol + -e = Škole | Ime -> Imen + -a = Imena |
Next lesson
# Croatian/Main Contents/Level 2/Lesson 10

The genitive case is used primarily to denote possession. It is also used after a large number of prepositions. Examples: Ovo je kuća moje tete. - This is my aunt's house. Kuća je izgrađena od cigala. - The house is built from bricks. Otac Quijote naručio je osamljenički ručak od svoje domaćice. - Father Quijote has ordered his solitary lunch from his housekeeper. Krenuo je kupiti vino u mjesnoj zadružnoj prodavaonici udaljenoj osam kilometara od El Tobosa. - He set off to buy wine at a local cooperative eight kilometers away from El Tabos.

### Endings
#### Singular

1) first or a-declination ending: -a Examples: stol (m,table) -> stola broj (m,number) -> broja nebo (n, sky) -> neba vrijeme (n, time) -> vremena 2) second or e-declination ending: -e Examples: žena (f,woman) -> žene ptica (f, bird) -> ptice sluga (m, servant) -> sluge vođa (m, leader) -> vođe 3) third or i-declination ending: -i Examples: noć (f, night) -> noći ljubav (f, love) -> ljubavi

#### Plural

Some nouns change stress! 1) first or a-declination endings: long -a {ā}, -i Examples: medvjed {mèdvjed} (m, bear) -> medvjeda {mȅdvjēdā} stol {stôl}(m, table) -> stolova {stȍlōvā} selo {sèlo}(n, village) -> sela {sélā} polje {pȍlje}(n, field) -> polja {pȏljā}
* in this form {genitiv plural} you have "a" that in other forms doesn't appears, but it's also long
Examples: nokat (m, nail) -> nokata {nokātā} pas {pȁs}(m, dog) -> pasa {pásā} Some masculine nouns get an -i {ī}: Examples: sati, hvati, pari, ari, mjeseci, prsti, gosti, mravi, zubi, ljudi ( Nouns prst, gost, nokat have -iju: prstiju, gostiju, noktiju. Some nouns can have more than one ending: nokat - nokātā, noktiju prst - prstā, prsti, prstiju gost - gosti, gostiju zub - zubā, zubi 2) second or e-declination ending: long -a {ā} (long -a for masculine, and -a, -i, -u for feminine) Ending -a can have every noun. Some of them have "nepostojano a". Examples: žena {žèna}-> žena {žénā} ptica {ptȉca}-> ptica {ptȋcā} vođa {vȍđa}-> vođa {vȏđā} "nepostojano a" in feminine nouns If group (nouns without -a that has more than one consonant) ends with -l (igla -> iglā/igala), -lj (zemlja -> zemljā/zemalja), -m (pjesma -> pjesmā/pjesama), -r (sestra -> sestrā/sestara), -v (bukva -> bukvā/bukava) or -k (djevojka -> djevojkā/djevojaka) And in groups with db (naredba -> naredbā/naredaba), džb (svjedodžba -> svjedodžbā/svjedodžaba), žb (optužba -> optužbā/optužaba) Ending -i strepnji, sekundi, himni, pravdi Ending -u only noga, ruka and sluga {nogu, ruku, slugu} Many nouns can have all three endings (a, i and a with "nepostojano a"): izložaba/izložba/izložbi, narudžaba/narudžba/narudžbi, priredaba/priredba/priredbi) Some nouns can have -a and -i (nouns that don't have "nepostojano a"): tajna/tajni, strepnja/strepnji, sekunda/sekundi. Groups nc and nč can have "nepostojano a", but they even don't: naranča/naranača/naranči 3) third or i-declination ending: -i ljubav -> ljubavi laž -> laži Nouns kokoš, kost and uš: kokoši/kokošiju, kosti/kostiju, uši/ušiju.
# Croatian/Main Contents/Level 2/Lesson 12

It's using as direct object and with some prepositions. Example Išao sam u školu. Pjevamo pjesmu. Šetamo kroz šumu.

## Singular

1) first or a-declination ending: -a, or - {neuter nouns have -, masculine -a for something alive, or - for something that isn't alive) čovjek (man, human)-> čovjeka stol -> stol nebo -> nebo 2) second or e-declination ending: -u žena -> ženu sluga -> slugu 3) third or i-declination ending: - ljubav -> ljubav laž -> laž

## Plural

1) first or a-declination ending: -e (masculine) -a (neuter) stol -> stolove čovjek {irregular, N.pl. is ljudi) -> ljude nebo -> neba selo -> sela 2) second or e-declination ending: -e žena -> žene ptica -> ptice sluga -> sluge 3) third or i-declination ending: -i ljubav -> ljubavi noć -> noći
# Croatian/Main Contents/Level 2/Lesson 16

Sibilarization is sound changing, when k, g and h in front of -i change to c, z, s (k,g,h->c,z,s/_i). You can find sibilarization in:
* dative and locative singular of feminine nouns
* nominative, vocative, dative, locative, instrumental plural of masculine nouns
* imperative
Examples ruci -> ruka + i = ruk i (k->c/_i) = ruci nozi -> noga + i = nog i (g->z/_i) = nozi snasi -> snaha + i = snah i (h->s/_i) = snasi vojnici -> vojnik + i = vojnik i (k->c/_i) = vojnici grijesima -> grijeh + ima = grijeh i ma (h->s/_i) = grijesima reci (as verb) -> rek + i -> rek i (k->c/_i) = reci reci (as noun) -> redak + i = redak i ("nepostojano a") = redk i (k->c/_i) = redci ("gubljenje suglasnika") = reci
# Croatian/Main Contents/Level 2/Lesson 11

It's used as an indirect object and after some prepositions. Examples: Dao sam ti pismo. Bio im je gospodar. Bila je prekrasna, slična zvijezdama na nebu.

## Singular

1) first or a-declination ending: -u Examples: stol -> stolu broj -> broju nebo -> nebu djete -> djetetu 2) second or e-declination ending: -i žena -> ženi ptica -> ptici vođa -> vođi Sibilarization (k,g,h->c,z,s/_i)
ruka -> ruci noga -> nozi svrha -> svrsi Exceptions (sibilarization doesn't have):
# Croatian/Main Contents/Level 2/Lesson 2
## Verb "biti" (to be) / Glagol "biti"
### Personal pronouns / Osobne zamjenice

| Hrvatski | Engleski |
| Ja | I |
| Ti | you |
| On | he |
| Ona | she |
| Ono | it |
| Mi | we |
| Vi | you (plural, polite) |
| Oni | They (muški rod) |
| One | They (ženski rod |
| Ona | They (srednji rod) |

### Verb "biti

| Pronoun | Biti | Affirmative of biti | Negative of biti |
| Ja | sam | Jesam | Nisam |
| Ti | si | Jesi | Nisi |
| On | je | jest/jeste or je | Nije |
| Ona | je | jest/jeste or je | Nije |
| Ono | je | jest/jeste or je | Nije |
| Mi | smo | Jesmo | Nismo |
| Vi | ste | Jeste | Niste |
| Oni | su | Jesu | Nisu |
| One | su | Jesu | Nisu |
| Ona | su | Jesu | Nisu |

#### Unstressed (short forms)

| P.P. | Biti | in Split |
| Ja | sam | u Splitu |
| Ti | si | u Splitu |
| On | je | u Splitu |
| Ona | je | u Splitu |
| Ono | je | u Splitu |
| Mi | smo | u Splitu |
| Vi | ste | u Splitu |
| Oni | su | u Splitu |
| One | su | u Splitu |
| Ona | su | u Splitu |

#### Interrogative

| Jesam | li | (ja) | u školi? |
| Jesi | li | (ti) | u školi? |
| Je | li | (on) | u školi? |
| Je | li | (ona) | u školi? |
| Je | li | (ono) | u školi? |
| Jesmo | li | (mi) | u školi? |
| Jeste | li | (vi) | u školi? |
| Jesu | li | (oni) | u školi? |
| Jesu | li | (one) | u školi? |
| Jesu | li | (ona) | u školi? |
Next Lesson
# Algorithm Implementation/Sorting/Gnome sort
## C++
### C++ using bidirectional iterators
### Optimized C++ using iterators

The optimized version makes the "gnome" (represented by the 'current' iterator here) leap back to the right i.e. to the place where it needed to swap the flower pots on its farthest reached position so far. This also avoids redundant comparisons. On average the optimization results in cutting the time by one/third on a modern x86 machine. (A wise gnome sort? :). However, the optimization works best if the iterators are random access iterators. Otherwise the algorithm works almost like the non-optimized version - it still avoids redundant comparisons though.

## C#
## Rust

This is the optimized version of Gnome Sort with the jump/leap optimization coded in Rust.

## Optimized Gnome Sort in Java

This variant of Gnome Sorts allows the sorting algorithm to quickly resume the sorting process after placing n on its correct spot by skipping through the sorted portion of the array entirely, instead of looping through it, reducing comparisons.

## LavishScript

This sorts an scope-accessible index:objectype (IndexName) passed by variable name, sorting by MemberName, which should be a numeric member of objecttype.
# Algorithm Implementation/Sorting/Heapsort
## Basic heapsort

With an existing heap data structure, a basic heapsort is simple to implement.

### Common Lisp

This is an almost direct translation of the heapsort pseudocode found at Wikipedia, taking a list of scalars as input.

### Python
## In-place heapsort

The disadvantage of the basic method is its memory requirement; it requires both an array and a heap of size n.
If we realize that heaps can be stored as arrays, a solution presents itself: Store the heap in the same array as the unsorted/sorted elements.

### C

This is a fast implementation of heapsort in C, adapted from Numerical Recipes in C but designed to be slightly more readable and to index from 0.

### Ocaml

This implementation is in place and uses the imperative features of the language such as loops and mutable reference cells.
Example of use:
# Algorithm Implementation/Sorting/Comb sort
## C

Comb Sort 11
Comb Sort 9

## Python

* ↑ "A Fast Easy Sort", Byte Magazine, April 1991
# Algorithm Implementation/Sorting/Patience sort
## C++

Given a generic STL-style input iterator to a sequence, we shall call its elements' value type card_type, and assume that we have some container of cards PileType (an example could be vector<card_type>), and a container of piles TableType (which, again, could be just a vector of piles).
In this case, one can define the patience sorting as follows:
For the std::lower_bound algorithm to work, a tiny utility comparator functor is needed:

## Clojure

Implementation using the Patience Sort approach. The elements (newelem) put on a pile combine the "card" with a reference to the top of the previous stack, as per the algorithm. The combination is done using cons, so what gets put on a pile is a list—a descending subsequence.
Output:

## References

* ↑ http://rosettacode.org/wiki/Longest_increasing_subsequence#Clojure
# Algorithm Implementation/Sorting/Pigeonhole sort

All the examples currently on this page seem to be implementations of counting sort and not pigeonhole sort. Pigeonhole sort, when sorting a complex data structure with a key, keeps track of all the elements on a certain key (because equal elements are still distinct); rather than just keep a count like counting sort (which is only applicable to simple value types).

## C99

Note that min and max could also easily be determined within the function.
# Algorithm Implementation/Sorting/Insertion sort
## Ada

Sorts an array of integers.

## C/C++

In C:
In C++:
In C++, half insertion sort:

## C#
## C# 2.0

This example sorts a list of objects of any type T that implements IComparable. It demonstrates C# 2.0 generics and in particular the "where" clause.

## Fortran 90/95

This implementation of Insertion sort follows closely the implementation that can be found in the GPL FORTRAN 90/95 GPL library AFNL.

## F#
## Java

another general implements.

## OCaml
### In lists
### shorter version

The insert function is the same as above.

## Pascal

Linked list version

## Standard ML
### shorter version

The insert function is the same as above.

## Ruby

It sorts the original array.

## Swift

In Swift:

## NASM

C prototype is
Assembler routine is

## VB

And here's something a little bit quicker.
# Algorithm Implementation/Sorting/Introsort
## Ruby

Ruby implementation with simple test
# Algorithm Implementation/Sorting/Merge sort
## Merge Sort

You start with an unordered sequence. You create N empty queues. You loop over every item to be sorted. On each loop iteration, you look at the last element in the key. You move that item into the end of the queue which corresponds to that element. When you are finished looping you concatenate all the queues together into another sequence. You then reapply the procedure described but look at the second last element in the key. You keep doing this until you have looped over every key. When you complete this process the resulting sequence will be sorted as described above.

### Key Comparing

Keys are compared in the following way: Let k$_a$ be the key of the one item, called item A, let k$_b$ be the key of the other item, called item B. Let k$_a$(i) be the ith entry in the key k$_a$, where the first entry is at index 0. Let i = 0. If the keys are less than i elements long then the keys are equal. If k$_a$(i) < k$_b$(i), then item A is ordered before item B. If k$_a$(i) > k$_b$(i), then item B is ordered before item A. If k$_a$(i) = k$_b$(i), then add one to i, and return the line under "Let i = 0."

### Time Cost

Let n$_i$ be the number of items in the sequence to be sorted. N is number of integers that each key element can take. Let n$_k$ be the number of keys in each item.
The total time to sort the sequence is thus O(n$_k$(n$_i$ + N)).

### Common Lisp

Naive implementation, translation of pseudocode found at Wikipedia.
Simpler Implementation in a somewhat more functional style.

### C++

A recursive implementation using the C++14 standard library.

### Haskell

A slightly more efficient version only traverses the input list once to split (note that length takes linear time in Haskell):

### Prolog

This is an ISO-Prolog compatible implementation of merge sort.

### Python

A "standard" mergesort:
An alternative method, using a recursive algorithm to perform the merging in place (except for the O(log n) overhead to trace the recursion) in O(n log n) time:

### JavaScript

Separate into two functions:

### OCaml

Using a functor to create modules that specialize sorting lists of a given type with a particular comparison function:
# Algorithm Implementation/Sorting/Counting sort
## JavaScript

JavaScript implementation with simple HTML test page

## Python

Note: that this implementation does not need the temporary scratch array. It sorts in-place, except it needs the counting array. The emit step does not copy original values from the input array but creates new ones.

## Ruby

Unlike the Python version, this doesn't sort in-place, but returns a new array.
# Georgia Water/Information

* Water Policy
* Management
* Information
* Planning
* Statewide Plan
* Regional Plans
* References
Chapter 4. Information
4.1. Rivers, Lakes, Aquifers
4.2. Directory - People
4.3. Directory - Organizations
4.4. Education and Training
4.5. Research
4.6. Water Law and Policy
4.7. Best Practices and Examples
4.8. Plans and Proposals
4.9. Major Water Projects
4.10. Funding Programs
4.11. Technical Assistance
4.12. Data and Maps
4.13. News
4.14. History and Culture
4.15. References
# Georgia Water/External Links/Organizations/Georgia Water Resources Council
## Overview

The Georgia Water Resources Council was created by Executive Order of Governor Sonny Perdue on October 20, 2003, with charge to recommend the contents and scope for a comprehensive state water management plan. The Council's recommendations were submitted to the Governor on January 6, 2004. The Council is now disbanded but superseded by the Georgia Water Council which has similar membership and charge to create the Statewide Water Plan.

## Membership

* Carol A. Couch, Ph.D., (Chair), Director, Georgia Environmental Protection Division
* Hugh Gillis (ex-officio), State Senator and Co-Chair, Joint Water Study Committee
* Lonice C. Barrett, Commissioner, Georgia Department of Natural Resources
* Maria Greene, Acting Commissioner, Georgia Department of Human Resources
* Mike Beatty, Commissioner, Georgia Department of Community Affairs
* Bob Hanner (ex-officio), State Representative and Co-Chair, Joint Water Study Committee
* Wm. David Bennett, Executive Director, Georgia Soil & Water Conservation Commission
* Tommy Irvin, Commissioner, Georgia Department of Agriculture
* Paul R. Burks, Executive Director, Georgia Environmental Facilities Authority
* William R. Lazenby, Interim Director, Georgia Forestry Commission

## Documents

* Cover memo to Governor Perdue
* Table of Contents (condensed) for Comprehensive State Water Plan
* Table of Contents (detailed) for Comprehensive State Water Plan
# Georgia Water/External Links/Research
### Research Programs in Georgia

* U.S. Environmental Protection Agency, National Environmental Research Laboratory, Ecosystems Research Division
* Georgia Water Resources Institute prepares an annual list of priority research topics for Georgia, with input from Georgia EPD and other organization. The priority list is used as basis for evaluating the relevance of research proposals submitted by Georgia university faculty.
* Georgia Water Planning and Policy Center in Albany, Georgia.

### Management Research Needs

* How many people in Georgia are working on water resources issues (government, university, some NGOs) and could potentially help with implementing parts of the (broadly envisioned) river basin management plans?

### Ideas for Student Research Topics

* Equator Principles Financial Institutions - several major US banks have adopted environmental and fair labor standards for funding project over $10 million. Need research on details of these principles, list of Georgia banks using these principles, list of projects in Georgia financed under these principles, information about success of this initiative and how it could be expanded and/or improved.
# Georgia Water/History

* Water Policy
* Management
* Information
* Planning
* Statewide Plan
* Regional Plans
* References
Chapter 5. Planning
    5.3. History of Water Resources Planning in Georgia
          Contributors
   * 1963 - Southeastern River Basin Plans by river basin
   * 1974 - CWA Section 303e River Basin Water Quality Reports by river basin
   * 1981 - State Planning Grant from U.S. Water Resources Council
   * 1984 - EPD Water Use and Availability Reports by river basin
   * 1989 - Georgia Growth Strategies Commission
   * 1990 - Georgia Regional Reservoir Plan (appendix in West Georgia Reservoir report)
   * 1992 - Georgia River Basin Management Planning Act, plans for each river basin
   * 1998 - ACF Comprehensive Study
   * 2002 - Georgia Joint Study Committee Report
   * 2003 - Metropolitan North Georgia Water Resources Planning District
   * 2003 - Georgia Drought Management Plan
   * 2004 - Georgia Comprehensive Statewide Water Resources Planning Act
   * 2005 - Georgia Coastal Sound Science Initiative
# Georgia Water/External Links/People

Instructions for adding your name to the roster below.

## A

* Alber, Merryl . . . . University of Georgia, Marine Sciences, Athens

## B

* Bennett, David . . . . Georgia Soil and Water Conservation Commission, Athens
* Bethea, Sally S.. . . . Upper Chattahoochee Riverkeeper, Atlanta

## D

* Donaghue, Robert (Bob). . . . Georgia DNR Pollution Prevention Assistance Division, Atlanta

## H

Kathryn J. Hatcher - .... University of Georgia
# Georgia Water/External Links/Projects
### Interbasin transfers

* Interbasin transfers in Georgia, 2001 (Table 1, page 17; Figure 1, page 18)

### Navigation projects

* Savannah Harbor Expansion Project - 2005

### Reservoirs

* Savannah River reservoirs
* List of USACE projects with water supply purpose
* List of dams owned by local government, by county in Georgia
* Water Supply Reservoirs Pending (in 2001) Corps of Engineers or EPD Permit and which are exempt from the interim instream flow protection policy. (Table 1, page 32)

### Restoration projects

* Project Management Plan for Feasibillity Study: Lake Allatoona / Etowah River Watershed Ecosystem Restoration and Resources Protection, Lake Allatoona, Georgia, U.S. Army Corps of Engineers - Mobile District, May 2002.
# Annotations to James Joyce's Ulysses/Wandering Rocks/220
## Annotations

Di che? ... Scusi, eh? Tante belle cose! (Italian) For what? ... Excuse me, eh? All the best! I don't understand what Artifoni's eh? means in this context.

## References

* ↑ Gifford (1988) 266.
# Annotations to James Joyce's Ulysses/Wandering Rocks/226
## Annotations

deshabillé (Errata) Gabler (1984) emends this to deshabille, which is the form printed in The Little Review in 1919. The correct French spelling is déshabillé. Other editions of Ulysses opt for the French form.
déshabillé a garment worn when one is in a state of undress; a négligée.
embonpoint voluptuous plumpness.

## References

* ↑ The Little Review, Volume 6, Number 3 (July 1919), p.31.
# C++ Language/Std/FilesystemAccess/Directories

Concatenating drive, directory, filename, and extension strings into one long path string used to be done by _makepath, but now the std::filesystem::path can do so more elegantly (using its / operator).
Some of the most common OS shell commands have C++ versions, such as _chdir, _mkdir, and _rmdir.
Additional information about directories
# C++ Language/Std/FilesystemAccess/ConsoleIo

The _kbhit function pauses until console-user presses a key. Then, _inp reads a byte from the console.
Additional information about interacting with the console
# C++ Language/Std/FilesystemAccess

A major component of the computer's operating system is its "filesystem", which stores data within "files". A C++ program can interact with that filesystem.
* Moving and Deleting
* Directories
* Binary-Files
* Formatted I/O
* Newline-Converted-Files
* Size of a File
* Redirecting stdout
* Pipes
* Console I/O
* Streamed I/O
# C++ Language/Std/FilesystemAccess/FormattedIo

A standard-file can also use the formatted-operations fprintf and fscanf.
Additional information about formatted I/O
# C++ Language/Std/CRuntime/Time/TimespanAsCpuClockticks

The C-Runtime keeps track of the amount of time elapsed since the library started running within your program. Query that value by calling std::clock.
Additional information about the clock function (includes interactive examples)