Search Results

Search found 59569 results on 2383 pages for 'data theory'.

Page 410/2383 | < Previous Page | 406 407 408 409 410 411 412 413 414 415 416 417  | Next Page >

  • How is push()ing and pop()ping defined?

    - by Helper Method
    I know how the push() and pop() methods in a typical implementation of a Queue/Linked List work but what I do want to know is what you actually define as a push or a pop? When can you name a method push()/pop()? What makes the insert()/add() method in a typical Tree implementation not a push()? My understanding is that push()ing means putting something to a position some special pointer is pointing to, and pop()ping an element means putting some object away some pointer is pointing to, but it doesn't seem to be clearly defined. Or does the naming matter at all?

    Read the article

  • hash table with chaining method program freezing

    - by Justin Carrey
    I am implementing hash table in C using linked list chaining method. The program compiles but when inserting a string in hash table, the program freezes and gets stuck. The program is below: struct llist{ char *s; struct llist *next; }; struct llist *a[100]; void hinsert(char *str){ int strint, hashinp; strint = 0; hashinp = 0; while(*str){ strint = strint+(*str); } hashinp = (strint%100); if(a[hashinp] == NULL){ struct llist *node; node = (struct llist *)malloc(sizeof(struct llist)); node->s = str; node->next = NULL; a[hashinp] = node; } else{ struct llist *node, *ptr; node = (struct llist *)malloc(sizeof(struct llist)); node->s = str; node->next = NULL; ptr = a[hashinp]; while(ptr->next != NULL){ ptr = ptr->next; } ptr->next = node; } } void hsearch(char *strsrch){ int strint1, hashinp1; strint1 = 0; hashinp1 = 0; while(*strsrch){ strint1 = strint1+(*strsrch); } hashinp1 = (strint1%100); struct llist *ptr1; ptr1 = a[hashinp1]; while(ptr1 != NULL){ if(ptr1->s == strsrch){ cout << "Element Found\n"; break; } else{ ptr1 = ptr1->next; } } if(ptr1 == NULL){ cout << "Element Not Found\n"; } } hinsert() is to insert elements into hash and hsearch is to search an element in the hash. Hash function is written inside hinsert() itself. In the main(), what i am initializing all the elements in a[] to be NULL like this: for(int i = 0;i < 100; i++){ a[i] = NULL; } Help is very much appreciated. Thanks !

    Read the article

  • How to POST data to an HTTP page from an HTTPS page

    - by buster55
    I know this is a long shot, but I figured I'd ask the question anyway. I have an HTTPS page and am dynamically creating a form. I want to POST the form to an HTTP page. Is this possible without the browser popping up a warning? When I do this on IE8, I get the following message: Do you want to view only the webpage content that was delivered securely? Essentially, I'm asking about the inverse of question 1554237.

    Read the article

  • Data from two tables without repeating data from the first?

    - by Aran
    I have two tables. Users table and Users Meta Table I am looking for a way to get all the information out of both tables with one query. But without repeating the information from Users table. This is all information relating to the users id number as well. So for example user_id = 1. Is there a way to query the database and collect all the information I from both tables without repeating the information from the first?

    Read the article

  • Is it possible to implement a lightweight database using Blackberry Persistance options?

    - by Tobias
    First I would like to explain why I want to use alternate Blackberry Persistance options rather than a Blackberry database itself, say SQLite. The reason is that the application i'm designing, I want it to be used in all the previous versions of Blackberry rather than just the ones having OS 5.0 or greater. Now, coming back to the actual question, I have got a database that I want to replicate to be used in the Blackberry application. The database has 8 tables and each table has approximately 12 different columns. One of the table has 1000 rows. Now if I was to implement this DB for a Blackberry application , keeping in mind that it will work on all the versions of Blackberry, what would be the best way to implement it?

    Read the article

  • Updating a sql server table with data from another table

    - by David G
    I have two basic SQL Server tables: Customer (ID [pk], AddressLine1, AddressLine2, AddressCity, AddressDistrict, AddressPostalCode) CustomerAddress(ID [pk], CustomerID [fk], Line1, Line2, City, District, PostalCode) CustomerAddress contains multiple addresses for the Customer record. For each Customer record I want to merge the most recent CustomerAddress record where most recent is determined by the highest CustomerAddress ID value. I've currently got the following: UPDATE Customer SET AddressLine1 = CustomerAddress.Line1, AddressPostalCode = CustomerAddress.PostalCode FROM Customer, CustomerAddress WHERE Customer.ID = CustomerAddress.CustomerID which works but how can I ensure that the most recent (highest ID) CustomerAddress record is selected to update the Customer table?

    Read the article

  • problem during data fetch

    - by nectar
    here is my code $sql="SELECT * FROM $tbl_name WHERE ownerId='$UserId'"; $result=mysql_query($sql,$link)or die(mysql_error()); $row = mysql_fetch_array($result, MYSQL_ASSOC); <?php while($row = mysql_fetch_array($result, MYSQL_ASSOC)) { echo "<tr>"; echo "<td>".$row['pinId']."</td>"; echo "<td>".$row['usedby']."</td>"; echo "<td>".$row['status']."</td>"; echo "</tr>"; } ?> it is ignoring the first record means if 4 rows are in $row its ignoring the 1st one rest three are coming on page. ownerId is not primary key.

    Read the article

  • A question on getting number of nodes in a Binary Tree

    - by Robert
    Dear all, I have written up two functions (pseudo code) for calculation the number of nodes and the tree height of a Binary Tree,given the root of the tree. Most importantly,the Binary Tree is represented as the First chiled/next sibling format. so struct TreeNode { Object element; TreeNode *firstChild; TreeNode *nextSibling; } Calculate the # of nodes: public int countNode(TreeNode root) { int count=0; while(root!=null) { root= root.firstChild; count++; } return count; } public int countHeight(TreeNode root) { int height=0; while(root!=null) { root= root.nextSibling; height++; } return height; } This is one of the problem I saw on an algorithm book,and my solution above seems to have some problems,also I didn't quite get the points of using this First Child/right sibling representation of Binary Tree,could you guys give me some idea and feedback,please? Cheers!

    Read the article

  • How to post data from user control - asp.net mvc

    - by Dharmesh
    Currently i am working on project in which login user control is there in master page. earlier i had seperate login.aspx page and was able to call login method of home controller (with acceptverb = post). now we have changed the idea, want to place login control on master page (home page). Now when i click on login button of login control - it calls login method of controller class with acceptver = get. how can i call login method with acceptverb = post?

    Read the article

  • Net::HTTP Gives time out but browser visit returns data

    - by steve
    I tried the following Net::HTTP.get_print URI.parse(URI.encode('https://graph.facebook.com/me/likes?access_token=mytoken', '|')) (My Token is my actual token in code) I get a EOFError: end of file reached error If I visit the page with my browswer it loads up a JSON page. Any idea what could be causing the error? It was working a few days ago. Can't see any changes to facebook api.

    Read the article

  • Error occurs while using SPADE method in R

    - by Yuwon Lee
    I'm currently mining sequence patterns using SPADE algorithm in R. SPADE is included in "arulesSequence" package of R. I'm running R on my CentOS 6.3 64bit. For an exercise, I've tried an example presented in http://en.wikibooks.org/wiki/Data_Mining_Algorithms_In_R/Sequence_Mining/SPADE When I tried to do "cspade(x, parameter = list(support = 0.4), control = list(verbose = TRUE))" R says: parameter specification: support : 0.4 maxsize : 10 maxlen : 10 algorithmic control: bfstype : FALSE verbose : TRUE summary : FALSE preprocessing ... 1 partition(s), 0 MB [0.096s] mining transactions ... 0 MB [0.066s] reading sequences ...Error in asMethod(object) : 's' is not an integer vector When I try to run SPADE on my Window 7 32bit, it runs well without any error. Does anybody know why such errors occur?

    Read the article

  • Using unions to simplify casts

    - by Steven Lu
    I realize that what I am trying to do isn't safe. But I am just doing some testing and image processing so my focus here is on speed. Right now this code gives me the corresponding bytes for a 32-bit pixel value type. struct Pixel { unsigned char b,g,r,a; }; I wanted to check if I have a pixel that is under a certain value (e.g. r, g, b <= 0x10). I figured I wanted to just conditional-test the bit-and of the bits of the pixel with 0x00E0E0E0 (I could have wrong endianness here) to get the dark pixels. Rather than using this ugly mess (*((uint32_t*)&pixel)) to get the 32-bit unsigned int value, i figured there should be a way for me to set it up so I can just use pixel.i, while keeping the ability to reference the green byte using pixel.g. Can I do this? This won't work: struct Pixel { unsigned char b,g,r,a; }; union Pixel_u { Pixel p; uint32_t bits; }; I would need to edit my existing code to say pixel.p.g to get the green color byte. Same happens if I do this: union Pixel { unsigned char c[4]; uint32_t bits; }; This would work too but I still need to change everything to index into c, which is a bit ugly but I can make it work with a macro if i really needed to.

    Read the article

  • Binding Data to Word 2007 Content Controls Using Visual Studio Tools for the Office System (3.0)

    - by Simon Lomax
    Hi, I found this article (http://msdn.microsoft.com/en-us/library/bb967663.aspx) and thought great thats exactly what I'm trying to do. I want to programatically build a product brochure using content controls and openXML. The article in question refers to an accompanying video which unfortunately does not appear to be available, nor does the code. I posted a comment to ask where they are but in the meantime does anybody know of a good example. There are plenty of examples of binding/merging one record into a openXML Word document. But I want to bind a whole list of records to create a product brochure. Can anyone point me to good tutorial? Thanks

    Read the article

  • Problem in reading data in table shown

    - by user281180
    I can see values shown in my table but I can`t read all of them except the first one using the following code; function ReadNames () { $('#Table tr td label').each(function () { NameID.push(this.id); }); } How can I read all the values?The table is poplulated using a click on a dialog box function addTableRow(jQtable, value, text){ jQtable.each(function() { var $table = $(this); var tds = '<tr>'; tds += '<td>' + '<label for="Name" id = ' + value + '>' + text + '</label></td>' + '<td><input type="button" value="Remove"/></td>'; tds += '</tr>'; if ($('tbody', this).length > 0) { $('tbody', this).append(tds); } else { $(this).append(tds); } }); } function read() { $("#SelectBox option").each(function() { var value = $(this).val(); var text = $(this).text(); addTableRow($('#Table'),value,text); }); }

    Read the article

  • Data pagination with "saved" search

    - by TiuTalk
    I'm creating a page that's a search result... When you're viewing one of the results, at the bottom of the page, I need to insert "Next result" and "Previous result" links, like a pagination... But from [I think] a saved search, right? How you people would do this? Obs.: I'll use CakePHP (PHP) and MySQL

    Read the article

  • GIT sharing configuration data

    - by user569980
    Hi, I just started using GIT for my versioning and I want to program some tools that work on top of it. Here is my question: Which information in the .git/config is shared to a remote repo? Is any? Is there a special way to push information to that repo? The reason I am asking is that I would like to add a "unique stamp" to the config of a repo. Also the remote repo and everybody pulling that project should have the stamp. Is that possible? If not, is there any other way to identify a repository? Having a .git folder, I want to decide whether this git repo is the same as a previously specified remote repo (the same means created by pulling the remote repo, changes are okay, of course).

    Read the article

  • Error during data INSERT in php

    - by nectar
    here my code- $sql = "INSERT INTO tblpin ('pinId', 'ownerId', 'usedby', 'status') VALUES "; for($i=0; $i0) { $sql .= ", "; } $sql .= "('$pin[$i]', '$ownerid', 'Free', '1')"; } $sql .= ";"; echo $sql; mysql_query($sql); if(mysql_affected_rows() 0) { echo "done"; } else { echo "Fail"; } output: ** INSERT INTO tblpin ('pinId', 'ownerId', 'usedby', 'status') VALUES ('13837927', 'admin', 'Free', '1'), ('59576082', 'admin', 'Free', '1'); Fail why it is not inserting values when $sql query is right?

    Read the article

  • javascript popup window with correct data

    - by Christian
    I want this code below open in a popup window. How do I do? html- <td align="right"><a onclick="confirmSubmit();" target="paywin" class="button"><span><?php echo $button_continue; ?></span></a></td> Java - var newwin = null; function confirmSubmit() { $.ajax({ type: 'GET', url: 'index.php?route=payment/dibs/confirm', success: function() { $('#checkout-form').submit(); } }); } //--></script> I tried something like this: var newwin = null; function confirmSubmit() { $.ajax({ type: 'GET', url: 'index.php?route=payment/dibs/confirm', success: window.onload = function() { $('#checkout-form').submit(); } }); window.open('http://www.melacs.com/index.php?route=payment/dibs/confirm') } //--></script>

    Read the article

  • how to show data on mouse over in datagrid

    - by prince23
    hi, i have an Datagrid lets say i have columns with name, age, mail ID. so all the details should be shown in a pop up or some thing like side also will do. is there any thing like an slide control so that once i make a mouse over the row i display that row values in silde? i need to show an pop up with details what i have displayed in that row. how can i achive this functionality here. right now binding values to datagrid is done this functioanlity is done. how can i go ahead to get an solution to show pop up on mouse over. any help on this issue would be really great and help fully. i am new to silver light concept plz provide an solution on this. thanks in advance prince

    Read the article

< Previous Page | 406 407 408 409 410 411 412 413 414 415 416 417  | Next Page >