Search Results

Search found 5323 results on 213 pages for 'associated sorting'.

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

  • GetExitCodeProcess process termination status codes?

    - by Narcís Calvet
    Does anybody know where can I find a list of GetExitCodeProcess' process termination status codes? I've done some search in the internet and haven't been able to find one. I'm receiving a 33102 code from a GetExitCodeProcess call and I don't understand why. I hope getting a description for this error code will help me sorting this out.

    Read the article

  • Java and proxy's

    - by blueomega
    So i am testing a couple of API, and after sorting a couple of them, i am undecided between zemanta and opencalais. A can use both perfectly at home, but at the company behind the proxy, i can put them working, even when running the same examples. I am running this example http://philippeadjiman.com/blog/2009/09/16/open-calais-from-java-with-eclipse-extract-entities-facts-and-events-in-4-minutes/ and this http://developer.zemanta.com/wiki both java versions How can i setup the proxy so it works? blueomega

    Read the article

  • How do you display a binary search tree?

    - by fakeit
    I'm being asked to display a binary search tree in sorted order. The nodes of the tree contain strings. I'm not exactly sure what the best way is to attack this problem. Should I be traversing the tree and displaying as I go? Should I flatten the tree into an array and then use a sorting algorithm before I display? I'm not looking for the actual code, just a guide where to go next.

    Read the article

  • Mysql order by using two columns

    - by Krishna Priya
    Hi, I am using a table which has Createdon and Lastmodifiedon fields, I have to display first the newly added record based on createdon and then followed by lastmodifiedon records using mysql. I have tried adding "ORDER BY Createdon,Lastmodifiedon desc" at the end of the query;but sorting based on first column only occurs. Anyone please help in this issue Thanks.

    Read the article

  • CollectionViewSource & Selective Column Display

    - by Berryl
    By selective column display i mean the following: a control shows a listing of widgets (WidgetVm.DisplayName), with the default display name being in English (WidgetVm.EnglishName), but with the option to show the widget in French (WidgetVm.FrenchName). There also sorting and filtering available, which is why CollectionViewSource seems ideal. I know you can have multiple views over the same source but I haven't figured out how to do this yet. Is that the right approach to solving this? How? Cheers, Berryl

    Read the article

  • Monorail - Form submission using GET instead of POST

    - by Septih
    Hello, I'm writing some additions to a Castle MonoRail based site involving an Add and an Edit form. The add form works fine and uses POST but the edit form uses GET. The only major difference I can see is that the edit method is called with the Id of the object being edited in the query string. When the submit button is pressed on the edit form, the only argument passed is this object Id again. Here is the code for the edit form: <form action="edit.ashx" method="post"> <h3>Coupon Description</h3> <textarea name="comments" width="200">$comments</textarea> <br/><br/> <h3>Coupon Actions</h3> <br/> <div>Give Stories</div> <ul class="checklist" style="overflow:auto;height:144px;width:100%"> #foreach ($story in $stories.Values) <li> <label> #set ($associated = "") #foreach($storyId in $storyIds) #if($story.Id == $storyId) #set($associated = " checked='true'") #end #end <input type="checkbox" name="chk_${story.Id}" id="chk_${story.Id}" value="true" class="checkbox" $associated/> $story.Name </label> </li> #end </ul> <br/><br/> <div>Give Credit Amount</div> <input type="text" name="credit" value="$credit" /> <br/><br/> <h3>Coupon Uses</h3> <input type="checkbox" name="multi" #if($multi) checked="true" #end /> Multi-Use Coupon?<br/><br/> <b>OR</b> <br/> <br/> Number of Uses per Coupon: <input type="text" name="uses" value="$uses" /> <br/> <input type="submit" name="Save" /> </form> The differences between this and the add form is the velocity stuff to do with association and the values of the inputs being from the PropertyBag. The Method dealing with this on the controller starts like this: public void Edit(int id) { Coupon coupon = Coupon.GetRepository(User.Site.Id).FindById(id).Value; if(coupon == null) { RedirectToReferrer(); return; } IFutureQueryOfList<Story> stories = Story.GetRepository(User.Site.Id).OnlyReturnEnabled().FindAll("Name", true); if (Params["Save"] == null) { ... } } It reliably gets called but a breakpoint on the Params["Save"] lets me see that the HttpMethod is "GET" and the only arguments passed (In the Form and the Request) are the object Id and additional HTTP headers. At the end of the day I'm not that familiar with MonoRail and this may be a stupid mistake on my behalf, but I would very much appreciate being made a fool out of if it fixes the problem! :) Thanks

    Read the article

  • jquery tablesorter problem in FF only - header row disappears after show-hide of rows

    - by dac
    When the page loads, all the records show. Sorting works great until show-hide is used to filter the rows so only some show. Then the header row--with the arrows for sorting--DISAPPEARS. The problem is only in Firefox. It works great in IE7 and IE8. I'm using jQuery 1.4.2 from google. Code for show-hide $(document).ready(function() { // show all the rows $("#org_status tr").show(); //find selected filter $("#filter_status a").click(function(evt) { evt.preventDefault(); $("#org_status tr").hide(); var id = $(this).attr('id'); $("." + id).show(); }); }); Here is the HTML: <!-- show-hide "buttons" --> <p id='filter_status'>Filter by status: <a href='#' id='All'>All</a> <a href='#' id='Active'>Active</a> <a href='#' id='Inactive'>Inactive</a> <a href='#' id='Pending'>Pending</a> </p> <!-- table to sort -> <table id='org_status' class='info_table tablesorter'> <thead> <tr> <th class='org-name-col'>Name</th> <th class='org-status-col'>Status</th> </tr> </thead> <tbody> <tr class='All Active'> <td><a href='admin/org_edit.php?org=29'>Foo Net</a></td> <td>Active</td>"; </tr> <tr class='All Inactive'> <td><a href='admin/org_edit.php?org=22'>Bar</a></td> <td>Active</td>"; </tr> <tr class='All Pending'> <td><a href='admin/org_edit.php?org=11'> Bar Foo Very Long Org Name Goes Here</a></td> <td>Active</td>"; </tr> </tbody> </table>

    Read the article

  • mysql datetime performance

    - by praksant
    Hi, since in mysql datetime field is represented as string (i'm not sure how it works internally), wouldn't be from performance point of view faster to store date as unix timestamp? I don't need to use any mysql native date functions, i'm going for performance of sorting and selecting data. if there was an index for that column, would be difference between int and datetime? Thank you

    Read the article

  • What is the need of collection framework in java?

    - by JavaUser
    Hi, What is the need of Collection framework in Java since all the data operations(sorting/adding/deleting) are possible with Arrays and moreover array is suitable for memory consumption and performance is also better compared with Collections. Can anyone point me a real time data oriented example which shows the difference in both(array/Collections) of these implementations. Thx

    Read the article

  • Why doesn't SQL DISTINCT work with ORDER BY CAST?

    - by Tommy
    Including DISTINCT to an SQL query that also uses ORDER BY CAST(thecolumn AS int) as shown here seems to remove that sorting functionality. Any reason these cant work together? (Using sqlite with the C api) Thanks. EDIT: Started with - sprintf(sql, "SELECT DISTINCT rowX FROM TableX Order By Cast(rowX As int) LIMIT 150 OFFSET %s;", Offset); rowX is Type CHAR(5)

    Read the article

  • unsort Hashtable

    - by user222820
    hi there i am writing a program in C# i have a code like this Hashtable ht = new Hashtable(); ht.Add("1", "One"); ht.Add("2", "Two"); ht.Add("3", "Three"); ht.Add("4", "Four"); but Compiler sort it i wanna know how can i prevent sorting hashtable please help me

    Read the article

  • Splitting a list in python

    - by mglmnc
    Hey im new to python. How do you get a portion of a list by the relative value of its sorting key. example... list = [11,12,13,14,15,16,1,2,3,4,5,6,7,8,9,10] list.sort() newList = list.split("all numbers that are over 13") assert newList == [14,15,16]

    Read the article

  • Find the element with the most "neighbors" in a sequence

    - by Bao An
    Assume that we have a sequence S with n elements <x1,x2,...,xn>. A pair of elements xi,xj are considered neighbors if |xi-xj|<d, with d a given distance between two neighbors. So how can find out the element that has most neighbors in the sequence? (A simply way is sorting the sequence and then calculating number of each element but it's time complexity is quite large): O(nlogn) May you please help me find a better way to reduce time complexity?

    Read the article

  • (C#) Tree sort, seeking some information.

    - by Sef
    Hello i am currently written a summary of all different kinds of sorting algorithems and their description/function/advantages & disadvantages. Although i have found everything i seek exept for tree sort. I can barely find anything at all about this subject. Some small description & algoritme / short&small program would be very much appreciated. Cheers.

    Read the article

  • OK Programming language from USB stick with no installation

    - by tovare
    I'm looking for a compiler or interpreter for a language with basic math support and File IO which can be executed directly from a memorystick in either Linux or Windows. Built in functionality for basic datastructures and sorting/searching would be a plus. (I've read about movable python, but it only supports windows) Thank you

    Read the article

  • php code to return xml

    - by anwar
    hi there i have a question and need help on this from you guys . I have a database created for a game called gamesleaderboard and the fields are id, player_name, score, leveltime. and my task is after getting the score, i have to insert it to a database and sort the dbase accordingly. after sorting, the code will return an xml in the following structure: Ahmad100080 Basel95090 Samer920100 Seyd900110 Ahmad100080 Basel95090 Samer920100 Seyd900110 Ahmad100080 Basel95090 plz tell me the necessary details how to do this thankyou.

    Read the article

  • segmented reduction with scattered segments

    - by Christian Rau
    I got to solve a pretty standard problem on the GPU, but I'm quite new to practical GPGPU, so I'm looking for ideas to approach this problem. I have many points in 3-space which are assigned to a very small number of groups (each point belongs to one group), specifically 15 in this case (doesn't ever change). Now I want to compute the mean and covariance matrix of all the groups. So on the CPU it's roughly the same as: for each point p { mean[p.group] += p.pos; covariance[p.group] += p.pos * p.pos; ++count[p.group]; } for each group g { mean[g] /= count[g]; covariance[g] = covariance[g]/count[g] - mean[g]*mean[g]; } Since the number of groups is extremely small, the last step can be done on the CPU (I need those values on the CPU, anyway). The first step is actually just a segmented reduction, but with the segments scattered around. So the first idea I came up with, was to first sort the points by their groups. I thought about a simple bucket sort using atomic_inc to compute bucket sizes and per-point relocation indices (got a better idea for sorting?, atomics may not be the best idea). After that they're sorted by groups and I could possibly come up with an adaption of the segmented scan algorithms presented here. But in this special case, I got a very large amount of data per point (9-10 floats, maybe even doubles if the need arises), so the standard algorithms using a shared memory element per thread and a thread per point might make problems regarding per-multiprocessor resources as shared memory or registers (Ok, much more on compute capability 1.x than 2.x, but still). Due to the very small and constant number of groups I thought there might be better approaches. Maybe there are already existing ideas suited for these specific properties of such a standard problem. Or maybe my general approach isn't that bad and you got ideas for improving the individual steps, like a good sorting algorithm suited for a very small number of keys or some segmented reduction algorithm minimizing shared memory/register usage. I'm looking for general approaches and don't want to use external libraries. FWIW I'm using OpenCL, but it shouldn't really matter as the general concepts of GPU computing don't really differ over the major frameworks.

    Read the article

  • Fixed Header And Footer For GridView

    - by BABA
    I have a gridview and for client side sorting i am using the Jquery tablesorter plugin. Now i want the header and footer of the grid to be fixed and the rows to be scrolled. Can anybody help me out? Thanks in advance...

    Read the article

  • Resources needed: Sort 2D array "graphically"

    - by aw
    I have a 2D array 1 2 3 4 5 6 7 8 9 and want to sort it like this Snake 1 2 3 8 9 4 7 6 5 Snake (different) 1 2 3 6 5 4 7 8 9 Rotated 1 4 7 2 5 8 3 6 9 Wipe (diagonal) 1 3 6 2 5 8 4 7 9 Well, you got it, all kinds of sorting. Searching the interweb for hours now. Any resources (specific language or pseudo code) on that greatly appreciated...

    Read the article

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