OpenLLM-France/wikimedia huggingface dataset:
# Fire on the Limestone Plains/Bush Fire Legislation

On the 22nd November 1915, the district surveyor Percy Lempriere Sheaffe recommended to the Administrator, Colonel Miller, that an Ordinance similar to that of NSW Careless Use of Fire Act be authorised to minimise the risk of bush fires to the Territory.
The Careless Use of Fire Ordinance 1916 was notified in the Commonwealth Gazette on 29 June 1916 (Commonwealth Gazette 1916 No 76). The Careless Use of Fire Regulations 1917 were notified in the Commonwealth Gazette on 25 January 1917
The Careless Use of Fire Ordinance 1936 (also known as the Bushfire Act 1936) was notified in the Commonwealth Gazette on 14 May 1936 (Cwlth Gaz 1936 No 41). This ordinance became an Australian Capital Territory Act on 11 May 1989 (see Australian Capital Territory (Self-Government) Act 1988 (Cwlth) s 34 (4))
Bushfire Act 1936 was repealed by Emergencies Act 2004. The Emergencies Act 2004 was passed by the Legislative Assembly and notified under the Legislation Act 2001 and notified on 29 June 2004. There have been 24 amendments to the Act the latest 14 October 2015.
   Emergencies Bill 2004 29 June 2004
   The Bill establishes the Emergency Services Authority. The authority is constituted by the Emergency Services Commissioner. The authority will be responsible for the overall strategic direction and management of the four services (the Fire Brigade, Ambulance Service, Rural Fire Service and the State Emergency Service). Day to day performance of functions is to remain under the direct management of the Chief Officers of the services who, as members of the authority’s staff, are ultimately responsible to the Commissioner for the performance of functions.
   Minister for Police and Emergency Services Mr Bill Wood MLA

## References

* 1 2 http://www.naa.gov.au/ NAA A361, DSG16/528 Bush Fire Association http://recordsearch.naa.gov.au/SearchNRetrieve/Interface/ViewImage.aspx?B=62858
* ↑ Careless use of Fire Ordinance Federal Capital NAA: A1, 1930/11410
* ↑ "ACT legislation register - Bushfire Act 1936 (repealed) - Notification statement".
* ↑ "ACT legislation register - Bushfire Act 1936 (repealed) - main page".
# Fire on the Limestone Plains/Bush Fires

Bush fires are an integral part of Australia's environment. Historically the areas which experience the most severe bush fires usually occur in the south-eastern corner of Australia, south of a line from Sydney to Adelaide, however over the last few years significant bush fires have occurred in the southern parts of Western Australia.

## References

* ↑ BUSHFIRES - AN INTEGRAL PART OF AUSTRALIA'S ENVIRONMENT http://www.abs.gov.au/AUSSTATS/abs@.nsf/Previousproducts/1301.0Feature%20Article101995?opendocument&tabname=Summary&prodno=1301.0&issue=1995&num=&view=. Retrieved January 2016
* ↑ 1301.0 - Year Book Australia, 2004 http://www.abs.gov.au/ausstats/abs@.nsf/0/ccb3f2e90ba779d3ca256dea00053977?OpenDocument. Retrieved January 2016
# Fire on the Limestone Plains/Bush Fires/1958 to 1973
## 1958 to 1973

Only 3 of these bush fire seasons were potentially serious and though large numbers of bush fires occurred none reached a major bush fire. During the 1964-65 bush fire season there were 140 outbreaks.
The 1960-61 Fire Season was a comparatively mild one, however it was necessary for a Total Fire Ban to be imposed from 7 to 9 February 1961. 33 fires attended by Bush Fire Council units, 13 were caused by children.

### References

* ↑ Luke, R. H. (R. Harry); McArthur, A. G. (Alan Grant), 1923-1978; Australia. Forestry and Timber Bureau; CSIRO. Division of Forest Research (1978), Bushfires in Australia, Australian Government Publishing Service, ISBN 978-0-642-03990-3{{citation}}: CS1 maint: multiple names: authors list (link)
* ↑ A.C.T. Bush Fire Council Annual Report 1960-61
# Fireboy and Watergirl in the Forest Temple/Level 3

Level 3 is the third level of the game. It is unlocked after completing level 2, and completing level 3 unlocks level 4.
This concept also introduces you to a new concept - fans. If the player is above a fan, it will push him/her up. This specific level doesn’t require collaboration between Fireboy and Watergirl, so if playing solo, you might find it easier to first get one to the door, and then the second.
# Fireboy and Watergirl in the Forest Temple/Level 5

Level 5 is one of the 5 levels which are unlocked after completing level 4. Completing level 5 will unlock level 6.
# First Aid/Abuse & Neglect

