## Is there a tool to see every WordPress site that’s using a particular plugin?

Is there a tool to see every WordPress site that’s using a particular plugin? For example: if I wanted to know every website in the world that is currently (or historically) using Yoast SEO.

I realize this would probably be a third party tool, so I don’t know if it’s appropriate for this forum. But, I figured it’s a good place to ask seeing as it’s related to WordPress.

## Hello i have this code thats not written out in the write form can someone rearrange it for me quickly Thank you [closed]

.file 1 “” .section .mdebug.abi32 .previous .nan legacy .module fp=32 .module nooddspreg .abicalls .rdata .align 2 LC0: .ascii “Enter number of elements in array0” .align 2LC1: .ascii “%d0” .align 2 LC2: .ascii “Enter %d integers20” .align 2LC3: .ascii “Minimum element is present at location %d and its value ” .ascii “is %d.20” .text .align 2 .globl main .set nomips16 .set nomicromips .ent main .type main, @function main: .frame $$fp,448,$$31 # vars= 416, regs= 2/0, args= 16, gp= 8 .mask 0xc0000000,-4 .fmask 0x00000000,0 .set noreorder .cpload $$25 .set nomacro addiu$$sp,$$sp,-448 sw$$31,444($$sp) sw$$fp,440($$sp) move$$fp,$$sp .cprestore 16 movz$$31,$$31,$$0 li $$2,1 # 0x1 sw$$2,32($$fp) lw$$2,%got($$LC0)($$28) nop addiu $$4,$$2,%lo($$LC0) lw$$2,%call16(puts)($$28) nop move$$25,$$2 .reloc 1f,R_MIPS_JALR,puts 1: jalr$$25 nop lw $$28,16($$fp) addiu $$2,$$fp,436 move $$5,$$2 lw $$2,%got($$LC1)($$28) nop addiu$$4,$$2,%lo($$LC1) lw $$2,%call16(__isoc99_scanf)($$28) nop move $$25,$$2 .reloc 1f,R_MIPS_JALR,__isoc99_scanf 1: jalr $$25 nop lw$$28,16($$fp) lw$$2,436($$fp) nop move$$5,$$2 lw$$2,%got($$LC2)($$28) nop addiu $$4,$$2,%lo($$LC2) lw$$2,%call16(printf)($$28) nop move$$25,$$2 .reloc 1f,R_MIPS_JALR,printf 1: jalr$$25 nop lw $$28,16($$fp) sw $$0,28($$fp) b $$L2 nop$$L3: addiu $$3,$$fp,36 lw $$2,28($$fp) nop sll $$2,$$2,2 addu $$2,$$3,$$2 move$$5,$$2 lw$$2,%got($$LC1)($$28) nop addiu $$4,$$2,%lo($$LC1) lw$$2,%call16(__isoc99_scanf)($$28) nop move$$25,$$2 .reloc 1f,R_MIPS_JALR,__isoc99_scanf 1: jalr$$25 nop lw $$28,16($$fp) lw $$2,28($$fp) nop addiu $$2,$$2,1 sw $$2,28($$fp) $$L2: lw$$2,436($$fp) lw$$3,28($$fp) nop slt$$2,$$3,$$2 bne $$2,$$0,$$L3 nop lw$$2,36($$fp) nop sw$$2,24($$fp) li$$2,1 # 0x1 sw $$2,28($$fp) b $$L4 nop$$L6: lw $$2,28($$fp) nop sll $$2,$$2,2 addiu $$3,$$fp,24 addu $$2,$$3,$$2 lw$$3,12($$2) lw$$2,24($$fp) nop slt$$2,$$3,$$2 beq $$2,$$0,$$L5 nop lw$$2,28($$fp) nop sll$$2,$$2,2 addiu$$3,$$fp,24 addu$$2,$$3,$$2 lw $$2,12($$2) nop sw $$2,24($$fp) lw $$2,28($$fp) nop addiu $$2,$$2,1 sw $$2,32($$fp) $$L5: lw$$2,28($$fp) nop addiu$$2,$$2,1 sw$$2,28($$fp)$$L4: lw $$2,436($$fp) lw $$3,28($$fp) nop slt $$2,$$3,$$2 bne$$2,$$0,$$L6 nop lw $$6,24($$fp) lw $$5,32($$fp) lw $$2,%got($$LC3)($$28) nop addiu$$4,$$2,%lo($$LC3) lw $$2,%call16(printf)($$28) nop move $$25,$$2 .reloc 1f,R_MIPS_JALR,printf 1: jalr $$25 nop lw$$28,16($$fp) move$$2,$$0 move$$sp,$$fp lw$$31,444($$sp) lw$$fp,440($$sp) addiu$$sp,$$sp,448 j$$31 nop .set macro .set reorder .end main .size main, .-main .ident “GCC: (Ubuntu 5.4.0-6ubuntu1~16.04.9) 5.4.0 20160609”

