Search Results

Search found 17924 results on 717 pages for 'z order'.

Page 264/717 | < Previous Page | 260 261 262 263 264 265 266 267 268 269 270 271  | Next Page >

• NetBeans 6.9 Beta LineWrap

  - by arik-so

  -J-Dorg.netbeans.editor.linewrap=true This command, I have read here turns the line wrap feature on. What I need to know, however, where can I put this command in order to turn it on? I am using NetBeans 6.9 on Mac OS X 10.6. Thanks in advance for any help!

  Read the article

• Ordering Wordpress posts by most recent comment

  - by James

  I'm wanting to order Wordpress posts by the most recent comment. To the best of my knowledge this isn't possible using the WP_Query object, and would require a custom $wpdb query, which I can easily write. However, I then don't know how to setup the loop to run off this object. Can anyone help?

  Read the article

• How to select from datetime in sqlite?

  - by Sein Kraft

  Joined is a datetime data type column in the database and dates are saved as '12/05/2010 15:54:32' This my query: SELECT * FROM users WHERE joined BETWEEN '12/05/2010 00:00:00' AND '12/05/2010 59:59:59' ORDER BY id ASC But it doesn't work. It returns no rows. So how i gan get them?

  Read the article

• How can I find a Qt metaobject instance from a class name?

  - by axilmar

  Is there a way to find the QMetaObject instance of a class, given the class name? what I like to do is to load objects from disk, but for this to happen, I need a way to retrieve a QMetaObject instance using the name of a class, in order to use the QMetaObject to create an instance.

  Read the article

• translate stored procedure - to Linq2SQL (count, max, group, orderby)

  - by Walter

  I've two tables (1:N) CREATE TABLE master (idMaster int identity (1,1) not null, TheName varchar( 100) null, constraint pk_master primary key(idMaster) clustered) and - CREATE TABLE lnk (idSlave int not null, idMaster int not null, constraint pk_lnk_master_slave(idSlave) primary key clustered) link between Master.idMaster and lnk.idMaster I've a SQL query: select max (master.idMaster) as idMaster, master.theName, count (lnk.idSlave) as freq from lnk inner join master ON lnk.idMaster = master.idMaster Group by master.theName order by freq desc, master.theName I need to translate this T-SQL query to a Linq-to-SQL statement, preferably in C#

  Read the article

• What’s the ROI of Continuous Integration?

  - by Liggy

  Currently, our organization does not practice Continuous Integration. In order for us to get an CI server up and running, I will need to produce a document demonstrating the return on the investment. Aside from cost savings by finding and fixing bugs early, I'm curious about other benefits/savings that I could stick into this document.

  Read the article

• How to REALLY focus a link using jQuery / javascript

  - by Bobby Jack

  Calling the jQuery focus() method on a link appears to only partially focus the link. Whilst the link has focus to the extent that pressing ENTER follows the link, it doesn't take on the default outline styling (or adopt any styling set via the :focus pseudo-class), nor is the tab-order correctly 'entered'. Any ideas on how to resolve this? (results observed in Firefox 3.6.2)

  Read the article

• Capture link clickthrough events from Javascript

  - by Silver Dragon

  In order to track the overall user clickstream, I'd like to fire a javascript event, if the user right-clicks, and select "Open in new Tab" (or middle-clicks in most browsers) on a link. Most of these links are linking outside of my site, and I'd like to interfere with overall browser experience (such as: status bar, etc) as little as possible. What options are there to solve this?

  Read the article

• How to retrieve caller context object in Ruby ?

  - by David

  Hi, hereafter is my piece of code that I want to simplify in order to avoid passing an extra argument on each call : module M def do_something(context) puts "Called from #{context}" end module_function :do_something end class Foo def do_stuff M.do_something(self) end end Foo.new.do_stuff Is there a way to do the same think without passing 'self' as an input argument to 'do_something' method like this ? module M def do_something puts "Called from #{method that returns caller object}" end module_function :do_something end class Foo def do_stuff M.do_something end end Foo.new.do_stuff Thanks for your support!

  Read the article

• What design pattern will you choose ?

  - by MemoryLeak

  I want to design a class, which contains a procedure to achieve a goal. And it must follow some order to make sure the last method, let's say "ExecuteIt", to behave correctly. in such a case, what design patter will you use ? which can make sure that the user must call the public method according some ordering. If you really don't know what I am saying, then can you share me some concept of choosing a design patter, or what will you consider while design a class?

  Read the article

• Kernel - Finding written block numbers

  - by SpdStr

  Is there any way in the kernel to get a list of blocks that have been physically written to and the order in which they were written?

  Read the article

