calculating days past since creation time based upon the real todays date changing daily

Does anybody know a way of showing days past on view (rendering of a page), since the day an item was created.

I need this number for other calculations, to color format some usefull output.

I see a lot of example, mainly telling that [today] / today() can’t be used for that in calculated columns, some work around that require the item to be modified, but that’s not what i want, i like to show, when items are not modified. and people are late to respond i need to show that.

–update– This problem seams a bit more complex then i originally thought. As i wrote i want to see how long it takes before people respond. There’s a status(text) and modified(date) column, once text changes to it should stop counting, and preferably another column starts to counting between status assigned and status closed. (modified date might not be the best indicator for this is the status column, as modified might not always work(people need to have opened it). FYI there is also another column with a closed date, and closed is a status as well, so closed date could be retrieved from it.

Therefore i think client side rendering would not solve this. Yes those scripts work to so show days since, but at some point they should stop counting, i dont think i could do that with client side rendering

So i think i should do some kind of server side powershell script, and schedule it to run each day at 00:01 (not the best option perhaps but right now i dont know other solutions to this).

DNS and sometimes TCP packet are being sent out upon disconnecting and connecting wifi connection

I am monitoring my network interface and noticed that I can reproduce a behavior where some cryptic DNS packets are being sent out as well as TCP sometimes, without me opening any browser or application for that matter.

All I have to do is turn off WIFI and then turn it back on. Then a number of DNS packets are sent out automatically.

Here is the cap file:

enter image description here

This doesn’t strike me as normal behavior, why are DNS packets being sent out?.. Upon following the TCP packets I noticed that they are being sent to an EC2 instance on AWS.

Touchpad randomly disabled upon reboot on lenovo x1c7

Just switched from apple to lenovo (carbon 7th gen), installed Ubuntu (19.04, with 5.0.0-25-generic). However, the touchpad randomly is disabled upon reboot (it is activated in the system settings). After rebooting the touchpanel sometimes starts to work, sometimes doesn’t. This happens only with the ubuntu partition, not with Windows. Can somebody help?

Data Structure for applying transformations upon universe of tuples

Problem

I want a data structure which describes a universe of tuples all of length $ n$ , $ U$ . In $ U$ we associate each $ tuple$ with a non-negative value, which we will denote as $ U.count(tuple)$ . If $ U.count(tuple)=0$ , then we consider $ tuple$ to not be in $ U$ . I want to be efficiently update these $ U$ with five operations, some of which involve two fixed constants $ maxVal$ and $ minVal$ . (to clarify, $ maxVal$ and $ minVal$ should not change throughout the process, and should a tuple in $ U$ should never have a value which exceeds $ maxVal$ )

1) append(U,c): yields an updated universe $ U’$ , $ c$ should be below $ maxVal$ . For each tuple $ t$ in $ U$ , make a copy $ t’$ , and append $ c$ to $ t’$ . For each $ t’$ , $ U’.count(t’) = U.count(t)$ .

2) add(U,c,i): yields an updated universe $ U’$ . For each tuple $ t$ in $ U$ , we create a copy $ t’$ , and add $ c$ to $ t'[i]$ . If $ t'[i]<maxVal$ , then then $ t’$ is in $ U’$ and $ U’.count(t’) = U.count(t)$ . Otherwise $ U’.count(t’)=0$ and for our purposes we no longer need to keep track of it, and can exclude it from $ U’$ .

3) merge(U,i,j): yields an updated universe $ U’$ . For each tuple $ t$ in $ U$ , we create a copy $ t’$ , we pop $ t'[j]$ , and add its value to $ t'[i]$ . In this case, there can be multiple tuples $ t$ which correspond to $ t’$ in $ U’$ , thus let us initially say $ U’.count(t’)=0$ and then add to this. Now, if $ t'[i] < maxVal$ , $ U’.count(t’) = U’.count(t’) + U.count(t)$ .

4) finish(U,i): yields an updated universe $ U’$ . For each tuple $ t$ in $ U$ , we make a copy $ t’$ and delete $ t'[i]$ . Again, for the same reasons as in 2, let us initially say $ U’.count(t’) = 0$ . If $ t[i] > minVal$ , then $ t’.count = t’.count + t.count$ . At the end, all $ t’$ with non-zero count are included in $ U’$ .

5) combine(U1,U2): yields an updated universe $ U’$ , $ U_1$ and $ U_2$ should have same length tuples. For each $ t$ in $ U_1 \cup U_2$ , $ U’.count(t) = U_1.count(t) + U_2.count(t)$

My thoughts so far (messy)

