|
I have a desktop application in VC++. besides regular software protection such as serial number etc., can manifest file be used to protect my application? such as adding checksum of files, versions of DLLs, etc...
any experience to share?
not sure if this is a good place to ask such a question...
diligent hands rule....
|
|
|
|
|
Southmountain wrote: ...protect my application?
What exactly are you trying to achieve?
"One man's wage rise is another man's price increase." - Harold Wilson
"Fireproof doesn't mean the fire will never come. It means when the fire comes that you will be able to withstand it." - Michael Simmons
"You can easily judge the character of a man by how he treats those who can do nothing for him." - James D. Miles
|
|
|
|
|
good question. preventing users from tampering my files?
diligent hands rule....
|
|
|
|
|
Given that a manifest file is intended to be static in nature and only read (and nothing, once created on disk, should ever need to write to it), and doesn't contain a signature that would render it invalid if modified, I'd have to think you can add your own elements to it.
Whether it's a good idea to "extend" it in this fashion or not...that's another question altogether.
|
|
|
|
|
your insight helps me 
diligent hands rule....
|
|
|
|
|
Well ... personal experience:
How to set ANY field in system catalog using code?[^]
Leads me to believe (it's been 6 years since I've been back here) that my pasty-white liver has won the relay.
Translation of the above:
1. CP points system will make a chicken out of you.
2. Attempting to reinvent the wheel is futile.
3. The wheel in this case is ... hire a painter to be your lawyer ... and see.
|
|
|
|
|
Does a stairlift work because of nana-technology?
"I have no idea what I did, but I'm taking full credit for it." - ThisOldTony
"Common sense is so rare these days, it should be classified as a super power" - Random T-shirt
AntiTwitter: @DalekDave is now a follower!
|
|
|
|
|
I don't want to step out of line, here, but where can we go with this uplifting post?
| Ravings en masse^ |
|---|
| "The difference between genius and stupidity is that genius has its limits." - Albert Einstein | | "If you are searching for perfection in others, then you seek disappointment. If you seek perfection in yourself, then you will find failure." - Balboos HaGadol Mar 2010 |
|
|
|
|
|
My grandchi8ldren didn't see any cows hiding up in the trees, because the cows are so good at hiding.
CQ de W5ALT
Walt Fair, Jr.PhD P. E.
Comport Computing
Specializing in Technical Engineering Software
|
|
|
|
|
Isn't nana-technology what keeps grandfather's clock ticking?
Freedom is the freedom to say that two plus two make four. If that is granted, all else follows.
-- 6079 Smith W.
|
|
|
|
|
A programming "requirements" problem, not a personal problem.
So, given a string, I want to verify that any instance of "foo" in the string is not a specific instance of "foobar."
For example, give me back the count of only instances of the word "delete" that are not be part of the phrase "deleted = 0"
So this is the best way I can word that requirement generally:
I want a count of the instances of the substring x where the string starting at the index of the substring x does not also start with y, where y is x + some other string z.
Any better ways of wording that?
As for implementation, this is the best I can come up with:
public static class StringExtensionMethods
{
public static List<int> IndicesOf(this string src, string substring)
{
List<int> indices = new List<int>();
int idx = 0;
while ((idx = src.IndexOf(substring, idx)) != -1)
{
indices.Add(idx);
++idx;
}
return indices;
}
}
Example usage:
int count = s.IndicesOf(x).Count(idx => !s.Substring(idx).StartsWith(y));
Just so you don't think this is a programming question. 
|
|
|
|
|
OK - and this isn't a programming answer.
Do it backwards:
find out how many instances there are of the undesired substring.
find out how many instances there are of the base sting in all forms.
Do that math. Or I missed something in this.
| Ravings en masse^ |
|---|
| "The difference between genius and stupidity is that genius has its limits." - Albert Einstein | | "If you are searching for perfection in others, then you seek disappointment. If you seek perfection in yourself, then you will find failure." - Balboos HaGadol Mar 2010 |
|
|
|
|
|
W∴ Balboos, GHB wrote: Do it backwards:
Interesting - a good solution, however, what I was really curious about is, how would you state the requirement, regardless of the optimization of the algorithm?
W∴ Balboos, GHB wrote: find out how many instances there are of the base sting in all forms.
Hah. That's actually much more elegant than my "IndicesOf" implementation!
|
|
|
|
|
Marc Clifton wrote: So, given a string, I want to verify that any instance of "foo" in the string is not a specific instance of "foobar."
You already did it!
|
|
|
|
|
Regular Expressions. Done.
|
|
|
|
|
I have only used regex in the past for tasks like this. Unlike most people, I am not scared of regex. Not sure if that is something you would be willing to tackle, but it would do exactly what you appear to want to do.
|
|
|
|
|
Have you considered splitting the string, using x+z as the delimiter? Then on each chunk you get back you can search for occurrences of x
Real programmers use butterflies
|
|
|
|
|
I think, given that the respondents so far seem to have clearly understood what you want, that you don't really have a problem; just specify it as you did in your opening sentence.
And yes, use Regex. (You could argue that the neatest functional definition of your requirement is simply the regex expression...) Who says the functional spec has to be written in English? RegEx is more widely understood around the world, and less ambiguous, after all...
|
|
|
|
|
DerekT-P wrote: given that the respondents so far seem to have clearly understood what you want
Actually no, they didn't. What I wanted was a "requirements statement", not a solution. 
As in, is there a simpler way of saying what I said in my post?
|
|
|
|
|
We're all problem solvers, not linguists.
|
|
|
|
|
Exactly - they understood what you wanted to say. If it ain't broke, don't fix it - so go with the description you gave us. (Or, as I suggested, use a more precise language than English, such as RegEx).
|
|
|
|
|
"I want a count of the instances of the substring x, excluding the instances of substring x that is immediately followed by substring z"
|
|
|
|
|
Find all the instances of the string "X" that are not contained in the string "XY"?
Find all the instances of a string that can't be found in a concrete bigger string?
Find all the instances of a string "X" excluding the matches used in the string "XY"?
Find all the instances of a string "X" ignoring it if included in the string "XY"?
M.D.V. 
If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about?
Help me to understand what I'm saying, and I'll explain it better to you
Rating helpful answers is nice, but saying thanks can be even nicer.
modified 26-Jan-21 16:54pm.
|
|
|
|
|
Split source string on spaces and punctuation; then scan for target string in the resultant array; counting the number of occurrences.
It was only in wine that he laid down no limit for himself, but he did not allow himself to be confused by it.
― Confucian Analects: Rules of Confucius about his food
|
|
|
|
|
In light of "smartphones", Fauxbook, Twitfart, &etc., I suggest that Marshall McLuhan preposition be given a proper FIFY: "The medium is the message"
And I am aware of the irony of using FIFY in this post
| Ravings en masse^ |
|---|
| "The difference between genius and stupidity is that genius has its limits." - Albert Einstein | | "If you are searching for perfection in others, then you seek disappointment. If you seek perfection in yourself, then you will find failure." - Balboos HaGadol Mar 2010 |
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