## Need help optimizing an algorithm that’s supposed to maximize the greatest common divisor of n elements by removing at most one element

Alright, first here’s the text of the problem:

You’re given n bags of candies where the i-th bag contains a[i] candies and all numbers a[i] are in the segment [1,m]. You can choose a natural number x and each second remove x candies from one of the bags if it contains at least x candies. The goal is to empty all the bags except at most one of them. Find the greatest possible value of x that allows you to achieve this goal.

The desired time complexity is O(n* log m);

What I managed(I think) to do is write an O(n^2 * log m) algorithm (the two nested for loops are O(n^2) and Euclid’s algorithm is O(log m)).

The code written in c++ is below. The second for loop calculates the gcd of the numbers excluding the i-th number and I calculate the maximum by considering all values of i, but apparently it can be done linearly. Any ideas on how to optimize it to O(n* log m)?

``int gcd(int a, int b){     if(b == 0)         return a;     return gcd(b, a%b); }   int greatestPossibleGcd(int *arr, int n){     int maxgcd = 0;     int current = 0;      for(int i=0;i<n;i++){         maxgcd = gcd(maxgcd, arr[i]);     }      for(int i=0;i<n;i++){         for(int j=0;j<n;j++){             if(j == i)                 continue;             current = gcd(current, arr[j]);         }         if(current > maxgcd)             maxgcd = current;          current = 0;     }      return maxgcd;  } ``

## Are Half-Elves supposed to have a slender build like Elves, or are they supposed to have a build that’s intermediate between Humans and Elves? [5e]

The Player’s Handbook’s weight descriptions for Half-Elves are inconsistent. The Half-Elf section in Chapter 2 (pg. 38) says:

They range from under 5 feet to about 6 feet tall, and from 100 to 180 pounds, with men only slightly taller and heavier than women.

However, the “Height and Weight Range” table in Chapter 4 (pg. 121) gives a weight formula for Half-Elves of 110 + (2d8) x (2d4), which is 114 to 238 pounds.

This is very different.

Do we have any reason to label one description Correct and the other A Mistake? The 2018 PHB Errata are silent on this point.

Looking at the rest of the table’s formulas, Humans are 114 to 270 lbs, whereas Wood Elves are 102 to 180 lbs and High Elves are 92 to 170 lbs. (I’ve excluded the Drow because they’re significantly shorter.)

So are Half-Elves supposed to have a slender build like elves (100-180 lbs), or are they supposed to have a build that’s intermediate between Human and Elf (114-238 lbs)?

[As a side note, changing the Half-Elves’ weight modifier in the table from its current 2d4 (which is like a Human’s) to only 1d4 (like the Wood and High Elves’) would yield a calculated range of 112 to 176 pounds.]

## Should I talk to the DM about a murder hobo that’s derailing the campaign?

I’m in high school and very new to dungeons and dragons so I have no experience with this. I joined a new group recently made up of 3 mildly experienced players and a relatively new DM.

