xp | Please see github

There isn't a Genera topic on stackoverflow, but I thought I'd take the chance that one of the (probably) 5 people in the world using it might be here; no harm in trying.

I've run into the situation where a few of the systems I'm working with use pretty printing, which is not implemented on Genera. I've managed to work around the problem in my own system by using the predecessor of pretty printing, XP. Looking at the code in xp-code.lisp and comparing it to that in CCL, it's clear where CCL got its pretty printing functions from.

One solution, now proving inadequate, is to have a top-level eval that does an (xp::install :package my-package) and resume from the redefinition warnings. The problem is that when one of the third-party systems is compiled, they too complain about pretty printing features that are not implemented, so I'd have to install XP in each of these other packages that want pretty printing.

What really needs to happen is for XP to be installed in the common-lisp package, because all of these other systems are going to :use :cl and expect to have a fully functional pretty printing system.

That's not so easy though; the CL package is locked and each XP symbol requires multiple confirms, and a type 'yes', to get it into the CL package. The documentation for External-only Packages and Locking suggests that:

To set up an external-only package, it can be temporarily unlocked and then the desired set of symbols interned in it

but no where does it say how to unlock a package, and the Document Examiner isn't turning up much.

I also have to stop and wonder if I'm barking up the wrong tree. XP was written with Genera in mind, and there are conditionalisations in the code for the platform. It shouldn't be so hard to install using the install function; and I wonder if I'm missing something obvious.

Does anyone out there know how to unlock the CL package, or the proper way install XP in Genera? The included instructions for XP appear to be out of date.

My application consists of calling dozens of functions millions of times. In each of those functions, one or a few temporary std::vector containers of POD (plain old data) types are initialized, used, and then destructed. By profiling my code, I find the allocations and deallocations lead to a huge overhead.

A lazy solution is to rewrite all the functions as functors containing those temporary buffer containers as class members. However this would blow up the memory consumption as the functions are many and the buffer sizes are not trivial.

A better way is to analyze the code, gather all the buffers, premeditate how to maximally reuse them, and feed a minimal set of shared buffer containers to the functions as arguments. But this can be too much work.

I want to solve this problem once for all my future development during which temporary POD buffers become necessary, without having to have much premeditation. My idea is to implement a container port, and take the reference to it as an argument for every function that may need temporary buffers. Inside those functions, one should be able to fetch containers of any POD type from the port, and the port should also auto-recall the containers before the functions return.

Assuming xmm0 is the first argument, this is the kind of code I want to produce.

I have an XML like:

I am using the latest version of foolbox (3.3.1), and my code simply load a RESNET-50 CNN, adds some layers for a transferred learning application, and loads the weights as follows.

I have a dataframe below and I want to remove duplicates based on columns country and year, and keep the non NA values for the columns 3 to the last column. If all rows within (country, year) are NA, the value for the row should be an NA as well.

so Im trying to make an interactive button that would be placed on the bottom of my screen and when clicked, a semicircle is created around it. this has buttons inside, so its kind of a navigation menu. Im now struggling with the math behind it. Right now, the buttons are distributed all around the circle, however i want them to only be placed in the upper part of my semicircle. This is the code i have so far:

As I read this article, it is enough to download most recent MSVS 2022 and then install toolset C++ Windows XP Support for VS 2017 (v141) tools [Deprecated].

After that in Visual Studio inside project properties I set this toolset. According to linked article it is enough to compile C++ app with XP support.

But after my .exe file is created if I run it on XP 64-bit SP2 then it shows error that CompareStringEx function is not found in KERNEL32.DLL.

Hence it appears that it is not enough to use this toolset. Something else is needed.

In some other places I see that one needs also to add define /D_USING_V110_SDK71_ when compiling and option /SUBSYSTEM:CONSOLE,5.01 when linking. In my project properties I also tried to add this two options, but still CompareStringEx is inside import table of final application.

As suggested by @BenVoigt, I did defines /DWINVER=0x0502 /D_WIN32_WINNT=0x0502. Also set C++ standard to /std:c++14 (I would set C++11 but this MSVS version allows to set only C++14 at minimum). Still some non-XP symbols remain in final EXE like InitializeSRWLock that is possibly used by C++11's std::mutex in my code.

Does anyone know everything what is needed in order to compile fully XP-compatible application?

Update. I managed to build working XP application by doing things above plus setting C++ CRT runtime to Multi Threaded DLL, i.e. using dynamic DLL linkage of CRT. Also as suggested by @ChuckWalbourn, I downloaded older version of msvcp140.dll.

But it is very important for my project to have statically linked runtime (C++ CRT), i.e. use Multi Threaded value for Runtime field in project properties. Only if it is REALLY not possible only then I will use DLL CRT. Until then solution about how to link CRT statically are welcome, of course to produce XP-compatible EXE.

I am trying to work with a sql query on snowflake where I am trying to join multiple tables but my query is taking forever to run, I am not sure whether its my query or may be I have taken some wrong approach.

I have these below tables in snowflake -

1)RR_SUMM, 2) YY_TEXTENTR, 3) KK_SUBEVT, 4) LG_NBETR, 5) XX_RPOPO, 6) VV_KJIU, 7) LL_JJHHHIP, 8) UU_GHGGHJ,
9) QQ_BHBHGGG, 10) TT_HJHHSY

So RR_SUMM is my primary table

and each table consists of a common column labelled as "_ID"

My Goal is to join all the other 9 tables with primary table RR_SUMM using _ID column

as I am trying to extract and combine some of the fields from each table with the primary table.

I am following the approach of applying left outer join to combine all the other tables with primary table RR_SUMM

But my approach is taking forever to run as most of the tables are of around 25 GB in size.

SQL query Which I have written in SNOWFLAKE is below-