Search Results

Search found 9563 results on 383 pages for 'insertion sort'.

Page 9/383 | < Previous Page | 5 6 7 8 9 10 11 12 13 14 15 16  | Next Page >

• Apple sort la bêta d'iOS 6.1 pour les développeurs, ainsi que la bêta de Xcode 4.6

  Apple sort la bêta d'iOS 6.1 pour les développeurs ainsi que la bêta de Xcode 4.6 À peine avoir propulsé la mise à jour mineure iOS 6.0.1 de son système d'exploitation mobile aux consommateurs, Apple met à la disposition des développeurs la prochaine évolution de sa plateforme. Ceux-ci peuvent dès aujourd'hui télécharger la mise à jour iOS 6.1, afin de découvrir les nouveautés de l'OS et préparer leurs applications avant la sortie grand public de la mouture. iOS 6.1 beta apporte quelques améliorations, surtout à son application native de cartographie Plans, très critiquée dans la version précédente. Il faut noter qu'Apple a mis avant un bouton permettant de soumettre un problème s...

  Read the article

• La fondation Eclipse sort Eclipse Juno 3.8 /4.2, une double version de l'EDI riche en nouveautés

  La fondation Eclipse sort Eclipse Juno 3.8 /4.2 La fondation Eclipse vient de sortir la version Juno d'Eclipse. Une nouvelle version d'Eclipse est disponible. Elle porte le nom de Juno. Cette version est en fait une double version, puisque nous avons droit à la fois à la version 3.8 ainsi qu'à la version 4.2. Il faut savoir que la version 3.8 est la dernière "version" pour Eclipse 3.XX. Des versions de maintenance sont prévue pour la 3.8, mais aucune version majeure supérieure n'est prévue dans les 3.XX. Cela tient d'une volonté de la fondation Eclipse de basculer majoritairement sur les versions 4.XX. La version 4 (précédemment baptisé e4) d'Eclipse est en développement depuis 4 ans et const...

  Read the article

• Sort method versus OrderBy LINQ extension method

  - by nmarun

  I have a class Product with an Id and a Name as properties. There are multiple ways of getting a list of products to display in sorted/ordered fashion, say, by the Name of the product. The two I’m concerned about here are the Sort and the OrderBy extension method through LINQ and the difference between them. 1: public class Product 2: { 3: public int Id { get; set; } 4: public string Name { get; set; } 5: } Below is the list of products that I’ll be using and is defined somewhere in the Program.cs...(read more)

  Read the article

• Google sort Maps Tracks et Maps Geolocation, des APIs permettant l'ajout de "l'intelligence géospatiale" aux applications

  Google sort Maps Tracks et Maps Geolocation des APIs permettant l'ajout de "l'intelligence géospatiale" aux applications Google vient de sortir deux nouvelles APIs pour les développeurs utilisant sa plateforme de cartographie. Les APIs Google Maps Tracks et Google Maps Geolocation permettront aux entreprises d'utiliser en temps réel les informations de géolocalisation de Google Maps pour rendre leurs applications plus fluides et efficaces. L'API Google Maps Tracks pourra être utilisée pour créer des applications capables de stocker, d'analyser et d'afficher des données GPS sur une carte. Construite au dessus de l'infrastructure Cloud de Google, cette API ...

  Read the article

• Microsoft sort une version d'évaluation de Windows Server 2008 R2 Hyper-V, sa solution de virtualisa

  Mise à jour du 30/03/10 Microsoft sort un ensemble de solutions pour la virtualisation dans Windows Server 2008 R2 Découvrez Windows Server 2008 R2 Hyper-V, System Center et Live Migration Microsoft semblait vouloir mettre les bouchées double dans la virtualisation du poste de travail aussi bien dans Windows 7 que dans Windows Server 2008 R2 (lire ci-avant). Il le confirme aujourd'hui en proposant de découvrir son nouvel ensemble de solutions de virtualisation pour ce dernier. Avec Hyper V, la virtualisation de serveur devient en effet une fonction de base de Windows Server 2008 R2. "Vous pouvez donc consolider sans surcoût vos serveurs phy...

  Read the article

