Add recipe to conda-forge

We're in business.
https://github.com/conda-forge/nbautoexport-feedstock
https://anaconda.org/conda-forge/nbautoexport


Adding Final energy per carrier tag

This pull request

adds the {Final Energy carrier} tag to support NAVIGATE template variables.
change the energy-final.yaml file to:

use the FE tag whenever possible
move variables that do not belong to the NAVIGATE template to the end of the file.

While working on this, it became evident that there is one design decision that needs to be made regarding the use of the tag system.
As you can see in this pull request, I made use of the {FE carrier} tag as much as possible for the FE variables definition. This creates additional variables that will never have an assigned value, e.g. Final Energy|Transport|{Final Energy carrier} creates the variable Final Energy|Transport|Heat that will never have a value; the same for Final Energy|Non-Energy Use|Electricity, and so on.
There are three options to handle that as far as I can see:

keep using the tag system as it is done in this pull request. Trade-off: This simplifies the variables list definition, reducing entries, description repetitions and possible variables missing mistakes. However, this also creates additional variables in the database that will never have any values assigned.
add support in the tag creation to define subgroups of the complete tag list. This would require additional code and an additional "sub-tag" field in the variable definition contained in the tag yaml file. With this tag we could filter out only part of the tag variables for these special cases, instead of using the full list of variables contained in the tag. This would still have all advantages of alternative 1, but it would allow to not create any unnecessary variable. Alternatively, we could also create as many additional tags as necessary to avoid meaningless variables, but this would add a lot of unnecessary repetition in descriptions and variable names.
revert to use the traditional and more extensive list of variables, limiting the tags use only for some handful of cases.

I would lean to the option 2, but as this is dependable of some code under the hood I would say this is entirely your decision @danielhuppmann
Please let me know how should I proceed to add the NAVIGATE template variables.

Additional tags added to support the full list of Final Energy variables in the NAVIGATE template:

{Transport mode} - list of transport modes and transport mode energy carriers
{Industry sectors} - navigate industry sectors
{Bunkers mode} - full list of bunker modes and bunker mode energy carriers


Latest golang client v0.16.11 doesn't work and crashes my whole app on Linux (Ubuntu,Mint)

Setup Tigerbeetle cluster inside docker based on this Page: https://docs.tigerbeetle.com/operating/docker/
Try to perform some transactions using latest Golang Client (v0.16.11)

	client, err := tb.NewClient(types.ToUint128(0), []string{"<IP_ADDRESS>:3002", "<IP_ADDRESS>:3001", "<IP_ADDRESS>:3003"})
	if err != nil {
		log.Printf("Error creating client: %s", err)
		return
	}
	defer client.Close()
	client.Nop()

The client then crashes whole app:
go run .
thread 42087 panic: session evicted
Unwind information for `:0x402b97` was not available, trace may be incomplete

go version go1.21.0 linux/amd64
lsb_release -a
No LSB modules are available.
Distributor ID:	Linuxmint
Description:	Linux Mint 21.1
Release:	21.1
Codename:	vera
cat /etc/os-release
NAME="Linux Mint"
VERSION="21.1 (Vera)"
ID=linuxmint
ID_LIKE="ubuntu debian"
PRETTY_NAME="Linux Mint 21.1"
VERSION_ID="21.1"
HOME_URL="https://www.linuxmint.com/"
SUPPORT_URL="https://forums.linuxmint.com/"
BUG_REPORT_URL="http://linuxmint-troubleshooting-guide.readthedocs.io/en/latest/"
PRIVACY_POLICY_URL="https://www.linuxmint.com/"
VERSION_CODENAME=vera
UBUNTU_CODENAME=jammy

Hi @gladkikhartem,
You mention that the client is running v0.16.11 -- what version are the replicas running? It must be at least v0.16.11 or else the client will be incompatible.

@sentientwaffle I'm running latest Docker image using guideline  https://docs.tigerbeetle.com/operating/docker/

ghcr.io/tigerbeetle/tigerbeetle                                 latest           8f64c5f1180f   6 weeks ago     23.9MB

Yes, this was a client fix, so it required a client upgrade.


Feedback for "Configure Entitlements and Quotas for Subaccounts"

https://help.sap.com/products/BTP/65de2977205c403bbc107264b8eccf4b/5ba357b4fa1e4de4b9fcc4ae771609da.html?locale=en-US&version=Cloud
This page does not help with the message that I got:
Unable to start application example: Cannot start application 'example'; there is no compute unit quota for subaccount 'hzahylnfp5'.
You can:

Check the compute unit quotas of your subaccount
Configure compute unit size for the application with parameter --size

Hi Jimmy,
I had a look and so far I think the issue may lie in the error message, not the documentation, as the message mentions "compute unit quota" and not just "quota".
Best,
Anja

Yes, Anja.
I'd suggest that you check why the message is pointing to this help topic. If there is another topic that is a better match to the message, you can provide that in the message. If there is no such topic, it might be worth writing one.
Regards
Jimmy

Hi @dsimov,
This repository is only used to review feedback on documentation. Please use other more appropriate channels to report problems with the product, service, or tool being described (such as the SAP Community Q&A and the SAP Support Portal). See also our Dos and Don'ts.


GSD Request

--- GSD JSON ---
{
  "vendor_name": "Linux",
  "product_name": "Kernel",
  "product_version": "versions from  to before v5.15.25",
  "vulnerability_type": "unspecified",
  "affected_component": "unspecified",
  "attack_vector": "unspecified",
  "impact": "unspecified",
  "credit": "",
  "references": [
    "https://git.kernel.org/pub/scm/linux/kernel/git/stable/linux.git/commit/?id=fc6d187f2986b20de112e9d442c4d0962860f1e6"
  ],
  "extended_references": [
    {
      "type": "commit",
      "value": "fc6d187f2986b20de112e9d442c4d0962860f1e6",
      "note": "fixed"
    }
  ],
  "reporter": "joshbressers",
  "reporter_id": 1692786,
  "notes": "",
  "description": "pidfd: fix test failure due to stack overflow on some arches\n\nThis is an automated ID intended to aid in discovery of potential security vulnerabilities. The actual impact and attack plausibility have not yet been proven.\nThis ID is fixed in Linux Kernel version v5.15.25 by commit fc6d187f2986b20de112e9d442c4d0962860f1e6. For more details please see the references link."
}
--- GSD JSON ---

This issue has been assigned GSD-2022-1000481


Clicking file quickly opens the file twice

If you click the same entry in the tree view a second time before the first one opens, it will open two editors for that file.
Noticed this while testing a slow network drive on Windows but it isn't Windows specific since it can happen whenever loading a file is slow.

I can't reproduce this with OS X 10.10.3, Ubuntu 15.04, or Windows 8.1 with Atom 0.210.0. I'm going to close this for now, but we can always reopen if it crops up again.

This happens consistently for me after first opening the editor.  If I let the editor sit for a minute before clicking it does not occur.  It occasionally reoccurs even after the editor has been opened for some time.

The same here

I also have this problem in OSX 10.11.5, atom 1.8.0

Also present in 1.9.0-beta0.

can confirm for atom 1.8.0 on osx 10.11.5.

This had been fixed, but it has not been published yet.  atom/tree-view#847.


The dynamic_css! macro makes the size of the wasm very large

For my personal project, using dynamic_css! resulted in a size of 1262 kB, and removing dynamic_css! resulted in a size of 276 kB.
These file sizes are after wasm-opt and minified well.
So, dynamic_css! increases the final file size by about 1MB.
I think parcel_css is heavy for client wasm.
We need to find a solution for CSS nesting that does not rely on parcel_css. (Maybe write our own parser?)

https://github.com/MatchaChoco010/yew-style-in-rs/pull/2 solved this problem.
The file size of the wasm of the example project before this PR is 1153KB, and after this PR is 144KB.
I think this has allowed us to keep the size of the product to a sufficiently practical level.
Before:

After:


join server

can i join my own server with this code?

No, node-csgo does not emulate playing the game/joining servers.


w1c remaining timeout calculation mistake [JIRA: RIAK-2317]

The remaining w1c timeout calculation works out the elapsed time in microseconds then forgets to convert to milliseconds before adjusting the timeout.  Noticed when I added so much debug logging to track down something else it started to trip in batch sizes of 300.
https://github.com/basho/riak_kv/blob/end-to-end/timeseries/src/riak_kv_w1c_worker.erl#L399
remaining_put_timeout(Start, Timeout) ->
    non_neg(Timeout -
                non_neg(trunc(timer:now_diff(os:timestamp(), Start)))).

Would recommend a fix like this
remaining_put_timeout(Start, Timeout) ->
    non_neg(Timeout -
                non_neg(timer:now_diff(os:timestamp(), Start) div 1000)).

[~dsomogyi] MUSTFIX for 1.0
[posted via JIRA by Jon Meredith]

https://github.com/basho/riak_kv/pull/1295
[posted via JIRA by John Daily]


{command_prefix}clean is no longer cleaning user messsages.

Please make sure these boxes are checked (put an 'x' inside them) before creating the issue.

[x] I am using Python 3.5 or higher (run python --version on the command line)
[x] I have followed the official guides to install the bot for my system
[x] I have updated my dependencies to the latest version using the appropriate update_dependencies script
[x] I am running version 1.9.6_3 of MusicBot

Description of issue
Steps to reproduce

Log file
Please attach your MusicBot log file (located at logs/musicbot.log) to this issue. You can do so by dragging and dropping the file here.

{command_prefix}clean no longer removes user messages, just messages from the bot.

Please attach your log as that let's us see if it's a problem with the bot, or if you just have missing permission. Thank you.

Closing issue, I had forgotten about the manage messages permission on the text channel.


add texas a&m geocoder

Thanks for this, but the tests don't pass. At a minimum you'll need to add some test fixtures. For exemplary PRs that add geocoding services, see #582, #730, etc.

@crdunwel Thank you for your PR!
It has been inactive for 7 months and is not in a mergeable state. Thus I will be closing it.
Please let us know if you wish to continue working on it. We welcome more contributions from you.


cointop: 1.6.0 -> 1.6.2

Automatic update generated by nixpkgs-update tools. This update was made based on information from https://github.com/miguelmota/cointop/releases.
meta.description for cointop is: "The fastest and most interactive terminal based UI application for tracking cryptocurrencies"
meta.homepage for cointop is: "https://cointop.sh"
meta.changelog for cointop is: ""
Updates performed

Version update

To inspect upstream changes

Release on GitHub

Compare changes on GitHub

Impact

Checks done (click to expand)

built on NixOS

The tests defined in passthru.tests, if any, passed

0 of 0 passed binary check by having a zero exit code.

0 of 0 passed binary check by having the new version present in output.

found 1.6.2 with grep in /nix/store/d6gkc8lmgk2767db92b7plrr0gp7nlxr-cointop-1.6.2

