Search Results

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

Page 173/361 | < Previous Page | 169 170 171 172 173 174 175 176 177 178 179 180  | Next Page >

• a good book about software design

  - by Idan

  i'm looking for a book that talks about sofware decision like : when should i use thread pool and shouldn't. and in the first case, explains how. how should i acess my DB , how big my transactions should be how to read XML, to use DOM or SAX, what library to choose, and best ways to parse how to handle client-server app best efficient way and more stuff like that. is a book like that exist ? (preferably in c++ but not that important)

  Read the article

• Python most common element in a list

  - by Richard

  What is an efficient way to find the most common element in a Python list? My list items may not be hashable so can't use a dictionary. Also in case of draws the item with the lowest index should be returned. Example: >>> most_common(['duck', 'duck', 'goose']) 'duck' >>> most_common(['goose', 'duck', 'duck', 'goose']) 'goose'

  Read the article

• progressIndicator does not update till about 10 seconds after awakeFromNib occures

  - by theprojectabot

  I have been trying to get this one section of my UI to immediatly up date when the document loads into view. The awakeFromNib fires the pasted code and then starts a timer to repeat every 10 seconds... I load a default storage location: ~/Movies... which shows up immediately.. yet the network location that is saved in the document that gets pulled from the XML only seems to show up after the second firing of the - (void)updateDiskSpaceDisplay timer. I have set breakpoints and know that the ivars that contain the values that are being put into the *fileSystemAttributes is the network location right when the awakeFromNib occurs... Im confused why it magically appears after the second time firing instead of immediately displaying the write values. - (void)updateDiskSpaceDisplay { // Obtain information about the file system used on the selected storage path. NSError *error = NULL; NSDictionary *fileSystemAttributes = [[NSFileManager defaultManager] attributesOfFileSystemForPath:[[[self settings] containerSettings] storagePath] error:&error]; if( !fileSystemAttributes ) return; // Get the byte capacity of the drive. long long byteCapacity = [[fileSystemAttributes objectForKey:NSFileSystemSize] unsignedLongLongValue]; // Get the number of free bytes. long long freeBytes = [[fileSystemAttributes objectForKey:NSFileSystemFreeSize] unsignedLongLongValue]; // Update the level indicator, and the text fields to show the current information. [totalDiskSpaceField setStringValue:[self formattedStringFromByteCount:byteCapacity]]; [totalDiskSpaceField setNeedsDisplay:YES]; [usedDiskSpaceField setStringValue:[self formattedStringFromByteCount:(byteCapacity - freeBytes)]]; [usedDiskSpaceField setNeedsDisplay:YES]; [diskSpaceIndicator setMaxValue:100]; [diskSpaceIndicator setIntValue:(((float) (byteCapacity - freeBytes) / (float) byteCapacity) * 100.0)]; [diskSpaceIndicator display:YES]; } thoughts? my awakeFromNib: - (void)awakeFromNib { [documentWindow setAcceptsMouseMovedEvents:YES]; [documentWindow setDelegate:self]; [self updateSettingsDisplay]; [self updateDiskSpaceDisplay]; [self setDiskSpaceUpdateTimer:[NSTimer scheduledTimerWithTimeInterval:10.0 target:self selector:@selector(updateDiskSpaceDisplay) userInfo:NULL repeats:YES]]; [self setUpClipInfoTabButtons]; [self performSelector:@selector(setupEngineController) withObject:NULL afterDelay:0.1]; }

  Read the article

• Azure Membership UI

  - by Andres

  Using AspProviders (TableStorageMembershipProvider etc) from Microsoft WCF Azure Samples. It is WCF Service Web Role, and in Azure Storage Explorer I can see Membership, Roles and Session tables appearing nicely when I try to connect. But is there any exisiting code to manage Membership and Roles? Some ASPX pages I guess, something like this for plain old ASP.NET, but more modern and Azure-tested hopefully? Thanks, Andres

  Read the article

• Quickest way to find the oldest file in a directory using Delphi

  - by Pieter van Wyk

  HI We have a large number of remote computers that capture video onto disk drives. Each camera has it's own unique directory and there can be up to 16 directories on any one disk. I'm trying to locate the oldest video file on the disk but using FindFirst/FindNext to compare the File Creation DateTime takes forever. Does anybody know of a more efficient way of finding the oldest file in a directory? We remotely connect to the pc's from a central HO location. Regards, Pieter

  Read the article

• SQL Query for inserting multi column values in to single column

  - by SARAVAN

  I have Table "MultiCol" as below Name LibraryID RegisterID EngineerID Rahul 1002 4521 4854 Ajay 5072 3151 4833 Vimal 4532 4531 4354 I want to insert the Rahul's all IDs in the "SingleCol" table(shown below) which is having only one Column named "IDS" So I want the Result as shown below Table "SingleCol" IDS 1002 4521 4854 Which query pattern will be most efficient in terms of time and space?

  Read the article

• 2D packing with obstacles

  - by cime

  Anybody know of an efficient algorithm for moving rectangles in a square which contains obstacles? Rectangles: can rotate can move must not collide with obstacles (black squares) Obstacles: can't be moved can be added anywhere Goal: move rectangles until you can

  Read the article

• Biased Random Number Generator

  - by cmptrer

  I am looking for a random number generator that can be biased. For instance, say I want a random number between 1-5, with the probability being: 1: Comes up 20% of the time 2: Comes up 10% of the time 3: Comes up 40% of the time 4: Comes up 25% of the time 5: Comes up 5% of the time Is there anything in the standard library, or other libraries out there that would do this? Alternatively, is there an efficient way to do this myself?

  Read the article

• In C, Is a static variable stored on the stack or the heap??

  - by CVS26

  In C, Is a static variable stored on the stack or the heap?? I always thought that static vars are stored on the heap. (global lifetime) I Got this doubt while answering the following Q: http://stackoverflow.com/questions/2661369/storage-classes Please clarify...

  Read the article

• MySQL: Will a column-oriented engine be available in MySQL 5.5?

  - by JakiT

  Will a column-oriented storage engine (e.g. InfiniDB) be available in the core release of MySQL 5.5? Meaning, not as a plugin but available with the core MySQL 5.5 bundle.

  Read the article

• How to upload a huge(GBs) file to a webserver

  - by Aman Jain

  Hi I want to create a web interface that will allow users to upload huge files. These files are actually vmdk files(Virtual Machine Disks), and they can be multi GB in size. I think this makes the situation different from normal file uploads(10-20MB file uploads). So any advise on how to achieve the same in an efficient and fault tolerant way, is appreciated. Thanks Aman Jain

  Read the article

• Where can you find fun/educational programming challenges?

  - by tj9991

  I've searched around for different challenge sites, and most of them seem to be geared towards difficulty in problem solving logically, rather than trying to use your language of choice to do something you haven't used it for. Their center is around mathematics rather than function design. Some kind of point system for correctly solving challenges, or solving them the most efficient/smallest would be neat as well. Listed sites Project Euler TopCoder UVa Online Judge Challenges with Python Google Code Jam Programming Challenges Less Than Dot ACM's Programing Contest archive USACO problems ITA Software's puzzle page Refactor My Code Ruby Quiz

  Read the article

• How to handle Oracle Store Procedure call with Oracle Types as input or output using EclipseLink

  - by MAK

  Hi, I doing a Proof Of Concept to figure out how efficient to call a store procedure using EclipseLink. I was able to call oracle store procedure using EclispeLink with Scalar/primitive data types (link Integer, varchar etc). I wanted to understand how can I handle Oracle Store procedure from EclipseLink with collection(Oracle Types/User defined types) as input or output parameters. I would really appreciate if some one help me understand this with an example. Thanks MAK

  Read the article

• fast sphere-grid intersection

  - by Mat

  hi! given a 3D grid, a 3d point as sphere center and a radius, i'd like to quickly calculate all cells contained or intersected by the sphere. Currently i take the the (gridaligned) boundingbox of the sphere and calculate the two cells for the min anx max point of this boundingbox. then, for each cell between those two cells, i do a box-sphere intersection test. would be great if there was something more efficient thanks!

  Read the article

• 7 Card Poker Hand Evaluator

  - by Peter

  Hey, Does anyone know a fast algorithm for evaluating 7 card poker hands? Something which is more efficient than simply brute-force checking a every 21 5-card combination of hands from a set of 7. Cheers, Pete

  Read the article

• How to use ImageMagick to batch desaturate images?

  - by Zando

  I have an image that is black text with some gray and pale yellowish background. I basically want to keep the text as black as possible, and make the gray and yellow comparatively lighter...at the very least, turn yellow into a light gray. What's the most efficient way to do that in ImageMagick?

  Read the article

• Update n number of records using JPA with Optimistic locking

  - by Jacques René Mesrine

  I have a table with a column called "count" and I want to run a cron job that will trigger a statement that performs a SQL like this: update summaryTable set count=4; Note that there might be concurrent threads reading & changing the value for "count" when this cron job is triggered. The table has a version column to support Optimistic Locking. What's an efficient way to update the count in JPA ?

  Read the article

• How would I draw something like this in Core Graphics

  - by Jaba

  I want to be able to draw using this as my stroke. How would I do this as efficient as possible, and on the fly drawing, I was thinking CGPatternRef, but I really don't know how to do that. Edit: It does not need to warp to the path. I just coultn't fix that issue in Illustrator.

  Read the article

• Simplest database implementation

  - by MaX

  I am looking for a really simple database implementation; basically one with no complex parsing SQL engine. What I am looking for is something demonstrating B+ trees and ACID storage (Suitable for educational purposes). What I have found up-till now form my current searches was hamster-db. I am looking for something even simpler with a smaller code-base. If there is any such opensource project in your knowledge please let me know.

  Read the article

• The ternary (conditional) operator in C

  - by Bongali Babu

  What is the need for the conditional operator? Functionally it is redundant, since it implements an if-else construct. If the conditional operator is more efficient than the equivalent if-else assignment, why can't if-else be interpreted more efficiently by the compiler?

  Read the article

• Get Name by Cellphone number

  - by ganti

  Hy everyone I'm using a TextField where the user is typing in a phonenumber. When the TextField has changed it should check if this number is allready in the phonebook and display the name. So far, my only way is to parse all names and number in a Dict and read it from there. Is there a simpler more efficient and sophisticated way to do that. cheers simon

  Read the article

• Detect base64 encoding in PHP?

  - by Ian Silber

  Is there some way to detect if a string has been base64_encoded() in PHP? We're converting some storage from plain text to base64 and part of it lives in a cookie that needs to be updated. I'd like to reset their cookie if the text has not yet been encoded, otherwise leave it alone.

  Read the article

• Remove an element from an xml File using jdom

  - by Llistes Sugra

  I have a 300 KB xml file with 70 elements in it. I need to be efficient upon removing one of the root's elements. What is the best approach? Should I detach the element in memory, save it and overwrite it by moving it? Is there a better option? I like org.jdom but any improvement is welcome

  Read the article

• Numpy ‘smart’ symmetric matrix

  - by Debilski

  Is there a smart and space-efficient symmetric matrix in numpy which automatically fills [j][i] when [i][j] is written to? a = numpy.symmetric((3, 3)) a[0][1] = 1 print a # [[0 1 0], [1 0 0], [0 0 0]] An automatic Hermitian would also be nice, although I won’t need that at the time of writing.

  Read the article

• bit manipulation in java

  - by sarav

  I have a fragment of bytes in a byte[]. The total size of the array is 4 and I want to convert this into a positive long number. For example if the byte array is having four bytes 101, 110, 10, 1 then i want to get the long number represented by binary sequence 00000000 00000000 00000000 00000000 00000101 00000110 00000010 00000001 which equals 84279809 What is the efficient way to do that in Java?

  Read the article

< Previous Page | 169 170 171 172 173 174 175 176 177 178 179 180  | Next Page >