text:
The Sakha language

Contents
Welcome to the Wikibooks lessons of the Sakha language! (I called Sakha instead of Yakut as it too similar to the brand name of prebiotic beverages Yakult sorry for me (Daniel Willett) being too humorous there). You can also find some other humorous vibes here. In addition to humorous things, I also simplified some details so people can understand.

Let's go into the introduction. Sakha is a language spoken by some 450,000 of the Sakha population in the Sakha Republic, Russia.

Prelude

 * 1) /Phonology and alphabet/

Lessons

 * 1) First lesson: Nouns

title: The Sakha language


text: Category:Book:The Sakha language

license: Creative Commons - Attribution Share-Alike - https://creativecommons.org/licenses/by-sa/4.0/

title: Category:Book:The Sakha language


text:
The Sakha language/Phonology and alphabet

Morphology notes
In Sakha, there are numerous consonant assimilations that differ by suffixes. As in /Nouns, there are also articulation of the corresponding native consonants. The definitions include:
 * Sonorants: In most cases, all sonorant consonants (й, р) except nasals. The suffix form's first letter usually has voiced consonants.
 * Nasals: All nasal consonants (м, н, ҥ). The suffix form's first letter usually has м or н. However I found a Chinese-language source that the plural suffix -ЛАр, for example, have the assimilated form -ҥАр after -ҥ- (тииҥ → тииҥҥар), although in fact, the nasal velar variant is almost non-existent except the Baidu Baike page and its mirrors.


text: Mathematics of the Jewish Calendar/Printable version


text:
User talk:DDG9912

Welcome
Welcome, DanielWillett25!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:50, 28 January 2022 (UTC)

title: User talk:DDG9912


text:
User talk:ShubhangiAgarwalla

Welcome
Welcome, ShubhangiAgarwalla!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:50, 28 January 2022 (UTC)

title: User talk:ShubhangiAgarwalla


text:
User talk:Ahmetlii

Welcome
Welcome, Ahmetlii!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:51, 28 January 2022 (UTC)

title: User talk:Ahmetlii


text:
User talk:Dmcduffie3

Welcome
Welcome, Dmcduffie3!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:51, 28 January 2022 (UTC)

title: User talk:Dmcduffie3


text:
User talk:Wojkiasip

Welcome
Welcome, Wojkiasip!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:51, 28 January 2022 (UTC)

title: User talk:Wojkiasip


text:
User talk:Jivesh verma

Welcome
Welcome, Jivesh verma!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:52, 28 January 2022 (UTC)

title: User talk:Jivesh verma


text:
User talk:Assistedlivingsandiego1

Welcome
Welcome, Assistedlivingsandiego1!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:52, 28 January 2022 (UTC)

title: User talk:Assistedlivingsandiego1


text:
User talk:QuickQuokka

Welcome
Welcome, QuickQuokka!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:53, 28 January 2022 (UTC)

title: User talk:QuickQuokka


text:
User talk:Dr-Taher

Welcome
Welcome, Dr-Taher!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 13:53, 28 January 2022 (UTC)

title: User talk:Dr-Taher


text:
Salute, Jonathan!/Preface

'''Salute, Jonathan! The Occidental Language by the Direct Method'''

Salute, Jonathan! (Hello, Jonathan!) is the story of a young Englishman who goes to visit his friend in another European country...or so it would seem.

It is written entirely in the language Occidental (Interlingue), a language created by Edgar de Wahl from Tallinn (Estonia) that he published in 1922. The book Salute, Jonathan! was written by Mithridates and published on Wikibooks in 2019.

Salute, Jonathan! begins with very simple language. The first words in the book are Un mann sta in un cité (a man stands in a city), and it continues from there. The words the reader knows are repeated and new words are added slowly and in context, so that no dictionary is required to read it. Occidental was created to be an international language, with a very simple and straightforward grammar. Thanks to its simplicity and regularity, you will know how to read and use it by the end of Salute, Jonathan!.

The method in the book is based on the same used in books such as English by the Nature Method, Le français par la méthode nature, and L'italiano secondo il metodo natura, as well as Hans Ørberg's Lingua Latina per se Illustrata.

Curious about the true nature of the story in the book? You will begin to get clues as to the true story around Chapter 4 as the language becomes more and more complex and an actual story begins to form. Salute, Jonathan! is in fact a full translation of a classic book that you are likely very familiar with. Read on to find out!

title: Salute, Jonathan!/Preface


text: Pokémon/Pokédex/Greninja

title: Pokémon/Pokédex/Greninja


text:
User talk:Melldd

Welcome
Welcome, Melldd!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:56, 28 January 2022 (UTC)

title: User talk:Melldd


text:
User talk:5423lola

Welcome
Welcome, 5423lola!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:57, 28 January 2022 (UTC)

title: User talk:5423lola


text:
User talk:Darshan k c

Welcome
Welcome, Darshan k c!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:57, 28 January 2022 (UTC)

title: User talk:Darshan k c


text:
User talk:Vjve139

Welcome
Welcome, Vjve139!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:57, 28 January 2022 (UTC)

title: User talk:Vjve139


text:
User talk:TheLar1sa

Welcome
Welcome, TheLar1sa!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:57, 28 January 2022 (UTC)

title: User talk:TheLar1sa


text:
User talk:Paki453

Welcome
Welcome, Paki453!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:59, 28 January 2022 (UTC)

title: User talk:Paki453


text:
User talk:Bryce499671404

Welcome
Welcome, Bryce499671404!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:59, 28 January 2022 (UTC)

title: User talk:Bryce499671404


text:
User talk:Lokipas20

Welcome
Welcome, Lokipas20!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 19:59, 28 January 2022 (UTC)

title: User talk:Lokipas20


text:
User talk:Patkica-kvak-kvak

