OpenLLM-France/wikimedia huggingface dataset:
# Chess Opening Theory/1. d3
## 1. d3 · Mieses Opening

This move is playable but not played much as it does little to claim the center and potentially locks in the light squared bishop. It would normally transpose into the King's Indian Attack, or with colours reversed, a Modern, Pirc, or King's Indian defence.

### Statistics

Not enough data, as 1. d3 is infrequently played.

## Theory table

| 1.d3 |
| | 1 |
| 1 | ... d5 | = |
| 2 | ... e5 | = |

## All possible Black's moves

| Quick Navigation | Na6 a6 a5 | b6 b5 | Nc6 c6 c5 | d6 d5 | e6 e5 | Nf6 f6 f5 | g6 g5 | Nh6 h6 h5 |

## References

* Eric Schiller (2002). Unorthodox Chess Openings (Second Edition ed.). Cardoza. ISBN 1-58042-072-9. {{cite book}}: |edition= has extra text (help)
For explanation of theory tables, see theory table and for notation, see algebraic notation.
When contributing to this Wikibook, please follow the Conventions for organization.
# Guarani/Lesson 1
## Vocabulario — Ñe’endy

* Maitei – salutation
* Maitei(kuéra) – salutations
* Momaitei – to salute
* Mba’éichapa – Hello, how are you (generic salutation)
* Aguyje – thank you
* che Maitei (atonic che) – my salutation
* nde Maitei (atonic nde) – your salutation (singular)
* iMaitei – his/her/their salutation
* Ñande Maitei – our salutation (also yours)
* Ore Maitei – nuestro saludo (not yours)
* Pende Maitei – your salutation (plural)
* Imaiteikuéra – sus saludos
* Karai – mister
* Che – I (tonic)
* che (atonic prefix) – my
* Nde (tonic) – you (singular)
* nde (atonic prefix) – your (singular)
* ndéve – to you
* +pa – atonic interrogation sufix
* +piko – atonic emphatic interrogation suffix
* Ha – and
* Avei – also
The distinction between "Ore" and "Ñande" is on whether the person being addressed is included or not.

### Sentences

* to G̃uahe ndéve che Maitei – may my salutations get to you
* Che Aguijevete ndéve – thank you very much
* Che Aguijevete ndéve nde Maitei – I thank your salutations a lot

## First dialogue

One does not need to write question marks in Guarani, since suffixes already denote questions.
Dos personas se encuentran, Juan y Pedro, que no se conocen. Pedro es un hombre adulto, un Karai (señor).
    Juan: Mba’éichapa Karai. – How are you, sir?
    Pedro: iPorãnte, Ha Nde. – I'm fine, what about you?
    Juan: Ha iPorãnte Avei. – I'm fine too.

## Second dialogue

With "Ha'e", optional, names are asked. This word means "to be".
    Juan: Mba'éichapa nde Réra. – What's your name?
    Pedro: che Rera (ha’e) Pedro, Ha Nde. – My name is Pedro, and yours?
    Juan: Che (ha’e) Juan – I'm Juan.

## Third dialogue

"Piko" as a question marker and "niko" as a noun connector, meaning "to be".
    Juan: ¡Mba’éichapa! Máva piko Nde? – Hello, who are you?
    Pedro: Che niko Pedro, Ha Nde. – I'm Pedro, and you?
    Juan: Ha Che niko Juan. – I'm Juan.
Notice how "Ha" is used, with the sense of addition.

## Conjugation of Maitei and moMaitei

