Search Results

Search found 3758 results on 151 pages for 'efficient'.

Page 52/151 | < Previous Page | 48 49 50 51 52 53 54 55 56 57 58 59  | Next Page >

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• 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

• best method to update the SQL table data from c# .NET 2005

  - by Jebli

  Hi , I have a dataset with some 30 records in it. I want to update it to the database tables. which is the best method to update the table. I am unable to use dataadapter.update() since i am using a procedure to populate the dataset. is there any efficient way to update other than iterating through EACH record and updating it Please help. Thanks.

  Read the article

• Convert Byte Array into Bitset

  - by Unknown

  I have a byte array generated by a random number generator. I want to put this into the STL bitset. Unfortunately, it looks like Bitset only supports the following constructors: A string of 1's and 0's like "10101011" An unsigned long. (my byte array will be longer) The only solution I can think of now is to read the byte array bit by bit and make a string of 1's and 0's. Does anyone have a more efficient solution?

  Read the article

• Pass array to client side for display

  - by Skoder

  Hey, I have an array which contains around 50-200 hyperlinks. How can I pass this array to the client-side so that I can iterate through the array and display each hyperlinks as a list item? The array will be stored in 'Application' as it's system wide and rarely changes. Could there be a more efficient way of achieving the hyperlinks as a list? Thanks

  Read the article

• dictionary interface for large data sets

  - by Richard

  I have a set of key/values (all text) that is too large to load in memory at once. I would like to interact with this data via a Python dictionary-like interface. Does such a module already exist? Reading key values should be efficient and values compressed on disk to save space.

  Read the article

• Parser generator for inline documentation

  - by Leonth

  To have a general-purpose documentation system that can extract inline documentation of multiple languages, a parser for each language is needed. A parser generator (which actually doesn't have to be that complete or efficient) is thus needed. http://antlr.org/ is a nice parser generator that already has a number of grammars for popular languages. Are there better alternatives i.e. simpler ones that support generating parsers for even more languages out-of-the-box?

  Read the article

• Google Appengine: Java or Python

  - by husayt

  We are going to use Google Appengine platform for our next big web project.But we are not sure which flavour to use: Java or Python. Could you please, advise on cons and pros of each approach? Which is the best way in order to build more scalable and efficient solution quicker. Thanks in advance

  Read the article

• Recommended Bean Utility Libraries for Java

  - by Jim Ferrans

  I'm looking for a good, well-supported, and efficient Java library that uses reflection to automate JavaBean operations. These include making a deep copy of an arbitrary bean hierarchy (with nested lists and maps of beans), comparing two bean hierarchies for deep equality, and "transmorphing" one bean to another of a different class. Some possibilities include Apache Commons BeanUtils, Spring's BeanUtils, and Java's Bean support. Which libraries would you recommend?

  Read the article

• PHP include once.

  - by cpburns

  Is it more efficient to use PHP's include_once or require_once instead of using c-like include with a header guard? i.e, VERSUS //contents of init.php if (!defined('MY_INIT_PHP')) { define('MY_INIT_PHP', true); ... } ?

  Read the article

• Implode a Object List in .NET 2

  - by serhio

  I have(.NET2) an List<Object> objects. I want to "implode" (PHP concept) this array to CSV(obj1;obj2;obj3...) What is the most efficient way? StringBuilder, string.Join? NB. Each object implements a specific override of ToString()

  Read the article

< Previous Page | 48 49 50 51 52 53 54 55 56 57 58 59  | Next Page >