## java – Como faço para adicionar dinamicamente população e cidade em um MAP e depois resgatar a população pelo nome da cidade?

O usuário informa a cidade e a população que serão salvos em um Map<String,Integer>, em seguida obtém a população informando a cidade.

``````public class Question3 {

public static void main(String() args) {

List<Cidades> listCidades = new ArrayList<Cidades>();

Map<String, List<Cidades>> mapcidades = new HashMap<String, List<Cidades>>();

int escolha = JOptionPane.showConfirmDialog(null,"Deseja cadastrar cidade e população");

if (escolha == 0) {

String cidade = JOptionPane.showInputDialog("Qual cidade");
String populacao = JOptionPane.showInputDialog("Qual populaçao");

listCidades.add(cidade);
mapcidades.put(populacao, listCidades );

}

for (Cidades cidades2 : listCidades) {
mapcidades.get(mapcidades);
}

}
}
``````

## can multiple drive-TIME radii be added to a google map?

I want to create a “heat map” of sorts with multiple driving radii by drive-time and not distance.

These would need to either auto-update,
or have a persistent link so it could be refreshed to update,
and preferably with each radius being able to be user-labeled.
Eg. for each radius to have a label of the time of the radius,
or even better, to be able to customize each label by another point of reference.

## I Will Create 2000 Google Map citation for any country for \$4

#### I Will Create 2000 Google Map citation for any country

>>>>>>>>>>>>>>>Welcome to my Description<<<<<<<<<<<<<<<<

Hello sir,

I have been working on digital marketing for along time. I am experienced working on Google Map Citations. Google Maps helps

to boost local business ranking in Search Engines. I think that will bring success to your business. Google Map Citations are the only way to succeed in a competitive modern business .

Why accept my service :

• 100% manual work
• 100% accuracy work
• 100% Natural maps citation
• My only job is digital marketing
• My only goal is to serve the buyer
• Timely delivery is my rule
• My service will be very high Quality
• 24/7 days support

I am ready to work for you. you can place order anytime.

.

## ag.algebraic geometry – Kernel sheaf of evaluation map

I have some questions on the kernel sheaf of the evaluation map.

Let $$F$$ be a globally generated rank $$2$$ torsion free stable sheaf on a smooth projective variety $$X$$. Then the evaluation map $$ev: H^0(X, F)otimes mathcal{O}_X to F$$ is surjective. Denote $$K:=Ker(ev)$$, Then I wonder that:

(1) Is $$K$$ always locally free?

(2) What can we talk about the stability of $$K$$?

Thanks for any help.

## at.algebraic topology – Boundary map in Mayer-Vietoris sequence of cohomology

Suppose $$M$$ is a 3-manifold with connected boundary. Let $$T$$ be a tangle in $$M$$, i.e., $$T$$ is a embedded connected 1-submanifold whose boundary is on $$partial M$$. Moreover, suppose $$T$$ represents a torsion element in $$H_1(M,partial M;mathbb{Z})$$. Suppose $$M_T=M-N(T)$$ is the tangle complement. Consider the boundary map $$delta_*:H^1(M_Tcap N(T);mathbb{Z})to H^2(M;mathbb{Z})$$ from the Mayer-Vietoris sequence associated to $$(M,M_T,N(T))$$. We have $$H^1(M_Tcap N(T);mathbb{Z})cong H^1(S^1times I;mathbb{Z})congmathbb{Z}$$. What’s the image of $$delta_*$$? I guess it is generated by the Lefschetz (Poincare) duality of $$(T)in H_1(M,partial M;mathbb{Z})cong H^2(M;mathbb{Z})$$.

## Connecting common points on a map

I work with a private preschool – 12th-grade school. The school has several campuses. And each campus has several hundred families. We have two separate spreadsheets. One spreadsheet has all of the parents’ home addresses and the other spreadsheet has all of the parents’ work addresses. We’re using a mapping software called eSpatial (but it’s limited). We can upload the spreadsheets (datasets) and map both batches of addresses.

The problem is that this doesn’t really tell us very much. Ultimately, we need a way to link home and work addresses together, visually, as being the same person.

For example, let’s say one point on a map is a parent’s home address at 123 Main St. and another point on the map is the same parent’s work address at 321 Sycamore Rd. We need a way to visually know that the two points below to the same person so we can see who, and how far, each parent travels to work. Ideally, if there was a line that connected the two points that would be great. That would make it easy to see how far away the parent works. Or it would also work to hover over one point and the corresponding home or work point would highlight.

Currently, the two spreadsheets do not have a common column that links the two together (I guess a “key”). Although I can create a spreadsheet that has a student ID column which would be the key between the two.

Any thoughts on how to put something like this together? Hopefully, this makes sense.

## javascript – how to map an array of objects with a children array

I am a beginner who just started writing in typescript.

I would like to ask how to map an array of objects with a children array efficiently.
what I am trying to do is I am trying to map navigation menu item objects to two arrays for a json LD object.

I have an array of navigation items as below.

``````const navigationMenuItems = (
{name:'TOP', path:'/', hasChildren:false},
{name:'commitment', path:'/commitment', hasChildren:false},
{name:'items', path:null, hasChildren:true,
children:(
{ name:'logo', path:'/logo', hasChildren:false },
{ name:'wappen', path:'/wappen', hasChildren:false },
)
},
);
``````

I wanted to map the object’s fields to two arrays for a json LD object like this. The json LD object has the name field and the url field, and they take arrays.

``````{
"@context": "https://schema.org",
"@type": "SiteNavigationElement",
"name" :('TOP', 'commitment','items'),
"url":('https:/sample.com/','https:/sample.com/commitment')
}
``````

my solution was to use forEach loops twice as below.
I made two arrays and pushed each field in each array. Quite simple..

``````    export function generateWebPageJsonLd(navigationItems:Array<navigationItemType>) {

let names= ();
let paths = ();
return flatNavigationList(navigationItems,names,paths);
}

const flatNavigationList = (navigationItems: Array<navigationItemType>, names, paths) => {
const result = navigationItems.forEach(element => {
if (element.hasChildren === false) {
return names.push(element.name) && paths.push(`\${process.env.NEXT_PUBLIC_SITE_URL}\${element.path}`)
}
else {
return element.children.forEach(child => {
return names.push(child.name) && paths.push(`\${process.env.NEXT_PUBLIC_SITE_URL}\${child.path}`)
})
}
})
return result;
}
``````

I wanted to use Map but I had to use flatMap twice so I went for Foreach.

This code does what I want, however, somehow I feel like this is not the cleanest and most efficient way to go about this.
Can someone please make suggestions as to how to make this solution better?
Thanks in advance.

## cv.complex variables – Quasiconformal Map from a Subset of \$mathbb{C}\$ to a Polytope

Does a quasiconformal map exist between a subset of $$mathbb{C}$$ (such as a unit disc or rectangle) and a polytope? (Here, I take a polytope to be a two-dimensional surface that could be embedded in $$mathbb{R}^3$$ or some other three-dimensional space, possibly $$mathbb{H}^3$$.) In particular, this question interested me as it would offer a method to parameterize a permutohedron with the complex plane. The premise of this question was inspired by Dantzig’s method, a numerical optimization technique in linear programming that can be realized as a path along the edge of a simplex.

By segmenting $$mathbb{R}^3$$ into a series of planes and applying a Schwarz-Christoffel transform on each, I was able to form an injective map from the unit disc to polytope in three dimensions; however, I do not believe it is quasiconformal. As a secondary question, does anyone know if any such mapping could preserve the holomorphicity of a function on $$mathbb{C}$$?

Thank you.