Search Results

Search found 9186 results on 368 pages for 'sort'.

Page 245/368 | < Previous Page | 241 242 243 244 245 246 247 248 249 250 251 252  | Next Page >

• Convert Python 3.x snippet to C#/LINQ.

  - by Hamish Grubijan

  I want to sort elements of a HashSet<string> and join them by a ; character. Python interpreter version: >>> st = {'jhg', 'uywer', 'nbcm', 'utr'} >>> strng = ';'.join(sorted(s)) >>> strng 'ASD;anmbh;ashgg;jhghjg' C# signature of a method I seek: private string getVersionsSorted(HashSet<string> versions); I can do this without using Linq, but I really want to learn it better. Many thanks!

  Read the article

• Invisible JFrame/JTable how much faster ?

  - by chacko

  I have a swing app. with a jframe with lots of internal frames containing large JTable. Those jtables get updated continuously so there is lots of repainting going on. in some circumstances I can simply keep the JFrame invisible. (frame.setVisible(false)) I was wondering if anybody knows if I will gain something in terms of performance (something considerable or not) such as 50% gain or you would only get 2% gain... and maybe some sort of explaination on what to expect. thanks

  Read the article

• Q about AbstractApplicationContext.getBeansOfType() and getBean()

  - by Paul Reiners

  We have the following legacy 2.0.7 Spring code: final Map<String, MyClass> secondaryFactories = (Map<String, MyClass>) context.getBeansOfType(MyClass.class, false, true); return (MyClass) context.getBean("myClass"); where context is an instance of org.springframework.context.support.AbstractApplicationContext Note that we ignore the return value of getBeansOfType(). This works just fine, but the problem is that the call to getBeansOfType() is time-consuming. However, even though we ignore the return value of this call, if we try to eliminate this call, then the instance of MyClass returned by getBean() is not fully initialized. (So, apparently, the call to getBeansOfType() is having some sort of side-effects that we need.) We suspect that the call to getBeansOfType() is overkill and we could do something more lightweight so that the instance of MyClass obtained by the call to getBean() would be fully initialized (but it's not null and no exception is thrown). So, is there a more efficient way of doing this?

  Read the article

• What makes a web site 'finished' for delivery to a client?

  - by AP257

  Hi, Sorry if this question has already been answered, and sorry if it's too subjective to make sense, or for StackOverflow. I'm delivering a site to a client and I want to send them high-quality HTML/CSS/JS, fully validated, accessible etc. So I'm compiling a list of things to check, and useful tools for doing so, before I hand the code over. Here's a partial list, but what am I missing? Link checking for any broken links I might have missed - W3C link checker HTML validation for accessibility and broken-ness - W3C HTML validator CSS validation - W3C CSS validator Check for slow-loading page elements - Firebug and YSlow plugin What's missing - if you were a client, what else would you want to be sure has been checked? I'm wondering about the etiquette of things like comments, indentation, and minification; is it good practice to sort out all these? And what else have I missed? Thanks :)

  Read the article

• Creating a library of classes in php - how to handle the library root location?

  - by jax

  I am about to create a collection of classes in php which are interrelated. Now I would like to include files using their absolute path, ie If I were in '/com/mysite/licences/Generator.class.php' I would like to include files like this: include '/com/mysite/lib/Utils.class.php' I don't want to include like this, I think it is confusing and ugly include '../licenses/Utils.class.php' This works ok, unless 'com' is not in the root of public_html. I assume I will need some sort of prefix to append to each file LIBRARY_ROOT that hold the location of 'com' in the current filesystem. So it might look like this include LIBRARY_ROOT.'com/mysite/lib/Utils.class.php' What is the best way to do this?

  Read the article

• How to avoid that the robot gets trapped in local minimum?

  - by nesmoht

  Hi, I have some time occupying myself with motion planning for robots, and have for some time wanted to explore the possibility of improving the opportunities as "potential field" method offers. My challenge is to avoid that the robot gets trapped in "local minimum" when using the "potential field" method. Instead of using a "random walk" approach to avoid that the robot gets trapped I have thought about whether it is possible to implement a variation of A* which could act as a sort of guide for precisely to avoid that the robot gets trapped in "local minimum". Is there some of the experiences of this kind, or can refer to literature, which avoids local minimum in a more effective way than the one used in the "random walk" approach.

  Read the article

