In the Path of the Storm

In the Path of the Storm is the sixth book of The Animals of Farthing Wood series. It was first published in 1989 and has since been included in a single book with The Siege of White Deer Park and Battle for the Park in the "Second Omnibus" edition (Hutchinson, 1995).

In the Path of the Storm
First edition
AuthorColin Dann
IllustratorTrevor Newton
CountryUnited Kingdom
LanguageEnglish
SeriesThe Animals of Farthing Wood
GenreChildren's, Fantasy novel
PublisherHutchinson
Publication date
1989
Media typePrint (Hardback & Paperback)
Pages154 (first edition, hardback)
ISBN0-09-173858-X (first edition, hardback)
OCLC20089022
Preceded byThe Siege of White Deer Park 
Followed byBattle for the Park 

Plot summary

The death of the Great Stag, the leader of the deer of White Deer Park, leaves its inhabitants at the mercy of his successor Trey, a strong and fearsome stag who believes there is no room for the smaller animals in the nature reserve. Meanwhile, Tawny Owl grows tired of bachelorhood and leaves the park in search of a mate.

Characters in In the Path of the Storm
Main article: List of Animals of Farthing Wood characters

Television series

The events of the book are covered throughout the third season of The Animals of Farthing Wood (TV series), though the sequence of events is changed slightly.

gollark: ```python#!/bin/env python3chars = [chr(n) for n in range(126)]firstchar = chars[0]lastchar = chars[len(chars) - 1]def increment_char(character): return chr(ord(character) + 1)def old_increment_string(string_to_increment): reversed_string = list(reversed(string_to_increment)) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed(reversed_string)))def increment_string(to_increment): reversed_string = list(to_increment) # Reverse the string for easier work. for rindex, char in enumerate(reversed_string): if char == lastchar: # If we can't increment this char further, try the next ones. reversed_string[rindex] = firstchar # Set the current char back to the first one. reversed_string[rindex + 1] = increment_char(reversed_string[rindex + 1]) # Increment the next one along. else: # We only want to increment ONE char, unless we need to "carry". reversed_string[rindex] = increment_char(reversed_string[rindex]) break return ''.join(list(reversed_string))def string_generator(): length = 0 while 1: length += 1 string = chars[0] * length while True: try: string = increment_string(string) except IndexError: # Incrementing has gone out of the char array, move onto next length break yield string```
gollark: Except it enumerates all possible ASCII strings instead.
gollark: I made that!
gollark: no.
gollark: Check out my cool project!http://localhost:3030

See also


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.