|
Yes, this is one way to do it.
"Blessed are the peacemakers, for they shall be called sons of God." - Jesus
"You must be the change you wish to see in the world." - Mahatma Gandhi
|
|
|
|
|
|
Hi all,
is there a way to open MS Office documents (word documents, excel spreadsheets, powerpoint presentations) and acrobat PDF files within a Windows Forms application? Is there an ActiveX component or something similar to achieve this? Thanks for any clues in advance!
Rado
|
|
|
|
|
iSEDQuickPDF is 60.00. Load the word 9.0 library, excel 9.0 library
also www.planetpdf.com has a lot but ised is cheap and easy to use
I'm not an expert yet, but I play one at work. Yeah and here too.
|
|
|
|
|
Ista wrote:
iSEDQuickPDF is 60.00
Well, I am not interested in manipulating or generating PDF files, I just want to view them in my application and needed a clue, something where to start and what to look for. But anyway thanks a lot for the info, iSEDQuickPDF looks good and I may use it in future.
Rado
|
|
|
|
|
Okay so I get back monday after a power flicker. I had to rebuild my solution with 6 different projects inside. One of them dispatcher. When I set a breakpoint it tells me I dont have symbols loaded. I specified the main folder in the debug symbols dialog and it still wont let me at it.
Please help me dude
I'm not an expert yet, but I play one at work. Yeah and here too.
|
|
|
|
|
nvm, the VS.NET IDE really bites as far as debugging reliability is concerned
I'm not an expert yet, but I play one at work. Yeah and here too.
|
|
|
|
|
Hello, I have a c# assembly that gets called by unmanaged code (it gets called by Internet Explorer, like a plugin).
What I want to know is, how do I get the thread ID of the current thread? If I use System.Threading.Thread.CurrentThread, I can only get the name. As I understand it, C# threads are not the same thing as old win32 threads. But since my C# assembly is being called by unmanaged code, it is definately running on one of those win32 threads, how do I get the thread ID?
thank you
"Outside of a dog, a book is Man’s best friend. And inside of a dog, it’s too dark to read."
-Groucho Marx
|
|
|
|
|
Have you tried the GetCurrentThreadID() API? I know it's best to stick with the managed versions of the Win32 APIs, but this might give you what you want with no ill affects.
|
|
|
|
|
Well Thread.GetHashCode Will but as you guessed its a managed thread ID which isnt a win32 id because really it runs in appDomains and other factors. The key word is managed AKA hosted
<br />
Note An operating-system ThreadId has no fixed relationship to a managed thread, because an unmanaged host can control the relationship between managed and unmanaged threads. Specifically, a sophisticated host can use the fiber API to schedule many managed threads against the same operating system thread, or to move a managed thread between different operating system threads.<br />
hope this helps
I'm not an expert yet, but I play one at work. Yeah and here too.
|
|
|
|
|
Also SYstem.AppDomain.GetCurrentThreadID
I'm not an expert yet, but I play one at work. Yeah and here too.
|
|
|
|
|
I'm working with the Reflection functions to dynamically load and invoke methods on a given assembly. I'm able to load and invoke methods as long as the parameters are not defined as ref or out. How do I invoke those methods with parameters marked as ref or out?
Thanks...
|
|
|
|
|
Hiya... something like...
Type t = myDynamicallyLoadedObj.GetType();
MethodInfo m = t.GetMethod("Swap");
args = new object[2];
args[0] = 1;
args[1] = 2;
m.Invoke(myDynalicallyLoadedObj,args);
where myDynamicallyLoadedObj.Swap is defined as...
public void Swap(ref int a, ref int b)
{
int x = a;
a = b;
b = x;
}
Will do the trick... same for outs AFAIK...
HTH
-----------------------------------------------------------------------
Shaun Austin: .NET Specialist. Spreading the word of .NET to the world... well the UK... well my tiny corner of it!!
|
|
|
|
|
Can anyone recommend a 3rd party component/framework for adding simple visio-like drawing capabilities to an application? Does not need to by complex - only dealing with 3-5 shapes. Need ability to drag shapes onto workspace, draw connector lines between shapes - rubberband connection as shapes are moved, allow text and image to be placed in shape.
Thanks,
Steve
|
|
|
|
|
seems like a cool and easy project
I'm not an expert yet, but I play one at work. Yeah and here too.
|
|
|
|
|
I recommand you my flowcharting product: AddFlow for .NET.
You can download an evaluation version at:
http://www.lassalle.com/download.htm#.NET
|
|
|
|
|
Can someone give me the code for Dijkstra algorithm in c#, i have seen the article written on shortest path and bowloaded the code and i still can't seen to find it. Any help would be greatly appreciated!!
Thanks,
Da Intern
|
|
|
|
|
|
I need some more help i don't know c at all, i just jumped into c#
Da Intern
|
|
|
|
|
Look at the second link. C#. That in fact takes you to a whole scope of usable algorhithms. Algorhytms are language independent. IOW they work the same. Just follow the logic step for step. I'm pretty sure (well I dont) most people try to NOT remember algorhythms, hence I (or most others) cannot help you. A beeter bet would be to ask help form a mathematical message board if Google does not provide enough clarity.
leppie::AllocCPArticle(Generic DFA State Machine for .NET);
|
|
|
|
|
go back to university, people/lab who research on path finding, routing and the like should be able to provide you with something. Look for games, bandwidth/network traffic control/optimization. Although universities don't usually provide production quality code and it's probably in c++ - just expose the code to Managed C++, and use from C#
Norman
norm
|
|
|
|
|
norm wrote:
go back to university
Or maybe get on a uni site. My, but there's gold to be found there if you take the trouble to mine it.
"Blessed are the peacemakers, for they shall be called sons of God." - Jesus
"You must be the change you wish to see in the world." - Mahatma Gandhi
|
|
|
|
|
Looking at the subsequent thread, I'm not sure what you're asking for. Are you asking for an explanation of Dijkstra's algorithm? Or for an explanation why a particular implementation of D's algorithm does what it's supposed to do?
Cheers, Julian
Program Manager, C#
This posting is provided "AS IS" with no warranties, and confers no rights.
|
|
|
|
|
:-DBasically i'm trying to find the code for dijkstra's algorithm in c# so i can use it in a program im making. I understand the concept but im just having alot of trouble writing the code for it.
p.s. Thanks alot
Da Intern
|
|
|
|
|
So take it step by step.
Dijkstra's algorithm is a "shortest path" algorithm for a network of nodes. So it requires a collection of nodes (doh! ) or vertices connected with edges that have costs associated with them. So think about how that could be represented. A vertex could be a simple class, the edges could be a class containing the from vertex, the to vertex and the cost. Or you might use a sparse matrix of vertices where the edges are defined at the intersection of column and row vertices.
It also requires a container into which you can push all the nodes and that will pop them out in lowest cost order (the cost of a node being the cost of the path to get there from the start node). Think about how you'd write that (it's called a priority queue).
That's pretty much it, just some glue code to run the algorithm and you're away.
So look at any code you find on the web that purports to implement Dijkstra's and try and identify these two parts and understand how the programmer implemented them. Try and find a Java example rather than a C++ example, you'll have a better chance of understanding it.
Cheers, Julian
Program Manager, C#
This posting is provided "AS IS" with no warranties, and confers no rights.
|
|
|
|