I hereby claim:
- I am lioman on github.
- I am lioman (https://keybase.io/lioman) on keybase.
- I have a public key ASCSgNqy6U3N2G9VLh8pmajLigAbc-v9qN27_07P4-WJxAo
To claim this, I am signing this object:
{ | |
"nodes": [ | |
{"id": "Myriel", "group": 1}, | |
{"id": "Napoleon", "group": 1}, | |
{"id": "Mlle.Baptistine", "group": 1}, | |
{"id": "Mme.Magloire", "group": 1}, | |
{"id": "CountessdeLo", "group": 1}, | |
{"id": "Geborand", "group": 1}, | |
{"id": "Champtercier", "group": 1}, | |
{"id": "Cravatte", "group": 1}, |
I hereby claim:
To claim this, I am signing this object:
#wotd .sidebar ul.social li a.social.icon.small { | |
font-size: .9em; | |
height: 16px; | |
padding-left: 22px; | |
padding-top: 2px | |
} | |
#wotd .sidebar ul.social li a.social.icon.small.twitter { | |
background: transparent url(/img/twitter16.png) no-repeat left center; | |
} | |
#wotd .sidebar ul.social li a.social.icon.small.facebook { |
/** | |
* Calculates values for a given polynomial till x^4 | |
* @param range The range which should be calculated e.g. [0, 19] | |
* @param precision How often one step should be divided. preciccision=2 will calculate for x=[0, 0.5, 1, 1.5, …] | |
* @param x0 x^0 | |
* @param x1 x^1 | |
* @param x2 x^2 | |
* @param x3 x^3 | |
* @param x4 x^4 | |
* @returns {Array} |
String longName = ""; | |
String long_name_tmp=""; | |
for (int i = 0; i < longNames.getLength(); i++) { | |
NodeList lngName = longNames.item(i).getChildNodes(); | |
for (int j = 0; j < lngName.getLength(); j++) { | |
String itm= lngName.item(j).getTextContent(); | |
if (lngName.item(j).getNodeName().equals("long_name")){ | |
long_name_tmp=lngName.item(j).getTextContent(); | |
} | |
if (itm.equals("locality")) { |