directory tree listing: https://gist.github.com/2e36a08e880048b47a25e1e5a9d2552f

du listing: https://gist.github.com/252aeb1486fd7e63d7bfa5779ce517e0

Rebuild report (if merged into master) (click to expand)

4 total rebuild path(s)

1 package rebuild(s)

1 x86_64-linux rebuild(s)
1 i686-linux rebuild(s)
1 x86_64-darwin rebuild(s)
1 aarch64-linux rebuild(s)

First fifty rebuilds by attrpath
cointop

Instructions to test this update (click to expand)

Either download from Cachix:
nix-store -r /nix/store/d6gkc8lmgk2767db92b7plrr0gp7nlxr-cointop-1.6.2 \
  --option binary-caches 'https://cache.nixos.org/ https://nix-community.cachix.org/' \
  --option trusted-public-keys '
  nix-community.cachix.org-1:mB9FSh9qf2dCimDSUo8Zy7bkq5CX+/rkCWyvRCYg3Fs=
  cache.nixos.org-1:6NCHdD59X431o0gWypbMrAURkbJ16ZPMQFGspcDShjY=
  '

(The Cachix cache is only trusted for this store-path realization.)
For the Cachix download to work, your user must be in the trusted-users list or you can use sudo since root is effectively trusted.
Or, build yourself:
nix-build -A cointop https://github.com/r-ryantm/nixpkgs/archive/f3074fb6378c6da21f35d33befc58ac1101a3a4b.tar.gz

After you've downloaded or built it, look at the files and if there are any, run the binaries:
ls -la /nix/store/d6gkc8lmgk2767db92b7plrr0gp7nlxr-cointop-1.6.2
ls -la /nix/store/d6gkc8lmgk2767db92b7plrr0gp7nlxr-cointop-1.6.2/bin

Pre-merge build results
We have automatically built all packages that will get rebuilt due to
this change.
This gives evidence on whether the upgrade will break dependent packages.
Note sometimes packages show up as failed to build independent of the
change, simply because they are already broken on the target branch.
Result of nixpkgs-review run on x86_64-linux 1

1 package built:

cointop

Maintainer pings
cc @marsam for testing.

Result of nixpkgs-review pr 113821 run on x86_64-linux 1

1 package built:

cointop

Result of nixpkgs-review pr 113821 at f3074fb6 run on aarch64-linux 1

1 package built:

cointop

1 suggestion:

error: no-flags-array
buildFlagsArray is only intended to be used in Bash, not as a Nix attribute.
Near pkgs/applications/misc/cointop/default.nix:16:3:
   |
16 |   buildFlagsArray = [ "-ldflags=-s -w -X ${goPackagePath}/cointop.version=${version}" ];
   |   ^


chore(deps): upgrade compiler dependencies

Upgrades project dependencies. See details in workflow run.

Automatically created by projen via the "upgrade-compiler-dependencies-2.x" workflow

⚪ Backport skipped
The pull request was not backported as there were no branches to backport to. If this is a mistake, please apply the desired version labels or run the backport tool manually.
Manual backport
To create the backport manually run:
backport --pr 3087

Questions ?
Please refer to the Backport tool documentation


Upgrade packages to minimize the size of dependency graph

Hi@qimingyuan, I found an issue in the Dropbox.Api.Integration.Tests.csproj:
Packages MSTest.TestAdapter v2.1.1, MSTest.TestFramework v2.1.1 and Microsoft.NET.Test.Sdk v16.7.1 transitively introduce 87 dependencies into project’s dependency graph (see dependency graph before upgrades), while MSTest.TestAdapter v2.2.1, MSTest.TestFramework v2.2.1 and Microsoft.NET.Test.Sdk v16.8.0 can only introduce 55 dependencies (see dependency graph after upgrades).
These upgrades can help project minimize the size of dependency graph.
Hope the PR can help you.
Best regards,
sucrose

Thanks for putting this together! I'll ask the team to review this.

Thanks a lot.@greg-db

 Thank you for your submission! We really appreciate it. Like many open source projects, we ask that you sign our Contributor License Agreement before we can accept your contribution.You have signed the CLA already but the status is still pending? Let us recheck it.


Fab icon is not in center due to Sdk 28

Describe the bug
Icon on the floating action button is not is center.
Screenshots

Smartphone Info:

Device
MI MAX 2

Android Version
Nougat 7.1

Additional context
This problem arises due to upgrading SDK version to 28.
Would you like to work on the issue?

[x] Yes

@iamareebjamal This problem arises due to upgrading SDK version from 27 to 28. Some bugs are there in android design support library. Issue #662 is also due to SDK 28. When I run the app with SDK 27, FAB is working fine. Should I use ImageButton instead or degrade the design support library to 27 for now?

Degrade

@iamareebjamal Same issue with sdk version 28

com.google.android.material.floatingactionbutton.FloatingActionButton is used. Can we use different floating button?

No, add a workaround


Sudoku Solver in C++

💥 Proposal
(A clear and concise description of what the proposal is.)
The proposal is about a hard problem of backtracking/ recursion named Sudoku solver.
Have you read the Contributing Guidelines on Pull Requests ?
(Write your answer here.)
Yes

@ankitapuri Can i work on this issue?

I want to solve it in python

@NidhiNivedita6 I would like to work on it in java. Please assign it to me.

I will do it in C++
Can you please assign this to me

Please check my pull request

Check my pull request


Init arrow type system and use that in postgres transport

This PR adds an arrow types system and uses that type system in PostgresArrowTransport.
I just pleased the type system here, so please take a good look. :)
Some questions:

what does the this bool do?

A premature optimization, but if I understand correctly we can also implement ArrowAssoc for &str and Option<&str>, add that to the type system and thereby reduce an allocation of String?

Hi @ritchie46 , I added a test that copies data from postgres to arrow, as well as some minor refactors. Let's merge the PR if you are ok with the change.

Hi @ritchie46 , I added a test that copies data from postgres to arrow, as well as some minor refactors. Let's merge the PR if you are ok with the change.

Nice, That means that the rust side of thing has a working PoC? Or is more needed?
I think this one can get merged in. :+1:

Nice, That means that the rust side of thing has a working PoC?

Yes, it is a working PoC! I guess what's left is:

adding more types
finish the conversions from mysql/sqlite to arrow
publish it to crates.io

Yes, it is a working PoC! I guess what's left is:

adding more types
finish the conversions from mysql/sqlite to arrow
publish it to crates.io
implement the pyarrow support in python

Great! :slightly_smiling_face:
I will take a look at the python side.


There is no option to getScenarios for non-default client

Issue guidelines
I'm trying to get Scenarios from my Wiremock server using Wiremock client, but realized that there is only one method - getAllScenarios() - which is exposed. I think it's needed to make private method getScenarios() as part of client contract.
BTW, I wanted to create pull request to fix it, but was push backed with 403. Is there restriction to create new branches on remote?
Feature requests
Add method to getScenarios for non-default client

That's strange, I've no idea why that's not public, but it definitely should be. I'll fix that in the next release.

Fixed in 9792aee49d1f89d32722b7fbf639aeb3a4bdcec6


Implement Field(allow_mutation=False) for certain fields

Are we going to support updating a relationship? Like if a recipe_run is created pointing to a specific bakery, can we update that to reference a different bakery?
...
If not, we need to test that such an update attempt fails.

Originally posted by @rabernat in https://github.com/pangeo-forge/pangeo-forge-orchestrator/pull/31#pullrequestreview-859879052

We would like to prevent mutability in certain situations, e.g. a recipe_run's bakery and feedstock foreign keys should be immutable after creation.

Pydantic supports this as follows
In [1]: from pydantic import BaseModel, Field

In [2]: class Model(BaseModel):
   ...:     foo: int = Field(allow_mutation=False)
   ...:
   ...:     class Config:
   ...:         validate_assignment=True
   ...:

In [3]: m = Model(foo=1)

In [4]: m.foo = 2
---------------------------------------------------------------------------
TypeError                                 Traceback (most recent call last)
<ipython-input-4-f91d493b3be0> in <module>
----> 1 m.foo = 2

~/miniconda3/envs/pfo-db/lib/python3.8/site-packages/pydantic/main.cpython-38-darwin.so in pydantic.main.BaseModel.__setattr__()

TypeError: "foo" has allow_mutation set to False and cannot be assigned

But if we change the RecipeRunBase field declarations as follows
  recipe_id: str
- bakery_id: int = Field(foreign_key="bakery.id")
- feedstock_id: int = Field(foreign_key="feedstock.id")
+ bakery_id: int = Field(foreign_key="bakery.id", allow_mutation=False)
+ feedstock_id: int = Field(foreign_key="feedstock.id", allow_mutation=False)
  head_sha: str
  version: str  # TODO: use `ConstrainedStr`
  started_at: datetime
  completed_at: Optional[datetime] = None
  conclusion: Optional[RecipeRunConclusion] = None
  status: RecipeRunStatus = RecipeRunStatus.queued
  message: Optional[str] = None  # TODO: Replace with GitHub check runs `output`.

+ class Config:
+     validate_assignment = True  # required to enforce `allow_mutation=False` on foreign keys

The tests raise
requests.exceptions.HTTPError: 422 Client Error: Unprocessable Entity for url: http://testserver/recipe_runs/

This is presumably a result of the SQLModel layer, but does not appear to be specific to foreign key fields. (Anecdotally, setting Field(allow_mutation=False) on non-foreign-key fields has the same result.) Note also that declaring a Pydantic Config class is not the issue either (this, absent allow_mutation=False fields, doesn't raise any errors).


Dependency on XStream, even when not using any XStream serializers

It's currently not possible to use Axon without XStream getting configured, even when XStream is not used for any serializers.
This appears to be caused by a lot of the builders containing a field like
private Serializer eventSerializer = XStreamSerializer.builder().build();

which is never used if a different serializer is configured.
On newer JDKs, instantiating the XStreamSerializer results in a warning:
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.thoughtworks.xstream.core.util.Fields (file:/Users/mnewman/.gradle/caches/modules-2/files-2.1/com.thoughtworks.xstream/xstream/1.4.10/dfecae23647abc9d9fd0416629a4213a3882b101/xstream-1.4.10.jar) to field java.util.TreeMap.comparator
WARNING: Please consider reporting this to the maintainers of com.thoughtworks.xstream.core.util.Fields
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release

(https://github.com/x-stream/xstream/issues/101 for the corresponding XStream issue)
If you agree this can be improved, I'm happy to take a first pass at a PR for this, probably by making the instantiation of the XStreamSerializer lazy in the builder. Ideally I'd like to be able to use Axon framework without XStream even on the classpath.

This issue has been resolved in PR #1073, hence closing.


android: HW video acceleration + camera2

See the individual commit logs for details.

Pushed an extra patch with an update to WebRTC M58 which includes a cherry-pick which fixes a crash when using textures, which is the case when camera2 is used. The details of the cherry-pick are in the commit message.

I will do doc update once this landed.
ping me if a new release is required.

Thanks, will do. We need to do more testing, but things are looking good! :-)
-Saúl

On Jul 13, 2017, at 07:37, zxcpoiu<EMAIL_ADDRESS>wrote:
I will do doc update once this landed.
ping me if a new release is required.
—
You are receiving this because you authored the thread.
Reply to this email directly, view it on GitHub, or mute the thread.


Feature/#141 geojson export map overlay

To test, build the branch.  With test-basic, create an overlay and features and select Export to GeoJSON as before.  The test exports, features, overlays and the map, all in one action for testing

test-log.txt

Reintegrate.


VerticalPagerActivity

If try to change orientation of layout manager after setup in between like in VerticalPagerActivity
layout.setOrientation(LinearLayoutManager.HORIZONTAL) if recycler view layount manager was initially Vertical in orientation then recycler view collapse each item take width as wrap_content instead of match_parent.
this happen more often if you have less elements like 3 or 4.
sample code
findViewById(R.id.tvVertical).setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View view) {
layout.setOrientation(LinearLayoutManager.VERTICAL);
}
});
findViewById(R.id.tvHorizontal).setOnClickListener(new View.OnClickListener() {
@Override
public void onClick(View view) {
layout.setOrientation(LinearLayoutManager.HORIZONTAL);
}
});

