fast

how to use scala internals to compile source faster than fsc (fast scala compiler)

fsc (fast scala compiler) is faster than scalac. but during TDD cycles i consume 3 seconds to compile sources over less than 1s to run my tests.. suggestion to reduce compile time near 0? obviously, buy a faster computer is not an answer :) i mean use some scala internals to compile source faster as possible ...

Counting sentences: Database (like h2) vs. Lucene vs. ?

Hi all, I am doing some linguistic research that depends on being able to query a corpus of 100 million sentences. The information I need from that corpus is along the lines: how many sentences had "john" as first word, "went" as second word and "hospital" as the fifth word...etc So I just need the count and don't need to actually retri...

Which has been the most reliable, fastest Windows C++ profiler that you have used?

I need to profile a real time C++ app on Windows. Most of the available profilers are either terribly expensive, total overkill, or both. I don't need any .NET stuff. Since it is a real time app, I need the profiler to be as fast as possible. It would be excellent if it integrated in some way with Visual Studio 2005/2008, but that's not ...

Google Search Appliances versus Microsoft Enterprise Search (FAST)

I am .NET developer and I have been working with various search providers but Google Search Appliance/Mini has been always the best fit for requirements when implementing enterprise level search. I have not worked yet on Microsoft Enterprise Search so I would like to hear developers experiences on it. These days I am getting a lot Enter...

Fast Oracle Select [Huge Data]

I have a project whereby I'm reading huge volumes of data from an Oracle database from Java. I have the feeling that the application we are writing is going to process the data far faster than it will be given to us using a single threaded SELECT query and so I've been trying to research faster ways of obtaining the data. Does anyone h...

Fast file access options needed

Hi friends, I want my code to process a file very fast. This file size will vary from single KB to even 2 GB. Even i am ready to create a separate file system for that single file. I will split the file as constant size blocks(probably 8KB) and access it for data read and write. The code wise, the algorithm cannot be changed because i...

C++: Best text accumulator

Text gets accumulates piecemeal before being sent to client. Now we use own class that allocates memory for each piece as char massive. (Anyway, works like char[][] + std::list<char*>). Then we build the whole string, convert it into std::sting and then create boost::asio::streambuf using it. That's slow enough, I assume. Correct me if...

Storing index values in FAST-ESP without modifications

Hi, first of all I'm totally new to FAST but I already have a couple of issues I need to solve, so I'm sorry if my questions are very basic =) Well, the problem is that I have a field in the FAST index which in the source document is something like "ABC 12345" (please note the intentional whitespaces) but when stored in the index is i...

jquery clickling fast

Hi. I have this function, that adds 31px to my style bottom on ul. It works fine, but if I click fast, it no longer adds 31px, but some weird number like 17.423px. I guess it's because the animation isn't done, and thereby by clicking fast it adds 31px to the current px amount. My thought is that I need to insert a stop(). But where? Th...

Fastest way to print a blank line?

How can I print a blank line at some line with one pressing while not in the insert mode?And after that I should still be in normal mode. ...

Is there any super fast algorithm for finding LINES on picture?

So I have Image like this I want to get something like this (I hevent drawn all lines I want but I hope you can get my idea) I need some super fast algorithm for finding all straight lines on it. I want to give to algorithm parameters like min length and max line distortion. I want to get relative to picture pixel coords start and...

Best database (mysql) structure for this case:

we have three types of data (tables): Book (id,name,author...) ( about 3 million of rows) Category (id,name) ( about 2000 rows) Location (id,name) ( about 10000 rows) A Book must have at least 1 type of Category (up to 3) AND a Book must have only one Location. I need to correlate this data to get this query faster: Se...

complex mysql rank !

I have a table with these columns: win, los, id ... I want to order the table by this index: win / ( win + los ) * 30 + win / SUM(win) * 70 and then to find the rank for two id's. I'm not very good on mysql, so what I wrote is totally wrong. (It uses Perl + DBI + DBD::mysql): $stmt=$con->prepare("SET @rk := 0"); $stmt=$con->prep...

fast scroll custom thumb

Hi, how can i set custom thumb for fast scroll in listview. ...

fastest way to get parent array key in multidimensional arrays with php

what is the best way to get parent array key with multidimensional arrays? for example I have this array: array( [0] => array(0=> sample, 1=>picture, 2=>frame, 3=>google) [1] => array(0=> iphone, 1=>orange, 2=>love, 3=>msn) [2] => array(0=> joe, 1=>geee, 2=>panda, 3=>yahoo) ) now I need to search for example google and ...

c++ Sorting a vector based on values of other vector, or what's faster?

Hi, There are a couple of other posts about sorting a vector A based on values in another vector B. Most of the other answers tell to create a struct or a class to combine the values into one object and use std::sort. Though I'm curious about the performance of such solutions as I need to optimize code which implements bubble sort to ...

What sorting method to use: quicksort, bucket sort, radix, ... for tiny data pairs? (c++)

Hi, I need to optimize some code that sorts a vector<pair<int, float >>a where the pairs needs to be sorted on the float value. The vector will have an length between 0 and 5. I've been googling and reading up on sorting methods in C++ but cannot find any benchmarks on sorting tiny data sets. For the system it's important be as fast as ...

what's more efficient? checking == or just mutating the variable?

Imagine I had a variable called X. Let's say every 5 seconds I wanted to make X = true. (it could be either true or false in between these 5 seconds, but gets reset to true when the 5 seconds are up). Would it be more efficient to check if the value is already true, then if not, reassign it to true? Or just have X = true? in other word...

Sharepoint 2010: Full text plus faceted search over an External Content List using Search Services (or possibly FAST)

I have an External List over a products table in our database. I want to be able to build a search form over it via a full text search; in addition to being able to filter down on properties on my initial search. For example, say I'm looking for DVDs under 10.00 in product DB. I want to be able to have a search box where I enter "DVD OR...

jquery dragging object fast problem

If I drag an object very slow, it does exactly what I want it to do. However, if I do it a bit faster or very fast, it does not work as expected. You can see both results: the expected, while dragging slow and the flawless, when dragging fast. I am just a jquery beginner, if you see any other stupid parts of the JS code, please let me kn...