Make a query argument work with arrayformula in Google Sheets

Can you help please?
I figured out how to get the result I need, but how do I get them to work with array formulas? Here is my google page

It works for me in Y2:

= COUNT (QUERY (& # 39; Feed from Register & # 39 ;! $ B $ 2: $ E, "select B where B> date & # 39;" & TEXT (TODAY () – ValidDatesOnRegister! $ B $ 1, "yyyy-mm-dd") & "& # 39; and E contains & # 39;" & $ W2 & "& # 39;"))

but, no matter what I tried, I can't make it work like an array of tables in the column. If it is the "and" that is causing the problem, what approach should I take? IF or filter?

Much appreciated help …
enter description of image here

dnd 3.5e – How does the progression of saving jets on Prestige classes work?

First, the prestige classes are exactly the same as the base classes in this regard. You would get the same effect by multiclassing to the sorcerer as you would by multiclassing to the master specialist.

What an effect East is in place for at least one debate. There are two major formal approaches to managing this, plus a very common rule that is at the heart of your concerns.

The simplest approach, which I will call the "first round" approach, is simply to read the numbers on the table and add them up. This means that you get +2 in your will when you take your first level of master specialist, yes.

I call it "round first" because the numbers in the table are already rounded for you – a wizard earning ½ point Will will save each level, but the table does not show that at odd levels, it just shows a gain of 1 every 2 levels. Your base will save your wizard levels is really + 3½, and the master specialist really adds + 2½ to the 1st, but you round these to +3 and +2.

The other approach, the "last round", also known as the "fractional", Arcana Unearthed calls it, requires processing these fractions. You add + 3½ and + 2½ and get +6. Regarding your concerns, this may seem to make matters worse, but consider bad backups: it is quite common to play a second level barbarian / second level fighter / second level ranger (the basis of a construction to tripple over the horizon). At the 6th level, this character has two levels in each of the classes which all have low willpower saves, so + ⅔ + ⅔ + ⅔. If you round up first, it's +0 +0 +0, when the lowest 6th level character should ever be +2. If you round last, you get exactly this + 2 – which is the point, rounding the latest results to multiclass characters more similar to those in a single class.

However, as you can see, this always results in the assistant / master specialist getting a will that is too good. An extremely common rule – especially during the last rounding – is that you can only get the +2 the first time you get a good save. So the fact that your sorcerer has already obtained the +2 will from the 1st sorcerer means that he does not get it again at the level of the master specialist 1st, therefore + 3½ + ½, for +3 if rounded first or +4 if rounded last. Since +4 is what a level 4 assistant would have been, in my experience, considered to be the ideal outcome. The asymmetric save shots that come from rounding first and repeating + 2 are really bad for the game.

But it all depends on the DM; you will need to ask them which rules your game uses, and all characters – PC and NPC – should use the same rules.

dnd 3.5e – How does the progression of saving jets on Prestige classes work? D&D 3.5

First, the prestige classes are exactly the same as the base classes in this regard. You would get the same effect by multiclassing to the sorcerer as you would by multiclassing to the master specialist.

What an effect East is in place for at least one debate. There are two major formal approaches to managing this, plus a very common rule that is at the heart of your concerns.

The simplest approach, which I will call the "first round" approach, is simply to read the numbers on the table and add them up. This means that you get +2 in your will when you take your first level of master specialist, yes.

I call it "round first" because the numbers in the table are already rounded for you – a wizard earning ½ point of Will will save each level, but the table does not show that at odd levels, it just shows a gain of 1 every 2 levels. Your base will save your wizard levels is really + 3½, and the master specialist really adds + 2½ to the 1st, but you round these to +3 and +2.

The other approach, the "last round", also known as the "fractional", Arcana Unearthed calls it, requires processing these fractions. You add + 3½ and + 2½ and get +6. Regarding your concerns, this may seem to make matters worse, but consider the poor safeguards: it is quite common to play a level 2 barbarian / level 2 fighter / level 2 ranger (the basis of a construction to tripple over the horizon). At the 6th level, this character has two levels in each of the classes which all have weak willpower saves, so + ⅔ + ⅔ + ⅔. If you round up first, it's +0 +0 +0, when the lowest 6th level character should ever be +2. If you round last, you get exactly this + 2 – which is the point, rounding the latest results to multiclass characters more similar to those in a single class.

However, as you can see, this always results in the assistant / master specialist getting a will that is too good. An extremely common rule – especially during the last rounding – is that you can only get the +2 the first time you get a good save. So the fact that your sorcerer has already obtained the +2 will from the 1st sorcerer means that he does not obtain it again at the level of the master specialist, therefore + 3½ + ½, for +3 if rounded up first or +4 if rounded last. Since +4 is what a level 4 assistant would have been, in my experience, considered to be the ideal outcome. The asymmetric save shots that come from rounding first and repeating + 2 are really bad for the game.

But it all depends on the DM; you will need to ask them which rules your game uses, and all characters – PC and NPC – should use the same rules.

What application software can be used to simulate the proof of work algorithm of a single node in Bitcoin?

What application software can be used to simulate the proof of work algorithm of a single node in Bitcoin? I want to get results such as the average extraction time to get a block and I want to be able to change the nonce size and specify the size of the block.

lens – The autofocus on my DSLR does not work after I drop it – how can I reduce the problem?

If the camera is communicating with the lens (i.e. the camera is showing no errors and refuses to take pictures and / or take massively blown images at narrower apertures), so there are really only two possible parts that can be really bad:

  • The focus motor / gears in the lens.
  • The focus sensor in the camera.

If your camera has a live view mode, you can use it to definitively determine which one is involved, as the live view mode does not use the focus sensor .

If not, your only option is to try a different goal, and statistically, it's probably what's broken, so it's not a bad idea in general. In particular, if your lens is not internally focused (i.e. if the end of the lens moves in autofocus mode), you have almost certainly broken the focus motor on impact. Since most of the higher quality lenses are internally focused (for this very reason), this is, as others have already suggested, a good opportunity to upgrade your goal.

Note: If you have a very old Nikon lens that requires the built-in focus motor, the problem could also be the built-in focus motor. In this case, the live sight test could be somewhat conclusive. In any case, consider switching to a more recent goal. 🙂

magento2 – Ignore column table does not work in data migration tool

I'm adding a custom column to my Magento 2 quote column which is shipping_delivery_date

I have a warning error when I migrate the data:

[2020-02-27 02:37:24][WARNING]: Destination fields are not mapped. Document: quote. Fields: shipping_delivery_date

i tried to ignore this column:

  
    ........   
    
        .......
        
            quote.shipping_delivery_date
        
    
  

but i still get the same warning

python – Flask cannot go into developer and debug mode and does not work

I cannot successfully run Flask. I tried to follow all the documentation
On Microsoft
set FLASK_DEBUG = 1
set FLASK_APP = app.py
But it seems he is unable to define these variables.

Environment: production
       WARNING: This is a development server. Do not use it in a production deployment.
       Use a production WSGI server instead.
     * Debug mode: off
    Traceback (most recent call last):
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36librunpy.py", line 193, in _run_module_as_main
        "__main__", mod_spec)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36librunpy.py", line 85, in _run_code
        exec(code, run_globals)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflask__main__.py", line 15, in 
        main(as_module=True)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflaskcli.py", line 966, in main
        cli.main(prog_name="python -m flask" if as_module else None)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflaskcli.py", line 586, in main
        return super(FlaskGroup, self).main(*args, **kwargs)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesclickcore.py", line 717, in main
        rv = self.invoke(ctx)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesclickcore.py", line 1137, in invoke
        return _process_result(sub_ctx.command.invoke(sub_ctx))
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesclickcore.py", line 956, in invoke
        return ctx.invoke(self.callback, **ctx.params)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesclickcore.py", line 555, in invoke
        return callback(*args, **kwargs)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesclickdecorators.py", line 64, in new_func
        return ctx.invoke(f, obj, *args, **kwargs)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesclickcore.py", line 555, in invoke
        return callback(*args, **kwargs)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflaskcli.py", line 848, in run_command
        app = DispatchingApp(info.load_app, use_eager_loading=eager_loading)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflaskcli.py", line 305, in __init__
        self._load_unlocked()
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflaskcli.py", line 330, in _load_unlocked
        self._app = rv = self.loader()
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflaskcli.py", line 392, in load_app
        app = locate_app(self, import_name, None, raise_if_not_found=False)
      File "C:UsersUtenteAppDataLocalProgramsPythonPython36libsite-packagesflaskcli.py", line 240, in locate_app
        __import__(module_name)

modular arithmetic – How does Pollard's rho algorithm work?

I'm trying to figure out how Pollard's rho algorithm actually works, but I can't wrap my head around it. I have already read its section in the CLRS book and also on the Internet but I still do not understand its structure or its analysis.
This is a java implementation of the pseudocode from the CLRS book with euclid gcd algorithm:

public static void pollardRho(int n) {
    Random rand = new Random();
    int i = 1;
    int x0 = rand.nextInt(n);
    int y = x0;
    int k = 2;
    while (true) {
        i++;
        int x = (x0 * x0 - 1) % n;
        int d = gcd(y - x, n);
        if (d != 1 && d != n) {
            System.out.println(d);
        }
        if (i == k) {
            y = x;
            k *= 2;
        }
        x0 = x;
    }
}

public static int gcd(int a, int b) {
    // fixes the issue with java modulo operator % returning negative 
    // results based on the fact that gcd(a, b) = gcd(|a|, |b|)
    if (a < 0) a = -a;
    if (b < 0) b = -b;

    while (b != 0) {
        int tmp = b;
        b = (a % b);
        a = tmp;
    }
    return a;
}
  • Why does he choose $ x = (x_0 ^ 2 - 1) mod n $?
  • What is $ y $ actually represent and why is it chosen to be equal to $ {x_1, x_2, x_4, x_8, x_ {16}, ... } $?
  • Why does he calculate $ text {GCD} (y-x, n) $ and how $ d $ proves to be a factor of $ n $?
  • And why the expected operating time is $ O (n ^ {1/4}) $ arithmetic operations and $ O (2 ^ { beta / 4} beta ^ 2) $ bit operations assuming that $ n $ East $ beta $ bits long?

I understand that if there is a non-trivial square root of $ x ^ 2 equiv 1 pmod {n} $ then $ n $ is a composite and $ x $ is a factor but $ y - x $ is not a square root of $ n $ is it?

angularjs directives – Angular: @Input does not work with select / mat-select

Hello, I am creating reusable components with angular 8, and I have to change the parameters between them using the @Input decorator, but that does not work when I use native mat-select or select because the options are not available. not appear.

See my code:

Component call:


I-select component:


@Component({
  // tslint:disable-next-line: component-selector
  selector: 'i-select',
  templateUrl: './select.component.html',
  encapsulation: ViewEncapsulation.None
})
export class SelectComponent implements OnInit {
  @Input() data: any;

  @Input() label: string;

  @Output() event = new EventEmitter();
  constructor() { }

  ngOnInit() {
    if (this.data !== undefined) {
      this.data = JSON.parse(this.data);
    }
  }
}

And my SelectComponentHtml:


    {{label}}
    
      
        {{content.value}}
      
    
  

What's wrong?

javascript – How to work with a deeply nested object that is less painful

Read the code as user.personalInfo.address.city; always give me a headache (using an example of "Accessing Nested Objects in JavaScript").

user = {
    id: 101,
    email: 'jack@dev.com',
    personalInfo: {
        name: 'Jack',
        address: {
            line1: 'westwish st',
            city: 'wallas',
            state: 'WX'
        }
    }

The literal and distributed object operator facilitates the creation of deeply nested objects.

But access is not my biggest headache, after all, there are some good practices for accessing the nested object, for example How can I access and process objects, arrays or nested JSON? or i can use lodash get

My biggest headache is that from time to time I have to read the code several times to find out "where did I get this property" or "why nobody says this object has such a property (normally deeply nested)". For example it is a real code that I am dealing with today (it is seen but it does not matter for my question)

data() { 
    return {
        customer: {},
        settings: (),
        task: {},
        ...
        }
}
//I read the code several times to find out the customer is created by spread operator 
//to combine some objects returned from 2 REST api calls!!!

Requiring the original author to write a complete document is much easier said than done. The same goes for defining a hard rule like no more than 3 nested levels.

So my question is, is there a recommended way to make working with a deeply nested object less painful, in general and in particular in javascript?