found the correct way of doing it call
mRecyclerView.getAdapter().notifyDataSetChanged();
after changinf orientation


Automated cherry pick of #1367: lbagents: 改正vrrp模板

Cherry pick of #1367 on release/2.9.0.
#1367: lbagents: 改正vrrp模板

Codecov Report

:exclamation: No coverage uploaded for pull request base (release/2.9.0@16459a1). Click here to learn what that means.
The diff coverage is 0%.

@@               Coverage Diff               @@
##             release/2.9.0   #1369   +/-   ##
===============================================
  Coverage                 ?   7.41%
===============================================
  Files                    ?     346
  Lines                    ?   54810
  Branches                 ?       0
===============================================
  Hits                     ?    4065
  Misses                   ?   50366
  Partials                 ?     379

Flag
Coverage Δ

#aFlag
7.41% <0%> (?)

Impacted Files
Coverage Δ

pkg/compute/models/loadbalanceragents.go
2.99% <ø> (ø)

pkg/cloudcommon/db/virtualresource.go
0% <0%> (ø)

pkg/cloudcommon/validators/errors.go
44.64% <0%> (ø)

pkg/cloudcommon/validators/validators.go
65.53% <0%> (ø)

Continue to review full report at Codecov.

Legend - Click here to learn more
Δ = absolute <relative> (impact), ø = not affected, ? = missing data
Powered by Codecov. Last update 16459a1...a09f7e5. Read the comment docs.

/lgtm
/approve


Remove "IDE ready" section

Since Sorbet does not have IDE support, this section is a bit misleading.
Motivation
Sorbet does not have IDE support, this is closed source and (I assume) only available internally at Stripe.
Test plan
I'm guessing the static homepage isn't under test

Sorbet has numerous LSP features that are all open source and built into Sorbet behind the --lsp flag, available to any editor with LSP support out of the box. This is what we mean by IDE ready.
Thanks!

Oh, interesting. There is a gif on the homepage showing usage in vs code, but googling has so far indicated that there is no vs code support. Is there documentation for setting up sorbet with vs code? This seems like an important piece of info to support the claim of “IDE ready”
I’m not aware of any technique  to integrate vs code with a language server directly, without the use of an extension. Is this what engineers at Stripe are doing? Somehow manually connecting their editors to the language server?
On Nov 26, 2021, 15:17 -0500, Jake Zimmerman @.***>, wrote:

Sorbet has numerous LSP features that are all open source and built into Sorbet behind the --lsp flag, available to any editor with LSP support out of the box. This is what we mean by IDE ready.
Thanks!
—
You are receiving this because you authored the thread.
Reply to this email directly, view it on GitHub, or unsubscribe.
Triage notifications on the go with GitHub Mobile for iOS or Android.


Remove ZMQ version agnostic code

Closes #67
If we want to support linking libzmq installed on the system to support platforms other than linux, mac and windows, this should not be merged.

Current coverage is 93.65% (diff: 81.25%)

Merging #76 into master will increase coverage by 2.49%

@@             master        #76   diff @@
==========================================
  Files             2          2
  Lines           283        268    -15
  Methods           0          0
  Messages          0          0
  Branches          0          0
==========================================
- Hits            258        251     -7
+ Misses           25         17     -8
  Partials          0          0

Powered by Codecov. Last update 0fea31a...0837606

If you think this is good to go and that it won't be hard to sync changes with upstream (in both directions), I say go for it.

That's the one thing which makes me hesitate. I don't know.
I had this branch on my machine for some time now and figured I just share it to discuss. We can definitely wait till it's clearer which route we want to go with zmq-prebuilt.

This seems fine to me. Plus, limiting support doesn't quite mean you are totally cutting off system-supplied zmq. It's just limiting the possible versions.
However, I would like to know what problems the presence of this code causes. If it doesn't directly cause real problems, I'm not sure what the benefit of removing it would be.
Personally, I'm trying hard to resist my own impulses to remove old code (it's super hard!) in projects people actually use until its presence causes an actual problem (impeding a refactor, relying on something else broken, etc.).

I feel the same. I made this PR mainly because I couldn't resist "my own impulses to remove old code" 😉.
I don't know of a problem caused by this code and the only benefit would be a more readable codebase and a minor improvement in test coverage. I think it'd make sense to close this PR and keep the branch around until we discover a problem caused by the code.


Add support for double ragged arrays on add_electrodes

Same as #879

@h-mayorquin Good to go?

Yes.


Refactor ScubaDiver project

I've realized now that it may be easier to pick up #4 and refactor HTTP handling to use gRPC. The current implementation exists in a single file and is highly duplicative, which is terrible for maintainability. It is also very difficult to benchmark snapshot performance with the current architecture, which remains a blocker for #11.
Currently, request types are stored in MTGOSDK.Core.Remoting.Interop.Interactions, which can be refactored to new proto3 definitions. This will require a pretty significant refactor of the ScubaDiver project and the communicator (RemoteNET side) to use new gRPC machinery.


handle NotModified response without exception on ReadItem*

Pull Request Template
Description
#920 container.ReadItemAsync with matching IfNoneMatchEtag throws CosmosException
Type of change
Please delete options that are not relevant.

[x] Bug fix (non-breaking change which fixes an issue)
[ ] New feature (non-breaking change which adds functionality)
[ ] Breaking change (fix or feature that would cause existing functionality to not work as expected)
[x] This change requires a documentation update

Closing issues
closes #920
Assignee
Please add yourself as the assignee
Projects
Please add relevant projects so this issue can be properly tracked.

@christothes V3 SDK stream API are return status codes instead of exception and are right choice of sensitive applications.
Generic (or typed) API's are convenience layers. In our user studies we learning that non-exceptions leading to incorrect semantics.

At a minimum, this difference in behavior should b

@christothes V3 SDK stream API are return status codes instead of exception and are right choice of sensitive applications.
Generic (or typed) API's are convenience layers. In our user studies we learning that non-exceptions leading to incorrect semantics.

If the difference in behavior for the generic API's are intentional, I'd expect there to be some documentation explaining that. Where would be the appropriate place to explain this behavior?

@J82w please link the issue and close the PR.


Pricing problem infeasible

When I solve my problem using pygcgopt, I find there is a warning showing that the pricing problem is infeasible and the violation is very small. I try to solve the same problem using Gurobi diretly, and it doesn't report the infeasible problem. So is it a problem due to the accuracy and is there any parameter that can improve this?
GCG version 3.5.3 [GitHash: 63d000a0a]
Copyright (C) 2010-2022 Operations Research, RWTH Aachen University
                        Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
SCIP version 8.0.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Soplex 6.0.4] [GitHash: a8e51afd1e]
Copyright (c) 2002-2023 Zuse Institute Berlin (ZIB)
presolving:
(round 1, fast)       239 del vars, 402 del conss, 0 add conss, 435 chg bounds, 0 chg sides, 10 chg coeffs, 0 upgd conss, 0 impls, 165 clqs
(round 2, fast)       247 del vars, 415 del conss, 0 add conss, 740 chg bounds, 0 chg sides, 14 chg coeffs, 0 upgd conss, 0 impls, 164 clqs
(round 3, fast)       247 del vars, 422 del conss, 0 add conss, 806 chg bounds, 0 chg sides, 14 chg coeffs, 0 upgd conss, 0 impls, 164 clqs
(round 4, fast)       247 del vars, 422 del conss, 0 add conss, 950 chg bounds, 0 chg sides, 14 chg coeffs, 0 upgd conss, 0 impls, 164 clqs
(round 5, fast)       247 del vars, 422 del conss, 0 add conss, 983 chg bounds, 0 chg sides, 14 chg coeffs, 0 upgd conss, 0 impls, 164 clqs
(round 6, exhaustive) 247 del vars, 423 del conss, 0 add conss, 984 chg bounds, 0 chg sides, 14 chg coeffs, 758 upgd conss, 0 impls, 164 clqs
(round 7, medium)     256 del vars, 1033 del conss, 1231 add conss, 984 chg bounds, 0 chg sides, 14 chg coeffs, 758 upgd conss, 0 impls, 1379 clqs
(round 8, exhaustive) 256 del vars, 1033 del conss, 1231 add conss, 984 chg bounds, 0 chg sides, 14 chg coeffs, 766 upgd conss, 0 impls, 1379 clqs
(round 9, medium)     256 del vars, 1041 del conss, 1239 add conss, 984 chg bounds, 0 chg sides, 14 chg coeffs, 766 upgd conss, 0 impls, 1394 clqs
   (0.0s) sparsify finished: 28/5636 (0.5%) nonzeros canceled - in total 28 canceled nonzeros, 42 changed coefficients, 0 added nonzeros
(round 10, exhaustive) 257 del vars, 1041 del conss, 1239 add conss, 984 chg bounds, 0 chg sides, 56 chg coeffs, 766 upgd conss, 0 impls, 1378 clqs
(round 11, fast)       271 del vars, 1072 del conss, 1239 add conss, 1054 chg bounds, 0 chg sides, 56 chg coeffs, 766 upgd conss, 0 impls, 1378 clqs
(round 12, fast)       271 del vars, 1092 del conss, 1239 add conss, 1217 chg bounds, 0 chg sides, 56 chg coeffs, 766 upgd conss, 0 impls, 1378 clqs
(round 13, fast)       271 del vars, 1092 del conss, 1239 add conss, 1276 chg bounds, 0 chg sides, 56 chg coeffs, 766 upgd conss, 0 impls, 1378 clqs
   (0.2s) probing cycle finished: starting next cycle
