Search Results

Search found 21436 results on 858 pages for 'draw order'.

Page 623/858 | < Previous Page | 619 620 621 622 623 624 625 626 627 628 629 630  | Next Page >

• How to query one table and add rows to another using that first query? MySQL

  - by Nickelbids

  Hello, I have some users setup in a MySQL table with different variables. I am trying to figure out what would be the best way to do this. Basically I want to award all of my registered and active users with bids which are stored in another table. So for the Table "users" I have ran this query: SELECT * FROM users WHERE active = 1 AND admin = 0 ORDER BY users.id ASC Which will show all active users who are not administrators. Now I would like to give each one of these users which are identified by the "ID" field in another table. So in the "bids" table I would need to add a new row for each one of those users with all of the same values except for the "user_id" field which will basically match the "id" field of the table "users" What would be the best approach for this. There are approximately 6,000+ users coming up in the first query. Please be gentle as I am not a programmer. Just need some friendly advice.

  Read the article

• Trying to exlcude VTI* paths in MSIDXS sql select statement

  - by Catdirt

  Hi, using a c# asp.net page, building a SQL query string to run against an index server catalog: string SQL = "SELECT doctitle, vpath, Path, Write, Size, Rank "; SQL += "FROM \"" + strCatalog + "\"..SCOPE() "; SQL += "WHERE"; SQL += " CONTAINS(Contents, '" + strQP + "') "; SQL += "AND NOT CONTAINS(Path, '\"_vti_\"') "; SQL += "AND NOT CONTAINS(FileName, '\".ascx\" OR \".config\" OR \".css\"') "; SQL += "ORDER BY Rank DESC"; Seems to work fine, except it will return results in the _vti_ directories which I am trying to avoid. Edit: All but asked question, so to be technical: How can I search the index and have it not return files from the vti folders? Switching to use an ixsso query object is possible, but i'd rather avoid it for this particular instance.

  Read the article

• Is there a circular hash function?

  - by Phil H

  Thinking about this question on testing string rotation, I wondered: Is there was such thing as a circular/cyclic hash function? E.g. h(abcdef) = h(bcdefa) = h(cdefab) etc Uses for this include scalable algorithms which can check n strings against each other to see where some are rotations of others. I suppose the essence of the hash is to extract information which is order-specific but not position-specific. Maybe something that finds a deterministic 'first position', rotates to it and hashes the result? It all seems plausible, but slightly beyond my grasp at the moment; it must be out there already...

  Read the article

• Vew not updating after scope update

  - by bsparacino

  Here is a very simple example of what I am trying to do Athlete.save(athlete,function(result) { $scope.athlete = result.athlete; }); The issue is that the $scope.athlete variable does not update in my view. In order to get it to update I have to do this Athlete.save(athlete,function(result) { $scope.athlete.fname = result.athlete.fname; $scope.athlete.lname= result.athlete.lname; $scope.athlete.gender= result.athlete.gender; .... }); This gets annoying very quickly. With the first block of code it's as if angular does not know that my $scope.athlete variable has been updated. This function is triggered from an ng-click, not some jquery call, I am doing it the angular way as far as I know. here is a simpler case I made: http://plnkr.co/edit/lMCPbzqDOoa5K4GXGhCp

  Read the article

• Updating cached counts in MySQL

  - by phleet

  In order to fix a bug, I have to iterate over all the rows in a table, updating a cached count of children to what its real value should be. The structure of the things in the table form a tree. In rails, the following does what I want: Thing.all.each do |th| Thing.connection.update( " UPDATE #{Thing.quoted_table_name} SET children_count = #{th.children.count} WHERE id = #{th.id} " ) end Is there any way of doing this in a single MySQL query? Alternatively, is there any way of doing this in multiple queries, but in pure MySQL? I want something like UPDATE table_name SET children_count = ( SELECT COUNT(*) FROM table_name AS tbl WHERE tbl.parent_id = table_name.id ) except the above doesn't work (I understand why it doesn't).

  Read the article

• Can hash tables really be O(1)

  - by drawnonward

  It seems to be common knowledge that hash tables can achieve O(1) but that has never made sense to me. Can someone please explain it? A. The value is an int smaller than the size of the hash table, so the value is its own hash, so there is no hash table but if there was it would be O(1) and still be inefficient. B. You have to calculate the hash, so the order is O(n) for the size of the data being looked up. The lookup might be O(1) after you do O(n) work, but that still comes out to O(n) in my eyes. And unless you have a perfect hash or a large hash table there are probably several items per bucket so it devolves into a small linear search at some point anyway. I think hash tables are awesome, but I do not get the O(1) designation unless it is just supposed to be theoretical.

  Read the article

