dnd 5e – What is an axe beak’s travel speed in Icewind Dale?

Icewind Dale: Rime of the Frostmaiden gives travel speeds for dogsleds, snowshoes, and on foot (p. 11). On the same page, it says that dogsleds, at 1mph, are the fastest way to get around in the Dale.

However, this section says nothing about axe beaks, which p. 20 offers as a travel option. How fast would these travel?

My gut says if they are speedier than sled dogs (50 vs 40 feet per round, per MM), they might run 1.25 mph. Is this the best/proper way to calculate it? How does this reconcile with sled dogs being the fastest travel method (p. 11)? Do sled dog rest requirements (1 hour after an hour of pulling, p. 20) factor into the answer at all?

dnd 5e – If I expanded all my movement, and Zephyr strike increase it by 30ft after my attack, can I finish my movement with the increased speed?

Yes, but…

Zephyr Strike is an unusual spell because it includes a variety of things it does and those things are contingent upon whether the spell is active or not.

First of all, let’s address the root of your questions about moving away. You may do so because the spell specifically states:

Once before the spell ends, you can give yourself advantage on one weapon attack roll on your turn. That attack deals an extra 1d8 force damage on a hit. Whether you hit or miss, your walking speed increases by 30 feet until the end of that turn.

This means your walking speed is increased by 30 feet until the end of your turn. Curiously, you can stop concentrating on the spell at this point and this clause would still be in effect. The only criteria for the increase in walking speed is that you attempted a weapon attack roll on your turn before the spell ends.

I believe there’s a second implied question relating to this regarding whether you can move away from the enemy without provoking an opportunity attack. And the answer to that is entirely dependent on whether you maintain concentration.

The spell includes this clause:

Until the spell ends, your movement doesn’t provoke opportunity attacks.

If you make your attack as described and stop concentrating on the spell then you would have the extra movement, but provoke the opportunity attack. However, if you were to maintain concentration following your attack then you could use the additional movement to escape without the enemy getting a chance to hit you back.

performance – How can I speed up my calculations with loops? Python

I wrote this code. But it works very slowly.

I’m figuring out how many times I have to run the case generator to find numbers less than or equal to inv, in this case six. I count the number of attempts until a digit <= 6 is generated. I find inv equal to 1 and repeat the loop. Until inv is 0. I will keep trying to generate six digits <= 6.

And I will repeat all this 10 ** 4 degrees again to find the arithmetic mean.

Help me speed up this code. Works extremely slowly. The solution should be without third-party modules. I would be immensely grateful. Thank!

import random

inv = 6

    def math_count(inv):
        n = 10**4
        counter = 0
        while n != 0:
            invers = inv
            count = 0
            while invers > 0:
                count += 1
                random_digit = random.randint(1, 45)
                if random_digit <= invers:
                    invers -= 1
                    counter += count
                    count = 0
            if invers == 0:
                n -= 1
                invers = inv
        return print(counter/10**4)


PowerShell question about speed of execution “Test-Connection” method

