Search Results

Search found 22625 results on 905 pages for 'must do better'.

Page 323/905 | < Previous Page | 319 320 321 322 323 324 325 326 327 328 329 330  | Next Page >

  • C# - Fast and simple multi dimensional data structures?

    - by Jeremy Rudd
    I need to store multi-dimensional data consisting of numbers in a manner thats easy to work with. I'm capturing data in real time, and once processed I would destroy and GC older data. This data structure must be fast so it won't hit my overall app performance. The faster the better. What are my choices in terms of platform supported data structures? I'm using VS 2010. and .NET 4.

    Read the article

  • Databases: Migrate data between MS Access DB and MYSQL

    - by Dean
    Hello, I have 2 databases, one is MS Access DB from an old website, and the other one is MYSQL from the new Joomla+VirtueMart based website. I need to migrate existing products from MS Access to MYSQL. I thought of putting both on server and writing SQL queries in MYSQL workbench, untill I have a good script for that, but I'm very new to SQL, so I'd rather avoid that. I there a better way and more efficient for that?

    Read the article

  • ASP.Net - validating email address with regexp?

    - by ElHaix
    When validating an email address with the regex validation component, an additional RequiredFieldValidator must be added to ensure there is a value present. I've mostly taken care of this with a CustomFieldValidator, and taking care of this with Javascript. Is there a better way of doing this?

    Read the article

  • rename keys in a dictionary

    - by user366660
    i want to rename the keys of a dictionary are which are ints, and i need them to be ints with leading zeros's so that they sort correctly. for example my keys are like: '1','101','11' and i need them to be: '001','101','011' this is what im doing now, but i know there is a better way tmpDict = {} for oldKey in aDict: tmpDict['%04d'%int(oldKey)] = aDict[oldKey] newDict = tmpDict

    Read the article

  • Second min cost spanning tree.

    - by Evil
    Hello. I'm writing an algorithm for finding the second min cost spanning tree. my idea was as follows: 1) Use kruskals to find lowest MST. 2) Delete the lowest cost edge of the MST. 3) Run kruskals again on the entire graph. 4) return the new MST. My question is this: Will this work? Is there a better way perhaps to do this?

    Read the article

  • Jmagick rounding corners

    - by SPC
    Hello, I've a question concerning Jmagick, how can I round corners of an image, and does this make sense or would it be better to do this using CSS in HTML ? Thanks

    Read the article

  • Can I use WCF to replace my current Web Service and Window Service combination?

    - by gun_shy
    I need a little bit of advise regarding the situation I am faced with. The current arrangement I have been tasked with improving just doesn't sit well with me and I feel like there is a better way to do it. The more I read about WCF, the more I get the feeling that it might be what I am looking for. Right now, I have an asp.net client, a .net web service, a windows service, a ms sql database, and a third party application that is used for processing a group of 'project' files into a finalized file. Since the third party application can only handle processing one 'project' at a time, the combination of the web service, window service, and database have been arranged to create a job queue manager for the third party application. The client sends a zip 'project' file containing multiple sub files to the web service. The web service adds a new 'project' line to the database, generating a unique job id. The zip file is expanded to a folder location on the server using the job id as the folder name. The web service then returns the job id to the client. The client will use this id to poll the web service for the status of the job submitted. When the job is complete, the client will request the processed file. The windows service polls the database every x minutes. If a new job exists, the service will pull the oldest job and send it to the third party app for processing. If the processing succeeds, the window service updates the project line in the database, marking the job complete. The window service will continue to process any non complete jobs in the database until there are no more. When it stops finding any jobs, it will sleep x minutes and then poll the database again. I do not like the fact that the window service has to poll the database. If there is only one job submitted, the client will have to wait for the window service to poll and then wait while the 'project' is being processed. It seems like WCF could be used to combine the web and window services using a combination of the InstanceContextMode.Single and ConcurrencyMode.Multiple. So far, I have been unable to find any articles or examples that would point me in the right direction. Can WCF be utilized to accomplish the job queue logic of the current arrangement in a better way? As always, any help is more than appreciated.

    Read the article

  • C++ code which is slower than its C equivalent?

    - by user997112
    Are there any aspects to the C++ programming language where the code is known to be slower than the equivalent C language? Obviously this would be excluding the OO features like virtual functions and vtable features etc. I am wondering whether, when you are programming in a latency-critical area (and you aren't worried about OO features) whether you could stick with basic C++ or would C be better?

    Read the article

  • Extract time part from TimeStamp column in ORACLE

    - by RRUZ
    Actually i' am using MyTimeStampField-TRUNC(MyTimeStampField) to extract the time part from an timestamp column in Oracle. SELECT CURRENT_TIMESTAMP-TRUNC(CURRENT_TIMESTAMP) FROM DUAL this return +00 13:12:07.100729 this work ok for me, to extract the time part from an timestamp field, but i' m wondering if exist a better way (may be using an built-in function of ORACLE) to do this? Thanks.

    Read the article

  • Create comma separated string from 2 lists the groovy way

    - by Micor
    What I have so far is: def imageColumns = ["products_image", "procuts_subimage1", "products_subimage2", "prodcuts_subimage3", "products_subimage4"] def imageValues = ["1.jpg","2.jpg","3.jpg"] def imageColumnsValues = [] // only care for columns with values imageValues.eachWithIndex { image,i -> imageColumnsValues << "${imageColumns[i]} = '${image}'" } println imageColumnValuePair.join(", ") It works but I think it could be better. Wish there was a collectWithIndex ... Any suggestions?

    Read the article

  • What is the point of function pointers?

    - by gramm
    Hi, I have trouble seing the utility of the function pointers. I guess it may be useful in some cases (they exist, after all), but I can't think of a case where it's better or unavoidable to use a function pointer. Could you give some example of good use of function pointers (in C or C++)? Many thanks :)

    Read the article

  • Sql server like for Integer

    - by Prashant
    I have a column which is integer and I want to search all numbers starting with 1500. I know I could use something like left(accountid,4)= 1500. But is that an optimum solution or is there a better approach? I am using Sql Server 2005.

    Read the article

  • Most suitable Unix platform for developing device drivers

    - by bugspy.net
    I completely newbie in device drivers, so I hope my question is in place, but I need to develop a driver to control some equipment. I was thinking on using Linux as the host OS, but not sure if it is such good idea. I've heard some horror stories about the mess of developing device drivers under Linux. Is there a better alternative under the *Nix world? Or maybe should I check other OSes?

    Read the article

  • Need Help Loading and Manipulating Bitmap Data

    - by Dave
    Using VB6, I need to load a bitmap image and subsequently manipulate some of its data - specifically, I want to rotate a section within the image, and in the end keep the image intact with the rotated section. How do I (1) find out where an image gets loaded into memory (a physical address), and (2) in what format is it stored, a 1-D array, 2-D array, or what? Maybe you can even suggest a better way to do this. Thanks.

    Read the article

  • How to tell if 2 arrays share the same element.

    - by Ommit
    So this is a simpler form of my problem. Lets say I have 2 arrays. A= {1,2} and B={2,4,6}. If A and B share an element then delete that element from B. I know you can loop through and compare each element in A to each element in B, but there's got to be a better way!

    Read the article

< Previous Page | 319 320 321 322 323 324 325 326 327 328 329 330  | Next Page >