• How does the #! work?

  - by mocybin

  In a script you must include a #! on the first line followed by the path to the program that will execute the script (e.g.: sh, perl). As far as I know though, the # character denotes the start of a comment and that line is supposed to be ignored by the program executing the script. It would seem though, that this first line is at some point read by something in order for the script to be executed by the proper program. Could somebody please shed more light on the workings of the #! ? Edit: I'm really curious about this, so the more in-depth the answer the better.

  Read the article

• jQuery finding 'nth-child' value

  - by Rich

  Hi, I have a ul set up as navigation, which I'll be animating on hover. As all the nav items are different widths, I'll be storing their default widths in an Array, so that on hover out, these widths can be passed back in to the animate method. What I need is a way to find what 'nth-child' the element is in order to retrieve the correct width from the array. Something like: var count = $(this).count(); //obviously this isn't right! So that then I can do: $(this).animate({'width':array(count)}, 400); Any suggestions would help me a lot - and if there's a better way to do this kind of thing I'd gladly accept pointers!

  Read the article

• Elegant way to search for UTF-8 files with BOM?

  - by vog

  For debugging purposes, I need to recursively search a directory for all files which start with a UTF-8 byte order mark (BOM). My current solution is a simple shell script: find -type f | while read file do if [ "`head -c 3 -- "$file"`" == $'\xef\xbb\xbf' ] then echo "found BOM in: $file" fi done Or, if you prefer short, unreadable one-liners: find -type f|while read file;do [ "`head -c3 -- "$file"`" == $'\xef\xbb\xbf' ] && echo "found BOM in: $file";done It doesn't work with filenames that contain a line break, but such files are not to be expected anyway. Is there any shorter or more elegant solution? Are there any interesting text editors or macros for text editors?

  Read the article

• Where can I find a compact programming keyboard with logical key placement?

  - by Lefler

  I recently, at the order of my chiropractor, bought a laptop stand to elevate my screen. A result of this is that I need a standalone keyboard. Normal keyboards have numeric keypads on the right side, which moves my mouse further to the right... not an optimal position chiropractically speaking. I don't use the numeric keypad, but all the compact keyboards I can find use some random placement algorithm on the arrow, page up/down, and most importantly -- the insert,delete,home and end keys. Those misplaced keys are crippling my code entry. Does anyone know of a keyboard that is minus the keypad, but places those VERY IMPORTANT keys in a more standard position?

  Read the article

• Improve C function performance with cache locality?

  - by Christoper Hans

  I have to find a diagonal difference in a matrix represented as 2d array and the function prototype is int diagonal_diff(int x[512][512]) I have to use a 2d array, and the data is 512x512. This is tested on a SPARC machine: my current timing is 6ms but I need to be under 2ms. Sample data: [3][4][5][9] [2][8][9][4] [6][9][7][3] [5][8][8][2] The difference is: |4-2| + |5-6| + |9-5| + |9-9| + |4-8| + |3-8| = 2 + 1 + 4 + 0 + 4 + 5 = 16 In order to do that, I use the following algorithm: int i,j,result=0; for(i=0; i<4; i++) for(j=0; j<4; j++) result+=abs(array[i][j]-[j][i]); return result; But this algorithm keeps accessing the column, row, column, row, etc which make inefficient use of cache. Is there a way to improve my function?

  Read the article

• In B-trees which element gets promoted when the node splits

  - by Phenom

  Let's say there is a B-tree of order 8. This means it can have 8 pointers and 7 elements. Say the letters A through G are stored in this B-tree. So this B-tree is just a single node containing 7 elements. Then you try to insert J into the tree. There's no room, so you have to split the node and create a new root node. Which element gets promoted up into the root node?

  Read the article

• SP: Random Records, Fave Record, Plus Known Record, NO repetition.

  - by Munklefish

  Hi, Thanks to help from a lot of you guys ive been given the following code which works great. However ive realised ive missed an important bit of info out of the question and so have reposted here (with updated code) to clarify. The following code gets 5 random records from a table plus a further single record based on the users favourite as identified in a second table: CREATE PROCEDURE web.getRandomCharities ( @tmp_ID bigint --members ID ) AS BEGIN WITH q AS ( SELECT TOP 5 * FROM TBL_CHARITIES WHERE cha_Active = 'TRUE' AND cha_Key != '1' ORDER BY NEWID() ) SELECT * FROM q UNION ALL SELECT TOP 1 * FROM ( SELECT * FROM TBL_CHARITIES WHERE TBL_CHARITIES.cha_Key IN ( SELECT members_Favourite FROM TBL_MEMBERS WHERE members_Id = @tmp_ID ) EXCEPT SELECT * FROM q ) tc END However, i realised i also need to include the record where "cha_Key == '1'" if it isnt the same as the record returned in the second SELECT statement in the code shown above. HOpe that makes sense? THANKS!!!

  Read the article

• sequencing function calls in javascript - are callbacks the only way?

  - by tim

  I read through various threads like this one for example. But it really escapes me how to accomplish the following: I have 4 functions, and want them happen one after another in sequence. Notice they are in incorrect order, to get my point across. I want the result that will output "1, 2, 3, 4' function firstFunction(){ // some very time consuming asynchronous code... console.log('1'); } function thirdFunction(){ // definitely dont wanna do this until secondFunction is finished console.log('3'); } function secondFunction(){ // waits for firstFunction to be completed console.log('2'); } function fourthFunction(){ // last function, not executed until the other 3 are done. console.log('4'); } I tried to figure out callbacks but am getting lost :( Isn't there some simple way to do this? Like looping through an array...

  Read the article

• Help needed in pivoting (SQL Server 2005)

  - by Newbie

  I have a table like ID Grps Vals --- ---- ----- 1 1 1 1 1 3 1 1 45 1 2 23 1 2 34 1 2 66 1 3 10 1 3 17 1 3 77 2 1 144 2 1 344 2 1 555 2 2 11 2 2 22 2 2 33 2 3 55 2 3 67 2 3 77 The desired output being ID Record1 Record2 Record3 --- ------- ------- ------- 1 1 23 10 1 3 34 17 1 45 66 77 2 144 11 55 2 344 22 67 2 555 33 77 I have tried(using while loop) but the program is running slow. I have been asked to do so by using SET based approach. My approach so far is SELECT ID,[1] AS [Record1], [2] AS [Record2], [3] as [Record3] FROM ( Select Row_Number() Over(Partition By ID Order By Vals) records ,* From myTable)x PIVOT (MAX(vals) FOR Grps IN ([1],[2],[3])) p But it is not working. Can any one please help to solve this.(SQL SERVER 2005)

  Read the article

• How to roeder the rows of one matrix with respect to the other matrix?

  - by user2806363

  I have two big matrices A and B with diffrent dimensions.I want to order the rows of matrix B with respect to rows of the matrix A. and add the rows with values 0 to matrix B, if that row is not exist in B but in A Here is the reproduceable example and expected output: A<-matrix(c(1:40), ncol=8) rownames(A)<-c("B", "A", "C", "D", "E") > A [,1] [,2] [,3] [,4] [,5] [,6] [,7] [,8] B 1 6 11 16 21 26 31 36 A 2 7 12 17 22 27 32 37 C 3 8 13 18 23 28 33 38 D 4 9 14 19 24 29 34 39 E 5 10 15 20 25 30 35 40 > B<-matrix(c(100:108),ncol=3) rownames(B)<-c("A", "E", "C") > B [,1] [,2] [,3] A 100 103 106 E 101 104 107 C 102 105 108 Here is the Expected output : >B [,1] [,2] [,3] B 0 0 0 A 100 103 106 C 102 105 108 D 0 0 0 E 101 104 107 > Would someone help me to implement this in R ?

  Read the article

