The Dark Side of Tomorrow
The Dark Side of Tomorrow is a 1970 exploitation film about two bored suburban housewives who begin an affair while their husbands are away on business. Things take a turn when one of them decides to become involved with a young man from their neighborhood. To one woman, the affair was just a fling. To the other, it was life changing.
| The Dark Side of Tomorrow | |
|---|---|
| Directed by | Barbara Peeters Jack Deerson |
| Produced by | David Novik |
| Written by | David Novik and Barbara Peeters |
| Starring | Elizabeth Plumb |
| Cinematography | Jacques Deerson |
| Edited by | Richard Weber |
Production company | |
| Distributed by | Able Films |
Release date |
|
Running time | 84 minutes |
| Country | United States |
| Language | English |
It was re-released in 1975 as Just the Two of Us.
Cast
- Elizabeth Plumb (as Elisabeth Plumb)-Denise Bentley
- Alisa Courtney- Adria Madsen
- John Aprea -Jim Jeffers
- Marland Proctor -Casey
- Wayne Want -David Madsen
- Elizabeth Knowles (as Elizabeth Knowels)-Mona Klein
- Jamie Cooper -Joe Bentley
- Vince Romano -the waiter
Production
The film was financed by an Israeli investor who wanted an X-rated sex film. Director Barbara Peeters changed the storyline to center around a lesbian relationship. She feels the fact it was from a female director was significant. "If you are going to involve yourself in subjects that heretofore have been taboo, the first moves in that direction should be as close to reality as possible", she said.[1]
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).
gollark: By "really fast", I mean "in a few decaminutes, probably".
gollark: I suppose I could just specify it really fast.
gollark: I could, but do I really want to?
See also
References
- Gross, Linda. (Feb 12, 1978). "A Woman's Place Is in... Exploitation Films?: A Trend-Setter in the Youth Market Women in Exploitation Films". Los Angeles Times. p. 34.
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.