Search Results

Search found 25534 results on 1022 pages for 'write powershell'.

Page 496/1022 | < Previous Page | 492 493 494 495 496 497 498 499 500 501 502 503  | Next Page >

  • "The operation has timed out" when trying to send email

    - by user1718859
    protected void Button1_Click(object sender, EventArgs e) { try { SmtpClient sm = new SmtpClient(); MailMessage ms = new MailMessage(); ms.To.Add(new MailAddress(TextBox1 .Text )); ms.Subject = TextBox2.Text; ms.Body = TextBox3.Text; ms.IsBodyHtml = true; sm.Send(ms); } catch (Exception el) { Response.Write(el.Message); } }

    Read the article

  • Else without if

    - by user2808951
    I'm trying to write a code for my computer programming class for a project due Monday, and I'm pretty new to Java, but I'm trying to write a program that will first determine if a number the user inputs is even or odd and then determine if the number is prime or not. I'm not sure if I did the algorithm right or not, so if anyone has any corrections on the program to my algorithm or anything else please say so, but my real issue is that the program is refusing to compile. Every time I try, it says it's having an else without if problem. Here's a link to my command box: http://s1341.photobucket.com/user/Emi_Nightshade/media/Capture_zps45f9a2ea.png.html Here's my code: import java.io.*; import java.util.*; public class Lesson9p1_ThuotteEmily { public static void main(String args[]) { Scanner kbReader0=new Scanner(System.in); System.out.print("\n\nPlease enter an integer. An integer is whole number, and it can be either negative or positive. Please enter your number: "); long num=kbReader0.nextLong(); if(num%2==0) //if and else with braces { System.out.println("Your integer " + num + " is even."); } else { System.out.println("Your integer " + num + " is odd."); } Scanner kbReader1=new Scanner(System.in); System.out.print("\n\nWould you like to know if your number is prime? Please enter yes or no: "); String yn=kbReader1.nextLine(); if(yn.equals.IgnoreCase("Yes")) { System.out.println("Okay. Give me a moment."); { if(num%2==0) { System.out.println("Your number isn't prime."); } else if(num==2) { System.out.println("Your number is 2, which is the only even prime number in existence. Cool, right?"); } for(int i=3;i*i<=n;i+=2) { if(n%1==0) { System.out.println("Your number isn't prime."); } } else { System.out.println("Your number is prime!"); } } } if(yn.equals.IgnoreCase("No")) { System.out.println("Okay."); } } } If anyone could help me out with this and also any problems I may have made elsewhere in the program, I'd be very grateful! Thanks.

    Read the article

  • Scala: recursive search avoiding cycles

    - by user1826663
    How can I write a recursive search that I avoid cycles. My class is this: class Component(var name: String, var number: Int, var subComponent: Set[Component]) Now I need a way to check whether a component is contained within its subcomponent or between subcomponent of its subcomponent and so on.Avoiding possible cycles caused by other Component. My method of recursive search must have the following signature, where subC is the Set [component] of comp. def content (comp: Component, subC: Set[Component]) : Boolean = { } Thanks for the help.

    Read the article

  • Basic Java question?

    - by LAT
    Hi I am quite new to programming, i have a question please help me. ( this question is java question but i can't remember the syntax but what i write here is mostly it.) A class Person speaks i am a person A class Student speaks i am a student Student extends from Person Person p = new Student then what is p speaking then?

    Read the article

  • Boost::binary<> [c++][Boost]

    - by atch
    Hi, Is there anything in boost libraries like binary? For example I would like to write: binary<10101> a; I'm ashamed to admit that I've tried to find it (Google, Boost) but no results. They're mention something about binary_int< but I couldn't find neither if it is available nor what header file shall I include; Thanks for help.

    Read the article

  • MySQL: List rows who have one but not another many-to-many relationship

    - by Svish
    Not quite sure how to ask or define this, but can't figure it out. I have three tables like this: persons person_id, first_name, last_name hobbies hobby_id, name persons_hobbies person_id, hobby_id I need to make two lists. Persons that have both hobby A and B, and persons that have hobby A but not B. How can I write these two queries? Can't figure out how to do this with joining and all...

    Read the article

  • jquery menu ul li

    - by eyalb
    i have a tree menu that i need to open on specific branch. 1. on click on an A element i open the all next UL. now i want to close all other UL exept the ones that are parents of the A element. i want to write a function that will get an argument that is a A ID and will open the menu in the right place. example of my code

    Read the article

  • In ruby on rails, is it possible to do a sum query with group by using the find_each batching?

    - by BarryOg
    I'm loading data from my database and I'm doing a sum calculation with a group by. ElectricityReading.sum(:electricity_value, :group => "electricity_timestamp", :having => ["electricity_timestamp = '2010-02-14 23:30:00'"]) My data sets are extremely large, 100k upwards so I was wondering if its possible to use the find_each to batch this to help with memory overhead. I can write the batching manually use limit and offset I guess but I'd like to avoid that if the code already exists.

    Read the article

  • Loading material parameteres from FBX in XNA

    - by M_F
    I've got some material parameters stored in the FBX file (DiffuseFactor, ShininessExponent, SpecularFactor and others), but I can't get to them using Effect.Parameters nor BasicEffect (they've got only the basic stuff - like EmmisiveColor or alpha). I know, that I can try to write a Effect-derived class, but is there any other way? A built-in feature or maybe some half-raw parameters stored somewhere?

    Read the article

  • Why there are no semicolons and {} blocks in some languages

    - by Incognito
    I know the question has no practical value, but it is interesting why in some languages semicolons and {} blocks are removed although their predecessor have them. Actually it makes me nervous to write a code in Python as there are no ";" and {}. Also in new language Google-GO semicolons are also missing although it says that lexer uses a rule to insert semicolons automatically as it scans. So is there any secret :) reason for this.

    Read the article

  • Search images using c# in local images folder

    - by np
    We have a images folder which has about a million images in it. We need to write a program which would fetch the image based upon a keyword that is entered by the user. We need to match the file names while searching to find the right image. Looking for any suggestions. Thanks N

    Read the article

  • rspec nested ( has many resource ) no route found error

    - by Surya
    My calendar resource is a nested resource under profile map.resources :profiles, :has_many=>[:calendar] I am trying to write a rspec spec for calendarcontroller it "should use supplied date" do get :show , :month = '09' , :year = '2010' end But i get an error stating No route matches {:month="09", :year="2010", :controller="calendar", :action="show"} Any idea how i could get around this ?

    Read the article

  • Is C really "disguised assembly"?

    - by regn
    As a C++ programmer I have now decided to learn C to have "more control" over what I write. Are there any syntactical features in C which lead to rather unpredictable assembler code? Like virtual functions in C++ Is C disguised assembler? I would quite like that idea.

    Read the article

  • .NET regular expression

    - by vert
    How would I write a regular expression (C#) which will check a given string to see if any of its characters are characters OTHER than the following: a-z A-Z Æ æ Å å Ø ø - '

    Read the article

< Previous Page | 492 493 494 495 496 497 498 499 500 501 502 503  | Next Page >