aversion | Make your Ruby

I recently started working with dynamic listview items. It's great except for when I try to add and clear items with bitmaps. I have a listview where I add items and download the image into a memstream and assign it to the bitmap of the dynamic listview item. This works except for when I go and clear all the items with lv.items.clear it does not get removed from memory.

The memory just keeps rising even though I clear the old items. Is there a ways to clear all the bitmaps?

Basically what happens is:

1. Populate dynamic listview with 10 items. Add data and bitmaps.
2. Look at memory. Went up with 2 megabytes.
3. Clear the listview with lv.items.clear.
4. Look at memory. No change?
5. Repeat and the memory just goes up and up.

I have tried looping through all the listview items and setting each bitmap to nil but no result in any memory change. I also tried freeing each item by looping through it but it just crashes the app.

Should I be clearing all the items or bitmaps in a way? If so how can I go about doing that?

Here's how I'm loading all of the items:

I often find chemical formulae in my documents that require the numbers to be made subscript. e.g. H2O should be H₂O and H2SO4 should be H₂SO₄. I am trying to write a macro that will take numbers from a highlighted selection and subscript numerical values. I am not very good at programming. I have tried variations on the following:

I've been provided a list of products names (50-100 names each quarter) and I need to build a crosswalk table from these broad product names to more specific names that are stored in our product table.

Here is an example of two products I've been provided with:

I want to deserialize a local json file using Gson to create a recyclerview. However I get an IllegalStateException on below line.

My problem is that I have a fairly large set of "brute force versioned" files, i.e. stored along with date indicator, that are also distributed over various data carriers.

After having overcome my aversion against version control, I would like to put all those files in a git repo that allows for chronological reconstruction of the snapshots.

Questions:

• suppose I have a git repo that contains snapshots corresponding to dates A <- B <- E <- F in chronological order and I discover snaphot C on a dustcovered data carrier; how do I go about adding spapshot C to resemble the git repo contain A <- B <- C <- E <- F

• how can I add a file f to snapshot B that is already present in the other submitted snapshots?

Ideally the generated git repo should give the impression that all submissions happened in chronological order, i.e. at some point, when I'm sure that everything is in the repo, I want to remove all information about the order in which the snapshots/files have been added to the git repo; is there also a solution for that?

As I am no git wizzard I would appreciate hands on solutions.

Before I start, let me say I know what I am trying to do is unorthodox and perhaps people will have an aversion to the whole concept, however I am curious as to whether it is possible.

So here is the question.

Given an instance k of a class Kthat has an integer attribute z initialised to zero; can we call a lambda function from within k that modifies k.z?

An example would be simply incrementing k.z from 0 to 1.

I've played around a little to see if I could get it to work, and despite success I have included some of that code below.

Java 8 here. I have the following POJOs:

I'm trying to solve a Quadratic optimization problem with linear constrains using the R package CVXR. Although the default solver is able to solve the optimization, Mosek solver is not. The reason I'm looking to use Mosek is because I need to solve a bigger problem with more than 250 constrains and the default solver gives an inaccurate solution, so I'm looking to solve the bigger problem with Mosek. Here's a simple example were Mosek is not working:

I'm wondering how (or if it is currently possible) to express that a function will return a subclass of a particular class that is acceptable to mypy?

Here's a simple example where a base class Foo is inherited by Bar and Baz and there's a convenience function create() that will return a subclass of Foo (either Bar or Baz) depending upon the specified argument: