CUSIP Source Code - Revision history

Brianegge at 23:03, 10 December 2011

2011-12-10T23:03:51Z

← Older revision		Revision as of 23:03, 10 December 2011
Line 2:		Line 2:

	== Source Code ==		== Source Code ==
	<~~geshi~~ lang="java5">		<syntaxhighlight lang="java5">
	/**		/**
	* This class impliments the		* This class impliments the
Line 53:		Line 53:
	}		}
	}		}
	</~~geshi~~>		</syntaxhighlight>

	==Test case==		==Test case==
	<~~geshi~~ lang="java5">		<syntaxhighlight lang="java5">
	public class CusipValidatorTest extends TestCase {		public class CusipValidatorTest extends TestCase {

Line 77:		Line 77:

	}		}
	</~~geshi~~>		</syntaxhighlight>

	[[Category:Java]]		[[Category:Java]]

Egge at 02:34, 1 October 2007

2007-10-01T02:34:38Z

← Older revision		Revision as of 02:34, 1 October 2007
Line 78:		Line 78:
	}		}
	</geshi>		</geshi>

			[[Category:Java]]

Egge at 04:22, 30 September 2007

2007-09-30T04:22:05Z

← Older revision		Revision as of 04:22, 30 September 2007
Line 1:		Line 1:
			The algorithm used to assign [[http://en.wikipedia.org/wiki/Cusip CUSIP]]s a variation of the LUHN algorithm. CUSIPs are very important for being able to uniquely identify securities. For example, I've used the code below to validate when a user has entered a valid CUSIP number.

	== Source Code ==		== Source Code ==
	<geshi lang="java5">		<geshi lang="java5">

Egge: /* Test case */

2007-07-17T03:49:00Z

Test case

← Older revision		Revision as of 03:49, 17 July 2007
Line 54:		Line 54:

	==Test case==		==Test case==
	<~~pre~~>		<geshi lang="java5">
	public class CusipValidatorTest extends TestCase {		public class CusipValidatorTest extends TestCase {

Line 75:		Line 75:

	}		}
	</~~pre~~>		</geshi>

Egge: /* Source Code */

2007-07-17T03:48:22Z

Source Code

