Minestom VS rust

- What server software or framework to use. Ideally, if you dont need too much vanilla features (world generation, all mobs & items implemented, etc), I'd use something lightweight that is not based off of the vanilla server software. There are a few projects like this on github, including: https://github.com/Minestom/Minestom , https://github.com/feather-rs/feather , https://github.com/KryptonMC/Krypton , https://github.com/df-mc/dragonfly (bedrock). Which one you use will probably depend mostly on your preference. - You will need a way to store data separate from the servers. A database like postgres should work. There are a lot of different databases tho!

Even if performance is your worry, Minestom is an open-source barebones reimplementation of the minecraft server. With this, you can make extremelly custom things and let people connect using the default vanilla client. Of coruse, you can pair this with a mod if you want to.

Depends on what you're doing on said server. If it doesn't require vanilla mechanics then Minestom might suit the job well. Other than that, I'd recommend Paper, Purpur or Pufferfish.

It's unlikely to achieve have such performance and feature using Paper/Bukkit/Spigot or the one provided by Mojang. If you want to write your own server-side software, you could use Minestom.

This is quite a difficult questions because it depends on which type of Minecraft is currently being used (java, bedrock, education). The hardware available for the server as well as the ages of the students. Normal Minecraft servers are notoriously single threaded which makes it hard to host a server for 75 without good hardware. You could look into a project called minestom which is a nice library for making a multi threaded server, but it would require the students to program the server themselves. Which definitely could be fun and educational, but isn't doable with younger students

It is called Minestom. Its not done, but here is the website and discord. If you check out the showcase channel in the discord you'll see some pretty cool stuff they've made with the current program.

Im experimenting with Minestom and I want to make some crazy stress tests (1k users).

Also to add to this, if you don't need full vanilla functionality and are more focus on higher player count than something slightly more experimental but more performant might be your best bet like GlowstoneMC (glowstone supports paper plugins) or Minestrom

Almost fixed the compiler: https://github.com/rust-lang/rust/pull/123325

Rust: A secure, efficient, and modern programming language (omitting ten thousand words). You can simply follow the installation instructions provided on the official website.

Recently did something similar in Rust but for generating SVGs. We've adopted it for snapshot testing of cargo and rustc's output. Don't have a good PR handy for showing Github's rendering of changes in the SVG (text, side-by-side, swiping) but https://github.com/rust-lang/rust/pull/121877/files has newly added SVGs.

To see what is supported, see the screenshot in the docs: https://docs.rs/anstyle-svg/latest/anstyle_svg/

We strongly believe in Rust as a powerful language for building production-grade software, especially for systems like ours that run alongside Kubernetes.

The above Assert<{N % 2 == 1}> requires #![feature(generic_const_exprs)] and the nightly toolchain. See https://github.com/rust-lang/rust/issues/76560 for more info.

Another week, another dive into Rust. This time, we're delving into structs. Structs bear resemblance to interfaces in TypeScript, enabling the grouping of intricate data sets within an object, much like TypeScript/JavaScript. Rust also accommodates functions within these structs, offering a semblance of classes, albeit with distinctions. Let's delve into this topic.

There’s also other reasons. For example, take binary search:

* prefetch + cmov. These should be part of the STL but languages and compilers struggle to emit the cmov properly (Rust’s been broken for 6 years: https://github.com/rust-lang/rust/issues/53823). Prefetch is an interesting one because while you do optimize the binary search in a micro benchmark, you’re potentially putting extra pressure on the cache with “garbage” data which means it’s a greedy optimization that might hurt surrounding code. Probably should have separate implementations as binary search isn’t necessarily always in the hot path.

* Eytzinger layout has additional limitations that are often not discussed when pointing out “hey this is faster”. Adding elements is non-trivial since you first have to add + sort (as you would for binary search) and then rebuild a new parallel eytzinger layout from scratch (i.e. you’d have it be an index of pointers rather than the values themselves which adds memory overhead + indirection for the comparisons). You can’t find the “insertion” position for non-existent elements which means it can’t be used for std::lower_bound (i.e. if the element doesn’t exist, you just get None back instead of Err(position where it can be slotted in to maintain order).

Basically, optimizations can sometimes rely on changing the problem domain so that you can trade off features of the algorithm against the runtime. These kinds of algorithms can be a bad fit for a standard library which aims to be a toolbox of “good enough” algorithms and data structures for problems that appear very very frequently. Or they could be part of the standard library toolkit just under a different name but you also have to balance that against maintenance concerns.