Match types don’t apply after moving to “Create Ads” step” in Google Ads

I’m trying to set up a Google Ads campaign. On step 2 "Set up ad groups" I add keywords to Ad groups with match types:

+ipad +apps
"ipad apps"
[ipad apps]

Then I click "Save and Continue" and on Step 3 my keywords appear changed to:

ipad apps, +ipad +apps

Then I click back to Step 2 and I see the following:

ipad apps
ipad apps
+ipad +apps

For some reason, my keywords are changed to "broad match". How to prevent this behavior? What do I need to do to turn on Matching Types?

Filter custom post types in archive

I want to filter my custom posts (pump) with a custom filter form on it’s archive page (archive-pump.php).

So, I wrote the form markup:

<form method="GET">     <label>Series</label>     <?php         if( $  terms = get_terms( array( 'taxonomy' => 'series', 'orderby' => 'name' ) ) ) :             echo '<select name="series">';             foreach ( $  terms as $  term ) :                 echo '<option value="' . $  term->term_id . '">' . $  term->name . '</option>'; // ID of the category as the value of an option             endforeach;             echo '</select>';         endif;     ?>     <button type="submit">Apply filter</button> </form> 

And I have this to output my custom posts:

<?php if(have_posts()) : while(have_posts()) : the_post(); ?>     <?php the_title( '', '', true ); ?> <?php endwhile; endif; ?> 

When I open my page (localhost/project/pumps) it looks fine. But when I submit my form I’m getting an 404 page.

I maybe need an seperate query to fetch all the $ _GET data. But I’m not getting to the step because of the 404 error.

What am I doing wrong? Thank you!

Site is not secure unless someone types in “www.”

so we connected our domain with HubSpot CMS. They only support SSL for subdomains, so when someone does not type in "www." they are prompted with a security warning. They told me I needed to set up a redirect through GoDaddy for it to always go to the root domain (https://example.com)?

In GoDaddy’s forwarding section I see one that says "Domain" and the other says "Subdomain".

What do I type in each of these boxes so that my site goes to https://example.com no matter what someone types in?

Must I two-weapon fight with different weapon types or can they be matching?

I think I’m clear on two-weapon fighting (thanks to Two-Weapon Fighting & Bonus Action in 5e) except for one thing. The PHB says (p. 195):

When you take the Attack action and attack with a light melee weapon that you’re holding in one hand, you can use a bonus action to attack with a different light melee weapon that you’re holding in the other hand. [emphasis mine]

Does a “different” weapon mean a different type of weapon, or just a different physical instance of a weapon? In other words, can I fight with two shortswords (one in each hand), or would I have to use a dagger or some other type of light weapon in my off hand?

Can multiple types of armor be stacked?

A character in my ongoing Exalted 2e game has an artifact chain shirt. Artifact chain shirts are described as being able to be worn under ordinary clothing (it has no mobility penalty or fatigue value). He’s also recently acquired a (non-artifact) reinforced breastplate. He’d like to wear them both. I don’t see any rules describing whether this can be done, what net protective effect it would have, or what effect it would have on mobility and fatigue.

Can multiple types of armor be stacked? How would I adjudicate this?

The character in question is pretty fragile so I’m not entirely opposed to his getting some kind of benefit, but I worry about setting a precedent that will bite me later.

Example of Dependent Types?

Say you have 3 objects, a global MemoryStore, which has an array of MemorySlabCache objects, and each MemorySlabCache has an array of MemorySlab objects. Sort of like this:

class MemoryStore {   caches: Array<MemorySlabCache> = [] }  class MemorySlabCache {   size: Integer   slabs: Array<MemorySlab> = [] }  class MemorySlab {    } 

But the thing is, this doesn’t capture everything. It also needs to capture the fact that each MemorySlabCache has a size, which is used to tell what size the MemorySlab objects are it contains. So it’s more like this:

class MemoryStore {   caches: Array<MemorySlabCache> = [] }  class MemorySlabCache {   size: Integer   slabs: Array<MemorySlab<size>> = [] }  class MemorySlab<size: Integer> {    } 

Then we create our caches:

let 4bytes = new MemorySlabCache(size: 4) let 8bytes = new MemorySlabCache(size: 8) ... let 32bytes = new MemorySlabCache(size: 32) ... store.caches.push(4bytes, 8bytes, ..., 32bytes, ...) 

Does this count as a "dependent type", "a type whose definition depends on a value"? Since the type of the Array<MemorySlab<size>> is dependent on the value assigned to the size field on MemorySlabCache. If not, what is this? What would make it into an example of dependent types?

Shortest Path in a Directed Acyclic Graph with two types of costs

I am given a directed acyclic graph $ G = (V,E)$ , which can be assumed to be topologically ordered (if needed). Each edge $ e$ in G has two types of costs – a nominal cost $ w(e)$ and a spiked cost $ p(e)$ . I am also given two nodes in $ G$ , node $ s$ and node $ t$ .

The goal is to find a path from $ s$ to $ t$ that minimizes the following cost: $ $ \sum_e w(e) + \max_e \{p(e)\},$ $ where the sum and maximum are taken over all edges of the path.

Standard dynamic programming methods show that this problem is solvable in $ O(E^2)$ time. Is there a more efficient way to solve it? Ideally, an $ O(E\cdot \operatorname{polylog}(E,V))$ algorithm would be nice.


This is the $ O(E^2)$ solution I found using dynamic programming, if it’ll help.

First, order all costs $ p(e)$ in an ascending order. This takes $ O(E\log(E))$ time.

Second, define the state space consisting of states $ (x,i)$ where $ x$ is a node in the graph and $ i\in \{1,2,…,|E|\}$ . It represents "We are in node $ x$ , and the highest edge weight $ p(e)$ we have seen so far is the $ i$ -th largest".

Let $ V(x,i)$ be the length of the shortest path (in the classical sense) from $ s$ to $ x$ , where the highest $ p(e)$ encountered was the $ i$ -th largest. It’s easy to compute $ V(x,i)$ given $ V(y,j)$ for any predecessor $ y$ of $ x$ and any $ j \in \{1,…,|E|\}$ (there are two cases to consider – the edge $ y\to x$ is has the $ j$ -th largest weight, or it does not).

At every state $ (x,i)$ , this computation finds the minimum of about $ \deg(x)$ values. Thus the complexity is $ $ O(E) \cdot \sum_{x\in V} \deg(x) = O(E^2),$ $ as each node is associated to $ |E|$ different states.