dnd 5e – In what rule book is the awakened familiar background introduced?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.

Book or Course Recommendation for Microservices Design

I am very sorry, I hope you forgive me for this question. Maybe it is not a question of a special design, I only know that those who respond on this site could help me, I do not see another place where to find help.

I am not a native English speaker and my listening is not the best. I am not a Software Engineer, although I have been developing for a long time, I have taken microservices courses in Java and / C #.

Now, I’ve been looking for a Udemy’s course that teaches, from microservices perspective, how to face’s a problem having a User Stories (I did not find something suitable.). Now, I’m looking for a Amazon’s book.

From a User Story.
How to analyze applicable microservices patterns.
How to choose it.
What software patterns design applicable.
I would like to know how to create the diagrams.

What book do you recommend?

Which course on Udemy might be the best fit?

dnd 5e – Does the Book of Exalted Deeds allow level 10 spell slots?

Spell Levels are currently limited to Level 9. There is no class that has a 10th level spell slot and there are no rules that suggest there is a 10th level spell slot. Neither are there current 10th level spells that could use a 10th level spell slot.

The PHB (page 201) clearly states:

Every spell has a level from 0 to 9.

and (emphasis mine from @MichaelPolitowski)

When a character casts a spell, he or she expends a slot of that spell’s level or higher, effectively “filling” a slot with the spell. You can think of a spell slot as a groove of a certain size—small for a 1st-level slot, larger for a spell of higher level. A 1st-level spell fits into a slot of any size, but a 9th-level spell fits only in a 9th-level slot.

This clearly states that there is no 10th level (currently) spell that you can cast. While it doesn’t explicitly state there is no 10th level slot, the implication is that without 10th level spells there aren’t 10th level slots – otherwise there would be upscaling options allowing you to utilize that.

One can reasonably extrapolate how it’d work, but the current rules do not include 10th level and there are no other examples list going to a 10th level (such as examples that list surpassing 20 for an Ability Score.)

The following phrase from the Book description does not create a new spell slot level, it simply upcasts to one level higher. The current cap of a 9th level spell remains:

any spell slot you expend to cast a cleric or paladin spell counts as a spell slot of one level higher.

Unlike the rules around Ability score raising with the Tomes/Manuals, this book does not state that it increases spell levels beyond the current cap of 9th.

A free upcast

What this book does do is give you a free upcast without having to use a higher level slot. That’s still a pretty great benefit without having to create a 10th level spell slot that just doesn’t exist in the current rules.

The stated benefits are all still applicable and do not require generating an unlisted option (10th level spell slot) in order to be useful and/or work.

Interactions to consider and the Slippery Slope

If you do allow this in your games, be aware that this changes Counterspells and Dispel Magics. A simple fix, but just something to be aware of.

And for a warning, if this allows 10th level, then why couldn’t someone create a 10th level scroll? Or an 11th? Once you’ve confirmed the existence of 10th level, then that level now exists and must be accounted for.

india – Planning for honeymoon, should I book via travel agent or do research by my self and book?

I am an Indian citizen and I want to plan for my honeymoon to go to Andaman and Nicobar Islands. I haven’t been there before. I am planning to spend about 7N/6D. I have a prior planning experience in Switzerland and UK, at that time I planned everything myself.

But this time, there are many things to do in Andaman, and I basically want just a romantic experience. I am confused about whether to plan it all myself, like bookings and all, or get it done from the travel agent?

differential operators – Theorem 3.12 Lawson’s Spin Geometry book

Theorem 3.12: Let $phicolon U rightarrow V$ be a diffeomorphism between open subset of $mathbb{R}^n$. Then for each compact subset $Ksubset U$, $phi$ induces a map $phi_{*}colon Psi DO _{K,m} rightarrow Psi DO _{phi(K),m}$ by setting begin{align}
(phi_{*} P)u=P(ucirc phi)circ phi^{-1}, mbox{ } uin mathscr{S}(mathbb{R}^n) .

Proof: write $psi=phi ^{-1}$, and $tilde{x}=psi (x)$, $tilde{y}=psi (y)$ for $tilde{x},tilde{y} in U$. For chain rule begin{align*}
tilde{x}-tilde{y}=psi(x)-psi(y)&=psileft(tx+(1-t)yright) {big|}_{0}^{1} \
&=displaystyle{int_{0}^{1}}{, frac{d}{dt}psi(tx+(1-t)y) , dt} \
&=displaystyle{int_{0}^{1}}{, left( frac{partialpsi_{i}}{partial x_{j}}(tx+(1-t)y)right)cdot (x-y) , dt} \
&=Psi(x,y)cdot (x-y) ,
where $Psi(x,y)$ is a smooth matrix function. In diagonal,

begin{align*} Psi(x,x)=(partial psi_{i} / partial x_{j} (x))_{i,j} end{align*}

is the jacobian matrix of $psi$ and, since $psi$ is difeomorphism, so $Psi(x,x)$ is invertible in $W$ a (smaller) neighboord of diagonal.

We take $chiin C_{c}^{infty}(W)$ such that $chi=1$ in a small neibhboord of diagonal and $J(x)=det (partial{psi_{i}}/partial_{j}(x))$ determinant of Jacobian of $psi$. So, for Proposition 3.2 we have begin{align}
((phi_{*}P)u)(x)&= (P(ucirc phi))(tilde{x}) \
&=displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle tilde{x} , xi rangle}p(tilde{x},xi)widehat{ucirc phi}(xi) , dxi} \
&=displaystyle{int_{mathbb{R}^n}^{}}displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle tilde{x} – tilde{y} , xi rangle}p(tilde{x},xi){(ucirc phi)}(tilde{y}) , dtilde{y} dxi} \
&=displaystyle{int_{mathbb{R}^n}^{}}displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle x – y , (Psi(x,y))^{t}xi rangle}p(psi(x),xi)u(y)|J(y)| , dy dxi} \
(I)&=displaystyle{int_{mathbb{R}^n}^{}}displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle x – y , (Psi(x,y))^{t}xi rangle}chi(x,y)p(psi(x),xi)|J(y)|u(y) , dy dxi} \
&+displaystyle{int_{mathbb{R}^n}^{}}displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle x – y , (Psi(x,y))^{t}xi rangle}(1-chi(x,y))p(psi(x),xi)|J(y)|u(y) , dy dxi} .
For observation 3.6, begin{align*} displaystyle{int_{mathbb{R}^n}^{}}displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle x – y , (Psi(x,y))^{t}xi rangle}(1-chi(x,y))p(psi(x),xi)|J(y)|u(y) , dy dxi} end{align*} represents an infinitely differentiable operator.

After, make the change of variable begin{align*}xi = (Psi(x,y)^{t})^{-1}zeta=Theta (x,y)zeta,end{align*} modulo infinitely smoothing operators, we have begin{align*}
((phi_{*}P)u)(x)&congdisplaystyle{int_{mathbb{R}^n}^{}}displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle x – y , (Psi(x,y))^{t}xi rangle}chi(x,y)p(psi(x),xi)|J(y)|u(y) , dy dxi} \
&=displaystyle{int_{mathbb{R}^n}^{}}displaystyle{int_{mathbb{R}^n}^{}} {e^{ilangle x – y , zeta rangle}chi(x,y)p(psi(x),Theta (x,y)zeta)|J(y)||det Theta (x,y)|u(y) , dy dzeta},
and for Theorem 3.5 we have begin{align*} a(x,y,zeta)=chi(x,y)p(psi(x),Theta (x,y)zeta)|J(y)||det Theta (x,y)|end{align*} is an Pseudo-diferencial operator of order $m$ and, it have support compact in $phi(K)$. In conclusion, $phi_{*}PinPsi DO _{phi(K),m}$.

But look at this, integrating in the integral (I), is dominated by begin{align*} (1+|xi|)^{m}(1+|y|)^k mbox{ with arbitrary } k end{align*} and if $m<-n$ so $(1+|xi|)^{m}(1+|y|)^k $ converge and so integral (I) converge.

What happen if $mgeq -n$, Lawson don’t consider this case, do you have any suggestion for cover this case.

Thanks since now

beginner – Simply Scheme book: “functions.scm”, How to use basic language constructs to create interactive prompt for function application

While reading Simply Scheme by Brian Harvey and Matthew Wright:

Part I: Chapter 2 Functions