(round 14, exhaustive) 285 del vars, 1092 del conss, 1239 add conss, 1357 chg bounds, 0 chg sides, 56 chg coeffs, 766 upgd conss, 5266 impls, 1321 clqs
(round 15, fast)       285 del vars, 1149 del conss, 1239 add conss, 1357 chg bounds, 0 chg sides, 56 chg coeffs, 766 upgd conss, 5266 impls, 1321 clqs
(round 16, exhaustive) 285 del vars, 1163 del conss, 1239 add conss, 1357 chg bounds, 14 chg sides, 56 chg coeffs, 766 upgd conss, 5266 impls, 1321 clqs
   (0.2s) probing: 50/965 (5.2%) - 14 fixings, 0 aggregations, 5855 implications, 81 bound changes
   (0.2s) probing aborted: 50/50 successive totally useless probings
presolving (17 rounds: 17 fast, 8 medium, 6 exhaustive):
 285 deleted vars, 1163 deleted constraints, 1239 added constraints, 1357 tightened bounds, 0 added holes, 14 changed sides, 56 changed coefficients
 5266 implications, 1321 cliques
presolved problem has 1283 variables (965 bin, 0 int, 0 impl, 318 cont) and 2233 constraints
   1321 constraints of type <setppc>
    912 constraints of type <linear>
Presolving Time: 0.21
 Consclassifier "nonzeros" yields a classification with 4  different constraint classes
 Consclassifier "constypes" yields a classification with 3 different constraint classes
 Consclassifier "constypes according to miplib" yields a classification with 3 different constraint classes
 Consclassifier "gamsdomain" yields a classification with 1  different constraint classes
 Consclassifier "gamssymbols" yields a classification with 1  different constraint classes
 Conspartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain" conspartition
 Varclassifier "gamsdomain" yields a classification with 1  different variable classes
 Varclassifier "gamssymbols" yields a classification with 1  different variable classes
 Varpartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain"
 Varclassifier "vartypes" yields a classification with 2 different variable classes
 Varclassifier "varobjvals" yields a classification with 331 different variable classes
 Varclassifier "varobjvalsigns" yields a classification with 2 different variable classes
 the current varclass distribution includes 331 classes but only 18 are allowed for GCGconshdlrDecompCalcCandidatesNBlocks()
 in dec_consclass: there are 4 different constraint classes
  the current constraint classifier "nonzeros" consists of 4 different classes
  the current constraint classifier "constypes" consists of 3 different classes
  the current constraint classifier "constypes according to miplib" consists of 3 different classes
  the current constraint classifier "gamsdomain" consists of 1 different classes
 dec_consclass found 30 new partialdecs
dec_densemasterconss found 1 new partialdec
dec_neighborhoodmaster found 1 new partialdec
 the current varclass distribution includes 331 classes but only 9 are allowed for propagatePartialdec() of var class detector
POSTPROCESSING of decompositions. Added 7 new decomps.
Found 38 finished decompositions.

Chosen structure has 159 blocks, 58 master-only (static) variables, and 1176 linking constraints.
This decomposition has a maxwhite score of 0.458258.
Warning: Discretization with continuous variables is only an experimental feature.
Matrix has 159 blocks, using 159 pricing problems.
  time | node  | left  |SLP iter|MLP iter|LP it/n| mem |mdpt |ovars|mvars|ocons|mcons|mcuts|  dualbound   | primalbound  |  deg   |  gap
p  0.7s|     1 |     0 |      0 |      0 |     - |  62M|   0 |1283 |   0 |2233 |   0 |   0 | 4.490203e+06 | 1.258025e+11 |   --   |  Large
p  0.9s|     1 |     0 |      0 |      0 |     - |  62M|   0 |1283 |   0 |2233 |   0 |   0 | 4.490203e+06 | 1.964861e+10 |   --   |  Large
   0.9s|     1 |     0 |      0 |      0 |     - |  62M|   0 |1283 |   0 |2233 |   0 |   0 | 4.716359e+06 | 1.964861e+10 |   --   |  Large

   1.0s|     1 |     0 |      0 |      0 |     - |  65M|   0 |1283 | 217 |2234 |1336 |   0 | 4.716359e+06 | 1.964861e+10 |   0.00%|  Large
   1.0s|     1 |     0 |      0 |      0 |     - |  65M|   0 |1283 | 376 |2234 |1336 |   0 | 4.716359e+06 | 1.964861e+10 |   0.00%|  Large
Starting reduced cost pricing...
*P16.0s|     1 |     0 |    305 |    305 |     - |  68M|   0 |1283 | 437 |2234 |1336 |   0 | 5.879534e+06 | 6.699199e+08 |  54.83%|  Large
  16.0s|     1 |     0 |    305 |    305 |     - |  68M|   0 |1283 | 437 |2234 |1336 |   0 | 5.879534e+06 | 6.699199e+08 |  54.83%|  Large
*r58.6s|     1 |     0 | 327987 |    351 |     - |  75M|   0 |1283 | 476 |2234 |1336 |   0 | 3.543773e+07 | 1.778172e+08 |  42.70%| 401.77%
  58.6s|     1 |     0 | 327987 |    351 |     - |  75M|   0 |1283 | 476 |2234 |1336 |   0 | 3.543773e+07 | 1.778172e+08 |  42.70%| 401.77%
WARNING: solution of pricing problem 154 not feasible:
  [linear] <p154_c1247>:  +57.2319595<pr154_t_y_(5,26)>[B] (+1) -<pr154_t_z_(5,16)>[C] (+130.590204) +<pr154_t_z_(5,26)>[C] (+116.121143) -1.42642585e-05<pr154_t_z_(5,36)>[C] (+155.490506) == 42.7607835059961;
;
violation: left hand side is violated by 0.000102710570857312
*r 126s|     1 |     0 | 836678 |    383 |     - |  80M|   0 |1283 | 514 |2234 |1336 |   0 | 4.856217e+07 | 6.819734e+07 |  39.70%|  40.43%
   126s|     1 |     0 | 836678 |    383 |     - |  80M|   0 |1283 | 514 |2234 |1336 |   0 | 4.856217e+07 | 6.819734e+07 |  39.70%|  40.43%
WARNING: solution of pricing problem 154 not feasible:
  [linear] <p154_c1247>:  +57.2319595<pr154_t_y_(5,26)>[B] (+1) -<pr154_t_z_(5,16)>[C] (+130.590204) +<pr154_t_z_(5,26)>[C] (+116.121143) -1.42642585e-05<pr154_t_z_(5,36)>[C] (+155.490506) == 42.7607835059961;
;
violation: left hand side is violated by 0.000102710570857312

Please try to set the parameter numerics/feastol of gcg with the method setRealParam(…) to a tolerance of 0.001 for example. If this doesnt work you should do the same for the master problem and/or the pricing problems.

Thanks for your prompt reply.
I try this parameter on my problem, but I find the warning violation become larger. What's worse, the solver still reports optimal solution but these two optimal objectives are different!
log before setting model.setRealParam("numerics/feastol", 0.001)
GCG version 3.5.3 [GitHash: 63d000a0a]
Copyright (C) 2010-2022 Operations Research, RWTH Aachen University
                        Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
SCIP version 8.0.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Soplex 6.0.4] [GitHash: a8e51afd1e]
Copyright (c) 2002-2023 Zuse Institute Berlin (ZIB)
presolving:
(round 1, fast)       134 del vars, 194 del conss, 0 add conss, 218 chg bounds, 0 chg sides, 22 chg coeffs, 0 upgd conss, 0 impls, 105 clqs
(round 2, fast)       143 del vars, 212 del conss, 0 add conss, 350 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 3, fast)       143 del vars, 221 del conss, 0 add conss, 402 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 4, fast)       143 del vars, 221 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 5, fast)       143 del vars, 221 del conss, 0 add conss, 486 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 6, fast)       143 del vars, 221 del conss, 0 add conss, 501 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 7, fast)       143 del vars, 221 del conss, 0 add conss, 513 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 8, fast)       143 del vars, 221 del conss, 0 add conss, 536 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 9, exhaustive) 143 del vars, 221 del conss, 0 add conss, 542 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 10, fast)       143 del vars, 221 del conss, 0 add conss, 551 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 11, exhaustive) 143 del vars, 229 del conss, 0 add conss, 557 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 12, fast)       143 del vars, 229 del conss, 0 add conss, 567 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 13, exhaustive) 143 del vars, 229 del conss, 0 add conss, 573 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 14, fast)       143 del vars, 229 del conss, 0 add conss, 583 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 15, exhaustive) 143 del vars, 229 del conss, 0 add conss, 588 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 145 clqs
(round 16, fast)       143 del vars, 229 del conss, 0 add conss, 599 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 145 clqs
(round 17, medium)     166 del vars, 502 del conss, 525 add conss, 601 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 624 clqs
(round 18, fast)       166 del vars, 502 del conss, 525 add conss, 612 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 628 clqs
(round 19, exhaustive) 166 del vars, 502 del conss, 525 add conss, 626 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 628 clqs
(round 20, exhaustive) 166 del vars, 502 del conss, 525 add conss, 640 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 628 clqs
(round 21, exhaustive) 166 del vars, 502 del conss, 525 add conss, 643 chg bounds, 8 chg sides, 62 chg coeffs, 395 upgd conss, 0 impls, 628 clqs
(round 22, medium)     166 del vars, 525 del conss, 548 add conss, 644 chg bounds, 8 chg sides, 62 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 23, exhaustive) 166 del vars, 548 del conss, 548 add conss, 644 chg bounds, 8 chg sides, 62 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
   (0.0s) sparsify finished: 16/2476 (0.6%) nonzeros canceled - in total 16 canceled nonzeros, 24 changed coefficients, 0 added nonzeros
(round 24, exhaustive) 166 del vars, 548 del conss, 548 add conss, 644 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 25, fast)       175 del vars, 561 del conss, 548 add conss, 661 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 26, fast)       175 del vars, 574 del conss, 548 add conss, 729 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 27, fast)       176 del vars, 575 del conss, 548 add conss, 757 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 28, fast)       176 del vars, 576 del conss, 548 add conss, 759 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
   (0.1s) probing cycle finished: starting next cycle
(round 29, exhaustive) 190 del vars, 576 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 620 clqs
(round 30, fast)       192 del vars, 632 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 620 clqs
(round 31, fast)       192 del vars, 633 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 620 clqs
(round 32, exhaustive) 196 del vars, 633 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 571 clqs
   (0.1s) probing: 55/461 (11.9%) - 14 fixings, 0 aggregations, 2615 implications, 18 bound changes
   (0.1s) probing aborted: 50/50 successive totally useless probings
