15,889,463 members
Sign in
Sign in
Email
Password
Forgot your password?
Sign in with
home
articles
Browse Topics
>
Latest Articles
Top Articles
Posting/Update Guidelines
Article Help Forum
Submit an article or tip
Import GitHub Project
Import your Blog
quick answers
Q&A
Ask a Question
View Unanswered Questions
View All Questions
View C# questions
View C++ questions
View Javascript questions
View Visual Basic questions
View Python questions
discussions
forums
CodeProject.AI Server
All Message Boards...
Application Lifecycle
>
Running a Business
Sales / Marketing
Collaboration / Beta Testing
Work Issues
Design and Architecture
Artificial Intelligence
ASP.NET
JavaScript
Internet of Things
C / C++ / MFC
>
ATL / WTL / STL
Managed C++/CLI
C#
Free Tools
Objective-C and Swift
Database
Hardware & Devices
>
System Admin
Hosting and Servers
Java
Linux Programming
Python
.NET (Core and Framework)
Android
iOS
Mobile
WPF
Visual Basic
Web Development
Site Bugs / Suggestions
Spam and Abuse Watch
features
features
Competitions
News
The Insider Newsletter
The Daily Build Newsletter
Newsletter archive
Surveys
CodeProject Stuff
community
lounge
Who's Who
Most Valuable Professionals
The Lounge
The CodeProject Blog
Where I Am: Member Photos
The Insider News
The Weird & The Wonderful
help
?
What is 'CodeProject'?
General FAQ
Ask a Question
Bugs and Suggestions
Article Help Forum
About Us
Search within:
Articles
Quick Answers
Messages
Comments by JRickey (Top 8 by date)
JRickey
28-Oct-11 13:10pm
View
Have you tried substitutes for the space (such as %20, etc.)? Another possibility is something akin to
white-space handling
.
JRickey
28-Oct-11 2:00am
View
I came across one allusion to using (System.String()) instead of (Of System.String) as a way to circumvent the no-space restriction.
JRickey
26-Oct-11 12:52pm
View
Thanks, Mehdi. Your suggestion led me to an MSDN article on ExcelWebServices that should help. I'm definitely getting into topics I haven't worked with before.
I'll look at converting the VB6 project since the first step of that is easy. Even if that goes rather smoothly I may rewrite/redesign/refactor the code to allow better testing and to better integrate patches and enhancements done over the years.
JRickey
26-Oct-11 12:04pm
View
Even if you could convince me this is not a homework project (very unlikely), you will learn much from developing the code yourself. You may make mistakes in that code, in which case you post a question with the appropriate piece of code, describe the error you see and ask for help (and tag the question as homework). Besides, on the .Net platform my experience is in C#, not VB. I've broken the problem down into two parts that you can easily learn about on the web (
collections
, including how to remove one item from a collection; and
recursive function
done on the collection).
Make a strong effort on your side and I'll provide an additional hint for making the recursion more efficient.
JRickey
25-Oct-11 18:47pm
View
Are you able to use regedit to change it? My Win7 Pro 64-bit has the key shown in the article.
If you want to change via code look at http://www.switchonthecode.com/tutorials/csharp-snippet-tutorial-editing-the-windows-registry and http://msdn.microsoft.com/en-us/library/windows/desktop/ms724878%28v=vs.85%29.aspx (sorry, I don't see how to make those as links). I'm not sure what access level you will need to change that key value.
JRickey
25-Oct-11 18:29pm
View
An errant mouse click as I paused over the rating for this solution resulted in a 3 star vote. Is there a I way I can remove (or change) that? It's not the first time it's happened to me. (Fortunately, my votes don't carry much weight.)
JRickey
25-Oct-11 15:14pm
View
With your question having the appearance of being homework I'm not going to provide code; the above is an informal algorithm that you can formalize. One other hint: after my earlier answer I thought about generalizing the problem to n items. This is a good candidate for recursion. For n=1 return 1 if that item meets the limitations, 0 if it does not. Otherwise, test whether the full set (all n items) meets the conditions, if so, return n; if not, perform recursion on the n sets of (n-1) items.
JRickey
25-Oct-11 1:41am
View
The links don't work for me ("Sorry, that page was not found"). Can you give more detail?
Show More