• Using these 2 build options in Visual Studio

  - by dotnetdev

  When I debug a project and there is an error in my code (e.g. a method returns something and when I consume that method, I don't put the returned data into a variable) the popup asking me to run the last successful build comes up. How exactly do I configure this? Also, in what scenario does the Visual Studio build order come in handy? I once built a solution, and it couldn't build one project because a dependent project was not built beforehand. I guess this one possible scenario? Any others? Thanks

  Read the article

• Search box inside a div. Django

  - by Juliette Dupuis

  In my django app I display a list of elements (friends name) thanks to a loop: <div> {% for friend in group %} <p>{{ friend.name }} <p> {% endfor %} </div> I would like to create a search box on the top of my list in order to be able to find only the friends the user wants. I would like the search bar does not need to click to send the request (an example is the Airtime searchbox on top of the facebook friends list). I have absolutely no idea on how to do that, and I'm looking for hints or tips to start. Thank you very much for your help.

  Read the article

• Recursive MySQL function call eats up too much memory and dies.

  - by kylex

  I have the following recursive function which works... up until a point. Then the script asks for more memory once the queries exceed about 100, and when I add more memory, the script typically just dies (I end up with a white screen on my browser). public function returnPArray($parent=0,$depth=0,$orderBy = 'showOrder ASC'){ $query = mysql_query("SELECT *, UNIX_TIMESTAMP(lastDate) AS whenTime FROM these_pages WHERE parent = '".$parent."' AND deleted = 'N' ORDER BY ".$orderBy.""); $rows = mysql_num_rows($query); while($row = mysql_fetch_assoc($query)){ // This uses my class and places the content in an array. MyClass::$_navArray[] = array( 'id' => $row['id'], 'parent' => $row['parent'] ); MyClass::returnPArray($row['id'],($depth+1)); } $i++; } Can anyone help me make this query less resource intensive?

  Read the article

• Concatenate and group multiple rows in Oracle

  - by user1693347

  Suppose I have a table like this: NAME GROUP name1 groupA name2 groupB name5 groupC name4 groupA name3 groupC I'd like to have a result like this: GROUP NAMES groupA name1,name4 groupB name2 groupC name3,name5 If there were only one column in the table, I could concatenate the records by doing the following, but with grouping in the context, I really don't have much idea. Any suggestion is welcome, thanks in advance! Concatatenating one column table: SELECT names FROM (SELECT SYS_CONNECT_BY_PATH(names,' ') names, level FROM name_table START WITH names = (SELECT names FROM name_table WHERE rownum = 1) CONNECT BY PRIOR names < names ORDER BY level DESC) WHERE rownum = 1

  Read the article

• [.NET][C#] - Is possible to get a web with its links (CSS,JavaScript,Images, CSS-Images) ?

  - by Efrain

  Hi there, I am implementing a CMS, the case is that the "Web-Editable" is in a different domain thus, I would be able just get the page using HttpRequest in order to copy and show it in the CMS server to make it able to change it (DOM just visual purpose) and save the changes to the CSS and JavaScript folder on the "Web-Editable" using FTP. I am not allow to download all the information included on the "Web-Editable" trough the FTP, and there are other dinamic images as well comming from a private database. The question is, anyone knows how to make a httprequest "cascade" to get all the 1st level information you see when you visit a Web? Thank you in advance, Efrain

  Read the article

• Hibernate: delete many-to-many association

  - by Bar

  I have two tables with the many-to-many association. — DB fragment: loads Id Name sessions Id Date sessionsloads LoadId SessionId — Hibernate mapping fragments: /* loads.hbm.xml */ <set name="sessions" table="sessionsloads" inverse="true"> <key column="LoadId" /> <many-to-many column="SessionId" class="Session" /> </set> … /* sessions.hbm.xml */ <set name="loads" table="sessionsloads"> <key column="SessionId" /> <many-to-many column="LoadId" class="Load" /> </set> In order to remove one entry from the association table sessionsloads, I execute this code: Session session = sessionDao.getObject(sessionId); Load load = loadDao.getObject(loadId); load.getSessions().remove(session); loadDao.saveObject(load); But, after launching, this code change nothing. What's the right way to remove an association?

  Read the article

• The right way to implement communication between java objects

  - by imoschak

  I'm working on an academic project which simulates a rather large queuing procedure in java. The core of the simulator rests within one package where there exist 8 classes each one implementing a single concept. Every class in the project follows SRP. These classes encapsulate the behavior of the simulator and inter-connect every other class in the project. The problem that I has arisen is that most of these 8 classes are, as is logical i think, tightly coupled and each one has to have working knowledge of every other class in this package in order to be able to call methods from it when needed. The application needs only one instance of each class so it might be better to create static fields for each class in a new class and use that to make calls -instead of preserving a reference in each class for every other class in the package (which I'm certain that is incorrect)-, but is this considered a correct design solution? or is there a design pattern maybe that better suits my needs?

  Read the article

• C# Generics Multiple Inheritance Problem

  - by Ciemnl

  Can any one help me with this syntax issue with C#? I have no idea how to do it. class SomeClass<T> : SomeOtherClass<T> where T : ISomeInterface , IAnotherInterface { ... } I want SomeClass to inherit from SomeOtherClass and IAnotherInterface and for T to inherit ISomeInterface only It seems the problem is that the where keyword screws everything up so that the compiler thinks both ISomeInterface and IAnotherInterface should both be inherited by T. This problem is very annoying and I think the solution is some kind of parenthesis but I have tried and failed finding one that works. Also, switching around the order of the two items inherited from SomeClass does not work because the class inherited always has to come before any interfaces. I couldn't find any solutions on the MSDN C# generics pages and I can't beleive I'm the first person to have this problem. Thanks, any help is much appreciated!

  Read the article

• Customizing compare in bsearch()

  - by Richard Smith

  I have an array of addresses that point to integers ( these integers are sorted in ascending order). They have duplicate values. Ex: 1, 2, 2, 3, 3, 3, 3, 4, 4...... I am trying to get hold of all the values that are greater than a certain value(key). Currently trying to implement it using binary search algo - void *bsearch( const void *key, const void *base, size_t num, size_t width, int ( __cdecl *compare ) ( const void *, const void *) ); I am not able to achieve this completely, but for some of them. Would there be any other way to get hold of all the values of the array, with out changing the algorithm I am using?

  Read the article

< Previous Page | 619 620 621 622 623 624 625 626 627 628 629 630  | Next Page >