Search Results

Search found 1337 results on 54 pages for 'sorted'.

Page 18/54 | < Previous Page | 14 15 16 17 18 19 20 21 22 23 24 25  | Next Page >

• Representing timezone list

  - by StasM

  I have a web application that allows the user to choose the timezone from the list. The list is very long (pretty much all CLDR-supported timezones). So the question is - how should I represent it? How should it be sorted - alphabetically or by timezone offset? What information should each item contain - offset, location, long name (like Europe/Zurich) or short name (like CET)? Should I display information about DST or only current offset? Let's say I can't right now do something like fancy maps OS configuration dialogs display, so the list is the only option. However I want to make the list look nice. Any best practices how it's done?

  Read the article

• Script to calculate the Median value for SQL Server data

  The standard SQL language has a number of aggregate functions like: SUM, MIN, MAX, AVG, but a common statistics function that SQL Server does not have is a built-in aggregate function for median. The median is the value that falls in the middle of a sorted resultset with equal parts that are smaller and equal parts that are greater. Since there is no built-in implementation for the median, the following is a simple solution I put together to find the median. Get smart with SQL Backup ProPowerful centralised management, encryption and more.SQL Backup Pro was the smartest kid at school. Discover why.

  Read the article

• Do I lose/gain performance for discarding pixels even if I don't use depth testing?

  - by Gajoo

  When I first searched for discard instruction, I've found experts saying using discard will result in performance drain. They said discarding pixels will break GPU's ability to use zBuffer properly because GPU have to first run Fragment shader for both objects to check if the one nearer to camera is discarded or not. For a 2D game I'm currently working on, I've disabled both depth-test and depth-write. I'm drawing all objects sorted by their depth and that's all, no need for GPU to do fancy things. now I'm wondering is it still bad if I discard pixels in my fragment shader?

  Read the article

• What are the key "connectors" for animation creation?

  - by qaisjp

  I'm creating an animation "engine" for a 2D game which loads a *.2dped file to load a character (it's body part positions, height, length of arm etc), and then a *.2difp to manipulate the body part positions. I'd like to know what the key body parts (bones, I mean) I should allow to be manipulated. My current list, sorted by ID's: 1: BONE_PELVIS1 2: BONE_PELVIS 3: BONE_SPINE1 4: BONE_UPPERTORSO 5: BONE_NECK 6: BONE_HEAD2 7: BONE_HEAD1 8: BONE_HEAD 21: BONE_RIGHTUPPERTORSO 22: BONE_RIGHTSHOULDER 23: BONE_RIGHTELBOW 24: BONE_RIGHTWRIST 25: BONE_RIGHTHAND 26: BONE_RIGHTTHUMB 31: BONE_LEFTUPPERTORSO 32: BONE_LEFTSHOULDER 33: BONE_LEFTELBOW 34: BONE_LEFTWRIST 35: BONE_LEFTHAND 36: BONE_LEFTTHUMB 41: BONE_LEFTHIP 42: BONE_LEFTKNEE 43: BONE_LEFTANKLE 44: BONE_LEFTFOOT 51: BONE_RIGHTHIP 52: BONE_RIGHTKNEE 53: BONE_RIGHTANKLE 54: BONE_RIGHTFOOT It's currently made to support real people, but am I going too accurate for a 2D character?

  Read the article

• Is using build-in sorting considered cheating in practice tests?

  - by user10326

  I am using one of the practice online judges where a practice problem is asked and one submits the answer and gets back if it is accepted or not based on test inputs. My question is the following: In one of the practice tests, I needed to sort an array as part of the solution algorithm. If it matters the problem was: find 2 numbers in an array that add up to a specific target. As part of my algorithm I sorted the array, but to do that I used Java's quicksort and not implement sorting as part of the same method. To do that I had to do: java.util.Arrays.sort(array); Since I had to use the fully qualified name I am wondering if this is a kind of "cheating". (I mean perhaps an online judge does not expect this) Is it? In a formal interview (since these tests are practice for interview as I understand) would this be acceptable?

  Read the article

• Player position triggering teleports

  - by jSherz

  I'm developing a Minecraft plugin (bukkit) in which a server admin can create 'portals' - a small region that will teleport any players who enter it. I have the teleportation sorted and I know how I could define areas that the player's position could be tested against. This would involve an ArrayList containing the zones and then hooking the PlayerMoveEvent so that the ArrayList is searched each time for a matching portal region. Although this method would work, I doubt that it would be very efficient when 100+ players are all moving around at the same time. Is there a better way of checking a player position against a set of 'zones' / regions?

  Read the article

