So basically, I started out with each wizard == 1 winform, but then I found another way to do it by making the content of each wizard step a user control, then say, on initial deployment, it load usercontrol1, then when i click next, the panel hide usercontrol1 for usercontrol2 and so forth. Would it be feasible to create all usercontrols (all the wizard step) and add them in an array, then i can load them by index?
View 7 Replies1.I wanted to create my own title bar in winform.
2.I have created for one form and i want to apply it for all form.
3.Are there any Styling winform package available for free.
I have two Form Employee and Instructor, here Employee is super class of instructor.
public class Instructor: Employee
{
//Instructor class
}
I am able to access all property of Employee inside instructor class but with these some textbox and button design inside Employee design is also getting inherited inside Instructor design and i don want this and i want to maintain the parent-child relationship between Employee and Instructor.
So I am upgrading the system from 3.5 .NET to 4.5.1 and fixing any bug that I could find. Long story short, I run into an issue that basically tell me it couldn't find the images in the resource file. I figured out a work around, but first I have to set the picture box or background Image in design time to none. I ran into this Properties Windows while changing the value of picturebox for my user control saying: Property value is not valid. Object reference not set to an instance of an object. This usercontrol is taken from another user control from a different project. Basically, we are reusing it.
View 9 Replies View RelatedI have a main WinForm that I want to press a hotkey and show and hide the form. I can press Insert and hide the form and I see its icon in my Win7 task bar but when I press Insert again it doesn't show. Is my coding logic wrong to make it work? Maybe when its hidden the Insert key isn't being 'seen'? Although the code I am using I got somewhere on the internet that says it will work at the app level.
virtual bool PreFilterMessage(Message% m) {
// Detect key down messages.
if (m.Msg == WM_KEYDOWN) {
Keys keyCode = (Keys)((int)m.WParam) & Keys::KeyCode;
[Code] ....
I made a winForm with a button on it in the Designer (VS 2010 C++).
But when I run my app, the button does not show on the form.
The button visible property is set to true.
I have the following code. I have hardcoded the x and y values to test. And for some reason for the point (0,-0.5) it plots (1,-0.5) . What is going on, because if you try other values then the graph displays correctly.
foreach (var grp in q) {
point = new DataPoint();
Sum1 = grp.Sum1 > 2 ? 2 : grp.Sum1;
Sum1 = Sum1 < -2 ? -2 : Sum1;
[Code] ....
Attached is what is displayed.
Attached image(s)
How do I count the objects(for example botton) on the form
View 1 Replies View RelatedI was created winform application with sql data base, after i created it i was converted to the installer file,for the other users but when they run the application did not connect to the database, how i fix this stuff...?
View 1 Replies View Related I have a question about one function in my program. Write a function that will replace players in a tim. New player gets in the game, and takes the place of one that leaves. Prototype of function is:
Code:
void replace(TEAM *p,PLAYER newplayer,int num)
where second parameter is new player, and the third is a jersey number of player who leaves the game.Two structures are defined as:
Code:
typedef struct{ char name[25],surname[25];int number;}PLAYER;typedef struct{ char nameofteam[25];int numberofplayers;PLAYER *players;}TEAM;
First I tried to read which player should get out, but that didnt work:
Code:
printf("which player should get out?
"); do { scanf("%s",p->players.number) } while(p->players.number);//
Choose one of previously read players Second thing is to read a new player and replace him with the chosen who leaves.
I have a pointer to a pointer to a C string:
char**objectData;
In this string there are some numbers with a dash between them, for example, "5-10". I need to read these numbers in and then increment them. So "5-10" becomes "6-11", "6-11" becomes "7-12", etc.
So far I have:
Code: char temp[350]; //350 chars is plenty enough
// Copy the first characters BEFORE the numbers into a new char array. The next characters are the numbers.
strncpy(temp, *objectData, 39); The next steps are:
- Extract the two numbers from the C string (determining if the number is 0,2 or 3 digits long) and write them into two ints. I'm stuck here.
- Increment the ints
- Write the ints into the array with a dash inbetween.
I thought I'm done doing mg activity, but my professor said that we need to use a Temporary Variable for Swapping but where to put it.
Here is his activity:
Activity: Swapping Create a program that accepts a 10-element array of type int. Where the 1st user-input is stored in the 1st element of the array; the 2nd user-input is stored in the 2nd element of the array; so on so forth until the last user-input stored in the last element of the array. Your source code should be able to SWAP the values of the 1st and 10th; 2nd and 9th; 3rd and 8th; 4th and 7th; and 5th and 6th elements. It should display the values of the original and the swapped values of the array. example:
Enter 10 integer values:
array[0] = 1
array[1] = 2
array[2] = 3
array[3] = 4
[Code]....
I have a function that is suppose to swap positions of 2 letters but It doesn't seem to work. Im passing in the array of char into the function.
void swapletter(char word[]) {
char temp1;
int swap1;
int swap2;
cout<<"What is the first location: ";
cin>>swap1;
[Code] ....
Giving the following program, how do i access the swapping function. I've tried swapp::change <int> ( a, b ) ; and it gave me 4 errors. Here's the code:
#include <iostream>
using namespace std;
template <typename T>
class swapp
[Code].....
I tried normal swapping method like this (counter is number of structures written in file) :
Code:
fopen("books.txt","r+");
system ("cls");
for(i=1;i<counter-1;i++){
for(j=1+1;j<counter;j++){
fscanf(f," %[^,], %[^,], %[^,],
[Code] ....
But it doesn't do anything.
Write a program that gets a sequence of unsigned integers.the user can enter at most 100 integers.
After getting the numbers, the program allows the user to repeatedly choose one of the three options:
1. swap the location of two entries in the sequence. if this option is chosen the user is prompted to enter the two locations to be swapped.
2. print out the sequence.
3. repeatedly swap two locations in the sequence until getting back to the state before this operation started. then print out the number of swaps performed.
I am working on a program where I sort elements into alphabetical order and then when one is less than the other I swap them. I first did it by swapping the data but they want me to swap the nodes instead and I am having trouble doing that.
Node *add_node( Node *list, const string &s ) {
struct Node *n = new struct Node;
n->word = s; // copy string s to word
n->next = 0;
// add node n to the list
// the list should always be in ascending alphabetical order
n->next = list;
list = n;
[Code] ....
I've been working on this linked list priority queue . I know that the root of the problem is in my swapUp() function (swapping the positioning of two nodes based on their priority), because the list works great up until it is called. The seg fault is not actually being caused by swapUp(), it's being caused by peekAt(), which returns the element in the node at position n. But the error does not occur unless swapUp() is called first, so that is where the issue is (I think).
There is also a seg fault being caused in the destructor, which I believe may have the same root cause in swapUp().
PRIORITY QUEUE:
#ifndef JMF_PriorityQueue
#define JMF_PriorityQueue
#include <iostream>
#include <string>
template <typename T>
class PriorityQueue{
[Code] .....
Okay, so I've tried implementing SwapUp() in a different new way, but it's still giving me the same problem
template <typename T>
void PriorityQueue<T>::swapUp(Node * target){
Node * partner = target->next; //Partner = target next
[Code] .....
This is such an elementary logic problem I don't know why I'm having so much trouble with it.
I have a question about one function in my program. Write a function that will replace players in a team. New player gets in the game, and takes the place of one that leaves. Prototype of function is:
void replace(TEAM *p,PLAYER newplayer,int num)
where second parameter is new player, and the third is a jersey number of player who leaves the game.
Two structures are defined as:
typedef struct {
char name[25],surname[25];int number;
}PLAYER;
typedef struct {
char nameofteam[25];int numberofplayers;PLAYER *players;
}TEAM;
First I tried to read which player should get out, but that didnt work:
printf("which player should get out?");
do {
scanf("%s",p->players.number)
} while(p->players.number);//Choose one of previously read players
Second thing is to read a new player and replace him with the chosen who leaves.
Let's say there is a document which stores data of exams of 3 subject. The document is in the below format:
Subject code [spc] Student code [spc] Exam score [endl]
Repeatedly, there are 100 data. E.g.
ENGL_S12 [spc] 000001 [spc] 90.5
ENGL_S12 [spc] 000005 [spc] 77.3
MATH_G22 [spc] 000502 [spc] 100
LATI_F11 [spc] 002005 [spc] 65.4
...
Now I have to write a function show_exam_descending(Data d, string subCode)
when I call show_exam_descending(d, "ENGL_S12")
the program will execute to show all the students' exam scores in ENGL_S12 in DESCENDING order...
For this to run, I have declared a struct Data:
struct Data {
string subjectCode;
int studentCode;
double examScore;
);
For the search, I have written a function before to load all the data from the document by using pointer and dynamic arrays. It works so well. What troubles me is the way to swap the elements (i.e. examScore) of different students in struct dynamic arrays. I am able to display all of them, but don't know how to swap.
Write a program using user-defined function which is passed a string and that function should cycle the string.(Do not use any string related functions). E.g.
If the string is : Chetna then it should print as Chetna, hetnaC, etnaCh, tnaChe,naChet, aChetn
Ans.
#include <iostream>
using namespace std;
char swamp(char a[], int x) {
for(int k=0; k<=x; k++) {
char l= a[x]; a[x]= a[0]; char p=a[x-1]; a[x-1]=l;
for(int i=1; i<x-2; i++) {
[Code]...
Suppose multiple threads are are trying to insert into a STL Map, both are trying to insert with same key. As per my understanding it will not cause any issue till you invalidate the iterator. Here as per me it will not invalidate the iterator.
View 2 Replies View RelatedWhen i am entering single character instead of 'miz' then it is working great. But when i am using multi character like 'miz' it is showing error output. i did this program with c++ it is working but not working in c.When i am running this program it is showing {warning] multi character constant.
Code:
#include<stdio.h>
#include<string.h>
main()
{
char a;
printf("Please Enter your First Name: ");
scanf("%s",&a);
[Code]....
I have pseudo code for the minimax algorithm but i was wondering what i would need to add to make it work with many players (n players)?
score minimax(state s, int n)
if (n = 0 OR s is a terminal node) {
if win position for program
return +inf;
if loss position for prg
[Code] ....
i want to make a two-dimensional array that is consisted by objects but i dont want to initialize the objects when i make the array.. i just want to make an array that each of his "cells" has the size of an object.For example,
class Human{
int hm=5;
...
};
and now i want to make a two dimensional array that each "cell" has the size of an Human but not a Human itself.
I am new to Path Finding so I just know BFS, DFS, Djisktra, and Basic A*
I've searched for a few multi agent pathfind paper here and there. But I can't seem to understand them..
I am path finding in a grid map, 4 ways neighbor movement
My map isn't so big it's 300 x 300 up to 400 x 400
Most of the map is open space, I would say that at worst case 4/5 of the map is open space.
And there is probably around 100 agents.
I've tried running BFS 100 times and it takes around 200ms on average
Changing BFS to A* which I am thinking right now will definitely cost lesser time
But are there better ways in doing this ? and also Does running Single Agent A* multiple times doesn't cause problem for other agent ? perhaps causes deadlocks ? ( Considering that the path that have been determine for agents before the current searched is considered blocked )