Hi;
I have an Excel file with one culumn and there is a lot of numbers in it. I want to want these data to an array in c#. I want c# code immediately.
Thank you all...
Hi,
I'm making a game where when a card is touched, it grows so that it is focused, and when you 'let go', it goes back to its original size and place. This seems pretty standard, however, when I add cards and move the hand around to accommodate different numbers of cards, touching the card makes it go to its original place, and not to the new place.
This has been stumping me for a while now
Any hints would be much appreciated.
Thanks !
Hello,
I have a datetime.datetime property var.
I would like to know if it is less than one hour of the current time.
Something like
var.hour<datetime.datetime.today().hour - 1
Problem with the above syntax is that
datetime.datetime.today().hour
returns a number such as "10" and it is not really a date comparation but more of a numbers comparation.
What is the correct syntax?
Thanks!
Joel
Quick question: At this website here http://www.vischeck.com/examples/ there are a few pictures of numbers hidden within another color to test for color blindness. Is there any way that these images can be generated algorithmically?
Well i'm totaly lost here, i am using jquery ui sliderwidget to make this quite simple menu but i just can't figure out a basic formula to make menu items slide along with with scroll bar.
Here is jsfiddle: http://jsfiddle.net/n2H6Q/4/
Please keep in mind that content height can change to any value that's why i have use random height, and container height can as well change to any value, that's why it is so difficult for me to figure out how to deal with all these numbers...
Any kind of help would be very much appreciated.
What NEW features has WCF in .NET Framework 4 vs .NET Framework 3.5? What Is new, what was fixed (in general - I do not want to get into bug fixed numbers=)?
I have the need to perform algorithms on various primitive types; the algorithm is essentially the same with the exception of which type the variables are. So for instance,
/**
* Determine if <code>value</code> is the bitwise OR of elements of <code>validValues</code> array.
* For instance, our valid choices are 0001, 0010, and 1000.
* We are given a value of 1001. This is valid because it can be made from
* ORing together 0001 and 1000.
* On the other hand, if we are given a value of 1111, this is invalid because
* you cannot turn on the second bit from left by ORing together those 3
* valid values.
*/
public static boolean isValid(long value, long[] validValues) {
for (long validOption : validValues) {
value &= ~validOption;
}
return value != 0;
}
public static boolean isValid(int value, int[] validValues) {
for (int validOption : validValues) {
value &= ~validOption;
}
return value != 0;
}
How can I avoid this repetition? I know there's no way to genericize primitive arrays, so my hands seem tied. I have instances of primitive arrays and not boxed arrays of say Number objects, so I do not want to go that route either.
I know there are a lot of questions about primitives with respect to arrays, autoboxing, etc., but I haven't seen it formulated in quite this way, and I haven't seen a decisive answer on how to interact with these arrays.
I suppose I could do something like:
public static<E extends Number> boolean isValid(E value, List<E> numbers) {
long theValue = value.longValue();
for (Number validOption : numbers) {
theValue &= ~validOption.longValue();
}
return theValue != 0;
}
and then
public static boolean isValid(long value, long[] validValues) {
return isValid(value, Arrays.asList(ArrayUtils.toObject(validValues)));
}
public static boolean isValid(int value, int[] validValues) {
return isValid(value, Arrays.asList(ArrayUtils.toObject(validValues)));
}
Is that really much better though? Any thoughts in this matter would be appreciated.
The Keychain seems to be used a lot for usernames and passwords, but is it a good idea to use it for other sensitive stuff (bank details, ID numbers etc), but with no password? What kind of encryption does the keychain use? The scenario I'm concerned about is a thief acquiring an iPhone (which is screen-locked) and being able to access the file system to get this info.
Also, would using the Keychain involve export restrictions due to the use of encryption?
Almost all is dialed in except then I click the pause/play button, the current activeSlide div doesn't fade in on rollover like the other slides do. Bit at a loss to figure out why it's not allowing hover even though it works when the cycle is not manually paused (i.e. when just rolling over the pager numbers).
Thanks for any guidance!
http://www.xtracycle.com/home-test-a-rooney
Hey im new to python. How do you get a portion of a list by the relative value of its sorting key.
example...
list = [11,12,13,14,15,16,1,2,3,4,5,6,7,8,9,10]
list.sort()
newList = list.split("all numbers that are over 13")
assert newList == [14,15,16]
The question posed came about during a 2nd Year Comp Science lecture while discussing the impossibility of generating numbers in a deterministic computational device.
This was the only suggestion which didn't depend on non-commodity-class hardware.
Subsequently nobody would put their reputation on the line to argue definitively for or against it.
Anyone care to make a stand for or against. If so, how about a mention as to a possible implementation?
I have a long string in javascript like
var string = 'abc234832748374asdf7943278934haskhjdasfhjkdfas83421def8923487234897234897';
I am trying to match like
abc234832748374 and def8923487234897 - that is - I have tried like
string.match(\abc[^abc]|\def[^def]|) but that doesnt get me both strings because I need numbers after them ?
Basically I need abc + 8 chars after and def the 8-11 chars after ? How can I do this ?
what is the best OCR package you've used with java?
I need to parse mainly numbers in a single font and am looking for a well architected, lite weight library to use.
thanks.
Can someone please write to me source code in Java? I have a task: create a program, that contains two dimensional array (with numbers) and the programm needs to sum zeros in each column and then get out the number of column in which the zeros are least.. thanks!
In a Clojure program, I have a sequence of numbers:
(2 3 4 6 8 1)
I want to find the longest sub-sequence where the items are sequential:
(2 3 4)
I am assuming that it will involve (take-while ...) or (reduce ...).
Any ideas?
how would i search through a list with ~5 mil 128bit (or 256, depending on how you look at it) strings quickly and find the duplicates (in python)? i can turn the strings into numbers, but i don't think that's going to help much. since i haven't learned much information theory, is there anything about this in information theory?
and since these are hashes already, there's no point in hashing them again
Is there a technical limitation of what kind of programs I can write with assembler (NASM)?
For now I've only seem some program that do arithmetic operations, like adding two numbers.
Is it possible to write complex assembler programs, that provide a GUI, access the file system, plays sounds et cetera?
I know I wouldn't write such programs, but I'm curious, if there are technical limitations on what kind of programs I can write with assembler.
I am trying to create an access 2007 database that allows staff that already have ID numbers to make a transaction and also other guest users who do not have ID number make a transaction. What is the best way todo this in access? A transaction involves taking an item out of inventory. Therefore if one a user (staff or external) has an item out of inventory then no other users can get a hold of that item. Thanks, Any Ideas would be most appreciated!
the most darndest thing! the following code prints out 'llo' instead of the expected 'wo'. i get such surprising results for a few other numbers. what am i missing here?
alert('helloworld'.substring(5, 2));
Input : {5, 13, 6, 5, 13, 7, 8, 6, 5}
Output : {5, 5, 5, 13, 13, 6, 6, 7, 8}
The question is to arrange the numbers in the array in decreasing order of their frequency, preserving the order of their occurrence.
If there is a tie, like in this example between 13 and 6, then the number occurring first in the input array would come first in the output array.
say ive got a matrix that looks like:
[[0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]]
how can i make it on seperate lines:
[[0, 0, 0, 0, 0],
[0, 0, 0, 0, 0],
[0, 0, 0, 0, 0]]
and then remove commas etc:
0 0 0 0 0
And also to make it blank instead of 0's, so that numbers can be put in later, so in the end it will be like:
_ 1 2 _ 1 _ 1
(spaces not underscores)
thanks
I installed Eclipse and then the Ruby Development Tools (RDT), but it would crash when I try to alter certain features, like having line numbers, how far back to have history, and the code coloring scheme didn't work fully. I decided to try to uninstall Eclipse by doing sudo aptitude remove eclipse and then sudo aptitude install eclipse but instead it installed it back with the broken Ruby plugin. I also tried aptitude purge but that didn't help either.
How can I freshly reinstall eclipse and get a properly working Ruby plugin?
How to I run multiple threads in VB.NET?
Say I need 2 threads - one that prints 100 numbers in a loop and the second one that asks for the user's name and prints it inside a message box.
I have some strings that need a-strippin':
ÜT: 9.996636,76.294363
Tons of long strings of location codes. A literal regex in PHP won't match them, IE
$pattern = /ÜT:/;
echo preg_replace($pattern, "", $row['location']);
Won't match/strip anything. (To know it's working, /T:/ does strip the last bit of that string). What's the encoding error doing on here?
Alternately, I would accept a concise way to take out just the numbers.