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 >

• 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

• 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

• 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

• Generate sample XML from composite hierarchical structure

  - by Jevgenij Nekrasov

  Let's say I have composite hierarchical structure. Each object in the structure has child collection of the same objects. Each object has XPath property, which stores the exact xpath to the element inside XML file. Right now I am trying to create an extension, which can generate XML string from that hierarchical structure, but first I want to make some sort of research what is the most efficient way to do that? ant what is the easiest way?

  Read the article

• Excluding a directory from SVN initial import in NetBeans

  - by xain

  Hi, I'm importing a project into a svn repository using netbeans 6.8, and there's a whole subtree I don't want to import. Is there an efficient way to exclude it or will I just have to go file by file telling it to skip them ? Thanks

  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

• 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

• effective functonal sort

  - by sreservoir

  I'm programming a function for a ti-nspire, so I can't use the builtins from inside a function. what is the most generally efficient algorithm for sorting a list of numbers without modifying the list itself? (recursion and list-splitting are fair game, as is general use of math.)

  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

• 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

• 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

• 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

• 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

• 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

• Fibonnaci Sequence fast implementation

  - by user2947615

  I have written this function in Scala to calculate the fibonacci number given a particular index n: def fibonacci(n: Long): Long = { if(n <= 1) n else fibonacci(n - 1) + fibonacci(n - 2) } However it is not efficient when calculating with large indexes. Therefore I need to implement a function using a tuple and this function should return two consecutive values as the result. Can somebody give me any hints about this? I have never used Scala before. Thanks!

  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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

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