whiteboard | A virtual whiteboard for keeping track of standup items

Based on the code you've shared, it has to do with how you're updating the state if the transcript is equal to kitten.

Essentially, the logic you've written says, on render, if the transcript is kitten, update the state. BUT, when you update the state, that will re-render, and hit that logic again... and again... and again. The solution here is to wrap that in a useEffect – React Docs explain it best but in simple terms, you want to "do something" as a side effect of "something else".

In this case, if the transcript updates, you want to check the state of transcript, and if it meets a condition, you want to update your state:

ASSERT on line 860 of the Whiteboard.cpp gets triggered when the sensor cannot handle a notification from a subscription in a timely manner. I did notice a "red flag" in your description: "... and busy waiting for completion ..." which is probably the reason for it.

The Movesense framework is fully asynchronous which means that any kind of busy-looping is strictly forbidden since it prevents normal operation of the sensor (like the above notification handling).

To avoid busy looping, trigger the next asyncPut in the onPutResult() callback and make sure to specify the AsyncRequestOptions::ForceAsync option to the call.

Full disclosure: I work for the Movesense team

Based on my previous answer I will just translate the code to c++

The Whiteboard has (to limit resource use on sensor) the maximum packet size which leads to maximum payload size. Currently the WB_MAX_MESSAGE_PAYLOAD_LENGTH is 466 bytes.

The Whiteboard limitations are defined in the file WhiteboardConfig.h

Full disclaimer: I work for the Movesense team

You are probably binding to 127.0.0.1 which will make your service available to your localhost only. Try binding to 0.0.0.0.

Specifically here:

This rather terse code implements a dynamic programming algorithm that has been optimised to reduce the space usage from O(n) to O(1). First I'll describe an equivalent DP and how it can be computed, and then show how the many separate cases it needs to handle can be viewed as instances of a smaller number of more general "case templates", which kamyu's code exploits for concision.

The question frames the problem as finding a minimum-cost way to replace each "?" character with a J or C, but we can alternatively frame it as finding a minimum-cost way to replace all characters of the input string S, provided that we never change a J to a C or vice versa -- that is, we can imagine ourselves "replacing" an existing J with another J, or an existing C with another C. In fact, that "provided" clause can even be removed: We can get what we want by permitting all possible replacements, including a J to be changed to a C or vice versa, but prevent these undesirable changes from actually appearing in any optimal solution by penalising them with enormous costs.

Let's define the function f(m, a) to be the minimum cost of a solution to the subproblem consisting of the first m+1 characters of the input string S, under the assumption that we replace the final (i.e., (m+1)-th) character with a, which must be either "J" or "C". (Why m+1 and not m? That just makes code with 0-based array indices simpler.) Replacements that leave this character unchanged (J->J or C->C) are allowed, as are replacements of "?" characters to either J or C. The way we will prevent changing an existing J to a C or vice versa is to assign infinite cost to such a replacement -- this will result in this choice never being taken, since another lower-cost choice is always available.

We can compute values of f(m, a) as follows. I'll use Python-like pseudocode that writes to a DP matrix dp[][].

The highest-priority rule is that we should always assign infinite cost to any attempt to change a hardwired letter to the other letter. Other than that, the cost of assigning a particular letter depends on the preceding letter -- unless there is no preceding letter because we are at the very start, in which case we know that the cost is zero:

I manage to get the 4 coordinates of the whiteboard. I have used adaptive thresholding to detect the edges rather than canny-edge detection, not sure whether the methodology is correct or not, but it is giving the required results. Here's the code for the same.

The message is a false positive. The fix for the problem is available in the latest preview version of Visual Studio:

Microsoft Solution - Bhavya Udayashankar [MSFT] Closed - Fixed ···

A fix for this issue has been released! Install the most recent preview release from https://visualstudio.microsoft.com/downloads/. Thank you for providing valuable feedback which has helped improve the product.

See issue "XLS1106 on virgin C# WPF .Net application" on the Visual Studio Developer Community site.

In the simplest applications without any data bindings set up, there is no need for a data context to be set, and the warning given can be safely ignored.

Note that you should NOT follow the advice of the comment above telling you to add DataContext = this; to the window's constructor for real-world applications. Write a proper view model object type, and create an instance of that to set as your DataContext reference.

Having tried all the plugins like ts-ebml and web-writer, I found the only reliable solution was to upload the video to my server and use ffmpeg with the following command