Search Results

Search found 14841 results on 594 pages for 'performance monitoring'.

Page 387/594 | < Previous Page | 383 384 385 386 387 388 389 390 391 392 393 394  | Next Page >

• Anyone tried JustCode?

  - by silverArc

  Have you used JustCode? is it better than resharper? seems like performance better. Do I need to uninstall resharper before using JustCode?

  Read the article

• SQL Design Question regarding schema and if Name value pair is the best solution

  - by Aur

  I am having a small problem trying to decide on database schema for a current project. I am by no means a DBA. The application parses through a file based on user input and enters that data in the database. The number of fields that can be parsed is between 1 and 42 at the current moment. The current design of the database is entirely flat with there being 42 columns; some have repeated columns such as address1, address2, address3, etc... This says that I should normalize the data. However, data integrity is not needed at this moment and the way the data is shaped I'm looking at several joins. Not a bad thing but the data is still in a 1 to 1 relationship and I still see a lot of empty fields per row. So my concerns are that this does not allow the database or the application to be very extendable. If they want to add more fields to be parsed (which they do) than I'd need to create another table and add another foreign key to the linking table. The third option is I have a table where the fields are defined and a table for each record. So what I was thinking is to make a table that stores the value and then links to those two tables. The problem is I can picture the size of that table growing large depending on the input size. If someone gives me a file with 300,000 records than 300,000 x 40 = 12 million so I have some reservations. However I think if I get to that point than I should be happy it is being used. This option also allows for more custom displaying of information albeit a bit more work but little rework even if you add more fields. So the problem boils down to: 1. Current design is a flat file which makes extending it hard and it is not normalized. 2. Normalize the tables although no real benefits for the moment but requirements change. 3. Normalize it down into the name value pair and hope size doesn't hurt. There are a large number of inserts, updates, and selects against that table. So performance is a worry but I believe the saying is design now, performance testing later? I'm probably just missing something practical so any comments would be appreciated even if it’s a quick sanity check. Thank you for your time.

  Read the article

• #pragma once Versus #if !defined MYHEADER_INCLUDED_

  - by bdhar

  What is/are the differences (in performance/usability/functionality) in using #pragma once and #if !defined MYHEADER_INCLUDED_ constructs? Or what is the difference between the two?

  Read the article

• new items on GRUB screen in ubuntu/linux

  - by artsince

  I regularly update my ubuntu (10.04), and new minor versions keep accumulating on the GRUB screen. Right now I have 5 different versions listed on the GRUB, even though I always select the latest version to work with. Am I supposed to do anything to get rid of the old version references? Do these old versions affect disk space/performance?

  Read the article

• Javascript: move the "view point" of the browser

  - by ArchJ

  I have a page with many out-of-bounds contents and since I set body{overflow:hidden}, they are not outside the viewport. So I want to attach a function to a button which would move the PoV of the browser so that the out-of-bounds contents would come into the viewport. What I can think of now is to set body{position:relative} and use jQuery to animate() the body instead. But in terms of performance, is there a better way to achieve that?

  Read the article

• How to update Shark so that it shows the new edited source code?

  - by mystify

  I've tweaked my code in Xcode after Shark complained about some performance bottlenecks. However, Sharp seems to cache that code and keeps showing me old aged stuff. Even after several builds and re-tries. Probably I must activate some fancy function that says "never cache anything" like in web browsers?

  Read the article

• memcached vs. internal caching in PHP?

  - by waitinforatrain

  Hey, I'm working on some old(ish) software in PHP that maintains a $cache array to reduce the number of SQL queries. I was thinking of just putting memcached in its place and I'm wondering whether or not to get rid of the internal caching. Would there still be a worthwihle performance increase if I keep the internal caching, or would memcached suffice?

  Read the article

• Difference between Array and List in scala

  - by Jeriho

  In what cases I should use Array(Buffer) and List(Buffer). Only one difference that I know is that arrays are nonvariant and lists are covariant. But what about performance and some other characteristics?

  Read the article

• Writing cfquery inside cfoutput tag ?

  - by Somu

  I am writing the cfquery inside the cfoutput tag. It can be written outside the cfoutput tag. My question here is do we have any performance issues if we write the cfquery inside the cfoutput ?

  Read the article

• Simple way to do SURBL lookup from Java?

  - by StaxMan

  I am reading about SURBLs (known spam hosts), for purpose of classifying spam, as a batch process. Main access method seems to be via DNS lookups. I was wondering what's the usual way to do such lookups from Java code. Since this is a batch process with no strict performance requirements, I think most important feature would just be simplicity.

  Read the article

• 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

• Serialize() not using .XmlSerializers.dll produced with Sgen

  - by MDE

  I have a sgen step in my .NET 3.5 library, producing a correct XYZ.XmlSerializers.dll in the output directory. Still having poor serialization performance, I discovered that .NET was still invoking a csc at runtime. Using process monitor, I saw that .NET was searching for a dll named "XYZ.XmlSerializers.-1378521009.dll". Why is there a '-1378521009' in the filename ? How to tell .NET to use the 'normal' DLL produced by sgen ?

  Read the article