Welcome
Welcome, Patkica-kvak-kvak!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:00, 28 January 2022 (UTC)

title: User talk:Patkica-kvak-kvak


text:
User talk:Hrkica

Welcome
Welcome, Hrkica!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:00, 28 January 2022 (UTC)

title: User talk:Hrkica


text:
User talk:DieterKaler959

Welcome
Welcome, DieterKaler959!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:00, 28 January 2022 (UTC)

title: User talk:DieterKaler959


text:
User talk:Trifko09

Welcome
Welcome, Trifko09!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:01, 28 January 2022 (UTC)

title: User talk:Trifko09


text:
User talk:Random man 345

Welcome
Welcome, Random man 345!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:01, 28 January 2022 (UTC)

title: User talk:Random man 345


text:
User talk:Amo khazi

Welcome
Welcome, Amo khazi!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:01, 28 January 2022 (UTC)

title: User talk:Amo khazi


text:
User talk:Korioki

Welcome
Welcome, Korioki!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:02, 28 January 2022 (UTC)

title: User talk:Korioki


text:
User talk:NoahOliver07

Welcome
Welcome, NoahOliver07!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:02, 28 January 2022 (UTC)

title: User talk:NoahOliver07


text:
User talk:Bolami63

Welcome
Welcome, Bolami63!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:02, 28 January 2022 (UTC)

title: User talk:Bolami63


text:
User talk:Pavle Radovic

Welcome
Welcome, Pavle Radovic!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:02, 28 January 2022 (UTC)

title: User talk:Pavle Radovic


text:
User talk:.dsbfl

Welcome
Welcome, .dsbfl!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:02, 28 January 2022 (UTC)

title: User talk:.dsbfl


text:
User talk:Hisanban

Welcome
Welcome, Hisanban!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:03, 28 January 2022 (UTC)

title: User talk:Hisanban


text:
User talk:Np12344

Welcome
Welcome, Np12344!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:03, 28 January 2022 (UTC)

title: User talk:Np12344


text:
User talk:Dimison0811

Welcome
Welcome, Dimison0811!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:03, 28 January 2022 (UTC)

title: User talk:Dimison0811


text:
User talk:Dimison08112009

Welcome
Welcome, Dimison08112009!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:04, 28 January 2022 (UTC)

title: User talk:Dimison08112009


text:
User talk:DimaMita0811

Welcome
Welcome, DimaMita0811!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:04, 28 January 2022 (UTC)

title: User talk:DimaMita0811


text:
User talk:Blisshome1

Welcome
Welcome, Blisshome1!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:05, 28 January 2022 (UTC)

title: User talk:Blisshome1


text:
User talk:SohaibShujah

Welcome
Welcome, SohaibShujah!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:05, 28 January 2022 (UTC)

title: User talk:SohaibShujah


text:
User talk:Blackwalnutkb

Welcome
Welcome, Blackwalnutkb!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:05, 28 January 2022 (UTC)

title: User talk:Blackwalnutkb


text:
User talk:Cricmazza1

Welcome
Welcome, Cricmazza1!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:05, 28 January 2022 (UTC)

title: User talk:Cricmazza1


text:
User talk:Nrco0e

Welcome
Welcome, Nrco0e!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:07, 28 January 2022 (UTC)

title: User talk:Nrco0e


text:
User talk:Megalithwatch

Welcome
Welcome, Megalithwatch!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:07, 28 January 2022 (UTC)

title: User talk:Megalithwatch


text:
User talk:AbstractEntity

Welcome
Welcome, AbstractEntity!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:07, 28 January 2022 (UTC)

title: User talk:AbstractEntity


text:
User talk:CrazyAsu

Welcome
Welcome, CrazyAsu!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:09, 28 January 2022 (UTC)

title: User talk:CrazyAsu


text:
User talk:Josephmarletta7

Welcome
Welcome, Josephmarletta7!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:09, 28 January 2022 (UTC)

title: User talk:Josephmarletta7


text:
User talk:Ashly Noreen

Welcome
Welcome, Ashly Noreen!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:09, 28 January 2022 (UTC)

title: User talk:Ashly Noreen


text:
User talk:ReadyKW

Welcome
Welcome, ReadyKW!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:10, 28 January 2022 (UTC)

title: User talk:ReadyKW


text:
User talk:Alicia maria fileni

Welcome
Welcome, Alicia maria fileni!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:10, 28 January 2022 (UTC)

title: User talk:Alicia maria fileni


text:
User talk:Cntgfyblrf

Welcome
Welcome, Cntgfyblrf!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:10, 28 January 2022 (UTC)

title: User talk:Cntgfyblrf


text:
User talk:SiberianUnicorn

Welcome
Welcome, SiberianUnicorn!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:10, 28 January 2022 (UTC)

title: User talk:SiberianUnicorn


text:
User talk:GeorgeSandersonV2

Welcome
Welcome, GeorgeSandersonV2!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:11, 28 January 2022 (UTC)

title: User talk:GeorgeSandersonV2


text:
User talk:Javaslot8

Welcome
Welcome, Javaslot8!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:11, 28 January 2022 (UTC)

title: User talk:Javaslot8


text:
User talk:Boikgantsho matshaba

Welcome
Welcome, Boikgantsho matshaba!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:11, 28 January 2022 (UTC)

title: User talk:Boikgantsho matshaba


text:
User talk:Seema kauser

Welcome
Welcome, Seema kauser!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:11, 28 January 2022 (UTC)

title: User talk:Seema kauser


text:
User talk:IlyukhaPhentee

Welcome
Welcome, IlyukhaPhentee!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:11, 28 January 2022 (UTC)

title: User talk:IlyukhaPhentee


text:
User talk:Phoenixbailey3207

