Java JLists

I'm relatively new to creating GUI interfaces. Up until now, I've used a package called BreezySwing which basically simplifies the creation process to instantiate most GUI objects.

For example: JButton b = addButton("OK",1,1,1,1); makes a JButton with the label "OK" at the top left of the gui.

But now I need to make a JList, and my package doesn't have the necessary methods to make one and successfully use a mouse listener. Something about the method creating a JDefaultList or something, where the mouse listener wants a JList or vice versa.

So how do I put a JList on my GUI and implement a mouse listener?

Thanks guys.

Perhaps the List Processing language is what you're looking for.

How about reading a fucking manual?

>>3

Hey, no reason to get mad. I've tried reading the documentation on oracle but it's really confusing, since my experience with building the GUI has been so limited.

I'm, for once, not going to answer a simple Java question on /prog/, not for any bias reason but because parsing the javadocs is a rite of passage for the language.

Obviously, the problem is the BreezySwing thing. It's not helping you but hiding things from you. What you're asking is pretty trivial, just go through Swing tutorials it's a matter of an hour or two.

GUI interfaces

GNU's not Unix Unix

GUI is not UNIX

>>1
basically
Stopped reading right there.

check`em son

>>8,9
SUSSIX Unix Salted Salmon Indo-europeanist Xenophobia

>>9
GUI Interface is Not UNIX

String[] x = {"derp1","derp2","derp3"};
        listModel = new DefaultListModel();
        list = new JList(listModel);
        this.add(list);
        list.setListData(x);

This adds a JList, but it's fucking tiny. It's only 5 characters wide and 3 lines tall. How do I make it fill up the space I need it to?

>>14
by reading the documentation

>>11
11
gg
11
33
U GON ANNA DONE IT BOY!!

>>15

Nowhere in the documentation does it mention setting the grid layout. I tried looking at GridBagLayout but it's all gibberish to me. Can someone please just help me instead of telling me to read the documentation?

>>17

Formally, assuming the axiom of choice, the cardinality of a set X is the least ordinal α such that there is a bijection between X and α. This definition is known as the von Neumann cardinal assignment. If the axiom of choice is not assumed we need to do something different. The oldest definition of the cardinality of a set X (implicit in Cantor and explicit in Frege and Principia Mathematica) is as the class [X] of all sets that are equinumerous with X. This does not work in ZFC or other related systems of axiomatic set theory because if X is non-empty, this collection is too large to be a set. In fact, for X ≠ ∅ there is an injection from the universe into [X] by mapping a set m to {m} × X and so by limitation of size, [X] is a proper class. The definition does work however in type theory and in New Foundations and related systems. However, if we restrict from this class to those equinumerous with X that have the least rank, then it will work (this is a trick due to Dana Scott: it works because the collection of objects with any given rank is a set).

In the Indian work on the theory of sets, two basic types of infinite numbers are distinguished. On both physical and ontological grounds, a distinction was made between asaṃkhyāta ("countless, innumerable") and ananta ("endless, unlimited"), between rigidly bounded and loosely bounded infinities.

In languages that do not have greatest and least elements, but do allow overloading of relational operators, it is possible for a programmer to create the greatest and least elements

Few full derivations of complex mathematical theorems from set theory have been formally verified, however, because such formal derivations are often much longer than the natural language proofs mathematicians commonly present. One verification project, Metamath, includes derivations of more than 10,000 theorems starting from the ZFC axioms and using first order logic.

The axiom of choice is avoided in some varieties of constructive mathematics, although there are varieties of constructive mathematics in which the axiom of choice is embraced.

Errett Bishop argued that the axiom of choice was constructively acceptable, saying


    "A choice function exists in constructive mathematics, because a choice is implied by the very meaning of existence."