presolving (33 rounds: 33 fast, 14 medium, 12 exhaustive):
 196 deleted vars, 633 deleted constraints, 548 added constraints, 779 tightened bounds, 0 added holes, 8 changed sides, 86 changed coefficients
 2340 implications, 571 cliques
presolved problem has 586 variables (457 bin, 0 int, 0 impl, 129 cont) and 934 constraints
    571 constraints of type <setppc>
    363 constraints of type <linear>
Presolving Time: 0.07
 Consclassifier "nonzeros" yields a classification with 5  different constraint classes
 Consclassifier "constypes" yields a classification with 3 different constraint classes
 Consclassifier "constypes according to miplib" yields a classification with 3 different constraint classes
 Consclassifier "gamsdomain" yields a classification with 1  different constraint classes
 Consclassifier "gamssymbols" yields a classification with 1  different constraint classes
 Conspartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain" conspartition
 Varclassifier "gamsdomain" yields a classification with 1  different variable classes
 Varclassifier "gamssymbols" yields a classification with 1  different variable classes
 Varpartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain"
 Varclassifier "vartypes" yields a classification with 2 different variable classes
 Varclassifier "varobjvals" yields a classification with 145 different variable classes
 Varclassifier "varobjvalsigns" yields a classification with 2 different variable classes
 the current varclass distribution includes 145 classes but only 18 are allowed for GCGconshdlrDecompCalcCandidatesNBlocks()
 in dec_consclass: there are 4 different constraint classes
  the current constraint classifier "nonzeros" consists of 5 different classes
  the current constraint classifier "constypes" consists of 3 different classes
  the current constraint classifier "constypes according to miplib" consists of 3 different classes
  the current constraint classifier "gamsdomain" consists of 1 different classes
 dec_consclass found 46 new partialdecs
dec_densemasterconss found 1 new partialdec
dec_neighborhoodmaster found 1 new partialdec
 the current varclass distribution includes 145 classes but only 9 are allowed for propagatePartialdec() of var class detector
POSTPROCESSING of decompositions. Added 13 new decomps.
Found 60 finished decompositions.

Chosen structure has 70 blocks, 49 master-only (static) variables, and 511 linking constraints.
This decomposition has a maxwhite score of 0.434945.
Warning: Discretization with continuous variables is only an experimental feature.
Matrix has 70 blocks, using 70 pricing problems.
  time | node  | left  |SLP iter|MLP iter|LP it/n| mem |mdpt |ovars|mvars|ocons|mcons|mcuts|  dualbound   | primalbound  |  deg   |  gap
p  0.3s|     1 |     0 |      0 |      0 |     - |  28M|   0 | 586 |   0 | 934 |   0 |   0 | 4.898650e+06 | 5.567928e+10 |   --   |  Large
p  0.4s|     1 |     0 |      0 |      0 |     - |  28M|   0 | 586 |   0 | 934 |   0 |   0 | 4.898650e+06 | 1.507009e+10 |   --   |  Large
   0.4s|     1 |     0 |      0 |      0 |     - |  28M|   0 | 586 |   0 | 934 |   0 |   0 | 5.990994e+06 | 1.507009e+10 |   --   |  Large
** 0.4s|     1 |     0 |      0 |      0 |     - |  29M|   0 | 586 | 119 | 935 | 582 |   0 | 5.990994e+06 | 1.507009e+10 |   0.00%|  Large

   0.4s|     1 |     0 |      0 |      0 |     - |  29M|   0 | 586 | 119 | 935 | 582 |   0 | 5.990994e+06 | 1.507009e+10 |   0.00%|  Large
   0.4s|     1 |     0 |      0 |      0 |     - |  29M|   0 | 586 | 189 | 935 | 582 |   0 | 5.990994e+06 | 1.507009e+10 |   0.00%|  Large
Starting reduced cost pricing...
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
*r 1.8s|     1 |     0 |   1017 |    158 |     - |  30M|   0 | 586 | 223 | 935 | 582 |   0 | 2.492205e+09 | 2.887097e+09 |  50.95%|  15.85%
   1.8s|     1 |     0 |   1017 |    158 |     - |  30M|   0 | 586 | 223 | 935 | 582 |   0 | 2.492205e+09 | 2.887097e+09 |  50.95%|  15.85%
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
*P 3.2s|     1 |     0 |   8959 |    174 |     - |  31M|   0 | 586 | 234 | 935 | 582 |   0 | 2.601764e+09 | 2.637855e+09 |  41.65%|   1.39%
   3.2s|     1 |     0 |   8959 |    174 |     - |  31M|   0 | 586 | 234 | 935 | 582 |   0 | 2.601764e+09 | 2.637855e+09 |  41.65%|   1.39%
   3.2s|     1 |     0 |   8959 |    174 |     - |  31M|   0 | 586 | 234 | 935 | 582 |   0 | 2.601764e+09 | 2.637855e+09 |  41.65%|   1.39%
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
*r 5.6s|     1 |     0 |  19697 |    183 |     - |  31M|   0 | 586 | 245 | 935 | 582 |   0 | 2.601764e+09 | 2.613534e+09 |  40.96%|   0.45%
   5.7s|     1 |     0 |  19697 |    183 |     - |  31M|   0 | 586 | 245 | 935 | 582 |   0 | 2.601764e+09 | 2.613534e+09 |  40.96%|   0.45%
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
*r18.1s|     1 |     0 |  89048 |    193 |     - |  31M|   0 | 586 | 255 | 935 | 582 |   0 | 2.613534e+09 | 2.613534e+09 |  37.63%|   0.00%
  18.1s|     1 |     0 |  89048 |    193 |     - |  31M|   0 | 586 | 255 | 935 | 582 |   0 | 2.613534e+09 | 2.613534e+09 |  37.63%|   0.00%
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
WARNING: solution of pricing problem 68 not feasible:
WARNING: solution of pricing problem 68 not feasible:
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  [linear] <p68_c588>:  +70.0049245<pr68_t_y_(2,19)>[B] (+1) -<pr68_t_z_(2,18)>[C] (+191489.274) +<pr68_t_z_(2,19)>[C] (+191427.358) -2.28267178e-06<pr68_t_x_(2)>[C] (+212826.156) == 7.60321750873439;
;
violation: left hand side is violated by 0.000180003431657916
  time | node  | left  |SLP iter|MLP iter|LP it/n| mem |mdpt |ovars|mvars|ocons|mcons|mcuts|  dualbound   | primalbound  |  deg   |  gap
  25.3s|     1 |     0 | 124819 |    193 |     - |  31M|   0 | 586 | 255 | 935 | 582 |   0 | 2.613534e+09 | 2.613534e+09 |  37.41%|   0.00%
  25.3s|     1 |     0 | 124819 |    193 |     - |  31M|   0 | 586 | 255 | 935 | 582 |   0 | 2.613534e+09 | 2.613534e+09 |   --   |   0.00%
SCIP Status        : problem is solved [optimal solution found]
Solving Time (sec) : 25.34
Solving Nodes      : 1
Primal Bound       : +2.61353442596473e+09 (7 solutions)
Dual Bound         : +2.61353442596473e+09
Gap                : 0.00 %

log after setting model.setRealParam("numerics/feastol", 0.001)
GCG version 3.5.3 [GitHash: 63d000a0a]
Copyright (C) 2010-2022 Operations Research, RWTH Aachen University
                        Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
SCIP version 8.0.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Soplex 6.0.4] [GitHash: a8e51afd1e]
Copyright (c) 2002-2023 Zuse Institute Berlin (ZIB)
presolving:
(round 1, fast)       134 del vars, 194 del conss, 0 add conss, 218 chg bounds, 0 chg sides, 22 chg coeffs, 0 upgd conss, 0 impls, 105 clqs
(round 2, fast)       143 del vars, 212 del conss, 0 add conss, 350 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 3, fast)       143 del vars, 221 del conss, 0 add conss, 402 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 4, fast)       143 del vars, 221 del conss, 0 add conss, 454 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 5, fast)       143 del vars, 221 del conss, 0 add conss, 486 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 6, fast)       143 del vars, 221 del conss, 0 add conss, 501 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 7, fast)       143 del vars, 221 del conss, 0 add conss, 513 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 8, fast)       143 del vars, 221 del conss, 0 add conss, 536 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 9, exhaustive) 143 del vars, 221 del conss, 0 add conss, 542 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 10, fast)       143 del vars, 221 del conss, 0 add conss, 551 chg bounds, 0 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 11, exhaustive) 143 del vars, 229 del conss, 0 add conss, 557 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 12, fast)       143 del vars, 229 del conss, 0 add conss, 567 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 13, exhaustive) 143 del vars, 229 del conss, 0 add conss, 573 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 14, fast)       143 del vars, 229 del conss, 0 add conss, 583 chg bounds, 8 chg sides, 62 chg coeffs, 0 upgd conss, 0 impls, 145 clqs
(round 15, exhaustive) 143 del vars, 229 del conss, 0 add conss, 588 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 145 clqs
(round 16, fast)       143 del vars, 229 del conss, 0 add conss, 599 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 145 clqs
(round 17, medium)     166 del vars, 502 del conss, 525 add conss, 601 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 624 clqs
(round 18, fast)       166 del vars, 502 del conss, 525 add conss, 612 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 628 clqs
(round 19, exhaustive) 166 del vars, 502 del conss, 525 add conss, 626 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 628 clqs
(round 20, exhaustive) 166 del vars, 502 del conss, 525 add conss, 640 chg bounds, 8 chg sides, 62 chg coeffs, 372 upgd conss, 0 impls, 628 clqs
(round 21, exhaustive) 166 del vars, 502 del conss, 525 add conss, 643 chg bounds, 8 chg sides, 62 chg coeffs, 395 upgd conss, 0 impls, 628 clqs
(round 22, medium)     166 del vars, 525 del conss, 548 add conss, 644 chg bounds, 8 chg sides, 62 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 23, exhaustive) 166 del vars, 548 del conss, 548 add conss, 644 chg bounds, 8 chg sides, 62 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
   (0.0s) sparsify finished: 16/2476 (0.6%) nonzeros canceled - in total 16 canceled nonzeros, 24 changed coefficients, 0 added nonzeros
(round 24, exhaustive) 166 del vars, 548 del conss, 548 add conss, 644 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 25, fast)       175 del vars, 561 del conss, 548 add conss, 661 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 26, fast)       175 del vars, 574 del conss, 548 add conss, 729 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 27, fast)       176 del vars, 575 del conss, 548 add conss, 757 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
(round 28, fast)       176 del vars, 576 del conss, 548 add conss, 759 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 0 impls, 673 clqs
   (0.1s) probing cycle finished: starting next cycle
