Search Results

Search found 15637 results on 626 pages for 'memory efficient'.

Page 308/626 | < Previous Page | 304 305 306 307 308 309 310 311 312 313 314 315  | Next Page >

• SQL: ... WHERE X IN (SELECT Y FROM ...) ...

  - by Craig Johnston

  Is the following the most efficient in SQL to achieve its result: SELECT * FROM Customers WHERE Customer_ID NOT IN (SELECT Cust_ID FROM SUBSCRIBERS) Could some use of joins be better and achieve the same result?

  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

• Serializing and deserializing data - JavaScript

  - by RadiantHex

  Hi folks, I need to perform a lot of serializing and de-serializing in an application. The data is POST parameters and Cookie headers. Does anyone have any fast libraries to suggest or efficient ways to perform these operations?

  Read the article

• Book recommendation for project architecture?

  - by Mark

  I already have a solid knowledge of Object-oriented PHP as well as HTML/Javascript/MySQL plus a basis in Java. Now I would like to implement my projects in an efficient way, whether it is a web project in PHP or an Android application. My problem is once my code gets bigger I start messing error handling, with form validation etc, and I guess its because of my poor basis in software architecture. Thanks.

  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

• How to optimize foreach loop in PHP

  - by vanneto

  First off, I know the title is generic and not fitting. I just couldn't think of a title that could describe my problem. I have a table Recipients in MySQL structured like this: id | email | status 1 foo@bar S 2 bar@baz S 3 abc@def R 4 sta@cko B I need to convert the data into the following XML, depending on the status field. For example: <Recipients> <RecipientsSent> <!-- Have the 'S' status --> <recipient>foo@bar</recipient> <recipient>bar@baz</recipient> </RecipientsSent> <RecipientsRegexError> <recipient>abc@def</recipient> </RecipientsRegexError> <RecipientsBlocked> <recipient>sta@cko</recipient> </RecipientsBlocked> </Recipients> I have this PHP code to implement this ($recipients contains an associative array of the db table): <Recipients> <RecipientsSent> <?php foreach ($recipients as $recipient): if ($recipient['status'] == 'S'): echo "<recipient>" . $recipient['email'] . "</recipient>"; endif; endforeach; ?> </RecipientsSent> <RecipientsRegexError> <?php foreach ($recipients as $recipient): if ($recipient['status'] == 'R'): echo "<recipient>" . $recipient['email'] . "</recipient>"; endif; endforeach; ?> </RecipientsRegexError> <?php /** same loop for the B status */ ?> </Recipients> So, this means that if I have 1000 entries in the table and 4 different status' that can be checked, it means that there will be 4 loops, each one executing 1000 times. How can this be done in a more efficient manner? I thought about fetching four different sets from the database, meaning 4 different queries, would that be more efficient? I'm thinking it could be done with one loop but but I can't come up with a solution. Any way this could be done with only one loop?

  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

• Should I be using the for-loop construct or the forEach method for iteration?

  - by Dutch

  Is one way more efficient? Are there any limitations in one method versus the other? Thanks for any input you guys can give me ;-)

  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

• Printing Variable names and contents as debugging tool; looking for emacs/Python shortcut

  - by Schof

  I find myself adding debugging "print" statements quite often -- stuff like this: print("a_variable_name: %s" % a_variable_name) How do you all do that? Am I being neurotic in trying to find a way to optimize this? I may be working on a function and put in a half-dozen or so of those lines, figure out why it's not working, and then cut them out again. Have you developed an efficient way of doing that? I'm coding Python in Emacs.

  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

• 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

• Javascript for loop efficiency

  - by Misha Moroshko

  Is for (var i=0, cols=columns.length; i<cols; i++) { ... } more efficient than for (var i=0; i<columns.length; i++) { ... } ? In the second variant, is columns.length calculated each time the condition i<columns.length is checked ?

  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

• 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

• 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

• Enterprise Library Review?

  Hi, Is enterprise library for exception handling and logging efficient in terms of its memory usage for the functionality provided? What are the pros and cons? Thanks

  Read the article

• NHibernate and reporting

  - by Paul Knopf

  I am building a website on top of nhibernate. Is there any efficient way to build reports? BY reports, I mean is there anyway to execute a complicated query that grabs random pieces of data? StoreProcedures? Hql? Can I get single, non mapped values from hql?

  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

• 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

• jQuery - Why is "live" inefficient? And how can we measure that?

  - by ming yeow

  why do programmers say that "live" is inefficient? So what are the alternative methods to replicating that function that are more efficient? How do we measure the impact of how much it slows things down?

  Read the article

• Oracle: How to update master with newest row from detail table?

  - by LukLed

  We have two tables: Vehicle: Id, RegistrationNumber, LastAllocationUserName, LastAllocationDate, LastAllocationId Allocations: Id, VehicleId, UserName, Date What is the most efficient (easiest) way to update every row in Vehicle table with newest allocation? In SQL Server I would use UPDATE FROM and join every Vehicle with newest Allocation. Oracle doesn't have UPDATE FROM. How do you do it in Oracle?

  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 figure out which lines of css is not actually affecting anything again?

  - by Shore

  I changed the html multiple times,but without deleting the related css specification. And now there are quite some useless css there. Is there an efficient solution to grep all them?

  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

< Previous Page | 304 305 306 307 308 309 310 311 312 313 314 315  | Next Page >