Search Results

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

Page 303/626 | < Previous Page | 299 300 301 302 303 304 305 306 307 308 309 310  | Next Page >

• MySQL: Which is faster — INSTR or LIKE?

  - by Grekker

  If your goal is to test if a string exists in a MySQL column (of type 'varchar', 'text', 'blob', etc) which of the following is faster / more efficient / better to use, and why? Or, is there some other method that tops either of these? INSTR( columnname, 'mystring' ) > 0 vs columnname LIKE '%mystring%'

  Read the article

• What is the most elegant way to find index of duplicate items in C# List

  - by user326559

  I've got a List that contains duplicates and I need to find the indexes of each. What is the most elegant, efficient way other than looping through all the items. I'm on .NET 4.0 so LINQ is an option. I've done tons of searching and connect find anything. Sample data: var data = new List{"fname", "lname", "home", "home", "company"}(); I need to get the indexes of "home".

  Read the article

• java background task

  - by markovuksanovic

  I was wondering which would be the most efficient approach to implement some kind of background task in java (I guess that would be some kind of nonblocking Threads). To be more precise - I have some java code and then at some point I need to execute a long running operation. What I would like to do is to execute that operation in the background so that the rest of the program can continue executing and when that task is completed just update some specific object which. This change would be then detected by other components.

  Read the article

• Why would I use VARCHAR over TEXT in MySQL?

  - by Tower

  Hi, I noticed that in MySQL, both VARCHAR and TEXT offer variable-sized data. Well, VARCHAR is a bit more efficient in data storage, but still, TEXT MEDIUMTEXT and LONGTEXT offer a lot more potential. So, what are the real uses of VARCHAR?

  Read the article

• POSIX: allocate 64KB on 64KB boundary.

  - by Eloff

  I would really like to actually only allocate 64KB of memory, not 128KB and then do the alignment manually - far too wasteful. VirtualAlloc on windows gives precisely this behavior. Supposedly there's code in SquirrelFish for doing this on just about every platform, but I haven't managed to locate it. Is there a space efficient way to allocate 64KB on a 64KB boundary in POSIX? Failing that, in Linux?

  Read the article

• Converting XDocument to XmlDocument and vice versa.

  - by Workshop Alex

  It's a very simple problem that I have. I use XDocument to generate an XML file. I then want to return it as a XmlDocument class. And I have an XmlDocument variable which I need to convert back to XDocument to append more nodes. So, what is the most efficient method to convert XML between XDocument and XmlDocument? (Without using any temporary storage in a file.)

  Read the article

• Allow repeater to be arranged using drag-drop

  - by o-logn

  Hey all, I have a repeater that's bound to a SQL Data Source (using ASP.NET). Are there any JQuery plugins/efficient way of converting my repeater into something that can be sorted via drag and drop? i.e. users can rearrange the order of the data, which updates the database? Thanks

  Read the article

• Find First Specific Byte in a Byte[] Array c#

  - by divinci

  Hi there, I have a byte array and wish to find the first occurance (if any) of a specific byte. Can you guys help me with a nice, elegant and efficient way to do it? /// Summary /// Finds the first occurance of a specific byte in a byte array. /// If not found, returns -1. public int GetFirstOccurance(byte byteToFind, byte[] byteArray) { }

  Read the article

• Optimal xml storage engine

  - by nixau

  I'm considering optimal open source solution for storing xml documents with further querying on them effectively. Amount of data will be small. As far as I understand native xml databases might form a proper solution for my case. They obviously store xml documents in highly efficient way. It would be great to learn your experience. Any suggestions on proper solution? Have you got any experience employing xml storage engines in your apps?

  Read the article

• Is it possible to use 'else' in a python list comprehension?

  - by Josh

  Here is the code I was trying to turn into a list comprehension: table = '' for index in xrange(256): if index in ords_to_keep: table += chr(index) else: table += replace_with Is there a way to add the else statement to this comprehension? table = ''.join(chr(index) for index in xrange(15) if index in ords_to_keep) Also, would I be right in concluding that a list comprehension is the most efficient way to do this?

  Read the article

• How can I hide empty html table cells with jQuery?

  - by Tommy

  What I have to work with: An html table 5X7. On many queries, there are less that 35 items filling the complete table. How can I "hide" the empty cells dynamically in this case, using jQuery (or any other efficient way)? Thank you.

  Read the article