(round 29, exhaustive) 190 del vars, 576 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 620 clqs
(round 30, fast)       192 del vars, 632 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 620 clqs
(round 31, fast)       192 del vars, 633 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 620 clqs
(round 32, exhaustive) 196 del vars, 633 del conss, 548 add conss, 779 chg bounds, 8 chg sides, 86 chg coeffs, 395 upgd conss, 2340 impls, 571 clqs
   (0.1s) probing: 55/461 (11.9%) - 14 fixings, 0 aggregations, 2615 implications, 18 bound changes
   (0.1s) probing aborted: 50/50 successive totally useless probings
presolving (33 rounds: 33 fast, 14 medium, 12 exhaustive):
 196 deleted vars, 633 deleted constraints, 548 added constraints, 779 tightened bounds, 0 added holes, 8 changed sides, 86 changed coefficients
 2340 implications, 571 cliques
presolved problem has 586 variables (457 bin, 0 int, 0 impl, 129 cont) and 934 constraints
    571 constraints of type <setppc>
    363 constraints of type <linear>
Presolving Time: 0.07
 Consclassifier "nonzeros" yields a classification with 5  different constraint classes
 Consclassifier "constypes" yields a classification with 3 different constraint classes
 Consclassifier "constypes according to miplib" yields a classification with 3 different constraint classes
 Consclassifier "gamsdomain" yields a classification with 1  different constraint classes
 Consclassifier "gamssymbols" yields a classification with 1  different constraint classes
 Conspartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain" conspartition
 Varclassifier "gamsdomain" yields a classification with 1  different variable classes
 Varclassifier "gamssymbols" yields a classification with 1  different variable classes
 Varpartition "gamssymbols" is not considered since it offers the same structure as "gamsdomain"
 Varclassifier "vartypes" yields a classification with 2 different variable classes
 Varclassifier "varobjvals" yields a classification with 145 different variable classes
 Varclassifier "varobjvalsigns" yields a classification with 2 different variable classes
 the current varclass distribution includes 145 classes but only 18 are allowed for GCGconshdlrDecompCalcCandidatesNBlocks()
 in dec_consclass: there are 4 different constraint classes
  the current constraint classifier "nonzeros" consists of 5 different classes
  the current constraint classifier "constypes" consists of 3 different classes
  the current constraint classifier "constypes according to miplib" consists of 3 different classes
  the current constraint classifier "gamsdomain" consists of 1 different classes
 dec_consclass found 46 new partialdecs
dec_densemasterconss found 1 new partialdec
dec_neighborhoodmaster found 1 new partialdec
 the current varclass distribution includes 145 classes but only 9 are allowed for propagatePartialdec() of var class detector
POSTPROCESSING of decompositions. Added 13 new decomps.
Found 60 finished decompositions.

Chosen structure has 70 blocks, 49 master-only (static) variables, and 511 linking constraints.
This decomposition has a maxwhite score of 0.434945.
Warning: Discretization with continuous variables is only an experimental feature.
Matrix has 70 blocks, using 70 pricing problems.
  time | node  | left  |SLP iter|MLP iter|LP it/n| mem |mdpt |ovars|mvars|ocons|mcons|mcuts|  dualbound   | primalbound  |  deg   |  gap
p  0.3s|     1 |     0 |      0 |      0 |     - |  28M|   0 | 586 |   0 | 934 |   0 |   0 | 4.898650e+06 | 5.567928e+10 |   --   |  Large
p  0.4s|     1 |     0 |      0 |      0 |     - |  28M|   0 | 586 |   0 | 934 |   0 |   0 | 4.898650e+06 | 1.507009e+10 |   --   |  Large
   0.4s|     1 |     0 |      0 |      0 |     - |  28M|   0 | 586 |   0 | 934 |   0 |   0 | 5.990994e+06 | 1.507009e+10 |   --   |  Large
** 0.4s|     1 |     0 |      0 |      0 |     - |  29M|   0 | 586 | 119 | 935 | 582 |   0 | 5.990994e+06 | 1.507009e+10 |   0.00%|  Large

   0.4s|     1 |     0 |      0 |      0 |     - |  29M|   0 | 586 | 119 | 935 | 582 |   0 | 5.990994e+06 | 1.507009e+10 |   0.00%|  Large
   0.4s|     1 |     0 |      0 |      0 |     - |  29M|   0 | 586 | 189 | 935 | 582 |   0 | 5.990994e+06 | 1.507009e+10 |   0.00%|  Large
Starting reduced cost pricing...
*r 1.9s|     1 |     0 |   4854 |    171 |     - |  30M|   0 | 586 | 219 | 935 | 582 |   0 | 2.584065e+09 | 2.605843e+09 |  50.95%|   0.84%
   1.9s|     1 |     0 |   4854 |    171 |     - |  30M|   0 | 586 | 219 | 935 | 582 |   0 | 2.584065e+09 | 2.605843e+09 |  50.95%|   0.84%
WARNING: solution of pricing problem 1 not feasible:
  [linear] <p1_c706>:  +60.7888801<pr1_t_y_(10,16)>[B] (+1) -1.03005634e-05<pr1_t_z_(10,9)>[C] (+40125.3753) -<pr1_t_z_(10,15)>[C] (+40199.7658) +<pr1_t_z_(10,16)>[C] (+40170.0354) == 30.8785881704849;
;
violation: left hand side is violated by 0.233424945081946
*r 3.1s|     1 |     0 |   7639 |    184 |     - |  31M|   0 | 586 | 231 | 935 | 582 |   0 | 2.584065e+09 | 2.602742e+09 |  45.78%|   0.72%
   3.1s|     1 |     0 |   7639 |    184 |     - |  31M|   0 | 586 | 231 | 935 | 582 |   0 | 2.584065e+09 | 2.602742e+09 |  45.78%|   0.72%
WARNING: solution of pricing problem 1 not feasible:
WARNING: solution of pricing problem 1 not feasible:
  [linear] <p1_c706>:  +60.7888801<pr1_t_y_(10,16)>[B] (+1) -1.03005634e-05<pr1_t_z_(10,9)>[C] (+1923.84618) -<pr1_t_z_(10,15)>[C] (+2013.00872) +<pr1_t_z_(10,16)>[C] (+1983.38411) == 30.8785881704849;
;
violation: right hand side is violated by 0.26586421608015
  [linear] <p1_c706>:  +60.7888801<pr1_t_y_(10,16)>[B] (+1) -1.03005634e-05<pr1_t_z_(10,9)>[C] (+40125.1788) -<pr1_t_z_(10,15)>[C] (+40199.5692) +<pr1_t_z_(10,16)>[C] (+40169.8389) == 30.8785881704849;
;
violation: left hand side is violated by 0.233395555037145
WARNING: solution of pricing problem 1 not feasible:
WARNING: solution of pricing problem 1 not feasible:
WARNING: solution of pricing problem 1 not feasible:
  [linear] <p1_c698>:  +50.007684<pr1_t_y_(10,3)>[B] (+1) +<pr1_t_z_(10,3)>[C] (+81.53057) -<pr1_t_z_(10,4)>[C] (+100.768513) -1.03005634e-05<pr1_t_z_(10,9)>[C] (+93.2067318) == 30.8785881704849;
;
violation: left hand side is violated by 0.109807525411679
  [linear] <p1_c706>:  +60.7888801<pr1_t_y_(10,16)>[B] (+1) -1.03005634e-05<pr1_t_z_(10,9)>[C] (+93.2067318) -<pr1_t_z_(10,15)>[C] (+112.933267) +<pr1_t_z_(10,16)>[C] (+82.7604535) == 30.8785881704849;
;
violation: left hand side is violated by 0.263481646653364
  [linear] <p1_c706>:  +60.7888801<pr1_t_y_(10,16)>[B] (+1) -1.03005634e-05<pr1_t_z_(10,9)>[C] (+1923.84618) -<pr1_t_z_(10,15)>[C] (+2013.00872) +<pr1_t_z_(10,16)>[C] (+1983.38411) == 30.8785881704849;
;
violation: right hand side is violated by 0.26586421608015
  [linear] <p1_c706>:  +60.7888801<pr1_t_y_(10,16)>[B] (+1) -1.03005634e-05<pr1_t_z_(10,9)>[C] (+40125.1788) -<pr1_t_z_(10,15)>[C] (+40199.5692) +<pr1_t_z_(10,16)>[C] (+40169.8389) == 30.8785881704849;
;
violation: left hand side is violated by 0.233395555037145
WARNING: Dual bound 2.58244e+09 is larger than the objective of the primal solution 2.57673e+09. The solution might not be optimal.
   4.0s|     1 |     0 |  12997 |    200 |     - |  31M|   0 | 586 | 238 | 935 | 582 |   0 | 2.578354e+09 | 2.578354e+09 |  44.18%|   0.00%
   4.0s|     1 |     0 |  12997 |    200 |     - |  31M|   0 | 586 | 238 | 935 | 582 |   0 | 2.578354e+09 | 2.578354e+09 |  44.18%|   0.00%
  [linear] <c698>: <z_(10,4)>[C] (+100.768513) -<z_(10,3)>[C] (+81.53057) -50.007684<y_(10,3)>[B] (+1) +9.27031154e-06<x_(10)>[C] (+173.824512) == -30.8779368449555;
;
violation: right hand side is violated by 0.109807525411693
  [linear] <c706>: <z_(10,15)>[C] (+112.933267) -<z_(10,16)>[C] (+82.7604535) -60.7888801<y_(10,16)>[B] (+1) +9.27031154e-06<x_(10)>[C] (+173.824512) == -30.8779368449555;
;
violation: right hand side is violated by 0.263481646653364
   4.0s|     1 |     0 |  12997 |    200 |     - |  31M|   0 | 586 | 238 | 935 | 582 |   0 | 2.578354e+09 | 2.578354e+09 |   --   |   0.00%
   4.2s|     1 |     0 |  12997 |    200 |     - |  31M|   0 | 586 | 238 | 935 | 582 |   0 | 2.602742e+09 | 2.578354e+09 |   --   |   0.95%
SCIP Status        : problem is solved [optimal solution found]
Solving Time (sec) : 4.20
Solving Nodes      : 1
Primal Bound       : +2.60274245425254e+09 (5 solutions)
Dual Bound         : +2.60274245425254e+09
Gap                : 0.00 %

Can you please show me your code?

Can you please show me your code?

The code in my project is difficult to simplify, but I get the .lp file of the problem. I test this file using the following code and there is the same problem as I mentions above.
import pygcgopt as gcgp

model1 = gcgp.Model()
model1.readProblem('model.lp')
model1.optimize()

import pygcgopt as gcgp

model2 = gcgp.Model()
model2.readProblem('model.lp')
model2.setRealParam("numerics/feastol", 0.001)
model2.optimize()

The .lp file type cann't be uploaded in the comment  so I change it to .txt file.
model.txt