fellows. I discovering new world of PowerShell, and while playing with it, found some unclear behavior of Test-Connection cmdlet. The goal was to get fastest ping reply check from address.

  1. Using method in if statement.
    if(Test-Connection -ComputerName “” -Count 1){

  2. No using if statement.
    Test-Connection -ComputerName “” -Count 1

First script can prompt (and get answers from Router IP, which confirmed with Wireshark, about dozens of times per minute).
Second, for some reasons, can prompt result from test much less often.enter image description here
I would be grateful for any hint.

P.S. If i specify localhost ip ( while($true){ Test-Connection -ComputerName “” -Count 1 } ), script fly like the second example, around 35 prompts in second.

javascript – Speed Efficiency of Decompression Algorithm

I’ve rewritten a piece of Javascript in Python 3.7 that decompresses a file compressed in a specific format. The project that I got this from is available here.

The code I’ve come up with is as close an analog as I could interpret (I’m not the best at Javascript).

def decompress_lz2(data):
    global loop_count
    lb_len = 0
    lb_dist = 0
    escape = 0x16

    off_input = 0

    output = b''

    while off_input < len(data):
        loop_count += 1
        if lb_len:
            off_output = len(output) - lb_dist

            repeat = max(0, off_output + lb_len - len(output))

            chunk = output(off_output:off_output + lb_len - repeat)
            output += chunk

            if repeat:
                repeat_chunk = bytes((chunk(-1))) * repeat
                output += repeat_chunk

            lb_len = 0

        if escape:
            chunk = data(off_input:off_input + escape)
            output += chunk
            off_input += escape
            escape = 0

        flag = data(min(off_input, len(data) - 1))
        off_input += 1

        lb_len = flag >> 5

        if lb_len:
            if lb_len == 7:
                while True:
                    next_ = data(off_input)
                    off_input += 1
                    lb_len += next_
                    if next_ != 0xff:

            lb_len += 2

            lb_dist = (flag & 0x1F) << 8
            lb_dist += (1 + data(off_input))
            off_input += 1

            if lb_dist == 0x2000:
                lb_dist += (data(off_input) << 8)
                off_input += 1
                lb_dist += data(off_input)
                off_input += 1

            escape = flag + 1

    return output

where data is a byte string read in from a file opened in binary mode. My code and the original code both produce the same output, but where the original code takes only a few seconds to execute, mine takes ~10 minutes on the same file. Testing with multiple files yields similar benchmarks. My specific efficiency question is: What can I do to increase the speed of execution of this script on the same system while maintaining output accuracy?

I’m open to the idea of multithreading/multiprocessing though I don’t think it’s possible due to the nature of this compression type.

A company hosting over 37,000 websites. High speed load times, Buy Today 40% Discounts – SEO Help (General Chat)

Best, Reliable, Affordable, Cheap Hosting Platform. Business Hosting with 99.99% uptime, Unlimited Disk, Bandwidth, Domains, Reseller Hosting, Reliable and 



web hosting meaning web hosting india types of web hosting free web hosting cheap web hosting web hosting services.


desktop application – What is the best ease curve and speed for color transitions?

I am creating a dekstop app, and I’m currently implementing animations.

I understand from Material Design Guidelines that I should set the speed for transitions for dekstop apps at about 100-250 ms to keep it short. I also understand that the curve used depends on where the object animated is moving to and from.

But I could not find any resources on animating colors when hovering over or pressing an object (e.g. hovering over a button, hover over an item in a navigation drawer, hovering over a back button). In these examples, the color changes from the normal color to a shade or tint of the original.

What is the recommended duration for these kinds of animations (the buttons and objects are generally small)? Currently I am using 25-50ms for these color animations.

What is the recommended easing curve for these kinds of animations? Currently I am debating between EASE_OUT and EASE_BOTH.

Why are most language virtual machines designed with a load/store architecture? Is there a speed advantage vs. a register-memory architecture?

There are a variety of VMs, including VMs that use “registers”. However, the point of the VM is that it abstracts over physical machines so the VM will likely not limit the number of registers! Such registers are then essentially equivalent to local variables.

  • If the VM uses an interpreted execution model, both stack-based VMs and register-based VMs will typically access an array.
  • If the VM uses a compiled execution model, both stack based and register based VMs will allocate physical registers (if the compilation target uses registers), and spill the remainder to memory. Optimal register allocation is a hard problem either way.

Stack based VMs are slightly easier to implement and have significant historical precedents to the point that there is a whole class of languages which are stack based (concatenative languages). If the VM is implemented in a high level language there can be some practical difficulties if stack entries can have different sizes (e.g. byte vs. word), and because stack entries have unknown types. E.g. in JVM instructions are typed and the VM can statically verify during bytecode loading that the bytecode will not corrupt the stack.

Register based VMs can have a slightly easier time with optimizations if the intermediate language is given in Static Single Assignment form (SSA). Each logical register is assigned at exactly one instruction and is read-only afterwards. This makes it easy to analyse data flows. Of course this prevents a naive mapping from logical to physical registers, but that is no disadvantage compared to stack based VMs. However, most interpreters or JIT compilers are not very concerned with optimizability.

The most well known register based VM is LLVM, which uses SSA. This VM is mostly used as an abstract instruction set (intermediate representation) in ahead-of-time compilers such as clang or rustc.

Register based VMs also occasionally pop up for dynamic language’s runtimes, but are more niche here. Parrot and MoarVM (both connected to the Perl6 language) come to mind.

forms – How to represent speed range values in a simple and efficient way?

I have a task to create a form for administrator of Google Maps Live Traffic Congestion feature. Here’s what needs to be input in the form :

  • Congestion level name and color for the map (green,yellow,red)
  • Road type
  • Speed range value

I attached the task in details as well as the things I did so far.
I would appreciate some feedback on overall form and advice on how to represent speed values since they can’t overlap.

enter image description here
enter image description here