Welcome
Welcome, Phoenixbailey3207!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:12, 28 January 2022 (UTC)

title: User talk:Phoenixbailey3207


text:
User talk:M0rix32

Welcome
Welcome, M0rix32!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:12, 28 January 2022 (UTC)

title: User talk:M0rix32


text:
User talk:Hevit 123

Welcome
Welcome, Hevit 123!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:12, 28 January 2022 (UTC)

title: User talk:Hevit 123


text:
User talk:Wordplay7

Welcome
Welcome, Wordplay7!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:12, 28 January 2022 (UTC)

title: User talk:Wordplay7


text:
User talk:Delowarr123

Welcome
Welcome, Delowarr123!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:12, 28 January 2022 (UTC)

title: User talk:Delowarr123


text:
User talk:Foryinath

Welcome
Welcome, Foryinath!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:13, 28 January 2022 (UTC)

title: User talk:Foryinath


text:
User talk:Pankaj1505

Welcome
Welcome, Pankaj1505!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:13, 28 January 2022 (UTC)

title: User talk:Pankaj1505


text:
User talk:Meeeeeeeeeeeeeeeeeep

Welcome
Welcome, Meeeeeeeeeeeeeeeeeep!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:13, 28 January 2022 (UTC)

title: User talk:Meeeeeeeeeeeeeeeeeep


text:
User talk:MJGRRod

Welcome
Welcome, MJGRRod!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:13, 28 January 2022 (UTC)

title: User talk:MJGRRod


text:
User talk:RozareI

Welcome
Welcome, RozareI!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:13, 28 January 2022 (UTC)

title: User talk:RozareI


text:
User talk:Shanndaman111

Welcome
Welcome, Shanndaman111!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:14, 28 January 2022 (UTC)

title: User talk:Shanndaman111


text:
User talk:Tenryuu

Welcome
Welcome, Tenryuu!

If you have any questions, you can ask in the assistance reading room or possibly contact me personally. -Gifnk dlm 2020 From Middle English Wikipedia 📜📖💻 (talk) 20:14, 28 January 2022 (UTC)

title: User talk:Tenryuu


text:
Cookbook:Marzipan

Marzipan is a sweetened almond paste used in confections and baked goods. It is soft and malleable, and it can be used to sculpt edible shapes.

title: Cookbook:Marzipan


text: Wikijunior:Countries A-Z/Suriname

title: Wikijunior:Countries A-Z/Suriname


text: Wikijunior:Countries A-Z/Suriname/Image

title: Wikijunior:Countries A-Z/Suriname/Image


text: Wikijunior:Countries A-Z/Slovakia

title: Wikijunior:Countries A-Z/Slovakia


text: Wikijunior:Countries A-Z/Slovakia/Image

title: Wikijunior:Countries A-Z/Slovakia/Image


text:
Rust for the Novice Programmer/Numbers and data types

Basic explanation of number representation
One thing to keep in mind is that at a fundamental level, all computers are doing are moving 1s and 0s around. We call a single value a 'bit'. Normally, computers are built to work in sections of 8 bits at a time and each one is called a 'byte'. The specifics of this aren't relevant right now, except that the number types in Rust are built using these bytes. The default number type is 'i32'. The i stands for integer, where an integer is a whole number(positive or negative), and the 32 is the number of bits used to represent this number, which is equivalent to 4 bytes. The integer types in Rust are 'i8', 'i16', 'i32' and 'i64', for each the number corresponds to the number of bits in it. There's also what are called unsigned integers which are integers that only represent positive values(including 0). Correspondingly, they are 'u8', 'u16', 'u32' and 'u64'.

Remember earlier where we said division was a little strange? How when we did 15/6 we got 2 out instead of 2.5? This is the reason, since the two numbers involved in the division are integers, the output will be an integer too. Since an integer can only store whole numbers, the output will not store the .5 extra. If we want values that can store decimals we use what are called floating-point numbers. These are numbers that store decimal values in them. In Rust, there are two floating point types, 'f32' and 'f64'. You can get a floating point easily by adding a .0 after a number. Note that the default floating-point type will be f64 in this case

For example: Now the output we get is 2.5 as expected.

How do we choose a specific type that we want? We can do this by adding a colon then the type after the name as shown here: Here we are using a 16-bit integer to store the value 7 then print it.

Why do we want different types? Rust is a language that allows you as the programmer quite a lot of control over what you are doing. Using smaller number types as needed can save space since fewer bits are used.

Next: Functions


text: Wikijunior:Countries A-Z/Slovenia

title: Wikijunior:Countries A-Z/Slovenia


text: Wikijunior:Countries A-Z/Slovenia/Image

title: Wikijunior:Countries A-Z/Slovenia/Image


text: Wikijunior:Countries A-Z/Solomon Islands


text:
The Sakha language/Nouns

Plurals
Unlike Turkish and other many Turkic languages, Sakha has more irregular plurals than its sisters. For example, English has irregular plural forms man — men, person — people, or child — children. Regular plurals in Sakha are formed by the surface form -ЛАр. These are the assimilated forms of this suffix: In addition, there is also numerous irregular plurals in Sakha:

Accusative
The accusative case are used as a direct object (I see the car) of a verb or certain prepositions of verbal origin. While the divisions of the surface form -(н)И are somewhat simple, but the treatment of stems of nouns ending in a consonant is rather complex. Nouns ending in -с and -х usually change to -һ and -ҕ, respectively (nom. бас — acc. баһы "head"). However, nouns ending in -CVC (-C- = consonants, -V- = short close vowel) are elided to -CC- (also before other suffixes starting with a consonant) causing -һ and -ҕ devoices to -с and -х before other consonants.

In addition, there is also an accusative-collective case, used for denoting a completely-affected object (сирэйдэри "whole face"). Its formation is completely the same as accusative plural, but this case only exists in singular so there is no such forms like **сирэйдэрдэри.

