Search Results

Search found 10131 results on 406 pages for 'natural sort'.

Page 268/406 | < Previous Page | 264 265 266 267 268 269 270 271 272 273 274 275  | Next Page >

• How to make drupal known submitting custom content

  - by Andrew

  Hi, I know this is not a drupal forum but, as I’m not getting any response there, I decided to give it a shot here. I’m creating a web site that accepts custom content from users. So, for that matter, this site has a form and a custom module. Instead of using admin theme, this form is placed inside custom template which is created to have a uniform look with the rest of the pages. As a result, creating form elements through hook_form is out of question. Here’s where my problems lie. As this form uses custom theme, I’m not sure as to what can I do to make drupal know that user is submitting new content data when the form is submitted? Would I need to use same query string that of content submission page of admin page like - ?q=node/add/page for action attribute of the html form? (OR) the only way is to map the url to my custom function and invoke some sort of hook inside of it? Thanks

  Read the article

• addDoubleClickHandler to a FixedWidthGrid !!

  - by MArio

  Hello so I got a FixedWidthGrid table which is made from a pagingtable FixedWidthGrid dataTable = x.getDataTable(); I could add alot of handlers to the dataTables rows like selected or sort policies. but I cant add a double click handler ... anyway idea's ?! thank you I do have a class which I made to try to add a double click hander but it didn't work. class: public class DoubleClickTable extends FixedWidthGrid implements HasDoubleClickHandlers { public DoubleClickTable() { super(); } public HandlerRegistration addDoubleClickHandler(DoubleClickHandler handler) { return addDomHandler(handler, DoubleClickEvent.getType()); } } Thank you so much for your help.

  Read the article

• CUDA & VS2010 problem

  - by Kristian D'Amato

  I have scoured the internets looking for an answer to this one, but couldn't find any. I've installed the CUDA 3.2 SDK (and, just now, CUDA 4.0 RC) and everything seems to work fine after long hours of fooling around with include directories, NSight, and all the rest. Well, except this one thing: it keeps highlighting the <<< >>> operator as a mistake. Only on VS2010--not on VS2008. On VS2010 I also get several warnings of the following sort: C:\Program Files (x86)\Microsoft Visual Studio 9.0\VC\include\xdebug(109): warning C4251: 'std::_String_val<_Ty,_Alloc>::_Alval' : class 'std::_DebugHeapAllocator<_Ty>' needs to have dll-interface to be used by clients of class 'std::_String_val<_Ty,_Alloc>' Anyone know how this can be fixed?

  Read the article

• Combine two views into one view

  - by Kevin

  I have two views that I would like to combine into one. The first view shows all items of X where company ID = Y. This is to give preferential sort to the client first, and then everyone else. So I created a second view, all items of X, where company ID != Y. I created it as an Attachment to attach to the first view, but I don't think I got the intended result. How can I combine these views so the first view results are listed first, and then the second view is too, using the same pager, filters, and arguments? Is there any way of achieving this without programming it?

  Read the article

• Visit neighbor of a position in a 2d-array

  - by Martin

  I have the following two dimensional array: static int[,] arr = new int[5, 5] { { 00, 00, 00, 01, 00 }, { 00, 00, 01, 01, 00 }, { 00, 00, 01, 01, 00 }, { 00, 00, 01, 01, 00 }, { 00, 00, 00, 01, 00 }, }; I have to a implement a method called Hit(int x, int y). When we hit a 0 in the array (i.e. Hit(0, 0), Hit(1, 1), but not Hit(3, 0)) I would like all the adjacent zeros to the zero we hit to be incremented by 10. So if I call Hit(1, 1), the array should become the following. static int[,] arr = new int[5, 5] { { 10, 10, 10, 01, 00 }, { 10, 10, 01, 01, 00 }, { 10, 10, 01, 01, 00 }, { 10, 10, 01, 01, 00 }, { 10, 10, 10, 01, 00 }, }; Any idea how I could implement that? It sounds to me like a Depth First Search/Recursive sort-of algorithm should do the job, but I haven't been able to implement it for an 2d array. Thanks for the help!

  Read the article

• Hibernate HQL to basic SQL

  - by CC

  Hello everybody, I working on a project with Hibernate and we need to replace Hibernate with some "home made persistence" stuff. The idea is that the project is big enough, and we have many HQL queries. The problem is with the queries like select a,b from table1, table2 on t1.table1=t2.table2 Basically all joins are not supported by our "hand made persistence" stuff. What I would need, is to be able to do some sort of transcoder, which will take as a input the HQL queries and output some SQL, but the basic SQL without joins, something like (a dumb example) select a from table1 where t1 IN ( select b from table2) I hope you get the idea. My persistence layer does not supports joins. Does anybody has any idea about something like that? Some framework, or something? Thanks alot everybody. C.C.

  Read the article