← Older revision		Revision as of 03:48, 17 July 2007
Line 1:		Line 1:
	== Source Code ==		== Source Code ==
	<~~pre~~>		<geshi lang="java5">
	/**		/**
	* This class impliments the		* This class impliments the
Line 51:		Line 51:
	}		}
	}		}
	</~~pre~~>		</geshi>

	==Test case==		==Test case==

Brianegge at 01:13, 9 February 2007

2007-02-09T01:13:13Z

← Older revision		Revision as of 01:13, 9 February 2007
Line 3:		Line 3:
	/**		/**
	* This class impliments the		* This class impliments the
	* ~~<a href="http://en.wikipedia.org/wiki/Luhn_formula">LUHN formula</a>~~ in order		* Modulus 10 Double Add Double in order
	* to check if a <a href="http://en.wikipedia.org/wiki/CUSIP">CUSIP</A>		* to check if a <a href="http://en.wikipedia.org/wiki/CUSIP">CUSIP</A>
	* is valid.		* is valid.
	* @author ~~eggebr~~		* @author Brian Egge
	*/		*/
	public class CusipValidator {		public class CusipValidator {

Brianegge at 01:12, 9 February 2007

2007-02-09T01:12:06Z

← Older revision		Revision as of 01:12, 9 February 2007
Line 8:		Line 8:
	* @author eggebr		* @author eggebr
	*/		*/
	public class ~~LUHN~~ {		public class CusipValidator {

	public static boolean isValid(String ccNum) {		public static boolean isValid(String ccNum) {
Line 55:		Line 55:
	==Test case==		==Test case==
	<pre>		<pre>
	public class ~~LUHNTest~~ extends TestCase {		public class CusipValidatorTest extends TestCase {

	public void testCUSIP() {		public void testCUSIP() {
	assertTrue(~~LUHN~~.isValid("31430F200"));		assertTrue(CusipValidator.isValid("31430F200"));
	assertTrue(~~LUHN~~.isValid("037833100")); // Apple		assertTrue(CusipValidator.isValid("037833100")); // Apple
	assertTrue(~~LUHN~~.isValid("316549401"));		assertTrue(CusipValidator.isValid("316549401"));
	assertTrue(~~LUHN~~.isValid("022615AC2"));		assertTrue(CusipValidator.isValid("022615AC2"));
	assertTrue(~~LUHN~~.isValid("931142103")); // Walmart		assertTrue(CusipValidator.isValid("931142103")); // Walmart
	assertTrue(~~LUHN~~.isValid("883199AQ4"));		assertTrue(CusipValidator.isValid("883199AQ4"));
	assertTrue(~~LUHN~~.isValid("14911QGW5"));		assertTrue(CusipValidator.isValid("14911QGW5"));
	assertTrue(~~LUHN~~.isValid("14911QHM6"));		assertTrue(CusipValidator.isValid("14911QHM6"));
	assertTrue(~~LUHN~~.isValid("339072407"));		assertTrue(CusipValidator.isValid("339072407"));
	assertTrue(~~LUHN~~.isValid("3133XBC78"));		assertTrue(CusipValidator.isValid("3133XBC78"));
	assertTrue(~~LUHN~~.isValid("808905AB9"));		assertTrue(CusipValidator.isValid("808905AB9"));

	assertFalse(~~LUHN~~.isValid("2005"));		assertFalse(CusipValidator.isValid("2005"));
	assertFalse(~~LUHN~~.isValid("?"));		assertFalse(CusipValidator.isValid("?"));
	}		}

	~~public void testCreditCards() {~~
	~~assertTrue(Luhn.isValid("3850074292251725"));~~
	~~assertTrue(Luhn.isValid("4242540460361996"));~~
	~~assertTrue(Luhn.isValid("6030624550510273"));~~
	~~assertTrue(Luhn.isValid(CreateNumber(16)));~~
	~~assertTrue(Luhn.isValid(CreateNumber(13)));~~
	}

	~~private String CreateNumber(int length) {~~
	~~Random random = new Random();~~
	~~int[] digits = new int[length];~~
	~~for (int i = 0; i < length - 1; i++) {~~
	~~digits[i] = random.nextInt(10);~~
	}
	~~int sum = 0;~~
	~~boolean alt = true;~~
	~~for (int i = length - 2; i >= 0; i--) {~~
	~~if (alt) {~~
	~~int temp = digits[i];~~
	~~temp *= 2;~~
	~~if (temp > 9) {~~
	~~temp -= 9;~~
	}
	~~sum += temp;~~
	~~} else {~~
	~~sum += digits[i];~~
	}
	~~alt = !alt;~~
	}
	~~int modulo = sum % 10;~~
	~~if (modulo > 0) {~~
	~~digits[length - 1] = 10 - modulo;~~
	}
	~~String out = "";~~
	~~for(int n : digits) {~~
	~~out += Integer.toString(n);~~
	}
	~~return out;~~
	}
	}		}
	</pre>		</pre>

Brianegge: LUHN Source Code moved to CUSIP Source Code: The LUHN check and CUSIP are different.

2007-02-09T01:08:30Z

LUHN Source Code moved to CUSIP Source Code: The LUHN check and CUSIP are different.

← Older revision		Revision as of 01:08, 9 February 2007
(No difference)

Brianegge: /* Test case */

2007-02-07T04:52:25Z

Test case

@@ Line 73: / Line 73: @@
      assertFalse(LUHN.isValid("?"));
+   }
+}
 </pre>

Brianegge at 21:33, 9 May 2006

2006-05-09T21:33:28Z

New page

== Source Code ==
<pre>
/**
* This class impliments the
* <a href="http://en.wikipedia.org/wiki/Luhn_formula">LUHN formula</a> in order
* to check if a <a href="http://en.wikipedia.org/wiki/CUSIP">CUSIP</A>
* is valid.
* @author eggebr
*/
public class LUHN {

public static boolean isValid(String ccNum) {

char number[] = ccNum.toCharArray();

int len = number.length;
int sum = 0;
for (int i = 0; i < len - 1; i++) {
int num = mapChar(number[i]);

// Double all the odd digits
if (i % 2 != 0)
num *= 2;

// Combine digits. i.e., 16 = (1 + 6) = 7
if (num > 9)
num = (num % 10) + (num / 10);
sum += num;
}

int checkDigit = mapChar(number[number.length - 1]);

// This is the mathmatical modulus - not the remainder. i.e., 10 mod 7 = 3
int mod = (10 - (sum % 10)) % 10;
if (mod == checkDigit) {
return true;
}

return false;
}

/**
* Standard & Poor's maps A..Z to 10..35
* @param c
* @return numeric value of the letter
*/
private static int mapChar(char c) {
if (c >= '0' && c <= '9')
return c - '0';
return c - 'A' + 10;
}
}
</pre>

==Test case==
<pre>
public class LUHNTest extends TestCase {

public void testCUSIP() {
assertTrue(LUHN.isValid("31430F200"));
assertTrue(LUHN.isValid("037833100")); // Apple
assertTrue(LUHN.isValid("316549401"));
assertTrue(LUHN.isValid("022615AC2"));
assertTrue(LUHN.isValid("931142103")); // Walmart
assertTrue(LUHN.isValid("883199AQ4"));
assertTrue(LUHN.isValid("14911QGW5"));
assertTrue(LUHN.isValid("14911QHM6"));
assertTrue(LUHN.isValid("339072407"));
assertTrue(LUHN.isValid("3133XBC78"));
assertTrue(LUHN.isValid("808905AB9"));

assertFalse(LUHN.isValid("2005"));
assertFalse(LUHN.isValid("?"));
}
}
</pre>