What are the targeting range limitations of Glyph of Warding?

Glyph of warding states, in part:

When the glyph is triggered, the stored spell is cast. If the spell has a target, it targets the creature that triggered the glyph.If the spell affects an area, the area is centered on that creature.

Other questions have addressed the fact that the specific wording of the glyph allows a spell that has a range of self, for example, to instead affect whoever triggered the effect.

My question is whether the wording also supersedes other potential issues- specifically, with how far away the target can be.

Can Glyph of warding alter the range of the stored spell? If so, by how much?

LINQ to SharePoint 2016 : Value does not fall within the expected range

I have a Dev and a Production SharePoint 2016 environment. For CRUD with lists I am using LINQ to SharePoint (SPMetal) generated classes. I have a list where 27 columns are Person Type. In my dev(http://sp2016/) environment the list is in root/main site but in Prod it is in subsite (https://sp2016/leaveauto). In both environment I have increased the Resource throttling value from 8 to 50 for Lookup View field. From the list I am taking a Person’s Id value (column name: HOD) from a specific Person type column with below code

using (MyDataContext objDataContext = new MyDataContext(_webUrl))                     {                         try                         {                             int approverId = objDataContext.ApproverInfo.FirstOrDefault(x => (string.Compare(x.DeptID,deptId)==0) && (string.Compare(x.Location, location)==0)).HODId;                         }                         catch (Exception ex)                         {                             throw;                         }                     } 

here, HODId is LINQ to SharePoint generated column for HOD and deptId & location values I am passing with parameter.

In Dev environment it is working fine, but in Prod it is giving below error

{System.ArgumentException: Value does not fall within the expected range.    at Microsoft.SharePoint.SPFieldMap.GetColumnNumber(String strFieldName, Boolean bThrow)    at Microsoft.SharePoint.SPListItemCollection.GetColumnNumber(String groupName, Boolean bThrowException)    at Microsoft.SharePoint.SPListItem.GetValue(SPField fld, Int32 columnNumber, Boolean bRaw, Boolean bThrowException)    at Microsoft.SharePoint.SPListItem.get_Item(String fieldName)    at Microsoft.SharePoint.Linq.PropertyMap.GetSPFieldValue(PropertyMap pm, SPListItem item, JoinPath joinPath)    at Microsoft.SharePoint.Linq.SPItemMappingInfo.MaterializeEntity[TEntity](DataContext dc, SPDataList list, SPListItem item, SPItemMappingInfo itemMappingInfo, JoinPath joinPath)    at lambda_method(Closure , SPListItem )    at System.Linq.Enumerable.WhereSelectEnumerableIterator`2.MoveNext()    at System.Linq.Enumerable.FirstOrDefault[TSource](IEnumerable`1 source, Func`2 predicate)    at Microsoft.SharePoint.Linq.SPLinqProvider.Execute[T](Expression expression)    at ShopSignboard.lib.Utility.FindNonFinancialApprover(String approvalStatus, String deptId, String location)} 

How can I solve this problem?

Healing Light and Range [on hold]

I find myself quite fond of healing light because of the following:

  1. It is not a spell, meaning no problem of spell slot or counter spell.
  2. No components (V,S,M).

My plan is to build a survivable character (focus on wilderness). I thought of starting as 1st level celestial warlock and invest the rest in Ranger. At level 20, it will be like this: 1 Warlock/19 Ranger.

Any tips to make is work as a solo player and in a party of four that include a cleric.

Many thanks! O.

How to design a chart that has an x-axis with a fixed range that is longer than the selected range?

I’m designing a web-based analytics dashboard that contains a chart in which the x-axis represents the days of a campaign, and it always shows 31 days. However, the duration of a campaign varies; it may be predefined to any period between a single to 31 days.
In cases when the campaign’s duration is shorter than 31 days, I want to make it clear which area of the chart is relevant.
Are there any existing best practice solutions for this scenario?
One idea I have is graying out the area that’s not required (see image below). A bar chart with a 31-days x-axis that shows a 7-days long campaign

The chart’s width is fixed and optimized for displaying a 31-days range. I’m not changing the number of days on the x-axis to avoid scenarios in which there is a single floating dot or bar on the screen or several data points with vast space between them (see images below). A bar chart with a 7-days x-axis that shows a 7-days long campaign A bar chart with a 3-days x-axis that shows a 3-days long campaign

How to redirect a port range on a load balancer

I’m a little new to this and trying to figure this out. I have 3 web servers running Ubuntu 16.04 and Apache2. One of the web servers will serve as a load balancer for the other two. I have the load balancing part correct, but I am trying to set this up where the port range 60000-65000 on the load balancer is redirected to the web servers on port 80. My guess is that this is done using iptables but that’s just a guess. Has anyone implemented this before? Thanks in advance.

Is the 5-foot range of the Help action my range to the ally, the enemy, or both?

A player in our group that knows much more than me explained the Help action during game, but then after the game I read the PHB and not sure if he’s using it correctly.

I thought I needed to be within 5 feet of the enemy. He said I need to be within 5 feet of the ally.

The Help action says:

You can lend your aid to another creature in the completion of a task. When you take the Help action, the creature you aid gains advantage on the next ability check it makes to perform the task you are helping with, provided that it makes the check before the start of your next turn.

Alternatively, you can aid a friendly creature in attacking a creature within 5 feet of you. You feint, distract the target, or in some other way team up to make your ally’s attack more effective. If your ally attacks the target before your next turn, the first attack roll is made with advantage.

Does the ally, the enemy, or both need to be within 5 feet of me when I take the Help action?

Restrict DHCP lease range using NetworkManager “Shared to other computers”

My computer has wireless internet access and I successfully share its connection using the built-in “Shared to other computers” feature of Network Manager:

enter image description here

However, I’m only serving a single host (via cross-over cable) and because DHCP is used, the IP address of my host is indeterminate. I can’t save ssh or VNC connections because the route will change without warning.

  • Can I restrict the DHCP range of shared connections to a single address?

My downstream host is Untouchable – it’s outside my scope to change its network configuration. What I need is more control over how Network Manager launches dnsmasq to support the internet connection sharing. It seems to do so entirely with command line parameters:

lar@rpi-lgr13-0199:~$   ps ax | grep dnsmasq   817 ?        S      0:00 /usr/sbin/dnsmasq --conf-file --no-hosts --keep-in-foreground --bind-interfaces --except-interface=lo --clear-on-reload --strict-order --listen-address= --dhcp-range=,,60m --dhcp-option=option:router, --dhcp-lease-max=50 --pid-file=/var/run/nm-dnsmasq-enxb827eb017088.pid --conf-dir=/etc/NetworkManager/dnsmasq-shared.d  1013 ?        S      0:00 /usr/sbin/dnsmasq --no-resolv --keep-in-foreground --no-hosts --bind-interfaces --pid-file=/var/run/NetworkManager/dnsmasq.pid --listen-address= --cache-size=0 --conf-file=/dev/null --proxy-dnssec --enable-dbus=org.freedesktop.NetworkManager.dnsmasq --conf-dir=/etc/NetworkManager/dnsmasq.d  6987 pts/2    S+     0:00 grep --color=auto dnsmasq 

Range intersection with bounding box?

I have a lexicographical order on $ n$ -tuples, where $ (x,y,\dots) > (a,b,\dots)$ if $ x>a$ or if $ x=a$ and $ y>b$ , and so on to the end of the tuple (I called it lexicographic because of its similarity to the natural order on strings of $ n$ characters). In this order I have a range, defined inclusively by a pair of tuples.

I also have a rectangular box in $ n$ dimensions defined by a pair of $ n$ -tuple corners. A tuple is in the box if every one of its elements is greater than the corresponding element in the first corner, and also less than the corresponding element in the second corner.

Given two tuples to serve as the ends of the range (under the lexicographic ordering), and another two tuples defining the corners of the box, I would like to determine if there is any overlap between the tuples in the range and the tuples in the box. What is the most elegant way to do this?

Does using a crossbow with the Sharpshooter feat change its range in underwater combat?

The Underwater Combat section of the Combat chapter (PHB p.198) reads:

A ranged weapon attack automatically misses a target beyond the weapon’s normal range. Even against a target within normal range, the attack roll has disadvantage unless the weapon is a crossbow, a net, or a weapon that is thrown like a javelin (including a spear, trident, or dart).

The Sharpshooter feat (PHB p.170) reads:

Attacking at long range doesn’t impose disadvantage on your ranged weapon attack rolls.

With both of those in mind, would a PC with a Hand Crossbow and the Sharpshooter feat be able to shoot further than 30 feet underwater?

Creating a priority search tree to find the number of points in the range [-inf, qx] X [qy, qy’] from a set of points sorted on y-coordinates

A priority search tree can be constructed on a set of points P in O(n log(n)) time but if the points are sorted on the y co-ordinates then it takes O(n) time. I find algorithms for constructing the tree when the points are not sorted.

I figured out a way to do this as follows:

  1. Construct a BST on the points. Since the points are sorted then it will take O(n) time

  2. Min-Heapify the BST on the x-coordinates This will take theta(n) time

So total time complexity will be O(n)

Is this a valid approach to construct a Priority Search Tree in O(n) time??