Search Results

Search found 10991 results on 440 pages for 'stable sort'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 66/440 | < Previous Page | 62 63 64 65 66 67 68 69 70 71 72 73  | Next Page >

  • What FIX implementation do you recommend for use with .NET

    - by Ajaxx
    I am reviewing implementation choices for FIX when using .NET. A few obvious choices come to mind, but I want to know if there are other options, better choices or if we've made the same decision as a lot of you. QuickFIX - Stable, C++ implementation - so you've got unmanaged code to interop with. FIX4NET - C# implementation - seems to have some gaps in its implementation. DIY - Chime in here if you've made your own FIX engine Let me throw in some caveats here. I'm not looking for sub 100 microsecond processing. Performance is a requirement, but not so much that it's driving my decisions. A solid product that is stable, performs well and is flexible enough to deal with vendor specific dialects is the sweet spot. The more we can do in .NET the better.

    Read the article

  • Sorting a List based on an ArrayList within a custom Object

    - by Matt Weldon
    I am using a list to keep track of a number of custom Row objects as follows: Public Rows As List(Of Row)() Row has 2 properties, Key (a String) and Cells (an ArrayList). I need to be able to sort each Row within Rows based on a developer defined index of the Cells ArrayList. So for example based on the following Rows Row1.Cells = ("b", "12") Row2.Cells = ("a", "23") Rows.Sort(0) would result in Row2 being first in the Rows list. What would be the best way of going about implementing this? Thanks

    Read the article

  • Can I reuse my existing TCP-Server?

    - by Helper Method
    At the moment I have an existing application which basically consists of a desktop GUI and a TCP server. The client connects to the server, and the server notifies the client if something interesting happens. Now I'm supposed to replace the desktop GUI by a web GUI, and I'm wondering if I have to rewrite the server to send http packets instead of tcp packets or if I can somehow use some sort of proxy to grab the tcp packets and forward them to the web client? Do I need some sort of comet server?

    Read the article

  • Best programming based games

    - by Matt Sheppard
    Back when I was at school, I remember tinkering with a Mac game where you programmed little robots in a sort of pseudo-assembler language which could then battle each other. They could move themselves around the arena, look for opponents in different directions, and fire some sort of weapon. Pretty basic stuff, but I remember it quite fondly, even if I can't remember the name. Are there any good modern day equivalents?

    Read the article

  • Drupal 6 CCK - Having a textbox appear when 'Other' is selected

    - by espais
    I have a special content-type that I have created, and one of the fields is a radio button list. The last element is named 'Other' and I would like to have a textbox appear and allow the user to enter in a non-defined value. Is this sort of capability provided by any sort of module, or is this something that needs to be coded by hand? (If so, would you mind pointing me in the correct direction?)

    Read the article

  • Disable nested sorting in dojo enhancedGrid

    - by JJ
    I'm currently trying to disable the nested sorting, as it does not pass the parameters for the nested sort to the store url (only the first sorted column gets passed over). I tried to set "nestedSorting: false" in the grid setup (programmatically), but the sorting is still being showed in the grid headers. Isn't it possible to disable the nested sort?

    Read the article

  • Joomla Blog article layout order problem.

    - by invig
    I'm having problems with a Joomla install (problem exists in both 1.5.13 and 1.5.15) that won't order articles in a category or section blog layout. I've tried setting the sort order on the layout manually to all the different sort options but it has no effect. Ordering on the front page works fine. Any ideas?

    Read the article

  • Format a money field in SQL without converting to varchar?

    - by sdmadsen
    I need to be able to display a money field as $XX,XXX.XX, but without converting to varchar using total_eval = '$' + CONVERT(varchar(19),total_eval.opvValueMoney,1) My project uses sorting of the information after I pull this to sort the column and it doesn't sort correctly when the column is a varchar. Is there anyway to do this?

    Read the article

  • php extending but with a new constructor...possible?

    - by Patrick
    I have a class: class test { function __construct() { print 'hello'; } function func_one() { print 'world'; } } what I would like to do is a have a class that sort of extends the test class. I say 'sort of', because the class needs to be able to run whatever function the test class is able to run, but NOT run the construct unless I ask it to. I do not want to override the construct. Anyone has any idea how to achieve this?

    Read the article

  • Specify artifact version outside of pom

    - by Adam B
    Is there a way to specify the artifact version outside of the POM file? I have 2 CI projects that build an artifact. One builds a "stable" development version from a 'develop' branch and the other builds an unstable version which is the result of merging all active feature branches into the develop branch. I want the stable version to build as xyz-1.0.jar and the integration build to go in as xyz-1.0-SNAPSHOT.jar. Is there a way for the CI job to run a maven task or specify via the command line if a release or snapshot jar should be built without manually modifying the POM? Currently I have the version specified as 1.0 in the pom. I considered using the release plugin but I don't want the automatic version number increase and tagging that it does.

    Read the article

  • Searching and sorting by a float field with thinking sphinx

    - by nathan Verni
    I'm using thinking sphinx to for search on a rails app. I have a float field called 'height'. I need to be able to search this field for exact values (i.e. exactly 6.0, not 6.5). I also need to be able to sort on the field. What I have so far: indexes height, :sortable => true Problem: doesn't sort properly, returns 6.0 and 6.5 if I search for '6'

    Read the article

  • Simple to program yet computationally difficult functions

    - by ViralShah
    I need an example of a slow Excel sheet that could exist in the real world. Problem is I'm not sure what sort of functions are computationally difficult. Are there any sort of (maths?) functions that are easy enough to program that they can be used in Excel, yet computationally expensive? Something which has a real world application is a bonus.

    Read the article

  • Sorting mysql array value after string chars swapped from fetched DB data.

    - by Shail Patel
    I want to sort one column fetched from mysql DB, and stored in an array. After fetching I am doing below steps. 1- DB Fetching fields array in row format. ->Field1, Field2, Field3, Field4, Field5 2- From that fields array One columns data [Field3], swapping string keywords. eg. AB013, DB131, RS001 to->013AB, 131DB, 001RS Now I want to sort above value in new string format like-> 001RS, 013AB, 131DB

    Read the article

  • browser instant updates with ajax/jquery

    - by wcpro
    I'm trying to reverse engineer how facebook handles their notifications, where when you get a message you get instantly notified via the browser. I've fiddled with it for a little bit and realized that there is always a pending GET request "listening" if you will to some sort of update from the server. This appears to be some sort of observer pattern. I was just wondering if this pattern was documented somewhere.

    Read the article

  • Obtaining memory available to JVM at runtime

    - by Bo Tian
    I'm trying to sort a bunch of data such that that the size of data input to the program can be larger than the memory available to the JVM, and handling that requires external sort which is much slower than Quicksort. Is there any way of obtaining memory available to the JVM at runtime such that I could use in place sorting as much as possible, and only switch to Mergesort when data input is too large?

    Read the article

  • Arrange 0's & 1's in a array

    - by Ganesh M
    This is one of an interview question which I had recently. I would like to know others perception of approach for this problem. Question: You are given a structure which holds an employee details with two elements as int Deptartment and string Name. struct Employee { string Name; int Dept; } You are given details of N Employees among which there are N/2 employees Dept are 0's and N/2 employees dept are 1's arranged in some random order. You need to sort the employee details based on their Dept value and it should be stable i.e., the order of 1s and 0s in the original record should be maintained. For example, given the following sample data: Name Dept X1 0 X2 1 X3 0 X4 1 X5 0 after sorting the result should be: Name Dept X2 1 X4 1 X1 0 X3 0 X5 0 The algorithm should be stable and the complexity should be o(N), with constant space for additional variables (which means sorting should be done in-place).

    Read the article

  • How to upload a file with JQueryMobile for an iphone/ipad?

    - by JD
    Hi, I have just started looking at JqueryMobile and want to know if the following is possible? I want to be able to select a file (similar to in html) and then show some sort of dialogue that allows me to browse to a "folder" and select the file. It would then be up to me to send some sort of AJAX command to upload it to the server (where I am using Asp.net MVC 2) Since I do not have access to an iPhone or iPad, I was told that I would only have access to the documents folder. JD

    Read the article

  • How to prove worst-case number of inversions in a heap is O(nlogn)?

    - by Jacques
    I am busy preparing for exams, just doing some old exam papers. The question below is the only one I can't seem to do (I don't really know where to start). Any help would be appreciated greatly. Use the O(nlogn) comparison sort bound, the theta(n) bound for bottom-up heap construction, and the order complexity if insertion sort to show that the worst-case number of inversions in a heap is O(nlogn).

    Read the article

  • Android: Sorting a merged cursor

    - by tonyc
    Hi, I'm wondering if there's any way to merge two cursors together and then resort them. I can easily merge two cursors together by using a MergedCursor, but that doesn't sort them. I have two sets of contacts in two separate cursors (with totally different schemas) and I want to merge them and sort them by name (the name column is different in the two cursors). Is this possible? Thanks, Tony

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 62 63 64 65 66 67 68 69 70 71 72 73  | Next Page >