79686577

Date: 2025-07-01 20:48:01
Score: 2
Natty:
Report link

You could demultiplex the intened service checkout sucess events by adding metadata to the checkout session like webhook_target: 'website-a', then in your website-a 's webhook handler ignore anything that comes with outer webhook_target

Reasons:
  • Low length (0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (0.5):
Posted by: Dago A Carralero

79686549

Date: 2025-07-01 20:10:53
Score: 3.5
Natty:
Report link

I couldn't find a nice way to do this, so I made a gem to make it easy once there are conflicts.

https://github.com/SixiS/rails-conflicted-credentials

Reasons:
  • Probably link only (1):
  • Low length (1):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Matthew Hirst

79686546

Date: 2025-07-01 20:02:52
Score: 0.5
Natty:
Report link

I removed all git dependencies from my toml/setup.py since pypi is very strict about that and added a try except to my entry point before the import in question. So I have an intentionally failed import when you run the code the first time. This triggers the subprocess to install the package then reruns the code. So the user can still pip install your package and then your package installs the git dependency when they run it.

This is dependent on the user having git on their system. Not a perfect solution but a decent workaround.

import subprocess
import sys
import os

try:
    from svcca import something
except ImportError:
    print("svcca not found. Installing from GitHub...")
    subprocess.check_call([
        sys.executable,
        "-m", "pip", "install",
        "svcca @ git://github.com/themightyoarfish/svcca-gpu.git"
    ])
    print("Installation complete. Relaunching please wait..")
    os.execv(sys.executable, [sys.executable] + sys.argv)
Reasons:
  • Long answer (-0.5):
  • Has code block (-0.5):
  • Unregistered user (0.5):
  • Low reputation (1):
Posted by: user30942190

79686540

Date: 2025-07-01 19:53:50
Score: 1.5
Natty:
Report link

I'm not sure this resolves the issue, the vite dev react-router is not for releases. I have also tried to configure the react-router package without any luck.

export default defineConfig({
  optimizeDeps: {
    include: ['react-router-dom'],
  },
  build: {
    commonjsOptions: {
      include: [/react-router/, /node_modules/],
    },
  }
});
Reasons:
  • Blacklisted phrase (1.5): any luck
  • Has code block (-0.5):
  • Low reputation (0.5):
Posted by: Brian Lee

79686538

Date: 2025-07-01 19:52:50
Score: 4
Natty:
Report link

I am getting the same error.

According to the documentation, expo-maps is not available in Expo Go.

But I am not sure whether I have installed Expo Go (I think I did).

Reasons:
  • RegEx Blacklisted phrase (1): I am getting the same error
  • Low length (1):
  • No code block (0.5):
  • Me too answer (2.5): I am getting the same error
  • High reputation (-1):
Posted by: Yvonne Aburrow

79686532

Date: 2025-07-01 19:40:46
Score: 1
Natty:
Report link

import speech_recognition as sr

import pyttsx3

import datetime

import webbrowser

engine = pyttsx3.init()

def speak(text):

engine.say(text)

engine.runAndWait()

def take_command():

recognizer = sr.Recognizer()

with sr.Microphone() as source:

    print("Listening...")

    audio = recognizer.listen(source)

try:

    query = recognizer.recognize_google(audio, language='en-in')

    print("User said:", query)

    return query

except:

    speak("Sorry, I didn't catch that.")

    return ""

def execute(query):

query = query.lower()

if "time" in query:

    time = datetime.datetime.now().strftime("%H:%M")

    speak(f"The time is {time}")

elif "open youtube" in query:

    webbrowser.open("https://youtube.com")

    speak("Opening YouTube")

else:

    speak("I can't do that yet.")

speak("Hello, I am Jarvis")

while True:

command = take_command()

if "stop" in command or "bye" in command:

    speak("Goodbye!")

    break

execute(command)
Reasons:
  • Blacklisted phrase (1): youtube.com
  • Long answer (-0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Maheshwar Bhoyar

79686529

Date: 2025-07-01 19:33:44
Score: 1
Natty:
Report link

Ok, I get it now. Sorry, the parameters are somewhat confusing. This works:

    analysisValueControl = new FormControl({value: '', disabled: true}, {validators: [
        Validators.required, Validators.pattern(/^([+-]?[\d\.,]+)(\([+-]?[\d\.,]+\))?([eE][+-]?\d+)?$/i) ],
        updateOn: 'blur'});
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Self-answer (0.5):
  • Low reputation (0.5):
Posted by: Eem

79686528

Date: 2025-07-01 19:32:43
Score: 0.5
Natty:
Report link

I am guessing that you're issue is because you aren't giving your servo an initial value, so the pin is likely floating. Try adding

helloServo.write(360);

to the end of your void setup(), this should make the servo start at the 360 position.

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (0.5):
Posted by: Zico

79686527

Date: 2025-07-01 19:32:43
Score: 0.5
Natty:
Report link

There are two namespaces that bitbake concerns itself with - recipe names (a.k.a. build time targets) and package names (a.k.a. runtime targets). You can specify a build time target on the bitbake command line, but not a runtime target; you need to find the recipe that provides the package you are trying to build and build that instead (or simply add that package to your image and build the image). In current versions bitbake will at least tell you which recipes have matching or similar-sounding runtime provides (RPROVIDES) so that you'll usually get a hint on which recipe you need to build.

LINK

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: JoeManiaci

79686520

Date: 2025-07-01 19:16:41
Score: 3
Natty:
Report link

The condition you're using seems to have an issue because the output of currentRange and currentRange.getValues() doesn't match what the condition expects and that's why else condition triggers instead.

If you check the value by using console you will get the output of:

console.log(currentRange) = object
console.log(currentRange.getValues()) = undefined

Agreeing to @Martin using strings to retrieve the ranges.

To make it work here's a modified version of your code:

function SUM_UNCOLORED_CELLS(...ranges) {
  var ss = SpreadsheetApp.getActiveSpreadsheet().getActiveSheet();
  var rl = ss.getRangeList(ranges);
  var bg = rl.getRanges().map(rg => rg.getBackgrounds());
  return bg.flat(2).filter(c => c == "#ffffff").length;
}

To learn more about how to pass a range into a custom function in Google Spreadsheets, you can read this post: How to pass a range into a custom function in Google Spreadsheets?

Reasons:
  • Long answer (-0.5):
  • Has code block (-0.5):
  • Ends in question mark (2):
  • User mentioned (1): @Martin
  • Looks like a comment (1):
Posted by: Lime Husky

79686519

Date: 2025-07-01 19:15:40
Score: 1.5
Natty:
Report link

Im also searching for it, but it looks like you have to make 1 subscription and then add different base plans to it. I dont get why there isn't more info about this. Im also trying to just have 3 different subscriptions and upgrade/downgrade between them. When I created 3 subscriptions in the google play console, im able to subscribe to all 3 of them in my app. I think because it doesn't see it as a sub group. Im going to try to make one subscription with 3 base plans and see if it's able to detect it then. I don't know if this is the correct way tho...

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: user30080221

79686516

Date: 2025-07-01 19:13:40
Score: 1.5
Natty:
Report link

The likely problem is the stream argument cannot be 0 (i.e. default stream). You will need to specify a named stream that was created with cudaStreamCreate*()

You also don't have to specify the location hints because "The cudaMemcpyAttributes::srcLocHint and cudaMemcpyAttributes::dstLocHint allows applications to specify hint locations for operands of a copy when the operand doesn't have a fixed location. That is, these hints are only applicable for managed memory pointers on devices where cudaDevAttrConcurrentManagedAccess is true or system-allocated pageable memory on devices where cudaDevAttrPageableMemoryAccess is true."

Reasons:
  • No code block (0.5):
  • Low reputation (1):
Posted by: sniper_elite

79686509

Date: 2025-07-01 19:03:38
Score: 1.5
Natty:
Report link

📱 SALES TEAM APP: Features Breakdown

1. Login Page

Username & password (must be created from Manager app)

Login only allowed if Sales ID exists

2. Food Items List

Show photo, name, price

Search or filter option (optional)

3. Create Invoice

Select food items

Quantity & total price calculation

Save invoice

4. Daily Invoice History

Show list of invoices created on the current day

Option to view details

5. Send Feedback

Text input

Sends directly to Manager (stored in database

Reasons:
  • No code block (0.5):
  • Low reputation (1):
Posted by: BIBIN

79686499

Date: 2025-07-01 18:54:35
Score: 0.5
Natty:
Report link

Totally fair — let me clarify a bit.

The root issue seems to stem from how Jekyll resolves file system deltas during its incremental rebuild cycle. When it detects changes, it re-evaluates its asset manifest, and sometimes if your style.css isn’t explicitly locked into the precompiled asset flow, Jekyll will fall back to its inferred default — in this case, normalize.css.

One common workaround is to abstract your custom styles into a partial (e.g., _custom.scss) and then import that into a master stylesheet that’s definitely tracked by Jekyll’s pipeline. Alternatively, some folks set a manual passthrough override in _config.yml to ensure asset pathing stays deterministic during rebuilds. You might also try placing your custom style.css outside the default watch scope and reference it via a canonical link to bypass the regeneration logic entirely.

Let me know if that helps at all — happy to fine-tune based on your setup.

Reasons:
  • Long answer (-0.5):
  • Has code block (-0.5):
  • Unregistered user (0.5):
  • Low reputation (1):
Posted by: john shmith

79686495

Date: 2025-07-01 18:50:34
Score: 1
Natty:
Report link

The wikipedia page on rotation matrices shows 1's on the diagonal.

I believe scipy replaces the 1's on the diagonal with

w^2+x^2+y^2+x^2

That makes them the same for a unit quaternion.

For non-unit quaternions, scipy's matrix acts as both a rotation and a scaling.

For example:

if you take the quaternion = 2 +0i+0j+0k.

The rotation matrix will be the identity matrix (with only a w term there is no rotation),

Scipy's matrix will be 2*identity, because in also includes the scaling.

Reasons:
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: Neil Butcher

79686492

Date: 2025-07-01 18:47:33
Score: 1
Natty:
Report link
type NewsItemPageProps = Promise<{ id: string }>;

async function NewsItemPage(props: { params: NewsItemPageProps }) {
  const params = await props.params;
  const id = params.id;

this code works

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: mttinor

79686490

Date: 2025-07-01 18:46:33
Score: 3.5
Natty:
Report link

I suggest you try using Long Path Tool. It is very convenient.

Reasons:
  • Low length (1.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Jabby Wakhoyo

79686484

Date: 2025-07-01 18:43:32
Score: 3.5
Natty:
Report link

Turn On Invisibles from Editor menu:
Menu Bar -> Editor -> Invisibles
enter image description here

Reasons:
  • Probably link only (1):
  • Low length (1.5):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: KMR

79686475

Date: 2025-07-01 18:26:29
Score: 2
Natty:
Report link

The solution is to reset the ref value on blur.

Reasons:
  • Whitelisted phrase (-1): solution is
  • Low length (1.5):
  • No code block (0.5):
  • Self-answer (0.5):
  • Single line (0.5):
Posted by: icicleking

79686472

Date: 2025-07-01 18:23:28
Score: 2.5
Natty:
Report link

There’s a required field called "What’s New in This Version", and it hasn’t been filled out with the updates included in your current build. Please add the relevant changes or improvements made in this version to that field, and this issue will be resolved.

Reasons:
  • Low length (0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Ibraheem Shawhnee

79686466

Date: 2025-07-01 18:20:27
Score: 2.5
Natty:
Report link

web servers usually buffer output til some conditions are met (buffer is full, or end of data to send). there is no way around to bypass it except using http headers. one of them is sending data as chunked using transfer-encoding: chunked

Reasons:
  • Low length (0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: tester

79686465

Date: 2025-07-01 18:19:26
Score: 3
Natty:
Report link

Add trailingSlash: false, in your next.config.ts or js file

reference:
https://github.com/aws-amplify/amplify-hosting/issues/3819#issuecomment-1819740774

Reasons:
  • Probably link only (1):
  • Low length (1.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Muhammad Taha

79686463

Date: 2025-07-01 18:17:26
Score: 2.5
Natty:
Report link

Jupyter notebook is certainly a great option. You can also use Anaconda platform. Download it for working on python(right from opening .ipynb files to host of other activities for data science are facilitated there.

Reasons:
  • Low length (0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Shwetank

79686462

Date: 2025-07-01 18:17:26
Score: 1
Natty:
Report link

I have this problem but this is my error

❌ Error creando PriceSchedule: {
  "errors": [
    {
      "id": "3e8b4645-20bc-492a-93c9-x",
      "status": "409",
      "code": "ENTITY_ERROR.NOT_FOUND",
      "title": "There is a problem with the request entity",
      "detail": "The resource 'inAppPurchasePricePoints' with id 'eyJzIjoiNjc0NzkwNTgyMSIsInQiOiJBRkciLCJwIjoiMTAwMDEifQ' was not found.",
      "source": {
        "pointer": "/included/relationships/inAppPurchasePricePoints/data/0/id"
      }
    }
  ]
}
Reasons:
  • Blacklisted phrase (1): I have this problem
  • Long answer (-0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: vitto dev

79686456

Date: 2025-07-01 18:09:23
Score: 1.5
Natty:
Report link

from moviepy.editor import VideoFileClip, AudioClip import numpy as np

Re-define file path after environment reset

video_path = "/mnt/data/screen-٢٠٢٥٠٦٢٩-١٥٢٢٢٤.mp4"

Reload the video and remove original audio

full_video = VideoFileClip(video_path).without_audio()

Define chunk length in seconds

chu

nk_length =

Reasons:
  • No code block (0.5):
  • Low reputation (1):
Posted by: ali wahab

79686455

Date: 2025-07-01 18:09:23
Score: 4
Natty: 3.5
Report link

no, I don't have such a file

wqwqqwwq

Reasons:
  • Low length (2):
  • No code block (0.5):
  • Unregistered user (0.5):
  • Low reputation (1):
Posted by: user30941549

79686450

Date: 2025-07-01 18:03:22
Score: 0.5
Natty:
Report link

Perhaps less efficient, but concise for the basic escapes without libraries using JDK 15+

  public static String escape(String s) {
    for (char c : "\\\"bfnrt".toCharArray())
      s = s.replace(("\\" + c).translateEscapes(), "\\" + c);
    return s;
  }
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (0.5):
Posted by: bourne2program

79686444

Date: 2025-07-01 17:49:19
Score: 1.5
Natty:
Report link

try to pass it directly "

classpath "org.jetbrains.kotlin:kotlin-gradle-plugin:$kotlin_version"

" to

classpath "org.jetbrains.kotlin:kotlin-gradle-plugin:1.9.20"

Reasons:
  • Low length (1):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Joker

79686443

Date: 2025-07-01 17:47:18
Score: 0.5
Natty:
Report link

I think that approach works, but has some drawbacks like limiting the capabilities of a event driven architecture, that is asynchronous by nature or ending up with tons of messages to be sent because you are adding too much latency.

What i would do to stop some bots to flood the kafka pipelines, would be to implement a debounce system. i.e a bot would need to cooldown for a period before being able to send a message. That way you are not sending one message a time from all of the bots, but by making sure the more active bots only send every certain milliseconds, you allow the less active bots to send their messages

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: JoaoFCarvalho

79686426

Date: 2025-07-01 17:35:15
Score: 2.5
Natty:
Report link

TLDR: The operation described is not an algorithm so big-O does not apply

What is the big O of the algorithm below?

It is not an algorithm to begin with because the operation (in the lack of a better word) you described does not fit the standard definition of what constitutes an algorithm. If it is not an algorithm, you probably should not describe it using big O notation.

As pointed out in the previous answer, the use of a PRNG is probabilistically distributed, so the time bounds would converge to a finite set of steps eventually. The rest of my answer will now assume a truly random number generating function as part of your "algorithm".

What is and isn't an algorithm?

Knuth describes an algorithm in TAOCP [1, pp. 4-7] as a "finite set of rules that gives a sequence of operations for solving a specific type of problem", highlighting the characteristics of finiteness, definiteness, input, output, effectiveness.

For concision, your described operation does not:

Moreover, the lack of finiteness prompting this operation to potentially run without ever finding a 5 digit number not in the DB perfectly classifies it as an undecidable problem.

Undecidable problems are not algorithms

Recall that decidability means whether or not a decision problem can be correctly solved if there exists an effective method (finite time deterministic procedure) for solving it [2].

For same reason and akin to the Halting problem [3], your operation is undecidable because it is impossible to construct an algorithm that always correctly determines [see 4] a new 5 digit random number effectively. The operation described is merely a problem statement, and not an algorithm because it still needs an algorithm to correctly and effectively solve it.

Analysis of undecidable problems

Reasons:
  • RegEx Blacklisted phrase (2): even I am
  • Long answer (-1):
  • No code block (0.5):
  • Contains question mark (0.5):
  • Low reputation (0.5):
Posted by: M.A.

79686422

Date: 2025-07-01 17:32:14
Score: 1
Natty:
Report link

Here's two options that worked for me that may also work for you.

Reasons:
  • Whitelisted phrase (-1): worked for me
  • Low length (0.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: NeverSuite

79686419

Date: 2025-07-01 17:29:13
Score: 2
Natty:
Report link

updating with below code after suggestions on comment section , solves the issue:

sns.pointplot(x=group['Month'], y=group['Rate'], ax=ax1)
Reasons:
  • Low length (1):
  • Has code block (-0.5):
  • Self-answer (0.5):
  • Low reputation (1):
Posted by: Vineet Tripathi

79686418

Date: 2025-07-01 17:27:12
Score: 1
Natty:
Report link

START OF PART 1 (Base64 PDF content)

JVBERi0xLjQKJeLjz9MKMSAwIG9iago8PC9UeXBlIC9DYXRhbG9nCi9QYWdlcyAyIDAgUgovT3Blb nRpbWVzIDEgMCBSCi9NZXRhZGF0YSAzIDAgUgovUm9vdCA0IDAgUgo+PgplbmRvYmoKMiAwIG9iag o8PC9UeXBlIC9QYWdlcwovS2lkcyBbNSAwIFJdCi9Db3VudCAxCj4+CmVuZG9iagozIDAgb2JqCjw 8L01ldGFkYXRhIDw8L0NyZWF0b3IgKENoYXQgR1BUIFBERiBJbnRlcmZhY2UpL0NyZWF0aW9uRGF0 ZSAoRDoyMDI1MDYxMDEyMzQ1NS0wNScwMCcpPj4KL1R5cGUgL01ldGFkYXRhPj4KZW5kb2JqCjQgM CBvYmoKPDwvVHlwZSAvUGFnZQovUGFyZW50IDIgMCBSCi9NZWRpYUJveCBbMCAwIDU5NSA4NDJdCi9 Db250ZW50cyA2IDAgUgovUmVzb3VyY2VzIDw8L0ZvbnQgPDwvRjEgNyAwIFI+Pj4KPj4KZW5kb2Jq CjUgMCBvYmoKPDwvVHlwZSAvUGFnZQovUGFyZW50IDIgMCBSCi9NZWRpYUJveCBbMCAwIDU5NSA4NDJ dCi9Db250ZW50cyA3IDAgUgovUmVzb3VyY2VzIDw8L0ZvbnQgPDwvRjEgNyAwIFI+Pj4KPj4KZW5k b2JqCjYgMCBvYmoKPDwvTGVuZ3RoIDQzNCA+PgpzdHJlYW0KQlQKIDAgMCBUZgoxMiBUZiAoRGF0ZT ogICAgICAgICAgIFRoZSBQcmluY2lwYWwgVG8gdXNlIHRoaXMgYXBwbGljYXRpb24gdG8gaW5zdGFs bCBtdWx0aW1lZGlhIHN5c3RlbSBpbiB0aGUgY2xhc3Jvb21cclxuCkZpcnN0LCB3ZSBhcHByZWNpY XRlIHRoYXQgdGhlIGluc3RhbGxhdGlvbiBvZiBtdWx0aW1lZGlhIGlzIHZlcnkgdXNlZnVsIGZvciB sZWFybmluZyBhbmQgdGVhY2hpbmcgZWZmZWN0aXZlbHkgc3R1ZGVudHMuIFdpdGggdGhpcyBzeXN0Z W0sIHRlYWNoZXJzIGNhbiBlYXNpbHkgZXhwbGFpbiBjb25jZXB0cyB1c2luZyB2aWRlb3MgYW5kIGF uaW1hdGlvbnMgdG8gbWFrZSBsZXNzb25zIG1vcmUgaW50ZXJlc3RpbmcuXHJcblRoYW5rIHlvdSB2Y XJpb3VzbHkuXHJcblxuU2lua2VybHksXHJcblx0TGFteWVhIFNoYXJtZW5cclxuUm9sbCBObzogX1xc XFxcbkNsYXNzOiBfXFxcbgoK Ci0tLQ==

END OF PART 1

---

Reasons:
  • Long answer (-1):
  • No code block (0.5):
  • Unregistered user (0.5):
  • Low reputation (1):
Posted by: Lamyea

79686407

Date: 2025-07-01 17:23:11
Score: 3.5
Natty:
Report link

Try windows_disk_utils package

Reasons:
  • Low length (2):
  • Has code block (-0.5):
  • Has no white space (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Jeeva S

79686399

Date: 2025-07-01 17:10:09
Score: 3
Natty:
Report link

Although it's an old question, I think it's worth sharing the solution. After struggling for 4–5 hours myself, I finally resolved it by changing the network mode to 'Mirrored' in the WSL settings.

enter image description here

Reasons:
  • Probably link only (1):
  • Low length (0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (0.5):
Posted by: Nazmul Hossain

79686393

Date: 2025-07-01 17:05:08
Score: 1
Natty:
Report link

CORS (Cross-Origin Resource Sharing) is a security policy that prevents domains from being accessed or manipulated by other domains that are not allowed. I assume you are trying to perform an operation from a different domain.

There are three ways to avoid being blocked by this policy:

  1. The domain you are trying to manipulate explicitly allows your domain to run its scripts.

  2. You perform the operation using a local script or a browser with CORS disabled (e.g., a CORS-disabled Chrome).

  3. You perform the operation within the same domain or its subdomains. You can test this easily in the browser console via the inspector.

Here is a useful link that addresses a similar problem:
Error: Permission denied to access property "document"

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Doğa Yağcızeybek

79686385

Date: 2025-07-01 16:59:06
Score: 0.5
Natty:
Report link

I realized how to solve this, the problem was that all the pages were showing a mix of spanish, english labels and that stuff, I tought that it was something about this

var cookie = HttpContext.Request.Cookies[CookieCultureName];

where it takes many config values such as language and that somehow it chooses one of the two .resx files that have all the labels values but it was not the case, I solved it by changing it manually on inspection -> cookies -> Localization.CurrentUICulture:
enter image description here
But I still don´t know where this value comes from, kinda weird but it is what it is

Reasons:
  • Blacklisted phrase (1): enter image description here
  • Blacklisted phrase (1): how to solve
  • Whitelisted phrase (-2): I solved
  • Long answer (-0.5):
  • Has code block (-0.5):
  • Self-answer (0.5):
  • Low reputation (1):
Posted by: Jeremias Trouble

79686370

Date: 2025-07-01 16:44:03
Score: 0.5
Natty:
Report link

I also had a git repo inside gdrive (for convenience as of keeping code along with other stuff), somehow gdrive managed to corrupt itself to the point where some files inside the project got corrupted and inaccessible locally (cloud version remained). The only solution was to delete the gdrive cache and db.

Plus, paths inside gdrive end up including "my drive", where the space is a problem with some tools (Flutter).
And, you also end up syncing .venv (as an example for python) and other temp files as gdrive has no exclude patterns.
Therefore after sorting the situation in my own repo caused by this combination, I moved the repo into it's own folder.
Maybe it's one datapoint, but in my case, this combination got corrupted and wasted time.

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: FlashDD

79686361

Date: 2025-07-01 16:34:00
Score: 3
Natty:
Report link

for Otel Collector, `receiver/sqlserver`:

Pls make sure to Use MSSQL V: 2022, I was using MSSQL Server Version 2019.

Pls Use SQLSERVER, instead of SQLEXPRESS Edition.

Pls provide MSSQL User Privileges as below:

 GRANT VIEW SERVER PERFORMANCE STATE TO <USERNAME>

For reference check this Github Issue: https://github.com/open-telemetry/opentelemetry-collector-contrib/issues/40937

Reasons:
  • RegEx Blacklisted phrase (2.5): Pls provide
  • Low length (0.5):
  • Has code block (-0.5):
  • Self-answer (0.5):
Posted by: Divyank

79686356

Date: 2025-07-01 16:27:58
Score: 1
Natty:
Report link
File /usr/local/lib/python3.11/shutil.py:431, in copy(src, dst, follow_symlinks)
    429 if os.path.isdir(dst):
    430     dst = os.path.join(dst, os.path.basename(src))
--> 431 copyfile(src, dst, follow_symlinks=follow_symlinks)
    432 copymode(src, dst, follow_symlinks=follow_symlinks)
    433 return dst
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Guilherme Henrique tom1

79686352

Date: 2025-07-01 16:25:57
Score: 4
Natty:
Report link

I just had this same error pop up when trying to do the same thing with my data. Does cID by any chance have values that are not just a simple numbering 1:n(clusters)? My cluster identifiers were about 5 digits long and when I changed the ID values to numbers 1:n(clusters), the error magically disappeared.

Reasons:
  • Blacklisted phrase (1): trying to do the same
  • Low length (0.5):
  • No code block (0.5):
  • Contains question mark (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: WanderingEpi

79686350

Date: 2025-07-01 16:23:57
Score: 1.5
Natty:
Report link

In your .NET Core project (that references the .NET Framework lib), add System.Security.Permissions NuGet package — this ensures Newtonsoft.Json won’t fail with FileNotFoundException.

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Mohammed Abdullah

79686345

Date: 2025-07-01 16:21:56
Score: 3.5
Natty:
Report link

Please check out the instructions at the bottom of this README. This solved it for me.

https://github.com/Weile-Zheng/word2vec-vector-embedding?tab=readme-ov-file

Reasons:
  • Probably link only (1):
  • Low length (1.5):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: hayfreed

79686344

Date: 2025-07-01 16:20:55
Score: 3.5
Natty:
Report link

Please check out the instructions at the bottom of this README. This solved it for me.

https://github.com/Weile-Zheng/word2vec-vector-embedding?tab=readme-ov-file

Reasons:
  • Probably link only (1):
  • Low length (1.5):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: hayfreed

79686341

Date: 2025-07-01 16:17:55
Score: 2.5
Natty:
Report link

Look this:https://github.com/modelcontextprotocol/python-sdk/issues/423

I believe this is a problem of MCP.

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Kris

79686333

Date: 2025-07-01 16:13:53
Score: 0.5
Natty:
Report link

I pity the OP lumbered with such a silly and inflexible accuracy target for their implementation as shown above. They don't deserve the negative votes that this question got but their professor certainly does!

By way of introduction I should point out that we would not normally approximate sin(x) over such a wide range as 0-pi because to do so violates one of the important heuristics generally used in series expansions used to approximate functions in computing namely:

  1. Each successive term in the series satisfies |anxn| > |an+1xn+1|
  2. Terms are added together smallest to largest to control rounding error.

IOW each successive term is a smaller correction to the sum than its predecessor and they are typically summed from highest order term first usually by Horner's method which lends itself to modern computers FMA instructions which can process a combined multiply and add with only one rounding each machine cycle.

To illustrate how range reduction helps I the test code below does the original range test with different numbers of terms N for argument limits of pi, pi/2 and pi/4. The first case evaluation for pi thrashes about wildly at first before eventually settling down. The latter pi/4requires just 4 terms to converge.

In fact we can get away with the wide range in this instance because sin, cos and exp are all highly convergent polynomial series with a factorial in the denominator - although the large alternating terms added to partial sums when x ~ pi do cause some loss of precision at the high end of the range.

We would normally approximate over a reduced range of pi/2, pi/4 or pi/6. However taking on this challenge head on there are several ways to do it. The different simple methods of summing the Taylor series can give a few possible answers depending on how you add them up and whether or not you accumulate the partial sum into a double precision variable. There is no compelling reason to prefer any one of them over another. The fastest method is as good as any.

There is really nothing good about the professor's recommended method. It is by far the most computationally expensive way to do it and for good measure it will violate the original specification of computing the Taylor series when N>=14 because the factorial result for 14! cannot be accurately represented in a float32 - the value is truncated.

The OP's original method was perfectly valid and neatly sidesteps the risk of overflow of xN and N! by refining the next term to be added for each iteration inside the summation loop. The only refinement would be to step the loop in increments of 2 and so avoid computing n = 2*i.

@user85421's comment reminded me of a very old school way to obtain a nearly correct polynomial approximation for cos/sin by nailing the result obtained at a specific point to be exact. Called "shooting" and usually done for boundary value problems it is the simplest and easiest to understand of the more advanced methods to improve polynomial accuracy.

In this instance we adjust the very last term in xN so that it hits the target of cos(pi) = -1 exactly. It can be manually tweaked from there to get a crude nearly equal ripple solution that is about 25x more accurate than the classical Taylor series.

The fundamental problem with the Taylor series is that it is ridiculously over precise near zero and increasingly struggles as it approaches pi. This hints that we might be able to find a compromise set of coefficients that is just good enough everywhere in the chosen range.

The real magic comes from constructing a Chebyshev equal ripple approximation using the same number of terms. This is harder to do for 32 bit floating point and since a lot of modern CPUs now have double precision arithmetic that is as fast as single precision you often find double precision implementations lurking inside nominally float32 wrappers.

It is possible to rewrite a Taylor series into a Chebyshev expansion by hand. My results were obtained using a Julia numerical code ARMremez.jl for rational approximations.

To get the best possible coefficient set for fixed precision working in practice requires a huge optimisation effort and isn't always successful but to get something that is good enough is relatively easy. The code below shows the various options I have discussed and sample coefficients. The framework used tests enough of the range of x values to put tight bounds on worst case absolute error |cos(x)-poly_cos(x)|.

In real applications of approximation we would usually go for minimum relative error | 1 - poly_cos(x)/cos(x)| (so that ideally all the bits in the mantissa are right). However the zero at pi/2 would make life a bit too interesting for a simple quick demo so I have used absolute error here instead.

The 6 term Chebyshev approximation is 80x more accurate but the error is in the sense that takes cos(x) outside the valid range |cos(x)| <= 1 (highly undesirable). That could easily be fixed by rescaling. They have been written in a hardcoded Horner fixed length polynomial implementation avoiding any loops (and 20-30% faster as a result).

The worst case error in the 7 term Chebyshev approximation computed in double precision is 1000x better at <9e-8 without any fine tuning. The theoretical limit with high precision arithmetic is 1.1e-8 which is below the 3e-8 Unit in the Last Place (ULP) threshold on 0.5-1.0. There is a good chance that it could be made correctly rounded for float32 with sufficient effort. If not then 8 terms will nail it.

One advantage of asking students to optimise their polynomial function on a range like 0-pi is that you can exhaustively test it for every possible valid input value x fairly quickly. Something that is usually impossible for double precision functions. A proper framework for doing this much more thoroughly than my hack below was included in a post by @njuffa about approximating erfc.

The test reveals that the OP's solution and the book solution are not that different, but the official recommended method is 30x slower or just 10x slower if you cache N!. This is all down to using pow(x,N) including the slight rounding differences in the sum and repeatedly recomputing factorial N (which leads to inaccuracies for N>14).

Curiously for a basic Taylor series expansion the worst case error is not always right at the end of the range - something particularly noticeable on the methods using pow()

Here is the results table:

Description cos(pi) error min_error x_min max_error x_max time (s)
prof Taylor -0.99989957 0.000100434 -1.436e-07 0.94130510 0.000100672 3.14159226 10.752
pow Taylor -0.99989957 0.000100434 -1.436e-07 0.94130510 0.000100672 3.14159226 2.748
your Cosinus -0.99989957 0.000100434 -1.570e-07 0.80652559 0.000100791 3.14157438 0.301
my Taylor -0.99989951 0.000100493 -5.476e-08 1.00042307 0.000100493 3.14159274 0.237
shoot Taylor -0.99999595 4.0531e-06 -4.155e-06 2.84360051 4.172e-06 3.14159012 0.26
Horner Chebyshev 6 -1.00000095 -9.537e-07 -1.330e-06 3.14106655 9.502e-07 2.21509051 0.177
double Horner Cheby 7 -1.00000000 0 -7.393e-08 2.34867692 8.574e-08 2.10044718 0.188

Here is the code that can be sued to experiment with the various options. The code is C rather than Java but written in such a way that it should be easily ported to Java.

#include <stdio.h>
#include <math.h>  
#include <time.h>

#define SLOW   // to enable the official book answer 
//#define DIVIDE  // use explicit division vs multiply by precomputed reciprocal 

double TaylorCn[10], dFac[20], drFac[20];
float shootC6;
float Fac[20];
float C6[7] = { 0.99999922f, -0.499994268f, 0.0416598222f, -0.001385891596f, 2.42044015e-05f, -2.19788836e-07f }; // original 240 bit rounded down to float32 
// ref float C7[8] = { 0.99999999f, -0.499999892f, 0.0416664902f, -0.001388780783f, 2.47699662e-05f, -2.70797754e-07f, 1.724760709e-9f }; // original 240 bit rounded down to float32
float C7[8] = { 0.99999999f, -0.499999892f, 0.0416664902f, -0.001388780783f, 2.47699662e-05f, -2.707977e-07f, 1.72478e-9f };  // after simple fine tuning
double dC7[8] = { 0.9999999891722795, -0.4999998918375135482, 0.04166649019522770258731, -0.0013887807826936648, 2.47699662157542654e-05, -2.707977544202106e-07, 1.7247607089243954e-09 };
// Chebeshev equal ripple approximations obtained from modified ARMremez rational approximation code
// C7 +/- 1.08e-8 (computed using 240bit FP arithmetic - coefficients are not fully optimised for float arithmetic) actually obtain 9e-8 (could do better?)
// C6 +/- 7.78e-7 actually obtain 1.33e-6 (with fine tuning could do better)

const float pi = 3.1415926535f;

float TaylorCos(float x, int ordnung)    
{
    double sum, term,  mx2;
    sum = term = 1.0;
    mx2 = -x * x;
    for (int i = 2; i <= ordnung; i+=2) {
        term *= mx2 ;
#ifdef DIVIDE
        sum += term / Fac[i]; // slower when using divide
#else
        sum += term * drFac[i]; // faster to multiply by reciprocal
#endif
    }
    return (float) sum;
}

float fTaylorCos(float x)
{
    return TaylorCos(x, 12);
}

void InitTaylor()
{
    float x2, x4, x8, x12;
    TaylorCn[0] = 1.0;
    for (int i = 1; i < 10; i++) TaylorCn[i] = TaylorCn[i - 1] / (2 * i * (2 * i - 1)); // precomute the coefficients
    Fac[0] = 1;
    drFac[0] = dFac[0] = 1;
    for (int i = 1; i < 20; i++)
    {
      Fac[i] = i * Fac[i - 1];
      dFac[i] = i * dFac[i - 1];
      drFac[i] = 1.0 / dFac[i];
      if ((double)Fac[i] != dFac[i]) printf("float factorial fails for %i! %18.0f should be %18.0f error %10.0f ( %6.5f ppm)\n", i, Fac[i], dFac[i], dFac[i]-Fac[i], 1e6*(1.0-Fac[i]/dFac[i]));
    }
   x2 = pi * pi;
   x4 = x2 * x2;
   x8 = x4 * x4;
   x12 = x4 * x8;
   shootC6 = (float)(cos((double)pi) - TaylorCos(pi, 10)) / x12 * 1.00221f;   // fiddle factor for shootC6 with 7 terms  *1.00128;
}

float shootTaylorCos(float x)
{
    float x2, x4, x8, x12;
    x2 = x * x;
    x4 = x2 * x2;
    x8 = x4 * x4;
    x12 = x4 * x8;
    return TaylorCos(x, 10) + shootC6 * x12;
}

float berechneCosinus(float x, int ordnung) {
    float sum, term, mx2;
    sum = term = 1.0f;
    mx2 = -x * x;
    for (int i = 1; i <= (ordnung + 1) / 2; i++) {
        int n = 2 * i;
        term *= mx2 / ((n-1) * n);
        sum += term;
    }
    return sum;
}

float Cosinus(float x)
{
    return berechneCosinus(x, 12);
}

float factorial(int n)
{
    float result = 1.0f;    
    for (int i = 2; i <= n; i++)
        result *= i;
    return result;
}

float profTaylorCos_core(float x, int n)
{
    float sum, term, mx2;
    sum = term = 1.0f;
    for (int i = 2; i <= n; i += 2) {
        term *= -1;
        sum += term*pow(x,i)/factorial(i);
    }
    return (float)sum;
}

float profTaylorCos(float x)
{
    return profTaylorCos_core(x, 12);
}

float powTaylorCos_core(float x, int n)
{
    float sum, term;
    sum = term = 1.0f;
    for (int i = 2; i <= n; i += 2) {
        term *= -1;
        sum += term * pow(x, i) / Fac[i];
    }
    return (float)sum;
}

float powTaylorCos(float x)
{
    return powTaylorCos_core(x, 12);
}

float Cheby6Cos(float x)
{
    float sum, term, x2;
    sum = term = 1.0f;
    x2 = x * x;
    for (int i = 1; i < 6; i++) {
        term *= x2;
        sum += term * C6[i]; 
    }
    return sum;
}

float dHCheby7Cos(float x)
{
    double x2 = x*x;
    return (float)(dC7[0] + x2 * (dC7[1] + x2 * (dC7[2] + x2 * (dC7[3] + x2 * (dC7[4] + x2 * (dC7[5] + x2 * dC7[6])))))); // cos 7 terms
}

float HCheby6Cos(float x)
{
    float x2 = x * x;
    return C6[0] + x2 * (C6[1] + x2 * (C6[2] + x2 * (C6[3] + x2 * (C6[4] + x2 * C6[5])))); // cos 6 terms
}


void test(const char *name, float(*myfun)(float), double (*ref_fun)(double), double xstart, double xend)
{
    float cospi, cpi_err, x, ox, dx, xmax, xmin;
    double err, res, ref, maxerr, minerr;
    time_t start, end;
    x = xstart;
    ox = -1.0;
//    dx = 1.2e-7f;
    dx = 2.9802322387695312e-8f; // chosen to test key ranges of the function exhaustively
    maxerr = minerr = 0;
    xmin = xmax = 0.0;
    start = clock();
    while (x <= xend) {
        res = (*myfun)(x);
        ref = (*ref_fun)(x);
        err = res - ref;
        if (err > maxerr) {
            maxerr = err;
            xmax = x;
        }
        if (err < minerr) {
            minerr = err;
            xmin = x;
        }
        x += dx;
        if (x == ox) dx += dx;
        ox = x;
    }
    end = clock();
    cospi = (*myfun)(pi);
    cpi_err = cospi - cos(pi);
    printf("%-22s  %10.8f  %12g %12g  @  %10.8f  %12g  @  %10.8f  %g\n", name, cospi, cpi_err, minerr, xmin, maxerr, xmax, (float)(end - start) / CLOCKS_PER_SEC);
}

void OriginalTest(const char* name, float(*myfun)(float, int), float target, float x)
{
    printf("%s cos(%10.7f) using terms upto x^N\n N \t result  error\n",name, x);
    for (int i = 0; i < 19; i += 2) {
        float cx, err;
        cx = (*myfun)(x, i);
        err = cx - target;
        printf("%2i  %-12.9f  %12.5g\n", i, cx, err);
        if (err == 0.0) break;
    }
}

int main() {
    InitTaylor();    // note that factorial 14 cannot be represented accurately as a 32 bit float and is truncated.
                     // easy sanity check on factorial numbers is to count the number of trailing zeroes.

    float x = pi; // approx. PI
    OriginalTest("Taylor Cosinus", berechneCosinus, cos(x), x);
    OriginalTest("Taylor Cosinus", berechneCosinus, cos(x/2), x/2);
    OriginalTest("Taylor Cosinus", berechneCosinus, cos(x/4), x/4);

    printf("\nHow it would actually be done using equal ripple polynomial on 0-pi\n\n");
    printf("Chebyshev equal ripple   cos(pi) 6 terms %12.8f (sum order x^0 to x^N)\n", Cheby6Cos(x));
    printf("Horner optimum Chebyshev cos(pi) 6 terms %12.8f (sum order x^N to x^0)\n", HCheby6Cos(x));
    printf("Horner optimum Chebyshev cos(pi) 7 terms %12.8f (sum order x^N to x^0)\n\n", dHCheby7Cos(x));

    printf("Performance and functionality tests of versions - professor's solution is 10x slower ~2s on an i5-12600 (please wait)...\n");
    printf(" Description \t\t cos(pi)      error \t    min_error \t    x_min\tmax_error \t x_max \t  time\n");
#ifdef SLOW
    test("prof Taylor", profTaylorCos, cos, 0.0, pi);
    test("pow  Taylor", powTaylorCos,  cos, 0.0, pi);
#endif
    test("your Cosinus",  Cosinus, cos, 0.0, pi);
    test("my Taylor",  fTaylorCos, cos, 0.0, pi);
    test("shoot Taylor", shootTaylorCos, cos, 0.0, pi);
    test("Horner Chebyshev 6",  HCheby6Cos, cos, 0.0, pi);
    test("double Horner Cheby 7", dHCheby7Cos, cos, 0.0, pi);
    return 0;
}

It is interesting to make the sum and x2 variables double precision and observe the effect that has on the answers. If someone fancies running simulated annealing or another global optimiser to find the best possible optimised Chebyshev 6 & 7 float32 approximations please post the results.

I agree whole heartedly with Steve Summits final comments. You should think very carefully about risk of overflow of intermediate results and order of summation doing numerical calculations. Numerical analysis using floating point numbers follows different rules to pure mathematics and some rearrangements of an equation are very much better than others when you want to compute an accurate numerical value.

Reasons:
  • Whitelisted phrase (-1): solution is
  • RegEx Blacklisted phrase (2.5): please post
  • Long answer (-1):
  • Has code block (-0.5):
  • User mentioned (1): @user85421's
  • User mentioned (0): @njuffa
  • Filler text (0.5): 00000000
  • High reputation (-1):
Posted by: Martin Brown

79686316

Date: 2025-07-01 15:59:49
Score: 1
Natty:
Report link

It's an old post but if you can do that, then Google, Microsoft or any large servers in the world can just crash by one client. And that's not how the Internet works! By requesting the server to send a resource, you - as the client, receives it chunk by chunk. And if you want to only request but not receive the byte, then by the time the server knew it send data to nowhere, it stops. Think of it as a electric wire, it allows electric to flow, right? If you cut the wire or connect the endpoint to nowhere then the electric is nowhere to flow.

One thing you can do is code some software and send it to people all over the world, the software you make will target specific website or server you want, then that's called DDoS and you've just made an malware! Those people installing your malware and turn their PC into a zombie machine sending request to your targeting server. Fulfilling large amount of request from all over the world make the server overload, and then shut down.

After all. What you've asking for is disgusting. It show no respect to the development world where it need to improve, not harm anybody. And for that reason I'm going to flag this post. Sorry.

Reasons:
  • Long answer (-1):
  • No code block (0.5):
  • Contains question mark (0.5):
  • Low reputation (1):
Posted by: Khỉ Em

79686309

Date: 2025-07-01 15:54:48
Score: 3
Natty:
Report link

prefer this document , this worked for me...
https://blog.devgenius.io/apache-superset-integration-with-keycloak-3571123e0acf

Reasons:
  • Blacklisted phrase (1): this document
  • Whitelisted phrase (-1): this worked for me
  • Whitelisted phrase (-1): worked for me
  • Probably link only (1):
  • Low length (1.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: atul bhandari

79686307

Date: 2025-07-01 15:52:47
Score: 1.5
Natty:
Report link

Just for future reference, another way to achieve the same (which is mpv specific) is

play-music()
{
    local selected=($(find "${PWD}" -mindepth 1 -maxdepth 1 -type f -iname "*.mp3" | LC_COLLATE=C sort | fzf))

    mpv --playlist=<(printf "%s\n" "${selected[@]}") </dev/null &>/dev/null & disown
}
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Self-answer (0.5):
  • Low reputation (1):
Posted by: Rittwik Chatterjee

79686306

Date: 2025-07-01 15:51:47
Score: 1.5
Natty:
Report link

I had the same issue in previous version and found that some of my add-ons were bugging out some of the keyboard shortcuts. I set the add-ons to turn only when needed and reset my keyboard shortcuts from the Tool menu.

Reasons:
  • Whitelisted phrase (-1): I had the same
  • Low length (0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Stephan

79686294

Date: 2025-07-01 15:44:45
Score: 1.5
Natty:
Report link

In iOS 18 and later, an official API has been added to retrieve the tag value, making it easier to implement custom pickers and similar components.

https://developer.apple.com/documentation/swiftui/containervalues/tag(for:)

func tag<V>(for type: V.Type) -> V? where V : Hashable
func hasTag<V>(_ tag: V) -> Bool where V : Hashable
Reasons:
  • Probably link only (1):
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (0.5):
Posted by: Kngw Kngw

79686293

Date: 2025-07-01 15:42:44
Score: 2.5
Natty:
Report link

Since it is a batch job, consider using GitHub actions from job that will run on a schedule. Use the bq utility.

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (0.5):
Posted by: obi

79686292

Date: 2025-07-01 15:42:44
Score: 2
Natty:
Report link
Xo Jeeva 
header 1 header 2
cell 1 cell 2
cell 3 cell 4

Xo Jeeva

Reasons:
  • Low length (1.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Banupriya

79686290

Date: 2025-07-01 15:41:44
Score: 1
Natty:
Report link

Just add this to your pubspec.yaml:

dependency_overrides:
  video_player_android: 
    git: 
      url: https://github.com/dennisstromberg/video_player_android.git

This solved the problem for me

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Noufel

79686287

Date: 2025-07-01 15:39:43
Score: 2
Natty:
Report link

<dependency>

<groupId>org.apache.beam</groupId>

<artifactId>beam-runners-google-cloud-dataflow-java</artifactId>

<version>${beam.version}</version>

<scope>runtime</scope>

</dependency>

Reasons:
  • Low length (0.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: user30940468

79686283

Date: 2025-07-01 15:36:42
Score: 2
Natty:
Report link

Depending on the number of occurrences you have for each key you can modify this JCL to meet your requirements
Mainframe Sort JCL - transpose the rows to column

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: Kolusu

79686279

Date: 2025-07-01 15:34:41
Score: 4.5
Natty:
Report link

thank you all, i had forgot to replace myproject.pdb.json on the server

Reasons:
  • Blacklisted phrase (0.5): thank you
  • Low length (1.5):
  • No code block (0.5):
  • Self-answer (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Mohsen

79686258

Date: 2025-07-01 15:19:38
Score: 2
Natty:
Report link

there was the same character string in both 'bunchofstuff' and 'onlypartofstuff', so i used a rewrite rule where, if, say 'stuff' was in the url, nothing was done, otherwise, forward to the 'https://abc.123.whatever/bunchofstuff' url. one caveat is: if someone typed in the full url for 'bunchofstuff' or 'onlypartofstuff', the rule doesn't check for 'https' ... but, i don't think anyone would type in one of those longer url's by hand (they'd use a link w/ 'https' in it). but the main abc.123.whatever will forward.

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Self-answer (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: user899402

79686251

Date: 2025-07-01 15:12:36
Score: 1.5
Natty:
Report link

I had this as well, but Selecting "Clear Cache and Reload" seemed to fix it for me

enter image description here

Reasons:
  • Probably link only (1):
  • Low length (1.5):
  • No code block (0.5):
  • Single line (0.5):
  • High reputation (-2):
Posted by: Chris Barr

79686240

Date: 2025-07-01 15:02:33
Score: 1
Natty:
Report link

import pandas as pd

import numpy as np

import matplotlib.pyplot as plt

# Simulated price data (or replace with real futures data)

np.random.seed(42)

dates = pd.date_range(start='2010-01-01', periods=3000)

price = 100 + np.cumsum(np.random.normal(0, 1, size=len(dates)))

df = pd.DataFrame(data={'Close': price}, index=dates)

# Pure technical indicators: moving averages

df['SMA_50'] = df['Close'].rolling(window=50).mean()

df['SMA_200'] = df['Close'].rolling(window=200).mean()

# Strategy: Go long when 50 SMA crosses above 200 SMA (golden cross), exit when below

df['Position'] = 0

df['Position'][df['SMA_50'] > df['SMA_200']] = 1

df['Position'] = df['Position'].shift(1) # Avoid lookahead bias

# Calculate returns

df['Return'] = df['Close'].pct_change()

df['Strategy_Return'] = df['Return'] * df['Position']

# Performance

cumulative_strategy = (1 + df['Strategy_Return']).cumprod()

cumulative_buy_hold = (1 + df['Return']).cumprod()

# Plotting

plt.figure(figsize=(12, 6))

plt.plot(cumulative_strategy, label='Strategy (Technical Only)')

plt.plot(cumulative_buy_hold, label='Buy & Hold', linestyle='--')

plt.title('Technical Strategy vs Buy & Hold')

plt.legend()

plt.grid(True)

plt.tight_layout()

plt.show()

Reasons:
  • Long answer (-1):
  • No code block (0.5):
  • Self-answer (0.5):
  • Low reputation (1):
Posted by: denise chloe

79686233

Date: 2025-07-01 14:58:31
Score: 1.5
Natty:
Report link

I can't speak for ACF, but both BoxLang and Lucee use the same codepaths under the hood for executing your query whether you use a tag/component or a BIF.

Here's the relevant files in BoxLang: (both use PendingQuery)

https://github.com/ortus-boxlang/BoxLang/blob/00a560f70adb92f1b0a6c342c4b506488a70377e/src/main/java/ortus/boxlang/runtime/components/jdbc/Query.java#L155

https://github.com/ortus-boxlang/BoxLang/blob/00a560f70adb92f1b0a6c342c4b506488a70377e/src/main/java/ortus/boxlang/runtime/bifs/global/jdbc/QueryExecute.java#L116

Reasons:
  • Probably link only (1):
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (0.5):
Posted by: elpete

79686231

Date: 2025-07-01 14:57:31
Score: 2
Natty:
Report link

pip install webdrivermanager

webdrivermanager chrome --linkpath /usr/local/bin

(check if chrome driver is in PATH)

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: tijnn

79686229

Date: 2025-07-01 14:53:30
Score: 2
Natty:
Report link

Fixed by updating Chrome

I was about to comment that I had the same issue since a few weeks (Chrome on Windows 11), but when I opened my Chrome settings to specify my version (which was 137), chrome auto-updated. Once relaunched with version 138, Google voices started working again.

Reasons:
  • Blacklisted phrase (1): to comment
  • Whitelisted phrase (-1): I had the same
  • Low length (0.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Nicolas Gouwy

79686215

Date: 2025-07-01 14:37:26
Score: 5.5
Natty: 4
Report link

La soluciĂłn es cambiar el AspNetCoreHostingModel de todas las aplicaciones a OutOfProcess en el webconfig

<AspNetCoreHostingModel>OutOfProcess</AspNetCoreHostingModel>

Reasons:
  • Blacklisted phrase (1): todas
  • Blacklisted phrase (3): soluciĂłn
  • Low length (1):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Felipe Osorio

79686203

Date: 2025-07-01 14:29:23
Score: 1
Natty:
Report link

Bigtable's SQL support is now in GA and supports server-side aggregations. In addition to read-time aggregations it is also possible to define incremental materialized views that do rollups/aggregations at ingest-time.

In a lot of real-time analytics applications, one can imagine stacking these e.g. use an incremental materialized view to aggregate clicks into 15 minute windows and then at read time apply filters and GROUP BY to convert pre-aggregated data into a coarser granularity like N hours, days etc.

Reasons:
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: Bora

79686199

Date: 2025-07-01 14:27:23
Score: 1
Natty:
Report link

Here’s what I’d try:

  1. Instead of blocking on city OR postal code, block on city AND the first few digits of postal code — this cuts down your candidate pairs a ton.

  2. Convert city and postal code columns to categorical types to speed up equality checks and save memory.

  3. Instead of doing fuzzy matching row-by-row with apply(), try using Rapidfuzz’s batch functions to vectorize street name similarity.

  4. Keep your early stopping logic, but order components by weight so you can bail out faster.

  5. Increase the number of Dask partitions (like 500+) and if possible run on a distributed cluster for better parallelism.

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Ruben Nolf

79686191

Date: 2025-07-01 14:17:20
Score: 10
Natty: 5.5
Report link

I have this problem too. There may be alternative ways but why is this not working?

Reasons:
  • Blacklisted phrase (1): I have this problem
  • Blacklisted phrase (1): why is this not working
  • RegEx Blacklisted phrase (0.5): why is this
  • RegEx Blacklisted phrase (2): working?
  • Low length (1.5):
  • No code block (0.5):
  • Ends in question mark (2):
  • Single line (0.5):
  • Low reputation (1):
Posted by: muge

79686186

Date: 2025-07-01 14:13:19
Score: 4
Natty:
Report link

It's better to have server but if you don't have any server you can you HOST.

Reasons:
  • Low length (1.5):
  • No code block (0.5):
  • Unregistered user (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: tester

79686181

Date: 2025-07-01 14:05:17
Score: 0.5
Natty:
Report link

I was doing a refresher on web application security recently and also asked myself the same question, and became pretty annoyed while trying to understand the answer because even the literature itself seems to mix the mathematical theory with real life implementations.

The top-voted answer explains in length but for some reason fails to state it plainly, so I'd like to make a small addition for any applications developer that stumbles upon this. It obvious enough that we should not use private and shared keys interchangeably, as their names suggest. The question here is: the literature definition of private and public key pairs state that:

  1. Only the private key can decrypt a message encrypted with the public key

  2. Only the public key can decrypt a message encrypted with the private key

Why then, can't one be used in place of the other? Which is a completely legitimate question if you take real-world application out of the question, which literature also often tends to do.

The simple answer pertains to the actual implementations of the exchange algorithm in question, i.e. RSA, and is that the public key can be extracted from the private key contents.

The reason for that is when generating a private key file with RSA using pretty much any known tool in actual practice the resulting file contains both exponents, and therefore, both keys. In fact, when using the openssl or ssh-keygen tool, the public key can be re-extracted from the original private key contents at any time: https://stackoverflow.com/a/5246045

Conceptually, neither of the exponents are mathematically "private" or "public", those are just labels assigned upon creation and could easily be assigned in reverse, and deriving one exponent from the other is an equivalent problem from both perspectives. In that sense

Tl;dr *private keys and shared keys are not interchangeable and you must be a good boy and host your private key only on the server/entity that needs to be authenticated by someone else, *and it's equally important to tell you that you should wear a seatbelt while driving your car. The reason why is because generally the private key contents hold information for both keys, and the shared key can be extracted from that. That holds up for pretty much any tool that implements RSA exchange.

Reasons:
  • Blacklisted phrase (1): stackoverflow
  • Long answer (-1):
  • Has code block (-0.5):
  • Contains question mark (0.5):
  • Low reputation (0.5):
Posted by: DVNO

79686178

Date: 2025-07-01 14:02:16
Score: 1.5
Natty:
Report link

Include windows.hand add this code to the start of your program (within main()) to get the virtual terminal codes to work in CMD.EXE:

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Unregistered user (0.5):
  • Low reputation (1):
Posted by: Wouter Bergmann Tiest

79686177

Date: 2025-07-01 14:02:16
Score: 2
Natty:
Report link

] should be placed directly after ^ ! Hence, [^][,] is correct; while [^[,]] is incorrect.

Reasons:
  • Low length (1):
  • Has code block (-0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: STyx

79686175

Date: 2025-07-01 14:00:15
Score: 2
Natty:
Report link

Do you mean button like that?

enter image description here

you can use

composeview.addButton(buttonDescriptor)

InboxSDK.load(1, 'YOUR_APP_ID_HERE').then(function(sdk){
  sdk.Compose.registerComposeViewHandler(function(composeView){
    composeview.addButton({
        title: "title",
        onClik: ()=>{console.log("clicked");}
    })
  });
});
Reasons:
  • Whitelisted phrase (-1.5): you can use
  • Probably link only (1):
  • Has code block (-0.5):
  • Ends in question mark (2):
  • Low reputation (1):
Posted by: chaya

79686170

Date: 2025-07-01 13:54:14
Score: 3.5
Natty:
Report link

In VS Code, when you hover on the args, small popup will open. it will give you option for edit, clear or clearall.

enter image description here

Reasons:
  • Probably link only (1):
  • Low length (1):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (0.5):
Posted by: Jayesh Tanna

79686167

Date: 2025-07-01 13:52:13
Score: 1
Natty:
Report link

realloc() is not intended to re-allocate memory of stack variables (local variables of a function). This might seem trivial but is a fruitful source of accumulating memory bugs. Hence,

uint64_t* memory = NULL;

should be a heap allocation:

uint64_t *memory = (uint64_t *) malloc(sizeof(uint64_t));
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Aiden Ghim

79686165

Date: 2025-07-01 13:51:13
Score: 0.5
Natty:
Report link

import json

import snowflake.connector

def load_config(file_path):

"""Load the Snowflake account configuration from a JSON file."""

with open(file_path, 'r') as file:

return json.load(file)

def connect_to_snowflake(account, username, password, role):

"""Establish a connection to a Snowflake account."""

try:

conn = snowflake.connector.connect(

user=username,

password=password,

account=account,

role=role

)

return conn

except Exception as e:

print(f"Error connecting to Snowflake: {e}")

return None

def fetch_tags(conn):

"""Fetch tag_list and tag_defn from the Snowflake account."""

cursor = conn.cursor()

try:

cursor.execute("""

SELECT tag_list, tag_defn

FROM platform_common.tags;

""")

return cursor.fetchall() # Return all rows from the query

finally:

cursor.close()

def generate_sql_statements(source_tags, target_tags):

"""Generate SQL statements based on the differences in tag_list values."""

sql_statements = []

# Create a set for target tag_list values for easy lookup

target_tags_set = {tag[0]: tag[1] for tag in target_tags} # {tag_list: tag_defn}

# Check for new tags in source that are not in target

for tag in source_tags:

tag_list = tag[0]

tag_defn = tag[1]

if tag_list not in target_tags_set:

# Create statement for the new tag

create_statement = f"INSERT INTO platform_common.tags (tag_list, tag_defn) VALUES ('{tag_sql_statements.append(create_statement)

return sql_statements

def write_output_file(statements, output_file):

"""Write the generated SQL statements to an output file."""

with open(output_file, 'w') as file:

for statement in statements:

file.write(statement + '\n')

def main():

# Load configuration from JSON file

config = load_config('snowflake_config.json')

# Connect to source Snowflake account

source_conn = connect_to_snowflake(

config['source']['account'],

config['source']['username'],

config['source']['password'],

config['source']['role']

)

# Connect to target Snowflake account

target_conn = connect_to_snowflake(

config['target']['account'],

config['target']['username'],

config['target']['password'],

config['target']['role']

)

if source_conn and target_conn:

# Fetch tags from both accounts

source_tags = fetch_tags(source_conn)

target_tags = fetch_tags(target_conn)

# Generate SQL statements based on the comparison

sql_statements = generate_sql_statements(source_tags, target_tags)

# Write the output to a file

write_output_file(sql_statements, 'execution_plan.sql')

print("Execution plan has been generated in 'execution_plan.sql'.")

# Close connections

if source_conn:

source_conn.close()

if target_conn:

target_conn.close()

if _name_ == "_main_":

main()

Reasons:
  • Long answer (-1):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Velmurugan Shanmugam

79686160

Date: 2025-07-01 13:48:12
Score: 1
Natty:
Report link

You can adjust the "window.zoomLevel" in your settings.json file to increase or decrease the font size of the sidebar. To change the font size in the text editor, use "editor.fontSize", and for the terminal, use "terminal.integrated.fontSize".

Once you find the right balance, it should significantly improve your comfort while working.

That is, unless you’re aiming to style a specific tab in the sidebar individually.

Reasons:
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: Feisal Ali

79686155

Date: 2025-07-01 13:46:11
Score: 2.5
Natty:
Report link

What helped for me:

I had pyright installed, so i opened settings by pressing command+, typed @ext:anysphere.cursorpyright, found Cursorpyright › Analysis: Type Checking Mode and changed from "basic" to "off".

enter image description here

Reasons:
  • Probably link only (1):
  • Low length (0.5):
  • Has code block (-0.5):
  • Starts with a question (0.5): What help
  • Low reputation (1):
Posted by: Oleh Kopyl

79686154

Date: 2025-07-01 13:44:10
Score: 2.5
Natty:
Report link

I spent 4 hours try to configure php.ini and no result
In my case the issue was Avast
disable it and it works fine

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Max Shostak

79686151

Date: 2025-07-01 13:42:10
Score: 3
Natty:
Report link

You need to create a custom Protocol Mapper in Keycloak to programmatically set the userId value before the token is generated This guide may help you get started and give you a clear idea of the implementation process:

Reasons:
  • Blacklisted phrase (1): This guide
  • Low length (0.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: amir BEN AHMED

79686140

Date: 2025-07-01 13:38:08
Score: 1.5
Natty:
Report link

Looks like you sending some http statuses (via completeWithError) when there are some data already writed into sse stream (http body).

Reasons:
  • Low length (1):
  • Has code block (-0.5):
  • Single line (0.5):
  • Low reputation (0.5):
Posted by: Vaulter

79686135

Date: 2025-07-01 13:35:07
Score: 11
Natty: 6.5
Report link

Jean Carlos Ramirez.

Did you manage to solve this?

Reasons:
  • RegEx Blacklisted phrase (3): Did you manage to solve this
  • RegEx Blacklisted phrase (1.5): solve this?
  • Probably link only (1):
  • Low length (2):
  • No code block (0.5):
  • Ends in question mark (2):
  • Low reputation (1):
Posted by: Alekov

79686128

Date: 2025-07-01 13:29:05
Score: 2.5
Natty:
Report link

Better late than never, you might wanna try this one PHP routes

Reasons:
  • Whitelisted phrase (-1): try this
  • Low length (1.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Robroy Bustillo Canales

79686127

Date: 2025-07-01 13:28:04
Score: 0.5
Natty:
Report link

Git 2.49.0-rc0 finally added the --revision option to git clone https://github.com/git/git/commit/337855629f59a3f435dabef900e22202ce8e00e1

git clone --revision=<commit-ish> $OPTIONS $URL
Reasons:
  • Probably link only (1):
  • Low length (1):
  • Has code block (-0.5):
  • High reputation (-1):
Posted by: Blaisorblade

79686121

Date: 2025-07-01 13:24:03
Score: 0.5
Natty:
Report link

I’ve faced a similar issue while working on a WooCommerce-based WordPress site for one of our clients recently. The WYSIWYG editor (TinyMCE) stopped loading properly, especially in the Product Description field, and we got console errors just like yours.

Here are a few things you can try:

1. Disable All Plugins Temporarily

The error Cannot read properties of undefined (reading 'wcBlocksRegistry') is often related to a conflict with the WooCommerce Blocks or another plugin that’s hooking into the editor.

Go to your plugins list and temporarily deactivate all plugins except WooCommerce.

Then check if the editor loads correctly.

If it does, reactivate each plugin one by one to identify the culprit.

2. Switch to a Default Theme

Sometimes the theme might enqueue scripts that interfere with the block editor. Try switching to a default WordPress theme like Twenty Twenty-Four to rule that out.

3. Clear Browser & Site Cache

This issue can also be caused by cached JavaScript files:

Clear your browser cache

If you're using a caching plugin or CDN (like Cloudflare), purge the cache

4. Reinstall the Classic Editor or Disable Gutenberg (Temporarily)

If you're using a classic setup and don't need Gutenberg, install the Classic Editor plugin and see if that resolves the issue. It can bypass block editor conflicts temporarily.

5. Check for Console Errors on Plugin Pages

Go to WooCommerce > Status > Logs to see if anything unusual is logged when the editor fails to load.

6. Update Everything

Ensure:

WordPress core

WooCommerce

All plugins & themes

...are fully updated. These kinds of undefined JavaScript errors are often fixed in plugin updates.

Let me know what worked — happy to help further if you're still stuck. We had a very similar case at our agency (Digital4Design), and in our case, it was a conflict between an outdated Gutenberg add-on and a WooCommerce update.

Reasons:
  • Long answer (-1):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Ankit Thakur

79686108

Date: 2025-07-01 13:12:00
Score: 2
Natty:
Report link

For those using Apple or Linux

JAVA_HOME=$(readlink -f "$(which java)" | sed 's#/bin/java##')

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Low reputation (0.5):
Posted by: user3646774

79686096

Date: 2025-07-01 13:03:58
Score: 1
Natty:
Report link

CREATE OR REPLACE PROCEDURE platform_common.tags.store_tags()

RETURNS STRING

LANGUAGE SQL

AS

$$

BEGIN

-- Create or replace the table to store the tags

CREATE OR REPLACE TABLE platform_common.tags (

database_name STRING,

schema_name STRING,

tag_name STRING,

comment STRING,

allowed_values STRING,

propagate STRING

);

-- Execute the SHOW TAGS command and store the result

EXECUTE IMMEDIATE 'SHOW TAGS IN ACCOUNT';

-- Insert the results into the tags table

INSERT INTO platform_common.tags (database_name, schema_name, tag_name, comment, allowed_values, SELECT

"database_name",

"schema_name",

"name" AS "tag_name",

"comment",

"allowed_values",

"propagate"

FROM

TABLE(RESULT_SCAN(LAST_QUERY_ID()))

WHERE

"database_name" != 'SNOWFLAKE'

ORDER BY

"created_on";

RETURN 'Tags stored successfully in platform_common.tags';

END;

$$;

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Low reputation (1):
Posted by: Velmurugan Shanmugam

79686089

Date: 2025-07-01 12:58:57
Score: 1
Natty:
Report link

Replace

- export HOST_PROJECT_PATH=/home/project/myproject

for

- export HOST_PROJECT_PATH=${BITBUCKET_CLONE_DIR}
Reasons:
  • Low length (1):
  • Has code block (-0.5):
  • Low reputation (0.5):
Posted by: deadParrot

79686073

Date: 2025-07-01 12:43:53
Score: 1
Natty:
Report link

I found the problem and would like to share it.
It is possible to save a task without assigning it to a user

In the update function i make this:

$user = User::findOrFail($validated['user_id']);
$customer = Customer::findOrFail($validated['customer_id']);
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Self-answer (0.5):
  • Low reputation (0.5):
Posted by: Dierig Patrick

79686070

Date: 2025-07-01 12:40:53
Score: 1
Natty:
Report link

I finally figured it out. The main issue was that I initially linked my new External ID tenant to an existing subscription that was still associated with my home directory, which caused problems.

To resolve it, I created a new subscription and made sure to assign it directly to the new tenant / directory.

After that, I was able to switch directories again — and this time, MFA worked as expected, and I successfully switched tenants.

Additionally, I now see that I’m assigned the Global Administrator role by default in the new tenant, just as expected and as confirmed in the Microsoft Docs

By default, the user who creates a Microsoft Entra tenant is automatically assigned the Global Administrator role.

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Self-answer (0.5):
  • Low reputation (0.5):
Posted by: uodami

79686058

Date: 2025-07-01 12:31:50
Score: 2.5
Natty:
Report link

In my opinion, a more effective approach would be to interpret a fixed point as a separator between high and low bits. In this case, the scaling becomes arithmetic shifting. For example, decimal float number 5.25 = 101.01 in binary representation.

Reasons:
  • Low length (0.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Andrew Androsow

79686053

Date: 2025-07-01 12:25:48
Score: 1
Natty:
Report link

cpp code for transposing matrix without using new matrix

 for(int i=0;i<arr.size();i++){
            for(int j=0;j<i;j++){
                swap(arr[i][j],arr[j][i]);
            }
        }
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Sujal Limje

79686052

Date: 2025-07-01 12:25:47
Score: 8.5
Natty: 4.5
Report link

its resolved ? i am facing same issue

Reasons:
  • RegEx Blacklisted phrase (1.5): resolved ?
  • Low length (2):
  • No code block (0.5):
  • Me too answer (2.5): i am facing same issue
  • Contains question mark (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: kamil

79686050

Date: 2025-07-01 12:23:47
Score: 1
Natty:
Report link

Did you add the description field later? Your code looks good actually.

python manage.py search_index --delete -f

python manage.py search_index --create

python manage.py search_index --populate

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Contains question mark (0.5):
  • Starts with a question (0.5): Did you add the
Posted by: Ayse

79686045

Date: 2025-07-01 12:19:45
Score: 2.5
Natty:
Report link

I found the problem. When we works in the Timer4 interrupt at one point we need to turn on the tim4int using the EIE2 register's thirt bit, so I did EIE2 &= 0x08; instead of EIE2 |= 0x08; and that causes to turn off the tim3int because first bit of EIE2 enables tim3int. Thank you...

Reasons:
  • Blacklisted phrase (0.5): Thank you
  • Low length (0.5):
  • Has code block (-0.5):
  • Self-answer (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: osLIII

79686025

Date: 2025-07-01 12:03:42
Score: 2.5
Natty:
Report link

Replacement of void by Task helps. But it takes long time to find it out after trying everything ...

Reasons:
  • Low length (1):
  • No code block (0.5):
  • Self-answer (0.5):
  • Single line (0.5):
Posted by: MarĹĄas

79686020

Date: 2025-07-01 11:59:41
Score: 0.5
Natty:
Report link

The label looks off because you're using a small font.

InputLabelProps: {
  sx: {
    fontSize: '13px',
    top: '50%',
    transform: 'translateY(-50%)',
    '&.MuiInputLabel-shrink': {
      top: 0,
      transform: 'translateY(0)',
    },
  },
},
Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (0.5):
Posted by: Milan Gohel

79686019

Date: 2025-07-01 11:59:41
Score: 2.5
Natty:
Report link

I think I've found the problem. In view.py, for each request, I create a grpc channel. A channel takes time to connect to the server. I think if I send grpc request while the channel is not connected to the server, this error will happen. The code is under development. I will change the view.py to reuse the grpc channel. After that, if the error persists, I will use your suggestion and I will inform you about the result. thanks.

Reasons:
  • Blacklisted phrase (0.5): thanks
  • No code block (0.5):
  • Self-answer (0.5):
  • Single line (0.5):
  • Low reputation (0.5):
Posted by: Nader

79686014

Date: 2025-07-01 11:57:40
Score: 1
Natty:
Report link

The Problem is that Users like "Everyone" or "Users" do not exist in a geman Windows installation.
they are called "jeder" and "Benutzer"

So there must be a generic way wich i thoght is:

User="[WIX_ACCOUNT_USERS]" 

But i can not get it to wrk on Wix 6.01

Reasons:
  • Low length (0.5):
  • Has code block (-0.5):
  • Low reputation (1):
Posted by: Aspergillus

79686006

Date: 2025-07-01 11:52:38
Score: 1.5
Natty:
Report link

R is like you are setting the ratings for a show yes it is then you find in the text why you think you can buy what you want then you create an API for the demo then you get something usely in a scrip be a man while driving ford then you know the man is normal but the truck is not so if you complete that and make it rated r you win the truck

In atomics it would be devastating for the guy to be normal and a big truck to talk to ... So you don't do the ratings and you get hershoma i.e to degliate not go off and be in bit pieces .

You get command runs on your phone talking to you ? Well that's my robot talking to you defending it's self I'll have to talk with it before making any more assumptions... Haha it told you what we were doing is rated R.

Reasons:
  • Long answer (-0.5):
  • No code block (0.5):
  • Contains question mark (0.5):
  • Low reputation (1):
Posted by: English Whaley

79686001

Date: 2025-07-01 11:49:38
Score: 3.5
Natty:
Report link

just update VS to the latest build or use the workaround mentioned in the issue

Reasons:
  • Low length (1.5):
  • No code block (0.5):
  • Single line (0.5):
  • Low reputation (1):
Posted by: Stipec