• [Ruby] How can I randomly iterate through a large Range?

  - by void

  I would like to randomly iterate through a range. Each value will be visited only once and all values will eventually be visited. For example: (0..9).sort_by{rand}.map{|x| f(x)} where f(x) is some function that operates on each value. A Fisher-Yates shuffle could be used to increase efficiency, but this code is sufficient for many purposes. My problem is that sort_by will transform the range into an array, which is not cool because I am working with astronomically large numbers. Ruby will quickly consume a large amount of RAM trying to create a monstrous array. This is also why the following code will not work: tried = {} # store previous attempts bigint = 99**99 bigint.times { x = rand(bigint) redo if tried[x] tried[x] = true f(x) # some function } This code is very naive and quickly runs out of memory as tried obtains more entries. What sort of algorithm can accomplish what I am trying to do?

  Read the article

• How does Ruby's Enumerator object iterate externally over an internal iterator?

  - by Salman Paracha

  As per Ruby's documentation, the Enumerator object uses the each method (to enumerate) if no target method is provided to the to_enum or enum_for methods. Now, let's take the following monkey patch and its enumerator, as an example o = Object.new def o.each yield 1 yield 2 yield 3 end e = o.to_enum loop do puts e.next end Given that the Enumerator object uses the each method to answer when next is called, how do calls to the each method look like, every time next is called? Does the Enumeartor class pre-load all the contents of o.each and creates a local copy for enumeration? Or is there some sort of Ruby magic that hangs the operations at each yield statement until next is called on the enumeartor? If an internal copy is made, is it a deep copy? What about I/O objects that could be used for external enumeration? I'm using Ruby 1.9.2.

  Read the article