• "Sorry, Ubuntu 12.04 has experienced an internal error."

  - by malapradej

  I have recently upgraded to Precise and had some errors. It seems to be quite random and with differences in the error reports. I have duly sent the reports hoping the system will have found the problem and sorted itself out. After the second error I am following the wizards (software...) advice and seeking help. The 1st time it happened I jotted down the following: ExecutablePath /usr/lib/tracker/tracker-extract LaunchPad bug 950765 AMD64 The second time the following: ExecutablePath /usr/share/appart/appart-gpu-error-intel.py "Possible GPU hang........" sandybridge-m-gt2 LaunchPad bug 981261 If there is anyone that can help it is much appreciated. I did not really want to upgrade at this stage, but was forced to due to the latest version of python-numpy in precise. You win some, you loose some.... Jacques I am using a Pavilion dv6 notebook and 64bit ubuntu 12.04 LTS

  Read the article

• In-memory DB to perform intersects on set slices

  - by IanC

  I have a specific programming need where I need to efficiently store large sorted sets in memory, query them for ranges, and intersect them against other sets that are also queried for ranged. I am looking at Redis, but I can't see a range slice command. MongoDB can only use 1 index, so it has to perform row-level scans, whereas I wish to process using columns that are intersected. I'm also looking at Counchbase, but can't easily determine from the documentation if it is suited to this. I know it uses Memcached, which is AFAIK not suited to this usage. Could anyone share potential solutions for this specific problem? EDIT For example, I need to perform the following: Get the IDs of all cars where the price is between 2000 and 3000, and intersect that will all cars where the engine capacity is between 3000 and 4000.

  Read the article

• 3 threads printing numbers of different range

  - by user875036

  This question was asked in an Electronic Arts interview: There are 3 threads. The first thread prints the numbers 1 to 10. The second thread prints the numbers 11 to 20. The third thread prints the numbers from from 21 to 30. Now, all three threads are running. The numbers are printed in an irregular order like 1, 11, 2, 21, 12 etc. If I want numbers to be printed in sorted order like 1, 2, 3, 4..., what should I do with these threads?

  Read the article

• TDD Exercise Ideas

  - by Dan

  I am about to give a TDD workshop. I have the theoretical part pretty much sorted out, but I wish to avoid typical Tic-tac-toe, Currency or god forbid Calculator exercise. Any suggestions for a good TDD exercise that can be ideally finished in a couple of hours? Oh, and one exercise per answer if you can!

  Read the article

• Custom sorting on UltraWebGrid - ASP .NET

  - by Leandro Fernandez

  How can I accomplish custom sorting on the Infragistics UltraWebGrid? I've tried to hadle the SortColumn event and it works, however, whenever I click the column header, the columns are sorted via JavaScript in the website before the event is fired in the server side? How do I stop the grid from sorting in the client? Thanks, Leandro Fernandez

  Read the article

• sort by date in caml query

  - by AB

  I want to sort my list items by date: I m using <OrderBy><FieldRef Name='SortDate' Ascending='True'/></Order By> but its giving me results randomly.Is it possible to sort by date in CAML if not then if there is any other way to retrieve list items sorted on the basis of date....

  Read the article

• SortedList porting to Silverlight

  - by VLK

  Dear all It looks SortedList is excluded.. What do you think most appropriate out of existing collections? (to keep the same fast access and changes) Can silverlight Dictionary be permanently sorted? Best regards VLK

  Read the article

• fastest way to sort the entries of a "smooth" 2D array

  - by Drew Wagner

  What is the fastest way to sort the values in a smooth 2D array? The input is a small filtered image: about 60 by 80 pixels single channel single or double precision float row major storage, sequential in memory values have mixed sign piecewise "smooth", with regions on the order of 10 pixels wide Output is a flat (about 4800 value) array of the sorted values, along with the indices that sort the original array.

  Read the article

• 2 dimensional array

  - by ankit

  $city=array('delhi','noida','mumbai','noida'); $name=array('ankit','atul','ramu','manu'); i want to create a 2 dimensional array using the two arrays above,with the name of the cities as keys and the corresponding names as the values.the names must be sorted. plz help me

  Read the article

