I have two types of pages.
- A page with a collection of items, for every one I want to add a link to watch a video
- A landing page for each video
I have many items in the page 1. I would like to have only one page of type 2 and somehow send parameters to that page, so it is dynamically generated.
The page 2 is very simple: It has a title and a shortcode to my video plugin. What I would like to change is the link inside the shortcode and the title
Page 2 body Title that should change
So I am making a 3D batchrenderer for my engine, and the basic concept is that we make large enough VBO and IBO to accompany all the vertex data(positions, normals, uv etc.) and update the VBO using
glMapBuffer or using
glbuffersubdata everyframe if we want to make any changes, but in this case the pattern of the IBO (Index Buffer) is predefined (i.e. we assume we have quads and fill it with 012230 for the entirety of the IBO size) but when using 3D models this won’t be the case the IBOs data would be different, so how do I change the IBO data if I instantiate a new model or suppose if I am generating a UV sphere and want to change it’s subdivisions? I have no idea how to deal with dynamically changing(need not be frequent) indices data when using VAOs, VBOs and Index Buffers. afaik we cannot map the ELEMENT_ARRAY_BUFFER, and
glDrawElements does accept a pointer to indices data but only when we are not using VAOs and VBOs, if we are using them it takes the last argument as a pointer offset in the currently bound ELEMENT_ARRAY_BUFFER. So what’s the best way to deal with dynamic indices?
I have a timeseries pandas dataframe which dynamically increases the columns every minute as well as adds a new row:
timestamp 100 200 300 2020-11-01 12:00:00 4 3 5
timestamp 100 200 300 500 2020-11-01 12:00:00 4 3 5 0 2020-11-01 12:01:00 14 3 5 4
The dataframe has these updated values and so on every minute.
so ideally, I want to design a database solution that supports such a dynamic column structure. The number of columns could grow to over 20-30k+ and since it’s one minute timeseries, it will have 500k+ rows per year.
I’ve read that relational db’s have a limit on the number of columns so that might not work here, but also, since I am setting the data for new columns and assigning a default value(0) to previous timestamps, I lose out on the DEFAULT param that’s there on MySQL.
Eventually, I will be querying data for 1 day, 1 month to get the data for the columns and their values.
Please suggest a suitable database solution for this type of dynamic row and column data.
I am currently checking if a position in the NavMesh is reachable. It is reachable without the NavMesh obstacles. But the moment I add it, NavMesh’s
CalculatePath() continues to return true. Note that I do have those obstacles to have carving set to true. How do I solve this problem?
I have setup dynamic port forwarding. Using SSH. Although nmap connect scans over proxychains return accurate results, a SYN scan does not.
I have a use case where I wish to create a table for each entity to which the underlying application that owns this entity will publish records.
This table has a fixed structure, so if there are 5 such entities in my system, there will be 5 different tables with the same schema.
The schema is generic with one of the columns in the schema as JSON for flexibility. I do not expect queries based on the fields in the JSON. I expect the following queries on each entity:
- On the auto-increment id primary key column with LIMIT and OFFSET where I need to read X rows from the record with id Y.
- On the creation date column with LIMIT X.
I expect thousands of such entities to be created on the fly so in turn there will be thousands of tables in the database.
In future when one of these entities have fulfilled their purpose, the table would be simply deleted.
I expect most of these tables to have not more than 100 rows while there will be a few with at least 1M rows as time goes by. This design makes data easy to query as my application can determine the table name from the entity name.
Is this a bad design?
Is there a limit to the number of tables in a database in RDBMS (the above design is with Postgresql 11 in mind) keeping performance in mind?
Should I use any different datastore to achieve this other than RDBMS? Any suggestions?
This is my website- https://aceworkz.promo/. I used WPForms to create form across all the websites. After submitting information the user will redirect to this page-https://aceworkz.promo/amazon-2/. When the user selects a specific product he will redirect to the Amazon review page. The review link will be different for every product. My question is how can I add a dynamic button link for each product? I’m using the Elementor page builder to create this button. Thanks guys for your help!
I have to call a procedure inside a procedure and replace all single quotes inside the parameter to double quotes. Ex: When i call my original proc begin data(10,’"push’s the data"’);end; It throws error due to single quote and i cannot change the string manually at runtime by adding double quote like push”s. I tried replacing inside procedure but probably because the string is passed first it wont take changes.
I wish to call this procedure inside another and using maybe dynamic sql replace single quotes with double.
Something like this:
create procedure dynamic_proc begin execute immediate ‘begin data(id,’||’replace(string,CHR39,CHR39||CHR39)’ AS string)’||’ end;’ end;
So basically the parameter string which is being passed in procedure data needs to have all single quote replace with double at run time.
I came across the following question while practising for my final algorithms exam, but I am unsure how to get a linear time complexity for this problem. I assumed it would require checking which tiling patterns are compatible with each other, but get a bit stuck on how to proceed.
I have been learning graph algorithms, and the concept of dynamic programming is quite succinct. However, I read that Bellman Ford is a form of dynamic programming. I am not sure why since given so many unnecessary re-computations, it is not exactly efficient in the likes of other dynamic programming that computes the sub-problems bottom up to the final problem. For example, FloyWarshall has a well defined sub structure of considering all other vertices up to k.
But for Bellman Ford, the implementation is not really relying on any computed sub problems, it is just a brute force algorithm that correctly returns the shortest path but it is not correctly computing the sub-problems in some correct order needed by a dynamic programming algorithm?