• Microsoft sort un SDK pour SQL Server Reporting Services, qui permet l'interopérabilité avec les API

  Microsoft sort un SDK pour SQL Server Reporting Services, qui permet l'interopérabilité avec les API en PHP Microsoft a sorti ce matin un SDK gratuit pour SQL Server Reporting Services qui est compatible PHP. Ce toolkit permet aux développeurs de créer des applications tournant sous Microsoft SQL Server Reporting Services, tout en boostant l'interopérabilité entre les applications en PHP et les logiciels de Microsoft dédiés au reporting et à la business intelligence. Les rapports peuvent être réalisés puis intégrés avec des applications d'entreprise en ligne, ce qui offre un meilleur accès aux informations contenant des données graphiques et du contenu riche, d'après Microsoft. Les développeurs travaillant avec PHP p...

  Read the article

• AMD sort l'APU Z-60, un processeur spécialement conçu pour Windows 8

  AMD sort l'APU Z-60 un processeur spécialement conçu pour Windows 8, la société dévoile son fer de lance pour la conquête du marché des tablettes Tout comme Intel, AMD espère surfer sur la vague Windows 8 pour se faire une place dans le marché des tablettes largement dominé par les architectures ARM. Le constructeur vient de présenter sa gamme de processeurs Hondo accelerated processor unit (APU), spécialement conçue pour les tablettes Windows 8. L'APU Z-60 utilise la même architecture que le Z-01, premier processeur d'AMD pour les tablettes. Comme les puces Clover Trail d'Intel, le Z-60 est une solution dual-core qui dispose d'un processeur Hondo regroupant deux coeurs...

  Read the article

• Chrome débarque sur iPhone et sur iPad et sort de sa phase bêta sur Android

  Chrome débarque sur iPhone et iPad Et sort de sa phase bêta sur Android Alors que Mozilla travaille sur une pré-version de Firefox pour iPad, Google lui vient d'annoncer la première version de Chrome pour la tablette d'Apple, mais aussi pour l'iPhone. Pour Google, le but affiché est de pouvoir synchroniser les différentes expériences de navigation (PC et mobiles) des utilisateurs, quelques soient les marques des appareils qu'ils possèdent. Il est aussi ? et surtout ? de continuer à gagner des parts de marché en surfant sur la popularité toujours grandissante de iOS.

  Read the article

• Open webOS sort en version bêta et en deux solutions : sous Ubuntu et pour l'environnement "OpenEmbedded"

  Open webOS sort en version bêta et en deux solutions Sous Ubuntu et pour l'environnement "OpenEmbedded" Il y a de cela huit mois, l'équipe du projet webOS avait promis à ses adaptes ainsi qu'à la communauté open source de lancer une version libre du système d'exploitation pour appareils mobiles. [IMG]http://idelways.developpez.com/news/images/openwebos-logo.png[/IMG] Chose promise, chose due, car après beaucoup d'efforts, une version bêta de l'Open webOS est enfin disponible. Sur le blog du projet Open webOS, l'équipe indique que cette version, dite « August Edition », comporte 54 composants webOS disponibles en open source. Cela c...

  Read the article

• Oracle sort ADF Essentials, une version gratuite de son Framework MVC de développement Java

  Oracle sort ADF Essentials une version gratuite de son Framework MVC de développement Java Oracle a publié une version gratuite de son Framework de développement Java ADF (Application Development Framework). Oracle ADF est une plateforme de développement reposant sur le standard JEE (Java Enterprise Edition) et les technologies open source, permettant de simplifier et accélérer la mise au point d'applications orientées services. ADF est basé sur l'architecture MVC (Model View Controller) et implémente par défaut des routines couramment utilisées comme l'authentification utilisateur, des couches de sécurité, etc. Le Framework est utilisé en interne par Oracle pour plusieurs de se...

  Read the article