• Sorting array of 1000 distinct integers in the range [1, 5000], accessing each element at most once

  - by Cronydevil

  Suppose you have an array of 1000 integers. The integers are in random order, but you know each of the integers is between 1 and 5000 (inclusive). In addition, each number appears only once in the array. Assume that you can access each element of the array only once. Describe an algorithm to sort it. How i can sorting? If you used auxiliary storage in your algorithm, can you find an algorithm that remains O(n) space complexity?

  Read the article

• Convert bit vector (array of booleans) to an integer, and integer to bit vector, in Java.

  - by dreeves

  What's the best way to unstub the following functions? // Convert a bit-vector to an integer. int bitvec2int(boolean[] b) { [CODE HERE] } // Convert an integer x to an n-element bit-vector. boolean[] int2bitvec(int x, int n) { [CODE HERE] } Or is there a better way to do that sort of thing than passing boolean arrays around? This comes up in an Android app where we need an array of 20 booleans to persist and the easiest way to do that is to write an integer or string to the key-value store. I'll post the way we (Bee and I) wrote the above as an answer. Thanks!

  Read the article

• accessing variable sheet ranges within Google spreadsheet?

  - by Daniel Harvey

  I've been trying to keep this little project entirely within Google docs, but I may have hit a wall. The spreadsheet is being used as a way for multiple users to record individual events with a Template they duplicate. I want to be able to compile a list of names of those attended onto a "report" sheet from all of the unique sheets, which should be after a certain sheet index [3] to [infinite]. Is this sort of variable sheet range possible in Google spreadsheets or do I need to go to the API to get this accomplished?

  Read the article

• Update int array based on parent

  - by Pickels

  I have the following int[] in my database: '{0}' '{0,0}' '{0,0,0}' '{0,0,0,0}' This column is used to sort my tree data. Now when a parent updates it's order the children should also update. For example if the second record updates it's order to 1 it should result in the following. '{0}' '{0,1}' '{0,1,0}' '{0,1,0,0}' So I was wondering what the query would be to update record 3 and 4. In case it's not clear what I am asking leave a comment I can add additional information. Screenshot of my actual data:

  Read the article

