Search Results

Search found 67143 results on 2686 pages for 'complex data types'.

Page 454/2686 | < Previous Page | 450 451 452 453 454 455 456 457 458 459 460 461  | Next Page >

  • Android GPS data of Railway Stations of India

    - by user578098
    Hi, I want to make an android application that will intimate the users about the approaching railway stations in INDIA. For this I will use GPS (Location Manager etc) on Android. So far, I have not developed the applications using GPS, so I have little insight on the capabilities of Android API for this. I know, through the android API I can know the current location of the users through GPS and google API but can I know the location of nearby railway stations from Google API for India? Or can I know the latitude and longitude of all the Railway Stations so that I can pre-feed that in the applciation? Please help me in finding out the way.

    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

  • How can i read back an object stored in a session?

    - by strakastroukas
    First of all, here comes the load part. Structure MainStruct Dim Ans1 As String Dim Ans2 As String End Structure Dim Build As New List(Of MainStruct) ... ... ... Session("MyData") = Build The question is how can i read back the contents of the list, stored in the Session? I mean something like... Build = Session("MyData").Ans1

    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

  • 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

  • Using regular expressions with Dojo data.fetch?

    - by Dfowj
    I'm trying to use the below code to fetch a regular expression like this /[computer]{3,8}/(what i think is any words containing the letters in computer ranging from 3 to 8 letters long) from a database (which i know is being loaded correctly). When i fetch, i get 10 results, all the same word... "Adenauer" var base = "computer"; var baseRE = '/[' + base + ']{' + this.minLength + ',' + base.length + '}/'; this.dict.fetch({query: {word:baseRE}, onComplete: onLoadWords, onError: function(err) { console.log(err); }}); Any ideas what im doing wrong?

    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

  • Parsing data without HMLT tags

    - by user296507
    Hi, I need to extract the actual phone number form the html listed below, but I'm not really sure how to do it using Nokogiri CSS since there are no html tags around it. When an at_css(.phonetitle) it only parse Phone and not the number. <div class="detail"> <span class="address">Corner of Toorak Road and Chapel Street, South Yarra</span><br> <span class="phonetitle">Phone</span> 95435 34341 <br><br> </div>

    Read the article

  • Elegant way to aggregate multi-dimensional array by index key

    - by Stephen J. Fuhry
    How can I recursively find the total value of all children of an array that looks something like this? [0] => Array ( [value] => ? // 8590.25 + 200.5 + 22.4 [children] => Array ( [0] => Array ( [value] => ? // 8590.25 + 200.5 [children] => Array ( [0] => Array ( [value] => 8590.25 // leaf node ) [1] => Array ( [value] => 200.05 // leaf node ) ) ) [1] => Array ( [value] => 22.4 // leaf node ) ) )

    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

  • Paging To The End Of A Data View Web Part

    - by ForNow
    Hi all! Hopefully you can help me with this. I've displayed an Announcement web part on a page with 20 items. I opened up SharePoint Designer 2007 and set the paging to 6 items. I've added a little bit of (OOB) functionality so that I have buttons for START, PREVIOUS, and NEXT. These work well without any problems but I'm wondering how do I get END to work? I tried using the $LastRow & $RealLastRow values supplied by the web part but those just give me the number of how many items are in the current view, not the total items in the list. Little help!

    Read the article

  • 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

  • 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

  • Error during data UPDATE in php

    - by Piyush
    $sql = "UPDATE tblprofile SET name = '$membername' , f_h_name = '$fathername', maritalS = '$mstatus' , dob = '$dob' , occupation = '$occupation' , nominee = '$nominee' , address1 = '$address1' , address2 = '$address2', city = '$city', district = '$district', state = '$state', pin = '$areapin', mobile = '$mobileno', email = '$email', PANno = '$panno', bankname = '$bankname', branch = '$branch', accountno = '$accountno' WHERE userId = '$_SESSION['UserId']' "; //line 212 if(mysql_query($sql)) { echo "Updation Done."; } Error comes in browser : Parse error: syntax error, unexpected T_ENCAPSED_AND_WHITESPACE, expecting T_STRING or T_VARIABLE or T_NUM_STRING in C:\xampp\htdocs\303\saveEditProfile.php on line 212

    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

  • timestamp in C#

    - by praveen
    Hi all, I need to convert the system datetime to timestamp in script task SSIS. input date format: 29/05/2010 2:36 AM output format: 29-15-2010 14:36:00 thanks prav

    Read the article

  • SSRS run SQL/DataSet conditionally

    - by MikeTWebb
    Hello.... I have an SSRS report that contains several subreports. The user has the ability to select/deselect which subreports they want to produce using several Boolean parameters. If a subreport is deselected then it is not rendered by setting the Visibility property. However, the DataSet associated with the de-selected subreport still executes causing the execution time to take longer than expected. Is there any way to tell a dataset on a subreport or Tablix not to execute based on a Parameter selection? Thanks

    Read the article

  • SQL SERVER Spatial Data

    - by Sam
    Hi All, I am struggeling finding an effectient way to find a distance between a Point that interetcts a polygon and the border of that polygon. I was able to use the STDistance comparing the point to every point that made up the polygon but that is taking a lot of time. Using SPatial indexed wasnt much helpful because the STDistance is not part of any constraint and even when I did put the constraint, the index didnt help much. I appreciate any feedback. Thanks.

    Read the article

< Previous Page | 450 451 452 453 454 455 456 457 458 459 460 461  | Next Page >