text:
Q: Использование VLOOLUP вместе с QUERY и IMPORTRANGE Подскажите пожалуйста, я делал отчёт используя SUMIF (ячейка C3), но сейчас понял, что если все листы за каждый месяц вставлять в один документ, то это будет не сильно практично и превышу лимит.
Поэтому решено на каждый месяц создавать отдельный документ и импортировать данные для расчёта.
Но оказалось, что SUMIF не работает с IMPORTRANGE :(
Изучив чат, понял что нужно делать через QUERY
Начал создавать формулу квери в ячейке H3, вроде бы в WHERE прописал все нужные условия, но выдаёт ошибку.
С чем это связанно, что сделал не так?
https://docs.google.com/spreadsheets/d/1Vb0cJbkjja537yl6HDYVcGiUUGZUgVAUiYcvstihMds/edit
Данные берутся от сюда:
https://docs.google.com/spreadsheets/d/1WHuE9dYyCCtrcKrQmq4i4wx_KhimiPIo5KBLNNAsDSw/edit

A: Пояснение к вопросу
IMPORTRANGE - является функцией импорта. Чем может сковать действия пользователя не только своими паузами по времени исполнения, но и отсутствием какого-либо представления об импортируемых данных.
QUERY, VLOOKUP и SUMIF - формулы другой категории, нежели IMPORTRANGE. И они в свою очередь разбирают типы данные по разному.
Пояснения про типы
Типов в Таблицах немного. Основную проблему представляют "нечисла". Т.к. между числами и датами есть сильное сходство. А еще между форматами чисел и строк при бездумном форматировании ячеек может исчезнуть визуальная разница.
Как использовать IMPORTRANGE
Ошибки из вопроса
Если взять "кусок" данных из примера и убрать форматирование, то видно, что в колонках смешанный тип данных. Строки, представляющие числа, числа и строки не числа.
Вот так работает SUM (взято для простоты формулы):

QUERY

VLOOKUP для точного поиска чисел

Как видно из примеров, формулы не только ломаются на смешанных типах, но и могут возвращать разные ошибки.
Особенность IMPORTRANGE
Пример переноса формата. Над таким иногда можно и голову поломать.

Формула старается точно перенести типы, которые встречает. А также она переносит формат данных. Неожиданное поведение, которое, кстати, приводит к неожиданным результатам

Использование
Нет никакой необходимости в особенном использовании IMPORTRANGE, но существуют общепринятые рекомендации

*

*Импортируйте на отдельный лист. Разделяйте ответственность каждого листа, чтобы быстро отслеживать типы данных, расчеты и представления.

*Делайте "жадное импортирование". Откажитесь от IMPORTRANGE для колонок или небольших диапазонов. Лучше разобрать результат импорта уже в текущей Таблице

*По возможности, не импортируйте данные из листов "новогодних ёлок". Каша, полученная от "накидывания" и "раскрашивания" данных может сломать что-то, что будет после импорта. Создавайте наборы данных, которые однозначно показывают, какой тип на листе, сколько точек после запятой, это дата или дата-время.

*Если вы ожидаете далее рассчитывать в QUERY, то необходимо позаботиться о консистентности типов данных в колонках - формула не любит смешивание типов.

Ответ
Разберитесь с типами данных в источнике.
Формулы на картинках отсюда https://docs.google.com/spreadsheets/d/1i9KfzdVhB42XS4_vI3XLE8lUpiF1-IB9cP_zl5yVj-M/edit?usp=sharing


text:
Q: Bizarre Flow error when deleting records that were queried: ENTITY_IS_DELETED I have a Platform-Event Triggered Flow which does the following:

*

*After insert of a Platform Event record...

*Get OpportunityLineItem records related to an Opportunity

*If the result of the above query was not null (i.e. at least 1 record exists), delete all the records from the Collection above, and then create new line items.

*If the result of the above query IS null, then don't try to delete any line items, just create new ones.

The problem: When testing this flow on an Opportunity record which has 1 line item, I'm getting the following error:

Error Occurred: The flow tried to delete these records:
00k2z000002co9wAAA. This error occurred: ENTITY_IS_DELETED: entity is
deleted

There are 2 strange parts to this error:

*

*If the record doesn't exist (it doesn't - I checked the database), why was it queried in the Get Element and attempted to be deleted??

*The existing line item record that SHOULD be deleted by the flow has a completely different record ID. Where on earth is the record ID in the error even coming from?? -> 00k2z000002co9wAAA ... It's like some ghost record hanging around.

Notes:

*

*There are some existing triggers on Opportunity, but none that will fire for this event as far as I can tell

*There are no triggers or other automation on OpportunityLineItem

redpajama_set_name: RedPajamaStackExchange


text:
Q: Inter PC connection using .net I am trying to set up a basic client-server connection on Linux between two PCs connected on the same network.
I successfully connected my client to my server on my local machine.
But when I give my client the server-PC's ip thanks to the 'ifconfig' command I have : Connection refused.
I already opened the port I use thanks to the command : sudo firewall-cmd --add-port=4242/tcp
Here is how I set the socket connection with "xxx.xxx.xxx.xxx" the IP address that I get from the 'ifconfig' command (maybe it's not the proper way to do it ?).
// Establish the remote endpoint
// for the socket.

IPHostEntry ipHost = Dns.GetHostEntry(Dns.GetHostName());
IPAddress ipAddr = IPAddress.Parse("xxx.xxx.xxx.xxx");
IPEndPoint localEndPoint = new IPEndPoint(ipAddr, 4242);

// Creation TCP/IP Socket using
Socket sender = new Socket(ipAddr.AddressFamily,
                    SocketType.Stream, ProtocolType.Tcp);

Here is the exception output:
SocketException : System.Net.Internals.SocketExceptionFactory+ExtendedSocketException (111): Connection refused xxx.xxx.xxx.xxx:4242


text:
Q: Simple SQL questions for date format how to find the minimum date from the date column? if the date contains the format of date is 1996-07-04.

A: Min function will give you the desired result.
e.g
SELECT  MIN(date) FROM table

A: Syntax :- SELECT MIN(COlumn_Name) FROM Table_Name
Eg:-       SELECT MIN(OrderDate) AS Min_OrderDate FROM Table_Name


text:
Q: Best existing license for closed-source code I'm creating a few closed-source applications on my own (no big company behind me) and am wondering exactly how to protect them. At the top of all the source code files I have this pretty basic copyright notice:
/*******************************************************
 * Copyright (C) 2010-2011 {name} <{email}>
 *
 * This file is part of {project}.
 *
 * {project} can not be copied and/or distributed without the express
 * permission of {name}
 *******************************************************/

However I'm really starting to think that's not enough. Without the money to get a lawyer, I'm interested in any closed-source license that essentially says "You can use it, and that's it". Finding one has been extremely difficult as I can only find open source license comparisons or "Find a lawyer" answers.
Is there any closed-source license that I can use that says something similar to this?

A: Something like this is adequate, depending on where you live:
/* Copyright (C) YoYoDyne Systems, Inc - All Rights Reserved
 * Unauthorized copying of this file, via any medium is strictly prohibited
 * Proprietary and confidential
 * Written by Elmer Fudd <efudd@yoyodyne.com>, September 1943
 */

(2016 update: The phrase "All Rights Reserved" used to be required in some nations but is now not legally needed most places. In some countries it may help preserve some of the "moral rights.")

This means you can't:

*

*Copy the file

*Print the file out, scan it and copy the image

*Print the file out, take pictures of it and distribute the film

*etc ...

However, take care to note that in some countries, there is no such thing as copyright. This is also completely in addition to a strong license that you ship with your product, which should go into greater detail.
These sort of 'license headers' are designed simply to alert someone who happens upon a file that they should not distribute it.
We use something very much like that in stuff that we have that needs to stay behind closed doors. For instance, it alerts someone to not post functions on Stack Overflow.
Someone who p0wns your dev server to get your code probably isn't going to pay attention to it, however.  Note, again, what you're describing is NOT a license, it's a per file assertion of copyright and specifically stating that the code is proprietary.

A: As per the related question on SO, this Creative Commons license looks relevant to you:
http://creativecommons.org/licenses/by-nc-nd/3.0/
[Note I originally mentioned the SO question as a comment above, but I'm adding as an answer to give it a bit more visibility, as it pretty much does answer your question]


text:
Q: JetBrains Rider | MassTransit Anonymous Type | MCA0003 | "Add Missing Properties" command does not autocomplete the properties Background
Operating Systems and IDEs Tested:
JetBrains Rider 2020.2.4 on Linux Elementary 5.1 Hera | Fail
JetBrains Rider 2020.2.4 on Windows 10 Home | Fail
Visual Studio Professional 2019 on Windows 10 Home | Success
Dotnet Version: .Net  Core 3.1
I'm following the tutorial Chris Patterson published on YouTube MassTransit Starting with Mediator.  The link is timestamped to where my issue occurs.
NuGet Packages Installed:

*

*MassTransit.AspNetCore on the API Project,

*MassTransit.Analyzers 7.0.4 on the API and Components projects, and

*MassTransit 7.0.4 on the Components project.

Issue
In the Request Client's GetResponse function, I created the anonymous type to represent the message contract.
I.e.:
var response = await _submitOrderRequestClient.GetResponse<OrderSubmissionAccepted>(new {});

The analyzer recognizes the properties are missing and provides the option "Add Missing Properties."  I clicked the button to add the properties; however, nothing happens.
Question
How can I troubleshoot this issue further or resolve the issue?  This seems like a fantastic feature, and I'd really like to take advantage of it.
Note
The issue is limited to JetBrains Rider 2020.2.3 and 2020.2.4 regardless of the operating system.  JetBrains has a ticket open as of 2020-10-07 RIDER-52072

A: I've had this issue as well, after updating today it works again.
Update: Build #RD-203.6110.173, built on November 24, 2020

A: JetBrains marked as "Fixed" on 11/11/2020.


text:
Q: Is every topos a sheaf topos with values in a well-pointed one? Here's a mix of heuristic and precise questions as I try to grapple with topos theory.
I try to think of topoi as two notions of "$1$" being glued at the hip. One is the "building block" $1$, generating the naturals, the ordinals, the cardinals... with all its usual arithmetic properties. This generates the set theory of a topos.
The other is the "all-encompassing" $1$, the highest truth value, the top element of a Heyting/Boolean algebra, whose subobjects form the algebra of truth values in the topos. This generates the logic of a topos.
Hence the set-theoretical properties (existence of an NNO, choice, CH, large cardinals...) happen "above $1$" and the logical properties (being Boolean, two-valued, well-pointed...) happen "below $1$" (whatever this means, this is just my heuristic).
Now Grothendieck topoi are defined as sheaf topoi with values in a certain well-pointed topos, namely $\textbf{Set}$. I can construct topoi that are not Grothendieck by taking a $\textbf{Set}$-like topos that is not $\textbf{Set}$, for example $\textbf{FinSet}$, and then considering sheaves valued in it. My first question is: are all topoi generated like this? Is every topos equivalent to a topos of sheaves on a site (its logic) with values a well-pointed topos (its set theory)?
Taking the functor $(-)^1$ of global elements seems to suggest the affirmative, as it is a logical functor to its image $\mathcal{I}$, which is well-pointed. Then the topos is, I assume, equivalent to the $\mathcal{I}$-valued sheaves on its Heyting algebra.
My second suspicion was that the logic and the set theory of a topos are independent of each other, but upon reviewing forcing, this doesn't seem to be the case. For example, following Mac Lane and Moerdijk, I can start with $\textbf{Set}$, value presheaves on a forcing poset $P$ in it ($\widehat{P}$), make it Boolean ($\widehat{P}_{\neg\neg}$) and mod out an ultrafilter ($\widehat{P}_{\neg\neg}/\mathcal{U}$). But then I've changed the set theory of a topos by only tinkering with its logic. In this light, forcing seems really unexpected and counterintuitive, by creating an interplay between what's happening "above $1$" and "below $1$". [I suppose this is exactly what the forcing theorem in material set theory says, though.] So my second question is: To what extent does forcing measure the interdependence of the logic and the set theory of a topos? Is there a theorem describing this?
It also surprises me that the two constructions $(-)^1$ and $/\mathcal{U}$ to collapse a topos to a well-pointed one don't coincide. For example, $\textbf{Set} \cong (\widehat{P}_{\neg\neg})^1$ and $\widehat{P}_{\neg\neg}/\mathcal{U}$ generally differ. Is there a deep reason for this? Is it perhaps because the ultrafilter-quotient construction is not as well-behaved and purely logical as I think?

A: A solution to your first question is given in "Sketches of an Elephant" by Johnstone, Example A4.4.2(d). If a topos $\mathcal{E}$ is the topos of sheaves on some internal site in a topos $\mathcal{S}$, then there is a natural geometric morphism $p : \mathcal{E} \to \mathcal{S}$. It turns out that there are toposes that do not admit geometric morphisms to Boolean toposes whatsoever. Two examples given by Johnstone are the effective topos and the topos of triples $(A,B,f)$ where $A$ is a set, $B$ is a finite set, and $f : A \to B$ is a function.
So these toposes cannot be written as a topos of sheaves over a Boolean topos (so also not over a well-pointed topos, because well-pointed toposes are Boolean).
Below is the argument that a geometric morphism $p : \mathcal{E} \to \mathcal{S}$ does not exist, for $\mathcal{E}$ the topos of triples $(A,B,f)$ as above and $\mathcal{S}$ a Boolean topos. I follow the Elephant, Example A4.5.24. Because subtoposes of Boolean toposes are again Boolean, we can assume that $p$ is surjective, so $p^*$ is faithful. Further, in $\mathcal{S}$ all objects are decidable, i.e. the diagonal embeddings $X \to X \times X$ have a complement. So the same holds for objects of the form $(A,B,f) = p^*(X)$. This condition implies that $f$ is injective, and as a result both $A$ and $B$ are finite. We conclude that there are only finitely many morphisms $p^*(X) \to p^*(Y)$, and because $p^*$ is faithful, it follows that there are only finitely many morphisms $X \to Y$, for $X,Y$ arbitrary. However, for $(A,1,f)$ with $A$ infinite, we get that there are infinitely many morphisms $1 \to p_*(A)$, so this gives a contradiction.


text:
Q: How to create a matrix with the increments within a loop in matlab? I have created one loop inside another in matlab, and i want to create a matrix inside this second loop that gives the values of the two increments plus a parameter that is being calculated. I made the following code but the matrix is just saving the last values, so it is not a matrix is a vector:
for inclin=29:1:39
    for alfa=1:1:90
        Ii_perc=...
        Di_perc=...
        Gi_perc=...
        r=...
        matriz=[inclin alfa r]
    end
end

So, i want to have a matrix with the different combinations of inclin/alfa/r that the loop gives in each loop, i.e, something like this:
 matriz =[29  1  0.34
          29  2  0.32
          29  3  0.40
          ...........]

I really need some help to solve this problem..
Thanks!

A: If I correctly you understand I can offer this variation:
Matrix = zeros((39-29+1)*90,3);
count = 1;
for inclin=29:1:39
    for alfa=1:1:90
        r=rand();
        Matrix(count,:)=[inclin alfa r];
        count = count+1;
    end
end

A: The problem is that
matriz=[inclin alfa r]

is a vector. If you want to append an additional row every loop iteration, you need to index it like this:
matriz(i, :)=[inclin alfa r]

Using the colon in this way says to assign the right hand side of the equation to the ith row of matriz.