• Edit PDF online and save and form data to server

  - by Clowerweb

  Hello, I have some PDF documents which are being displayed in the browser, with some fields already being pre-populated from the database using iTextSharp (we are running Windows Server 2008, IIS 7, SQL Server 2008, and ASP.NET 2.0/2.5 with C#). Our clients need to be able to fill in the remaining fields and save the PDF to the server. I have considered the following possibilities: 1.) Somehow using iTextSharp to parse the form fields, grab all the form data and save it to the database on submit. 2.) Adding a submit button to the PDF itself using LiveCycle with some sort of JS click event to save the FDF/XFDF/XDP/XML data either to the database or to a flat file on the server. I am currently unsure as to what the best approach would be, what would work, or how to implement any of these possible solutions, so any help would be greatly appreciated. Thanks!

  Read the article

• Correct (pretty) window redraw during the creation

  - by Coder

  Does anyone know what is a correct way to redraw window during lengthy initialization operations? Say I have HWND with NULL brush, and it does some not so quick child window initialization (Window initialization is not so quick on Vista and 7, especially on netbooks, even with threaded app). With this config window stays black for half a second on slower laptops. But if I supply window color brush, it seems that there are some sort of child controls or something that draws black squares on top of it, which also seems ugly. Even though the controls are created without WS_VISIBLE initially. Oh, the window has the WS_EX_COMPOSITED style, which should do the double buffering to avoid flicker. But it still behaves ugly. Are there any other tricks I've forgotten, missed?

  Read the article

• ASP.Net Reportviewer in folder not working

  - by Bruce

  We can run the ReportViewer in a ASP.Net Web App project that is off the root OK so localhost/test/report.aspx works. It's running as a Client Report. But if we move the application up another level the report stops working so localhost/testfolder/test/test.aspx. When the report fails it has no data to display and none of the images are loading. Info: We are bind the report in code and sort out the Report.LocalReport.ReportPath to the correct path. Can't help thinking there is a setting wrong, but stumped at the moment!

  Read the article

• How do I send data from Java to Flash locally?

  - by terence

  I have a website with a Java applet and a Flash application. I want the Java applet to send data to the Flash application locally. What's the best way to do this? The data I want to send are potentially large images (possibly up to 1MB in size). This means sending a base64 string to javascript and then to Flash would probably be too cumbersome. I don't want to have to contact external servers or anything; all of it should be possible locally and offline. Is there some easy way to just send this sort of data around? If I saved the file locally first, Flash wouldn't be able to access that, would it?

  Read the article

• When using the Facebook Connect Actionscript API (no JS, just straight Flash), how can I listen for

  - by techno

  Hey guys, When using the Facebook Connect AS API, the user will be prompted to log in to FB in a pop up window. At this point I want to block interaction in my flash movie and wait for them to complete logging in (or potentially close/cancel and not log in). I have seen examples where people put up a Flex "Alert" box with some hint like "Press ok once you have logged into facebook", but I want to automatically listen for them logging in or canceling/closing the popup window without logging in. Is there an event I can listen for with flash? So far I am using ZERO javascript, but I guess I could add a little if it is needed for this... I definitely want to avoid having some sort of "Press OK" alert box, but instead have the flash application automatically react to the user logging in with the popup window.

  Read the article

• Question about pipe in Perl

  - by Uri

  The following code is working sort of fine: open( PIPE, '-|', 'ant' ); for( <PIPE> ) { print; } However, it doesn't do what I want. Since the Ant build can take 5 minutes, I would like to see the output line by line. Instead, I'm getting the entire input at the end of the process. Looking at it with the Perl debugger, Perl waits at the 'for' statement, until Ant terminates. Why is that?

  Read the article

• Leave entity intact in XML + XSLT

  - by Kuroki Kaze

  I transform XML to (sort of) HTML with XSL stylesheets (using Apache Xalan). In XML there can be entities like &mdash;, which must be left as is. In beginning of XML file I have a doctype which references these entities. What should I do for entity to be left unchanged? <!DOCTYPE article [ <!ENTITY mdash "&mdash;"><!-- em dash --> ]> gives me SAXParseException: Recursive entity expansion, 'mdash' when encountering &mdash in XML text.

  Read the article

• Order a sentence alphabetically and count the number of times each words appears and print in a table

  - by JaAnTr

  I am struggling with the print in a table part of the question. So far I have managed to order the user inputted sentence alphabetically and count the number of times each word occurs. Here is the code: thestring = (raw_input()) sentence = thestring.split(" ") sentence.sort() count = {} for word in thestring.split(): try: count[word] += 1 except KeyError: count[word] = 1 print sentence print count And when I run the code I get this: ['apple', 'apple', 'banana', 'mango', 'orange', 'pear', 'pear', 'strawberry'] {'apple': 2, 'pear': 2, 'strawberry': 1, 'mango': 1, 'orange': 1, 'banana': 1} However, ideally I want it printed in a table that looks something like: apple.....|.....2 banana....|.....1 mango.....|.....1 orange....|.....1 pear......|.....2 strawberry|.....1 Thanks for any help!

  Read the article

• How can one describe a rock-paper-scissors relationship between 3 items?

  - by Madara Uchiha

  Let's say I have the following structure: abstract class Hand {} class Rock extends Hand {} class Paper extends Hand {} class Scissors extends Hand {} The goal is to make a function (or a method) Hand::compareHands(Hand $hand1, Hand $hand2), which would return the winning hand in a rock-paper-scissors match. That would be very easy with a bunch of ifs, but the point is to have a more robust structure, that's relying on polymorphism rather than on procedural code. P.S. this is done in actual production code, if someone is asking. This isn't some sort of challenge or homework. (It's not really rock-paper-scissors, but you get the point).

  Read the article

• Finding shared list IDs in a MySQL table using bitwise operands

  - by landons

  I want to find items in common from the "following_list" column in a table of users: +----+--------------------+-------------------------------------+ | id | name | following_list | +----+--------------------+-------------------------------------+ | 9 | User 1 | 26,6,12,10,21,24,19,16 | | 10 | User 2 | 21,24 | | 12 | User 3 | 9,20,21,26,30 | | 16 | User 4 | 6,52,9,10 | | 19 | User 5 | 9,10,6,24 | | 21 | User 6 | 9,10,6,12 | | 24 | User 7 | 9,10,6 | | 46 | User 8 | 45 | | 52 | User 9 | 10,12,16,21,19,20,18,17,23,25,24,22 | +----+--------------------+-------------------------------------+ I was hoping to be able to sort by the number of matches for a given user id. For example, I want to match all users except #9 against #9 to see which of the IDs in the "following_list" column they have in common. I found a way of doing this through the "SET" datatype and some bit trickery: http://dev.mysql.com/tech-resources/articles/mysql-set-datatype.html#bits However, I need to do this on an arbitrary list of IDs. I was hoping this could be done entirely through the database, but this is a little out of my league. Any bit gurus out there? Thanks, Landon

  Read the article

