twitter unknown following how to remove unwanted following on twitter _________ twitter unknown following

Hi, I logged into my twitter account last week after a couple of months. I am not a regular user of twitter,i had
been following 10/12 accounts on twitter since the beginning.

When i logged into my account i saw a huge list of tweets most of them in Chinese/Arabic. I was very surprised
to see those tweets. I had never followed such accounts. I knew somehow they got followed automatically.

I search this on the google and found that there could be some application that is allowed and following random people on
behalf of my account. I logged into my account and went to the URL "https://twitter.com/settings/applications",
there was a suspicious app (naming "Competition...."). I revoked its access.

Now i have got a long list of following that i wanted to unfollow. But twitter does not allow you to "Bulk Unfollow" accounts.
I searched for a solution online and found a website "http://iunfollow.com/", that allow you to log into your account and
unfollow by clicking on each account. Again it was not a feasible solution to do.

Then i found a small hack, may be it is of some use to anyone who ran into this problem.
so you have got yourself a long list of unwanted/spam following on twitter.
Please follow the below steps to unfollow all twitter accounts.

You have to use Google Chrome on PC for this.

1.  Go to "https://twitter.com/" and log into your account.
2.  Click on your profile image to go to your profile.
3.  Click on "Following" and you will see a list of following accounts. You can go to "https://twitter.com/following" to avoid step 2.
4.  Scroll down to the very end of following list, until there is no more down scroll.
5.  Press F12 and it will bring up the "Developer tools" window of google chrome, on developer tools click on "Console" tab.
6.  Paste the following script in the Console tab without double quotes.
    "var elems=document.getElementsByClassName("button-text following-text");
    for(i=0;i<elems.length;i++){elems[i].parentNode.click();}"
7.  Press enter button and wait for a minute. Now refresh your "https://twitter.com/following" page and there will be no following. All removed. (clap)

#twitter following random accounts# 
#twitter adding followers by itself#

Display Analog Clock of System Time in Assembly Language Sir Asim Munir

Please find source code on below url:
Download the source:  asm-clock-source-code.asm

Log4net Implementation in CRM 2011, log4net in CRM Plugins, WebServices and Custom aspx Pages.

This post is about log4net logger implementation in CRM 2011. I will provide details about log4net in CRM Plugins. It is as the same with Web-services and Custom aspx Pages.


1. First we will have a Config file for log4net so that, its configuration/settings can be read and applied to logger.

<?xml version="1.0" encoding="utf-8" ?>
<configuration>
  <configSections>
    <section name="log4net" type="log4net.Config.Log4NetConfigurationSectionHandler, log4net" />
  </configSections>
  <log4net>
    <appender name="RollingLogFileAppender" type="log4net.Appender.RollingFileAppender">
      <file value="D:\Logger\Log4net\logs\log.txt" />
      <appendToFile value="false" />
      <rollingStyle value="Size" />
      <maxSizeRollBackups value="5" />
      <maximumFileSize value="1GB" />
      <layout type="log4net.Layout.PatternLayout">
        <conversionPattern value="%date [%thread] %-5level %logger - %message%newline" />
      </layout>
    </appender>
    <appender name="MemoryAppender" type="log4net.Appender.MemoryAppender">
    </appender>
    <root>
      <level value="Info" />
      <appender-ref ref="RollingLogFileAppender" />
      <appender-ref ref="MemoryAppender" />
    </root>
  </log4net>
</configuration

Copy all this into a file named "log4net.config" and place it in D:\Logger\Log4net\Config\

2. Add log4net.dll to your Plugin.

3.