• How do I show mysql query results for fields that contain certain data?

  - by user272899

  I have a mysql query: $query = "SELECT * FROM movielist WHERE genre = 'comedy' ORDER BY dateadded DESC"; I need to change it so that it selects from movielist where genre contains 'comedy'. (Note: that my genre field will often contain more than one genre example "comedy, action, drama".

  Read the article

• A shortest path problem with superheroes and intergalactic journeys

  - by Dman

  You are a super-hero in the year 2222 and you are faced with this great challenge: starting from your home planet Ilop you must try to reach Acinhet or else your planet will be destroyed by evil green little monsters. To do this you are given a map of the universe: there are N planets and M inter-planetary connections ( bidirectional ) that bind these planets. Each connection requires a certain time and a certain amount of fuel in order for you to cover the connection from one planet to another. The total time spent going from one planet to another is obtained by multiplying the time past to cover each connection between all the planets you go through. There are some "key planets", that allow you to refuel if you arrive on those certain "key planets". A "key planet" is the planet with the property that if it disappears the road between at least two planets would be lost.(In the example posted below with the input/output files such a "key planet" is 2 because without it the road to 7 would be lost) When you start your mission you are given the possibility of choosing between K ships each with its own maximum fuel capacity. The goal is to find the SHORTEST TIME CONSUMING path but also choose the ship with the minimum fuel capacity that can cover that shortest path(this means that if more ships can cover the shortest path you choose the one with the minimum fuel capacity). Because the minimum time can be a rather large number (over long long int) you are asked to provide only the last 6 digits of the number. For a better understanding of the task, here is an example of input/output files: INPUT: mission.in 7 8 6 1 4 6 5 9 8 7 10 1 2 7 8 1 4 14 9 1 5 3 1 2 3 1 2 2 7 7 1 3 4 2 2 4 6 4 1 5 6 3 7 On the first line (in order): N M K On the second line :the number for the starting planet and the finishing planet On the third line :K numbers that represent the capacities of the ships you can choose from Then you have M lines, all of them have the same structure: Xi Yi Ti Fi-which means that there is a connection between Xi and Yi and you can cover the distance from Xi to Yi in Ti time and with a Fi fuel consumption. OUTPUT:mission.out 000014 8 1 2 3 4 On the first line:the minimum time and fuel consumption; On the second line :the path Restrictions: 2 = N = 1 000 1 = M = 30 000 1 = K = 10 000 Any suggestions or ideas of how this problem might be solved would be most welcomed.

  Read the article

• Join tables to get sold products

  - by latvian

  Hi, I am joining two tables 'sales/order_item_collection' and 'sales/orders' by 'order_id', so that afterward i can filter sold products by 'store_id' and 'product_name' Here is the code: $orderTable = Mage::getSingleton('core/resource')-getTableName('sales/order'); $itemsCollection= Mage::getResourceModel('sales/order_item_collection') -join(array('ord'=$orderTable),'e.order_id = ord.entity_id'); Why is this join not working? Thank you

  Read the article

• C#: How to programmatically compile a DLL with certain XML content in the resources of the DLL?

  - by shifuimam

  More specifically, I'm wanting to compile the XML required by Microsoft to create a GDF.dll file, in order to add a game to the Games Explorer in Windows 7. I found this KB article that explains how to programmatically compile source into a DLL or EXE, but I'm unsure how to properly compile a DLL that contains XML.

  Read the article

• How is this Nested Set SQL query converted into a LINQ query?

  - by Chad

  Querying a Nested Set Model table, here's the SQL... how can this be written in LINQ? SELECT parent.name FROM nested_category AS node, nested_category AS parent WHERE node.lft BETWEEN parent.lft AND parent.rgt AND node.name = 'FLASH' ORDER BY parent.lft; particularly, the FROM part... never tried to do anything like that in LINQ.

  Read the article

• Getting MySQL record count with C#

  - by she hates me

  Hello, I would like to know how can I get record count of a query with C#. Here is the code that I use.. MySqlDataReader recordset = null; query = new MySqlCommand("SELECT * FROM test ORDER BY type_ID ASC", this.conn); recordset = query.ExecuteReader(); while (recordset.Read()) { result.Add(recordset["type_ID"].ToString()); } return result;

  Read the article

• Maximum depth of a B-tree

  - by Phenom

  How do you figure out the maximum depth of a B-tree? Say you had a B-tree of order 1625, meaning each node has 1625 pointers and 1624 elements. What is the maximum depth of the tree if it contains 85,000,000 keys?

  Read the article

• anyone research DevExpress' source code ?

  - by MemoryLeak

  I want to study the source code of DevExpress, does anyone have any information about that ? Since I really don't know how to start to read it. if you are also researching the source code of devexpress and you would share it on your blog, then could you please give me your blog link ? EDIT: once you purchase the universal version it will offer you the source for debugging, please refer to https://www.devexpress.com/ClientCenter/Order/default.aspx?group=.NET

  Read the article

• How to determine the difference among dates in the same column?

  - by Vera

  How to determine the difference among dates of birth? +----------+----------+------------+ | id | name | birth | +----------+----------+------------+ | 00001 | Claws | 2010-04-17 | | 00002 | Claws | 2010-01-31 | | 00003 | Claws | 2009-11-31 | | 00004 | Claws | 2009-09-31 | | 00005 | Claws | 2009-07-31 | | 00006 | Claws | 2008-10-31 | +----------+----------+------------+ I would like to obtain this: +----------+----------+------------+------------------------------------------+ | id | name | birth | diff | +----------+----------+------------+------------------------------------------+ | 00001 | Claws | 2010-04-17 | diff (id1-id2) = 2010-01-31 - 2010-04-17 | | 00002 | Claws | 2010-01-31 | diff (id2-id3) = 2010-01-31 - 2009-11-31 | | 00003 | Claws | 2009-11-31 | diff (id3-id4) = 2010-01-31 - 2009-09-31 | If possible, ORDER BY diff DESC Thank you for helping Vera

  Read the article

• How stable are Cisco IOS OIDs for querying data with SNMP across different model devices?

  - by Daniel Papasian

  I'm querying a bunch of information from cisco switches using SNMP. For instance, I'm pulling information on neighbors detected using CDP by doing an snmpwalk on .1.3.6.1.4.1.9.9.23 Can I use this OID across different cisco models? What pitfalls should I be aware of? To me, I'm a little uneasy about using numeric OIDs - it seems like I should be using a MIB database or something and using the named OIDs, in order to gain cross-device compatibility, but perhaps I'm just imagining the need for that.

  Read the article

• Are there programs that iteratively write new programs?

  - by chris

  For about a year I have been thinking about writing a program that writes programs. This would primarily be a playful exercise that might teach me some new concepts. My inspiration came from negentropy and the ability for order to emerge from chaos and new chaos to arise out of order in infinite succession. To be more specific, the program would start by writing a short random string. If the string compiles the programs will log it for later comparison. If the string does not compile the program will try to rewrite it until it does compile. As more strings (mini 'useless' programs) are logged they can be parsed for similarities and used to generate a grammar. This grammar can then be drawn on to write more strings that have a higher probability of compilation than purely random strings. This is obviously more than a little silly, but I thought it would be fun to try and grow a program like this. And as a byproduct I get a bunch of unique programs that I can visualize and call art. I'll probably write this in Ruby due to its simple syntax and dynamic compilation and then I will visualize in processing using ruby-processing. What I would like to know is: Is there a name for this type of programming? What currently exists in this field? Who are the primary contributors? BONUS! - In what ways can I procedurally assign value to output programs beyond compiles(y/n)? I may want to extend the functionality of this program to generate a program based on parameters, but I want the program to define those parameters through running the programs that compile and assigning meaning to the programs output. This question is probably more involved than reasonable for a bonus, but if you can think of a simple way to get something like this done in less than 23 lines or one hyperlink, please toss it into your response. I know that this is not quite meta-programming and from the little I know of AI and generative algorithms they are usually more goal oriented than what I am thinking. What would be optimal is a program that continually rewrites and improves itself so I don't have to ^_^

  Read the article

• Mapping a property to a field from another table in NHibernate

  - by Khalil Dahab

  consider the following class: class Order { int OrderId {get; set;} int CustomerId {get; set;} string CustomerName {get; set;} //other fields go here } which is mapped to Orders table. Is it possible to map the property CustomerName to the Customers table through the foreign key relation?

  Read the article

• Java - Collections.sort() performance

  - by msr

  Hello, Im using Collections.sort() to sort a LinkedList whose elements implements Comparable interface, so they are sorted in a natural order. In the javadoc documentation its said this method uses mergesort algorithm wich has n*log(n) performance. My question is if there is a more efficient algorithm to sort my LinkedList? The size of that list could be very high and sort will be also very frequent. Thanks!

  Read the article

• multi word query in mysql

  - by salmane

  Hi there , in order to make things easier for users i want to add multiple keyword search to my site. so that in the input the user would do something like : " keyword1 keyword 2" ( similar to google for example. would i need to write a code that would parse that string and do queries based on that or is there something built in mysql that could do it?

  Read the article

< Previous Page | 260 261 262 263 264 265 266 267 268 269 270 271  | Next Page >