• Python `if x is not None` or `if not x is None`?

  - by orokusaki

  I've always thought of the if not x is None version to be more clear, but Google's style guide implies (based on this excerpt) that they use if x is not None. Is there any minor performance difference (I'm assuming not), and is there any case where one really doesn't fit (making the other a clear winner for my convention)?* *I'm referring to any singleton, rather than just None. ...to compare singletons like None. Use is or is not.

  Read the article

• Better to use an OR or an AND when checking for NULLs in C if statements?

  - by Crazy Chenz

  Came across a line in OpenSSL that made me do a double take... if (!*pos) return NULL; if (!*pos || ((*pos)->flags == FLAGS)) return blah; Is there a (performance/security/concurrecy) difference in doing that instead of: if (!*pos) return NULL; if (*pos && ((*pos)->flags == FLAGS)) return blah; Thanks, Chenz

  Read the article

• Which mysql construct is faster?

  - by Olaseni

  SELECT ..WHERE COL IN(A,B) or SELECT ... WHERE (COL = A or COL = B) I'm trying to find out what are the differences between the two constructs? Would there be significant performance gains either way if utilized on resultsets that are nearing the 1 million mark?

  Read the article

• Using Int32 or what you need

  - by Sir Psycho

  Should you use Int32 in places where you know the value is not going to be higher than 32,767? I'd like to keep memory down, hoever, using casts everywhere just to perform simple arithmetic is getting annoying. short a = 1; short result = a + 1; // Error short result = (short)(a + 1); // works but looks ugly when does lots of times What would be better for overall application performance?

  Read the article

• Spring.Net how does WebApplicationContext.GetObject handle concurrent requests?

  - by Alfamale

  Apologies if I have missed something obvious here but having gone through the documentation, forums and googled for a number of hours, I just can't find a definitive answer to the following questions: How does the WebApplicationContext.GetObject() method handle concurrent requests? Are the requests serialized or executed in parallel? Is there any performance data available to demonstrate how it behaves under load? Thanks in advance for your help, Andrew

  Read the article

• Java JIT compiler compiles at compile time or runtime ?

  - by Tony

  From wiki: In computing, just-in-time compilation (JIT), also known as dynamic translation, is a technique for improving the runtime performance of a computer program. So I guess JVM has another compiler, not javac, that only compiles bytecode to machine code at runtime, while javac compiles sources to bytecode,is that right?

  Read the article

• Setting UITableViewCell height is expensive

  - by Sheehan Alam

  I am doing a comparison in - (CGFloat)tableView:(UITableView *)tblView heightForRowAtIndexPath:(NSIndexPath *)indexPath It seems like performance of my app really slows down when I check if a cell.detailTextLabel.text isEqualTo:@"None"; What is a better way of doing the comparison and setting the cell height?

  Read the article

• Do compiled PHP scripts exist?

  - by dabito

  Hi, I am wondering if anyone has used or read about PHP scripts compiled as a .so extension for Apache... Thing is I think I remember reading about it somewhere but dont know if such a thing exists. This looks promising, but incomplete and abandoned: http://phpcompiler.org/ Im interested because i think it could improve performance... Perhaps someone could point out a framework or apache extension that does this. Thanks!!

  Read the article

• Most efficient way to animate a path?

  - by mystify

  I have a fullscreen path which consists of about 20 lines. Currently I am animating changes in this path using an NSTimer which frequently calls -setNeedsDisplay. Believe me: Performance sucks absolutely. I slightly remember that there was some better way to animate paths on the iPhone. Some kind of special CA layer. I don't remember anymore it's exact name. Who knows?

  Read the article

• What javascript templating engine do you recommend?

  - by flybywire

  Do you have experience with a Javascript templating engine, one that is stable, easy to use and has good performance? I need to do apply the same template many times for different data. I prefer to download the template itself once (and have it cached) rather than processing the template on the server. Also, this way the template itself would be a static resource more easily cached in the server side too.

  Read the article

• Should I use an ArrayList or IList

  - by Farstucker

  Im using the .NET framework 1.1 and Im hoping someone could help me implement a dynamic array of objects? A watered-down example of the object I wish use is below. Class CarObj { public string CarName; public string CarYear; } Should I use an ArrayList or do you think it would be better to make a CarList class to implement an IList interface? Is there a performance benefit for one over another?

  Read the article

• How can I find out how much memory an object of a C++ class consumes?

  - by Shadow

  Hi, I am developing a Graph-class, based on boost-graph-library. A Graph-object contains a boost-graph, so to say an adjacency_list, and a map. When monitoring the total memory usage of my program, it consumes quite a lot (checked with pmap). Now, I would like to know, how much of the memory is exactly consumed by a filled object of this Graph-class? With filled I mean when the adjacency_list is full of vertices and edges. I found out, that using sizeof() doesn't bring me far. Using valgrind is also not an alternative as there is quite some memory allocation done previously and this makes the usage of valgrind impractical for this purpose. I'm also not interested in what other parts of the program cost in memory, I want to focus on one single object. Thank you.

  Read the article

• How to build a web based chat application similar to gmail using java at backend logic

  - by manu

  Hii, I want to built a web based chat using j2ee at backend logic.i want to implement the similar way the gmail do,so that performance of application doesnr degrade.please suggest what type of architecture shoul i follow.load of application would be high.

  Read the article

< Previous Page | 383 384 385 386 387 388 389 390 391 392 393 394  | Next Page >