Double Fudge

Double Fudge is a 2002 children's novel by Judy Blume and the fourth and final in the Fudge Series. The Hatcher family goes to Washington, D.C. where they spend time with their extended family, and Fudge finds out that his cousin is also named Farley Drexel Hatcher. His interest in money is a common theme throughout the story.

Double Fudge
First edition
AuthorJudy Blume
CountryUnited States
LanguageEnglish
SeriesFudge Series
GenreChildren's novel and realistic fiction
Published2002
Media typePrint (Paperback)
Pages213
ISBN0-525-46926-5
OCLC49664589
LC ClassPZ7.B6265 Do 2002
Preceded byFudge-A-Mania 

Plot

In this latest installment of the Fudge Series, Fudge is still five years old and takes up an obsessive and greedy love for money, driving his twelve year old brother Peter insane,[1] and after some talking with his family, they decide to take him to the Bureau of Engraving and Printing in Washington, D.C. for a long weekend to show how it is made, hoping that his obsession would stop there. That plan doesn't work, and instead they meet up with their long-lost cousins, the Howie Hatchers. There is Howie, a park ranger who resides in Hawaii and is traveling the country, his pregnant wife, Eudora, their perfect, slightly overindulged twelve-year-old identical twin daughters, Flora and Fauna, who are sometimes nicknamed the "Natural Beauties" and the "Heavenly Hatchers," and last but not least, three-year-old Farley Drexel Hatcher, which is also Fudge's real name. Peter dubs him "Mini" and the nickname sticks. Peter's family is taken aback when the Howie Hatchers invite themselves to move in with Peter's family for weeks in their Upper West Side apartment.

Peter is also having a rough time throughout the story because his best friend, Jimmy Fargo, has left the Upper West Side and moved "far off" to SoHo on the other side of Manhattan, although they still get to go to the same school, where they're both in the seventh grade, while Fudge is in Mixed group, along with his new friend Melissa Beth Miller.

Near the end of the story, in a semi-homage to the ending of the first novel, Mini swallows Fudge's baby tooth that just fell out, making him furious at him because he was planning to get a dollar for it from the tooth fairy. After the Howie Hatchers leave with Mini for good, Fudge throws a temper tantrum over what Mini did, saying he hated him. Then Peter tells Fudge that he felt the same way when Fudge swallowed Peter's pet turtle, Dribble, in Tales of a Fourth Grade Nothing. Genuinely surprised at this news, Fudge apologizes to Peter for doing so and finally realizes that he hasn't been a very good brother to him.

The paperback edition contains an after-story interview with Judy Blume, who claims she has no definite plans, but may write yet another Fudge story, which, as of August 2020, is something that has not yet come to fruition.

gollark: I think this is technically possible to implement, so bee⁻¹ you.
gollark: This is underspecified because bee² you, yes.
gollark: All numbers are two's complement because bee you.
gollark: The rest of the instruction consists of variable-width (for fun) target specifiers. The first N target specifiers in an operation are used as destinations and the remaining ones as sources. N varies per opcode. They can be of the form `000DDD` (pop/push from/to stack index DDD), `001EEE` (peek stack index EEE if source, if destination then push onto EEE if it is empty), `010FFFFFFFF` (8-bit immediate value FFFFFFFF; writes are discarded), `011GGGGGGGGGGGGGGGG` (16-bit immediate value GGGGGGGGGGGGGGGG; writes are also discarded), `100[H 31 times]` (31-bit immediate because bee you), `101IIIIIIIIIIIIIIII` (16 bits of memory location relative to the base memory address register of the stack the operation is conditional on), `110JJJJJJJJJJJJJJJJ` (16 bit memory location relative to the top value on that stack instead), `1111LLLMMM` (memory address equal to base memory address of stack LLL plus top of stack MMM), or `1110NNN` (base memory address register of stack MMM).Opcodes (numbered from 0 in order): MOV (1 source, as many destinations as can be parsed validly; the value is copied to all of them), ADD (1 destination, multiple sources), JMP (1 source), NOT (same as MOV), WR (write to output port; multiple sources, first is port number), RE (read from input port; one source for port number, multiple destinations), SUB, AND, OR, XOR, SHR, SHL (bitwise operations), MUL, ROR, ROL, NOP, MUL2 (multiplication with two outputs).
gollark: osmarksISA™️-2028 is a VLIW stack machine. Specifically, it executes a 384-bit instruction composed of 8 48-bit operations in parallel. There are 8 stacks, for safety. Each stack also has an associated base memory address register, which is used in some "addressing modes". Each stack holds 64-bit integers; popping/peeking an empty stack simply returns 0, and the stacks can hold at most 32 items. Exceeding a stack's capacity is runtime undefined behaviour. The operation encoding is: `AABBBCCCCCCCCC`:A = 2-bit conditional operation mode - 0 is "run unconditionally", 1 is "run if top value on stack is 0", 2 is "run if not 0", 3 is "run if first bit is ~~negative~~ 1".B = 3-bit index for the stack to use for the conditional.C = 9-bit opcode (for extensibility).

References
  1. Kumar, Sohini (10 November 2015). "Children's books that have stood the test of time". The Boar. Retrieved 4 March 2016.


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