|
I tried .. it's too big .. and most of the functions I didn't even hear of ... beside I'm learning Visual basic now .. and the project should be done before january.
thanks anyway ... I found one in VB .. not sure it's what I'm looking for .. but I will see about that
Luay Al-wesi
|
|
|
|
|
luay1985 wrote: I found one in VB .. not sure it's what I'm looking for .. but I will see about that
Good luck. Hope it's what your looking for -D
That's no moon, it's a space station. - Obi-wan Kenobi
|
|
|
|
|
Prime Numbers, by David Wells. An excellent read for amateur and advanced mathematicians.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
Are the page numbers in primes only, cos that would be cool.
Look where you want to go not where you don't want to crash.
Bikers Bible
|
|
|
|
|
That would have been cool, but it was done with the layman in mind.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
The Music of the Primes, by Marcus du Sautoy - also a good read on the subject - good history
|
|
|
|
|
Hey,
I am currently converting an application that (i think) was originally written in C, it was then upgraded to C/C++ and compiled as a 32bit Dos application using Watcom/dos4gw and the metagraphics libraries.
For the printed reports the app created several Hidden Line images and stored them as PCX / HPG / and DXF files.
I have managed to get this routine running in VC++ (with suprisingly little modification).
The original DOS version was fairly slow (about 2-3 seconds per scene) but running it in VC++/Windows takes soooo long, upto a minute or more !??
A stand-alone VC++ Project can be downloaded from :
http://www.rayevansengineering.com/Surreal/HiddenLine.zip[^]
Can anyone help me optimise this to a reasonable speed or at least help me understand why it takes so long.
As far as i'm concerned you are free to use this source code as you wish, but bear in mind that i'm not the original author.
The file VIEW.DAT contains the model information and must be present for the code to work
cheers
|
|
|
|
|
I'm roughly up to speed on how to perform things like reflection and rotation, and even simple shear.
However, I want to produce a perspective effect on a 2D shape. If we take the case of a rectangle, the left edge would appear nearer the viewer than the right edge. These edges should still be vertical. However, instead of the top and bottom being parallel, they should taper, moving closer together as the X value increases.
Is there a 'magic' transformation I can apply, or do I have to iteratively update the points from left to right?
For simple shapes (like the rectangle), this wouldn't be too onerous, but I am also looking at generating the same effect for text, where there would be a larger number of points, and the order of the points is not so easy to predict.
Steve S
Developer for hire
|
|
|
|
|
|
TVM. That sort of helps, except I'm not using OpenGL, but it gives me a few ideas.
Steve S
Developer for hire
|
|
|
|
|
How to find all possible permutations from a nth set of characters with kth number, for example to find 2 number permutation from 3 characters.
abc
all possible permutation are here.
ab
ba
ac
ca
bc
cb
Warm Regards,
Mushq
|
|
|
|
|
s = {a1, ..., an}.
Loop i1 from 1 to n.
.
.
.
Loop ik from 1 to n.
Flag each character as being used or not and skip it if it is being used.
Concatenate si1...sik.
If any sim is empty for 1 ≤ m ≤ k, then skip it.
This gives all permutatons of length k.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
If any sim is empty for 1 ≤ m ≤ k, then skip it.?
Sorry friend i couldn't understand the above sentence, can you please elobrate that.
|
|
|
|
|
Assume you had the last L bits flagged as used for the first L iterations (iL), and for the (L+1)st bit you were in the (K-L+1)th position or higher, then all of the characters after this starting position are in use and your character will be empty, so skip the concatenation.
"I know which side I want to win regardless of how many wrongs they have to commit to achieve it." - Stan Shannon
Web - Blog - RSS - Math - LinkedIn
|
|
|
|
|
|
Which of these data structures is the fastest:
1) Binary Tree.
2) Stack.
3) Hash Table.
---
![Beer | [beer]](https://www.codeproject.com/script/Forums/Images/beer.gif) Hakuna-Matada
It means no worries for the rest of your days...
It's our problem free, Philosophy
<marquee behavior="alternate" scrollamount="5" scrolldelay="50"> ![Jig | [Dance]](https://www.codeproject.com/script/Forums/Images/jig.gif)
|
|
|
|
|
Depends on the implementation, and what do you like to do with it.
Inserting: Stack O(1), BinTree O(log n)
Deleting: Stack O(1), BinTree O(log n)
Searching: Stack O(n), BinTree O(log n)
Sorting: Stack O(n²), BinTree O(n log n)
Hash Table should be nearly the same to Binary Tree (I not quiet sure. It's monday morning, and I'm still almost asleep).
Regards,
Ingo
------------------------------
PROST Roleplaying Game
War doesn't determine who's right. War determines who's left.
"Would you like us to drop a bomb on you too? We have 10,000 of them!"
- espeir
"Perhaps we should lend them a nuke or two."
- espeir
|
|
|
|
|
Every data structure has a specific use.
lists are designed for inset-in-the middle scenerios, just as stacks are designed for Last-In-First-Out scenerios. A stack really can't be compared to the other two because usage is completely different.
A binary tree is not a replacement for a list, per se. Though it does handle add-anywhere scenerios, as does a Hash table. A binary tree is much superior to a list for searching, and even over a hash-table for some-search operations. A hash table is a one to one relationship with a key, and requires pre-allocated space. That makes its memory overhead a constant, its access time for any "one" item a constant. But if you want to output in sorted format, a hash is lousy, and a tree is still great.
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
For search: Hashtable
BT is O(log n)
Stack is O(n)
HT is O(1)
|
|
|
|
|
Hashtable is the fastest for finding an exact value.
Binary tree is best if you need to do searches like "get the smallest value that is greater (or equal) some value".
You don't search in a stack, it always returns the element on top.
|
|
|
|
|
Hi.
It also depends on where/how the dats is stored. If it resides on disk rather than loaded into memory (due to a large dataset) then the access method will make a diffrence. A hash table might make no sense if the data cannot be contained completely within 'main' memory. It really depends on a number of factors and in the real world data cannot always be loaded as a whole. IBM developed the VSAM architecture which deals with this very issue, it is a b-tree that allows very fast access to a dataset of indeterminate size.
|
|
|
|
|
James Laing wrote: A hash table might make no sense if the data cannot be contained completely within 'main' memory.
A hash table does not have anything to do with memory, it is simply a method of associating a fixed size group of objects with a key. You can setup a large file with file pointer associated with the hash key. You can even use a double hash to associate multiple files and file pointers within with a key, or a split hash for the same. The problem with a hash table is it always represents access to a fixed size object (or group of objects), once the size and method is fixed it can be hashed. Access method is really irrelevant and simply up to the programmer. When you max out the hash table you have to completely rebuild it, that is when a hash table is a really, really innefficent.
_________________________
Asu no koto o ieba, tenjo de nezumi ga warau.
Talk about things of tomorrow and the mice in the ceiling laugh. (Japanese Proverb)
|
|
|
|
|
You can use hash tables on disk. If the hash table is not filled too much, you need only one seek operation (except for the few collisions where you might need two) to find a value, which is faster than any tree.
And if you're reading from disk, the "seek" is going to be the slow part.
|
|
|
|
|
Does any one has the idea of the exact calculation for superscript and subscript style of font. I mean the font is shrinked in MSWord. What calculation is used ? and also the baseline are moved as well. What are the standard calculations behind it ?
"C makes it easy to shoot yourself in the foot. C++ makes it
harder, but when you do, it blows away your whole leg."
- Bjarne Stroustrup
|
|
|
|
|
Font Creator web site [^] may provide you with the information you require. Also read some of these tutorials via Adobe [^]
modified 1-Aug-19 21:02pm.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