• WordPress sort en version 3.5 : meilleure gestion de contenus multimédias, du mobile et des écrans Retina

  WordPress sort en version 3.5 meilleure gestion de contenus multimédias, du mobile et des écrans Retina WordPress, le plus populaire des scripts de blogs PHP, est disponible en version 3.5, et arbore fièrement le nom de code "Elvin" en l'honneur ou batteur Elvin Jones. La dernière version majeure du système de gestion de contenu pour cette année apporte un nombre important de nouveautés et des corrections de bogues pour le plus grand plaisir des développeurs et blogueurs. Wordpress 3.5 introduit une nouvelle expérience simplifiée pour la gestion de contenus multimédias. Le système dispose d'un nouvea...

  Read the article

• Oracle sort précipitamment OpenOffice 3.3, 24 heures après l'arrivée de LibreOffice 3.3

  Oracle sort précipitamment OpenOffice 3.3, 24 heures après l'arrivée de LibreOffice 3.3 Mise à jour du 28.01.2011 par Katleen Oracle vient de sortir la version 3.3 de sa suite bureautique libre OpenOffice.org. Cette mise à disposition du public à presque été passée sous silence tant elle fut discrète. Elle semble avoir été précipitée et pas très bien organisée. Quoiqu'il en soit, cette nouvelle mouture ( tournant sous Windows, Linux -x86 32 bits et 64 bits-,Mac OS X -x86 et PowerPC- et Solaris -x86 et SPARC-). apporte plusieurs nouveautés : - renforcement de la protection des documents du tableur et du traitement de texte - possibilité de gére...

  Read the article

• Disable "Ubuntu 14.04" and "Files" from auto sorting alphabetically and THEN<(Disable the then.) automatically going to that location

  - by Doodski Man

  I looked about in Ubuntu 14.04 and I could not find a option to disable a feature that made extra work for me. After renaming something "Files" then reorganizes alphanumerically and then automatically moves the prompt/cursor/highlighting to the new file name at the new alphanumerical location. It's much easier and practical if the working cursor remains in the same area where the file was found that needed name changes or needed name spelling corrections. Windows 7 does what I ask about and it's a huge improvement over that auto sort and then go to the new file location. A example to consider is a file is in the "A" area and then you rename it to a "Z" and you are then taken to the "Z" stuff and need to scroll hundreds of lines back to the "A" section. It's annoying. Thanks for reading and taking the time.

  Read the article

• Ubuntu 12.10 brise la barrière entre PC et Web, Quantal Quetzal sort avec sa déclinaison serveur

  Ubuntu 12.10 brise la barrière entre PC et Web Quantal Quetzal sort avec Web Apps, Dash et bien plus, la version serveur de l'OS disponible Quatre mois après avoir pointé le bout de son nez en version Alpha, Ubuntu 12.10 « Quantal Quetzal » est prêt pour une utilisation par le grand public. Ubuntu 12.10 marque une étape importante de la symbiose entre Cloud, Web et Desktop entreprise par Canonical. Cette mouture fournit une intégration étroite entre les environnements de bureau, les applications Web et les plateformes de Cloud. La nouvelle fonctionnalité Web Apps du système d'exploitation offre une intégration dans le bureau des applications Web comme Twitter, Gmail ou encore Face...

  Read the article

• Entity framework 4 many-to-many insertion?

  - by Saxman

  Hi all, I'm not very familiar with the many-to-many insertion process using Entity Framework 4, POCO. I have a blog with 3 tables: Post, Comment, and Tag. A Post can have many Tags and a Tag can be in many Posts. Here are the Post and Tag models: public class Tag { public int Id { get; set; } [Required] [StringLength(25, ErrorMessage = "Tag name can't exceed 25 characters.")] public string Name { get; set; } public virtual ICollection<Post> Posts { get; set; } } public class Post { public int Id { get; set; } [Required] [StringLength(512, ErrorMessage = "Title can't exceed 512 characters")] public string Title { get; set; } [Required] [AllowHtml] public string Content { get; set; } public string FriendlyUrl { get; set; } public DateTime PostedDate { get; set; } public bool IsActive { get; set; } public virtual ICollection<Comment> Comments { get; set; } public virtual ICollection<Tag> Tags { get; set; } } Now when I'm adding a new post, I'm not sure what would be the right way to do. I'm thinking that I'll have a textbox where I can select multiple tags for that post (this part is already done), in my controller, I will check to see if the tag is already exists or not, if not, then I will insert the new tag. But I'm not even sure based on the models that I've created for EF, will they create a PostsTags table, or they are creating just a Tags and a Posts table and links between the two? How would I insert the new Post and set the tags to that post? Is it just newPost.Tags = Tags (where Tags are the one that got selected, do I even need to check to see if they already exists?), and then something like _post.Add(newPost);? Thanks.

  Read the article

• Form loop db insertion + javascript altering

  - by MrStatic

  I basically need to check if there is an easier way to do this before I rewrite all the code. I have a fairly large form that I have each input named with []'s on the end so I can loop through via php for easy insertion. <input type="hidden" name="currentdate[]" value="<?php echo date('mdY'); ?>"> <td><input style="width: 50px" type="text" name="jackname[]" /></td> <td><input style="width: 20px" type="text" name="jackkey[]" /></td> <td><input style="width: 50px" type="text" name="jackbeg[]" /></td> <td><input style="width: 50px" type="text" name="jackend[]" /></td> <td><input style="width: 50px" type="text" name="jackbegveh" /></td> <td><input style="width: 50px" type="text" name="jackbegmon[]" /></td> <td><input style="width: 50px" type="text" name="jackendveh" /></td> <td><input style="width: 50px" type="text" name="jackendmon[]" /></td> <td><input style="width: 50px" type="text" name="jacktx" disabled /></td> There are quite a few more fields but you get the idea. I then use foreach ($_POST['jackname'] as $row=>$name) { $jackname = $name; $date = $_POST['currentdate'][$row]; $jackkey = $_POST['jackkey'][$row]; $jackbeg = $_POST['jackbeg'][$row]; $jackend = $_POST['jackend'][$row]; $jackbegveh = $_POST['jackbegveh'][$row]; $jackbegmon = $_POST['jackbegmon'][$row]; $jackendveh = $_POST['jackendveh'][$row]; $jackendmon = $_POST['jackendmon'][$row]; $jacktx = $_POST['jacktx'][$row]; if ($jacktx == '') { $jacktx = '0'; } if (empty($jackkey)) { echo 'Skipped empty! <br />'; } else { mysql_query("INSERT INTO `ticket_counts_jackson` VALUES('', '" . $date . "', '" . $jackname . "', '" . $jackkey . "', '" . $jackbeg . "', '" . $jackend . "', '" . $jackbegveh . "', '" . $jackbegmon . "', '" . $jackendveh . "', '" . $jackendmon . "', '" . $jacktx . "')", $mysql_link) or die(mysql_error()); echo 'Added the info the db! <br />'; } } I use the above to loop through the form and add it to the database. Now for my main question. I also want to add in some javascript to do a little math. Basically ($jackendveh - $jackbegveh) - ($jackendmon - $jackbegmon) and have that displayed in jacktx. Currently the only way I know of adding in the math calculations is to rename each input to a unique name and then rewrite my insert from 1 insert to 8 inserts.

  Read the article

• Pivot table not refreshing sort order

  - by William Anthony

  I have Pivot Table that get its data source from another sheet, same workbook. I want the sort order of data is same as the data source order, I choose "Sort in data source order" in Pivot Table option. The problem is, when I change the data order on data source worksheet, then I refresh the Pivot Table, the sort order didn't change. I googled that the Pivot Table should be unlink first then re-link again in order to work properly, so I tried the following: The original data source has named range: origdata. The fake data source has names range: dummydata I changed manually data source to dummydata then changed back to origdata. The sort order did change as expected. Now I want to make the operation automated, so I'm using this code in Worksheet.activate event. Note that, PT is PivotTable instance. ... PT.SourceData = "dummydata" PT.RefreshTable PT.SourceData = "origdata" PT.RefreshTable ... Change data source from VBA didn't change the sort order just like I did with manual method. Why is that? Am I missing something? Maybe there are some routine called when I changed the data source manually via toolbar button? Thanks in advance for your help.

  Read the article

