Search Results

Search found 18329 results on 734 pages for 'interpret order'.

Page 33/734 | < Previous Page | 29 30 31 32 33 34 35 36 37 38 39 40  | Next Page >

• MySQL Locks: order of unblocked threads

  - by teehoo

  I have a MySQL ISAM table being accessed my multiple php instances. Right now I'm using a WRITE lock to serialize access to this table. My question is how do I ensure that the PHP instances get served on a First-Come-First-Serve basis? Or is this the default behaviour? The official MySQL documentation doesn't mention anything about the blocked thread order for threads of the same lock type (ie multiple threads attempting a WRITE LOCK). It only mentions that a WRITER will jump to the front of the waiting queue if READERS are waiting.

  Read the article

• Generate (in R) a matrix of all possible outcomes for throwing n dice (ignoring order)

  - by Brani

  In cases where order does matter, it's rather easy to generate the matrix of all possible outcomes. One way for doing this is using expand.grid as shown here. What if it doesn't? If I'm right, the number of possible combinations is (S+N-1)!/S!(N-1)!, where S is the number of dice, each with N sides numbered 1 through N. (It is different from the well known combinations formula because it is possible for the same number to appear on more than one dice). For example, when throwing four six-sided dice, N=6 and S=4, so the number of possible combinations is (4+6-1)!/4!(6-1)! = 9!/4!x5! = 126. How can I generate a matrix of these 126 possible outcomes? Thank you.

  Read the article

• jquery $.GET loading order

  - by welovedesign

  I am loading all external pages in jquery for a slider. The problem is it loads in a different order. What I need to do is sequence the loading of pages $.get("page1.php", function( my_var ) { $('#slider').append($('.content', my_var)); }); $.get("page2.php", function( my_var ) { $('#slider').append($('.content', my_var)); }); $.get("page3.php", function( my_var ) { $('#slider').append($('.content', my_var)); }); sometimes page3 loads before page2.

  Read the article

• discrepancy in using AsyncTask, code is executed in weird order

  - by Pentium10

  Hello, In onCreate method I hav the following order of code objItem = new DbClass(this);//the onCreate event creates the database new PrepareAdapter1().execute();//this task uses the tables, but SQLException occures, tables doesn't exists As you see in my short code, I get a new instance of the SQLiteOpenHelper class, which does create the tables in onCreate. And after that I start an AsyncTask instance where I use the created table. But I get SQLiteException as table doesn't not exists. I am using this code in wrong way? I expect the table to be created when I launch the thread.

  Read the article

• Force column order, Excel data table

  - by Chris

  I have a Excel Workbook that I use as a report template. I change the datasource on each pivot and datatable in a C# app. When I change the datatable datasource it tweeks the columns. Is there a way to force the column order? private void RefreshRawData(string dataSource, string connection) { xl._Worksheet ws = (xl._Worksheet)xlTemplate.Worksheets["Raw Data"]; xl.ListObject table = ws.ListObjects["Table_ExternalData_1"]; xl.QueryTable qt = table.QueryTable; qt.CommandText = dataSource; qt.Connection = GetExcelConnectionString((string)qt.Connection); qt.BackgroundQuery = false; qt.Refresh(m); Marshal.ReleaseComObject(ws); Marshal.ReleaseComObject(table); Marshal.ReleaseComObject(qt); ws = null; table = null; qt = null; }

  Read the article

• c++11 atomic ordering: extended total order memory_order_seq_cst for locks

  - by itaj

  There's this note in c++11 29.3-p3: [ Note: Although it is not explicitly required that S include locks, it can always be extended to an order that does include lock and unlock operations, since the ordering between those is already included in the "happens before" ordering. - end note ] What does it mean by "always"? I can understand that any certain implementation can be designed to support such an extended S. But in some general implementation that wasn't designed for it, I don't see that S can be extended so. I had sent this question to comp.std.c++ but got no answers there. http://groups.google.com/group/comp.std.c++/browse_frm/thread/5242fa70d0594d1b#

  Read the article

