Keybase proof
I hereby claim:
- I am andybryant on github.
- I am andybryant (https://keybase.io/andybryant) on keybase.
- I have a public key whose fingerprint is 8A31 F43C B643 4841 C472 3738 2A25 7516 D76E AB57
To claim this, I am signing this object:
package io.confluent.ksql.function.udf.datetime; | |
import io.confluent.common.utils.CopyOnWriteMap; | |
import io.confluent.ksql.function.udf.Udf; | |
import io.confluent.ksql.function.udf.UdfDescription; | |
import java.time.LocalDate; | |
import java.time.format.DateTimeFormatter; | |
import java.util.Map; |
package your.company.here; | |
import io.confluent.connect.jdbc.dialect.DatabaseDialect; | |
import io.confluent.connect.jdbc.dialect.DatabaseDialectProvider; | |
import io.confluent.connect.jdbc.dialect.PostgreSqlDatabaseDialect; | |
import org.apache.kafka.common.config.AbstractConfig; | |
import java.sql.Connection; | |
import java.sql.SQLException; |
StreamsBuilder builder = new StreamsBuilder(); | |
// ...build your topology here | |
Topology topology = builder.build(); | |
logger.info("Topology description {}", topology.describe()); |
builder | |
.stream("orders") | |
.flatMap(Ops::splitOrders) | |
.through("order-items") | |
.filter(Ops::excludeArchivedValues) | |
.to("active-order-items"); |
StreamsBuilder builder = new StreamsBuilder(); | |
builder | |
.stream("orders") | |
.flatMap(Ops::splitOrders) | |
.to("order-items"); | |
Topology topology = builder.build(); | |
Properties config = new Properties(); | |
config.put(StreamsConfig.APPLICATION_ID_CONFIG, "mySampleApp"); | |
config.put(StreamsConfig.BOOTSTRAP_SERVERS_CONFIG, "broker:9092"); |
I hereby claim:
To claim this, I am signing this object:
The tree
layout implements the Reingold-Tilford algorithm for efficient, tidy arrangement of layered nodes. The depth of nodes is computed by distance from the root, leading to a ragged appearance. Radial orientations are also supported. Implementation based on work by Jeff Heer and Jason Davies using Buchheim et al.'s linear-time variant of the Reingold-Tilford algorithm. Data shows the Flare class hierarchy, also courtesy Jeff Heer.
Compare to this radial layout.
The tree
layout implements the Reingold-Tilford algorithm for efficient, tidy arrangement of layered nodes. The depth of nodes is computed by distance from the root, leading to a ragged appearance. Cartesian orientations are also supported. Implementation based on work by Jeff Heer and Jason Davies using Buchheim et al.'s linear-time variant of the Reingold-Tilford algorithm. Data shows the Flare class hierarchy, also courtesy Jeff Heer.
Compare to this Cartesian layout.
gistup |
<!DOCTYPE html> | |
<meta charset="utf-8"> | |
Hello, world! |