• Fast file search algorithm for IP addresses

  - by Dave Jarvis

  Question What is the fastest way to find if an IP address exists in a file that contains IP addresses sorted as: 219.93.88.62 219.94.181.87 219.94.193.96 220.1.72.201 220.110.162.50 220.126.52.187 220.126.52.247 Constraints No database (e.g., MySQL, PostgreSQL, Oracle, etc.). Infrequent pre-processing is allowed (see possibilities section) Would be nice not to have to load the file each query (131Kb) Uses under 5 megabytes of disk space File Details One IP address per line 9500+ lines Possible Solutions Create a directory hierarchy (radix tree?) then use is_dir() (sadly, this uses 87 megabytes)

  Read the article

• Error while adding dynamic data to an existing web site - The method 'Skip' is only supported for so

  - by Vinay

  Hello All: I am creating an Asp.net web site which will support dynamic data. When I am creating a dynamic web site from Scratch (from template in VS) all is working fine. But when I am trying to add dynamic entity (.edmx) file and running the application I am getting following error "The method 'Skip' is only supported for sorted input in LINQ to Entities. The method 'OrderBy' must be called before the method 'Skip'. " Please help Thanks Vinay

  Read the article

• Core Data: NSFetchRequest sorting by count of to-many relationship

  - by Ben Reeves

  Say I have an parent entity, each of which have a number of children. I want to get all the parents sorted by their number of children. Something similar to the following pseudo code: NSEntityDescription * entity = [NSEntityDescription entityForName:@"Parent" inManagedObjectContext:managedObjectContext]; [[NSSortDescriptor alloc] initWithKey:@"children.count" ascending:NO]; //Execute request Is there a way construct a fetch like this using core data? Thanks, Ben

  Read the article

• Is it possible to do custom grouping in the ASP.NET ListView control?

  - by michielvoo

  You can only define a GroupItemCount in the ListView, but what if you want to do grouping based on a property of the items in the data source? Sort of an ad-hoc group by. The data source is sorted on this property. I have seen some examples where some markup in the ItemTemplate was conditionally show, but I want to leverage the GroupTemplate if possible. Is this possible?

  Read the article

• Hadooop map reduce

  - by Aina Ari

  Im very much new to map reduce and i completed hadoop wordcount example. In that example it produces unsorted file (with key value) of word counts. So is it possible to make it sorted according to the most number of word occurrences by combining another map reduce task to the earlier one. Thanks in Advance

  Read the article

• Determine duplicate record for duplicate and non-duplicate records

  - by gibboo

  I have a files containing both duplicate and non-duplicate records. The file is already sorted by a key. I want to determine those records that are duplicate and records that are non-duplicate. If duplicate the record is moved to a duplicate file and if non-duplicate that will be moved to valid file. I am using COBOL, and occurence of records for duplicate and non-duplicate is more than twice.

  Read the article

• Vertical index for TableViewControllers

  - by Martin

  Hello It may be quite easy to do, but I can't find out how : I want to add a vertical index in my sorted tableViewController, like in the "Contacts" application. Any idea ? Thks Martin

  Read the article

• Sort a data grid based on a specified column.

  - by o vamsi krishna

  Developed a winform project using VB 2008. I'm using a .xls sheet as source. My appln has 7 columns and unspecified rows. I want to sort all the columns based on a specified column and allot a serial number as per the sorted order. If two items in the specified column are same we should consider another column for the equal items and sort them in that order. plz help me in this issue.

  Read the article

• Query design in SQL - ORDER BY SUM() of field in rows which meet a certain condition

  - by Christian Mann

  OK, so I have two tables I'm working with - project and service, simplified thus: project ------- id PK name str service ------- project_id FK for project time_start int (timestamp) time_stop int (timestamp) One-to-Many relationship. Now, I want to return (preferably with one query) a list of an arbitrary number of projects, sorted by the total amount of time spent at them, which is found by SUM(time_stop) - SUM(time_start) WHERE project_id = something. So far, I have SELECT project.name FROM service LEFT JOIN project ON project.id = service.project_id LIMIT 100 but I cannot figure out how what to ORDER BY.

  Read the article

• How to let the sortedArrayUsingSelector using integer to sort instead of String?

  - by Tattat

  I have some data like this : 1, 111, 2, 333, 45, 67, 322, 4445 NSArray *array = [[myData allKeys]sortedArrayUsingSelector: @selector(compare:)]; If I run this code, it sorted like this: 1, 111, 2,322, 333, 4445, 45, 67, but I actually want this: 1, 2, 45, 67, 111, 322, 333, 4445 How can I implement it? thz u.

  Read the article

< Previous Page | 14 15 16 17 18 19 20 21 22 23 24 25  | Next Page >