Skip to main content

Playing with WebBrowser class (C#.net)

Over the period of time C# really became a mature programming language. Compared to other standard programming language it's new but it has already offered lots to the programmer and many more new features are being added in Framework 4.0. I was exploring today, how I can work with websites like "Gmail" through my program. This is not a hack but a standard way of logging into the website, to do our work and logout. In this section, I tried to show, using the C#.net 'web browser' class, how anyone can log in to the site by providing a username/password and logging out. In this section I've not shown any other operation, I'll try to cover that in the future.
  1. Add the WebBrowser control on a WinForm
  2. Add three Buttons, one for UserName/PWD, the second button for login, and the third button for logout from Gmail.
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Text;
using System.Windows.Forms;

namespace WebBrowser
{
    public partial class Form1 : Form
    {
        public Form1()
        {
            InitializeComponent();
            webBrowser1.Url = new Uri("http://www.gmail.com");
        }

        private void usernamepwd_Click(object sender, EventArgs e)
        {
            HtmlElementCollection theElementCollection;
            theElementCollection = 
                webBrowser1.Document.GetElementsByTagName("input");
            foreach (HtmlElement curElement in theElementCollection)
            {
                String str = (curElement.GetAttribute("id")).ToString();
                if(str == "Email")
                {
                    curElement.SetAttribute("value", "username");
                }
                if (str == "Passwd")
                {
                    curElement.SetAttribute("value", "password");
                }
            }
        }

        private void login_Click(object sender, EventArgs e)
        {
            HtmlElementCollection theElementCollection;
            theElementCollection = 
                webBrowser1.Document.GetElementsByTagName("input");
            foreach (HtmlElement curElement in theElementCollection)
            {
                String str = (curElement.GetAttribute("id")).ToString();
                if (str == "signIn")
                {
                    curElement.InvokeMember("click");
                }
            }
        }

        private void logout_Click(object sender, EventArgs e)
        {
            HtmlElementCollection theElementCollection;
            // Sign out is a link, so tag name search by 'a'.
            theElementCollection = 
                webBrowser1.Document.GetElementsByTagName("a");
            foreach (HtmlElement curElement in theElementCollection)
            {
                String str = curElement.InnerText;
                if (str == "Sign out")
                {
                    curElement.InvokeMember("click");
                }
            }
        }
    }
}

Reference: Website Login

Comments

This is something that java should have in its core library - a browser.There may be third parties though , not sure.
Aarfeen said…
Nice Post. Really helped me.
Mufti Mohammed said…
It's my pleasure that it helped.

Popular posts from this blog

XOR (Exclusive OR) for branchless coding

The following example shows the array reversing using the  XOR operator . No need to take any additional variable to reverse the array.   int main(int argc, _TCHAR* argv[]) { char str[] = "I AM STUDENT"; int length = strlen(str); for(int i = 0; i < ((length/2)); i++) { str[i] ^= str[length - (1+i)]; str[length - (1+i)] ^= str[i]; str[i] ^= str[length - (1+i)]; } cout << str << endl; return 0; } The above example is one of the uses of XOR but XOR comes in handy when we can do branchless coding  methods like butterfly switch etc. Sometimes this is very effective in speeding up the execution.  Let's see one of the uses of XOR in branchless coding. I am taking a simple example of Y = | X |.  Yes, I am generating abs of a supplied number. So, my function signature/definition in C++ looks like below: int absoluteBranch( int x) {     if (x < 0 ) {         return ...

Reversing char array without splitting the array to tokens

 I was reading about strdup, a C++ function and suddenly an idea came to my mind if this can be leveraged to aid in reversing a character array without splitting the array into words and reconstructing it again by placing spaces and removing trailing spaces. Again, I wanted an array to be passed as a function argument and an array size to be passed implicitly with the array to the function. Assumed, a well-formed char array has been passed into the function. No malformed array checking is done inside the function. So, the function signature and definition are like below: Below is the call from the client code to reverse the array without splitting tokens and reconstructing it. Finally, copy the reversed array to the destination.  For GNU C++, we should use strdup instead _strdup . On run, we get the following output: Demo code

Power of Two

  I n this post will be discussing how to calculate if a number is a power of two or not. As an example, 8 is a power of two but the number 10 is not. There are many ways we can solve this. First , we will take an approach which is simple and iterative. In this case, we will calculate the power of two one by one and check with the supplied number. The below code illustrates it. bool isPowerofTwo(unsigned num) { auto y = 1; while (0 != y) { if (num == y) return true; if (num < y) return false; y <<= 1; } return false; } Second , assuming, the number is a 32-bit number, this is also an iterative solution. In this scenario, iterating all bits and counting the set bits. Any number which is a power of 2 will have only one bit set and the rest will be zeros. As an example, 8 in binary representation is 1000. Using this observation, we can implement an iterative solution. bool isPowerofTwo(unsigned num) { auto one_count = 0; for (auto index = 0; index < ...