Strictly, Maitei (“saludar”) is an intransitive verb (it cannot take direct object) and moMaitei (mo+Maitei) is transitive (it must take an object).
In the present tense, we do not have to use a particle to express tense, just person and number.
* (Che) aMaitei – I salute
* (Nde) reMaitei – you (singular) salute
* (Ha'e) oMaitei – he/she salutes
* (Ñandé) ñaMaitei – we (including you) salute
* (Oré) roMaitei – we (you not) salute
* (Peê) peMaitei – you (plural) salute
* (Ha’eKuéra) oMaitei – they salute
Let us see a sentence with moMaitei.
* AmoMaitei Perupe – I salute Perupe.
If the intention is to use the future, the suffix -ta should be used.
* ÑamoMaiteita ñande Sýpe – We (including you) will salute our (also yours) mother.
* AMaiteita - I will salute.
# Chess Opening Theory/1. d4/1...d5/2. c4/2...c6/3. Nc3/3...dxc4/4. e3/4...b5
## 4...b5

This guards c4 and is the best move. The queenside weaknesses are not a problem, as the knight on c3 is vulnerable to b-pawn attacks with ...b4. Note that Nxb5?, trying to exploit the long diagonal to destroy Black's queenside, is a mistake, and gives black two roads to an advantage. Often, Black will play b4, to boot white's knight away, and not try to hold c4.
When your opponent has a space advantage, you want to use pawn breaks. Since b3 Qa5 is annoying for white, as the knight is being threatened as well as b3 pawn (if cxb3 axb3, Qxa1 wins the rook), the only other break is 5.a4 which undermines Black's defence of the c4-pawn. Therefore, the best move is 5.a4.

## Theory table

| 5 | 6 | 7 | 8 | |
| Nxb5? cxb5 | Qf3 Qc7! | Qxa8 Bb7 | Qxa7 e5 | -/+ |
| ... ... | ... Nc6 | Qxc6+ Bd7 | Qf3 e5! | =/+ |
| a4 b4 | Ne4 Qd5 | Nd2 c3 | bxc3 bxc3 | +/= |
# Slav Defence Exchange Variation
### 3. cxd5

After this move, the tension in the center is relieved often allowing black equality due to the symmetrical position. Because of this, this variation often ends in a draw.
Black's only good move is to complete the exchange of pawns with 3...cxd5, and accept a symmetrical position. However, Nf6!? might be interesting as the position transposes to QGD, Marshall defence, Tan Gambit although this is rarely seen in high-level games. 3...Qxd5?! should be avoided as 4.Nc3 gains a lot of tempo, and allows white a crushing spacial advantage in the center.
After 3... cxd5, either side will find it difficult to win unless the other is over-ambitious.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1. d4 d5 2. c4 c6
| | 3 | 4 | 5 | 6 | |
| Exchange Variation D10 | cxd5 cxd5 | Nc3 Nf6 | Bf4 Nc6 | e3 a6 | = |
| | ... ... | ... ... | Nf3 Nc6 | Bf4 Bf5 | = |
| | ... ... | Bf4 Nc6 | e3 Nf6 | Bb5 Bg4 | = |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Slav Defence
### 3.Nc3

This move develops a piece and bears more pressure on d5. Due to this, it also makes 3...Bf5 a grave mistake due to 4. cxd5 cxd5 5. Qb3, winning a pawn. If then 5...Qb6, 6. Nxd5! Qxb3 7. axb3! wins the d pawn. If instead 5...Nf6 to protect the d-pawn, 6. Qxb7 Nbd7 7. Nf3 Rb8 8. Qxa7 wins two. In general, if black can safely play Bf5 and e6 in the Slav, black equalizes. The c3-knight also bears pressure on e4, allowing for a potential e4 pawn-push in the future.
3...Nf6 is Black's by far Black's most common reply, and play from white typically transposes into a semi-slav with 4. Nf3, although some unique lines exist where Nf3 is delayed or not played at all.
3...dxc4 followed by 4...b5 is also frequently played, as the c3 knight is vulnerable to a b7-b5-b4 advance allowing Black good queenside counter-play after the White's gambit c-pawn is captured.
3... e5, the Winawer Countergambit, is rarely seen from Black in high-level games. Black gambits their e-pawn for faster development, but usually falls behind in development after recapturing the pawn back.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1. d4 d5 2. c4 c6 3.Nc3
| | 3 | 4 | 5 | 6 | Eval | Notes |
| Slav Defence | ... dxc4 | e3 b5 | a4 b4 | Ne4 Qd5 | +/= | |
| | ... Nf6 | Nf3 | | | = | Many continuations |
| Semi-Slav (by transposition) | ... e6 | Nf3 | | | = | (to 2...e6 3.Nc3 c6) |
| Winawer Countergambit | ... e5 | dxe5 d4 | Ne4 Qa5+ | Bd2 Qxe5 | +/= | Uncommon |
| | ... ... | cxd5 cxd5 | dxe5 d4 | Ne4 Qa5+ | +/= | |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# OCR A-Level Physics/Electrons, Waves and Photons NEW SPECIFICATION/Electric current
## Charge and Current
### Current

Current is the flow of charged particles around a circuit. The electrons are usually the particles that flow. Metals are good conductors because they have free electrons that are able to flow. The SI unit for current is Amperes (A)

### Cross Sectional Area

The cross-sectional area of the wire is the area of a circle of radius r: A=πr2=π(d2)2, where d is the diameter of the wire. The SI unit for area is m^2.

### Electron Flow

Before it was known that it was electrons that were the charge carriers, it was believed that current flowed from positive to negative. This became convention and is still used under the name Conventional Current even after the discovery of free electrons. We now know that electrons have a negative charge. This means they are repelled from the negative terminal and is attracted to the positive terminal.
Remember this - Electron flow is always opposite to conventional current.

### Elementary Charge

Charged particles have a charge in coloumbs. An electron is a charged particle and has the charge of approximately $1.6\times 10^{-19}$. This is known as the elementary charge and is represented with an e symbol. Protons also have an approximate charge of e. The difference being is that electrons are negatively charged so strictly speaking they have a charge of -e and protons have a charge of +e.

### Drift Velocity

When electrons flow in a circuit, they have a velocity. we have an equation that relates this velocity and current together
From this equation we know that the current is affected by the cross-sectional area of the wire, A as well as the number density, n of electrons. This is just the number of electrons per unit volume. The number of electrons are as many as there are atoms. Current also is dependent on elementary charge, e and the mean drift velocity, v If we rearrange the top equation we can see a relationship between the values.
We can then deduce these three relationships.
The elementary charge, e is constant.
# The Linux Kernel

API and internals visual reference :
| aboutfunctionalities→layers↓ | human interfaces | system | multitasking | | memory | | storage | | networking |
| User space interfaces | text interfaces | interfaces coreSyscalls | processes | processes | processes | | files & directories access | | sockets access |
| virtual | security | containerization | threads | | virtual memory | | Virtual File System | | address families: inet, unix |
| bridges | debugging | Driver Model | synchronization | | memory mapping page cache swap network storage zero-copy splice | memory mapping page cache swap network storage zero-copy splice | memory mapping page cache swap network storage zero-copy splice | memory mapping page cache swap network storage zero-copy splice | memory mapping page cache swap network storage zero-copy splice |
| logical | multimedia subsystems | modules | Scheduler | | logical memory | | logical file systems | | protocols |
| devices control | HIDinput | buses, PCI | interrupts core | | Page Allocator | | block devices | | network interfaces |
| hardware interfaces | HI drivers | hardware interfaces[re]booting | CPU specific | | pages | | storage drivers | | network drivers |
| electronics | user peripherals | I/O ACPI | CPU regs APIC | | memory RAM DMA MMU | | storage SATA NVMe | | NICs Ethernet Wi-Fi |

## Contents

* About the book
* Human interfaces
** about HID, media, v4l, UVC, ALSA, console, input, cdev, security
* System
** about booting, devices, buses, PCI, interfaces, Syscalls, /sys, /proc, modules, updating and debugging
* Multitasking
** about processes, threads, scheduling, synchronization, interrupts
* Memory
** about address spaces, memory allocation, memory mapping, VM, pages, data types, swap
* Storage
** about block devices, filesystems, VFS, ext3, disk cache, SATA, SCSI,
* Networking
** about network drivers, Ethernet, sockets, TCP/IP, NFS
* External links
# Elementary Number Theory

* Natural numbers
* Prime numbers
* Integers
* Residue classes
# Chess Opening Theory/1. e4/1...e5/2. Bc4/2...f5
## Bishop's Opening - Calabrese Countergambit
### 2... f5?!

Black uses a risky attacking system to end up with a firm center, while white pieces struggle to develop great squares. White must play very precisely, or they can easily find themselves in a lot of trouble.
White's main options:
   * 3. d3 Jaenisch variation.
   * 3. d4
   * 3. Nc3
   * 3. Nf3

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1. e4 e5 2. Bc4 f5?!
| | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | |
| Jaenisch variation | d3 Nf6 | Nf3 fxe4 | dxe4 Bb4+ | c3 Bc5 | b4 Bb6 | O-O | | | ± |
| Jaenisch variation | ... ... | ... Nc6 | Ng5!? d5! | exd5 Na5 | Bb5+ c6 | dxc6 bxc6 | Ba4 Bd6 | O-O | ⩲ |
| Latvian Gambit | Nf3 | | | | | | | | |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Panov, Vasily. (1973). Teoría de Aperturas, Tomo I: Aperturas Abiertas - Aperturas Semiabiertas. ISBN 84-270-0132-0.
# Using YouTube Videos

There are a variety of ways to use YouTube videos beyond just watching them online.

## Table of Contents

* Downloading YouTube Videos
* Editing YouTube Videos
* Extracting Audio from YouTube videos
* Converting YouTube Videos
* Using YouTube Videos for School Projects
# Punjabi/Vocabulary/Fruits
## ਫਲ਼ - Fruits

ਅੰਬ i.e. mango, the king fruits, is the national fruit of India. Other fruits of Panjab are
* ਅਨਾਰ = pomegranate
* ਅਨਾਨਾਸ = pineapple
* ਸੇਬ= apple
* ਸੰਤਰਾ = orange
* ਅੰਗੂਰ = grapes
* ਕੇਲਾ = banana
* ਪਪੀਤਾ = papaya
* ਨਾਸ਼ਪਾਤੀ = pear
* ਅਮਰੂਦ = guava
* ਖ਼ਰਬੂਜਾ = musk melon
* ਹਦਵਾਣਾ or ਮਤੀਰਾ = watermelon
* ਜਾਮਣ = black plum
* ਆੜੂ = peach
* ਅਲੂਚਾ = prune
* ਆਲੂਬੁਖਾਰਾ = plum
* ਬੇਰ = jujube berry
* ਤੂਤੀ = mulberry
* ਖ਼ੁਰਮਾਨੀ or ਖੁਮਾਨੀ = apricot or dehydrated apricot
* ਖਜੂਰ = dates
* ਅਖ਼ਰੋਟ = walnut
* ਬਦਾਮ = almond
* ਕਾਜੂ Kajhu = cashew
* ਨਿੰਬੂ Limbu= lemon
* ਮੁਸੰਮੀ = sweet lime
* ਚੀਕੂ Chiku = sapodilla
* ਕਰੌਂਦਾ/ ਆਮਲਾ = gooseberry
* ਮੇਵਾ Mewa = Dry Fruits

### Exercises

1. Write names of ten fruits in Punjabi. 2. Identify the regular noun forms amongst the above fruit names and change the number.
* ਸੰਗਤਰਾ: ਸੰਗਤਰੇ orange
* ਕੇਲਾ: ਕੇਲੇ banana
* ਪਪੀਤਾ: ਪਪੀਤੇ papaya
* ਖ਼ਰਬੂਜਾ: ਖ਼ਰਬੂਜੇ
* ਹਦਵਾਣਾ: ਹਦਵਾਣੇ watermelon
* ਖਜੂਰ: ਖਜੂਰਾਂ dates
* ਤੂਤੀ: ਤੂਤੀਆਂ
juji berry

### Conclusion

In this chapter you were introduced to fruits of Punjab. The next chapter shall be devoted to trees.
# English Opening, Anglo-Indian Defense, King's Knight Variation
### 2.c4

2.c4 is a very common move in the Zukertort Opening, competing for the d5 square. It is also very flexible, allowing white to transpose into Queen's Pawn openings with a later d4 move or various lines in the English Opening (1.c4).
This position is also often reached with the move order 1.c4 Nf6 2.Nf3.

## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.Nf3 Nf6 2.c4
| | 2 |
| English Opening King's Indian Formation | ... g6 | d4 | = |
| English Opening | ... c5 | = |
| English Opening | ... c6 | = |
| English Opening | ... b6 | = |
| Reti System | ... e6 | d4 | = |
| Nimzo-Indian Defence Kasparov Variation | ... e6 | d4 Bb4 | Nc3 | = |
| | ... Nc6 | = |
| | ... d5 | d4 | = |
When contributing to this Wikibook, please follow the Conventions for organization.

## References

* Kasparov, Garry, & Keene, Raymond 1989 Batsford chess openings 2. ISBN 0-8050-3409-9.
# Haskell/Solutions/Type declarations

← Back to Type declarations

#### Building lists

* Exercises
* Note: The solution of this exercise is given near the end of the chapter, so we recommend that you attempt it before getting there.
* Reread the function definitions above. Then look closer at the showDate helper function. We said it was provided "for the sake of code clarity", but there is a certain clumsiness in the way it is used. You have to pass three separate Int arguments to it, but these arguments are always linked to each other as part of a single date. It would make no sense to do things like passing the year, month and day values of the Anniversary in a different order, or to pass the month value twice and omit the day.
* Could we use what we've seen in this chapter so far to reduce this clumsiness?
* Declare a Date type which is composed of three Int, corresponding to year, month and day. Then, rewrite showDate so that it uses the new Date data type. What changes will then be needed in showAnniversary and the Anniversary for them to make use of Date?.
# LineageOS/Compatibility

Compatibility
Installing
Features
Apps
LineageOS aims to support all devices, both old and new. The compatibility guide can help.

## Phones
### Samsung
#### Galaxy S series

| Device | Model number | Released | Max supported OS by manufacturer | Max official LineageOS (Android) version | Max unofficial LineageOS (Android) version |
| Samsung Galaxy S | GT-I9000 | June 2010 | 2.3.6 | n/a | 14.1 (7.1) |
| Samsung Galaxy S Plus | GT-I9001 | July 2011 | 2.3.6 | n/a | 14.1 (7.1.2) |
| Samsung Galaxy S Advance | GT-I9070 | April 2012 | 4.1.2 | n/a | 16 (9) |
| Samsung Galaxy S II | GT-I9100 | May 2011 | 4.1.2 | 14.1 (7.1) | 20 (13) |
| Samsung Galaxy S II Plus | GT-I9105 | January 2013 | 4.2.2 | n/a | 14.1 (7.1) |
| Samsung Galaxy S III | GT-I9300 (3G) | May 2012 | 4.3 | 14.1 (7.1) | 21 (14) |
| Samsung Galaxy S III | GT-I9305 (LTE) | October 2012 | 4.4.2 | 14.1 (7.1) | 20 (13) |
| Samsung Galaxy S III mini | GT-I8190 | November 2012 | 4.1.2 | n/a | 15.1 (8.1) |
| Samsung Galaxy S III Neo | GT-I9300I GT-I9301I | April 2014 | 4.4.4 | 18.1 (11) | 20 (13) |
| Samsung Galaxy S4 | GT-I9500 (3G) | April 2013 | 5.0.1 | n/a | 14.1 (7.1.1) |
| Samsung Galaxy S4 | GT-I9505 (LTE) | April 2013 | 5.0.1 | 18.1 (11) | 19.1 (12) |
| Samsung Galaxy S4 | GT-I9506 (LTE-A) | October 2013 | 5.0.1 | 13 (6.0) | 18.1 (11) |
| Samsung Galaxy S4 | GT-I9515 | April 2014 | 5.0.1 | 18.1 (11) | n/a |
| Samsung Galaxy S4 Active | GT-I9295 | June 2013 | 5.0.1 | 18.1 (11) | n/a |
| Samsung Galaxy S4 mini | GT-I9195 | July 2013 | 4.4.2 | 14.1 (7.1) | 18.1 (11) |
# Armenian/Numbers
## Cardinal Numbers

| # | Armenian | Transliteration | Transliteration |
| # | Armenian | Eastern | Western |
| 0 | զրո | zro | zero |
| 1 | մեկ | mek | meg |
| 2 | երկու | yerku | yergu |
| 3 | երեք | yereq | yerek |
| 4 | չորս | chors | chors |
| 5 | հինգ | hing | hink |
| 6 | վեց | vec | vets |
| 7 | յոթ | yot | yoty |
| 8 | ութ | ut | uty |
| 9 | ինը | iny | iny |
| 10 | տաս | tas | das |
| 11 | տասնմեկ | tasnmek | dasnmeg |
| 12 | տասներկու | tasnyerku | dasnyergu |
| 20 | քսան | qsan | ksan |
| 30 | երեսուն | yeresun | yeresun |
| 40 | քառասուն | karrasun | karrasun |
| 50 | հիսուն | hisun | hisun |
| 60 | վաթուն | vacun | vatsun |
| 70 | յոթանասուն | yotanasun | yotanasun |
| 80 | ութսուն | utsun | utsun |
| 90 | իննսուն | innsun | inisun |
| 100 | հարյուր | harur | haryur |
| 200 | երկու հարյուր | yerku harur | yerku haryur |
| 1000 | հազար | hazar | hazar |

## Ordinal Numbers

| English | Armenian | Transliteration | Transliteration |
| English | Armenian | Eastern | Western |
| first | առաջին | arrachin | arracheen |
| second | երկրորդ | yerkrord | yergrort |
| third | եռորդ | yerord | yerort |
| fourth | չոռորդ | chorord | chorort |
| fifth | հինգերորդ | hinkyerord | hinkyerort |
| sixth | վեցերորդ | vetsyerord | vetsyerort |
| seventh | յոթերորդ | yotyerord | yotyerort |
| eighth | ութերորդ | utyeryord | utyeryort |
# Algebra/Chapter 17/Loci

| The Distance Formula | Algebra Chapter 17: Conic Sections Section 2: Loci of Points | Conic Sections |
17.2: Loci of Points
Up to this point, all of the equations that we have solved or graphed had only one variable in mind.

## Loci

A locus (plural: loci) is one of a set of points which satisfies a set of conditions. The usual result is a curve or a surface.
In real life, you likely heard of an object's location. As a matter of fact, the word "location" comes from the word "locus" itself. Loci define where in a plane or space that an object is located.
The photo on the right illustrates a set of points (or locus) of the headlights as traced under the condition that all vehicles follow the path of the road. In this analogy:
Set of Points: The headlight's locations as seen in the photograph Condition: The road that the vehicles must follow Locus: The lanes in the road as illustrated
Unfortunately, there is no general equation for finding loci. However, the following steps are typically used to determine the equation for a locus.
* Contruct a diagram showing the given information
* Locate several points that satisfy the rule or condition
* Draw a curve or line using the located points
* Write the equation

## Equidistance

* Example 17.1: Find the locus of points $P$ such that $P$ is equidistant from both axes.
* A point on the x-axis has the coordinates $(x,0)$, and a point on the y-axis has the coordinates $(0,y)$.
# Muggles' Guide to Harry Potter/Characters/Graham Pritchard
## Overview

Graham Pritchard is a Slytherin who arrived at Hogwarts in Harry's fourth year.

## Role in the Books
### Goblet of Fire

Graham Pritchard was Sorted into Slytherin House.

## Questions

Study questions are meant to be left for each student to answer; please don't answer them here.
# QEMU

This book applies to version 2.5 and newer of QEMU.
QEMU is quick; it's a hypervisor that allows you to run virtual machines with complete operating systems that operate like any other program on your desktop. This can be useful for general purpose computing and black box testing. The software, whose website can be found here, is open-source and cross-platform. It targets a range of computer architectures beyond standard IBM PCs such as ARM and PowerPC. On Linux, it also has user-mode emulation where standard executables of one architecture can seamlessly run on another. This book will help you use the modern incarnation of QEMU for a wide variety of purposes.

## Contents

* QEMU Hello World: Installing QEMU and getting it up and running
* Installing QEMU
** Compiling from Source
*** Linux
*** OpenBSD
*** NetBSD
*** Solaris
*** AIX
*** MinGW
*** Cygwin
* Creating and Manipulating Images
* Networking
* Using the Monitor
* Invocation
* Setting up guest systems
** Windows XP
** Windows 98
** FreeDOS
** SunOS 4.1.4
** Mac OS 9
* Emulated devices
** Virtio (High Performance)
** USB Root Hubs
** Networking
** Input
** Video
** Storage
** Audio
* Host's devices
** USB
* User Interface
* Debugging with QEMU

## Further reading

* QEMU website
* QEMU wiki
* KVM, the kernel-based virtual machine for QEMU
* The wikibook QEMU and KVM (GNU Free Documentation License 1.2)
* archlinux QEMU wiki

## Contributors

* Webaware
* Ismael Luceno
# Haskell/Solutions/More on functions

← Back to More on functions

## Operators

* Exercises
* Lambdas are a nice way to avoid defining unnecessary separate functions. Convert the following let- or where-bindings to lambdas:
* map f xs where f x = x * 2 + 3
* let f x y = read x + y in foldr f 1 xs
* Sections are just syntactic sugar for lambda operations. I.e. (+2) is equivalent to \x -> x + 2. What would the following sections 'desugar' to? What would be their types?
* (4+)
* (1 `elem`)
* (`notElem` "abc")
1.
* Substitute f to get map (\ x -> x * 2 + 3) xs
* Substitute f to get foldr (\ x y -> read x + y) 1 xs
2.
* (4+)
** Becomes (\ x -> 4 + x)
** Has type Num a => a -> a
* (1 `elem`)
** Becomes(\ x -> 1 `elem` x)
** Alternately written as (\ x -> elem 1 x)
** Has type Num a :: a -> Bool
*** Note: The full type is (Foldable t, Eq a, Num a) => t a -> Bool but this has not been covered yet.
* (`notElem` "abc")
** Becomes (\ x -> x `notElem` "abc")
** Alternately written as (\ x -> notElem x "abc")
** Has type Char -> Bool