• LINQ in SQLite for Windows store app does not have 'ThenBy' to order by multiple columns

  - by user1131657

  I have a Windows 8 store application and I'm using the latest version on SQLite for my database. So I want to return some records from the database and I want to order them by more that one column. However SQLite doesn't seem to have the ThenBy statement? So my LINQ statement is below: from i in connection.Table<MyTable>() where i.Type == type orderby i.Usage_Counter // ThenBy i.ID select i); So how do I sort by multiple columns in SQLite without doing another LINQ statement?

  Read the article

• Does std::multiset guarantee insertion order?

  - by Naveen

  I have a std::multiset which stores elements of class A. I have provided my own implementation of operator< for this class. My question is if I insert two equivalent objects into this multiset is their order guaranteed? For example, first I insert a object a1 into the set and then I insert an equivalent object a2 into this set. Can I expect the a1 to come before a2 when I iterate through the set? If no, is there any way to achieve this using multiset?

  Read the article

• changing order of items in tkinter listbox

  - by user1104854

  Is there an easier way to change the order of items in a tkinter listbox than deleting the values for specific key, then re-entering new info? For example, I want to be able to re-arrange items in a listbox. If I want to swap the position of two, this is what I've done. It works, but I just want to see if there's a quicker way to do this. def moveup(self,selection): value1 = int(selection[0]) - 1 #value to be moved down one position value2 = selection #value to be moved up one position nameAbove = self.fileListSorted.get(value1) #name to be moved down nameBelow = self.fileListSorted.get(value2) #name to be moved up self.fileListSorted.delete(value1,value1) self.fileListSorted.insert(value1,nameBelow) self.fileListSorted.delete(value2,value2) self.fileListSorted.insert(value2,nameAbove)

  Read the article

• Generate a matrix of all possible outcomes for throwing n dice (ignoring order)

  - by Brani

  In cases where order does matter, it's rather easy to generate the matrix of all possible outcomes. One way for doing this is using expand.grid as shown here. What if it doesn't? If I'm right, the number of possible combinations is (S+N-1)!/S!(N-1)!, where S is the number of dice, each with N sides numbered 1 through N. (It is different from the well known combinations formula because it is possible for the same number to appear on more than one dice). For example, when throwing four six-sided dice, N=6 and S=4, so the number of possible combinations is (4+6-1)!/4!(6-1)! = 9!/4!x5! = 126. How can I generate a matrix of these 126 possible outcomes? Thank you.

  Read the article

• Why isn't my IO executed in order?

  - by HaskellElephant

  Hi, I'm having some fun learning about the haskell IO. However in my recent exploration of it I have encountered some problems with IO not executing in order, even inside a do construct. In the following code I am just keeping track of what cards are left, where the card is a tuple of chars (one for suit and one for value) then the user is continously asked for wich cards have been played. I want the putStr to be executed between each input, and not at the very end like it is now. module Main where main = doLoop cards doLoop xs = do putStr $ show xs s <- getChar n <- getChar doLoop $ remove (s,n) xs suits = "SCDH" vals = "A23456789JQK" cards = [(s,n) | s <- suits, n <- vals] type Card = (Char,Char) remove :: Card -> [Card] -> [Card] remove card xs = filter (/= card) xs

  Read the article

• JS assignment order of properties in objects

  - by devdev

  Just had a quick question about why a certain order of assignment works and another doesn't. I wanted to create a simple "inherit" / "copy" function (just for testing it) that copies properties from one object to another: var cat = { tail:"yes", hairy:"yes, hairy" }; var dog = { sick:"extremely ill"}; function inherit(obj1, obj2) { for (var p in obj1) { obj2[p] = obj1[p]; // this works, but "obj1[p] = obj2[p];" doesn't. Why?? } } inherit(cat, dog); console.log(dog.tail);

  Read the article

• Order objects for Northwind Access database

  - by Artem Shnayder

  I need to build two objects: an OrderList and an Order. Using those two objects, I have to populate a DataGridView with a history of the orders. However, I am instructed not to use binding sources for the connection or other drag and drop controls. Unfortunately, from Google it seems like those are the most popular options for this type of problem. Can anyone point me in the right direction? I don't have much experience with C#. Thanks.

  Read the article

