dnd 5e – Can you move the Hunter's Mark spell the same time the affected creature dies?

The Hunter brand The description of the spell is:

You select a creature that you can see within range, and mystically mark it as your quarry. Until the end of the spell, if you hit it with a weapon attack, you will inflict additional damage to the target 1W6, and you will benefit from any verification of wisdom (perception) or wisdom (survival) you make to find it , If the target drops to 0 hit points before the end of this spell, you can use a bonus action on a later turn to mark a new creature.

Specifically, the quoted sentence "a subsequent round of yours" means "a subsequent round after the one you initially cast the spell on". If the creature you have tagged dies, you can target a new creature each turn, as long as you concentrate on casting the spell.

The reason why "in a next round of yours" is to make it clear that you can not cast the spell to kill a creature with your weapon attack as an action and then move it to a new target in the same turn.

However, this is pretty much superfluous as you will only have one bonus action per turn anyway. Once you cast the spell, you will no longer have a bonus action that will allow you to move it to a new target until you still get another round. I suppose the designers just wanted to make it clear that the bonus action you use to cast the spell can not be the same as moving the mark to a new creature.

Time Tracking – Can a Walmart store track a (stolen) gift card if it was used online?

Enter image description here

Walmart does not help me, even if I called to ask. All I had to do was know if my shop in town could keep track of my gift card if it was used online (unfortunately I do not have a receipt or card number). I understand that they can track purchases in the store, but what if the person who stole it used it online?

How many compute buffers affect the performance unit at the same time

How are many ComputeBuffer Instances affect performance?

I know that I should call ComputeBuffer.Release() on each ComputeBuffer I create, but will it affect the performance if I had much open ComputeBuffers at once? and with "many" I mean hundreds to thousands.

It goes without saying that all these ComputeBuffers will be published sometime, possibly at the same time.

python – I need to reduce the execution time of my code to check the data of 2 Apis

I'm new to Python. I've been given the task of checking the data from 2 APIs that provide similar data, but have a different format; H. Json and XML. I wrote the code, but the execution takes too long. I am not familiar with formatting and so on. Please help me here. (For security reasons, I exclude URLs and headers, etc.)

from openpyxl import load_workbook
from xml.etree import ElementTree
import json
import urllib.request
import requests