title: The Sakha language/Nouns


text: Wikijunior:Countries A-Z/Solomon Islands/Image


text:
Cookbook:Corn Flakes

Corn flakes are a variety of breakfast cereal made from ground corn.

Characteristics
The flakes of this cereal are about 1 cm across and yellow-gold in color. They are very thin, sometimes with a curved shape and textured edges. The flavor is very mild and corn-dominant. Some varieties may be "frosted" with sugar, to make them more palatable on their own.

Selection and storage
To maintain their crisp texture, store cornflakes in a sealed, airtight container.

Use
The primary use of cornflakes is as breakfast food. However, they are also used in cooking as a substitute for breadcrumbs or to add a crunchy texture to a dish.

Substitution
A very similar product to cornflakes is wheat flakes or bran flakes, which is a nearly identical product, just made with wheat instead of corn. These can be used pretty much identically to cornflakes for all purposes. If cornflakes are being used as a breading or coating, cracker crumbs or breadcrumbs may be used as an acceptable substitute

title: Cookbook:Corn Flakes


text:
PostgreSQL/Index GIN

GIN (Generalized Inverted Index) supports data types that are divisible into smaller components, e.g., elements of an array, words of a text document, or properties of a JSON object. We call them compound data types. Unlike B-Trees, GIN does not generate a single index entry for the complete value but one index entry for each component.

Every index entry consists of the value of the individual component plus the tuple ID (TID). Please notice that TIDs don't contain the sequence number of the component within the complete value. They contain only the number of the physical page in the data file plus the number of the row within the page.

Useable operators in a  clause depend on the data type:
 * Arrays:  (is contained in),   (contains),   (equal), and   (overlaps / has some common elements).
 * Text queries (lexems):  (contains).
 * JSON:  (JSON object field with the given key),   (JSON object field with the given key, as text).

Description
A GIN index consists of different sub-structures:
 * The Meta Page
 * One Entry B-Tree
 * Some Posting B-trees
 * One Pending List

Among others, the Meta Page contains pointers to the Entry B-Tree and the Pending List.

The Entry B-Tree implements a tree where the keys consist of the original component's values, e.g., the value of a single array element. At the non-leaf levels, their pointers point to child pages at the next level. At the leaf level, pages consist of two types of entries: First, there are Posting Lists. They consist of the key, followed by a list of TIDs. Second, if such a list of TIDs exceeds the capacity of the physical page, the list gets rearranged to a Posting B-Tree, which is stored on one or more other pages. The original Posting List gets replaced by a pointer to the new Posting B-Tree.

A Posting B-Tree is part of one or more physical pages and contains a B-Tree over tuple IDs which all point to such rows in the data file where its key can be found as the value of one of its components.

The implementation of the two B-Tree types differs from PostgreSQL's standard B-Tree implementation.