If we did this naively, and represented $ U$ as a list of the tuples with non-zero, this would be horribly inefficient. Let’s assume $ U.count(t) \neq 0$ for all $ t$ that don’t exceed $ maxVal$ . Then, with $ maxVal = 10$ , a universe for tuples of length $ 4$ , that’s 10,000 if statements for the add operation…

I think one optimization would to have a tree, where the first level has nodes for each value of $ t[0]$ , and the child of a node are the next element in the tuple. I’d imagine you’d do this by having a list of all your first level nodes. Each node itself, is represented as a tuple of its value, and a list of its valid children, or $ U.count(t)$ for leaves. With add at lower levels, you have much less updates to do, and by ordering children in a fixed way according to their value, and keeping childless nodes as placeholders, your only need to do the validity check once too. Furthermore, to make append efficient, instead of having the levels be consecutive indices, we could make the order arbitrary, describe the tree-level to tuple index conversion with another list. For stuff like combine I am less sure what’s a good way to do things, maybe it would be beneficial to actually sum the counts of shared tuples, but maybe there are a clever cheats or work arounds…

My explicit questions

1a) Is there an efficient data-structure which performs these operations?

1b) Otherwise, are there some general rules of thumb for data structure which are relevant for this problem or my proposed solution?

2) Same as above but for the case where combine is applied to a very large number of universes, instead of just 2.

How much memory can a Mesmerized subject draw upon?

It’s been established that in this edition, you can’t Mesmerize someone into recalling things for you; if you say, “Tell me your mother’s maiden name,” what you get is “Your mother’s maiden name.” But it’s also clear that you can use what memories you have to accomplish a task; if I say, “Go to the ATM, withdraw $ 2000 dollars, and bring it to me,” that’s something that can happen — even though they’d need to remember their ATM code to do it. (This was demonstrated when, in the third episode of the L.A. by Night livestream, Victor Temple is unable to compel the reporter to say what he knew about the car theft, but he was able to command him to go get his notebooks and bring them to the club.)

So, if I Dominate someone to “sing the Star-Spangled Banner,” presuming they know the song, do they do so? Or do they struggle to harmonize on the phrase, “The Star Spangled Banner”? In broader terms, what is a good guideline for what the power of Mesmerism can and cannot accomplish in Vampire: the Masquerade 5th Edition?

Can a Tomelock swap the Book of Ancient Secrets invocation with itself upon level-up, and gain more than two ritual spells that way?

Eldritch Invocations (PHB, p. 107):

…Additionally, when you gain a level in this class, you can choose one of the invocations you know and replace it with another invocation that you could learn at that level.

Book of Ancient Secrets (BoAS) (PHB, p. 110):

Prerequisite: Pact of the Tome

You can now inscribe magical rituals in your Book of Shadows. Choose two 1st-level spells that have the ritual tag from any class’s spell list (the two needn’t be from the same list). The spells appear in the book and don’t count against the number of spells you know. With your Book of Shadows in hand, you can cast the chosen spells as rituals. You can’t cast the spells except as rituals, unless you’ve learned them by some other means. You can also cast a warlock spell you know as a ritual if it has the ritual tag.

On your adventures, you can add other ritual spells to your Book of Shadows. When you find such a spell, you can add it to the book if the spell’s level is equal to or less than half your warlock level (rounded up) and if you can spare the time to transcribe the spell. For each level of the spell, the transcription process takes 2 hours and costs 50 gp for the rare inks needed to inscribe it.

Assuming that the DM rules that the Rituals learned by BoAS don’t vanish upon dismissing (old) BoAS:

Is it possible by RAW to gain two new ritual spells with every warlock level by switching the BoAS invocation with the BoAS invocation upon level-up?

Bonus:

Assuming that the DM rules that the spells learned from BoAS vanish:

Can a warlock copy a spell from his Book of Shadows to his Book of Shadows and preserve the Spells in this way to get more ritual spells by switching BoAS with BoAS on level-up?

Looking to add a SharePoint list that is used to gather requests for tasks and notify upon completion

So I am working on a SharePoint list that is to work as a database for inspection requests. Along with all the information of the request, in the list there will be three columns that each specify the name of a person(engineer) on the network that is linked to the request. I would like these people to be email notified when submitting a new request and also be notified upon Approval/Rejection of the inspection. I am very new to SharePoint online and am not sure what the correct direction would be for this. I’ve heard there is built in task completion functions within SharePoint but am unsure if this would be ideal for my situation or how it would work(as a column or some external workflow or what)? Can anyone help lead me on the right path?