|
First, it's not a linked list, circular or otherwise.
That would be a much different structure, with much different methods.
It's a circular buffer exposed as a IList<T>
Given your seeming confusion about that it might prompt me to rename though i'm not sure to what.
Because it's a circular buffer IList<T>, and ICollection<T> serve me fine. Sure you *can* call Insert(1, item) or RemoveAt(2) and that's not efficient, but it's no less efficient than doing it on a straight List<T> so I'm fine with it.
Real programmers use butterflies
|
|
|
|
|
In this case, all that I would recommend is to write a specialization of the generic Queue<t> collection if it's good for your task, otherwise implement your own.
Specifically, first invoke, for example:
Queue<string> numbers = new Queue<string>();
numbers.Enqueue("one");
numbers.Enqueue("two");
numbers.Enqueue("three");
numbers.Enqueue("four");
numbers.Enqueue("five");
And then, implement some kind of push_front, push_back and pop_front, pop_back, as well as buffer shifting functionality to have an ability to perform circular ops. 
|
|
|
|
|
I've already done that. I'm just trying to figure out what to name them.
Right now everything, including the efficient push_back/push_front/etc are done through the IList<t> interface.
Literally all i need to do at this point is just create names for the methods with the efficient ops. the ops are already implemented and exposed through IList<t> standard Insert/Add/Remove/RemoveAt
i think after this thread I'm going with
PushFront/PushBack/PopFront/PopBack
Real programmers use butterflies
|
|
|
|
|
If you use Queue<t> as the base class, then the derived class name should be something kind of CircularQueue<t> and ICircularQueue<t> if it's an interface. Otherwise, try out a different name.
|
|
|
|
|
I'm not deriving from anything. It's backed by an array, just like List<t> is
Real programmers use butterflies
|
|
|
|
|
As I've already explained, the suggestions for the class naming are:
CircularQueue<t> and CircularBuffer<t>
|
|
|
|
|
Also, since you've implemented the functionality required as a C#.NET class library used in your project, then you can name the class and interface such as MyProjCircularBuffer<t> and IMyProjCircularBuffer<t>.
|
|
|
|
|
You ask a lot of programming questions in the Lounge, and to be honest, in my opinion, they should be in the forums where others can benefit from them. The majority of members who use this site are not active participants in the Lounge.
Also, the Lounge is not for programming questions.
I know I came off as a jerk here, but it had to be said.
It's much easier to enjoy the favor of both friend and foe, and not give a damn who's who. -- Lon Milo DuQuette
|
|
|
|
|
You beat me to it. In fact, I'm going to add my own.
|
|
|
|
|
honey the codewitch wrote: I can go the .NET route that MS took and add methods like Enqueue() and Dequeue() (queue-like) but that only covers adding to the back, and removing from the front. I can add Pop() and Push() (stack-like) but that only covers adding and removing from the back.
I would have thought that Push and Pop would add and remove from the front, even if internally it's the back of your data structure.
I have one-way and two-way queues in which the elements themselves provide a queue link member (a pointer). The methods are Enq (at the back), Henq (at the front), and Deq (from the front). Also Insert (after something else) and Exq (from somewhere other than the front). There's no special method to remove from the back. If I were to add one, I would probably go with PopBack and rename Enq, Henq, and Deq to PushBack, Push, and Pop.
|
|
|
|
|
honey the codewitch wrote: What would you do?
I'd start by asking in the appropriate forum. You've been hear long enough to know that the Lounge is NOT for programming questions.
|
|
|
|
|
I agree with phil.o about this, and you think it's inappropriate, report it.
I've had these types of questions reported before but in the end they pass, because they aren't programming questions.
I'm asking an opinion about naming and style.
You may think it crosses the line. In the past mods haven't. If you don't like that, you can always apply to work at CP. I'm sure it's a fun job.
Real programmers use butterflies
|
|
|
|
|
You do realise I'm one of the mods don't you?
It's also very disingenuous of you to imply that everything is fine with this type of question but Chris has had words with you before.
|
|
|
|
|
What's the right forum for this kind of thing?
|
|
|
|
|
We have both a C# forum and QA which would be more appropriate. The lounge has clear guidelines right at the top.
|
|
|
|
|
Design and Architecture for one.
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
|
|
|
|
|
honey the codewitch wrote: because they aren't programming questions.
Well you're on the line on this one...
|
|
|
|
|
I live life on the line. 
Real programmers use butterflies
|
|
|
|
|
honey the codewitch wrote: and you think it's inappropriate, report it.
BTW, I strongly disagree on this.
One should always talk first!
|
|
|
|
|
Oh well then:
- Feed() - growing/making the circle bigger
- Poop() - item is done with, dumping the by/used up product.
But seriously just use the names that fit the picture in your mind.
Need some inspiration? - there are many thesauri on the net. insert[^]
after many otherwise intelligent sounding suggestions that achieved nothing the nice folks at Technet said the only solution was to low level format my hard disk then reinstall my signature. Sadly, this still didn't fix the issue!
|
|
|
|
|
honey the codewitch wrote: What would you do?
I'd certainly give the Lounge a break from all these posts about parsers and lexers.
|
|
|
|
|
well you're in luck, as this post has nothing to do with parsers or lexers
Real programmers use butterflies
|
|
|
|
|
I like Jorgen Andersson's earlier response. I did not see you reply on it, so I am reposting it here:
For the Circular part I would follow Microsofts convention on their LinkedList.
So AddBefore(), AddAfter(), AddFirst(), AddLast(), Remove(), RemoveFirst(), and RemoveLast().
|
|
|
|
|
Late date ends with reflection around split (8)
If this somehow doesn't get solved by 12, I have a second clue that resolves to the same answer that I will post.
|
|
|
|
|
Departed?
It goes without saying
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
