Search Results

Search found 6104 results on 245 pages for 'fast esp'.

Page 104/245 | < Previous Page | 100 101 102 103 104 105 106 107 108 109 110 111  | Next Page >

  • Faster way to dump mysql

    - by japancheese
    This may be a dumb question, but I was just watching a screencast on MySQL replication, and I learned that a master database doesn't send SQL over to a slave for replication, it actually sends data over in binary, which makes importing extremely fast. I started wondering, "if a database can export and import binary, why do mysqldumps / imports take so long?" Is there a way to get mysql to dump a database in binary in a similar fashion to speed up that process as well?

    Read the article

  • Python: Streaming Input with Subprocesses

    - by beary605
    Since input and raw_input() stop the program from running anymore, I want to use a subprocess to run this program... while True: print raw_input() and get its output. This is what I have as my reading program: import subprocess process = subprocess.Popen('python subinput.py', stdout=subprocess.PIPE, stderr=subprocess.PIPE) while True: output=process.stdout.read(12) if output=='' and process.poll()!=None: break if output!='': sys.stdout.write(output) sys.stdout.flush() When I run this, the subprocess exits almost as fast as it started. How can I fix this?

    Read the article

  • How to store data with N columns

    - by iconiK
    I need a way to store an int for N columns. Basically what I have is this: Armies: ArmyID - UINT UnitCount1 - UINT UnitCount2 - UINT UnitCount3 - UINT UnitCount4 - UINT ... I can't possible add a column for each and every unit, so I need a fast way to store the number of each units in an army (you might have guesses it's for a game by now). Using XML is not an option as it will be dead slow.

    Read the article

  • What is the fastest / best Base64 en/decoder for Java ?

    - by mP
    Just found the MIG Base 64 utility but its over 6 years old since its last release. It would appear to be quicker than the Apache commons equivalent but I have yet to confirm by writing up an actual test. Has anyone verified its correctness which is always a worry. If someone takes a look at the methods, please note i a referring to the non fast methods which make assumptions trading possible correctness for pure speed.

    Read the article

  • If I never ever use HashSet, should I still implement GetHashCode?

    - by Dimitri C.
    I never need to store objects in a hash table. The reason is twofold: coming up with a good hash function is difficult and error prone. an AVL tree is almost always fast enough, and it merely requires a strict order predicate, which is much easier to implement. The Equals() operation on the other hand is a very frequently used function. Therefore I wonder whether it is necessary to implement GetHashCode (which I never need) when implementing the Equals function (which I often need)?

    Read the article

  • Find most significant bit (left-most) that is set in a bit array

    - by Claudiu
    I have a bit array implementation where the 0th index is the MSB of the first byte in an array, the 8th index is the MSB of the second byte, etc... What's a fast way to find the first bit that is set in this bit array? All the related solutions I have looked up find the first least significant bit, but I need the first most significant one. So, given 0x00A1, I want 9.

    Read the article

  • Make a collection with movies

    - by Dimitar Vouldjeff
    Hello, I need to make a collection with a lot of movies, but I was wandering if there is something like API or other method to make that database automatically? I will be using Ruby on Rails, but if there is a useful and fast tool, I will use it. Thank you.

    Read the article

  • Write an expression in javascript

    - by Hero
    hi everybody... I need a javascript code that split a string like below: Input string: "a=aa| b=b||b | c=cc" Output: a=>aa b=>b||b c=>cc I'd written different codes like: split(/ \ | /) or Split(/ \| (?! \ |) /) but didn't work. please help me... I really need it fast.

    Read the article

  • A SELECT statement for Mysql

    - by Hossein
    I have this table: id,bookmarkID,tagID I want to fetch the top N bookmarkIDs for a given list of tags. Does anyone know a very fast solution for this? the table is quite large(12 million records) I am using MySql

    Read the article

  • Is there a tool to generate MVC code in C#?

    - by Rity
    I was working on a project with a colleague and went out for lunch one day. Given that we only spent a few days doing design and no coding, I was surprised to find out that after lunch, he had over 40 files completed (various classes, interfaces, DTOs, etc). He told me he is just a fast typist but I need to know the real deal. He hasn't been able to sustain that kind of productivity just the initial skeletal code but still, any ideas how he did this?

    Read the article

  • Facebook Privacy Permissions Design

    - by Ian
    Does anyone know the general layout of how facebook's privacy permissions system works (database)? I've been trying to figure out how they manage to have such a complex set of rules be applied to various content on their site, yet it remains fast. How are they doing that?

    Read the article

  • .NET Based Radio Automation

    - by Brent Pabst
    I'm curious if anyone has seen an Open Source radio automation package (I found one in Russian on CodePlex) built on .NET In addition if I wanted to build something like this in a client server environment is WCF and WPF the best way to do it? Is it fast enough to trigger songs to play/encode on the server from a remote WPF client? Sort of vague questions but I wanted to get some community feedback.

    Read the article

  • Determining if two lines intersect

    - by Faken
    I have two lines that extend to infinity but both have a starting point. They are both described by a starting point and a vector in the direction of the line extending to infinity. I want to find out if the two lines intersect but i don't need to know where they intersect (its part of a collision detection algorithm). Everything i have looked at so far describes finding the intersection point of two lines or line segments. Anyone know a fast algorithm to solve this?

    Read the article

  • Options for open source front end for C++

    - by Arpan
    I am looking for options for an open source C++ front end that I could customize for my requirements. I do not need the back end implementation, just that it would help to find a fast and relatively bug free C++ front end that supports most standard features. Any suggestions? [I did google, clang seems to be an option but I don't have any experience with llvm] Arpan

    Read the article

  • Opinions on commercial MVC controls

    - by Mark
    We are interested in the communities opinions on commercial MVC controls ie Telerik, Syncfusion. Which is fast, easy to use, stability, documentation, support and all that good stuff. We are about to start our second MVC project and are currently doing research into improving functionality and speed of development to 'standard' MVC. Any of your thoughts are much appreciated...

    Read the article

  • Where to put Assertions?

    - by sud03r
    Hi, Having assertions for unexpected conditions is considered to be good defensive coding practice. I happen to place assertions whenever i think something unexpected may happen, but that now seems to be an overkill to me. Additionally, sometimes mild unexpected conditions that don't necessarily lead to crash may even cause failure on customer end. Is there a hard and fast rule to put assertions? Thanks.

    Read the article

< Previous Page | 100 101 102 103 104 105 106 107 108 109 110 111  | Next Page >