So I've given RequireJS a try this weekend, and although it appears to work pretty smooth, I can't figure out one thing: How do I combine PHP and Javascript while using RequireJS? See, RequireJS can only work with .js files, meaning that it cannot "require" .php files. In many files, however, I use PHP to retrieve database data which is then used by Javascript. It feels pretty inefficient to me to take apart these processes and let my Javascript execute an AJAX request to retrieve the settings I can normally set with PHP directly. Is there anyone with experience with … |
0
11 | ||

Seems this wouldnt be too hard, but I'm scratiching my head bald... I have multiple workbooks. They are all housed in the same folder. WBa, WBb, WBc. I need to combine these, (or at least a Worksheet from each) and have them tally a certain column, which seems easy enough, however, people are constantly adding to this folder, so either a manual daily, or dynamic tally would be ideal. Is there an easier way to do this in Excel? Is there a quick VB script for this? Thanks! |
0
11 | ||

Hi there, I have an array of unsigned chars that hold hex values, I’m interested in values [5] and [6] of the array. Say [5] = 0x5b = 0101 1011 and [6] = 0x7b = 0111 1011 I'm trying to get all of [5] and the first half of [6], so 1011011 1111. So far I’ve come up with this; short int holder = 0; memcpy(holder,&char_array[5], 2 ); short int alt = holder >> 4; return 0; I've tried creating a 14 bit data type to hold the bits, copying the 2 bytes in then shifting right 4 but this … |
0
3 | ||

Combining queue and stack link list? hello so here is my question i ave to connect a link lists together, one who behaves like a stack the other like a queue.the numbers used are 11 22 44 77 33 99 66. so the stack link list looks like this 66 99 33 77 44 22 11 queue link list looks like this 11 22 44 77 33 99 66 what i need to do is combine both, connect the stack to the queue to make a new link list with 14 numbers. new link list should look like this 66 … |
0
9 | ||

how you would compute/denote the time complexity of two loops based on different variables? I understand how to compute the time complexity for a simple loop PseduoCode while X<N { while Y<M { Z++ } X++ } one loop occurs N times - time complexity O(N) the other loop occurs M - time complexity 0(M) M- happens to be a unknown function of N would the time complexity O(MN)? but In big O notation you are to drop all excess variables in which case time complexity would be O(N)? or neither? please help |
0
6 |

The End.