Hainesville, New Jersey

Hainesville is an unincorporated community located within Sandyston Township, in Sussex County, New Jersey, United States.[1] It lies along a stretch of County Route 645, known as the Layton-Hainesville Road, that runs parallel to U.S. Route 206 and connects to County Route 675. It is adjacent to the Delaware Water Gap National Recreation Area, and near the towns of Shaytown and Layton. Its coordinates are latitude 41.25194 and longitude −74.80333. It is 620 feet (189 meters) above sea level.[2]

Hainesville, New Jersey
Hainesville, New Jersey
Hainesville's location in Sussex County (Inset: Sussex County in New Jersey)
Hainesville, New Jersey
Hainesville, New Jersey (New Jersey)
Hainesville, New Jersey
Hainesville, New Jersey (the United States)
Coordinates: 41.25194°N 74.80333°W / 41.25194; -74.80333
CountryUnited States
StateNew Jersey
CountySussex
TownshipSandyston
Named forDaniel Haines
Elevation
620 ft (190 m)
Time zoneEastern (EST)
  Summer (DST)EDT

Named for Daniel Haines, governor of New Jersey from 1843 to 1844 and from 1845 to 1848,[3] it is in Area code 973, and ZIP Code 07826, both of which it shares with Branchville, New Jersey.[4]

Description

Hainesville and environs is home to the Hainesville General Store, Hidden Acres Golf Course, the Hainesville Fish and Wildlife Management Area[5], a body of water known as the Hainesville Pond, and the Hainesville Cemetery c. 1879 and Shaytown Burial Ground c. 1812[6]. The Catholic parish St. Thomas the Apostle is actually located in nearby Layton.[7]

Notable people

People who were born in, residents of, or otherwise closely associated with Hainesville include:

  • Blase Cole (born November 21, 1879), a physician who served in the New Jersey Senate, representing Sussex County, from 1925 to 1936. He was additionally an alternate New Jersey delegate to the Democratic National Convention in 1932.[8]
  • The comic-book artist Bill Sienkiewicz was raised in Hainesville from the age of five.
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

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