Search Results

Search found 9017 results on 361 pages for 'efficient storage'.

Page 189/361 | < Previous Page | 185 186 187 188 189 190 191 192 193 194 195 196  | Next Page >

• Rails 2.3: How to turn this SQL statement into a named_scope

  - by randombits

  Having a bit of difficulty figuring out how to create a named_scope from this SQL query: select * from foo where id NOT IN (select foo_id from bar) AND foo.category = ? ORDER BY RAND() LIMIT 1; Category should be variable to change. What's the most efficient way the named_scope can be written for the problem above?

  Read the article

• javascript: browser size (width and height)

  - by dono

  I'm trying to detect the browser's current size (width and height). I know it's super easy in jquery with $(document).width and $document.height, but I don't want to add the size of the jquery lib to the project, so I'd rather just use built in javascript. What would be the short and efficient way to do the same thing with javascript?

  Read the article

• Help me understand why page sizes are a power of 2?

  - by eric

  Answer I need help with is: Recall that paging is implemented by breaking up an address into a page and offset number. It is most efficient to break the address into X page bits and Y offset bits, rather than perform arithmetic on the address to calculate the page number and offset. Because each bit position represents a power of 2, splitting an address between bits results in a page size that is a power of 2. i don't quite understand this answer, can anyone give a simpler explanation?

  Read the article

• How would you calculate all possible permutations of 0 through N iteratively?

  - by Bob Aman

  I need to calculate permutations iteratively. The method signature looks like: int[][] permute(int n) For n = 3 for example, the return value would be: [[0,1,2], [0,2,1], [1,0,2], [1,2,0], [2,0,1], [2,1,0]] How would you go about doing this iteratively in the most efficient way possible? I can do this recursively, but I'm interested in seeing lots of alternate ways to doing it iteratively.

  Read the article

• How to move a Mercurial repository created on a local PC to a web server?

  - by Tim Murphy

  I have created and committed to Mercurial repository that was created on my local drive. I now have a remote Windows 2003 web server setup to serve repositories via hgwebdir.cgi. How do I move the locally created repository to the web server? It looks like an ftp of the .hg folder on the local drive to the remote web server does the trick. Am I doing it the right way. Is there a more efficient way?

  Read the article

• SEO Friendly URLs where the phrase used may change in Rails

  - by Newy

  Say I have http://www.mysite.com/I-Like-Cheeseburgers and I want that to point to Item with id 3. Sometime later, I change the name of the item, and now its http://www.mysite.com/I-Like-Hamburgers (and perhaps many more times). I want all these URLs to remain pointing to Item 3. Is it efficient to simply keep a table of [strings,item_ids] and do a lookup on this? Is there a better way?

  Read the article

• lightweight search engine for asp.net

  - by Michael

  I'm looking to develop a CMS project based on UMBRACO but I also need to index the documents created and to offer search functionality therefore I would like to know if you have any suggestion for a lightweight search engine available in .net technology. The main requirement is to be simple and efficient (nothing complex like solr or sphinx ).

  Read the article

• oracle index for string column - does format of data affects quality of index?

  - by Jayan

  We have following type of "Unique ID" column for many tables in the database (Oracle). It is a string with following format <randomnumber>-<ascendingnumber>-<machinename> So we have some thing like this U1234-12345-NBBJD U1234-12346-NBBJD U1234-12347-NBBJD U1234-12348-NBBJD U1234-12349-NBBJD The UID value is unique, we have unique index on them. Does the following format is more efficient than above for index scans? NBBJD-U1234-12345 NBBJD-U1234-12346 NBBJD-U1234-12347 NBBJD-U1234-12348 NBBJD-U1234-12349

  Read the article

• How can I have smaller db file sizes with MongoDB?

  - by Jonathan

  I am using MongoDB for storage but the initial db size is around 50MB (even with --smallfiles given to the server at startup). How can I start off with a much smaller db size (1MB max)?

  Read the article

• Group by with ActiveRecord in Rails

  - by Adnan

  Hello, I have a the following table with rows: ================================================================ id | name | group1 | group2 | group3 | group4 | ================================================================ 1 | Bob | 1 | 0 | 0 | 1| ================================================================ 2 | Eric| 0 | 1 | 0 | 1| ================================================================ 3 | Muris | 1 | 0 | 1 | 1| ================================================================ 4 | Angela | 0 | 0 | 0 | 1| ================================================================ What would be the most efficient way to get the list with ActiveRecords ordered by groups and show their count like this: group1 (2) group2 (1) group3 (1) group4 (4) All help is appreciated.

  Read the article

• persistant message queues

  - by Will

  I have several services on different machines and a message-passing system suits my problem. Reliability - sent messages always delivered, even if one end goes down - is the key concern, although it should also be fast and reasonably bandwidth-efficient. So which message queue should I use?

  Read the article