• Rails ActiveRecord - How to set association save order

  - by Altonymous

  I have a weird relationship that needs to be maintained for legacy processes. I'm trying to figure out how to create the relationship given the new model association. New Relationship Setup Machine has_many MachineReadings has_many Disks has_many DiskReadings Old Relationship Setup Machine has_many MachineReadings has_many DiskReadings has_many Disks The problem is data will come in on the Machine model as nested attributes using the new relationship setup. I need to update the machine_reading_id in the DiskReading model so the old association can continue to be used. I tried doing this via an after_save hook that would traverse back up to the machine and then down to the readings to get the machine_reading.id so I could populate the DiskReading model. However, the associations aren't being saved in the order I would expect. They are saving the Disks & DiskReadings before saving the MachineReadings. So when I go after the machine_reading.id it hasn't been written and thus I am unable to get access to it. For example: #machine_disk_reading.rb after_save :build_old_relationship def build_old_relationship self.machine_reading_id = self.disk.machine.readings.find_by_date_time(self.date_time).id end

  Read the article

• Order of declaration in an anonymous pl/sql block

  - by RenderIn

  I have an anonymous pl/sql block with a procedure declared inside of it as well as a cursor. If I declare the procedure before the cursor it fails. Is there a requirement that cursors be declared prior to procedures? What other rules are there for order of declaration in a pl/sql block? This works: DECLARE cursor cur is select 1 from dual; procedure foo as begin null; end foo; BEGIN null; END; This fails with error PLS-00103: Encountered the symbol "CURSOR" when expecting one of the following: begin function package pragma procedure form DECLARE procedure foo as begin null; end foo; cursor cur is select 1 from dual; BEGIN null; END;

  Read the article

• what are most important things that i must know in order to jump into silverlight development

  - by Poni

  I have vast programming knowledge; C++/C#/ActionScript/ASM/PHP..... so learning the language of SilverLight itself isn't of an issue. To keep long story short, when asking this question I'm asking it as a developer who's coming from Flash world - great graphics/sounds/media support, fully cross-platform, ability to combine several SWFs within a "movie" (which also implies code reusability). A Flash developer have pretty much freedom. What are most important things that i must know in order to jump into silverlight development? Did you already make the move to SilverLight from Flash yourself? Are you a "guru" at both? Great, let's hear what you have to say - developer to developer! =)

  Read the article

• Unexpected behaviour of Order by clause(SQL SERVER 2005)

  - by Newbie

  I have a table which looks like Col1 col2 col3 col4 col5 1 5 1 4 6 1 4 0 3 7 0 1 5 6 3 1 8 2 1 5 4 3 2 1 4 The script is declare @t table(col1 int, col2 int, col3 int,col4 int,col5 int) insert into @t select 1,5,1,4,6 union all select 1,4,0,3,7 union all select 0,1,5,6,3 union all select 1,8,2,1,5 union all select 4,3,2,1,4 If I do a sorting (ascending), the output is Col1 col2 col3 col4 col5 0 1 5 6 3 1 4 0 3 7 1 5 1 4 6 1 8 2 1 5 4 3 2 1 4 The query is Select * from @t order by col1,col2,col3,col4,col5 But as can be seen that the sorting output is wrong (col2 to col5). Why so and how to overcome this? Thanks in advance

  Read the article

• C# logic order and compiler behavior

  - by Terrapin

  In C#, (and feel free to answer for other languages), what order does the runtime evaluate a logic statement? Example: DataTable myDt = new DataTable(); if (myDt != null && myDt.Rows.Count > 0) { //do some stuff with myDt } Which statement does the runtime evaluate first - myDt != null or: myDt.Rows.Count > 0 ? Is there a time when the compiler would ever evaluate the statement backwards? Perhaps when an "OR" operator is involved?

  Read the article

• MySQL: Order by time (MM:SS)?

  - by Shpigford

  I'm currently storing various metadata about videos and one of those bits of data is the length of a video. So if a video is 10 minutes 35 seconds long, it's saved as "10:35" in the database. But what I'd like to do is retrieve a listing of videos by length (longest first, shortest last). The problem I'm having is that if a video is "2:56", it's coming up as longest because the number 2 is more than the number 1 in. So, how can I order data based on that length field so that "10:35" is recognized as being longer than "2:56" (as per my example)?

  Read the article

• IB z-order on simulator 6.0

  - by Stanley

  Consider the above's IB objects listing. Siblings further down the list should be on top of the siblings listed further up when rendered on the screen. Under Xcode 4.5.2, everything is ok if iphone simulator 5.1 is used. But for simulator 6.0 the map just covers everything. The same if using actual devices (phones) for testing. Hope that somebody knowledgeable could help. Please also add comments if you do not find such a problem on simulator 6.0. Because chances are the problem is related to how my project is setup. Update : Have setup a test project with the iOS 6 map view. There seems to be no problem with the z-order. So the problem should relate to my code.

  Read the article

• select similar value from MySQL and order the result

  - by mathew

  how do I order this result?? $range = 5; // you'll be selecting around this range. $min = $rank - $range; $max = $rank + $range; $limit = 10; // max number of results you want. $result = mysql_query("select * from table where rank between $min and $max limit $limit"); while($row = mysql_fetch_array($result)) { echo $row['name']."&nbsp;-&nbsp;".$row['rank']."<br>"; }

  Read the article

• How to order my objects in a C++ class correctly

  - by Julen

  Hello, I have been coding regurlarly in C++ in the past months. I am getting used to it step by step... but there are things that confuse me about formatting. I know there is a lot of legacy from C that I supousee mixes with C++. This time I have doubts about how to order properly my members and functions within in a class. Also considering their access modifiers. How is the convention in this? Until know I am doing everything "public" and writing first constructor of class, then destructor, next members and finally functions. It this correct? What happens when introducing "private" and "protected" access modifiers or "virtual" functions? From the documents I have look in the Internet there is different ways of doing things. But my questions aims to get the knowledge from a community that develops in C++ that I want to blend into. ;-) Thanks a lot!!!

  Read the article

• ASP.NET MVC 2 model properties binding order

  - by bniwredyc

  Is there a way to change order in which the default binder binds property values of model? For example I have model class A: class A { public string A1 {get; set;} public string A2 {get; set;} } and action DoSomethig: public ActionResult DoSomething(A model) { ... } I want that A2 property has been bound before the A1 property. Is it possible? Or I need to write custom binder?

  Read the article

• Rspec: "array.should == another_array" but without concern for order

  - by nicholaides

  I often want to compare arrays and make sure that they contain the same elements, in any order. IS there a consise way to do this in RSpec? Here are methods that aren't acceptable: #to_set For example: array.to_set.should == another_array.to_set This fails when the arrays contain duplicate items. #sort For example: array.sort.should == another_array.sort This fails when the arrays elements don't implement #<=> #size and #to_set For example: array.to_set.should == another_array.to_set array.size.should == another_array.size This would work, but there's got to be a better way.

  Read the article

• How to save an order (permutation) in an sql db

  - by Bendlas

  I have a tree structure in an sql table like so: CREATE TABLE containers ( container_id serial NOT NULL PRIMARY KEY, parent integer REFERENCES containers (container_id)) Now i want to define an ordering between nodes with the same parent. I Have thought of adding a node_index column, to ORDER BY, but that seem suboptimal, since that involves modifying the index of a lot of nodes when modifying the stucture. That could include adding, removing, reordering or moving nodes from some subtree to another. Is there a sql datatype for an ordered sequence, or an efficient way to emulate one? Doesn't need to be fully standard sql, I just need a solution for mssql and hopefully postgresql EDIT To make it clear, the ordering is arbitrary. Actually, the user will be able to drag'n'drop tree nodes in the GUI

  Read the article

< Previous Page | 29 30 31 32 33 34 35 36 37 38 39 40  | Next Page >