The Pending List is a list of pages where keys (component's values) and their dedicated TIDs are stored sequentially. The Pending List exists for optimization purposes; see below.

Optimizations
GIN indices use two special optimizations. First, if the value of different components (possibly in different rows) is used often, the set of TIDs is rearranged to a B-Tree within the GIN. Consider the case of many text documents: Many words will likely be repeatedly used in the same and in different documents. In this case, the list of TIDs may grow to the thousands, and a tree is better suited to manage them than a list.

Second, s or  s of compound data creates many index entries: one per component, e.g., one per word of a text. In the first step, such new index entries are collected in a separate Pending List outside of the index tree (in opposite to the original  command). During the next -run, the entries are moved from the pending list to the GIN tree structure using the same bulk insert technique used during initial index creation. This bulk technique speeds up the process, and - even more helpful - the work is delegated to a background process. Of course, there is a drawback: Every query must scan the pending list in addition to traversing the index tree.

title: PostgreSQL/Index GIN


text:
PostgreSQL/Index BRIN

BRIN (Block-Range Index) is a structure that accelerates queries on tables that contain a huge number of rows (> millions) and where the rows occur in a certain physical order within the data file. Typical use cases are such where a column contains a timestamp or a generated sequence number that seldomly or never change over time, e.g.: IoT data, computed values, sensor output, log information.

You can imagine a BRIN as a 'virtual partitioning' of a table. If a query fits into such a virtual partition the number of rows, which must be scanned, decreases significantly.

The power of BRIN results from the fact that it needs only very little space. Typical BRIN sizes for a table with hundreds of millions of rows are some kB, which easily fits into RAM. All other index types need much more space, 25 - 50% of the table size is not unusual.

Description
Hint: The PostgreSQL terminology knows the term 'block' and uses it synonymously with 'page' (8192 bytes), see here. In the context of BRIN, the term 'block-range' denotes a contiguous sequence of many adjacent pages within a data file.

When a BRIN is created, the sequence of pages of the data file (heap) is virtually divided into slices, called block-ranges. E.g., if the file contains 600 pages, the first 128 belongs to block-range #1, the second 128 belongs to block-range #2, ... up to block-range #5, which contains the remaining number of pages. The default size for a block-range is 128 pages; it can be changed within the  command. Next, all rows are scanned and the minimum and maximum values of the indexed column per block-range are saved. Please note that each min/max pair constitutes a numeric value-range.

The BRIN structure consists of those block-range numbers and their related value-ranges, e.g., block-range #1: min=11, max=25; block-range #2: min=25, max=31. Hence the name Block Range Index.

Ideally, the value-ranges don't overlap, but this is not necessary. The correlation between the order of rows in the data file and their content in the column of interest arises from the sequence of INSERT commands combined with growing values: later INSERTs (to a table without significant free space) should contain equal or higher values. This correlation may get lost over time by later UPDATE commands. In this case, the benefit of BRIN may get lost.

When such a BRIN structure is used during the execution of a query, it is known that all values within the rows of a certain block-range are within its data-range or, vice versa, no value outside its value-range is in any of its columns. But it's unknown which concrete values are really in the data! This has significant consequences for using the BRIN structure; see below.

Complex data types, e.g., geometric objects like rectangles, store more complex data instead of min/max values, e.g., a bounding box.

The file containing the BRIN consists of 3 different page types.
 * The very first page (#0) of the file holds meta-information, e.g., the number of Range-map pages.
 * The second (#1) and some more pages contain the so-called Range-map. It consists of tuple IDs (TID) which point to pages of the next BRIN level, the Index Pages. Because TIDs have a fixed size (of 6 bytes) it's possible to store them like an array: one after the next without any links between them. Their position correlates with the block-range number.
 * The rest of the pages contain the Index Pages. They contain the minimum and maximum values (value-ranges) per block-range.

Select
If the  condition of an SQL command specifies a criterion for a column with a BRIN, the following steps are conducted:
 * All range-map pages are entirely scanned.
 * The related index pages are read one by one. If the searched value fits into the value-range of any of its index entries, all pages of this block-range are considered part of the result set.
 * All rows of the identified pages are read from the heap and their columns evaluated. This is necessary because BRIN knows only that the value of every row must be in a certain range, e.g., between 11 and 25. But if the search criterium is, the identified rows potentially contain other values like 11 or 15.

Summary: BRIN doesn't contain exact pointers to certain rows in the heap file. It contains only information about ranges of blocks and ranges of values. Nevertheless, under certain conditions (huge number of rows, correlation between physical row order and column value, few data changes) this information is enough to reduce the number of rows, which must be read to evaluate a search condition, dramatically. The uncertainness of BRIN correlates with its tiny size.

Update
If a row is added or the BRIN-column of a row changes, the following steps are conducted: It is possible that value-ranges overlap. This decreases the efficiency of BRIN.
 * The page number, where the row is physically stored in the data file, is identified.
 * Depending on the page number, the block-range number is computed (page number divided by block-range-size).
 * The block-range number determines the position within the range-map.
 * The related index entry at the index page is read.
 * If the new value of the row fits into the value-range of this index entry, no action is necessary. If the value is outside of the value-range, the value-range is updated (enlarged) on the lower or upper bound.

title: PostgreSQL/Index BRIN


text:
PostgreSQL/Indices

Relational databases systems store huge amounts of data. Their value only becomes apparent when individual pieces can be retrieved fast enough. E.g., a naive query for a specific telephone number in a phone book with 100 million entries has to read on average 50 million entries. Fortunately, smart algorithms reduce the number of necessary read operations dramatically. A binary search will reduce them in the given example to maximal 27. Using smart algorithms is much more efficient than utilizing faster hardware - especially for huge numbers.

In our case of databases, the implementation of such algorithms is based on additional structures which repeat parts of the original data in their specific way. They are called indices and, of course, they come with some overhead. They occupy space on disc and in RAM; they generate additional effort, e.g., for sorting, and whenever the original data changes they must be maintained accordingly.

As mentioned, their primary purpose and biggest advantage is the acceleration of queries - with regards to identifying rows as well as sorting the resulting set of rows. Besides this, they support some constraints like uniqueness.

If indices exist, it's not sure that the system uses them. Because the system optimizes queries before it executes them, it sometimes decides to ignore an existing index and perform a full table scan instead. This may occur if the table is very small or if the selectiveness of the retrieved value is very low and will return a huge percentage of the existing rows.

PostgreSQL offers some extension mechanisms. Among other things, it is possible to add new data types to the system and integrate them into the existing index types. Beyond that, it's possible to develop application-specific operators to meet the needs of specialized applications, e.g., classification of pictures or music, clustering of arbitrary objects, detection of patterns in stock prices, ... . GIN, BRIN , GiST , and SP-GiST offer an interface (some kind of a template) which allows implementing index assisted domain-specific actions. The technique is called access method. Only B-Tree and Hash are conventional indices without such an extension mechanism.

B-Tree
B-Tree (Balanced Tree) is the default index type. It is suitable for use cases where numbers or short strings are often part of the  clause. Possible operators are the usual arithmetic operators: <, <=, =, >, >=.

Read more

GIN
GIN (Generalized Inverted Index) supports data types that are divisible into smaller components, e.g., elements of an array, words of a text document, or properties of a JSON object. We call them compound data types. In opposite to B-Trees, GIN does not generate a single index entry for the complete value but one index entry for each individual component.

Useable operators in a  clause depend on the data type:
 * Arrays:  (is contained in),   (contains),   (equal), and   (overlaps / has some common elements).
 * Text queries (lexems):  (contains).
 * JSON:  (JSON object field with the given key),   (JSON object field with the given key, as text).

Read more

BRIN
BRIN (Block-Range Index) is a structure that accelerates queries on tables that contain a huge number of rows (> millions) and where the rows occur in a certain physical order within the data file. Typical use cases are such where a column contains a timestamp or a generated sequence number that seldomly or never change over time, e.g.: IoT data, computed values, sensor output, log information.

The correlation between the physical order of rows in the data file and their content in the column of interest arises from the sequence of  commands and growing column values: later  s have to contain equal or higher values. It is possible that this correlation gets lost over time by later  commands. In this case, the benefit of BRIN may get lost.

The power of BRIN results from the fact that it needs only very little space. Typical BRIN sizes for a table with hundreds of millions of rows are some kB, which easily fits into RAM. All other index types need much more space, 25 - 50% of the table size is not unusual.

Read more

Hash
PostgreSQL uses two fundamental strategies to implement Hash indices. First, a hash function maps column values of any type and length to a hash value of a fixed size of 32 bit. Such hash values together with the TIDs of their originating rows are the basic bricks for the Hash index. Second, an elaborated algorithm ensures that the size of the index file grows smoothly (that is, in a small amount of pages at one point in time) when additional index entries occur. Hence, it's an extendible hash.

To save space, the hash index doesn't store the original column value but only the computed hash value. This has some implications. The sort order of the computed hash values haven't any relation to the sort order of the original values. Therefore this index type can support only the  operator, but none of the other comparison operators like   or. Additionally, there is the danger of duplicates. Two different column values can create the same hash value. This is unavoidable because there are many more possible column values (any length) than possible hash values (fixed size). Thus, after reading the row according to the found TID, it's necessary to re-evaluate the column value from the heap.

Read more

GiST and SP-GiST
GiST stands for Generalized Search Tree and implements - similar to B-Tree - a balanced tree structure. This is useful for all kinds of B-Tree and R-Tree structures. Some PostgreSQL extensions use them, e.g.:, hstore (key/value pairs), intarray (array of Integers), ltree ('Labels' like 'World.Countries.Europe.Russia'), pg_trgm (trigram matching), ... .

SP-Gist stands for Space-Partitioned Generalized Search Tree and implements non-balanced tree structures, mainly for object types that contain similar or equal object types. This is useful for quad-trees, k-d trees, radix trees, ... .

Bloom
The above-mentioned index types and index access methods are an integral part of every PostgreSQL installation.

An additional index access method is bloom. Bloom must be explicitly installed using PG's extension mechanism (you have to run  once before you can use this index type). This extension implements a Bloom filter that offers an advantage over B-trees in cases where the first columns of a multicolumn index are not specified in the  condition of an SQL statement.

title: PostgreSQL/Indices


text: Role Playing Games/Printable version

title: Role Playing Games/Printable version


text: Solitaire card games/Printable version

title: Solitaire card games/Printable version


text: Roulette/Printable version

title: Roulette/Printable version


text:
Practice Problems in LOLGraphics

Table of Contents

 * 1) /Preface/
 * 2) /Problem I - Calculator/
 * 3) /Solution to Problem I/
 * 4) /Problem II - Greek Numerals/
 * 5) /Solution to Problem II/
 * 6) /Problem III - Byzantine Calendar/
 * 7) /Solution to Problem III/
 * 8) /Problem IV - Christmas Tree/
 * 9) /Solution to Problem IV/
 * 10) /Postface/
 * 11) /Authors & Contributors/

