Search Results

Search found 4580 results on 184 pages for 'faster'.

Page 75/184 | < Previous Page | 71 72 73 74 75 76 77 78 79 80 81 82  | Next Page >

• .net compact framework backward compatibility 3.5 and 2.0

  - by mack369

  Do I need to install .net 2.0 on the device, where .net 3.5 is installed? So far my application works on .net 2.0 (which potentially should be faster) but the long term plan is to port it to .net 3.5. I need to order devices and the OEM needs to know which version of .net should be add to Windows CE image (version 5.0). Shall I ask him to add both .net 2.0 and .net 3.5 ?

  Read the article

• What is the display list in Flash 10? Array? Linked list?

  - by Typeoneerror

  I'm working on a game that has many elements on stage, so I'm looking to optimize my loops. I know that Vector is faster than looping an array, but I'm also in some cases using: while (i < numChildren) getChildAt(i) ...to update sprites. My question is when I use getChildAt, is that accessing an Array or Vector or linked list or other? Should I instead store references to my objects in a Vector and loop through that instead?

  Read the article

• SQL INSERT performance omitting field names?

  - by Marco Demaio

  Does anyone knows if removing the field names from an INSERT query results in some performance improvements? I mean is this: INSERT INTO table1 VALUES (value1, value2, ...) faster for DB to be accomplished rather than doing this: INSERT INTO table1 (field1, field2, ...) VALUES (value1, value2, ...) ? I know it might be probably a meaningless performance difference, but just to know.

  Read the article

• Jquery: get ancestors (or descendants) and self

  - by gsakkis

  One can use matchedset.find(selector) / matchedset.parents(selector) to get the descendants/ancestors of the current matched set filtered by a sealector, but that doesn't include the matched set itself (if it happens to match the selector too). Is there a better (more consise and/or faster) way to get it than matchedset.find(selector).add(matchedset.filter(selector)) and the respective for parents() ?

  Read the article

• Does variable name length matter for performance C#?

  - by MadBoy

  I've been wondering if using long descriptive variable names in WinForms C# matters for performance? I'm asking this question since in AutoIt v3 (interpreted language) it was brought up that having variables with short names like aa instead of veryLongVariableName is much much faster (when program is bigger then 5 liner). I'm wondering if it's the same in C#?

  Read the article

• c# Best class to hold a list of values to look up after

  - by ase69s

  I have a list of values that i need to check against a constant list to know wheter they are present or not (one by one). Im using a dictionary buy it doesnt seem logical to have the value two times (key, value)...isnt there any class specialized for this case (and faster if possible)?

  Read the article

• does it makes sense to do SP for simple queries like select * from users

  - by Omu

  is it going to be faster if instead of doing select * from users where id = 1 or delete from users where id = 1 or select count(*) from users I would create a SP for it ?

  Read the article

• When should I use print instead of echo in PHP?

  - by Rob

  I understand that echo is slightly faster, and print can be used as a function, but I've been reading an e-book on PHP, and the writer is using print, instead of echo, to output very simple text. print "Your name is $name\n"; So my question is, when would it be appropriate for me to use print as opposed to echo?

  Read the article

• A 110 kb .NET 4.0 app needs 7 seconds for a cold start, thats not acceptable !

  - by msfanboy

  Hello, I am using the .NET 4.0 client profile for my app and I run a dual core with 4 GB Ram and a fast hard disk. nothing big is done at the start just showing a generic List in a wpf listview. How can I make the cold start faster of my assembly ?

  Read the article

• Resort (reorder) table data

  - by Dave Jarvis

  What is the fastest way to reorder (resort) a table? In MySQL, you can do: CREATE TABLE table2 LIKE table1; INSERT INTO table2 SELECT * FROM table1 ORDER BY by name; DROP TABLE table1; RENAME TABLE table2 TO table1; What about PostgreSQL? Is there a faster way?

  Read the article

• How to convert a Java Long to byte[] for Cassandra?

  - by dfrankow

  Lazy programmer alert. :) Cassandra stores column values as bytes (Java example). Specifying a LongType comparator compares those bytes as a long. I want the value of a long into a Cassandra-friendly byte[]. How? I poked around for awhile. I think you people can help me faster.

  Read the article

• Most Efficient way to get the <title> of a URL?

  - by rksprst

  It's simple to do a webrequest, get the page and parse the html to get the title of the page. But I'm wondering if there is a more efficient way that is faster, and doesn't require downloading the whole html?

  Read the article

• some qeustions about Vector in STL

  - by skydoor

  I have some questions about vector in STL to clarify..... 1 Where are the objects in vector allocated? heap? 2 does vector have boundary check? If the index out of the boundary, what error will happen? 3 Why array is faster than vector? 4 Is there any case in which vector is not applicable but array is a must?

  Read the article

