Priority

Task

C# task management that runs processes in order of execution

22 Jun 2013 by Rinion

I am trying to figure out the best approach in C# to allow a website that I have created to start up various programs on the server remotely, but not at the same time. I figured through .NET I could create a program that could react to various button clicks on the website, then populate a list...

management

Task

Priorities for ToDolist

17 Oct 2013 by Nelek

If you refer to the ToDo List of an article here in CP, the best I can tell you is to ask in the message board at the bottom of the article. If you do so, the author will receive a notification and he is the best one to answer about customization of the application.

Adding elements in correct order to Priority Que (ADT)

12 Mar 2014 by Member 10664585

I am implementing Priority QUE as a doubly linked list. My structs:typedef int kintyr;typedef struct qElem { struct qElem *prv; kintyr *dat; int *priority;}qElem;typedef struct que { qElem *fr,*bk; int cnt; ...

abstract

ListView

What is the problem?

17 May 2014 by Rig Trag

private void highToolStripMenuItem_Click(object sender, EventArgs e) { foreach (Process process in processeslist) { try { if (process.ProcessName == listview.SelectedItems[0].Text) { ...

What is the problem?

17 May 2014 by ZurdoDev

Your else does not match up with an if. Your if is inside the try catch and the else is outside. Just move the else inside the try statement.

28 Jun 2023 by Quinten Bakker (QB)

I am trying to use priority queue with custom classen. My class is node(name, .., .., distance, ...) but when in try to push a node into the queue i get a error. node a = node("a",{}, 0, &a); node b = node("b",{}, INT_MAX, &a); node c =...

28 Jun 2023 by Richard MacCutchan

std::vector test = {&a, &b, &c, &d}; // test contains node pointers node* shortestNode; std::priority_queue q; // priority_queue is declared to contain nodes rather than pointers to for(auto i : test)( q.push(i)...

28 Jun 2023 by Rick York

Another option is to implement a comparison method in your class specifically for the purpose of sorting. It has to be static since sort does not pass this pointer to it. You could also make a sort method that could also be static but...

TaskQueue. How is this bad?

5 Feb 2013 by db7uk

Hi,I like what you have done however personally I feel the mix of custom thread management plus mangeing TPL tasks etc very problematic in this instance. TPL has many great features that do not require all the custom management.Whilst I have not tried executing tasks in order of thread...

Adding elements in correct order to Priority Que (ADT)

12 Mar 2014 by nv3

You have defined the priority member as a pointer to int. You probably meant to define it just as an int. For that reason the comparison in if (q->fr == NULL || q->fr->priority>prrt ) fails. You are comparing the pointers (addresses) instead of the values. Either make priority an...

abstract

ListView

28 Jun 2023 by k5054

Similar to your previous question, a priority_queue needs to know how to determine which object has the higher priority. You could add a custom comparator to the definition of the priority_queue, or you could add an operator

Robust C++: P and V Considered Harmful

14 Jun 2022 by Greg Utas

Cleaving the Gordian knot of thread safety

TaskQueue. How is this bad?

5 Feb 2013 by essence

I've reviewed the QueuedTaskScheduler and I'm very confused.http://blogs.msdn.com/b/pfxteam/archive/2010/04/09/9990424.aspx[^]So I wrote this class to do what I wanted.What I wanted is a class that will queue up tasks in the background and start them in order with a lower priority. Also...

Priorities for ToDolist

17 Oct 2013 by Member 10342496

Is there any way to change the priorities so that 1 is the highest and 10 is the lowest?Jeff A Weaver

Insert and removemin operations for priority queues and heap

23 Jun 2021 by Brewer Jeffrey

just starting out with data structures and algorithms and I need a little need help verifying if my answer is correct. **Question**: Assume a priority queue implemented as a sorted list of entries using heap. Draw the heap after each of the...