title: Practice Problems in LOLGraphics


text:
Practice Problems in LOLGraphics/Preface

This book is intended for readers who have finished reading Programming in LOLGraphics 3.4, and would like to practice their skills. In every chapter, the reader will be faced with a problem that needs to be solved in LOLGraphics, and then he will see the solution with detailed explanations on how the code works an which parts of it can be written differently. The book assumes that you are already familiar with how the language works. If you are not, please read “Programming in LOLGraphics 3.4”.

The book will focus on the journey of Namer the cat to the Kingdom of Cats. At every state of the journey he will be presented with a challenge which he has to solve using the LOLGraphics 3.4 programming language.

IMPORTANT: Just because your solution for one of the problems is different from the one presented in the book doesn’t mean that it’s wrong. There are multiple ways to solve every problem in the book which is why after every solution there’s also a list of alternative ways.


text:
Practice Problems in LOLGraphics/Solution to Problem I

Code
HAI 3.4 0 1 IM IN UR CODE EXECUTIN UR KOMANDZ PLZ RUN SUBPROGRAM INPUT PLZ RUN SUBPROGRAM OPERATION PLZ RUN SUBPROGRAM COUNT IM OUTTA UR CODE IM IN UR SUBPROGRAM DAT IZ KALLED INPUT PLZ TYPE TEXT X= I HAS A FOUR BYTE DAT IZ CALLED X PLZ ASK TEH USR 2 GIMME A FOUR BYTE X PLZ PRINT FOUR BYTE X PLZ TYPE TEXT Y=  I HAS A FOUR BYTE DAT IZ CALLED Y PLZ ASK TEH USR 2 GIMME A FOUR BYTE Y PLZ PRINT FOUR BYTE Y IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED OPERATION PLZ PRINT TEXT 1 + PLZ PRINT TEXT 2 - PLZ PRINT TEXT 3 * PLZ PRINT TEXT 4 / I HAS A ONE BYTE DAT IZ CALLED OP PLZ ASK TEH USR 2 GIMME A ONE BYTE OP IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED COUNT SWITCH [OP] CASE 1 PLUS CASE 2 MINUS CASE 3 MULTIPLICATION CASE 4 DIVISION IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED PLUS I HAS A FOUR BYTE DAT IZ CALLED Z PLZ SET FOUR BYTE Z X+Y PLZ PRINT FOUR BYTE Z IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED MINUS I HAS A FOUR BYTE DAT IZ CALLED Z PLZ SET FOUR BYTE Z X-Y PLZ PRINT FOUR BYTE Z IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED MULTIPLICATION I HAS A FOUR BYTE DAT IZ CALLED Z PLZ SET FOUR BYTE Z X*Y PLZ PRINT FOUR BYTE Z IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED DIVISION I HAS A FOUR BYTE DAT IZ CALLED Z PLZ SET FOUR BYTE Z 0 PLZ RUN SUBPROGRAM SUBTRACT PLZ ASK CEILIN KAT 2 CHEK IZ [X]<0 IF CEILIN KAT IZ NODDING PLZ RUN CORRECT PLZ PRINT FOUR BYTE Z PLZ PRINT FOUR BYTE X IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED SUBTRACT PLZ SET FOUR BYTE X X-Y PLZ SET FOUR BYTE Z Z+1 PLZ ASK CEILIN KAT 2 CHEK IZ [X]>0 IF CEILIN KAT IZ NODDING PLZ RUN SUBTRACT IM OUTTA UR SUBPROGRAM IM IN UR SUBPROGRAM DAT IZ KALLED CORRECT PLZ SET FOUR BYTE Z Z-1 PLZ SET FOUR BYTE X X+Y IM OUTTA UR SUBPROGRAM

