## Editing HTML structure of Gutenberg layout recent post?

I used gutenberg layout method with wordpress editor to call recent posts. WordPress automatically generated this HTML structure.

``<ul class="wp-block-latest-posts__list has-dates wp-block-latest-posts">    <li>      <div class="wp-block-latest-posts__featured-image">        <img loading="lazy" width="1024" height="663" src="" alt="" class="wp-image-73"              srcset="" sizes="(max-width: 1024px) 100vw, 1024px">      </div>      <a href="">SOME TEXT</a>      <time datetime="2021-05-08T17:21:16+00:00" class="wp-block-latest-posts__post-date">May 8,             2021</time>      <div class="wp-block-latest-posts__post-excerpt">SOME TEXT</div>    </li> </ul> ``

Now I need to group anchor, time and the last div tag in another div tag for my CSS design. Problem is I do not know how to edit html structure of recent post with wordpress editor. Should I code?

[![enter image description here][1]][1]

clicking over SOME POST doesn’t give me a chance to create a new div there.. I use underscore theme.

I DON’T WANT USE PLUGINS IF IT IS POSSIBLE WITHOUT PLUGIN [1]: https://i.stack.imgur.com/5ZSPS.png

## Advice for a good sitemap structure

Who can me explain sitemaps? I am interested in the more complexed structure.

For example: on the homepage I have hyperlink to a page with categories A category can have a subcategory or a product.

The url structure look like this

• Level 0: https://www.example.com/
• Level 1: https://www.example.com/categories
• Level 2: https://www.example.com/categories/subcategories
• Level 2: https://www.example.com/categories/product1 And so one.

What is a good structure for the sitemap?

I know the structure of a simple sitemap. But it are many urls…

Do I create an index sitemap with and split up everything like a sitemap for the homepage One sitemap for the categories and one for the products?

## How to structure MySQL database tables for users and how to handle adding/removing permissions?

I am making a database structure for users, who can become part of a group, and within that group the admin of the group can assign as many permissions to a user as they would like.
This part seems easy. I have 4 tables:

`` USERS           GROUPS             PERMISSIONS      PERMISSIONS_GROUPS -------  ---------------------    --------------    ------------------- | UID |  | GID | UID(creator) |   | PID | NAME |    | UID | GID | PID | ``

I think this is the best way to handle this. I have a few questions about how to handle permissions for the creator of the group, and how to handle permissions if I were to delete a permission or add a permission.
For instance, when a user makes a group. Do I query all of the permissions and in a `while` loop insert a `PERMISSIONS_GROUPS` record for every row in the `permissions` table? If I add a new permission, do I have to query every `UID` from the `GROUPS` table and run a `while` loop to insert the new permission into `PERMISSIONS_GROUPS`? I just want to make sure I am not missing something simple here. For structure/scripting I am using `MySQL` and `PHP`.

## Structure of multilingual and multiregional directory listing website for translation

What is the best translation structure for our multilingual and multiregional directory website? Let’s say our listing owners as members of our work team are from around 20 different countries with different languages and I want each of them to submit their listings in the official language of their country and all the listings are aggregated on our site which has the default English language. Our directory site, whose default language is English, to be translated into at least twenty other languages. In this case, we want the listings to be usable both locally for the country of listing owners and for other countries globally. Do I need to use WordPress MULTISITE? Should I use multiple separate sites that link to each other or can I use a special plugin like WPML? I would be grateful if you could guide me in this regard.

## Like the title says:

How do I edot this texconv "IMGtoBC3.bat" file so it "READS FROM & PRESERVES the directory structure when writing the "resulting" dds files?

I have a large folder/sub-folders with many tiff’s that "have the same file name" divided up into "sets".

These dds files are for custom textures in a unity game, file naming is a forced event, but "sorted/selected" by folder.

I have about 3000 file sets ready to convert and I’m not doing them 1 by 1 in Nvidia tool (I hope) and AMD tool and the game have a MAJOR conflict (its as a no go)

BONUS points to anyone that could show me this "bat" file using unity’s new tree of "CRUNCH" cmd line dds compressor/encoder. Suggestions of other tools: I have tested over 50 apps, for my needs its: Nvidia, texconv and then crunch in level of quality/support

## HERE IS THE CODE:

``ECHO OFF Setlocal EnableDelayedExpansion  ::Variables SET @FORMAT=BC3_UNORM SET @InputFolder=%~dp0Input_IMG_TO_BC3\ SET @OutputFolder=%~dp0Output_DXT5_BC3\ SET @TEXCONVEXE=%~dp0texconv.exe SET @TEXCONVEXE02=%~dp0texconv.exe :: Check for texconv.exe IF EXIST "%@TEXCONVEXE%" SET @TEXCONVEXE=1 IF "%@TEXCONVEXE%"=="1" GOTO EXESTATE_1  :EXESTATE_0 TITLE - ERROR! texconv.exe not found!!! COLOR 04 ECHO: && ECHO: && ECHO: ECHO                 === ERROR! texconv.exe not found!=== ECHO: ECHO     Install Path: "%~dp0texconv.exe" ECHO: ECHO    The script needs texconv.exe in order to work properly. ECHO: ECHO    Please make sure texconv.exe is in: "%~dp0"  ECHO: && ECHO:  GOTO CONT01   :EXESTATE_1 TITLE - Texconv.exe found!!! COLOR 0A  ECHO: && ECHO: && ECHO: ECHO                 [ texconv.exe Is Installed! ] ECHO: ECHO     "%~dp0texconv.exe" ECHO: GOTO CONT00 :CONT01 ECHO: && ECHO: ECHO        Please copy/move the missing texconv.exe executable to where the script needs it to be and refresh this window. ECHO: :CONT00 IF "%@TEXCONVEXE%"=="1" GOTO START ECHO: && ECHO: && ECHO     [Press any key to refresh the window] && PAUSE>NUL GOTO SetTexConvPath  :START  :: Customize CMD Window TITLE HumanStuff TexConv Batch Directory Script v1.0.2 PROMPT \$  G COLOR 04 CLS  :: Make The Folders IF NOT EXIST "%@InputFolder%" MKDIR "%@InputFolder%" IF NOT EXIST "%@OutputFolder%" MKDIR "%@OutputFolder%"  ::Run TexConv.exe ::-srgb was added because PNG images were getting high contrast colors ::Sorry about the messy code but this was harder to do than it sounds  FOR /R "%@InputFolder%" %%i IN (*.*) DO ( set word=%@OutputFolder% set str=%%~dpi CALL :REPLACESTRING SET @IFOL=!@OSTRING! CALL :MKFOL SET @ISTRING=%%i CALL :TexConv01 )  PAUSE GOTO SCRIPTEND  :MKFOL IF NOT EXIST "%@IFOL%" (     MKDIR "%@IFOL%" ) GOTO SCRIPTEND  :TexConv01 IF NOT "%@LOGO%"=="" SET @LOGO=-nologo "%@TEXCONVEXE02%" %@LOGO% -srgb -nogpu -pow2 -vflip -if triangle -bc u -f %@FORMAT% "%@ISTRING%" -o "%@OSTRING%" -y ECHO: SET @LOGO=  GOTO SCRIPTEND  :REPLACESTRING call set str=%%str:%@InputFolder%=%word%%% set @OSTRING=!str:~0,-1! GOTO SCRIPTEND  :SCRIPTEND $$```$$ ``

## Big-O of iterating through nested structure

While trying to understand complexity I run into an example of going through records organized in following way:

``data = [   {"name": "category1", "files": [{"name": "file1"}, {"name": "file2"}],   {"name": "category2", "files": [{"name": "file3"}] ] ``

The task requires to go through all file records which is straight forward:

``for category in data:   for file in category["files"]:     pass ``

It seems like complexity of this algorithm is O(n * m), where `n` is length of `data` and `m` is max length of `files` array in any of `data` records. But is O(n * m) only correct answer?

Because even there are two for-loops it still looks like iterating over a global array of file records organized in nested way. Is it legit to compare with iteration over different structure like that:

``data = [   ('category1', 'file1'),   ('category1', 'file2'),   ('category2', 'file3'), ] for category, file in data:   pass ``

…where complexity is obviously O(n), and `n` is a total number of records?

## Visualizing a directory structure as a tree map of rectangles

There’s this nice tool called WinDirStat which lets you scan a directory and view files in a rectangular tree map. It looks like this:

The size of each block is related to the file size, and blocks are grouped by directory and coloured distinctly according to the top level directory. I’d like to create a map like this in Mathematica. First I get some file names in the tree of my Mathematica installation and calculate their sizes:

``fassoc = FileSystemMap[FileSize, File[\$  InstallationDirectory], Infinity, IncludeDirectories -> False]; ``

Level `Infinity` ensures it traverses the whole tree. I could also add `1` to ensure the association is flattened, but I want the nesting so I can assign total sizes per directory.

I can find the total size which I’ll need to use to scale the rectangles:

``QuantityMagnitude[Total[Cases[fassoc, Quantity[_, _], Infinity]], "Bytes"] ``

My idea is to recursively apply this total. In theory I could use this to do something like this with a tree graph and weight the vertices by size, but I want to convert this into a map of rectangles like in WinDirStat. While the colour is obvious – each level 1 association and all its descendants gets a `RandomColor[]` – I’m not sure how I should go about positioning the rectangles in a `Graphics`. Any ideas?

## Data structure for efficient group lookup

I need a data structure, which allows efficient queries for ‘give me the group of `x`‘.

Let me give you an example:

``Group 1: [a, b, c]  Group 2: [d, e] Group 3: [f]  getGroupOf(d) -> [d, e] ``

There are no significant constraints on storage or construction time. I only need `getGroupOf` to be `O(logn)` or faster.

I am thinking about using a `Dictionary<Element, Set<Element>>` where entries for all elements in a group share the same set reference. This would make lookup effectively `O(1)` or `O(logn)` depending on the dictionary implementation, but would result in a lot of entries.

This feels fairly bloated, and I am wondering: is there is a more elegant data structure to accomplish this?

## When would you use an edge list graph data structure instead of an adjacency list or adjacency matrix?

In what applications would you choose an edge list over an adjacency list or an adjacency matrix?

Sample Question, VisuAlgo: Which best graph DS(es) should you use to store a simple undirected graph with 200 vertices, 19900 edges, and the edges need to be sorted? Suppose your computer only has enough memory to store 40000 entries.

There are three choices: adjacency lists, adjacency matrix, and an edge list.

Edge lists are the correct answer here because sorting by weight is most efficient, but what are some other use cases?

Thanks!

## Is there a way to store an arbitrarily big BigInt in a bit sequence, only later to convert it into a standard BigInt structure?

I am trying to imagine a way of encoding a BigInt into a bit stream, so that it is literally just a sequence of bits. Then upon decoding this bit stream, you would generate the standard BigInt sort of data structure (array of small integers with a sign). How could you encode the BigInt as a sequence of bits, and how would you decode it? I don’t see how to properly perform the bitwise manipulations or how to encode an arbitrary number in bits larger than 32 or 64. If a language is required then I would be doing this in JavaScript.

For instance, this takes bytes and converts it into a single bit stream:

``function arrayOfBytesTo32Int(map) {   return map[0] << 24     | map[1] << 16     | map[2] << 8     | map[3] } ``

How would you do that same sort of thing for arbitrarily long bit sequences?