• Bubble sorting my array does not sort it

  - by Trixmix

  I sort an array of chunks by doing this: for (int i =0; i<this.getQueue().size();i++) { for (int j =0; j<this.getQueue().size()-i-1;j++) { Chunk temp1 = this.getQueue().get(i); Chunk temp2 = this.getQueue().get(i+1); if (temp1 != null &&temp2 != null && temp2.getLocation().getY() < temp1.getLocation().getY()) { this.getQueue().set(i, temp2); this.getQueue().set(i+1, temp1); } } } What I want is the the chunks with the lowest Y coordinate will be at the start of the array and the ones with the bigger Y coordinate will be at the end of the array. And this is my result: 1024.0 944.0 1104.0 944.0 1104.0 ----BEFORE----- 944.0 1024.0 944.0 1104.0 1104.0 ---AFTER--- Why is this not working It seams fine. I dont want to use a comparator so dont suggest it. More info, the Y cords are floats. I got the result by for each looping on this queue and printed the Y locations.

  Read the article

• C programming: hashtable insertion/search

  - by Ricardo Campos

  Hello i have a problem with my hash table its implemented like this: #define HT_SIZE 10 typedef struct _list_t_ { char key[20]; char string[20]; char prevValue[20]; struct _list_t_ *next; } list_t; typedef struct _hash_table_t_ { int size; /* the size of the table */ list_t ***table; /* first */ sem_t lock; } hash_table_t; I have a Linked list with 3 pointers because i want a hash table with several partitions (shards), here is my initialization of my Hash table: hash_table_t *create_hash_table(int NUM_SERVER_THREADS, int num_shards){ hash_table_t *new_table; int j,i; if (HT_SIZE<1) return NULL; /* invalid size for table */ /* Attempt to allocate memory for the hashtable structure */ new_table = (hash_table_t*)malloc(sizeof(hash_table_t)*HT_SIZE); /* Attempt to allocate memory for the table itself */ new_table->table = (list_t ***)calloc(1,sizeof(list_t **)); /* Initialize the elements of the table */ for(j=0; j<num_shards; j++){ new_table->table[j] = (list_t **)calloc(1,sizeof(list_t *)); for(i=0; i<HT_SIZE; i++){ new_table->table[j][i] = (list_t *)calloc(1,sizeof(list_t )); } } /* Set the table's size */ new_table->size = HT_SIZE; sem_init(&new_table->lock, 0, 1); return new_table; } Here is my search function to search in the hash table list_t *lookup_string(hash_table_t *hashtable, char *key, int shardId){ list_t *list ; int hashval = hash(key); /* Go to the correct list based on the hash value and see if key is * in the list. If it is, return return a pointer to the list element. * If it isn't, the item isn't in the table, so return NULL. */ sem_wait(&hashtable->lock); for(list = hashtable->table[shardId][hashval]; list != NULL; list =list->next) { if (strcmp(key, list->key) == 0){ sem_post(&hashtable->lock); return list; } } sem_post(&hashtable->lock); return NULL; } And my insert function: char *add_string(hash_table_t *hashtable, char *str,char *key, int shardId){ list_t *new_list; list_t *current_list; unsigned int hashval = hash(key); /*printf("|%d|%d|%s|\n",hashval,shardId,key);*/ /* Lock for concurrency */ sem_wait(&hashtable->lock); /* Attempt to allocate memory for list */ new_list = (list_t*)malloc(sizeof(list_t)); /* Does item already exist? */ sem_post(&hashtable->lock); current_list = lookup_string(hashtable, key,shardId); sem_wait(&hashtable->lock); /* item already exists, don't insert it again. */ if (current_list != NULL){ strcpy(new_list->prevValue,current_list->string); strcpy(new_list->string,str); strcpy(new_list->key,key); new_list->next = hashtable->table[shardId][hashval]; hashtable->table[shardId][hashval] = new_list; sem_post(&hashtable->lock); return new_list->prevValue; } /* Insert into list */ strcpy(new_list->string,str); strcpy(new_list->key,key); new_list->next = hashtable->table[shardId][hashval]; hashtable->table[shardId][hashval] = new_list; /* Unlock */ sem_post(&hashtable->lock); return new_list->prevValue; } My main class runs some of tests by executing the insertion / reading / delete from the elements of the hash table the problem is when i have more than 4 partitions/shards the tests stop at the first reading element saying it returned the wrong value NULL on the search function, when its less than 4 it runs perfectly well and passes all the tests. You can see my main.c in here if you want to give a look: http://hostcode.sourceforge.net/view/1105 My complete Hash table code: http://hostcode.sourceforge.net/view/1103 And other functions where hash table code is executed: .c file http://hostcode.sourceforge.net/view/1104 .h file http://hostcode.sourceforge.net/view/1106 Thank for you time, i appreciate any help you can give to me this is a college important project that I'm trying to solve and I'm stuck here for 2 days.

  Read the article