IMPORTANT: The subprograms minus and subtract are not the same! Minus is for subtraction operation, and subtract is used for division because division is broken in LOLGraphics.

Explanation
This code can be easily divided into 3 parts:
 * 1) The first part of the code asks the user to enter 2 numbers and stores them in 2 4-byte variables called x and y. Note that LOLGraphics doesn’t have scopes - once you define a variable it exists forever until the program ends. That’s why there’s no problem in defining variables in the subprograms where they are first used.
 * 2) The second part of the code asks the user to enter the mathematical operation that he wishes to do. Because LOLGraphics doesn’t let you ask for string inputs - only number inputs, each one of the 4 basic arithmetic operations is given a number from 1-4.
 * 3) The third part of the code checks what operation the user entered using a switch/case structure and calculates the result of the arithmetic operation. Addition, subtraction, multiplication, and division are straight forward so I will focus on the division routine. Because division seems to be broken in LOLGraphics, I had to implement it myself. Ideally, the code would just keep subtracting Y from X in a loop while X>=Y but this simply isn’t possible. The code does it while X>0, but that means there’s a chance it will subtract to below 0, that’s why it after that has to check that X is not negative, and if it is correct the answer by subtracting 1 from Z, and Y to Z. After that, Z will store the integer part of the solution, and X the reminder, and both will be printed.

Alternative ways
There are multiple things that can be done differently. For one, if you run this code you will see X=5. You can theoretically add spaces that it will be X = 5, by remember that since the LOLGraphics interpreter wastes spaces from the beginning and end of every line, so to print the second space you will need to use the command.

Also, it’s possible to print to the user what operation is calculating. Since the code is in any case running with conditions, and each operation has a subprogram, the best way would be to add in each such subprogram a print command. for the addition subprogram, etc.

Also it’s possible to implement the division routine differently. This code will subtract Y from X while X>0. This means that it’s possible that it will stop at X=-2 for example and that the result will be of so there’s a subprogram that checks and corrects if necessary. You can also subtract Y from X while X>Y but take into account that if X can be evenly divided by Y, then your answer will be lower by 1 then the correct answer, so you will still need to run a correction subprogram.


text:
User:Steevesaneus

I’m steeve saneus I’m a soccer player my position is LB=left-back and CAM=midfielder

i play drums with trumpet fingering too

title: User:Steevesaneus


text:
User talk:Zafarella2

Belated welcome!
Welcome to Wikibooks, Zafarella2!

 First steps tutorial Wikibooks is for collaborative development of free textbooks.

You do not need technical skills to contribute. You can easily change most books. Please introduce yourself, and let us know what interests you.

If you already contribute at other Wikimedia projects, our Wikimedia Orientation should quickly get you started. (Would you like to provide feedback on this message?)

  Getting help   Made a mistake?   Goodies, tips and tricks
 * Read the Using Wikibooks book for a friendly introduction to the project, or our help pages for more information.
 * You can get friendly help from the community in the user assistance room or our IRC channel.
 * Upload freely licensed files to Wikimedia Commons. You may request permission to upload fair use files locally. Please include author and source information and a non-free use rationale for non-free files.
 * You can restore a previously saved version.
 * Pages should follow the  naming convention.
 * Need to rename a page? Use the move tab (is available once your account is 4 days old - until then, ask for help).
 * To request a page be deleted, add to the top of the page.
 * Was a page you made deleted? Please read the deletion policy, and check the deletion log to find out why. Also check the RFD archives if applicable. You can request undeletion at WB:RFU, or ask the administrator who deleted the page.
 * Please fill in the edit summary and preview your edits before saving.
 * Sign your name on discussion pages by typing ~~~~
 * User scripts can make many tasks easier. Look at the Gadgets tab of my preferences; check off the boxes for the scripts you want, and hit save!

I know you've been here for quite some time, but have never been welcomed, so here it is. Thanks for your contributions.

About your question to me on my talk page: I reverted because you misspelled a word on LaTeX/Collaborative Writing of LaTeX Documents. But I probably shouldn't have done so, as overall it improved the sentence. So I have reverted my edit and corrected the spelling. -- Jules (Mrjulesd) 17:15, 30 January 2022 (UTC)

title: User talk:Zafarella2


text:
Wikibooks:Requests for permissions/Rubbish computer

Permission to use AutoWikiBrowser
Hi, can I use AWB on this wiki to fix typos? I used to do this before permission separate to enwiki was required here. I'm familiar with using AWB on enwiki and other websites. Rubbish computer (discuss • contribs) 18:58, 29 July 2021 (UTC)
 * I haven't been around that long, but Rubbish computer has a proven track record of improving Wikibooks since 2015 according to their user contributions page, and they used the tool without apparent incident before. Seems like a good idea to me. --Mbrickn (discuss • contribs) 19:59, 29 July 2021 (UTC)
 * Actually we don't have a formal requirement to request permission, but we do prefer people to be Reviewers so that their edits are autoreviewed. As you are a Reviewer, I'm fine with your request. QuiteUnusual (discuss • contribs) 21:28, 29 July 2021 (UTC)