wb = load_workbook("CNIC.xlsx")
source = wb("Sheet1")
for cniclist in source('A'):
    cnic = cniclist.value
    url = "/%s" % cnic
    urlobj = urllib.request.urlopen(url)
        string = urlobj.read().decode('utf-8')
        json_obj = json.loads(string)
    url2 = "url2"
    payload = "{}
    headers = {}
    response = requests.request("POST", url2, data=payload.format(cnic), headers=headers)
    tree = ElementTree.ElementTree(ElementTree.fromstring(response.text))

    json_message = (json_obj.get('Message'))
    if json_message == "Success":

        json_record = (json_obj.get('Records'))
        if json_record == 1:
            for item in json_obj.get('OutData'):
                json_acc = item.get('Accounts')('NoAccounts')
                print("No Of Accounts in Json Service is ", json_acc)

        elif json_record > 1:
            json_acc = 0
            for item in json_obj.get('OutData'):
                json_acc = item.get('Accounts')('NoAccounts')
                print("No Of Accounts in Json Service is ", json_acc)
            print("No JSON Records found")
        root = tree.getroot()
        count = 0
        xml_acc_no = ()
        for FCDB_BODY in root.findall("./FCDB_BODY/CUSTACCOUNT/ACCOUNT/ACCNO"):
            temp = FCDB_BODY.text
            count += 1
        print("No Of Accounts in XML Service is ", str(count))

        # Checking Number of Accounts in both services
        if str(json_acc) == str(count):
            print("Number of Accounts are same in both services")
        elif str(json_acc) > str(count):
            print("Json Service has more accounts  ")
            print("XML Service has more accounts ")

        # Getting all data from Json Service
        for item1 in json_obj.get('OutData'):
            json_file_account = item1.get('Accounts')(
                'AccountList')  # Getting Accountlist details from jason service file

            json_accounts_list = ()
            for i in json_file_account:
                json_acc_no = i('ACC#')  # Getting Account Number from Json service file

            json_title_list = ()
            for i in json_file_account:
                json_acc_title = i('TITLE')  # Getting Account title from Json service file

            json_type_list = ()
            for i in json_file_account:
                json_account_type = i('STYPE')  # Getting Account type from Json service file

            json_desc_list = ()
            for i in json_file_account:
                json_account_desc = i('STPDESC')  # Getting Account description from Json service file
                if json_account_desc is not "":
            json_bal_list = ()
            for i in json_file_account:
                json_account_bal1 = i('ABAL')  # Getting Account balance from Json service file
                json_account_bal = int(json_account_bal1) / 100
                json_account_bal = ('%f' % json_account_bal).rstrip('0').rstrip('.')

        # Getting all data from Json Service
        xml_title_list = ()
        for j in root.findall("./FCDB_BODY/CUSTACCOUNT/ACCOUNT/ACCOUNTTITLE"):
            xml_acc_title = j.text

        xml_type_list = ()
            xml_acc_type = k.text

        xml_desc_list = ()
        for l in root.findall("./FCDB_BODY/CUSTACCOUNT/ACCOUNT/ACCPRDDESC"):
            xml_acc_desc = l.text

        xml_bal_list = ()
        for m in root.findall("./FCDB_BODY/CUSTACCOUNT/ACCOUNT/BAL_AVAIL"):
            xml_acc_bal = float(m.text)
            xml_acc_bal = ('%f' % xml_acc_bal).rstrip('0').rstrip('.')

        # Checks for Account Number,Title, Type, Description and Balance
        acc_check = ((x for x in xml_acc_no if x not in json_accounts_list),
                     (x for x in json_accounts_list if x not in xml_acc_no))
        if len(acc_check(0)) or len(acc_check(1)):
            if len(acc_check(0)):
                print("Accounts which are unmatched in XML are ", acc_check(0))

            if len(acc_check(1)):
                print("Accounts which are unmatched in JSON are ", acc_check(1))
            print("No Unmatched Accounts found")

        title_check = ((y for y in xml_title_list if y not in json_title_list),
                       (y for y in json_title_list if y not in xml_title_list))
        if len(title_check(0)) or len(title_check(1)):
            if len(title_check(0)):
                print("Title which are unmatched in XML are ", title_check(0))

            if len(title_check(1)):
                print("Title which are unmatched in JSON are ", title_check(1))
            print("No Unmatched Title found")

        type_check = ((z for z in xml_type_list if z not in json_type_list),
                      (z for z in json_type_list if z not in xml_type_list))
        if len(type_check(0)) or len(type_check(1)):
            if len(type_check(0)):
                print("Type which are unmatched in XML are ", type_check(0))

            if len(type_check(1)):
                print("Type which are unmatched in JSON are ", type_check(1))
            print("No Unmatched type found")

        desc_check = ((q for q in xml_desc_list if q not in json_desc_list),
                      (q for q in json_desc_list if q not in xml_desc_list))
        if len(desc_check(0)) or len(title_check(1)):
            if len(desc_check(0)):
                print("Description which are unmatched in XML are ", desc_check(0))

            if len(desc_check(1)):
                print("Description which are unmatched in JSON are ", desc_check(1))
            print("No Unmatched Description found")
        balance_check = ((w for w in xml_bal_list if w not in json_bal_list),
                         (w for w in json_bal_list if w not in xml_bal_list))
        if len(balance_check(0)) or len(balance_check(1)):
            if len(balance_check(0)):
                print("Balance which are unmatched in XML are ", balance_check(0))

            if len(balance_check(1)):
                print("Balance which are unmatched in JSON are ", balance_check(1))
            print("No Unmatched Balance found")


        print("CNIC NOT FOUND in Json Service ")

Javascript – simulate time, date and alarm, selected by the user

Very good night, I am working on this form, with which I simulate the change of time, date and alarm, because with Javascript time and date can not be changed, therefore I try to do it this way, what The user chooses the time , the alarm and the date, which are stored in a variable and printed out.
I think you can simplify the code even more, I just do not have that much experience.
I could not adjust the alarm to the chosen time. Could you help me to correct the mistakes I have in the code I left here?


Algorithm Analysis – Time Complexity for finding nearest neighbors in kd trees

Next neighbor searches in kd trees are performed in logarithmic time, as described by Friedman et al. However, I have some difficulty fully understanding the proof.

To calculate the average number of buckets used by the
The search algorithm for the k-d tree described above must calculate the average number of buckets overlapped by the region $ S_m (X_q) $,

$ S_m (X_q) $ is the smallest ball centered at $ X_q $ that exactly contains the $ m $ Points closest to $ X_q $,

I do not understand why only the regions overlap $ S_m (X_q) $ to be examined. Consider the following example in which to calculate the black point closest to the orange point $ X_q $, $ S_m (X_q) $ In this case, if the green circle is the algorithm, the algorithm should only search both lower buckets.

Enter image description here

The search algorithm, however, finds the first candidate solution to be the black dot in the lower right-hand area. Then also regions are searched, which cut the blue circle, in particular the upper right region.

Is not it too limited to just calculate the blades that cut the green circle?

SQL Server – SSIS Package Deployment. Changing the protection level takes a long time

We are currently migrating our servers to a new data center. Currently, SQL Server 2014 and SSIS packages are deploying in seconds.

The new data center has several SQL Server 2016 installations and I've found that "changing the protection level" takes a long time for some (about 7 minutes!), But for some it's fast. If I change the SSIS project TargetServer version to 2016, changing the protection level on all new servers is slow.

The protection level of the project and the packages has been (and is) set to DontSaveSensitive.

What is the cause of the slowness and how can I fix it? It is finally provided without error.