Codync
A free, open-source 1:1 alternative to Grok Bot and Muse. Message Claude Code, Codex, Cursor and 40+ coding agents as persistent bots from your iPhone, Mac or Linux desktop. Group chats, threads, appr
Computes the shortest edit script between two sequences (atomic vectors, raw vectors or the lines of two strings) and returns it as data, with Myers algorithm (E. W. Myers (1986) <doi:10.1007/BF018404
Developer toolsGitHub @pedrobtzOnlineOwner unconfirmed
Have you tried it? One tap is enough. No sign-in needed.
Repository information has not been collected yet.
No updates detected yet. GitHub releases will appear here.
Computes the shortest edit script between two sequences (atomic vectors, raw vectors or the lines of two strings) and returns it as data, with Myers algorithm (E. W. Myers (1986) <doi:10.1007/BF01840446>) or patience diff. Builds hunks with context, writes and parses unified diffs, and applies an edit script or a unified diff. Equality is that of match(), so missing values, signed zeros, encodings and factor labels compare as R users expect. The algorithms are written in the Goose' programming l
Taken from the repository README
Loading the full README.
Read the full README ↗The goal of zudiff is to ...
You can install the development version of zudiff from GitHub with:
# install.packages("pak")
pak::pak("pedrobtz/zudiff")
This is a basic example which shows you how to solve a common problem:
library(zudiff)
## basic example code