|
I put that error code into Google and came up with this[^]; the first link looks like it may be of use - if you understand what they are saying.
Unrequited desire is character building. OriginalGriff
I'm sitting here giving you a standing ovation - Len Goodman
|
|
|
|
|
Thanks. I did the same thing! Great minds think alike. Microsoft has no workaround for this artificial "bug" they've caused. I've emailed Aurigma to see they have an updated DLL for .NET 4.
|
|
|
|
|
|
Hi,
I have a "asp:listview" bind to web service without database.
I don't use "ObjectDataSource" and in my contol "ListView" : I haven't atribut "DataKeyNames" and "DataSourceID"
I bind to it in code-behind 
protected void Page_Load(object sender, System.EventArgs e)
{
Act ActWEBService = WebServiceFactory.CreateInstance().CreateActWebService();
ActStruct[] myActs = ActWEBService.GetActs(nameIdItemDataBound);
mSeenFromPageState.Acts = new ActStruct[myActs.Length];
foreach(ActStruct act in myActs)
{
ListViewActs.DataSource = ActWEBService.GetActs(nameIdItemDataBound);
ListViewActs.DataBind();
}
protected void OurListView_ItemDataBound(object sender, ListViewItemEventArgs e)
{
if (e.Item.ItemType == ListViewItemType.DataItem)
{
System.Data.DataRowView rowView = e.Item.DataItem as System.Data.DataRowView;
ListViewDataItem dataItem = (ListViewDataItem)e.Item;
Act ActWEBService = WebServiceFactory.CreateInstance().CreateActWebService();
ActStruct[] myActs = ActWEBService.GetActs(nameIdItemDataBound);
So here is my list on screen :
nameIdItemDataBound....thatOneId............name
11BB...................................1..............................john
13AA...................................3..............................alice
15AAA..................................2..............................roxy
16TXQ..................................1..............................jean
But I want items that have [3] in their [thatOneId], does not appear in my list!
"if statement" does not use with Listview so I must put a filter...
like this : Where(a => a.name != value);
oreach(ActStruct act in myActs)
{
ListViewActs.DataSource = ActWEBService.GetActs(nameIdItemDataBound).Where(d => d.thatOneId != 3);
ListViewActs.DataBind();
}
I have a message error :
'ListView with id 'ListViewActs' must have a data source that either implements ICollection or can perform data source paging if AllowPaging is true.' (line Ligne : 82 )
Could you help me for this ? 
|
|
|
|
|
Hi all,
I seem to be having a problem with value validation of a list in a foreach loop and was wondering if you could please point out where the logic/syntactic error is?
Basically I am enumerating the Windows Application log for an eventid value then for a timewritten value. If the value is not found the code should run. If the value is found but is older than 1 hour then the code should run. If the value is found and is not 1 hour old then the code should not run. This is what I have but the code runs on my 2-minute timer anyway indicating that the value is not being found (I think)
public void OnTimedEvent(object source, ElapsedEventArgs e)
{
int run;
run = 0;
EventLog eLog = new EventLog("Application");
foreach (EventLogEntry entry in eLog.Entries)
{
if (entry.EventID == 13162)
{
List<int> evid = new List<int>();
evid.Add(entry.EventID);
foreach (int IDNo in evid)
{
if (entry.TimeWritten > DateTime.Now.AddHours(-1))
{
run = 1;
}
else run = 2;
}
}
}
if(run == 0 ||run == 1)
{
}
if (!EventLog.SourceExists("mylog")) EventLog.CreateEventSource("mylog", "Application");
EventLog.WriteEntry("mylog", "code has run", EventLogEntryType.Information, 13162);
}
This has been driving me nuts for nearly 3 days now and I just can't figure it out. I have tried evid.contains and evid.find methods but either the //do stuff won't run at all or it keeps running on the timedevent, i.e. every 2 minutes. Could you help please?
|
|
|
|
|
I would change this piece of code
foreach (EventLogEntry entry in eLog.Entries)
{
if (entry.EventID == 13162)
{
List<int> evid = new List<int>();
evid.Add(entry.EventID);
foreach (int IDNo in evid)
{
if (entry.TimeWritten > DateTime.Now.AddHours(-1))
{
run = 1;
}
else run = 2;
}
}
}
for
foreach (EventLogEntry entry in eLog.Entries)
{
if (entry.EventID == 13162)
{
if (entry.TimeWritten > DateTime.Now.AddHours(-1))
{
run = 1;
}
else run = 2;
}
}
}
Please let me know if it works.
|
|
|
|
|
Hi emardini,
Nope, still runs every 2 minutes. I am currently thinking that "13162" is not a valid eventid number. By calling the other numbers it seems that are not ints, they are bytes[] converted to ints for legibility.
Still investigating but will advise
|
|
|
|
|
I have a question about a C#. net 2008 desktop where I am working with .XSD files (datasets and dataadapters). I need to add a capability for a user to enter a 'alt-id' key as a search key to look up lots of information about a customer. To accomplish this goal a stored procedure with lots of 'left outer join statments' is called to obtain the information.
When the stored procedure is executed on its own, it runs in all cases. When the C#.net app executes in runs in all cases, except when there there is only data in the 'alt-key' column. Basically all the other tables that are associated in the join do not data the correspsonding data.
I am getting the error 'Failed to enable constraints. One or more rows contain values violating non-null,unique, or foreign-key constraints.'
The error occurs on the statment where I try to fill a dataset.
Thus to solve this problem, I am trying to decide what to do.
What you do think my options are:
1. Is there some setting I should change in the dataset so at least the 'alt-key' value is returning and all the other joined columns contain null as their value?
2. Should I do some kind of a preselect to see if any real data exists? if so how would you code that?
3. Do you have other suggestions? If so, can you tell me and/or point me to a reference where I can solve this problem?
|
|
|
|
|
I have a list of these models:
public class NodeModel : ViewModelBase
{
public Guid Id { get; set; }
public string Caption { get; set; }
public string Description { get; set; }
public bool IsActive { get; set; }
public int Sequence { get; set; }
public ImageSource Image { get; set; }
public bool IsExpanded { get; set; }
public string FileName { get; set; }
public NodeType Type { get; set; }
public List<NodeModel> Children { get; set; }
public NodeModel()
{
Children = new List<NodeModel>();
FileName = string.Empty;
}
}
The list is contained in a collection called Folders. I want to remove an object from the collection, so I'm using:
Folders.Remove(f => f.Id == model.Id);
But it's not removing it, What's wrong here?
Everything makes sense in someone's mind
|
|
|
|
|
I know I'm stating the bloody obvious, but have you placed a breakpoint on the Folders.Remove statement to make sure you have a proper model.Id? You can also convert the statement into a foreach temporarily so that you have more debugging visiblity. Once the problem is solved, I would certainly return the statement into the linq syntax, though.
I wasn't, now I am, then I won't be anymore.
|
|
|
|
|
Remove doesn't take a predicate as far as I know.
Either use .RemoveAll(f => f.Id == model.Id) or use Remove(specificInstanceOfNode)
All the best,
Dan
|
|
|
|
|
Ok, so now I have this:
NodeModel folder = (from f in Folders
where f.Id == model.Id
select f).FirstOrDefault();
Folders.Remove(folder);
The query is returning null. It's not finding the folder.
It appears that the query is only looking at the first level and not drilling down into the collection.
Everything makes sense in someone's mind
|
|
|
|
|
Yes. It sure doesn't. I completely missed the inner list.
So you want to remove from the ChildNode inner list or from the main/upper list or from both?
All the best,
Dan
|
|
|
|
|
I want to find i anywhere in the list and remove it.
Everything makes sense in someone's mind
|
|
|
|
|
Well this is more complicated then it looks. Cause you don't know upfront how
many nested levels you have.
As each node has a list of childnodes and then each node in the nested childNodes list could have an
even deeper nested level list of childNodes ...
The only thing that comes to mind wright now is a brute force step by step actions:
1)ForEach item in the upper level list check to see if it has the id and remove it if so.
2) Else loop through the inner collection if Count>0 and remove from there else loop through it's inner collection if Count>0
and so on.
Unless you do know that there are only 2 levels.
All the best,
Dan
|
|
|
|
|
There can be any levels. I could write a recursive method, but I think that will cause problems modifying the collection.
Everything makes sense in someone's mind
|
|
|
|
|
True, a faster approach would be to use a boolean filed like obsolete/deleted/visible.
Then instead of deleting/altering the collection you would just set the value to true(no list and/or memory reallocation).
When populating UI or whatever, based on the boolean field you'll show it or not.
All the best,
Dan
|
|
|
|
|
Only if you use foreach ... it's a list so you can use integer indices. Not thread-safe but self-modification-safe:
void Remove<T>(IList<T> list, T node) where T:INested<T> {
if(list == null) return;
for(int i = list.Count; i >= 0; i--){
if(list[i] == node) list.RemoveAt(i);
else Remove(list[i].ChildNodes, node);
}
}
where
interface INested<T> { IList<T> ChildNodes; }
If this is the only place you need something like this, you don't have to generic it, but it is a general algorithm so you might want to put it in a utility library and have your class implement that interface.
|
|
|
|
|
Definition of the INested<T> interface will not compile since ChildNodes is a field. So, for testing your code, I'll be starting with this:
interface INested<T>
{
IList<T> ChildNodes { get; set; }
}In your code, where you compare:
if (list[i] == node) list.RemoveAt(i); the compiler throws an error: " Operator '==' cannot be applied to operands of type 'T' and 'T' "
best, Bill
"For no man lives in the external truth among salts and acids, but in the warm, phantasmagoric chamber of his brain, with the painted windows and the storied wall." Robert Louis Stevenson
|
|
|
|
|
I'm going to be studying this code carefully today, since it appears to me a very valuable alternative to using foreach iteration, or using Linq to kind of create a copy of the recursive data structure from which you can modify the original structure without the "modification" error.
My guess is that this (once compile-time errors are fixed) would make a great Tip/Trick for that section of CP.
thanks, Bill
"For no man lives in the external truth among salts and acids, but in the warm, phantasmagoric chamber of his brain, with the painted windows and the storied wall." Robert Louis Stevenson
modified 9-Dec-11 15:49pm.
|
|
|
|
|
I've further elaborated the idea above, using an extension method:
public interface INode<T>
where T : INode<T>
{
Guid Id { get; set; }
List<T> Children { get; set; }
}
public static class NodeExtensions
{
public static void Remove<T>(this INode<T> node, Guid id)
where T : INode<T>
{
List<T> toRemove = new List<T>();
if (node.Children == null)
return;
foreach (var child in node.Children)
{
if (child.Id == id)
toRemove.Add(child);
else
child.Remove(id);
}
foreach (var child in toRemove)
node.Children.Remove(child);
}
}
|
|
|
|
|
If the search for the item to remove did not have to be recursive: this is simpler than the other example shown in the answers here:
Folders.Remove(Folders.Find(f => f.id == model.id)); To determine whether a recursive solution is actually required, I think we need to know:
1. is the collection of Models of fixed size, or read in at one time: if it is, then, imho, creating a flattened List<folder> is the way to go: then you can use model.id to get the instance of the Model in the flattened list, and use the simple form of Folders.Remove(modelInstance), and then remove the Model from the flattened list.
2. if the collection is nested only once (a two-level tree), a simpler solution is possible using Linq. See:[^].
3. if the solution is nested to depth > 2, or has arbitrary levels of nesting, a more complex solution in Linq is possible. I suggest you look up the various solutions on StackOverFlow that use Eric Lippert's explanation ... he cites Wes Dyer[^] ... of using Linq to create a flattened hierarchy via the use of a 'Stack' .NET data structure for greatly increased efficiency. See:[^].
4. if the collection of Models is being modified, new Models are being added, etc., frequently, then paying the "cost" of synchronizing (recreating ?) the flattened List may be prohibitive. In that case, well: you just gotta recurse.
The interesting challenge in writing the recursive code in this case is how to immediately, once a matching node has been found, to delete it, and skip iterating its children, given that you can't modify the collection on the fly: which, really, is another reason to consider the use of a "parallel" flattened list, imho. Or you could extend the more common example of using Linq to essentially "temporarily copy" a List, or Dictionary, structure, and then apply the collection modifying operation to the "original" tree ?
... edit 1 ...
Bob Janova posted an interesting way, on this thread, to use a for loop and its indexes to be able to delete from a nested List structure without violating the "no modify collection injunction" found using foreach:[^].
... end edit 1 ...
... edit 2 ...
also see Marc Gravell's recursive Flattening function:[^], which is in the form of an extension.
... end edit 2 ...
Of course, I would really like to see an answer here that used Linq in some way I am not aware of to accomplish this (the depth to which I am unaware of what is possible with Linq ever-deepeningly-unfathomable)
"For no man lives in the external truth among salts and acids, but in the warm, phantasmagoric chamber of his brain, with the painted windows and the storied wall." Robert Louis Stevenson
modified 10-Dec-11 12:34pm.
|
|
|
|
|
What do you think of declaring type isomorphisms for extending the functionality of an existing class where no prior interface contract exists?
To provide a barely contrived, concrete example, let's take an Excel Interop Worksheet and a business-customized Excel export process. The existing ExcelWorksheet structurally subtypes the COM proxy and has a unified way of exporting given data of an arbitrarily defined range into a blank Worksheet. Let's say that I don't need any of the existing functionality to change, but wish to subvert the preparation of the underlying worksheet object to be replaced with a worksheet prepared outside the wrapper....and let's say that what I really want to have is a development environment where the structurally subtyped Interop proxy contained within the custom ExcelWorksheet is not treated as a property, but merely a component of the custom "ExcelWorksheet" composition...with a quick way to switch contexts from "Interop Proxy" to "Custom Wrapper around Interop proxy" with an isomorphic cast.
"I need build Skynet. Plz send code"
|
|
|
|
|
I tend to think that they're just as good an idea as any.
If you don't need to subtype the existing class, you don't need to change the way it performs its existing behavior, there's no composition model in place but need to be able to optionally rearrange the way the custom object wraps around a structurally subtyped object, I say "sure."
"I need build Skynet. Plz send code"
|
|
|
|
|
Hi every body,,
I write an app on android and i want send a string with sms to my server, because my length of string is bigger than one sms, i have to compress sms and send to my server, in my server i have a app that wrote with .net, and my problem in here!!!
I can`t find a solution for compress data in Android(Java) and decompress in C#....
Please Help...... 
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
