Search Results

Search found 47770 results on 1911 pages for 'hi'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 12/1911 | < Previous Page | 8 9 10 11 12 13 14 15 16 17 18 19  | Next Page >

  • isset($var) vs. @$var

    - by Josso
    Is this an okay practice or an acceptable way to use PHP's error suppressing? if (isset($_REQUEST['id'] && $_REQUEST['id'] == 6) { echo 'hi'; } if (@$_REQUEST['id'] == 6) { echo 'hi'; }

    Read the article

  • Google maps kml layer

    - by TiagoMartins
    Hi, my code is: var ctaLayer = new google.maps.KmlLayer( 'http://.../per1.kml', {suppressInfoWindows: true}); ctaLayer.setMap(map); var info_percurso = new google.maps.InfoWindow({ content: 'hi' }); google.maps.event.addListener(ctaLayer, 'click', function() { info_percurso.open(map,ctaLayer); alert("dd"); }); this is possible? this code doesn't work...but the operation is possible? I need to create my own infoWindow for database queries

    Read the article

  • How to add values dynamically to I18n?

    - by Dima Goltsman
    I have many ymls in my rails app, and i want to put some of them in other service, so that i can call this from multiple places. the response of this call will be a hash. {"en" : {"test" : {"text1" : "hi english"}, {"text2" : "mambo number %{num}"} }, "es" : {"test" : {"text1" : "hi espaniol"}, {"text2" : "mamboes numeros %{num}"} } } is there a way i can load that hash into I18n translations like I18n.add_translations(some_hash) so i can access them with I18n.t("test.text1") I18n.t("test.text2", :num => 5) how can i achieve it?

    Read the article

  • which should be drawn first , class or sequence diagram?

    - by m0j1
    hi , I've had this discussion with my professor at college about UML diagrams . hi believes that sequence diagrams should be drawn before getting to class diagrams . but I think the opposite . I think after finishing the usecase diagram , the next diagram should be class diagram and after that we should get to sequence diagram . Rational rose requires us to use the classes in sequence diagram, which are already in class diagram . can anyone help me with this? thanks

    Read the article

  • Sorting an array of objects in ActionScript 3

    - by vitto
    Hi, I'm trying to sort an array of objects with ActionScript 3. The array is like this: var arr:Array = new Array (); arr.push ({name:"John", date:"20080324", message:"Hi"}); arr.push ({name:"Susan", date:"20090528", message:"hello"}); can I do something with Array.sort(...) method?

    Read the article

  • Does Restlet support parsing URLs into calling methods with parameters?

    - by John C
    Take the following example. I have a resource public class HelloWorldResource extends ServerResource { @Get public String represent(String arg) { return "hello, world (from the cloud!)" + arg; } } That is mapped by router.attach("/hi/{message}", HelloWorldResource.class); Is it possible to configure the routing such that accessing /hi/somestuffhere will make restlet fill in the arg parameter in the represent method?

    Read the article

  • Criticize my code, please

    - by Micky
    Hey, I was applying for a position, and they asked me to complete a coding problem for them. I did so and submitted it, but I later found out I was rejected from the position. Anyways, I have an eclectic programming background so I'm not sure if my code is grossly wrong or if I just didn't have the best solution out there. I would like to post my code and get some feedback about it. Before I do, here's a description of a problem: You are given a sorted array of integers, say, {1, 2, 4, 4, 5, 8, 9, 9, 9, 9, 9, 9, 10, 10, 10, 11, 13 }. Now you are supposed to write a program (in C or C++, but I chose C) that prompts the user for an element to search for. The program will then search for the element. If it is found, then it should return the first index the entry was found at and the number of instances of that element. If the element is not found, then it should return "not found" or something similar. Here's a simple run of it (with the array I just put up): Enter a number to search for: 4 4 was found at index 2. There are 2 instances for 4 in the array. Enter a number to search for: -4. -4 is not in the array. They made a comment that my code should scale well with large arrays (so I wrote up a binary search). Anyways, my code basically runs as follows: Prompts user for input. Then it checks if it is within bounds (bigger than a[0] in the array and smaller than the largest element of the array). If so, then I perform a binary search. If the element is found, then I wrote two while loops. One while loop will count to the left of the element found, and the second while loop will count to the right of the element found. The loops terminate when the adjacent elements do not match with the desired value. EX: 4, 4, 4, 4, 4 The bold 4 is the value the binary search landed on. One loop will check to the left of it, and another loop will check to the right of it. Their sum will be the total number of instances of the the number four. Anyways, I don't know if there are any advanced techniques that I am missing or if I just don't have the CS background and made a big error. Any constructive critiques would be appreciated! #include <stdio.h> #include <stdlib.h> #include <string.h> #include <stddef.h> /* function prototype */ int get_num_of_ints( const int* arr, size_t r, int N, size_t* first, size_t* count ); int main() { int N; /* input variable */ int arr[]={1,1,2,3,3,4,4,4,4,5,5,7,7,7,7,8,8,8,9,11,12,12}; /* array of sorted integers */ size_t r = sizeof(arr)/sizeof(arr[0]); /* right bound */ size_t first; /* first match index */ size_t count; /* total number of matches */ /* prompts the user to enter input */ printf( "\nPlease input the integer you would like to find.\n" ); scanf( "%d", &N ); int a = get_num_of_ints( arr, r, N, &first, &count ); /* If the function returns -1 then the value is not found. Else it is returned */ if( a == -1) printf( "%d has not been found.\n", N ); else if(a >= 0){ printf( "The first matching index is %d.\n", first ); printf( "The total number of instances is %d.\n", count ); } return 0; } /* function definition */ int get_num_of_ints( const int* arr, size_t r, int N, size_t* first, size_t* count ) { int lo=0; /* lower bound for search */ int m=0; /* middle value obtained */ int hi=r-1; /* upper bound for search */ int w=r-1; /* used as a fixed upper bound to calculate the number of right instances of a particular value. */ /* binary search to find if a value exists */ /* first check if the element is out of bounds */ if( N < arr[0] || arr[hi] < N ){ m = -1; } else{ /* binary search to find a value, if it exists, within given parameters */ while(lo <= hi){ m = (hi + lo)/2; if(arr[m] < N) lo = m+1; else if(arr[m] > N) hi = m-1; else if(arr[m]==N){ m=m; break; } } if (lo > hi) /* if it doesn't we assign it -1 */ m = -1; } /* If the value is found, then we compute the left and right instances of it */ if( m >= 0 ){ int j = m-1; /* starting with the first term to the left */ int L = 0; /* total number of left instances */ /* while loop computes total number of left instances */ while( j >= 0 && arr[j] == arr[m] ){ L++; j--; } /* There are six possible outcomes of this. Depending on the outcome, we must assign the first index variable accordingly */ if( j > 0 && L > 0 ) *first=j+1; else if( j==0 && L==0) *first=m; else if( j > 0 && L==0 ) *first=m; else if(j < 0 && L==0 ) *first=m; else if( j < 0 && L > 0 ) *first=0; else if( j=0 && L > 0 ) *first=j+1; int h = m + 1; /* starting with the first term to the right */ int R = 0; /* total number of right instances */ /* while loop computes total number of right instances */ /* we fixed w earlier so that it's value does not change */ while( arr[h]==arr[m] && h <= w ){ R++; h++; } *count = (R + L + 1); /* total number of instances stored as value of count */ return *first; /* first instance index stored here */ } /* if value does not exist, then we return a negative value */ else if( m==-1) return -1; }

    Read the article

  • How to correctly highlight cursor line in VIM?

    - by Eye of Hell
    Hello. VIM can be configured to highlight current line via :hi cursorline guibg=green and set cursorline commands. But if I enable tabs display via: :hi specialkey guifg=grey guibg=grey :set listchars="tab" :set list Cursor line highlight will corrupt tabs display: Any hints how i can avoid corruption so may tabs are highlighted with one color and cursor line is highlighted with another color without any ^I displayed at intersection?

    Read the article

  • URL Redirection

    - by Paolo
    Hi pidors, I want to do it so that when someone follow the link www.mysite.pl/file1.mp3, hi gets redirected to www.mysite.pl/file2.mp3 but the adderes in his browser bar keeps the same. How to do it?

    Read the article

  • How to access child element out of children()?

    - by user291701
    Hi, I'd like to get the # of immediate children an element has, and then get the class of a child at a particular index. Something like: var index = 25; var children = $("#myListElement").children(); if (index < children.length) { if (children[index].hasClass("testClass")) { alert("hi!"); } } I think the syntax for .children() is ok, but how do I get the indexed element out of them in jquery style? Thanks

    Read the article

  • Confused about NoMethodError in Ruby

    - by E L
    In a simple Ruby example, I'm getting an error that does not occur in irb. name = "Joe" def say_hi "\"Hi there!\" said #{self}" end response = name.say_hi puts response This code should return, "Hi there!" said Joe. It works perfectly fine in irb. However, when I attempt to put the same code in a file and run the file, I get this error: say_hi.rb:8:in `<main>': private method `say_hi' called for "Joe":String (NoMethodError) Any suggestion about why this happens?

    Read the article

  • Classes within classes in PHP

    - by Matt
    Can you do this in PHP? I've heard conflicting opinions: Something like: Class bar { function a_function () { echo "hi!"; } } Class foo { public $bar; function __construct() { $this->bar = new bar(); } } $x = new foo(); $x->bar->a_function(); Will this echo "hi!" or not?

    Read the article

  • javascript getElementByName doesn't work

    - by phil
    This simple js script can't set the value of "para". I guess getElementByName doesn't work. But why? <script function fn() { document.getElementById("para").setAttribute("name","hi"); document.getElementByName("hi").setAttribute("value","my value is high"); } </script <html <input type="button" onClick="fn()" value="click me" <input id="para" type="text" / </html

    Read the article

  • C# if no error contiune.. if error occurse do else

    - by NightsEVil
    hi i have a question i have some code that works good on like 70% of the computers i use it on but.. for some reason theres a few that are pesky and id like to do something like this (keep in mind this is a hypothetical) private void test_click(object sender, EventArgs e) { MessageBox.Show("hi"); //if it works ok without a error it continues to MessageBox.Show("worked ok"); //if it encountered a error of some kind it would go to MessageBox.Show("DID NOT WORK OK"); }

    Read the article

  • Stock Symbols using python

    - by nimmyliji
    Hi all, Hi, I am looking for some stock symbol look-up API. I could able to query yahoo finance with a symbol & could able to retrieve the stock price & other details. Is there any API for stock symbol searches Any help would be great .. Thanks

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 8 9 10 11 12 13 14 15 16 17 18 19  | Next Page >