• How can I get a COUNT(col) ... GROUP BY to use an index?

  - by thecoop

  I've got a table (col1, col2, ...) with an index on (col1, col2, ...). The table has got millions of rows in it, and I want to run a query: SELECT col1, COUNT(col2) WHERE col1 NOT IN (<couple of exclusions>) GROUP BY col1 Unfortunately, this is resulting in a full table scan of the table, which takes upwards of a minute. Is there any way of getting oracle to use the index on the columns to return the results much faster?

  Read the article

• Fast method of directory enumeration on Win32?

  - by BillyONeal

  Hello everyone :) I'm trying to speedup directory enumeration in C++, where I'm recursing into subdirectories. I currently have an app which spends 95% of it's time in FindFirst/FindNextFile APIs, and it takes several minutes to enumerate all the files on a given volume. I know it's possible to do this faster because there is an app that does: Everything. It enumerates my entire drive in seconds. How might I accomplish something like this?

  Read the article

• How do I put static data into an SQLite database in Android?

  - by sirconnorstack

  If I have a bunch of data that is never going to change (eg. an English language dictionary or the rgb values of a couple hundred color names), how do I use an SQLite database to store it? I know a database is faster than loading everything into memory when the app starts, but how do I make the database either the first time the app runs or "before" the apps ever runs?

  Read the article

• C: performance of assignments, binary operations, et cetera...

  - by Shinka

  I've heard many things about performance in C; casting is slow compared to normal assignments, functional call is slow, binary operation are much faster than normal operations, et cetera... I'm sure some of those things are specific to the architecture, and compiler optimization might make a huge difference, but I would like to see a chart to get a general idea what I should do and what I should avoid to write high-performance programs. Is there such a chart (or a website, a book, anything) ?

  Read the article

• alternate way for string replace and array

  - by Ronnie Chester Lynwood

  hello.. is there any way to replace titles faster then str_replace function? I've got a file that 2000 lines of array changes. that hurts my webpage thanks.

  Read the article

• Best database (mysql) structure for this case:

  - by robert

  we have three types of data (tables): Book (id,name,author...) ( about 3 million of rows) Category (id,name) ( about 2000 rows) Location (id,name) ( about 10000 rows) A Book must have at least 1 type of Category (up to 3) AND a Book must have only one Location. I need to correlate this data to get this query faster: Select Books where Category = 'cat_id' AND Location = 'loc_id' Select Books where match(name) against ('name of book') AND Location = 'loc_id' Please I need some help. Thanks

  Read the article

• jQuery / Javascript if statement speed

  - by Sam

  Given: var isIE = $.browser.msie && !$.support.opacity, isIE6 = isIE && $.browser.version < 7; Which would be faster: if(isIE6){ doSomething(); } else { doSomethingElse(); } OR if(!isIE6){ doSomethingElse(); } else { doSomething(); } Are they exactly the same in terms of speed?

  Read the article

• 398 row datalist slowing down modal open????

  - by Jreeter

  Hey guys I got a weird issue.. I have a datalist that's only loaded on pageload it contains 2 columns a name and date and has 398 rows.. In IE 7 and above(and prob previous version) when I open a modal via a button click it takes almost 5 seconds to open. HOWEVER, if I do not bind this datalist it's MUCH faster.. Also this is only happening in IE, Chrome, Firefox and opera both open the modal instantly with the datalist binded... Josh

  Read the article

• How to copy a 110GB table with BLOBs from one schema to another on ORACLE

  - by simao

  Hello, I have a table containing 110GB in BLOBs in one schema and I want to copy it to another schema to a different table. I only want to copy a column of the source table so I am using an UPDATE statment, but it takes 2,5 hours to copy 3 GB of data. Is there a faster way to do this? Thank you

  Read the article

• how to perform square root without using math module??

  - by kaki

  i want to find the square root of a number without using the math module,as i need to call the function some 20k times and dont want to slow down the execution by linking to the math module each time the function is called is there any faster and easier way for finding square root??

  Read the article

• Initializing a C++ vector to random values... fast

  - by Flamewires

  Hey, id like to make this as fast as possible because it gets called A LOT in a program i'm writing, so is there any faster way to initialize a C++ vector to random values than: double range;//set to the range of a particular function i want to evaluate. std::vector<double> x(30, 0.0); for (int i=0;i<x.size();i++) { x.at(i) = (rand()/(double)RAND_MAX)*range; } EDIT:Fixed x's initializer.

  Read the article

• jquery-like HTML parsing in Python?

  - by Roy Tang

  Is there any Python library that allows me to parse an HTML document similar to what jQuery does? i.e. I'd like to be able to use CSS selector syntax to grab an arbitrary set of nodes from the document, read their content/attributes, etc. The only Python HTML parsing lib I've used before was BeautifulSoup, and even though it's fine I keep thinking it would be faster to do my parsing if I had jQuery syntax available. :D

  Read the article

< Previous Page | 71 72 73 74 75 76 77 78 79 80 81 82  | Next Page >