|
Here is the explanation found from MSDN:-
<br />
<br />
<br />
<br />
<br />
<br />
this.Cursor = new Cursor(GetType(), "MyCursor.Cur"); <br />
<br />
Next time search on Google for something you don't understand.
- Stop thinking in terms of limitations and start thinking in terms of possibilities -
|
|
|
|
|
thank you friends....
|
|
|
|
|
I am sure you can make out clearly from the ADT tht its an interface created for Set. Now this is supposed to test if it is empty, or if a element belongs to a set and find the inetersection of 2 sets and so on. But i wanted to implement this in C#. but i couldn't program it in C#. So can anyone help me please
// invariant: Cardinality >= 0
public interface ISet
{
// Pre: true
// Post: return the cardinality of the set
int Cardinality { get; }
// Pre: true
// Post: Object element is contained in the set and the
// cardinality increases by 1
void Add(Object element);
// Pre: Object element is contained in the set
// Post: Object element is not contained in the set and the
// cardinality decreases by 1
void Remove(Object element);
// Pre: true
// Post: return true if Object element is contained in the set;
// otherwise, return false.
bool IsMember(Object element);
// Pre: true
// Post: return true if Cardinality = 0; otherwise, return false.
bool IsEmpty();
// Pre: true
// Post: return true if all elements in the set are contained in
// set anotherSet; otherwise return false.
bool IsSubsetOf(ISet anotherSet);
// Pre: true
// Post: return true if all elements in this set are contained in
// set anotherSet and all elements in set anotherSet are
// also contained in this set; otherwise, return false.
bool IsEqual(ISet anotherSet);
// Pre: true
// Post: return a set that contains all elements in set
// anotherSet and all elements in this set
ISet Union(ISet anotherSet);
// Pre: true
// Post: return a set that contains elements in both set
// anotherSet and this set
ISet Intersection(ISet anotherSet);
// Pre: true
// Post: return a set that contains elements that are contained
// in this set, but are not contained in set anotherSet
ISet Difference(ISet anotherSet);
}
|
|
|
|
|
Read the post by Chris Maunder, "How to get an answer to your question".
Pay attention to number two.
No one is gonna do your work for you, only help with specific problems.
You have to try before asking a question, and if you run into problems, we're here to help.
Kristian Sixhoej
"Failure is not an option" - Gene Kranz
|
|
|
|
|
If you can't program in C#, maybe it's time you learnt how to.
Or do you intend to go through life asking others to do your work for you? You won't get very far with this attitude.
Paul Marfleet
"No, his mind is not for rent
To any God or government"
Tom Sawyer - Rush
|
|
|
|
|
Hello,
I have a problem with using Microsoft Application Blocks Configuration manager with Visual Studion 2008, .NET framework 2.0 on a Vista machine.
I am using unencryped XML as the data store and provider. In my C# code I call ConfigurationManager.Write("MyConfig", myObject) after the user changes a value of myObject.
The MyApplication.vshost.exe.config file in my MyProject\Bin\Debug folder updates on the write. Its timestamp updates and if I open the file in a text editor its content changes the way it should.
The problem:
When the user closes the application the MyApplication.vshost.exe.config file's timestamp reverts to its original value and the contents of the file also revert to original.
I have researched this problem a good deal with no luck. I have found the same behavior in the sample code for MSAB that was installed on my machine from the Microsoft download. That is in the provided QuickStarts.Write project I can save a change to the XML configuration file and Write.vshost.exe.config updates until I close the application. The configuration file reverts to the original timestamp and content when the application closes.
Arrrrrgghhhhhh!
Thanks in advance for any insight into this headbanger.
|
|
|
|
|
Would it be possible that, after making changes to the application config file, you forget to call:
Configuration.Save() to save the changes ConfigurationManager.RefreshSection() to force reloading the changed section ?
SkyWalker
|
|
|
|
|
I don't think that is the problem. With the ConfigurationManager class that I'm using, RefreshSection() is not defined.
Best,
Bill
|
|
|
|
|
If you're using VS 2008, then you might want to see this comment[^] made by the Visual Studio Product Team
SkyWalker
|
|
|
|
|
Hello friends,
Now a days, i am getting some work like using existing vb, vc++, ATL, MFC etc.
code. I have task to to invoke or reuse the code in the C#.Net application.
I am able to invoke com component code in C#. But i am facing problem when i try
to invoke the win32 C++ code in C#.net. So can any one give me helpful sites, book list
for all types of interoperability which can be done with C#. That is under one umbrella.
It will help be to trace out or reach at decision can we do the interoperability.
Thanks in Advance.
|
|
|
|
|
|
Thanks for your fast reply.
But, as per my knowledge i thing the site give information for only p invoke i.e.
DllImport like that attribute not other things. Can you provide some more sites which will cover other
things which are not covered here.
Any ways thanks for your help.
|
|
|
|
|
|
how i can use wpf with vs2005
123
|
|
|
|
|
|
Apart from what DaveyM69 says you ideally need Expression Blend as well. We have a WPF product at work and the guy doing it says his productivity is about 10 times greater using Expression Blend + VS 2005.
Kevin
|
|
|
|
|
how can i count same values considering i don't know what values are in the array?
|
|
|
|
|
Use a generic Dictionary<int, int=""> to store the frequency count of each unique value in the array.
Loop through the values in the array. For each value, increment the frequency count for that value in your Dictionary by 1. After you have passed through the array, your Dictionary should contain a number of items whose keys represent the unique values in your array. The value associated with each key will represent the frequency count for that value.
Paul Marfleet
"No, his mind is not for rent
To any God or government"
Tom Sawyer - Rush
|
|
|
|
|
Hi, sorry but how do you use Dictionary please?
I can get unique values with the following code but i am stuck with the count.
List<int> myList = new List<int>();<br />
<br />
int index;<br />
<br />
for (int i = 0; i < myArray.Length; i++)<br />
{<br />
index = myList.BinarySearch(myArray[i]);<br />
if (index < 0)<br />
{<br />
myList.Insert(~index, myArray[i]);<br />
}<br />
}<br />
int[] arr = myList.ToArray();<br />
foreach (Int32 tmp in arr)<br />
{<br />
Console.WriteLine("id: {0}", tmp);<br />
}</int></int>
|
|
|
|
|
i dont have any ide here, so i can only provide some untested half-pseudo-code.
it might help you to get on the way..
map will contain your arrayObjects as key and the count as value.
Hashmap<object, int> map = new Hashmap<object, int>();
for (int i=0; i<myArray.Length; i++)
{
object value = myArray[i];
if (map.Keys.Contains(value))
{
map[value] = map[value] + 1;
}
else
{
map.Add(value, 1);
}
}
|
|
|
|
|
Isn't Hashmap a Java type? I don't think it's available in the .NET framework.
In this case, the OP should use the generic Dictionary type, with both the key and value of type int .
Paul Marfleet
"No, his mind is not for rent
To any God or government"
Tom Sawyer - Rush
|
|
|
|
|
oops, youre right. i always run into this problem. guess LinkedList would fit here, too.
|
|
|
|
|
Did you try reading the documentation[^]?
Paul Marfleet
"No, his mind is not for rent
To any God or government"
Tom Sawyer - Rush
|
|
|
|
|
thanks got it working.
Dictionary<int, int=""> dic = new Dictionary<int, int="">();<br />
<br />
for (int i = 0; i < myArray.Length; i++)<br />
{<br />
int value = myArray[i];<br />
if (dic.ContainsKey(value))<br />
{<br />
dic[value] += 1;<br />
}<br />
else<br />
{<br />
dic.Add(value, 1);<br />
}<br />
}<br />
<br />
int[] keys = new int[dic.Count]; <br />
int[] values = new int[dic.Count]; <br />
dic.Keys.CopyTo(keys, 0);<br />
dic.Values.CopyTo(values, 0);<br />
<br />
for (int i = 0; i < keys.Length; i++){<br />
Console.WriteLine("{0} \t : {1}", keys[i], values[i]);<br />
}</int,></int,>
|
|
|
|
|
Hi,
the easiest approach I know is a two-step algorithm:
1. sort the array or whatever collection you have; .NET knows how to do that.
2. iterate over the collection, and count how often an item is identical to the previous one.
BTW: if you are not allowed to modify (i.e. sort) the original collection, you will need
a helper collection, such as a HashTable/Dictionary, as others already explained.
Luc Pattyn [Forum Guidelines] [My Articles]
This month's tips:
- before you ask a question here, search CodeProject, then Google;
- the quality and detail of your question reflects on the effectiveness of the help you are likely to get;
- use PRE tags to preserve formatting when showing multi-line code snippets.
|
|
|
|