ruined | ruby gui source code debugger | Code Inspection library

As an example, let's say that I'm building a simple social network. I currently have two services:

• Identity, managing the users, their personal data (e-mail, password hashes, etc.) and their public profiles (username) and authentication
• Social, managing the users' posts, their friends and their feed

The Identity service can give the public profile of an user using its API at /api/users/{id}:

...

I have a simple html template which shows permissions in a table for each group. Every cell of the table, contains a button. I want to show the name of the permission in a popover of every button! The problem is that Django variable is not working fine!

...

I'm having trouble making a card that has a transparent white color (opacity 0.4). But, with shadow from the elevation effect.

If I remove the elevation, there's no shadow effect and the card look transparent. But, if I add some elevation, the transparent effect ruined. Here's what I've tried:

...

I have a function which do some random things..

And I want to input seed to it, so for same seeds the output will be the same..

But initiating the seed at the beggining like this:

...

I've been struggling to find the right logic for my sudoku solver. So far I've created a function to take (x,y) coordinates and the number and check if it is a legal move.

Though I don't understand how I can iterate through the grid replacing every 0 with a legal number, then go back and fix numbers that make the solve incorrect.

For example sometimes I will be left with 0's on the grid because some numbers can no longer be played. I took a deeper look at it and realized that numbers played previously in the same row were legal but ruined the puzzle. Instead, if those numbers were a bit higher the puzzle would be solved.

I understand backtracking would be my friend here but, I have no clue on how to implement it. So far here is what I have.

solve.py

...

I am trying to use MatchIt to perform Propensity Score Matching (PSM) for my panel data. The data is panel data that contains multi-year observations from the same group of companies.

The data is basically describing a list of bond data and the financial data of their issuers, also the bond terms such as issued date, coupon rate, maturity, and bond type of bonds issued by them. For instance:

Firmnames Year ROA Bond_type AAPL US Equity 2015 0.3 0 AAPL US Equity 2015 0.3 1 AAPL US Equity 2016 0.3 0 AAPL US Equity 2017 0.3 0 C US Equity 2015 0.3 0 C US Equity 2016 0.3 0 C US Equity 2017 0.3 0

......

I've already known how to match the observations by the criteria I want and I use exact = Year to make sure I match observations from the same year. The problem now I am facing is that the observations from the same companies will be matched together, this is not what I want. The code I used:

matchit(Bond_type ~ Year + Amount_Issued + Cpn + Total_Assets_bf + AssetsEquityRatio_bf + Asset_Turnover_bf, data = rdata, method = "nearest", distance = "glm", exact = "Year")

However, as you can see, in the second raw of my sample, there might be two observations in one year from the same companies due to the nature of my study (the company can issue bonds more than one time a year). The only difference between them is the Bond_type. Therefore, the MathcIt function will, of course, treat them as the best control and treatment group and match these two observations together since they have the same ROA and other matching factors in that year.

I have two ways to solve this in my opinion:

1. Remove the observations from the same year and company, however, removing the observations might lead to bias results and ruined the study.

2. Preventing MatchIt function match the observations from the same company (or with the same Frimnames)

The second approach will be better since it will not lead to bias, however, I don't know if I can do this in MatchIt function. Hope someone can give me some advice on this or maybe there's any better solution to this problem, please be so kind to share with me, thanks in advance!

Note: If there's any further information or requirement I should provide, please just inform me. This is my first time raising the question here!

...

I have been working on this solution for months and I have come to the conclusion that there is no clean way to achieve what I am trying to achieve. I feel as though my education in polymorphism is failing me, so I've come to StackOverflow to get a second opinion. Sorry if this seems long and convoluted. That's been my brain for the past couple of months and at this point I'm out of ideas. I'm hoping somebody can take a look and see that I could've avoided all this mess by doing it some other way.

What I am trying to achieve is two generic classes: One that can represent any "saveable" object, and one that can represent a list of saveable objects (or what I call a "store"). A saveable object can save itself using GSON, and a store can also save itself using GSON to a JSON file. The difference being that saveable objects are generically representing any GSON object that can be saved, whereas stores are extending from saveables to become a saveable hash map of objects via IDs.

An example output I am looking for is as so:

Imagine I have an object with a uuid string field and a name string field. I want to be able to create a Store, which is a LinkedHashMap, of these objects, but also extend a Saveable to allow the objects to be saved as so:

test.json

...

so I was trying to make my own version of a counting system for my server like how other bots such as countr do it, so I made the following:

...

I need help with a discord counting bot. Whatever server it is in, it has the same counter number. what I mean is that they are all paired and do the same count instead of it being server by server.

Here is the main part (not all of it), I just need to learn to have the servers separate from one another:

...