In this chapter you are going to use the computer to explore functions, but you are not going to use the standard Scheme notation as in the rest of the book. That’s
because, in this chapter, we want to separate the idea of functions from the complexities
of programming language notation. For example, real Scheme notation lets you write
expressions that involve more than one function, but in this chapter you can only use
one at a time.
To get into this chapter’s special computer interface, first start running Scheme as
you did in the first chapter, then type (load "functions.scm")
to tell Scheme to read the program you’ll be using. (If you have trouble loading the
program, look in Appendix A for further information about load.) Then, to start the
program, type

I am using DrRacket with #lang simply-scheme Github Docs.

So I tried to (load "functions.scm") but got this error back:
open-input-file: cannot open input file path: path/to/functions.scm system error: The system cannot find the file specified.; errid=2

I also tried (load "functions.rkt") and (require "functions.rkt"), and got also the same error.

So I read the documentation of #lang simply-scheme and found that:

FIXME: the other helper libraries haven’t been mapped yet. (things like functions.scm would be nice to have as a library.)

So I tried to tackle this problem and implement (functions) with my simple racket and scheme experience that I learned from past books.

The notation is interactive and should act like the following:

You’ll then be able to carry out interactions like the following.* In the text below we’ve
printed what you type in boldface and what the computer types in lightface printing:

Function: +
Argument: 3
Argument: 5
The result is: 8

Function: sqrt
Argument: 144
The result is: 12

So here is my code in 2 versions:

First I have defined some helper functions for prompting the user for input:

(define (prompt format-string . args)
  (apply printf (cons format-string args))

(define (prompt-until pred? input (bad-input (const "")))
  (let ((val (prompt input)))
    (cond ((pred? val) val)
           (printf (bad-input val))
           (prompt-until pred? input bad-input)))))

I also added variadic functions handling, which I think the book version does not support.


(define (functions)
  (let ((func-symbol (prompt "Function: ")))
    (with-handlers ((exn:fail:contract:variable? (lambda (_)
                                                   (printf "~a is not definednn" func-symbol)
                    (exn:fail:contract? (lambda (x)
                                          (printf "nContract violation ~ann" (regexp-replace
                                                                               #rx": contract violation"
                                                                               (exn-message x)
      (let* ((function (eval func-symbol)) (arity (procedure-arity function)))
        (let loop ((func (lambda (x) x)) (current-argument 1) (arguments '()) (max-arity arity))
          (cond ((equal? func-symbol 'exit) (printf "exiting (functions)"))
                ((not (procedure? function)) (printf "~a is not a procedure/functionnn" func-symbol)
                ((and (integer? max-arity) (> current-argument max-arity))
                 (printf "the result is: ~v"
                         (apply function
                                (reverse arguments)))
                 (printf "nn")
                ((arity-at-least? max-arity)
                 (printf "The functions ~a is varadic and can accept arbitrary number of arguments!nBut accepts minimum of ~an"
                         (symbol->string func-symbol) (arity-at-least-value max-arity))
                 (loop function
                       (eval (prompt-until exact-nonnegative-integer? "How many argument do you want to supply (Non-negative Integer): "))))
                (else (loop function
                            (add1 current-argument)
                            (cons (eval (prompt (format "Argument ~a: " current-argument))) arguments)

Here I removed some let bindings and tried to quit early when an abnormal case happens so the recursion doesn’t have to expensive with all the checks happening each time.

I also added more checks for variadic arity count.

I also used a for/list comprehension instead of a hand-made tail recursive loop.

(define (functions)
  (let ((func-symbol (prompt "Function: ")))
    (with-handlers ((exn:fail:contract:variable? (lambda (_)
                                                   (printf "~a is not defined.nn" func-symbol)
                    (exn:fail:contract? (lambda (x)
                                          (printf "Contract violation ~ann" (regexp-replace
                                                                               #rx": contract violation"
                                                                               (exn-message x)
      (cond ((member? func-symbol '(exit quit)) (displayln "exiting (functions)"))
             (let ((function (eval func-symbol)))
                 ((not (procedure? function)) (printf "~a is not a procedure/functionnn" function)
                  (let* ((arity (procedure-arity function))
                         (integer-arity (cond ((arity-at-least? arity)
                                               (printf "The function ~a is varadic and can accept arbitrary number of arguments!nBut accepts minimum of ~an"
                                                       function (arity-at-least-value arity))
                                               (prompt-until (conjoin exact-nonnegative-integer?
                                                                      (curry <= (arity-at-least-value arity)))
                                                             (format "How many argument do you want to supply (Non-negative Integer >= ~a): "
                                                                     (arity-at-least-value arity))))
                                              ((integer? arity) arity)))
                         (arguments (for/list ((i (in-range 1 (add1 integer-arity))))
                                      (eval (prompt "Argument ~a: " i)))))
                    (printf "Result is: ~vnn"
                            (apply function arguments))

I have played with this function and it seems to work normally in all cases as it does handle abnormal cases correctly by printing the errors and not showing the errors directly to the end-user.

I didn’t handle all procedure-arity cases; because I thought it was sufficient handling normal functions and simple variadic functions only.

My major concerns are:

  • Using 3 lets.
  • Using 3 conds.
  • The code contains many levels of deep nesting.

I think my code is rather long, fairly unreadable, and for that I apologize.

Also I would like to know if I’m violating any major conventions of the language in any obvious ways.

I am sorry for the lengthy question, but I wanted to present all the background details, and I wanted to follow the StackExchange Code review Guide as much as I can.

Pardon me for any writing mistakes; English is not my mother tongue.

Thanks in advance.

How to sort form fields in customer address book – Magento 2?

How can I sort the form fields in the customer address book?
For example: I need the zip code above the city.

I have already sorted the form fields in the checkout_index_index.xml for the checkout as in this post. That works great.

Does anyone have an idea?

enter image description here

pr.probability – CDF as integral of PDF; figure from Bertekas probability book

PDF to CDF by integrationChapter 3 of the Bertsekas probability book (on continuous r.v.s) has this figure and captions, describing how a CDF is determined by integrating a PDF. The top example of a uniform r.v. on (a,b) is clear; integrating the PDF shown produces the CDF. But the second example, with a very similar PDF shown (but with a 2 in the numerator), produces the square of the other CDF.

The function looks like a translated version of y = 2x, so a square in the integral makes some sense, but I can’t quite connect the dots fully to come up with the CDF shown to the right of that diagram.

Can someone explicitly derive the second CDF from the PDF in that case?

cyberpunk 2020 – What book specifies rules for running fast on paired cyberlegs?

In Cyberpunk 2020, suppose you have a team with three members: Apple, Banana, and Canteloupe.

Movement Allowance {MA): This is an index of how fast your character
can run (important in combat situations). The higher your Movement
Allowance (MA), the more distance you can cover in a turn. RUN: To
determine how far your character can run in a single combat round
(@3.2 seconds) in meters, multiply your MA by 3. The character can run
three times this distance in a full 10 second turn. Write this in the
RUN section of your Hardcopy Form. LEAP: To determine how far your
character can leap (from a running start), divide your RUN by 4.
Write this in the LEAP section of your Hardcopy Form.

(p.26, 2020 rulebook)

The Solo, Apple, starts with a Movement Allowance of 2.
This means he can run 6 meters in 3.2 seconds and his RUN score is 18; that is, he can run 18 meters in 10 seconds. His LEAP stat is 18/4=4.5; this means he can do a running jump of 4.5 meters.

His friends, Banana and Canteloupe, have Movement Allowances of 3 and 4. They have RUN scores of 27 and 36; thus they have LEAP stats of 6.75 and 9, respectively. Because the basic rules do not mention vertical leaping, I assume that they cannot vertically leap to any major extent.

This solo, Apple, gets paired cyberlegs.

“Characters with paired cyberlegs can leap 6 meters straight
up, or make a running jump of up to 8 meters.”

(p. 89, 2020 rulebook)

This means that Apple effectively has a LEAP stat of 8. Assuming consistent equations, Apple’s RUN score should be 32. So Apple can run faster than Banana but is still slower than Canteloupe.

As far as I can tell, even though Apple can leap vertically, he is not protected from most falling damage. (If I were GM, I would say because he can leap up 6 meters, he can also fall 6 meters without taking damage IF he lands on his feet, but would take ordinary falling damage if he failed to land on his feet. I can’t find anything in the rules about that.)

As play proceeds, Apple wants to modify his legs so that he can run very fast. In the core rulebook, I cannot find any rules covering this. Some old R. Talsorian books probably have various rules. Which books have rules for running?

what exactly does it mean when book says istreams and ostreams represent input and output streams.(C++)

From my understanding and istream and ostream is a device that allows for output and input streams to occur. Could someone just explain this in better detail.