• overloaded stream insetion operator with a vector

  - by julz666

  hi, i'm trying to write an overloaded stream insertion operator for a class who's only member is a vector. i dont really know what i'm doing. (lets make that clear) it's a vector of "Points" which is a struct containing two doubles. i figure what i want is to insert user input (a bunch of doubles) into a stream that i then send to a modifier method? i keep working off other stream insertion examples such as... std::ostream& operator<< (std::ostream& o, Fred const& fred) { return o << fred.i_; } but when i try a similar..... istream & operator >> (istream &inStream, Polygon &vertStr) { inStream >> ws; inStream >> vertStr.vertices; return inStream; } i get an error "no match for operator etc etc. if i leave off the .vertices it compiles but i figure it's not right? (vertices is the name of my vector ) and even if it is right, i dont actually know what syntax to use in my driver to use it? also not %100 on what my modifier method needs to look like. here's my Polygon class //header #ifndef POLYGON_H #define POLYGON_H #include "Segment.h" #include <vector> class Polygon { friend std::istream & operator >> (std::istream &inStream, Polygon &vertStr); public: //Constructor Polygon(const Point &theVerts); //Default Constructor Polygon(); //Copy Constructor Polygon(const Polygon &polyCopy); //Accessor/Modifier methods inline std::vector<Point> getVector() const {return vertices;} //Return number of Vector elements inline int sizeOfVect() const {return (int) vertices.capacity();} //add Point elements to vector inline void setVertices(const Point &theVerts){vertices.push_back (theVerts);} private: std::vector<Point> vertices; }; #endif //Body using namespace std; #include "Polygon.h" // Constructor Polygon::Polygon(const Point &theVerts) { vertices.push_back (theVerts); } //Copy Constructor Polygon::Polygon(const Polygon &polyCopy) { vertices = polyCopy.vertices; } //Default Constructor Polygon::Polygon(){} istream & operator >> (istream &inStream, Polygon &vertStr) { inStream >> ws; inStream >> vertStr; return inStream; } any help greatly appreciated, sorry to be so vague, a lecturer has just kind of given us a brief example of stream insertion then left us on our own thanks. oh i realise there are probably many other problems that need fixing

  Read the article

• C++ bughunt - High-score insertion in a vector crashes the program

  - by Francisco P.

  Hello, everyone! I have a game I'm working on. My players are stored in a vector, and, at the end of the game, the game crashes when trying to insert the high-scores in the correct positions. Here's what I have (please ignore the portuguese comments, the code is pretty straightforward :P): //TOTAL_HIGHSCORES is the max. number of hiscores that i'm willing to store. This is set as 10. bool Game::updateHiScores() { bool stopIterating; bool scoresChanged = false; //Se ainda nao existirem TOTAL_HISCORES melhores pontuacoes ou se a pontuacao for melhor que uma das existentes for (size_t i = 0; i < players.size(); ++i) { //&& !(players[i].isAI()) if (players[i].getScoreValue() > 0 && (hiScores.size() < TOTAL_HISCORES || hiScores.back() < players[i].getScore())) { scoresChanged = true; if(hiScores.empty() || hiScores.back() >= players[i].getScore()) hiScores.push_back(players[i].getScore()); else { //Ciclo que encontra e insere a pontuacao no lugar desejado stopIterating = false; for(vector<Score>::iterator it = hiScores.begin(); it < hiScores.end() && !(stopIterating); ++it) { if(*it <= players[i].getScore()) { //E inserida na posicao 'it' o Score correspondente hiScores.insert(it, players[i].getScore()); //Verifica se o comprimento do vector esta dentro do desejado, se nao estiver, este e rectificado if (hiScores.size() > TOTAL_HISCORES) hiScores.pop_back(); stopIterating = true; } } } } } if (scoresChanged) sort(hiScores.begin(), hiScores.end(), higher); return scoresChanged; } What am I doing wrong here? Thanks for your time, fellas.

  Read the article

