oto | ♪ A low-level library to play sound on multiple platforms | Audio Utils library

I'm trying to use a regular expresion to capture the text between the last tag and last tag. I tried using .*? or ((?:[\s\S](?!<\/tabmat))+?Input Conditions[\s\S]+?)[]*(?=) but that hasn't worked. It selects all the text in between the first tabmat tag and continues to the end of the first tag. If you look at the XML test example, a tag is opened and has multiple tags. The regex selects the text up to the first tag. but doesn't capture the last .

Example: End Text

REGEX: ((?:[\s\S](?!<\/tabmat))+?Input Conditions[\s\S]+?)[]*(?=)

I can't figure out what REGEX I should use. Your help is appreciated.

Example XML:

I used following code to generate the sets for more than 5 groups:

I used following code to generate the sets:

I've created small go application. Few days back I upgraded from go 1.15 to 1.17 and I also upgraded packages with go get -u. After the changes I have 2 require blocks in my go.mod file. Why is it? What does it mean? Is it ok or something is broken?

Application still builds correctly.

go.mod file:

I have an object like this below:

when recording the microphone, the recorded chunks was raw PCM8 format and I was able to send it and play it by changing bitDepthInBytes = 2 without any noise, but when I've sent encoded opus frames through a network and decode them to PCM16, I couldn't play them unless I convert them to PCM8 but it was noisy. Here is my code:

I want to print only first 10 pages of a word document to PDF/TIFF images. I was able to print the word document using following code.

I'm a "noob" Java student who is trying to complete the next problem, it's about finding palindromes. I've tried to do it but i can't get the solution! As I said I'm "noob", I only use the "standard" public class, I don't know how to explain it, but I'm still learning, so I don't know even how the functions work, you can make it complex, but not too complex xD. Here it is, thank you people:

A palindrome is a word that is typed the same way from left to right and also from right to left, for example: Y, EE, ALA, ANNA, ROTOR or AAAAAA

Ask a word to the user and identify if it is a palindrome or not, and also show how many diferent palindromes the word has inside.

I/O examples:

I need to perform an update in 21 rows. The way I came up with is using a query to get the new values and the id where to update the table. However, I'm getting UPDATE/MERGE must match at most one source row for each target row.

The data looks like this: