Search Results

Search found 16731 results on 670 pages for 'memory limit'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 401/670 | < Previous Page | 397 398 399 400 401 402 403 404 405 406 407 408  | Next Page >

  • Possible reasons and resolutions for time out

    - by ming yeow
    I cannot SSH into my instance - Operation timed out. What could be the reasons why, and what can I do to resolve it? Rebooting normally takes a long time to take effect, and might just makes things worst UPDATE: It is not about permissions - i can log in normally just fine. I suspect it might be because of memory issues

    Read the article

  • VB6: Slow Binary Write?

    - by Tom the Junglist
    Wondering why a particular binary write operation in VB is so slow. The function reads a Byte array from memory and dumps it into a file like this: Open Destination For Binary Access Write As #1 Dim startP, endP As Long startP = BinaryStart endP = UBound(ReadBuf) - 1 Dim i as Integer For i = startP To endP DoEvents Put #1, (i - BinaryStart) + 1, ReadBuf(i) Next Close #1 For two megabytes on a slower system, this can take up to a minute. Can anyone tell me why this is so slow?

    Read the article

  • Viewing large XML files in eclipse?

    - by Paul Wicks
    I'm working on a project involving some large XML files (from 50MB to over 1GB) and it would be nice if I could view them in eclipse (simple text view is fine) without Java running out of heap space. I've tried tweaking the amount of memory available to the jvm in eclipse.ini but haven't had much success. Any ideas?

    Read the article

  • Light Weight repalcement to GNOME for Ubuntu

    - by Talguy
    I am working on rolling a bit of my own version of linux for my real time car application. I plan to base it off of minimal ubuntu (only needsd 32 MB of memory). I am not the most skilled person with linux so not really sure how to assess components when adding them to my system. What I am looking for is a lightweight windows manager to replace gnome and it has to support the gtkmm library. Does anyone know of one?

    Read the article

  • GC generation 3 appearing in windbg

    - by Johnv2020
    I've a dump file of a process I'm running (trying to find a memory leak) One thing I've noticed is that when I dump the bigger objects via !do windbg tells me that they are GC generation 3 ?? All of these are byte arrays so when I look at all the byte arrays in the dump I can see GC generations 0, 1, 2 & 3. Could someone explain whats going on here as I thought there was only 3 generations of GC.

    Read the article

  • How does Office 2008 for Mac store its Recent items?

    - by zenopolis
    I don't have access to Office 2008, but require the information for a project I'm working on. I'm mainly interested in Word, Excel and Powerpoint. This is the information I have gathered so far... The preference file is: ~/Library/Preferences/com.microsoft.office.plist The property keys take the form: 2008\File Aliases\{APP}{n} 2008\MRU Access Date\{APP}{n} where {APP} represents an Office application, and {n} represents a number starting from 0. The applications are represented by the following values: MSWD (Word) XCEL (Excel) What value represents PowerPoint? In the property list I've seen, the numbers represented by {n} range from 0-10 (11 items). Is 10 the limit? or is this unrestrained? Finally, I've noticed that Office 2011 does not add its Recent Items to the Apple System menu: Apple > Recent Items Is Office 2008 the same?

    Read the article

  • Scope of const char*

    - by Neeraj
    Consider this code: const char* someFun() { // ... some stuff return "Some text!!" } int main() { { // Block: A const char* retStr = someFun(); // use retStr } } My question is in the function sumFun() where is "some Text!!", stored (i think may be in some static area in ROM) and what will be its scope? Will the memory pointed by retStr be occupied throughout the program or be released once the block A exits? -- Thanks

    Read the article

  • Linq To Text Files

    - by j-t-s
    Hi All I have a Text File (Sorry, I'm not allowed to work on XML files :(), and it includes customer records. Each text file looks like: Account_ID: 98734BLAH9873 User Name: something_85 First Name: ILove Last Name: XML Age: 209 etc... And I need to be able to use LINQ to get the data from these text files and just store them in memory. I have seen many Linq to SQL, Linq to BLAH but nothing for Linq to Text. Can someone please help me out abit? Thank you

    Read the article

  • Is there any way static block is executed more than once? if so then how?

    - by learner
    My Understanding Static block is executed during class loading, If a class is already loaded then there is no way to load the class other than class reloading Doubt/Question 1) Is there any time JVM reloads the class? My Understanding In Class Loading JVM loads source of the Java file, so it can not keep all thousands files source is a memory, it should discard the rarely used code and reload again when it is necessary and during reload JVM is not initializing static variables and locks again(may be using some tracking mechanism) Doubt/Question 2) If my above understanding is incorrect then please correct me

    Read the article

  • Is it a good practice to always use smart pointers ?

    - by Dony Borris
    Hi, I find smart pointers to be a lot more comfortable than raw pointers. So is it a good idea to always use smart pointers? ( Please note that I am from Java background and hence don't much like the idea of explicit memory management. So unless there are some serious performance issues with smart pointers, I'd like to stick with them. ) Any advice would be greatly appreciated. Thanks.

    Read the article

  • What does "performant" software actually mean?

    - by Roddy
    I see it used a lot, but haven't seen a definition that makes complete sense. Wiktionary says "characterized by an adequate or excellent level of performance or efficiency", which isn't much help. Initially I though performant just meant "fast", but others seem to think it's also about stability, code quality, memory use/footprint, or some combination of all those. I think this is a "real" question - but if enough people reckon this is a subjective question, that's an answer in itself.

    Read the article

  • How can I measure the speed of code written in Java? (AI algorithms)

    - by Registered User
    Hi All, How can I measure the speed of code written in Java? I planning to develop software which will solve Sudoku using all presently available AI and ML algorithms and compare time against simple brute-force method. I need to measure time of each algorithm, I would like to ask for suggestions on what is the best way of doing that? Very important, program must be useful on any machine regardless to CPU power/memory. Thank you.

    Read the article

  • new Integer vs valueOf

    - by LB
    Hi, I was using Sonar to make my code cleaner, and it pointed that I'm using new Integer(1) instead of Integer.valueOf(1). Because it seems that valueOf does not instantiate a new object so is more memory-friendly. How can valueOf not instantiate a new object ? How does it work ? Is this true for all integers ? thanks.

    Read the article

  • Can I prevent IMAP from grabbing files over X mb using PHP?

    - by mike
    I'm building a little script that will connect to an IMAP account and grab the content of the email and also the attachments. It works well for the most part, but when a really large file comes in, it causes the script to time out. Is there any way that I can check the file size before trying to grab it? I think that would be the simplest solution. Otherwise, I may have to upgrade to a server that has more memory.

    Read the article

  • Alias for a C++ template?

    - by porgarmingduod
    typedef boost::interprocess::managed_shared_memory::segment_manager segment_manager_t; // Works fine, segment_manager is a class typedef boost::interprocess::adaptive_pool allocator_t; // Can't do this, adaptive_pool is a template The idea is that if I want to switch between boost interprocess' several different options for shared memory and allocators, I just modify the typedefs. Unfortunately the allocators are templates, so I can't typedef the allocator I want to use. Is there a way to achieve an alias to a template in C++? (Except for the obvious #define ALLOCATOR_T boost::interprocess::adaptive_pool)

    Read the article

  • if with multiple conditions, order of execution

    - by markus
    Hi, In an if statement with multiple conditions is second executed if the outcome is clear after checking the first condition? example: if(i>0 && array[i]==0){ } If I swap the conditions a seg fault may occur for negative values of i but this way the memory debugger doesn't find a problem. Can I be sure that this works always or do have have to use nested if statements?

    Read the article

  • What to Learn after C++?

    - by Stephen Whitmore
    I have been learning C++ for a while now, I find it very powerful. But, the problem is the the level of abstraction is not much and I have to do memory management myself. What are the languages that I can use which uses a higher level of abstraction.

    Read the article

  • How big in bytes is a DataRow

    - by JeffreyABecker
    I have a one-time process (hashing all our user passwords) written using datasets. The performance needs improvement so we've profiled the application and found that increasing the 'batch size' of the update will improve performance. I also know that if I load the entire data set into memory the application will start hitting swap and slow down. The question is: how big is a System.Data.DataRow derived class? I'd like to calculate a batch size which I know won't force the application into swap.

    Read the article

  • Why use one dimensional array instead of a two dimensional arrray?

    - by user3869145
    I was doing some work handling a lot of information and my partner told me that I was using too many matrices to manipulate the variables of the problem. The idea was to use one dimension arrays int a[] instead of the 2 dimensional arrays int b[][], to save memory and processing speed of the algorithm. How certain is that this change will accelerate the speed of execution or compilation of my code in c ++?

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 397 398 399 400 401 402 403 404 405 406 407 408  | Next Page >