Hi, if I add my name to AutoWikiBrowser/CheckPageJSON, would that enable me to use it? And if so is it ok if I do so? Cheers, Rubbish computer Ping me or leave a message on my talk page 12:14, 31 July 2021 (UTC)
 * yes that's fine. QuiteUnusual (discuss • contribs) 13:57, 31 August 2021 (UTC)
 * @Rubbish computer? 𝟙𝟤𝟯𝟺𝐪𝑤𝒆𝓇𝟷𝟮𝟥𝟜𝓺𝔴𝕖𝖗𝟰 (𝗍𝗮𝘭𝙠) 15:02, 4 December 2021 (UTC)

 * Hi sorry I missed this. Rubbish computer Ping me or leave a message on my talk page 19:14, 4 December 2021 (UTC)


text:
Wikibooks:Requests for permissions/2005-Fan

(administrator)
Hello, so on 's talk page, he suggested that I apply for temporary adminship since I've been involved in restoring many of the old, previously deleted video game-related guides. He predicts that I will ask for more, which he's correct about, as Halo 2 and Super Smash Brothers 64: Strategy Guide are guides that have not been restored yet, and I want to have a go at restoring them if this request passes so that I have more independence in restoring some of the older video game guides. Thank you! 2005-Fan (discuss • contribs) 20:03, 16 June 2021 (UTC)
 * for a temporary period (say 3 months). I know we normally don't do temp admin at Wikibooks, but in this case the user has been legitimately submitting undelete requests as part of the strategy guide policy, as you can see at WB:RFU. OK with this request as long as it is temporary. A delete-only role (such as eliminator which some projects have) would be ideal, but we don't have that here, and hence admin would be the next best choice. Leaderboard (discuss • contribs) 20:13, 16 June 2021 (UTC)
 * Comment. People voting need to understand that there is no technical way to limit the rights and therefore access will be granted to all of them - e.g., to block users. When assessing the request you need to both consider whether it is appropriate for the purpose requested (deleting) but also whether you trust the requestor to hold, but not use, the other rights. QuiteUnusual (discuss • contribs) 08:22, 17 June 2021 (UTC)
 * Is there a way to attach a condition to their adminship? Similar to limited adminship on meta, I was thinking of something like "if the user uses the rights for anything other than undeleting without justification, they risk being desysoped". Leaderboard (discuss • contribs) 08:53, 17 June 2021 (UTC)
 * There isn't a specific policy on this. We could amend the policy, but it's probably fine to just document here if the request is granted and then it can be used to ask a Steward to remove the rights if abused. E.g., the closing of the request could say "any other admin may request a Steward to remove the rights immediately if they believe they are being misused". QuiteUnusual (discuss • contribs) 16:32, 17 June 2021 (UTC)
 * I think there's enough support for this one - could you action it? Leaderboard (discuss • contribs) 12:13, 28 June 2021 (UTC)
 * Per Leaderboard. I'm not sure if this helps since this is English Wikibooks, but 2005-Fan appears to have a solid track record on English Wikipedia. Also they've been working hard on restoring strategy guides here, and this measure would turn what is now a two person job into a one person job, saving contributor time and effort. --Mbrickn (discuss • contribs) 20:38, 17 June 2021 (UTC)
 * - per Leaderboard. Also User:2005-fan can you please create a userpage? SHB2000 (discuss • contribs) 23:01, 20 June 2021 (UTC)
 * Done, why did you need me to make it 2005-Fan (discuss • contribs) 16:35, 22 June 2021 (UTC)
 * - I think it's just me who's quite into userpages, but having a local userpage tells who you are, and what sort of things you do here. SHB2000 (discuss • contribs) 07:23, 27 June 2021 (UTC)
 * I've created a possible addition to policy at Administrators/Temporary administrators to allow for this, which I will try to have ratified. I really feel that temporary adminship should be given the support of policy before this is granted; but with a policy change I see no problem with this happening. -- Jules (Mrjulesd) 11:22, 21 June 2021 (UTC)
 * Please see proposal at Reading room/Proposals. -- Jules (Mrjulesd) 11:46, 21 June 2021 (UTC)
 * Per Leaderboard.--Jusjih (discuss • contribs) 23:39, 21 June 2021 (UTC)

(uploader)
Excuse the duplicate permission request, but I'm requesting uploader permissions because there are several broken image links on the wiki game guides needing to be fixed. I think said it's ok to upload under fair use (recommended: under 800x400px?) 2005-Fan (discuss • contribs) 11:46, 18 June 2021 (UTC)

 * ✅ as there's a valid need. Leaderboard (discuss • contribs) 11:48, 18 June 2021 (UTC)
 * Thank you! 2005-Fan (discuss • contribs) 11:49, 18 June 2021 (UTC)


text:
Wikibooks:Requests for permissions/Alexlatham96

(Importer)
I would like to take over the Character Encodings Wikibook and finish what has not been done. I already told the user who started the import process on Wikipedia for this Wikibook (see []).Alexlatham96 (discuss • contribs) 21:55, 23 May 2021 (UTC)
 * Aren't all the pages already imported here? I believe the outstanding work is to edit them here and integrate them into a book. QuiteUnusual (discuss • contribs) 11:08, 24 May 2021 (UTC)
 * Then I'm asking to do the tasks required. The first step is install the Transwiki:Is empty and Transwiki:Yesno-no templates to template space on Wikibooks. The rest of the work to do is listed at Character Encodings/To do.Alexlatham96 (discuss • contribs) 23:37, 24 May 2021 (UTC)
 * You don't need the +importer right to do these tasks. Closing request. QuiteUnusual (discuss • contribs) 07:42, 25 May 2021 (UTC)


text:
Wikibooks:Requests for permissions/AshLin

(reviewer)
Hi, as per the criteria given in Reviewers, I should have qualified for Reviewer status automatically. Is there anything else that I need to do? AshLin (discuss • contribs) 13:11, 24 August 2021 (UTC)
 * Thank you, its automatically happened today. AshLin (discuss • contribs) 10:40, 28 August 2021 (UTC)