Sorry, it is the other way around. You need to set it to e.g. 1e-10. Which outputs the following optimal value +2.61353442596652e+09. Gurobi outputs 2.613534425966e+09. So, it is the right optimal value.

Sorry, it is the other way around. You need to set it to e.g. 1e-10. Which outputs the following optimal value +2.61353442596652e+09. Gurobi outputs 2.613534425966e+09. So, it is the right optimal value.

That works. Thank you!


Update porkbun hostname

Addresses #9

Thanks for opening the PR, I'll merge& release this tomorrow

Thanks for opening the PR, I'll merge& release this tomorrow

Is there a specific release date?

Can a new release be published with this change included?

<EMAIL_ADDRESS>&<EMAIL_ADDRESS>have been published with the hostname changes.


@default(cuid()) must be used with @id

The limitations documentation says the following:
Models must have an @id attribute and it must take one of these forms:
- Int @id
- String @default(uuid())
- String @default(cuid())

However, when I try the third form, I have the following error:

Error validating model "User": One field must be marked as the id field with the `@id` directive..

Either the documentation forgot to add the @id (and I can make a PR to update it), or there is a bug in Prisma

Hi,
This look like a typo in the limitations page. You also need to annotate the field with @id.
So all possible options are :

Int @id
String @id @default(uuid())
String @id @default(cuid())

Thanks for reporting! I will fix that page


updateRecall failing due to array size

Hello -
I love the idea behind Ebisu and would like to implement it in a project of mine. However, whenever I attempt to updateRecall - with any value - I'm running into the error:
RangeError: Array size is not a small enough positive integer

I'm not given any stack trace (into Ebisu itself, just that it's happening at the invocation line). For example. some of the calls I'm running are
ebisu.updateRecall([4, 4, 30000], 0.6077981651376146, 1, 1072)
ebisu.updateRecall([4, 4, 300], 0.6, 1, 16)
ebisu.updateRecall([4, 4, 300], 0.61, 1, 421243)
ebisu.updateRecall([4,4,300], 0.61, 1, 120)

Screenshot attached. Running in Safari 15.2 on Mac 12.1, taken from https://fasiha.github.io/ebisu.js/

I can dig in an try and diagnose it next week but I was wondering if this was an issue you are familiar with or might have any insight for me?

Ahh just poked into the source code and it requires whole numbers. However, if I pass values like 61 & 100 I get this error:

Error: {"prior":[4,4,300],"successes":61,"total":100,"tnow":120,"rebalance":true,"tback":300,"mean":1.6059075545285275,"m2":0.07552813502953318,"sig2":-2.5034109386622623}
f — ebisu.min.js:21:450
Global Code
evaluateWithScopeExtension
(anonymous function)
_wrapCall

Do you have any suggestions on how I might be able to use this library safely with as precise as values as possible?

Sorry for the delay! Yes, it’s a little bit obscure but there’s a pretty low limit on total due to numerical instability of evaluating the posterior. I allude to this limit here: https://github.com/fasiha/ebisu/blob/e9149049089a6904ac695a7f02895e5006bf09ab/ebisu/ebisu.py#L105

N.B. This function is tested for numerical stability for small total < 5. It may be unstable for much larger total.

The idea behind this feature is really to model apps like Duolingo where, instead of calling updateRecall after each “question” you answer, your “questions” are actually more like “sessions” and you update after a series of questions during which the same fact might be reviewed for a total of more than one time. In the Duolingo datasets for example this is 2-3 times (if I recall correctly).
It’s alas not able to handle your use case where you’re converting a subjective confidence in your quiz performance to a rational number (100/120, 1/16, etc.). Is this indeed what you’re doing? Let me know if that makes sense or if I’m misunderstanding! Life will be a bit busy for a few more days but I’ll do my best to help out!

The original issue, passing in floating point successes is now available in v2.1, just released!


Configure command doesn't accept valid client secret

Issue
The current client secret validation only accepts secrets with a length of exactly 30 characters. However, my valid secret has 31.
It's worth mentioning that my application is one of the so-called old applications. Maybe those are (or were) able to generate secrets with variable length.
Current workaround
Configure the CLI with a random 30 character secret and edit the resulting .twitch-cli.env file manually afterwards.

Thanks for the workaround- I thought I had addressed this, but must've slipped through the cracks.
I'll get this done in an upcoming PR- should be trivial.

Followup, this has a fix merged but isn't in a release just yet. I'll make sure that I followup once we cut a release.


Stop referring to requested IP address as "preferred"

The IPAM API lets you specify a "preferred IP address".  The word "preferred" to me suggests that it is OK to give a different address if that request cannot be satisfied, whereas the code behaves as if the request is non-negotiable.
Related change: https://github.com/docker/docker/pull/19723

Thanks for fixing this, the preferred wording was an unfortunate choice.
LGTM


some question about "CalendarSelection.Dates"

when i using "CalendarDialog"  , now i want to Select multiple dates , everyThings is  perfect . we have “CalendarSelection.Dates” ，but this is have no effect in “CalendarSelection.Dates.selectedDates”. When I open Dialog a second time  dialog does not display the contents of my last selection. my code Abstract :"  val selectedDates = remember { mutableStateOf(listOf()) } , selectedDates = selectedDates.value,"

Hey. Will be fixed, I already noticed it to while using it. This behavior actually can make sense in some cases if it's embedded in a container like the BottomSheet or PopUp. I will change the standard behavior to as what would be expected.

Will be the future version 1.0.2


hyper parameters for MultiWOZ

Hi ! For all datasets in dialoGLUE benchmark, I can reproduce similar results except for the MultiWOZ.
For ConverBERT-DG, your joint goal is around 58, but I can only get 56, which is the same as the original Trippy reported.
I wonder if you have used different hyper-parameters for Trippy?  If so, can you share them ?
Thank you!

Hey @YinpeiDai , you've mentioned that you succeeded in reproducing results for all tasks expect for MultiWOZ.
I am trying to reproduce results for slot tasks with the default script from the repository, however with no success. I wonder if your script for slot is different from one from the repository?

Hey @YinpeiDai , you've mentioned that you succeeded in reproducing results for all tasks expect for MultiWOZ.
I am trying to reproduce results for slot tasks with the default script from the repository, however with no success. I wonder if your script for slot is different from one from the repository?

@zabh0z no，I use the same script.

@zabh0z no，I use the same script.

How much JGA have you achieved?

Apologies for the long delay in addressing this issue. Our hyperparameters are in this script: https://github.com/alexa/dialoglue/blob/master/trippy/DO.example.advanced
Our 58 result is only achieved with --mlm_pre and --mlm_during.


FAQs: [CDS-98339]: FAQs Addition for 21st June

Thanks for contributing to the Harness Developer Hub! Our code owners will review your submission.
Description

Please describe your changes: __________________________________
Jira/GitHub Issue numbers (if any): ______________________________
Preview links/images (Internal contributors only): __________________

PR lifecycle
We aim to merge PRs within one week or less, but delays happen sometimes.
If your PR is open longer than two weeks without any human activity, please tag a code owner in a comment.
PRs must meet these requirements to be merged:

[ ] Successful preview build.
[ ] Code owner review.
[ ] No merge conflicts.
[ ] Release notes/new features docs: Feature/version released to at least one prod environment.

 Thank you for your submission! We really appreciate it. Like many open source projects, we ask that you sign our Contributor License Agreement before we can accept your contribution.You have signed the CLA already but the status is still pending? Let us recheck it.

Please check the Execution Link of the Pipeline for the Website Draft URL. This is located in the Preview Step behind the Harness VPN and also is available in #hdh_alerts. E.g Website Draft URL: https://unique-id--harness-developer.netlify.app. Current Draft URL is: https://6678e02aff107b14283e505b--harness-developer.netlify.app

Please check the Execution Link of the Pipeline for the Website Draft URL. This is located in the Preview Step behind the Harness VPN and also is available in #hdh_alerts. E.g Website Draft URL: https://unique-id--harness-developer.netlify.app. Current Draft URL is: https://66790f60af4203643007c827--harness-developer.netlify.app


hiding/removing "measurements" button?

Hello,
is there any way to hide/remove the "measurements" button?

Hi @ranasrule, this button is added when the MeasurementsExtension registers itself. You should be able to remove it by modifying this array:

https://github.com/OHIF/Viewers/blob/master/platform/viewer/src/App.js#L171-L176

It's currently a default extension for the PWA and @ohif/viewer builds, as there are some parts of the application that still need to be decoupled from it. When that happens, we'll remove it as part of the default bundle and you'll need to add it to the PWA entry point or register it at runtime for packaged source use.


Help using the code

Sorry to write about that, but your code that play movie won't work (I'm a new c# developer), probably i miss something.
This are the steps that I try:

Open a connection with chromecast a hit play (Null reference) at line 127
Load Application backdrop and hit the button nothing happen.

Could you what are the steps to play a movie/photo to chrome cast.
Thx for your help

Upgrade all Nuget packages and run it as an admin. That will help you with the first issue.


Fix CI snitch cluster

This PR prunes tests that are not applicable to the build for snitch cluster
Currently, there are several changes from the original PULP snitch_cluster. One in particular actually breaks our CI:
https://github.com/pulp-platform/snitch_cluster/commit/379ae99bfbe9d7a6892cf7984fd471846bf8769f
There are actually 2 options to move forward, since our development is different now from the original Snitch cluster:

We use our own docker but only prune the tests that work. At least we check that it builds but we cannot test FP (note that we are not using the latest FP unit anymore. Due to not rebasing on top of their main, we cannot follow up with it).

We take out the snitch_cluster from our CI. It doesn't make sense to have it tested on our side anyway because (1) we're not using Snitch cluster and (2) there are several changes in the original pulp snitch that are not added here. We have totally branched out and will never be rebasing from the main again.

With the tapeout at hand, I believe no RTL person has time to check and fix the Snitch cluster. So this is just a proposed fixed to make sure CI is clean.

I think you can still select the correct compiler and runtime to finish CI. See PR278?

I think you can still select the correct compiler and runtime to finish CI. See PR278?

I actually tried this. Still wasn't working sadly haha

I think you can still select the correct compiler and runtime to finish CI. See PR278?

I actually tried this. Still wasn't working sadly haha

It is very weird that the system works quite well and suddenly it fails😭😭

I think you can still select the correct compiler and runtime to finish CI. See PR278?

I actually tried this. Still wasn't working sadly haha

It is very weird that the system works quite well and suddenly it fails😭😭

For one, it is indeed caused by the recent updates of the PULP people. The CI of the snitch cluster was using their pre-built docker container and they made changes.
I don't have time to investigate :( that's as far as I could get sadly.
I'll wait for @jorendumoulin  and @JosseVanDelm 's thoughts hehe
Also, @jorendumoulin and @JosseVanDelm take note that... I don't think many of us have the bandwidth to look at these. We're a bit in a tight spot :')

