Search Results

Search found 20883 results on 836 pages for 'wont say'.

Page 316/836 | < Previous Page | 312 313 314 315 316 317 318 319 320 321 322 323  | Next Page >

• Does the compiler optimize the function parameters passed by value?

  - by Naveen

  Lets say I have a function where the parameter is passed by value instead of const-reference. Further, lets assume that only the value is used inside the function i.e. the function doesn't try to modify it. In that case will the compiler will be able to figure out that it can pass the value by const-reference (for performance reasons) and generate the code accordingly? Is there any compiler which does that?

  Read the article

• Deleting files by type in Python on Windows

  - by choszen

  I know how to delete single files, however I am lost in my implementation of how to delete all files in a directory of one type. Say the directory is \myfolder I want to delete all files that are .config files, but nothing to the other ones. How would I do this? Thanks Kindly

  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

• [C++] Initializing Primitive Array to One Value

  - by bobber205

  Is there a way to initialize an array of primitives, say a integer array, to 0? Without using a for loop? Looking for concise code that doesn't involve a for loop. :)

  Read the article

• Optimizing / simplifying a path

  - by user146780

  Say I have a path with 150 nodes / verticies. How could I simplify if so that for example a straight line with 3 verticies, would remove the middle one since it does nothing to add to the path. Also how could I avoid destroying sharp corners? And how could I remove tiny variations and have smooth curves remaining. Thanks

  Read the article

• How can I change the color of a complex graphic?

  - by Jason Christa

  I have a graphic in Adobe Illustrator (lets say a cat) that I want to use in an Android application. I would like to have the user be able to change the color of the fur using a color picker. What can I save the graphic as (SVG?) to allow me to programatically control the color from with the android app? Do I have to have a separate image for each color of the cat?

  Read the article

• Question about fwrite API

  - by michael

  Hi, In C++, there is a fwrite() which writes a buffer to a file on disk: http://www.cplusplus.com/reference/clibrary/cstdio/fwrite/ Can you please tell me if there is any buffer inside that fwrite implementation? i.e. if I call fwrite() multiple times (say 10 times), does it actually invoke file i/o 10 different times? Thank you.

  Read the article

• What's the term for a program or system that is used to maintain itself?

  - by eft

  And I don't mean skynet. I'm thinking of say a compiler application that is used to compile itself, a VCS that tracks its own source code etc.

  Read the article

• Which is better: Ad hoc queries, or stored procedures?

  - by Will

  Assuming you can't use Linq for whatever reason, is it a better practice to place your queries in stored procedures, or is it just as good a practice to execute ad hoc queries against the database (say, Sql Server for argument's sake)?

  Read the article

• bit ordering and endianess

  - by Neeraj

  I am reading a file byte-by-byte. Say for example i have this byte: 0x41 (0100 0001) represented in hex. Now, I want the first three bits of this byte, i.e (010). I can use bitwise logic to extract the first three bits, but my question is will the first three bits be independent of endianess of the machine.(i.e they can't be 001)? Thanks,

  Read the article

• SQLAlchemy: an efficient/better select by primary keys?

  - by hadrien

  Yet another newbie question.. Let's say I have an user table in declarative mode: class User(Base): __tablename__ = 'user' id = Column(u'id', Integer(), primary_key=True) name = Column(u'name', String(50)) When I have a list of users identifiers, I fetch them from db with: user_ids = [1, 2, 3, 4, 5] users = Session.query(User).filter(User.id.in_(user_ids)).all() I dislike using in_ because I think I learned it has bad performance on indexed fields (is that true/false?). Anyway, is there a better way doing that query? Thanks!

  Read the article

• Big O Complexity of a method

  - by timeNomad

  I have this method: public static int what(String str, char start, char end) { int count=0; for(int i=0;i<str.length(); i++) { if(str.charAt(i) == start) { for(int j=i+1;j<str.length(); j++) { if(str.charAt(j) == end) count++; } } } return count; } What I need to find is: 1) What is it doing? Answer: counting the total number of end occurrences after EACH (or is it? Not specified in the assignment, point 3 depends on this) start. 2) What is its complexity? Answer: the first loops iterates over the string completely, so it's at least O(n), the second loop executes only if start char is found and even then partially (index at which start was found + 1). Although, big O is all about worst case no? So in the worst case, start is the 1st char & the inner iteration iterates over the string n-1 times, the -1 is a constant so it's n. But, the inner loop won't be executed every outer iteration pass, statistically, but since big O is about worst case, is it correct to say the complexity of it is O(n^2)? Ignoring any constants and the fact that in 99.99% of times the inner loop won't execute every outer loop pass. 3) Rewrite it so that complexity is lower. What I'm not sure of is whether start occurs at most once or more, if once at most, then method can be rewritten using one loop (having a flag indicating whether start has been encountered and from there on incrementing count at each end occurrence), yielding a complexity of O(n). In case though, that start can appear multiple times, which most likely it is, because assignment is of a Java course and I don't think they would make such ambiguity. Solving, in this case, is not possible using one loop... WAIT! Yes it is..! Just have a variable, say, inc to be incremented each time start is encountered & used to increment count each time end is encountered after the 1st start was found: inc = 0, count = 0 if (current char == start) inc++ if (inc > 0 && current char == end) count += inc This would also yield a complexity of O(n)? Because there is only 1 loop. Yes I realize I wrote a lot hehe, but what I also realized is that I understand a lot better by forming my thoughts into words...

  Read the article