• Find all possible starting positions of a regular expression match in perl, including overlapping matches?

  - by jonderry

  Is there a way to find all possible start positions for a regex match in perl? For example, if your regex was "aa" and the text was "aaaa", it would return 0, 1, and 2, instead of, say 0 and 2. Obviously, you could just do something like return the first match, and then delete all characters up to and including that starting character, and perform another search, but I'm hoping for something more efficient.

  Read the article

• Compare string with all values in array

  - by Hallik

  I am trying to fumble through python, and learn the best way to do things. I have a string where I am doing a compare with another string to see if there is a match: if paid[j].find(d)>=0: #BLAH BLAH If 'd' were an array, what is the most efficient way to see if the string contained in paid[j] has a match to any value in 'd'?

  Read the article

• Given an array of arrays, how can I replace all empty values with 0?

  - by stormist

  Example array $myArray[0] = array('23, null, 43, 12'); $myArray[1] = array('null, null, 53, 19'); $myArray[2] = array('12, 13, 14, null'); All nulls should be replaced with 0. I was hoping someone would have an efficient way of doing this, perhaps a built in PHP function that I am unaware of.

  Read the article

• What data type to use for variable length data (for performance)?

  - by jiewmeng

  What data type should I use for data that can be very short, eg. html link (think twitter), or very long eg. html blog post (think wordpress). I am thinking if I use varchar(4000), it maybe too short for a html formated blog entry? but if I use text, it will take up more space and is less efficient?

  Read the article

• multi threading python/ruby vs java?

  - by fayer

  i wonder if the multi threading in python/ruby is equivalent to the one in java? by that i mean, is it as efficient? cause if you want to create a chat application that use comet technology i know that you have to use multi threading. does this mean that i can use python or ruby for that or is it better with java? thanks

  Read the article

• What algorithm can I use to determine points within a semi-circle?

  - by dmessf

  How can I do this on a grid with several "centers", and therefore, having coincident points that I want to count only once? What is the most efficient way to do this?

  Read the article

• Look up values in a BDB for several files in parallel

  - by biznez

  What is the most efficient way to look up values in a BDB for several files in parallel? If I had a Perl script which did this for one file at a time, would forking/running the process in background with the ampersand in Linux work? How might Hadoop be used to solve this problem? Would threading be another solution?

  Read the article

• length between 2 values

  - by alex

  In R, what is the most efficient way to count the length between 2 values. for example, i have vector x , which are all randomly choose from 1 to 100, how can i find out the length between the first"2" and first"40", x=(1,2,3,4,5,6,7,40,1,2,3,21,4,1,23,4,43,23,4,12,3,43,5,36,3,45,12,31,3,4,23,41,23,5,53,45,3,7,6,36) for this vector, the answer should be 5 and 6

  Read the article

• Display List with GLTesselated objects? (OpenGL)

  - by user146780

  Is it possible to create a display list for Tesselated objects? If so would it be more efficient? Thanks

  Read the article

• How can I format strings for use as structure field names in MATLAB?

  - by Elpezmuerto

  I want to remove hyphens (-), slashes (/) and white space () from a string name(i) so that I can use it as a structure field name. This is the ugly way I am currently doing it using the function strrep: cell2mat(strrep(strrep(strrep(name(i), '-',''),'/',''),' ', '')) I have also tried other variations, such as: strrep(name(i),{'-','/'},{'',''}); strrep(name(i),['-','/'],['','']); What is a more efficient way of doing this?

  Read the article

• asp.net mvc getting html programitically in view

  - by mazhar

  What is the best way to get HTML programmatically in the view from the controller. I sometimes use string builder for that to render some html and send it the view from the controller.is it efficient? What do you people suggests?

  Read the article

• How to adjust the distribution of values in a random data stream?

  - by BCS

  Given a infinite stream of random 0's and 1's that is from a biased (e.g. 1's are more common than 0's by a know factor) but otherwise ideal random number generator, I want to convert it into a (shorter) infinite stream that is just as ideal but also unbiased. Looking up the definition of entropy finds this graph showing how many bits of output I should, in theory, be able to get from each bit of input. The question: Is there any practical way to actually implement a converter that is nearly ideally efficient?

  Read the article

• .Net Application Cache in Cloud Environment

  - by Viracocha

  I'm using the Enterprise Application Block and my application is hosted in a Cloud Environment. I was wondering what else I need to do with my implementation to make it as efficient as possible.

  Read the article

• WebView load css on the fly

  - by ADAM

  I have the following code which loads and html file into a webview - (void)awakeFromNib{ NSString *resourcesPath = [[NSBundle mainBundle] resourcePath]; NSString *htmlPath = [resourcesPath stringByAppendingString:@"/main.html"]; [[self mainFrame] loadRequest:[NSURLRequest requestWithURL:[NSURL fileURLWithPath:htmlPath]]]; } How would i dynamically load a css file (in the most efficient manner) as it does not suit to have the css file link in the html file

  Read the article

< Previous Page | 185 186 187 188 189 190 191 192 193 194 195 196  | Next Page >