Our DM decided to try Mines of Phandelver but it got horribly derailed. It was going good until I missed one meeting and one of the other PC’s decided to go murder hobo, burn down the Inn in the first town, and use oil to try and kill as many civillians as possible. After this, the DM missed two meeting without telling anyone (with all the players showing up). After he came back, he made it so that the entire party appeared as criminals despite no one else doing anything. He’s also not pulling his punches trying to kill the murder hobo through combat.

The DM isn’t saying anything about this but I’m worried that it’s going to get out of control. Should I try to talk to the DM or PC about this or should I let it play out?

## [ Movies ] Open Question : What is your favourite movie that’s from the year 2009?

Mine favorite one is Avatar HM: The Princess and the Frog, Inglorious Basterds, Star Trek, Harry Potter and the Half-Blood Prince, The Hangover, Sherlock Holmes, Precious, Zombieland, The Blind Side, Where The Wild Things Are, Up In The Air, Up, X-Men Origins: Wolverine, Fantastic Mr. Fox, Watchmen, Fast & Furious 4, Notorious, Angels & Demons, Funny People, Law Abiding Citizens, The Twilight Saga: New Moon, Knowing, Cloudy with a Chance of Meatballs, Invictus, The Final Destination, Orphan, It’s Complicated, Terminator: Salvation, Ice Age: Dawn of the Dinosaurs, Public Enemies, Couples Reteat, Julie & Julia, Confessions of a Shopaholic, 2012, The Hurt Locker, Adventureland, 17 Again, The Ugly Truth, The Soloist, Year One, He’s Just Not That Into You, Night at the Museum: Battle of the Smithsonian, Paranormal Activity, Mall Cop, I Love You Phillip Morris, Crazy Heart, Ponyo, An Education, (500) Days of Summer, Hannah Montana: The Movie, A Christmas Carol, The Proposal, Monsters & Aliens, Race to Witch Mountain, A Single Man, The Taking of Pelham 123, The Informant!, Moon, District 9, G.I. Joe: Rise of Cobra, Friday The 13th, Saw VI, Madea Goes to Jail, 12 Rounds, Next Day Air, I Can Do Bad All By Myself, and Transformers: Revenge of the Fallen

## How does the BERT model (in Tensorflow or Paddle-paddle frameworks) relate to nodes of the underlying neural-net that’s being trained?

The BERT model in frameworks like TensorFlow/Paddle-paddle shows various kinds of computation nodes (like subtract, accumulate, add, mult etc) in a graph like form in 12 layers.

But this graph doesn’t look anything like a neural-network, one that’s typically shown in textbooks (e.g. like this https://en.wikipedia.org/wiki/Artificial_neural_network#/media/File:Colored_neural_network.svg) where each edge has a weight that’s being trained and there is an input layer and output layer.

Instead, when I print out the BERT graph, I can’t figure out how a node in the BERT graph relates to a node in the neural-network that’s being trained.

I have been using the BERT framework models to compile them to a form where we can run the model on a PC/CPU. But I still lack this basic aspect of how BERT relates to neural-net as I don’t see which neural-network topology is being trained (as i’d expect topology/connections between/among various layers/nodes of the neural-net dictate how training of the neural net occurs).

Could someone explain what underlying neural-net is being trained by BERT? How do nodes in the BERT graph relate to neural-net nodes and weights on neural-net edges?

## What happens if the Lightning Lure cantrip is cast on a target that’s already within 5 feet?

What happens if I cast Lightning Lure on a creature that’s already within 5 feet of me? Do they still get pulled 10 feet toward me (and in this case collide with me) and do they suffer the damage if they fail the save?

## Can a virus that’s in a file stream infect a computer?

I have a java web application that accepts `base64` image strings from users. These strings are first converted to a byte stream after which the stream is scanned for viruses. After that the file is stored as a resized version of the actual image.

My question is, when the file has been transformed from a `base64` string to an in-memory byte stream and it happens to contain a virus, will that virus be able to escape the byte stream and infect the rest of the server? Or can it only do that after the stream has been transformed to a file stored on disk?