• How do I sort an array of Person Objects by using compareto()?

  - by Adam

  Here is my code: > import java.util.Scanner; import java.util.Arrays; /** This class tests the Person class. */ public class PersonDemo { public static void main(String[] args) { int count = 0; Scanner in = new Scanner(System.in); boolean more = false; Person first = null; Person last = null; while (more) { System.out.println( "Please enter the person's name or a blank line to quit"); String name = in.nextLine(); if (name.equals("")) more = false; else { Person p = new Person(name); //new person object created with inputted name Person[] people = new Person[10]; //new array of 10 person objects people[count] = p; //declare person object with index of variable count as the new person object first = people[count]; // I have no idea what to do here. This is where I'm stuck. last = people[count]; // I can't figure out what to do with this either. first.compareTo(p); //call compareTo method on first and new person object last.compareTo(p); //call compareTo method on last and new person object count++; // increase count variable } } System.out.println("First: " + first.toString()); System.out.println("Last: " + last.toString()); } } And the Person class: /** A person with a name. */ public class Person implements Comparable { /** * Constructs a Person with a name. * @param aName the person's name */ public Person(String aName) { name = aName; } public String getName() { return name; } @Override public int compareTo(Object otherObject) { Person other = (Person)otherObject; if (name.compareTo(other.name) < 0) return -1; if (name.compareTo(other.name) > 0) return 1; return 0; } /** Returns a string representation of the object. @return name of Person */ public String toString() { return "[name=" + name + "]"; } private String name; }

  Read the article

• Mocking Sort With Mocha

  - by josephmate

  How can I mock an array's sort expect a lambda expression? This is a trivial example of my problem: # initializing the data l = lambda { |a,b| a <=> b } array = [ 1, 2, 3, 4, 5 ] sorted_array = [ 2, 3, 8, 9, 1] # I expect that sort will be called using the lambda as a parameter array.expects(:sort).with( l ).returns( sorted_array ) # perform the sort using the lambda expression temp = array.sort{|a,b| l.call(a,b) } Now, at first I expected that this would work; however, I got the following error: - expected exactly once, not yet invoked: [ 1, 2, 3, 4, 5 ].sort(#<Proc:0xb665eb48>) Is there a way to do what I am looking for? Cheers, Joseph

  Read the article

• Why wont this sort in Solr work?

  - by Camran

  I need to sort on a date-field type, which name is "mod_date". It works like this in the browser adress-bar: http://localhost:8983/solr/select/?&q=bmw&sort=mod_date+desc But I am using a phpSolr client which sends an URL to Solr, and the url sent is this: fq=+category%3A%22Bilar%22+%2B+car_action%3AS%C3%A4ljes&version=1.2&wt=json&json.nl=map&q=%2A%3A%2A&start=0&rows=5&sort=mod_date+desc // This wont work and is echoed after this in php: $queryString = http_build_query($params, null, $this->_queryStringDelimiter); $queryString = preg_replace('/%5B(?:[0-9]|[1-9][0-9]+)%5D=/', '=', $queryString); This wont work, I dont know why! Everything else works fine, all right fields are returned. But the sort doesn't work. Any ideas? Thanks BTW: The field "mod_date" contains something like: 2010-03-04T19:37:22.5Z EDIT: First I use PHP to send this to a SolrPhpClient which is another php-file called service.php: require_once('../SolrPhpClient/Apache/Solr/Service.php'); $solr = new Apache_Solr_Service('localhost', 8983, '/solr/'); $results = $solr->search($querystring, $p, $limit, $solr_params); $solr_params is an array which contains the solr-parameters (q, fq, etc). Now, in service.php: $params['version'] = self::SOLR_VERSION; // common parameters in this interface $params['wt'] = self::SOLR_WRITER; $params['json.nl'] = $this->_namedListTreatment; $params['q'] = $query; $params['sort'] = 'mod_date desc'; // HERE IS THE SORT I HAVE PROBLEM WITH $params['start'] = $offset; $params['rows'] = $limit; $queryString = http_build_query($params, null, $this->_queryStringDelimiter); $queryString = preg_replace('/%5B(?:[0-9]|[1-9][0-9]+)%5D=/', '=', $queryString); if ($method == self::METHOD_GET) { return $this->_sendRawGet($this->_searchUrl . $this->_queryDelimiter . $queryString); } else if ($method == self::METHOD_POST) { return $this->_sendRawPost($this->_searchUrl, $queryString, FALSE, 'application/x-www-form-urlencoded'); } The $results contain the results from Solr... So this is the way I need to get to work (via php). This code below (also on top of this Q) works but thats because I paste it into the adress bar manually, not via the PHPclient. But thats just for debugging, I need to get it to work via the PHPclient: http://localhost:8983/solr/select/?&q=bmw&sort=mod_date+des // Not via phpclient, but works UPDATE (2010-03-08): I have tried Donovans codes (the urls) and they work fine. Now, I have noticed that it is one of the parameters causing the 'SORT' not to work. This parameter is the "wt" parameter. If we take the url from top of this Q, (fq=+category%3A%22Bilar%22+%2B+car_action%3AS%C3%A4ljes&version=1.2&wt=json&json.nl=map&q=%2A%3A%2A&start=0&rows=5&sort=mod_date+desc), and just simply remove the "wt" parameter, then the sort works. BUT the results appear differently, thus making my php code not able to recognize the results I believe. Donovan would know this I think. I am guessing in order for the PHPClient to work, the results must be in a specific structure, which gets messed up as soon as I remove the wt parameter. Donovan, help me please... Here is some background what I use your SolrPhpClient for: I have a classifieds website, which uses MySql. But for the searching I am using Solr to search some indexed fields. Then Solr returns an array of ID:numbers (for all matches of the search criteria). Then I use those ID:numbers to find everything in a MySql db and fetch all other information (example is not searchable information). So simplified: Search - Solr returns all matches in an array of ID:nrs - Id:numbers from Solr are the same as the Id numbers in the MySql db, so I can just make a simple match agains every record with the ID matching the ID from the Solr results array. I don't use Faceting, no boosting, no relevancy or other fancy stuff. I only sort by the latest classified put, and give the option to users to also sort on the cheapest price. Nothing more. Then I use the "fq" parameter to do queries on different fields in Solr depending on category chosen by users (example "cars" in this case which in my language is "Bilar"). I am really stuck with this problem here... Thanks for all help

  Read the article

• Confused about GNU `sort(1)` of a numerical sub field

  - by Chen Levy

  I wish to sort a space separated table, with the numerical value that found on the 2nd field. I can assume that the 2nd field is always fooN but the length of N is unknown: antiq. foo11 girls colleaguing foo2 Leinsdorf Cousy foo0 Montgomeryville bowlegged foo1 pollack Chevrier foo10 ill-conceived candlebomb foo3 seventieths autochthony foo101 re-enable beneficiate foo100 osteometric I read man sort(1) and played with all sort of options. On my system I found the line: sort -n -k2.5 table to work. My question is why? According to the man page: -k, --key=POS1[,POS2] start a key at POS1, end it at POS 2 (origin 1) ... POS is F[.C][OPTS], where F is the field number and C the characterposition in the field. OPTS is one or more single-letter ordering options, which override global ordering options for that key. If no key is given, use the entire line as the key. So why sort -n -k2.4 table don't work and sort -n -k.5 does?

  Read the article

< Previous Page | 5 6 7 8 9 10 11 12 13 14 15 16  | Next Page >