• Rails acts_as_taggable_on grouped alphabetically?

  - by Ray Dookie

  Having sorted the tag_counts hash via the following code: sorted_tags = Contact.tag_counts.sort{ |x,y| x.name.downcase <= y.name.downcase } what is the easiest/most efficient way to display the tags in my view grouped by letters? i.e A - "Alpha", "Apple", "Aza" B - "Beta", "Bonkers" . . . Z - "Zeta", "Zimmer" Any ideas?

  Read the article

• Substitute for Iterator that is Serialization

  - by Mahmoud

  I'm working on a GWT project, and I have a bunch of Java classes that use Java Object Iterators on the server side. As I was reading through the internet...Iterators seem to not be serializable preventing me from sending them over to the client side from the server side. My question is is there an efficient way to serialize the iterator or use a substitute that might be serializable ? Many thanks!

  Read the article

• I want to store Javascript array as a Cookie

  - by Oguz

  Is it possible , I have a some sort of list and I want to store it on browser , If it is not possible , what is the efficient way of doing this ?

  Read the article

• How rigid is the max size of a VARCHAR in SQL Server?

  - by thinknow

  i.e. if I create a VARCHAR(50) field, what happens if I try to assign it a value that's 100 characters long? Will SQL Server let me do this? Is it somehow less efficient?

  Read the article

• coco2d tab view for multi player

  - by godzilla

  I am currently developing a card game for the iphone using cocas2d. I am currently in need of a tab view with each tab representing a player and his / her set of cards. Currently i have a single view representing just one player. It seems as though cocas2s is not really built do have multiple views, to do this and it would require some serious amount of hacking around with the code. What would be the most efficient way to accomplish this?

  Read the article

• String Parsing in C#

  - by Betamoo

  What is the most efficient way to parse a C# string in the form of "(params (abc 1.3)(sdc 2.0)....)" into a struct in the form struct Params { double abc,sdc....; } Thanks EDIT The structure always have the same parameters (number and names).. but the order is not granted..

  Read the article

• Oracle : Identifying duplicates in a table without index

  - by user288031

  When I try to create a unique index on a large table, I get a unique contraint error. The unique index in this case is a composite key of 4 columns. Is there an efficient way to identify the duplicates other than : select col1, col2, col3, col4, count() from Table1 group by col1, col2, col3, col4 having count() 1 The explain plan above shows full table scan with extremely high cost, and just want to find if there is another way. Thanks !

  Read the article

• How to generate all strings with d-mismatches, python

  - by mr.M

  I have a following string - "AACCGGTTT" (alphabet is ["A","G","C","T"]). I would like to generate all strings that differ from the original in any two positions i.e. GAGCGGTTT ^ ^ TATCGGTTT ^ ^ How can I do it in Python? I have only brute force solution (it is working): generate all strings on a given alphabet with the same length append strings that have 2 mismatches with a given string However, could you suggest more efficient way to do so?

  Read the article

• How to capture each frame of a USB webcam using VB.net?

  - by Kevin Boyd

  While I have got some leads from an older SO post and from this site, I haven't been able to figure out how to capture each frame of a web-cam. What I would like to do is something like this capture a frame then do some image processing on it and display the output and then move on to the next frame. Can I can access to web-cam frame events or is there any efficient way to achieve this?

  Read the article

• Comparing Two Arrays Using Perl

  - by Buzkie

  I have two arrays. I need to check and see if the elements of one appear in the other one. Is there a more efficient way to do it than nested loops? I have a few thousand elements in each and need to run the program frequently. -Alex

  Read the article

• Is there a bruteforce-proof hashing algorithm?

  - by Col. Shrapnel

  Well, from the discussion of hashing methods weaknesses, I've got that the only ol' good brute-force is efficient to break. So, the question is: Is there a hashing algorithm which is more steady against brute-force than others?

  Read the article

• Detect winning game in nought and crosses

  - by Dennis

  I need to know the best way to detect a winning move in a game of noughts and crosses. Source code doesn't matter, I just need a example or something I can start with. The only thing I can come up with is to use loops and test every direction for every move a player makes, to search for e.g five in a row. Is there a faster and more efficient way?

  Read the article

• Ruby on Rails: Converting "SomeWordHere" to "some word here"

  - by sjsc

  I know you can do something like: "SomeWordHere".underscore.gsub("_", " ") to get "some word here". I thought that might be a little too much for something so simple. Is there a more efficient way (maybe a built-in method?) to convert "SomeWordHere" to "some word here"?

  Read the article

• Rails 2.3: How to create this SQL 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

< Previous Page | 299 300 301 302 303 304 305 306 307 308 309 310  | Next Page >