Hmm that's annoying... A third option would be to fix the commit of the pulp docker build we're using to the last working one sha256:7e6603fbc524eab9b5136f233545302e30983762310bc71b1e1633bfc81ae924.
Although if we can run it on our own container without disabling any useful tests, this is even better in my opinion.
The only test that seems to be relevant that gets removed is sw/snitch-cluster-runtime.yaml. What does this test and is this not important to us?

A third option would be to fix the commit of the pulp docker build we're using to the last working one

I think this is better if we still want to maintain their checks with the Snitch cluster. BUT! What doesn't make sense anymore is that we just froze it, continue with our own developments but not much related to what snitch cluster is anymore. Yet we also still have that Snitch cluster CI even though it's as if it's not being developed or used anymore. That's why I thought taking it out might be better too.

What does this test and is this not important to us?

I believe these ones have something to do with the top-level. Where clusters communicate with other clusters but this just checks signals coming from our clusters. @IveanEx modified other things (not sure which) to make it work on our Hemaia top.
@IveanEx do you think the tests in this yaml file are still relevant to us?

We have totally branched out and will never be rebasing from the main again.

:cry:
Proposed change looks okay for me, although I do agree with @jorendumoulin, sw/snitch-cluster-runtime.yaml seems important to us?

Do we have the go signal to push this? haha

@rgantonio I do not understand your comment:

I believe these ones have something to do with the top-level. Where clusters communicate with other clusters but this just checks signals coming from our clusters. @IveanEx modified other things (not sure which) to make it work on our Hemaia top.

I don't understand why we would want to break these tests for the default case?
@IveanEx can you please clarify?

@rgantonio I do not understand your comment:

I believe these ones have something to do with the top-level. Where clusters communicate with other clusters but this just checks signals coming from our clusters. @IveanEx modified other things (not sure which) to make it work on our Hemaia top.

I don't understand why we would want to break these tests for the default case?
@IveanEx can you please clarify?

I think the problems come from the recently updated docker image from ETH that broke the test. The failing tests were using the original snitch docker image instead of snax docker image. However, I also have no idea on why these works fails on snax docker image...

This is obsolete. Check PR #402


Error building cpprestsdk on windows

I am trying to update to the latest packages and getting a build error in cpprestsdk.

 Gets the following error messages when compiling ws_client_wspp.cpp
1>ws_client_wspp.cpp
1>E:\projects\wheat_eth_blade4_prototype_nmos\sw\3rdparty\install-nmos\win64\include\boost-1_72\boost/asio/impl/executor.hpp(218,1): error C2678: binary '==': no operator found which takes a left-hand operand of type 'const Executor' (or there is no acceptable conversion)
1>        with
1>        [
1>            Executor=std::reference_wrapper<boost::asio::io_service>
1>        ]
1>E:\Program Files (x86)\Microsoft Visual Studio\2019\Professional\VC\Tools\MSVC\14.24.28314\include\thread(205,24): message : could be 'bool std::operator ==(std::thread::id,std::thread::id) noexcept' [found using argument-dependent lookup]
1>E:\Program Files (x86)\Microsoft Visual Studio\2019\Professional\VC\Tools\MSVC\14.24.28314\include\random(2031,24): message : or       'bool std::operator ==(const std::bernoulli_distribution &,const std::bernoulli_distribution &)' [found using argument-dependent lookup]
1>E:\projects\wheat_eth_blade4_prototype_nmos\sw\3rdparty\install-nmos\win64\include\boost-1_72\boost/asio/impl/executor.hpp(218,1): message : while trying to match the argument list '(const Executor, const Executor)'
1>        with
1>        [
1>            Executor=std::reference_wrapper<boost::asio::io_service>
1>        ]
1>E:\projects\wheat_eth_blade4_prototype_nmos\sw\3rdparty\install-nmos\win64\include\boost-1_72\boost/asio/impl/executor.hpp(213): message : while compiling class template member function 'bool boost::asio::executor::impl<Executor,std::allocator<void>>::equals(const boost::asio::executor::impl_base *) noexcept const'
1>        with
1>        [
1>            Executor=std::reference_wrapper<boost::asio::io_service>
1>        ]
1>E:\projects\wheat_eth_blade4_prototype_nmos\sw\3rdparty\install-nmos\win64\include\boost-1_72\boost/asio/impl/executor.hpp(333): message : see reference to class template instantiation 'boost::asio::executor::impl<Executor,std::allocator<void>>' being compiled
1>        with
1>        [
1>            Executor=std::reference_wrapper<boost::asio::io_service>
1>        ]
1>E:\Program Files (x86)\Microsoft Visual Studio\2019\Professional\VC\Tools\MSVC\14.24.28314\include\xmemory(202): message : see reference to function template instantiation 'boost::asio::executor::executor<_Ty>(Executor)' being compiled
1>        with
1>        [
1>            _Ty=std::reference_wrapper<boost::asio::io_service>,
1>            Executor=std::reference_wrapper<boost::asio::io_service>
1>        ]
1>E:\Program Files (x86)\Microsoft Visual Studio\2019\Professional\VC\Tools\MSVC\14.24.28314\include\memory(1490): message : see reference to function template instantiation 'void std::_Construct_in_place<_Ty,std::reference_wrapper<boost::asio::io_service>>(_Ty &,std::reference_wrapper<boost::asio::io_service> &&) noexcept(false)' being compiled
1>        with
1>        [
1>            _Ty=boost::asio::ip::tcp::socket
1>        ]
1>E:\Program Files (x86)\Microsoft Visual Studio\2019\Professional\VC\Tools\MSVC\14.24.28314\include\memory(1590): message : see reference to function template instantiation 'std::_Ref_count_obj2<_Ty>::_Ref_count_obj2<std::reference_wrapper<boost::asio::io_service>>(std::reference_wrapper<boost::asio::io_service> &&)' being compiled
1>        with
1>        [
1>            _Ty=boost::asio::ip::tcp::socket
1>        ]
1>E:\Program Files (x86)\Microsoft Visual Studio\2019\Professional\VC\Tools\MSVC\14.24.28314\include\memory(1591): message : see reference to function template instantiation 'std::_Ref_count_obj2<_Ty>::_Ref_count_obj2<std::reference_wrapper<boost::asio::io_service>>(std::reference_wrapper<boost::asio::io_service> &&)' being compiled
1>        with
1>        [
1>            _Ty=boost::asio::ip::tcp::socket
1>        ]
1>E:\projects\wheat_eth_blade4_prototype_nmos\sw\3rdparty\cpprestsdk\cpprestsdk-2.10.15\cpprestsdk\Release\libs\websocketpp\websocketpp/transport/asio/security/none.hpp(172): message : see reference to function template instantiation 'std::shared_ptr<websocketpp::transport::asio::basic_socket::connection::socket_type> std::make_shared<boost::asio::ip::tcp::socket,std::reference_wrapper<boost::asio::io_service>>(std::reference_wrapper<boost::asio::io_service> &&)' being compiled
1>E:\projects\wheat_eth_blade4_prototype_nmos\sw\3rdparty\install-nmos\win64\include\boost-1_72\boost/asio/use_future.hpp(139): message : see reference to class template instantiation 'boost::asio::use_future_t<std::allocator<void>>::std_allocator_void' being compiled
1>E:\projects\wheat_eth_blade4_prototype_nmos\sw\3rdparty\install-nmos\win64\include\boost-1_72\boost/asio/use_future.hpp(147): message : see reference to class template instantiation 'boost::asio::use_future_t<std::allocator<void>>' being compiled
1>Done building project "cpprest.vcxproj" -- FAILED.

I have tried this without the asio settings also and the same (or least very similar) error is received.
Any suggestions?
Thanks.

WebSocket++ 0.8.1 isn't compatible with Boost 1.70+. See #102 for further explanation.
Good news is that the patch has been known for a long time but has been finally merged to master and released as WebSocket++ 0.8.2. Now waiting for cpprestsdk to bump its git submodule commit (there's a PR for that too).
Update the submodule or install WebSocket++ 0.8.2 manually, and all is good.

Thanks.  You are the best!
These are the git commands I used in order to get the patch which compiles without errors with Bosst 1.72.
git clone --recurse-submodules --branch v2.10.15 https://github.com/Microsoft/cpprestsdk
git submodule update --init --recursive --remote

Does the dependency information mention that this extra step is needed? It mentions 1.72 but I did not see a mention of the possible negative effects.
Thanks again for the quick response.


Request:  HTML5 playback speed setting

How would I add an option to always set the playback speed to 1.5?

Seconding this feature request

@sagz If you're on Chrome, use this cool addon

@Eisys Thanks for that! Sadly, I'm not on Chrome[ium] :)


Fix E2E tests: Enable item TTL on CosmosDB container

Currently, e2e test runs are failing on actor state TTL https://github.com/dapr/dapr/actions/workflows/dapr-test.yml
This looks to be because we are using the CosmosDB without TTL being enabled at the container level.
PR enables TTL, but set no default value.
See: https://learn.microsoft.com/en-us/azure/cosmos-db/nosql/how-to-time-to-live?tabs=dotnet-sdk-v3

/ok-to-test

@JoshVanL the tests seem to fail with a similar error.

/ok-to-test

/ok-to-test

/ok-to-test

For now the newly added E2E actor state test has been disabled for cosmos's

/ok-to-test

Thanks @ItalyPaleAle, done!

/ok-to-test

/ok-to-test

Fixed now in #6199, so I'll close this
Additional issues included:

In the Bicep file, the TTL property had to be put inside resources, otherwise it wasn't recongized
There was a race condition in assert.Eventually. Because the function defined inside is executed in a background goroutine, storing state in variables defined outside of the lambda was causing data race conditions (our GitHub Actions agents seem to be very slow...


Ip manager refactor

Description

A refactor of ipAddressManagerImpl for investigating failures with test_nic and retrieval of ip addresses in our cloud

Types of changes

[ ] Breaking change (fix or feature that would cause existing functionality to change)
[ ] New feature (non-breaking change which adds functionality)
[ ] Bug fix (non-breaking change which fixes an issue)
[ ] Enhancement (improves an existing feature and functionality)
[x] Cleanup (Code refactoring and cleanup, that may add test cases)

Screenshots (if appropriate):
How Has This Been Tested?

@blueorangutan package

@DaanHoogland a Jenkins job has been kicked to build packages. I'll keep you posted as I make progress.

Packaging result: ✖centos6 ✔centos7 ✔debian.  I'll keep you posted as I make progress.

Packaging result: ✖centos6 ✖centos7 ✖debian. JID-1032

@DaanHoogland any work on this or is this abandoned (in which case close this)?

I won't close this or work on it soon. It is a constant reminder of one of the more un-maintainable pieces of code. And I will revisit when work on the IP manager will be needed.

retry sometime later