Tag: WebDev

I'm implementing a backfill process to re-enrich old commit data in my application. This involves: Marking old commits as "BACKFILL_PENDING" For each commit: delete existing enrichment data, then re-enrich with new data Entities: @Entity public class Commit { @OneToMany(mappedBy = "commit", cascade = CascadeType.ALL, fetch = FetchType.LAZY) private List<CommitFileCategory> fileCategories; @OneToMany(mappedBy = "commit", cascade = CascadeType.ALL, fetch = FetchType.LAZY) private List<CommitTechnology> fileTechnologies; } @Entity public class CommitFileCategory { @Id @GeneratedValue(strategy = GenerationType.IDENTITY) private Long id; @ManyToOne @JoinColumn(name = "commit_reference_id") private Commit commit; } @Entity public class CommitTechnology { @Id @GeneratedValue(strategy = Generatio

I have a custom bit of code in App.xaml that creates an override for my TabView. It is a hard style application without being referenced, which I assumed would propagate to other elements within it. <Color x:Key="TabViewBackgroundLight">lightGrey</Color> <Color x:Key="TabViewBackgroundDark">#1f1f1f</Color> <Style TargetType="Layout" Class="TabView.Header" ApplyToDerivedTypes="True" x:Key="TabViewHeaderOverride" > <Setter Property="BackgroundColor" Value="{AppThemeBinding Light={StaticResource TabViewBackgroundLight}, Dark={StaticResource TabViewBackgroundDark}}" /> </Style> <Style TargetType="ContentView" Class=&quo

I'm trying to make a doubly linked hash table, sort of. At least, within each bucket it is doubly linked. My issue is when I am trying to assign the next/previous pointer to of the top of the bucket. The code that is causing the issue is below. At first, I thought it was because I was trying to manipulate a vector directly, so I made a temp pointer, but the same issue arose. Specifically, when I was trying to manipulate the next or previous pointer of the node at buckets[h]. I get the feeling that the issue is quite basic, but I can not figure out what it is. Node* new_node = new Node; new_node->data = x; new_node->next = buckets[h]; new_node->prev = NULL; buckets[h]->prev = new_node; // this is the problem line buckets[h] = new_node;

Context Building an electronic invoicing integration for Ecuador's SRI (Servicio de Rentas Internas) tax authority in NestJS involves several non-trivial challenges: Generating valid XML documents for different voucher types (invoices, credit notes, debit notes, receipts, delivery notes) Signing XML with XAdES-BES using a .p12 certificate Communicating with SRI's SOAP Web Service (reception + authorization) Handling asynchronous authorization with retry logic Supporting multiple tenants (companies, branches, emission points) from a single API instance Generating RIDE PDFs (Representation of Electronic Documents) using dynamic templates What is the best architecture to implement this in NestJS, and is there an open-source solution available? Additional context The SRI

I am building a small Hilbert-style proof assistant in Python. Each proof is a list of lines, where every line records a line number, a proposition, and a justification string. There are three kinds of justification: axiom instantiation, modus ponens (which I call impl_elim, for "implication elimination" - a more pedagogical term), and arbitrary substitution into a prior line. I recently added an assume method that lets me introduce a proposition as a hypothesis mid-proof. The current output for the last few lines of a sample derivation looks like this: 12. ((C → D) → (B → (C → D))) 1.[B:=(C → D), C:=B] 13. (C → D) assumption 14. (B → (C → D)) MP[13, 12] I want two things, and I am not sure how to approach either of them. First, when a line is introduced by assume, I want the justification to read prop ⊢ prop — that

I am working on a private internal publishing tool that uses the YouTube Data API to upload videos to our own organization’s YouTube channel. The client uses OAuth 2.0 authorization and `videos.insert` to upload our own educational videos. The tool is not public-facing, does not manage third-party channels, and does not commercialize YouTube data. Because uploads from unverified API projects are restricted, we submitted the YouTube API Services Audit and Quota Extension form to complete the compliance review and request additional quota. Timeline: - We submitted the audit/quota request through the official form. - The YouTube API Services team replied asking for a screencast/video recording showing how the API client uses YouTube API services to upload videos, including the end result. - We provided the requested screencast and supporting material. - They later asked us to confirm the quota amount, since the minimum quota allocation

Imagine I have a long string 10 kb characters, filled with random ASCII characters. And I want to lowercase them. One way i could do that is by using a simple operation like: inline char lowercase(char c) { return c + 0x20 * (c >= 'A' && c <= 'Z'); } Another way would be to create a lookup table like: constexpr unsigned char table[] = { 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, ..... } Given some std::string src = "some_random_characters"; This would require memory accesses like table[src[i]] and the other would require lowercase(src[i]) which do you expect to be faster? Whats a good startegy to implement lookuptable for fast accesses?

Develop a function that receives a dataset (df) and that: Removes null values ​​from the dataset. Removes columns ["name"] Converts categorical columns ["mfr"], ["type"] to numeric. Considers the ["rating"] column as ground truth. Allocates 90% of the dataset for the training process, also using the parameter random_state=21 Trains a DecisionTreeRegressor estimator with parameters max_depth=100 and random_state=21 Returns the mean_absolute_error for this estimator. Return the mean_squared_error for this estimator. Note: You can use pandas' pd.factorize function to convert categorical columns to numeric.

I'm currently learning C# (Day 2) and experimenting with building small utility components. I wrote a simple file‑system wrapper with interfaces, and I’d appreciate feedback on: Whether the structure makes sense Naming conventions Whether the interfaces are meaningful What concepts I should learn next to improve this kind of code using System; using System.IO; using System.Reflection; using System.Runtime.CompilerServices; using System.Runtime.InteropServices; namespace EngineTools2 { public interface IFileSystem { bool pathExists(string path); void deleteFile(string file); void createFile(string file); void moveFile(string source, string destination); void deleteFolder(string directory); }; public interface IFileStreamer { }; public class FileStreamer : IFileStreamer

I wrote the following program, which is accepted by clang and msvc, but is rejected by gcc. Demo template<typename... T> double BigFunction(double (*func)(const T...), double var) { return {}; } double f3(double, int) { return {}; } int main() { BigFunction(f3, 3);// GCC: no but Clang + MSVC: ok } GCC says: <source>: In function 'int main()': <source>:15:16: error: no matching function for call to 'BigFunction(double (&)(double, int), int)' 15 | BigFunction(f3, 3);// GCC: no but Clang + MSVC: ok | ~~~~~~~~~~~^~~~~~~ • there is 1 candidate • candidate 1: 'template<class ... T> double BigFunction(double (*)(const T ...), double)' <source>:3:32: 3 | template<typename... T> double BigFunctio