Search Results

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

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

• Creating Auto Incrementing column in Google Appengine

  - by demos

  What is the easiest and most efficient way to create an auto-increment counter for every data row in google appengine? basically I want to give every row a unique row_number so that I can overcome the issue of only being able to get the first 1000 results in a select query. I can thus add a counter lies between condition and mine all the entires in the table.

  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

• 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

• 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

• 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

• 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

• 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

• Parse CSS out from <style> elements

  - by awj

  Can someone tell me an efficient method of retrieving the CSS between tags on a page of markup in .NET? I've come up with a method which uses recursion, Split() and CompareTo() but is really long-winded, and I feel sure that there must be a far shorter (and more clever) method of doing the same. Please keep in mind that it is possible to have more than one element on a page, and that the element can be either or .

  Read the article

• T-SQL 2005 - Divide by zero error encountered

  - by Grant

  Hi, I am trying to get some percentage data from a stored procedure using code similar to the line below. Obviously this is going to cause a (Divide by zero error encountered) problem when base.[XXX_DataSetB] returns 0 which may happen some of the time. Does anyone know how i can deal with this in the most efficient manner? Note: There would be about 20+ lines looking like the one below... cast((base.[XXX_DataSetB] - base.[XXX_DataSetA]) as decimal) / base.[XXX_DataSetB] as [XXX_Percentage]

  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

• 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

• .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

• I want to create multiple thumbnails using GD library in php, which is better creating on the fly or

  - by Reda.Web

  Dear all, I want to create multiple thumbnails using GD library in php, and I already have a script to do this, the question is what is better for me .. is it better to create thumbnail on the fly? or create a physical file on my server each time I want a thumb?? and Why? Please, consider time consuming and storage capacity and other disadvantages for both

  Read the article

• Finding whether a point lies inside a rectangle or not

  - by avd

  The rectangle can be oriented in any way...need not be axis aligned. Now I want to find whether a point lies inside the rectangle or not. One method I could think of was to rotate the rectangle and point coordinates to make the rectangle axis aligned and then by simply testing the coordinates of point whether they lies within that of rectangle's or not. The above method requires rotation and hence floating point operations. Is there any other efficient way to do this??

  Read the article

• How to copy a ram_base file to disk efficiently

  - by Hui Jin

  I want to copy a large a ram-based file (located at /dev/shm direcotry) to local disk, is there some way for an efficient copy instead of read char one by one or create another piece memory? I can use only C language here. Is there anyway that I can put the memory file directly to disk? Thanks!

  Read the article

• SQL is this equivalent to a LEFT JoIn?

  - by Jim

  Is this equivalent to a LEFT JOIN? SELECT DISTINCT a.name, b.name FROM tableA a, (SELECT DISTINCT name FROM tableB) as b It seems as though there is no link between the two tables. Is there an easier / more efficient way to write this?

  Read the article

• What should main() return in C/C++?

  - by Joel

  What way is the most efficient and why? int main()? void main()? return 1? return 0?

  Read the article

• Get the Integer from the end of a string (variable length)

  - by black666

  I have a string of a variable length and at the end of the string are some digits. What would be the best / efficient way, to parse the string and get the number from the end as an Integer? The String and the digits at the end can can be of any length. For example: abcd123 -- 123 abc12345 -- 12345 ab4cd1 -- 1

  Read the article

• How to use paperclip to upload file to web hosting via ftp

  - by neokain

  from title, I create Rails application and use Paperclip to manage file upload but I don't want to store file in local machine, I want to store file in other machine via ftp. Paperclip provide to store file in S3 storage, I want to make paperclip can do like S3 but via ftp. Help me please.

  Read the article

• How can I find the boundaries of a subset of a sorted list?

  - by Alex

  I have the following dilemma: I have a list of strings, and I want to find the set of string which start with a certain prefix. The list is sorted, so the naive solution is this: Perform binary search on the prefixes of the set, and when you find an element that starts with the prefix, traverse up linearly until you hit the top of the subset. This runs in linear time, however, and I was wondering if anyone can suggest a more efficient way to do it.

  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

• What is wrong with my logic in a rails hash?

  - by stevenheidel

  I have a setting in environment/production.rb of HEROKU = true This should change my has_attachment has to use s3 instead of the file system, but it doesn't. What's wrong with my logic? has_attachment :content_type => :image, :storage => ($HEROKU ? :s3 : :file_system), ... Thanks!

  Read the article

• Monitoring for postbacks with PHP?

  - by Rebecca

  Hi, I have a PHP page with content that my users can view. When this page receives a POST request from a certain external URL, I'd like to redirect the user to another page. The problems I'm' having are: How can I monitor the page for requests being sent in an efficient way? How can I actually redirect them since header() doesn't work. Thanks.

  Read the article

• Iphone Dev: Using one big image (sprite) for all uitableview cells

  - by Peter Pajchl

  I have a table view with a list of categories and each category (understand table cell) has a different icon. I would like to use one big image (sprite) and render different part of the image (single icon) for each row. Any efficient ideas...

  Read the article

• Counting number of values between interval

  - by calccrypto

  Is there any efficient way in python to count the times an array of numbers is between certain intervals? the number of intervals i will be using may get quite large like: mylist = [4,4,1,18,2,15,6,14,2,16,2,17,12,3,12,4,15,5,17] some function(mylist, startpoints): # startpoints = [0,10,20] count values in range [0,9] count values in range [10-19] output = [9,10]

  Read the article

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