Too Close to Home (novel)
This is the article about the Canadian novel. For the 2016 Tyler Perry TV series, see Too Close to Home (TV series).
 Book cover | |
| Author | Linwood Barclay |
|---|---|
| Cover artist | Getty Images & Alamy |
| Country | Canada |
| Language | English |
| Genre | Thriller |
| Publisher | Orion Publishing Group |
Publication date | September 30, 2008 |
| Pages | 466 |
| ISBN | 978-1-4091-0209-0 |
Too Close to Home is a novel written by Canadian author Linwood Barclay, the author of the Richard & Judy Summer read winner "No Time For Goodbye".[1]
Summary
When the Cutter family's next-door-neighbours, the Langleys, are gunned down in their house one hot July night, the Cutters' world is turned upside down. Could the killers have gone to the wrong house? At first the idea seems crazy, but gradually we discover that each of the Cutter family has a secret they'd rather keep buried.
gollark: ```javapackage com.seriouscompany.business.java.fizzbuzz.packagenamingpackage.impl.math.arithmetics;import com.seriouscompany.business.java.fizzbuzz.packagenamingpackage.impl.ApplicationContextHolder;import javax.annotation.PostConstruct;import org.springframework.beans.factory.annotation.Autowired;import org.springframework.context.ApplicationContext;import org.springframework.stereotype.Service;import com.seriouscompany.business.java.fizzbuzz.packagenamingpackage.impl.strategies.comparators.integercomparator.IntegerForEqualityComparator;@Servicepublic class NumberIsMultipleOfAnotherNumberVerifier { private static IntegerDivider integerDivider; @Autowired private ApplicationContextHolder applicationContextHolder; @PostConstruct public void init() { final ApplicationContext applicationContext = applicationContextHolder.getApplicationContext(); this.integerDivider = applicationContext.getBean(IntegerDivider.class); } public static boolean numberIsMultipleOfAnotherNumber(final int nFirstNumber, final int nSecondNumber) { try { final int nDivideFirstIntegerBySecondIntegerResult = (NumberIsMultipleOfAnotherNumberVerifier.integerDivider.divide(nFirstNumber, nSecondNumber)); final int nMultiplyDivisionResultBySecondIntegerResult = nDivideFirstIntegerBySecondIntegerResult * nSecondNumber; if (IntegerForEqualityComparator.areTwoIntegersEqual(nMultiplyDivisionResultBySecondIntegerResult, nFirstNumber)) { return true; } else { return false; } } catch (final ArithmeticException ae) { return false; } }}```
gollark: `https://github.com/EnterpriseQualityCoding/FizzBuzzEnterpriseEdition
gollark: Not enterprise enough. Try again.
gollark: No `ModuleFactoryBuilderStrategyImpls`.
gollark: Wait, this is wrong, is this even valid Java?
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.