D&D 5e – Is command spell linked to conditions?

Let’s say the cleric of the party used command spell and told the enemy to “Halt”.Is the enemy affected by the condition “Paralyzed”? Does it mean the next attack against the creature is going to be an automatic critical strike?

Or let’s suppose the cleric says “Grovel” to the enemy creature. Is the enemy affected by the condition prone?

Thank you!

How can a PC determine what planes a Cubic Gate is linked to?

The Cubic Gate (DMG, p. 160) says:

The six sides of the cube are each keyed to a different plane of existence, one of which is the Material Plane. The other sides are linked to planes determined by the DM.

I’m the DM in this situation, and I’ve decided which planes the cube is linked to. However, since the item does not require attunement, is there any way for the PC who now has the cube to determine those planes other than by experimentation?

(If the item did require attunement, I’d assume that attuning to it would let you know, since attuning to items allows you to understand its properties, but that’s not the case here as it doesn’t require attunement.)

Multiple PowerApps Linked to Single SharePoint List?

Our organization created a SharePoint list that stores case review data. There are two separate teams that need the ability to manually enter data into the list fields. I have been using a PowerApps customized list form for data entry. However, I have not found a way to change the visible fields in the form based on which group is viewing the list or which SharePoint list view they select. I would like for each group to see different fields that are relevant to their particular portion of the case review. Would a standalone app work better for this situation? Is it possible to have two different standalone app views that link back and allow manual entry to the same SharePoint list?

Parallel deletion and traversal in a lock free linked list

I’m unsure about the safety of deletion in a linked list. I’ve seen the issue posed by a parallel insertion and deletion (resulting in the loss of the insertion) and proposed solutions to that problem. That makes perfect sense. However, nowhere have I seen it mentioned that an unlucky traversal in parallel with a deletion can cause problems. For example, if we have the linked list:

A -----> B -----> C* ------> D 

and one process (process 1) is traversing it, currently pointing at C (as indicated by the *), however before process 1 reads the next pointer of C, another process (process 2) deletes C and frees its memory. Then, when the process 1 attempts to read C’s next pointer, it will be reading uninitialized memory (which could be used to store an int for example), and thus could be pointed to an invalid location, and cause a segmentation fault by dereferencing that pointer.

How can this issue be avoided?

Linked SharePoint List not producing correct data in REST query?

I am trying to use the Office 365 SharePoint REST API to pull data stored in a list on SharePoint.

There are 2 columns in the list that lookup to another list.

I am trying to query the list using:

.../site/_api/web/lists/getbytitle('Sample Lists')/items?$  select=Email/Title&$  expand=Email 

The Email column in the list stores a lookup to a user table that then stores the Email. However, when I run the expand in this manner, I am not given a list of the Emails and am instead given a list of names (the other lookup value in the original list).

Could someone explain time complexity of solution in this tutorial (linked in body)?

Could someone explain time complexity of solution of in this tutorial?

I’m having hard time figuring out, how asymptotic bounds for first solution is $ O(3^k . k)$ .

What I figured so far is, for computing $ f(Y)$ , we would require $ O(\lvert Y\rvert)$ steps and for fixed set $ X$ (such that $ \lvert X\rvert=k$ ), we would have $ 2^{n-k}$ number of $ Y$ sets that would contain set $ X$ . And there would be $ {n \choose k}$ such $ X$ sets.

So total steps should be $ $ {n \choose k } * {\sum_{r=0}^{n-k} {n-k \choose r} * ({k+r})} \leq {n \choose k} * n * 2^{n-k}$ $

But is this value tightly bounded by $ 3^k * k$ ?

Thanks in advance.

Unhadled exception in c++ program for doubly linked list

I wrote a program for doubly linked list in visual studio 2013, and it threw unhandled exception error at the line marked with comment: –

#pragma once #include<iostream>  template <typename T> struct Node {     T data;     Node *next, *prev; };  template <typename T> class doubleLinkedList { private:     Node<T> *top; public:     doubleLinkedList()     {         top = nullptr;     }      void add(T data)     {         Node<T> *temp = new Node<T>;          temp->prev = nullptr;         temp->next = top;         top->prev = temp;     //unhandled exception here         top = temp;     }      void display()     {         Node<T> *temp;         temp = top;         std::cout<<"nullptr<--->\n";         while(temp)         {             std::cout<<temp->data<<"<--->";             temp = temp->next;         }         std::cout<<"nullptr\n";     } }; 

The error is: –

Unhandled exception at 0x011C4B79 in dataStructures2.exe: 0xC0000005: Access violation writing location 0x00000008. 

I have never written a doubly linked list before. I am not sure if there any logical error in the program. Any kind of help would be appreciated.