Abuse: is when a person's well-being is deliberately and intentionally threatened. In some jurisdictions, if you are a health care provider then you may be obligated to report abuse or neglect that you observe. In particular, if you are in any position of authority in relation to a child, you are likely required by law to report child abuse.
If you are not under a professional duty of care, it is strongly recommended that you report any instances of suspected abuse. Stick to reporting the facts, and let the authorities determine the truth of any suspicion. Never confront the potential abuser yourself - consider your own safety.
The most vulnerable groups are the young and elderly, but be aware of the potential for abuse in all people (such as abuse of a spouse of either gender).

## Physical abuse

    abuse involving contact intended to cause pain, injury, or other physical suffering or harm.

## Emotional abuse

    a long-term situation in which one person uses his or her power or influence to adversely affect the mental well-being of another. Emotional abuse can appear in a variety of forms, including rejection, isolation, exploitation, and terror.

## Sexual abuse

    is defined by the forcing of undesired sexual acts by one person to another.

## Neglect

    a category of maltreatment, when there is a failure to provide for the proper physical care needs of a dependent.
Some forms of abuse may be more obvious such as physical abuse but the rest may be concealed depending on the victim. If you notice any whip marks, burns, bruises with an unexplained origin, slap marks, bite marks, etc., you may suspect abuse.
If the person's life is in immediate danger then you should contact emergency medical services. As a first aider you are in a good position to do this without suspicion - if questioned you should state that you believe the victim requires further treatment. If possible, you should request police assistance, although not if you are in the presence of the suspected abuser. To help with this, some ambulances operate a safeword system (usually for their crews) which can be entered in to the call to flag an abuse query. These are not widely published (to protect their usage), but if you work for a recognized organization, they may be willing to share this word with you or your group.
If the person's safety is not in immediate danger, you should contact your local government department which deals with accusations of abuse, which may vary within locations by the demographics of the person being abused (child, elder, learning difficulties etc.). If in doubt, contact your local police, who should be able to signpost you to the most appropriate service.
# Fireboy and Watergirl in the Forest Temple/Level 4

Level 4 is the fourth level of the game, and is unlocked after completing level 3. After completing level 4, many branches are unlocked. Levels 5, 8, 14, 24, and 30 are unlocked and you can play them in any order you like.
# English Opening - Symmetrical Variation
### 3...Nf6
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 Nf6
| 4 | 5 |
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.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 4. Bg2
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6 4.Bg2
| 4 | 5 | 6 | 7 | 8 | 9 |
| Bg2 Bg7 | Nf3 Nf6 | O-O O-O | d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 5. Nf3
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6 4.Bg2 Bg7 5. Nf3
| | 5 | 6 | 7 | 8 | 9 |
| Main Line | Nf3 Nf6 | O-O O-O | d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | = |
| 2 | ... a6 | | | | | |
| 3 | ... e6 | | | | | |
| Wedberg Variation | ... e5 | O-O Nge7 | a3 O-O | | | |
| 5 | ... d6 | | | | | |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* Hansen, Carsten (2000). The Symmetrical English. Great Britain: Gambit. ISBN 1-901983-40-4.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 7. d4
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6 4.Bg2 Bg7 5. Nf3 Nf6 6. O-O O-O 7. d4
| 7 | 8 | 9 | 10 |
| d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | Qd3 a6 | = |
| ... d6 | | | | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 3. g3
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3
| 3 | 4 | 5 |
| g3 g6 | Bg2 Bg7 | Nf3 Nf6 | = |
| ... Nf6 | | | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 5...Nf6
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6 4.Bg2 Bg7 5. Nf3 Nf6
| 6 | 7 | 8 | 9 | 10 |
| O-O O-O | d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | Qd3 a6 | = |
| d4 cxd4 | Nxd4 O-O | Nc2 d6 | O-O Be6 | b3 Qd7 | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 3...g6
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6
| 4 | 5 | 6 | 7 | 8 | 9 |
| Bg2 Bg7 | Nf3 Nf6 | O-O O-O | d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 4...Bg7
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6 4.Bg2 Bg7
| 5 | 6 | 7 | 8 | 9 |
| Nf3 Nf6 | O-O O-O | d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | = |
| a3 a6 | Rb1 Rb8 | b4 cxb4 | axb4 b5 | cxb5 axb5 | = |
| e3 e6 | Nge2 Nge7 | O-O O-O | d4 cxd4 | nxd4 Nxd4 | = |
| d3 e6 | Bd2 Nge7 | Qc1 h6 | h4 b6 | Nh3 Bb7 | = |
| e4 e6 | Nge2 Nge7 | O-O O-O | d3 d6 | a3 b6 | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 6. O-O
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6 4.Bg2 Bg7 5. Nf3 Nf6 6. O-O
| 6 | 7 | 8 | 9 | 10 |
| O-O O-O | d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | Qd3 a6 | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Symmetrical English
### 6. O-O
## Theory table