• php most memory efficient way to return files

  - by bumperbox

  so i have a bunch of files, some can be up to 30-40mb and i want to use php to handle security of the files, so i can control who has access to them that means i have a script sort of like this rough example $has_permission = check_database_for_permission($user, filename); if ($has_permission) { header('Content-Type: image/jpeg'); readfile ($filename); exit; } else { // return 401 error } i would hate for every request to load the full file into memory, as it would soon chew up all the memory on my server with a few simultaneous requests so a couple of questions is readfile the most memory efficient way of doing this? is there some better method of achieving the same outcome, that i am overlooking? server: apache/php5 thanks

  Read the article

• Retrieving Large Lists of Objects Using Java EE

  - by hallidave

  Is there a generally-accepted way to return a large list of objects using Java EE? For example, if you had a database ResultSet that had millions of objects how would you return those objects to a (remote) client application? Another example -- that is closer to what I'm actually doing -- would be to aggregate data from hundreds of sources, normalize it, and incrementally transfer it to a client system as a single "list". Since all the data cannot fit in memory, I was thinking that a combination of a stateful SessionBean and some sort of custom Iterator that called back to the server would do the trick. How have you successfully solved this problem in the past?

  Read the article

• resort on a std::vector vs std::insert

  - by Abruzzo Forte e Gentile

  I have a sorted std::vector of relative small size ( from 5 to 20 elements ). I used std::vector since the data is continuous so I have speed because of cache. On a specific point I need to remove an element from this vector. I have now a doubt: which is the fastest way to remove this value between the 2 options below? setting that element to 0 and call sort to reorder: this has complexity but elements are on the same cache line. call erase that will copy ( or memcpy who knows?? ) all elements after it of 1 place ( I need to investigate the behind scense of erase ). Do you know which one is faster? I think that the same approach could be thought about inserting a new element without hitting the max capacity of the vector. Regards AFG

  Read the article

• Hibernate Query - Get latest versions by timestamp?

  - by Slim

  I have a database that is being used as a sort of version control system. That is, instead of ever updating any rows, I add a new row with the same information. Each row also contains a version column that is a date timestamp, so the only difference is the new row will have a more recent timestamp. What I'm having trouble with is writing an efficient hibernate query to return the latest version of these rows. For the sake of example, these are rows in a table called Product, the timestamped column is version. There are multiple versions of multiple products in the table. So there may be multiple versions (rows) of ProductA, multiple versions of ProductB, etc. And I would like to grab the latest version of each. Can I do this in just a single hibernate query? session.createQuery("select product from Product product where...?"); Or would this require some intermediate steps?

  Read the article

• crc24 from c to python

  - by biiiiiaw

  can someone please translate this code to python? i have tried and tried again, but have not managed it: #define CRC24_INIT 0xB704CEL #define CRC24_POLY 0x1864CFBL typedef long crc24; crc24 crc_octets(unsigned char *octets, size_t len) { crc24 crc = CRC24_INIT; int i; while (len--) { crc ^= (*octets++) << 16; for (i = 0; i < 8; i++) { crc <<= 1; if (crc & 0x1000000) crc ^= CRC24_POLY; } } return crc & 0xFFFFFFL; } i have the rotate left function (ROL24(value,bits_to_rotate_by)), which i know works since i got it from a source code of a reputable programmer, but i dont get the * and ++ on octet. i only sort of understand how ++ works in c++, and i dont know what * is at all

  Read the article

• Save the contents of manipulated div to a variable and pass to php file

  - by Danielle Zarcaro

  I have tried to use AJAX, but nothing I come up with seems to work correctly. I am creating a menu editor. I echo part of a file using php and manipulate it using javascript/jquery/ajax (I found the code for that here: http://www.prodevtips.com/2010/03/07/jquery-drag-and-drop-to-sort-tree/). Now I need to get the edited contents of the div (which has an unordered list in it) I am echoing and save it to a variable so I can write it to the file again. I couldn't get that resource's code to work so I'm trying to come up with another solution. If there is a code I can put into the $("#save").click(function(){ }); part of the javascript file, that would work, but the .post doesn't seem to want to work for me. If there is a way to initiate a php preg_match in an onclick, that would be the easiest. Any help would be greatly appreciated.

  Read the article

• Checkbox not checking inside div in Firefox

  - by mike

  Weird problem. I don't know if anyone can shed some light on this? I have a checkbox inside a div. It works fine in IE but not Firefox. I have to click the space around the checkbox that is occupied by the div (sort of like a label) for the checkbox to tick on and off. Directly clicking the checkbox does not show it as ticked on or off, even though in firebug it is showing that it is in a checked state and an unchecked state. Only in FF does this happen.....

  Read the article

• Custom deleters for std::shared_ptrs

  - by Kristian D'Amato

  Is it possible to use a custom deleter after creating a std::shared_ptr without using new? My problem is that object creation is handled by a factory class and its constructors & destructors are protected, which gives a compile error, and I don't want to use new because of its drawbacks. To elaborate: I prefer to create shared pointers like this, which doesn't let you set a custom deleter (I think): auto sp1 = make_shared<Song>(L"The Beatles", L"Im Happy Just to Dance With You"); Or I can create them like this, which does let met set a deleter through an argument: auto sp2(new Song, MyDeleterFunc); But the second one uses new, which AFAIK isn't as efficient as the top sort of allocation. Maybe this is clearer: is it possible to get the benefits of make_shared<> as well as a custom deleter? Would that mean having to write an allocator?

  Read the article

• Removing the last character of a string IF it is $variable

  - by KeenLearner

  Hi there, I've made a little script to convert titles into url friendly things. ie: 'I am a title' becomes 'I_am_a_title' My script basically goes through and turns spaces, apostrophes, commas etc etc into an underscore. The problem is, sometimes my url's end up like this: 'i_am_a_title_' with a trailing underscore... So i figure, add a little bit to go through and search to see if the last character is an underscore on the final result, and if it is, then swap it. I looked into the strrchr() function but I seem to be hitting a wall of my own understanding. How is this sort of thing accomplished?

  Read the article

• How do I use python wx:Config to access the Windows registry?

  - by GreenAsJade

  I've read http://wxpython.org/docs/api/wx.ConfigBase-class.html I've done some basic things like the appended. What I can see is that Config.Create() returns me some sort of configuration object, which has information about python in it. But clearly that's not what I'm looking for: I seem to be missing the magic to say "give me a Config that is the Windows Registry"... Thanks! GaJ import wx from wx import Config app=wx.App(False) config=Config.Create() config.HasGroup("HKEY_CURRENT_USER") False config.GetFirstEntry() (0, u'', -1) config.GetFirstGroup() (1, u'PythonCore', 1) config.GetNextGroup(1) (0, u'', -1) config.GetNumberOfGroups() 1 config.GetPath() u'' config.HasEntry("PythonCore") False config.GetFirstGroup() (1, u'PythonCore', 1)

  Read the article

• Programming Exercises for Learning Purposes?

  - by cam

  Are there any programming exercises that apply to any language? Before I got my first job, I thought I knew C# pretty well, then I was thrown right into the deep end, and now I know I have a good command over the language. I would like to apply the same method to other languages, but unfortunately, I'm sort of stuck with C# at work. Ideally, something similar (but broader in scope) to Project Euler is ideal. Project Euler helped me learn a ton of C++/F#, some math, algorithms, handling bignums, etc. I'm looking for something like this.

  Read the article

• Re-ordering C++ template functions

  - by DeadMG

  In C++, I have a certain template function that, on a given condition, calls a template function in another class. The trouble is that the other class requires the full definition of the first class to be implemented, as it creates the second class and stores them and manages them in similar fashions. The trouble is that naturally, they fall as one class, and thus have some tight interop, except that I need them to be two classes for threading reasons. A sort of, master for all threads, one child per thread, system. Any advice on how this can be implemented?

  Read the article

• Using App Engine to update a database in a app

  - by tyczj

  I have been reading about app engine but I still dont know what I can and cant do with it in a android application. Basically what I want to do is be able to create/manage a database in the cloud that the app can pull down and update the local database if needed. Creation and managing would be done outside of the app by me. I dont know much about all of this as I am just getting started with it but I already have an application made, I just want to add this feature to it. I have never written any sort of Web Service calls or anything either but I have used them to get data and such Can this be done? Any tutorials out there to help me out?

  Read the article

• jQuery infinite loop w/ tablesorter

  - by Wells

  Got myself in a funny situation: page has three tables. Using sortEnd, any time you sort one table, it sorts the other three. However, since I bound sortEnd to the function that does the sorting, you get a infinite loop of sorting/resorting. It looks like: $("table.tablesorter").tablesorter({widgets: ['zebra']}).bind("sortEnd", function() { $(this).find("th.headerSortDown,.headerSortUp").each(function(i) { index = $(this).attr("cellIndex"); order = ($(this).is(".headerSortDown")) ? 1 : 0; $("table.tablesorter").tablesorter({sortList: [[index,order]]}); }); }); Any tips on how to clean this up?

  Read the article

• MySQL - Counting rows in preparation for greatest-n-per-group not working?

  - by John M

  Referring to SO and other sites have given me examples of how to use MySQL to create a 'greatest-n-per-group' query. My variant on this would be to have a query that returns the first 3 rows of each category. As the basis for this I need to sort my data into a usable sequence and that is where my problems start. Running just the sequence query with row numbering shows that changes in category are mostly ignored. I should have 35 categories returning rows but only 5 do so. My query: set @c:=0; set @a:=0; SELECT IF(@c = tdg, @a:=@a+1, @a:=1) AS rownum, (@c:=tdg) , julian_day, sequence, complete, year, tdg FROM tsd WHERE complete = 0 order by tdg, year, julian_day, sequence Do I have a syntax mistake with this query?

  Read the article

< Previous Page | 241 242 243 244 245 246 247 248 249 250 251 252  | Next Page >