Common Dialog Boxes - VB6.0

 

VISUAL BASIC 6.0

 

COMMON DIALOG BOXES

In VB6.0, to use a set of predefined standard dialog boxes, which are

        File Opening and Saving

        Font and Color selection

        Printing and Previewing

To use the Common Dialog Control, you first place this control on form.

The Common Dialog Control may not appear in your toolbox. 

It is a custom control and you must add it to VB before you can use it. 

Custom controls are stored in files with an extension of .ocx in Windows/System folder. 

Open the Project menu and choose Components; see Microsoft Common Dialog Control 6.0 in the list. 

Make sure that a check appears next to the item and its tool should appear in your toolbox.


Using a Common Dialog Box

After place a Common Dialog Control on form, to display any of its dialog boxes at run time. 

General Form

Object.ShowMethod

The method can be one of the following

Dialog Box

Method

Open

ShowOpen

Save As

ShowSave

Color

ShowColor

Font

ShowFont

Print

ShowPrint

Color Dialog Box

The color selected by the user is stored in the Color Property.

To assign this property to another object such as a control (label, text, etc.,) or the form.

Example

Private Sub MNUCOLOR_Click()

MsgBox "Now, select Background color of the form"

CommonDialog1.ShowColor

Form1.BackColor = CommonDialog1.Color

MsgBox "Now, select Forecolor of the label"

CommonDialog1.ShowColor

Label1.ForeColor = CommonDialog1.Color

End Sub



Font Dialog Box

The font properties for the common dialog control are different from those used for other controls.  Instead of a group of properties for a Font object, each Font property is listed separately.

Font Object of

Other Controls

Font Property of

Common Dialog Box

Values

Font.Bold

FontBold

True or False

Font.Italic

FontItalic

True or False

Font.Name

FontName

System dependent

Font.Size

FontSize

Font dependent

Font.StrikeThrough

FontStrikeThru

True or False

Font.Underline

FontUnderline

True or False

Example

Private Sub MNUFONT_Click()

MsgBox "Now, Select Font of the label"

CommonDialog1.ShowFont

With Label1.Font

        .Name = CommonDialog1.FontName

        .Bold  = CommonDialog1.FontBold

        .Italic = CommonDialog1.FontItalic

End With

End Sub



Comments

Post a Comment

Popular posts from this blog

Backtracking - N-Queens Problem, Sum of Subsets, Graph Colouring, Hamiltonian Cycle

Image
UNIT - V : BACKTRACKING General Method – 8-Queens Problem – Sum Of Subsets – Graph Coloring –  Hamiltonian Cycles General Method Backtracking is a problem-solving technique used in algorithms to find solutions by exploring all possible options. In backtracking, a state-space tree is a tree-like structure that represents all possible states (solutions or non-solutions) of a problem. Backtracking algorithms explore this tree using a depth-first search approach, systematically checking each path until a solution is found or all possibilities have been exhausted.  Here’s how it works, step-by-step: Start with a choice : Make a decision and move forward. Check feasibility : If this choice leads to a solution or partial solution, continue. If not, stop exploring this path. Go back and try a different path : If you reach a dead end, go back to the last point where you made a choice. Try a different path from there. Repeat until you find a solution ...
Read more

Divide and Conquer Technique - Binary Search, Quick Sort, Merge Sort

Image
  UNIT II - DIVIDE AND CONQUER TECHNIQUE General Method – Binary Search – Merge Sort – Quick Sort.  GENERAL METHOD The divide and conquer technique is a problem-solving approach that works in three main steps: 1.       Divide : Break down a large problem into smaller, simpler sub-problems. 2.       Conquer : Solve each of the sub-problems individually. This can often be done recursively if the sub-problems are still large. 3.     Combine : Combine the solutions of the sub-problems to get the solution to the original, larger problem. This approach is commonly used in algorithms like binary search, merge sort and quick sort, where breaking down a problem makes it easier and faster to solve.   BINARY SEARCH Binary search is an efficient algorithm for finding a target value within a sorted list. Here’s how it works: Start in the Middle : Look at the middle element of the list. Compare : ...
Read more

GRAPH THEORY

Image
  GRAPH THEORY DEFINITION A graph G = (V, E) consists of a non-empty set V, called the set of vertices (points, nodes) and a set  of ordered or unordered pairs of elements of V, called the edges E set (links), such that there is a mapping from the set E to the set of ordered or unordered pairs of elements of V. Example In the first graph, V = { A , B , C , D } E = {(A,B) , (A,C) , (A,D), (B,C), (B,D) , (C,D)} In the second graph, V = { E, F, G } E = {(F,E) , (E,G) , (G,F)} If an edge e ∈ E is associated with an ordered pair (u,v) or an unordered pair (u,v), where u,v ∈ V, then e is said to connect or join the nodes u and v.  The edge e that connects the nodes u and v is said to be incident on each of the nodes.  The pair of each node that is connected by an edge is called adjacent nodes . Isolated Nodes If any node has no edges connected with any other node then its degree will be zero(0) and it will be called as isolated node. Adjacent Nodes Her...
Read more