For explanation of theory tables, see theory table and for notation, see algebraic notation. .
1.c4 c5 2.Nc3 Nc6 3.g3 g6 4.Bg2 Bg7 5. Nf3 Nf6 6. O-O O-O
| 7 | 8 | 9 | 10 |
| d4 cxd4 | Nxd4 Nxd4 | Qxd4 d6 | Qd3 a6 | = |
| d3 | | | | = |
| b3 | | | | = |
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.
* Nunn's Chess Openings. 1999. John Nunn (Editor), Graham Burgess, John Emms, Joe Gallagher. ISBN 1-8574-4221-0.
* This Chess related article is a stub. Please assist Wikibooks by expanding it.
# Futurebasic/Language/Reference/beginassem
## BeginAssem
### Statement

✔ Appearance ✔ Standard ✔ Console

### Description

Marks the beginning of a block of assembly-language statements. The block must be terminated with the EndAssem statement. The statements are assembled directly into the compiled program and executed when the program is run.
Each line in the assembly_statements block should be in this format:
[label] opCode [operands] [;remark]
Note that there should be at least one space character separating each of the four fields of this line. In particular, if label is omitted, you must include at least one leading space in front of opCode. But if label is included, then there should be no leading space to the left of label. To make a nicely formatted listing, use the TAB key to separate the fields.
You can also create assembly-language statements without using the BeginAssem and EndAssem statements, by preceding each assembly statement line with a “grave accent” character (that’s the character to the left of the “1” on the keyboard. It looks like a “backwards” apostrophe: `):
`[label] opCode [operands] [;remark]
This method has the disadvantage that you can’t specify a cpuType for each group of lines: assembly lines that begin with the “`” mark are always assembled according to the “preferred CPU,” using the rules given above. It’s important that you understand which CPU your assembly statements are being assembled for, and that your statements are appropriate for that CPU. You can use the compile long if cpuType statement to exclude your assembly statements from inappropriate compilations.

### Notes

BeginAssem is not supported in FBtoC.

### See Also

machlg; compile long if; #if
Language Reference
# Futurebasic/Language/Reference/begin enum
## Begin Enum
### Statement

✔ Appearance ✔ Standard ✔ Console

### Description

This statement begins a block of "enumerated constant" definition lines. The block must be terminated with the end enum statement. All of the constants defined in this block are global, regardless of where in the program the block appears.
The begin enum...end enum block is "non-executable," which implies that it won't be repeated or skipped if it appears within any kind of "conditional execution" block, such as for...next, long if...end if, do...until, etc. (but it can be conditionally included or excluded if it appears inside a compile long if block).
Each _constName represents a symbolic constant name that has not previously been defined, and each staticExpression represents an integer expression which consists only of:
* integer literal constants;
* previously-defined symbolic constant names;
* operators (like +, -, *, /, >, =);
* parentheses
(In particular, it can't contain variables, nor function references.) The begin enum block assigns values to each of the _constName symbolic constants as follows:
* If the _constName is followed by = staticExpression, then _constName is assigned the value of staticExpression;
* If the _constName is not followed by = staticExpression, then _constName is assigned the value of the _constName in the line above it, plus the value of inc;
* If the very first _constName is not followed by = staticExpression, then it's assigned the value of start.
The start and inc parameters, if included, must each be a static integer expression. The default value of start is 0, and the default value of inc is 1.

### Example

In the following, the dwarves are assigned values of 1 through 7; _snowWhite is assigned the value 100, and _thePrince is assigned the value 101.

### Notes

No special notes.

### See Also

Language Reference
# Futurebasic/Language/Reference/begin union
## Begin Union
### Statement

✔ Appearance ✔ Standard ✔ Console

### Description

A union is used to set aside space in a record that may potentially contain more than one size variable. The following example sets aside two equal offsets within a record for variables of differing sizes:
The variable myTest.inUnion1 is a single byte which occupies the same space as the first byte in the string myTest.inUnion2$. In this case, myTest.inUnion1 happens to be the length byte of the string and the print statement will produce "3". Such an overlap is not necessary and the two values may have no relation to one another except that they start at the same location in memory.
When FB encounters a begin union statement, all dims up to the end union statement are examined and the largest item in the union determines the amount of space set aside by the compiler. In the example above, the union would occupy 256 bytes since the largest element in the union is a 256 byte Pascal string.

### Notes

No special notes.

### See Also

dim record...dim end record; dim; begin record
Language Reference
# Futurebasic/Language/Reference/binstring
## Bin$
### Function

✔ Appearance ✔ Standard ✔ Console

### Description

This function returns a string of zeros and ones representing the binary value of expr, in "two's-complement integer" format (this is the native format in which integers are stored in FB). If defstr byte is in effect, an 8-character string will be returned. If defstr word is in effect, a 16-character string will be returned. If defstr long is in effect, a 32-character string will be returned.

### Example

The chart below shows the results of bin$ on some integer values. (If a non-integer expr is used, bin$ converts it to an integer before generating the string.) The chart assumes that defstr word is in effect. The chart below shows the results of bin$ on some integer values. (If a non-integer expr is used, bin$ converts it to an integer before generating the string.) The chart assumes that defstr word is in effect.
| expr | bin$(expr) |
| 1 | 0000000000000001 |
| -1 | 1111111111111111 |
| 256 | 0000000100000000 |
| -256 | 1111111100000000 |
To convert a string of binary digits into an integer, use the following technique:
intVar can be a (signed or unsigned) byte variable, short-integer variable or long-integer variable. Byte variables can handle a binaryString$ up to 8 characters in length; short-integer variables can handle a binaryString$ up to 16 characters in length; long-integer variable can handle a binaryString$ up to 32 characters in length.

### Notes

No special notes.

### See Also

hex$; oct$; UNS$; destr byte/word/long; Appendix C: Data Types and Data Representation
Language Reference
# Futurebasic/Language/Reference/beep
## Beep
### Statement

✔ Appearance ✔ Standard ✔ Console

### Description

This statement produces a system beep as defined by the Sound control panel. Useful for alerting the user that the application needs attention.

### Notes

No special notes.

### See Also

sound
Language Reference
# Futurebasic/Language/Reference/bit
## Bit
### Function

✔ Appearance ✔ Standard ✔ Console

### Description

This function returns an integer whose binary representation has the bit in position bitPos set to "1", and all other bits set to "0". Bit positions are counted from right to left: a bitPos value of zero corresponds to the rightmost ("least significant") bit. The maximum allowable value for bitPos is 31, which corresponds to the leftmost bit in a long-integer value. bit is useful in conjunction with "bitwise operators" like and and or, for setting and testing the values of particular bits in a quantity.

### Example

The following expression evaluates as _zTrue (-1) if bit "n" is set in testValue&:
The following assignment sets bit "n" in testValue& to 1:
The following assignment resets bit "n" in testValue& to 0:

### Notes

If _bitPos is a symbolic constant name, then you can use _bitPos% (note the "%") as a synonym for bit( _bitPos ).

### See Also

bin$; and; or; not; Appendix C: Data Types and Data Representation
Language Reference
# Futurebasic/Language/Reference/blockmove
## BlockMove
### Statement

✔ Appearance ✔ Standard ✔ Console

### Description

Copies a range of bytes which begin at address sourceAddr&, to the address range that begins at address destinationAddr&. The numberBytes& parameter specifies the number of bytes which are to be copied. The copying works correctly even if the source and destination ranges overlap.

### Notes

For copying small amounts of data (80 bytes or less) into a variable, it is more efficient to use the var;length = address syntax of the let statement. See the let statement for more details.

### See Also

let; varptr
Language Reference
# Futurebasic/Language/Reference/box
## Box
### Statement

✔ Appearance ✔ Standard ✔ Console

### Description

Draws a rectangle which has diagonally opposite corners at coordinates (h,v) and (h1,v1). The rectangle's frame is drawn using the current pen size, mode, pattern and color for the current window or printer. If the fill clause is specified, then the rectangle is filled with the current window pattern.
If the to keyword is specified more than once, then several rectangles are drawn, each using (h,v) as one corner, and the coordinates following to as the diagonally opposite corner.
If the h and v parameters are omitted, then the rectangle's originating point is set to one of the following:
* The (h,v) coordinates of the most recent box statement (in any window) that actually specified the h and v parameters;
* The last point specified in the most recent plot statement (in any window);
* (0,0), if no plot statement has yet been executed, and no prior box statement that specified h and v has yet been executed.

### Console Behavior

When you use the Console, box always switches to the Graphics Window before drawing. You can't use box to draw a box in the Text Window, or on the printer; use the Toolbox procedures FrameRect or PaintRect instead. Alternatively, you can activate the graphics window and select Print from the File menu.

### Notes

No special notes.

### See Also

circle; plot; pen
Language Reference
# Conlang/Intermediate/Grammar/Forms/Sources
## Head

* The Head Parameter in Morphology and Syntax, Jack Hoeksemam, 1990.
* Righthand head rule, Wikipedia.