• Python making sure x is an int, and not a pesky float

  - by Aperture

  For example: import random x = random.randint(1, 6) y = 2 new = x / y ... now, lets say x turns out to be 5. How can I catch if it's an int or a float before doing other things in my program?

  Read the article

• Query Entity Framework 4

  - by nick

  Hi, Is it possible to run a query on an EF4.0 data context and get all objects of a certain type? Say the context has books, genres & authors but I only have a generic parameter, t. Is it possible to get all of type just by using this t? I don't think it is :(

  Read the article

• How to get portion of the attribute value using jquery

  - by Rachel

  I have attribute value as: <div id = "zone-3a-2f-2f-2fPortal-2fPages-2fHome-2fZones-2fLeft-2f-7ccomponent-3a-2f-2f-2fSpm-2fComponents-2fPromotion-2f" class = "promotion"> Now I want to get only portion of it, say Promotion and its value 2f, how can I get this using jquery ? Do we have built in function for it ?

  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

• Collision free hash function for a specific data structure

  - by Max

  Is it possible to create collision free hash function for a data structure with specific properties. The datastructure is int[][][] It contains no duplicates The range of integers that are contained in it is defined. Let's say it's 0..1000, the maximal integer is definitely not greater than 10000. Big problem is that this hash function should also be very fast. Is there a way to create such a hash function? Maybe at run time depending on the integer range?

  Read the article

• Does a .cs file compile under a .vbproj?

  - by serhio

  Does a .cs(C#) file compile under a .vbproj(VB.NET project) ? (VS 2005, .NET 2) Say I have Animals.vbproj (namespace Animals) I have Wolf.vb, Tiger.vb, Cat.vb, and a Human.cs Could I use Animals.Human from a external AnimalsForm.vb form? Why?

  Read the article

• how not to output default T4 generated file

  - by Fred Yang

  I am using T4toolbox to generate a bunch of files, let's say my t4 file name is x.t4, but default it generate a x.txt, which has nothing inside, can I tell t4 engine not to do this?

  Read the article

• [MSVC++ 2008] Using preprocessor directives to define command line options

  - by Gbps

  If I wanted to add, let's say, a new .lib to the build only if a particular #define was set, how would I do that? In the MSVC++ 2008 "Property Pages", you would simply add: Config Properties -> Linker -> Input -> Additional Dependencies, but I would like it if something like #define COMPILE_WITH_DETOURS was set, then the particular library would be added to the dependencies, otherwise it would be removed. Thanks!

  Read the article

• Using jQuery to find a substring

  - by Steve

  Say you have a string: "The ABC cow jumped over XYZ the moon" and you want to use jQuery to get the substring between the "ABC" and "XYZ", how would you do this? The substring should be "cow jumped over". Many thanks!

  Read the article

• how to bind the same vector multiple times using R?

  - by hendrik

  question: how can i bind the same vector, lets say o=c(1,2,3,4) mutiple times to get a matrix like o=array(c(1,2,3,4,1,2,3,4,1,2,3,4), dim(c(4,3)) o [,1] [,2] [,3] [1,] 1 1 1 [2,] 2 2 2 [3,] 3 3 3 [4,] 4 4 4 in a nicer way then: o=cbind(o,o,o) and maybe more generalized (dublicate()?? I need this to specifiy colors for elements in textplot() thx a lot

  Read the article

• How to force a window to maintain a certain width/height ratio when resized

  - by woor

  I want my window to always maintain a certain ratio of let's say 1.33333333. So, if the window is width = 800, height = 600 and the user changes the width to 600, I want to change the height to 450 automatically. I'm already intercepting WM_SIZE but I don't know if it's enough; also I don't know how to change the width or height to maintain my ratio.

  Read the article

• VIM equivalent for (something like) 6xi?

  - by me2

  There's a command in VIM where you can say how many chars to replace, and VIM will put a "$" at that many characters out, and you can type in the replacement for those characters. The original and new text can be different lengths. What's the command for this?

  Read the article

• How to rip specific data from an HTML file?

  - by SnirD

  Hi, so I have multiple HTML files which I need to get some praticular data from, I mean theres a bunch of non relative information in this HTML files, but I need just lets say things that are between the <div class="myInfo"> and </div>, after getting this information I want to handle it in my own PHP page, so for example I can insert this data into some variables. Is it even possible using PHP only? (Forgive me for my English mistakes)

  Read the article

< Previous Page | 312 313 314 315 316 317 318 319 320 321 322 323  | Next Page >