• Overcoming Inertia - How to Just Get Going on Stuff

  - by kronoz

  I wondered whether you guys could help me - I have a big problem with overcoming inertia, i.e. how to just get started on a project/work when you simply feel the inertia of not being in the right 'zone' to do work such that it really becomes pretty damn tough to actually get on with what you want to do. Forgive me quoting my blog post where I try to express the problem as best I can:- The problem is that it feels so damned difficult to exert the force required to shift from one mode to another, so much so that you find it almost inconceivable to do so at the time. You need to force yourself somehow, or at least find some sort of hack to trick yourself into it. Do you guys have any ideas/hacks as to how to overcome this? Thanks in advance, and hopefully the community feel this question is valid for stack overflow (I have set it community wiki due to its fairly subjective nature.)

  Read the article

• Invisible Delimiter for Strings in HTML

  - by noah

  I need a way to identify certain strings in HTML markup. I know what the strings are, but it is possible that they could be substrings of other strings in the document. To find them, I output a special delimiter character (currently using \032). On page load, we go through the HTML and record the location of the strings, and remove the delimiter. Unfortunately, most browsers show the delimiter character until we can find and remove them all. I'd like to avoid that if possible. Is there a character or string that will be preserved in the HTML content (so a comment wont work) but wont be visible to the user? It also needs to be something that is fairly unlikely to appear next to a string, so something like &nbsp; wouldn't work either. EDIT: Sorry, I forgot to mention that the strings will be in attributes, so any sort of tag wont work.

  Read the article

• How to make a Scala Applet whose Applet class is a singleton?

  - by Jamie

  Hi, I don't know if a solution exists but it would be highly desirable. I'm making a Scala Applet, and I want the main Applet class to be a singleton so it can be accessed elsewhere in the applet, sort of like: object App extends Applet { def init { // do init here } } Instead I have to make the App class a normal instantiatable class otherwise it complains because the contructor is private. So the ugly hack I have is to go: object A { var pp: App = null } class App extends Applet { A.pp = this def init { // do init here } } I really hate this, and is one of the reasons I don't like making applets in Scala right now. Any better solution? It would be nice...

  Read the article

• Find top N elements in a Multiset from Google Collections?

  - by dfrankow

  A Google Collections Multiset is a set of elements each of which has a count (i.e. may be present multiple times). I can't tell you how many times I want to do the following Make a histogram (exactly Multiset) Get the top N values from the histogram Examples: top 10 URLs, top 10 tags, ... What is the canonical way to do #2 given a Multiset? Here is a blog post about it, but that code is not quite what I want. First, it returns everything, not just top N. Second, it copies (is it possible to avoid a copy?). Third, I usually want a deterministic sort, i.e. tiebreak if counts are equal.

  Read the article

• Avoid application becoming unresponsive on download

  - by baron

  Hi I have an application which downloads a file from a network location and then displays that files information. It uses WebClient.DownloadFile to achieve this. The problem is, when the user clicks a button to start the download, the application becomes unresponsive until the file has downloaded. This gives the impression the application may have hung. I would like to seek ideas which would avoid this scenario. Though my solution will need to be 'as quick and cheap as possible' I would be interested in hearing about custom loaders that have been built, or some sort of loading symbol / progress bar / sand time clock thingy : ) Thanks for reading.

  Read the article

• Easy to use/learn PHP framework?

  - by Meredith

  I need to build a php app, and I was thinking about using a framework (never used one before). I've been browsing around some but most of them seems kinda complicated, I really liked what I saw about Symfony, but it looks like I will have to spend like a month until I really understand how to use it, and in one month I could code the app I have in mind 5 times without a framework. But I want to use one to "standardize" my code and prevent bugs. So I was wondering if someone could share with me which php frameworks you think are easier to learn how to use. My application will use mysql, and it will have some sort of "search engine" to search data that will be populated on the database using a few "scraper scripts" (that I also wants to code using the framework).

  Read the article

• How to convert submitted form array to this array on php?

  - by drfanai

  Lets suppose i have the following array submitted by a html form: array( 'firstname' => array('Sara','Jim'), 'lastname' => array('Gibson','Jobs') ); What i wanna achieve is the following array: array( array( 'firstname' => 'sara', 'lastname' => 'Gibson' ), array( 'firstname' => 'Jim', 'lastname' => 'Jim' ) ); I need a function to automatically sort the array not manually by entering data but automatically processing array data.

  Read the article

< Previous Page | 264 265 266 267 268 269 270 271 272 273 274 275  | Next Page >