Skip to main content

Harmful Girls : Way of looking


How it is harmful :
Girls are beautiful, intelligent, and altogether wonderful creatures... at least for the most part. There are several harmful types of girls you should avoid dating to help save your emotional, physical, and even financial well being. These types of girls are usually selfish and/or have bad habits that make them harmful to date. To get the scoop on these types of girls and how to identify them.
1. Spoiled Brats : Spoiled brats make bad dating options because of their unrealistic expectations and unwillingness to acknowledge their flaws. If you decide to date a spoiled brat, you should expect to do a lot of work without getting any credit for it.

2. Players : Players will charm, seduce, and even date you, but they'll never start a real relationship with you. They're bad to date because they jump from guy to guy and don't offer any real long term potential.

3. Party Girls : Party girls aren't any good to date because they just love partying too much. If you aren't much of a party guy yourself, this can cause some problems down the road.

4. Gold Diggers : Gold diggers will go to great lengths to find and date men with money. This is a problem because they want to live a life of luxury without having to work for it. Gold diggers are usually very shallow and value money and material possessions more than anything else.

5. Psychos : If you decide to date a psycho, you better be prepared for some very serious challenges. Psycho girls are characterized by being insecure, controlling, manipulative, and needy. Like the many other types of girls on this list, psychos are very selfishly motivated. If that isn't bad enough, they're the most difficult type of girl to break up with. If you start a serious relationship with a psycho and she becomes dependent on you, breaking up with her will take more than just a talk. She'll kick and scream to the very end and might even make threats against you or herself. This is where things can get really dangerous for your emotional and physical well being.
Labels:

Comments

Post a Comment

Popular posts from this blog

B*Tree Reverse index

B*Tree Reverse index is one of the index types that is supported by oracle. It more or less behaves like b*tree unique & non-unique index but only difference is the way it constructs the tree. In this index, index value is stored in the reverse direction when compared to the values in the actual data table. This index is used in order to distribute the index data evenly across all the leaf index nodes if table data is skewed very high. Like b*tree index, this index doesn’t understand NULL. This B*Tree Reverse index can be created on a single column or more than one column. More than one B*Tree Reverse index can be created for the same data table. HOW TO VERIFY: How to verify whether the created index is reverse index or not? Fire this query, select index_type from user_indexes where index_name = 'DEPT_ID_INDX' ð   This query would return “ NORMAL/REV ” (it means it is B*Tree index but of “Reverse” type) LITTLE-KNOWN FACTS TO BE REMEMBERED: ·          If this B*Tree Reve
Post a Comment
Read more

Nested Loop Outer Join

Before we go into this topic in detail, first we will understand what outer join is meant by. For an example, take 2 tables which have to be joined, say “Parent” table & “Child” table [I have taken these table names, only to discuss this topic in an easy way]. If Child table is outer joined with Parent table, then you can say, the matching records from both these tables will be retrieved and then the records which are available only in Parent table will also be retrieved though the corresponding matching records are not available in Child table. This is called outer join. [in natural or equi-join, only the matching records from both the tables will be retrieved.] To perform this outer join, 3 different join techniques have been provided by oracle. ·          Nested loop outer join ·          Hash outer join ·          Sort merge outer join In this, we will discuss about nested loop outer join. To perform this nested loop outer join, Oracle follows these steps (assume, child ta
Post a Comment
Read more

Index Fast Full Scan

Index Fast Full Scan is one of the index access methods supported by Oracle. Index Fast Full Scan is otherwise called as Fast Full Index Scan also. Index Fast Full Scan can be imposed by Oracle Optimizer only in the certain scenario. The scenario where this index would be invoked is, Whenever the Oracle SQL optimizer detects that the query is serviceable without touching table rows, Oracle invokes this fast full index scan and quickly reads every block of the index without touching the table itself provided that query doesn’t contain any ORDER BY clause. The definition for this scan is more or less similar to the index full scan but the only difference is that former  will be invoked when ORDER BY clause is not mentioned in the query. It differs from the index full scan in another way where output won’t be in the sorted order since ORDER BY clause is not mentioned. If Oracle detects the query is serviceable without touching the table rows, it means, all the columns mentioned in th
Post a Comment
Read more