using log4net;
using log4net.Config;
public class MyPlugin: IPlugin
    {
    protected static readonly ILog Logger = LogManager.GetLogger(typeof(PublishToGRID));
    static MyPlugin()
    {
      XmlConfigurator.Configure(new System.IO.FileInfo(@"D:\Logger\Log4net\Config\log4net.config"));
    }
try
{
if (context.InputParameters.Contains("Target") && context.InputParameters["Target"] is Entity)
{
  Logger.Info("Plugin Executed");
}
}
catch (Exception ex)
{
  string ErrorMessage = "Exception Occured in CRM";
  Logger.Error(ErrorMessage,ex);              
}

After your plugin executed: you will se the log file generated in D drive.
containing the following text:

Logger.info: 6/15/2014  7:11 p.m
Plugin Excuted

CRM 2011 like Subgrid With Sorting in JavaScript, CRM 2011 Display fetchxml in IFrame, Display Custom Advance Find view in Iframe 2014,

Today,
My post is about how to display Related Notes of an Entity in CRM Subgrid with Sorting, Refresh, Delete Multiple and Open Multiple Records:

For Example we want to display all Notes of Account Entity :

1. First of all Add IFrame to Account Entity with the following Properties:

2. Then Add New JavaScript library to the form Properties and Paste the following code in it.

            function Notes() {

1.     if (Xrm.Page.ui.getFormType() == 1) {
2.         return;
3.     }
4.     var NotesGrid = document.getElementById("IFRAME_RelatedAttachments");
5.     if (NotesGrid == null || NotesGrid.readyState != "complete") {
6. 
   
7.         setTimeout("Notes()", 2000);
8.         return
9. 
   
10.     }
11.     NotesGrid.src = "about:blank";
12.     var fetchXml = "<fetch version='1.0' output-format='xml-platform' mapping='logical' distinct='true' count='6'><entity name='annotation'><attribute name='annotationid'/><attribute name='subject'/><attribute name='notetext'/><attribute name='modifiedby'/><attribute name='filename'/><attribute name='isdocument'/><attribute name='filesize'/><attribute name='modifiedon'/><order attribute='modifiedon' descending='false'/><link-entity name='" + Xrm.Page.data.entity.getEntityName() + "' from='" + Xrm.Page.data.entity.getEntityName() + "id" + "' to='objectid' alias='aa'><filter type='and'><condition attribute='" + Xrm.Page.data.entity.getEntityName() + "id" + "' operator='eq'  value='" + Xrm.Page.data.entity.getId() + "'/></filter></link-entity></entity></fetch>";
13. 
    
14. 
    
15. 
    
16.     var layoutXml = "<grid name='resultset' object='5' jump='subject' select='1' icon='1' preview='1'><row name='result' id='annotationid'><cell name='isdocument' width='40' /><cell name='subject' width='200' /><cell name='filename' width='200' /><cell name='notetext' width='200' /><cell name='filesize' width='100' /><cell name='modifiedby' width='150' /><cell name='modifiedon' width='100' /></row></grid>";
17. 
    
18. 
    
19.     EmbedAdvancedFindView("IFRAME_RelatedAttachments", "annotation", fetchXml, layoutXml, "name", "false", "{DDDFF6AE-2F52-4640-B2BB-2BA59DA0777C}");
20. 
    
21.     // to remove the toolbar items from the advance find grid
22.     var iFrame1 = null;
23.     iFrame1 = crmForm.all.IFRAME_RelatedAttachments;
24.     var iDoc1 = iFrame1.contentWindow.document;
25.     iFrame1.attachEvent("onreadystatechange", Ready1);
26.     RemoveWhiteSpace();
27. 
    

}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

function EmbedAdvancedFindView(iFrameId, entityName, fetchXml, layoutXml, sortCol, sortDescend, defaultAdvFindViewId) {

    try {

        var iFrame = document.getElementById(iFrameId);

        var httpObj = new ActiveXObject("Msxml2.XMLHTTP");

        var url = "/" + ORG_UNIQUE_NAME + "/advancedFind/fetchData.aspx";

        var params = "FetchXML=" + fetchXml

        + "&LayoutXML=" + layoutXml

        + "&EntityName=" + entityName

        + "&DefaultAdvFindViewId=" + defaultAdvFindViewId

        + "&ViewType=1039";

        httpObj.Open("POST", url, true);

        httpObj.setRequestHeader("Content-type", "application/x-www-form-urlencoded");

        httpObj.setRequestHeader("Content-length", params.length);

        httpObj.onreadystatechange = function () {

            if (httpObj.readyState == 4 && httpObj.status == 200) {

                var doc = iFrame.contentWindow.document;

                iFrame.src = null;

                doc.open();

                doc.write(httpObj.responseText);

                doc.close();

                // doc.body.style.padding = "0px";

                // doc.body.style.backgroundColor = "#eaf3ff";

            }

        }

        httpObj.send(params);

    }

    catch (e) {

    }

}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

function Ready1() {

    try {

        var iFrame = crmForm.all.IFRAME_RelatedAttachments;

        var iDoc1 = iFrame.contentWindow.document;

        if (iDoc1.getElementById("gridMenuBar") != null)

            iDoc1.getElementById("gridMenuBar").style.display = "none";

    } catch (e) {

    }

}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

3. Call the Notes() function on Onload event of Account Form, and you will see a Subgrid Displayed with Sorting on each column, and Refresh Button.

Bridge Inspection and Management system in Asp Dot Net (.NET C#) with Source Code and Database in MS Sql Server 2008

I have developed Bridge Inspection System using Visual Studio Web-Site Project in Asp.net with C#, using my own CSS styling.
Database: in Microsoft SQL server 2008 R2.
Above is the Main Screen, Default Page.
Following are features in this Bridge Inspection System:

• Admin who can add more admins,Collectors,Inspectors and Bridges to be inspected in  System
  Delete Collectors, Inspectors and Bridges from the System.
• Bridge Inspector who can Inspect the Bridges that are currently added and make a report
• Bridge Collector who can View the final Reports added by BI.
• Reports Generation from Inspected Bridge Data and Export Reports in PDF format to be ready for download and printing.
• Profile Management.
• and more ..........................
• Sql Server 2008 Database, Normalized and Complete Relationships.

Following are some screen-shots of the system.

Admin Login:

Admin Page:

 Add Bridge Profile:

Profile Managment:

 Bridge Profile View:

If anyone need Source Code along with the Database file, please ask in Comments I will provide links:
Thanks,
Saqib Khan. (Dynamics CRM developer).

Doubly LinkList in C++, Object Oriented Programming, Data Structure in C++ Addition, Deletion, Search

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116

#include<iostream> using namespace std; struct node { node *next; int data ; node * prev; node () { data=0; next=prev=NULL; } } ; ////////////////////////////////////////////// class Dlinklist { node *head ,*tail ; public: Dlinklist() { head = tail =NULL; } void add_to_tail (); void add_to_head(); void del_from_tail(); void del_from_head(); void show_from_head(); void show_from_tail(); }; ///////////////////////////////////////// void Dlinklist::add_to_head() { node* temp = new node (); cout<<"Enter the value"<<endl; cin>>temp->data; if(head==0) { head=tail=temp; } else { temp->next =head; head->prev=temp; head=temp; } } ///////////////////////////////////////////////////// void Dlinklist::add_to_tail() { node* temp =new node(); cout<<"Enter the value"<<endl; cin>>temp->data; if( tail==0) { head=tail=temp; } else { tail->next=temp; temp->prev = tail; tail =temp ; } } //////////////////////////////////////////////////// void Dlinklist::del_from_head() { if (head==0) cout<<"Empty list"<<endl; else { node* temp =head; head=head->next; head->prev=0; delete temp; } } ////////////////////////////////////////////////// void Dlinklist::del_from_tail() { if(tail==0) { cout<<"Empty List"<<endl; } else { node* temp=tail; tail= tail->prev; tail->next = 0; delete temp; } } //////////////////////////////////////////////////// void Dlinklist::show_from_head() { node* temp = head; while(temp!=0) { cout<<endl<<temp->data; temp=temp->next; } } ////////////////////////////// void Dlinklist::show_from_tail() { node* temp = tail; while(temp!=0) { cout<<endl<<temp->data; temp=temp->prev; } } ////////////////////////// void main() { Dlinklist d1; int c; cout<<endl<<"---------MENU---------"<<endl; do{ cout<<"1. Add value to head"<<endl; cout<<"2. Add value to tail"<<endl; cout<<"3. Show values from head"<<endl; cout<<"4. Show values from tail"<<endl; cout<<"5. Delete values from head"<<endl; cout<<"6. Delete values from tail"<<endl; cout<<"Enter Your Choice"<<endl; cin>>c; switch(c) { case 1:d1.add_to_head();break; case 2:d1.add_to_tail();break; case 3:d1.show_from_head();break; case 4:d1.show_from_tail();break; case 5:d1.del_from_head();break; case 6: d1.del_from_tail(); break; default:cout<<"Invalid"<<endl;break; } } while(1); }

Easiest Implementation of AVL Tree in C++ Insertion, Deletion and Balancing AVL_Tree

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374

/* Write a C++ program to perform the following operations on AVL-trees: a) Insertion. b) Deletion. */ #include<iostream> #include<stdlib.h> using namespace std; #define TRUE 1 #define FALSE 0 #define NULL 0 class AVL; class AVLNODE { friend class AVL; private: int data; AVLNODE *left,*right; int bf; }; class AVL { private: AVLNODE *root; public: AVLNODE *loc,*par; AVL() { root=NULL; } int insert(int); void displayitem(); void display(AVLNODE *); void removeitem(int); void remove1(AVLNODE *,AVLNODE *,int); void remove2(AVLNODE *,AVLNODE *,int); void search(int x); void search1(AVLNODE *,int); }; int AVL::insert(int x) { AVLNODE *a,*b,*c,*f,*p,*q,*y; int found,unbalanced; int d; if(root==0) //special case empty tree { y=new AVLNODE; y->data=x; root=y; root->bf=0; root->left=root->right=NULL; return TRUE; } //phase 1:locate insertion point for x.a keeps track of the most // recent node with balance factor +/-1,and f is the parent of a // q follows p through the tree. f=NULL; a=p=root; q=NULL; found=FALSE; while(p&&!found) { //search for insertion point for x if(p->bf) { a=p; f=q; } if(x<p->data) //take left branch { q=p; p=p->left; } else if(x>p->data) { q=p; p=p->right; } else { y=p; found=TRUE; } } //end while //phase 2:insert and rebalance.x is not in the tree and // may be inserted as the appropriate child of q. if(!found) { y = new AVLNODE; y->data=x; y->left=y->right=NULL; y->bf=0; if(x<q->data) //insert as left child q->left=y; else q->right=y; //insert as right child //adjust balance factors of nodes on path from a to q //note that by the definition of a,all nodes on this //path must have balance factors of 0 and so will change //to +/- d=+1 implies that x is inserted in the left // subtree of a d=-1 implies //to that x inserted in the right subtree of a. if(x>a->data) { p=a->right; b=p; d=-1; } else { p=a->left; b=p; d=1; } while(p!=y) if(x>p->data) //height of right increases by 1 { p->bf=-1; p=p->right; } else //height of left increases by 1 { p->bf=1; p=p->left; } //is tree unbalanced unbalanced=TRUE; if(!(a->bf)||!(a->bf+d)) { //tree still balanced a->bf+=d; unbalanced=FALSE; } if(unbalanced) //tree unbalanced,determine rotation type { if(d==1) { //left imbalance if(b->bf==1) //rotation type LL { a->left=b->right; b->right=a; a->bf=0; b->bf=0; } else //rotation type LR { c=b->right; b->right=c->left; a->left=c->right; c->left=b; c->right=a; switch(c->bf) { case 1: a->bf=-1; //LR(b) b->bf=0; break; case -1:b->bf=1; //LR(c) a->bf=0; break; case 0: b->bf=0; //LR(a) a->bf=0; break; } c->bf=0; b=c; //b is the new root } //end of LR } //end of left imbalance else //right imbalance { if(b->bf==-1) //rotation type RR { a->right=b->left; b->left=a; a->bf=0; b->bf=0; } else //rotation type LR { c=b->right; b->right=c->left; a->right=c->left; c->right=b; c->left=a; switch(c->bf) { case 1: a->bf=-1; //LR(b) b->bf=0; break; case -1:b->bf=1; //LR(c) a->bf=0; break; case 0: b->bf=0; //LR(a) a->bf=0; break; } c->bf=0; b=c; //b is the new root } //end of LR } //subtree with root b has been rebalanced and is the new subtree if(!f) root=b; else if(a==f->left) f->left=b; else if(a==f->right) f->right=b; } //end of if unbalanced return TRUE; } //end of if(!found) return FALSE; } //end of AVL INSERTION void AVL::displayitem() { display(root); } void AVL::display(AVLNODE *temp) { if(temp==NULL) return; cout<<temp->data<<" "; display(temp->left); display(temp->right); } void AVL::removeitem(int x) { search(x); if(loc==NULL) { cout<<"\nitem is not in tree"; return; } if(loc->right!=NULL&&loc->left!=NULL) remove1(loc,par,x); else remove2(loc,par,x); } void AVL::remove1(AVLNODE *l,AVLNODE *p,int x) { AVLNODE *ptr,*save,*suc,*psuc; ptr=l->right; save=l; while(ptr->left!=NULL) { save=ptr; ptr=ptr->left; } suc=ptr; psuc=save; remove2(suc,psuc,x); if(p!=NULL) if(l==p->left) p->left=suc; else p->right=suc; else root=l; suc->left=l->left; suc->right=l->right; return; } void AVL::remove2(AVLNODE *s,AVLNODE *p,int x) { AVLNODE *child; if(s->left==NULL && s->right==NULL) child=NULL; else if(s->left!=NULL) child=s->left; else child=s->right; if(p!=NULL) if(s==p->left) p->left=child; else p->right=child; else root=child; } void AVL::search(int x) { search1(root,x); } void AVL::search1(AVLNODE *temp,int x) { AVLNODE *ptr,*save; int flag; if(temp==NULL) { cout<<"\nthe tree is empty"; return; } if(temp->data==x) { cout<<"\nthe item is root and is found"; par=NULL; loc=temp; par->left=NULL; par->right=NULL; return; } if( x < temp->data) { ptr=temp->left; save=temp; } else { ptr=temp->right; save=temp; } while(ptr!=NULL) { if(x==ptr->data) { flag=1; cout<<"\nitemfound"; loc=ptr; par=save; } if(x<ptr->data) ptr=ptr->left; else ptr=ptr->right; } if(flag!=1) { cout<<"\nitem is not there in tree"; loc=NULL; par=NULL; cout<<loc; cout<<par; } } void main() { AVL a; int x,y,c; char ch; do { cout<<"\n1.insert"; cout<<"\n2.display"; cout<<"\n3.delete"; cout<<"\n4.search"; cout<<"\n5.exit"; cout<<"\nEnter u r choice to perform on AVL tree"; cin>>c; switch(c) { case 1:cout<<"\nEnter an element to insert into tree"; cin>>x; a.insert(x); break; case 2:a.displayitem(); break; case 3:cout<<"\nEnter an item to deletion"; cin>>y; a.removeitem(y); break; case 4:cout<<"\nEnter an element to search"; cin>>c; a.search(c); break; case 5:exit(0); break; default :cout<<"\nInvalid option try again"; } cout<<"\ndo u want to continue"; cin>>ch; } while(ch=='y'||ch=='Y'); }