What I will say in this answer is not specific to Kohana, and can probably apply to lots of PHP projects. Here are some points that come to my mind when talking about performance, scalability, PHP, … I’ve used many of those ideas while working on several projects — and they helped; so they could … Read more
what will be faster, to call Clear() method or creating a `new List()? This is impossible to answer. It really depends on a lot of factors, including how long the collection has existed. The best option here would be to: Profile the application, and see if this really matters. It likely won’t make any perceptible … Read more
Here’s a nice simple recursive function (Based on zero indexed numbers, meaning 0 == A, 1 == B, etc)… function getNameFromNumber($num) { $numeric = $num % 26; $letter = chr(65 + $numeric); $num2 = intval($num / 26); if ($num2 > 0) { return getNameFromNumber($num2 – 1) . $letter; } else { return $letter; } } … Read more
This is an interesting problem. Taking it by the book, you can start off with this: %PDF-1.0 1 0 obj<</Type/Catalog/Pages 2 0 R>>endobj 2 0 obj<</Type/Pages/Kids[3 0 R]/Count 1>>endobj 3 0 obj<</Type/Page/MediaBox[0 0 3 3]>>endobj xref 0 4 0000000000 65535 f 0000000010 00000 n 0000000053 00000 n 0000000102 00000 n trailer<</Size 4/Root 1 0 R>> … Read more
Do a single allocation of the working/temp array and avoid copying of data during merge (unless moving a single remaining run from one array to the other). Bottom up merge sort example. package jsortbu; import java.util.Random; public class jsortbu { static void MergeSort(int[] a) // entry function { if(a.length < 2) // if size < … Read more
You should just use the full path in URL (started with http:// or at least with /) first of all. Internet Explorer works wrong in a lot of cases with relative urls. Some more small general remarks. You can use ajaxGridOptions: { contentType: ‘application/json; charset=utf-8’ } unstead of using loadBeforeSend. Some other default values (see … Read more
Measure whether it is fast enough for your purposes, “randomness” might diminish the more you call it: os.urandom(250). It produces a binary string aka bytes. To avoid “long int too large to convert to float” error don’t use floats. If you need an integer with k random bits instead of a binary string: import random … Read more
Notes: There can only be one function with a same name. If there are two, the latter will overwrite the former. It’s like the former never existed. A function named onEdit is triggered automatically on (You guessed it!)edit There’s no simple trigger for other names like onEdit1 or onEdit2…. Simple triggers are limited to 30 … Read more
Let’s look at the datasheet: http://atmel.com/dyn/resources/prod_documents/8271S.pdf As far as I can see, the ASR (arithmetic shift right) always shifts by one bit and cannot take the number of bits to shift; it takes one cycle to execute. Therefore, shifting right by n bits will take n cycles. Powers of two behave just the same as … Read more
Think I have cracked it finally with a cumsum trick for a vectorized solution – def create_ranges(a): l = a[:,1] – a[:,0] clens = l.cumsum() ids = np.ones(clens[-1],dtype=int) ids[0] = a[0,0] ids[clens[:-1]] = a[1:,0] – a[:-1,1]+1 out = ids.cumsum() return out Sample runs – In [416]: a = np.array([[4,7],[10,16],[11,18]]) In [417]: create_ranges(a) Out[417]: array([ 4, … Read more