{ "_id": "6a1efaafb401979e73418826", "Package": "poseticDataAnalysis", "Type": "Package", "Title": "Posetic Data Analysis", "Version": "1.1.0", "Authors@R": "c(\nperson(\"Alessandro\", \"Avellone\", email = \"alessandro.avellone@unimib.it\", role = c(\"aut\", \"cre\")),\nperson(\"Lucio\", \"De Capitani\", email = \"lucio.decapitani1@unimib.it\", role = c(\"aut\")),\nperson(\"Marco\", \"Fattore\", email = \"marco.fattore@unimib.it\", role = c(\"aut\"))\n)", "Maintainer": "Alessandro Avellone ", "Description": "Build and manipulate partially ordered sets (posets), to\nperform some data analysis on them and to implement\nmulti-criteria decision making procedures. Several efficient\nways for generating linear extensions are implemented, together\nwith functions for building mutual ranking probabilities,\nincomparability, dominance and separation scores (Fattore, M.,\nDe Capitani, L., Avellone, A., Suardi, A. (2024). A fuzzy\nposetic toolbox for multi-criteria evaluation on ordinal data\nsystems. ANNALS OF OPERATIONS RESEARCH\n).", "License": "GPL (>= 2)", "SystemRequirements": "C++20", "NeedsCompilation": "yes", "Encoding": "UTF-8", "Collate": "'00package-exports.R' '00package-class.R' 'IsSymmetric.R'\n'IsReflexive.R' 'IsAntisymmetric.R' 'IsTransitive.R'\n'IsPreorder.R' 'IsPartialOrder.R' 'TransitiveClosure.R'\n'ReflexiveClosure.R' 'POSet.R' 'LinearPOSet.R' 'ProductPOSet.R'\n'BinaryVariablePOSet.R' 'IntersectionPOSet.R'\n'LinearSumPOSet.R' 'DisjointSumPOSet.R' 'LiftingPOSet.R'\n'CrownPOSet.R' 'FencePOSet.R' 'DualPOSet.R'\n'LexicographicProductPOSet.R' 'POSetElements.R'\n'DominanceMatrix.R' 'IsDominatedBy.R' 'Dominates.R'\n'IsComparableWith.R' 'IsIncomparableWith.R' 'UpsetOf.R'\n'IsUpset.R' 'DownsetOf.R' 'IsDownset.R' 'ComparabilitySetOf.R'\n'IncomparabilitySetOf.R' 'POSetMinimals.R' 'POSetMaximals.R'\n'IsMinimal.R' 'IsMaximal.R' 'CoverRelation.R' 'CoverMatrix.R'\n'OrderRelation.R' 'IncomparabilityRelation.R' 'POSetMeet.R'\n'POSetJoin.R' 'IsExtensionOf.R' 'LEGenerator.R'\n'LEBubleyDyer.R' 'LEGet.R' 'ExactMRP.R'\n'BubleyDyerMRPGenerator.R' 'BubleyDyerMRP.R'\n'ExactEvaluation.R' 'BuildBubleyDyerEvaluationGenerator.R'\n'BubleyDyerEvaluation.R' 'BLSDominance.R'\n'BubleyDyerSeparation.R' 'BuildBubleyDyerSeparationGenerator.R'\n'ExactSeparation.R' 'LexSeparation.R' 'LexMRP.R'\n'FuzzyInBetweenness.R' 'FuzzyInBetweennessMinMax.R'\n'FuzzyInBetweennessProbabilistic.R' 'FuzzySeparation.R'\n'FuzzySeparationMinMax.R' 'FuzzySeparationProbabilistic.R'\n'OptimalBidimensionalEmbedding.R'\n'BidimentionalPosetRepresentation.R'", "Config/roxygen2/version": "8.0.0", "Packaged": { "Date": "2026-05-18 11:20:09 UTC", "User": "root" }, "Author": "Alessandro Avellone [aut, cre], Lucio De Capitani [aut], Marco\nFattore [aut]", "Repository": "https://aavellone.r-universe.dev", "Date/Publication": "2026-05-18 08:55:35 UTC", "RemoteUrl": "https://github.com/cran/poseticDataAnalysis", "RemoteRef": "HEAD", "RemoteSha": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "MD5sum": "1d55b964c30d672558b589209a972533", "_user": "aavellone", "_type": "src", "_file": "poseticDataAnalysis_1.1.0.tar.gz", "_fileid": "886c0d159fa09e807716d581d1117a8de74b25d74ac3ab1d9dd0e02d726070c8", "_filesize": 483513, "_sha256": "886c0d159fa09e807716d581d1117a8de74b25d74ac3ab1d9dd0e02d726070c8", "_created": "2026-05-18T11:20:09.000Z", "_published": "2026-06-02T15:45:51.701Z", "_distro": "noble", "_jobs": [ { "job": 79111712678, "time": 166, "config": "linux-devel-arm64", "r": "4.7.0", "check": "OK", "artifact": "7056449697" }, { "job": 79111712284, "time": 140, "config": "linux-devel-x86_64", "r": "4.7.0", "check": "OK", "artifact": "7056441379" }, { "job": 79111713054, "time": 156, "config": "linux-release-arm64", "r": "4.6.0", "check": "OK", "artifact": "7056446471" }, { "job": 79111712665, "time": 161, "config": "linux-release-x86_64", "r": "4.6.0", "check": "OK", "artifact": "7056447949" }, { "job": 79111713384, "time": 145, "config": "macos-oldrel-arm64", "r": "4.5.3", "check": "OK", "artifact": "7056442737" }, { "job": 79111713226, "time": 316, "config": "macos-oldrel-x86_64", "r": "4.5.3", "check": "OK", "artifact": "7056498557" }, { "job": 79111713363, "time": 168, "config": "macos-release-arm64", "r": "4.6.0", "check": "OK", "artifact": "7056450072" }, { "job": 79111712068, "time": 374, "config": "macos-release-x86_64", "r": "4.6.0", "check": "OK", "artifact": "7056518706" }, { "job": 79111710989, "time": 214, "config": "source", "r": "4.6.0", "check": "OK", "artifact": "7056394131" }, { "job": 79111711477, "time": 138, "config": "wasm-release", "r": "4.6.0", "check": "OK", "artifact": "7362702183" }, { "job": 79111712384, "time": 198, "config": "windows-devel", "r": "4.7.0", "check": "OK", "artifact": "7056460247" }, { "job": 79111712940, "time": 172, "config": "windows-oldrel", "r": "4.5.3", "check": "OK", "artifact": "7056451630" }, { "job": 79111713153, "time": 202, "config": "windows-release", "r": "4.6.0", "check": "OK", "artifact": "7056461472" } ], "_buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890", "_status": "success", "_host": "GitHub-Actions", "_upstream": "https://github.com/cran/poseticDataAnalysis", "_commit": { "id": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "author": "Alessandro Avellone ", "committer": "cran-robot ", "message": "version 1.1.0\n", "time": 1779094535 }, "_maintainer": { "name": "Alessandro Avellone", "email": "alessandro.avellone@unimib.it", "login": "aavellone", "description": "", "uuid": 78357968 }, "_registered": true, "_dependencies": [ { "package": "methods", "role": "Imports" } ], "_owner": "cran", "_selfowned": true, "_usedby": 0, "_updates": [ { "week": "2025-43", "n": 1 }, { "week": "2025-44", "n": 1 }, { "week": "2025-50", "n": 1 }, { "week": "2026-21", "n": 1 } ], "_tags": [ { "name": "0.1.0", "date": "2025-10-23" }, { "name": "0.1.1", "date": "2025-10-29" }, { "name": "1.0.0", "date": "2025-12-10" }, { "name": "1.1.0", "date": "2026-05-18" } ], "_stars": 0, "_contributors": [ { "user": "aavellone", "count": 4, "uuid": 78357968 } ], "_userbio": { "uuid": 78357968, "type": "user", "name": "aavellone" }, "_downloads": { "count": 201, "source": "https://cranlogs.r-pkg.org/downloads/total/last-month/poseticDataAnalysis" }, "_searchresults": 0, "_topics": [ "cpp" ], "_rbuild": "4.6.0", "_assets": [ "extra/citation.cff", "extra/citation.html", "extra/citation.json", "extra/citation.txt", "extra/contents.json", "extra/poseticDataAnalysis.html", "manual.pdf" ], "_realowner": "aavellone", "_cranurl": false, "_releases": [ { "version": "0.1.0", "date": "2025-10-23" }, { "version": "0.1.1", "date": "2025-10-29" }, { "version": "1.0.0", "date": "2025-12-11" }, { "version": "1.1.0", "date": "2026-05-18" } ], "_exports": [ "BidimentionalPosetRepresentation", "BinaryVariablePOSet", "BLSDominance", "BubleyDyerEvaluation", "BubleyDyerMRP", "BubleyDyerMRPGenerator", "BubleyDyerSeparation", "BuildBubleyDyerEvaluationGenerator", "BuildBubleyDyerSeparationGenerator", "ComparabilitySetOf", "CoverMatrix", "CoverRelation", "CrownPOSet", "DisjointSumPOSet", "DominanceMatrix", "Dominates", "DownsetOf", "DualPOSet", "ExactEvaluation", "ExactMRP", "ExactSeparation", "FencePOSet", "FuzzyInBetweenness", "FuzzyInBetweennessMinMax", "FuzzyInBetweennessProbabilistic", "FuzzySeparation", "FuzzySeparationMinMax", "FuzzySeparationProbabilistic", "IncomparabilityRelation", "IncomparabilitySetOf", "IntersectionPOSet", "IsAntisymmetric", "IsComparableWith", "IsDominatedBy", "IsDownset", "IsExtensionOf", "IsIncomparableWith", "IsMaximal", "IsMinimal", "IsPartialOrder", "IsPreorder", "IsReflexive", "IsSymmetric", "IsTransitive", "IsUpset", "LEBubleyDyer", "LEGenerator", "LEGet", "LexicographicProductPOSet", "LexMRP", "LexSeparation", "LiftingPOSet", "LinearPOSet", "LinearSumPOSet", "OptimalBidimensionalEmbedding", "OrderRelation", "POSet", "POSetElements", "POSetJoin", "POSetMaximals", "POSetMeet", "POSetMinimals", "ProductPOSet", "ReflexiveClosure", "TransitiveClosure", "UpsetOf" ], "_help": [ { "page": "poseticDataAnalysis-package", "title": "poseticDataAnalysis: Posetic Data Analysis", "topics": [ "poseticDataAnalysis-package", "poseticDataAnalysis" ] }, { "page": "BidimentionalPosetRepresentation", "title": "Bidimensional representation of multidimensional ordinal binary data generated by a specific reversed pair of lexicographic linear extensions", "topics": [ "BidimentionalPosetRepresentation" ] }, { "page": "BinaryVariablePOSet", "title": "Constructing a component-wise poset of binary vectors.", "topics": [ "BinaryVariablePOSet" ] }, { "page": "BinaryVariablePOSet-class", "title": "An S4 class to represent a Binary Variable POSet.", "topics": [ "BinaryVariablePOSet-class" ] }, { "page": "BLSDominance", "title": "Computing the BLS dominance matrix of a poset.", "topics": [ "BLSDominance" ] }, { "page": "BubleyDyerEvaluation", "title": "Estimating function averages on linear extensions, by the Bubley-Dyer procedure.", "topics": [ "BubleyDyerEvaluation" ] }, { "page": "BubleyDyerEvaluationGenerator-class", "title": "An S4 class to represent function evaluation based on the Bubley-Dyer procedure.", "topics": [ "BubleyDyerEvaluationGenerator-class" ] }, { "page": "BubleyDyerGenerator-class", "title": "An S4 class to represent the linear extension generator based on the Bubley-Dyer procedure.", "topics": [ "BubleyDyerGenerator-class" ] }, { "page": "BubleyDyerMRP", "title": "Approximating MRP matrix computation, using the Bubley-Dyer procedure.", "topics": [ "BubleyDyerMRP" ] }, { "page": "BubleyDyerMRPGenerator", "title": "Generator of an approximated MRP matrix.", "topics": [ "BubleyDyerMRPGenerator" ] }, { "page": "BubleyDyerMRPGenerator-class", "title": "An S4 class to represent the MRP generator based on the Bubley-Dyer procedure.", "topics": [ "BubleyDyerMRPGenerator-class" ] }, { "page": "BubleyDyerSeparation", "title": "Approximated separation matrices computation, using the Bubley-Dyer procedure (see Bubley and Dyer, 1999).", "topics": [ "BubleyDyerSeparation" ] }, { "page": "BubleyDyerSeparationGenerator-class", "title": "An S4 class to represent function separation based on the Bubley-Dyer procedure.", "topics": [ "BubleyDyerSeparationGenerator-class" ] }, { "page": "BuildBubleyDyerEvaluationGenerator", "title": "Generator for the approximated computation of the mean value of functions over linear extensions.", "topics": [ "BuildBubleyDyerEvaluationGenerator" ] }, { "page": "BuildBubleyDyerSeparationGenerator", "title": "Generator of an approximated separation matrix.", "topics": [ "BuildBubleyDyerSeparationGenerator" ] }, { "page": "ComparabilitySetOf", "title": "Extracting the comparability set of a poset element.", "topics": [ "ComparabilitySetOf" ] }, { "page": "CoverMatrix", "title": "Computing the cover matrix of a poset.", "topics": [ "CoverMatrix" ] }, { "page": "CoverRelation", "title": "Computing the cover relation of a poset.", "topics": [ "CoverRelation" ] }, { "page": "CrownPOSet", "title": "Building crowns.", "topics": [ "CrownPOSet" ] }, { "page": "DisjointSumPOSet", "title": "Disjoint sum of posets.", "topics": [ "DisjointSumPOSet" ] }, { "page": "DominanceMatrix", "title": "Computing the dominance matrix.", "topics": [ "DominanceMatrix" ] }, { "page": "Dominates", "title": "Checking whether one element dominates another.", "topics": [ "Dominates" ] }, { "page": "DownsetOf", "title": "Computing downsets.", "topics": [ "DownsetOf" ] }, { "page": "DualPOSet", "title": "Dual of a poset.", "topics": [ "DualPOSet" ] }, { "page": "ExactEvaluation", "title": "Computing function mean values on linear extensions", "topics": [ "ExactEvaluation" ] }, { "page": "ExactMRP", "title": "Computing Mutual Ranking Probabilities (MRP).", "topics": [ "ExactMRP" ] }, { "page": "ExactMRPGenerator-class", "title": "An S4 class to represent the exact MRP generator.", "topics": [ "ExactMRPGenerator-class" ] }, { "page": "ExactSeparation", "title": "Exact separation matrices computation.", "topics": [ "ExactSeparation" ] }, { "page": "FencePOSet", "title": "Building fences.", "topics": [ "FencePOSet" ] }, { "page": "FromPOSet-class", "title": "An S4 class to represent a virtual class for POSet extention.", "topics": [ "FromPOSet-class" ] }, { "page": "FuzzyInBetweenness", "title": "Fuzzy in-betweenness array computation", "topics": [ "FuzzyInBetweenness" ] }, { "page": "FuzzyInBetweennessMinMax", "title": "Fuzzy in-betweenness array computation with minimum t-norm and maximum t-conorm", "topics": [ "FuzzyInBetweennessMinMax" ] }, { "page": "FuzzyInBetweennessProbabilistic", "title": "Fuzzy in-betweenness array computation with Product t-norm and Probabilistic-sum t-conorm", "topics": [ "FuzzyInBetweennessProbabilistic" ] }, { "page": "FuzzySeparation", "title": "Fuzzy separation matrix computation", "topics": [ "FuzzySeparation" ] }, { "page": "FuzzySeparationMinMax", "title": "Fuzzy Separation computation with minimum t-norm and maximum t-conorm", "topics": [ "FuzzySeparationMinMax" ] }, { "page": "FuzzySeparationProbabilistic", "title": "Fuzzy Separation matrix computation with Product t-norm and Probabilistic-sum t-conorm", "topics": [ "FuzzySeparationProbabilistic" ] }, { "page": "IncomparabilityRelation", "title": "Computing the incomparability relation of a poset.", "topics": [ "IncomparabilityRelation" ] }, { "page": "IncomparabilitySetOf", "title": "Extracting the incomparability set of a poset element.", "topics": [ "IncomparabilitySetOf" ] }, { "page": "IntersectionPOSet", "title": "Computing the intersection of a collection of posets.", "topics": [ "IntersectionPOSet" ] }, { "page": "IsAntisymmetric", "title": "Checking binary relation antisymmetry.", "topics": [ "IsAntisymmetric" ] }, { "page": "IsComparableWith", "title": "Checking comparability between two elements of a poset.", "topics": [ "IsComparableWith" ] }, { "page": "IsDominatedBy", "title": "Checking whether one element is dominated by another.", "topics": [ "IsDominatedBy" ] }, { "page": "IsDownset", "title": "Checking for downsets.", "topics": [ "IsDownset" ] }, { "page": "IsExtensionOf", "title": "Checking poset extensions.", "topics": [ "IsExtensionOf" ] }, { "page": "IsIncomparableWith", "title": "Checking incomparability between two elements of a poset.", "topics": [ "IsIncomparableWith" ] }, { "page": "IsMaximal", "title": "Checking maximality.", "topics": [ "IsMaximal" ] }, { "page": "IsMinimal", "title": "Checking minimality.", "topics": [ "IsMinimal" ] }, { "page": "IsPartialOrder", "title": "Checking for partial ordering.", "topics": [ "IsPartialOrder" ] }, { "page": "IsPreorder", "title": "Checking for pre-ordering (or quasi-ordering).", "topics": [ "IsPreorder" ] }, { "page": "IsReflexive", "title": "Checking binary relation reflexivity.", "topics": [ "IsReflexive" ] }, { "page": "IsSymmetric", "title": "Checking binary relation symmetry.", "topics": [ "IsSymmetric" ] }, { "page": "IsTransitive", "title": "Checking binary relation transitivity.", "topics": [ "IsTransitive" ] }, { "page": "IsUpset", "title": "Checking upsets.", "topics": [ "IsUpset" ] }, { "page": "LEBubleyDyer", "title": "Generator of linear extensions through the Bubley-Dyer procedure.", "topics": [ "LEBubleyDyer" ] }, { "page": "LEGenerator", "title": "Generator of all the linear extensions of a poset.", "topics": [ "LEGenerator" ] }, { "page": "LEGenerator-class", "title": "An S4 class to represent the exact linear extension generator.", "topics": [ "LEGenerator-class" ] }, { "page": "LEGet", "title": "Generates linear extensions of a given poset, by using a linear extension generator", "topics": [ "LEGet" ] }, { "page": "LexicographicProductPOSet", "title": "Computing lexicographic product orders.", "topics": [ "LexicographicProductPOSet" ] }, { "page": "LexicographicProductPOSet-class", "title": "An S4 class to represent a Lexicographic Product POSet.", "topics": [ "LexicographicProductPOSet-class" ] }, { "page": "LexMRP", "title": "MRP matrix computation over the set of lexicographic linear extensions.", "topics": [ "LexMRP" ] }, { "page": "LexSeparation", "title": "Separation matrices computation over the set of lexicographic linear extensions.", "topics": [ "LexSeparation" ] }, { "page": "LiftingPOSet", "title": "Lifting posets.", "topics": [ "LiftingPOSet" ] }, { "page": "LinearPOSet", "title": "Constructing a Linearly Ordered Set.", "topics": [ "LinearPOSet" ] }, { "page": "LinearPOSet-class", "title": "An S4 class to represent a Linear POSet.", "topics": [ "LinearPOSet-class" ] }, { "page": "LinearSumPOSet", "title": "Linear sum of posets.", "topics": [ "LinearSumPOSet" ] }, { "page": "OptimalBidimensionalEmbedding", "title": "Dimensionality reduction of multidimensional ordinal binary data", "topics": [ "OptimalBidimensionalEmbedding" ] }, { "page": "OrderRelation", "title": "Extracting the order relation of a poset.", "topics": [ "OrderRelation" ] }, { "page": "POSet", "title": "Constructing a Partially Ordered Set.", "topics": [ "POSet" ] }, { "page": "POSet-class", "title": "An S4 class to represent a POSet.", "topics": [ "POSet-class" ] }, { "page": "POSetElements", "title": "Getting poset elements.", "topics": [ "POSetElements" ] }, { "page": "POSetJoin", "title": "Computing join (least upper bound).", "topics": [ "POSetJoin" ] }, { "page": "POSetMaximals", "title": "Computing the maximal elements of a poset.", "topics": [ "POSetMaximals" ] }, { "page": "POSetMeet", "title": "Computing meet (greatest lower bound).", "topics": [ "POSetMeet" ] }, { "page": "POSetMinimals", "title": "Computing the minimal elements of a poset.", "topics": [ "POSetMinimals" ] }, { "page": "ProductPOSet", "title": "Constructing the product of posets.", "topics": [ "ProductPOSet" ] }, { "page": "ProductPOSet-class", "title": "An S4 class to represent a Product POSet.", "topics": [ "ProductPOSet-class" ] }, { "page": "ReflexiveClosure", "title": "Computing reflexive closure.", "topics": [ "ReflexiveClosure" ] }, { "page": "TransitiveClosure", "title": "Computing transitive closure.", "topics": [ "TransitiveClosure" ] }, { "page": "UpsetOf", "title": "Computing upsets.", "topics": [ "UpsetOf" ] } ], "_rundeps": [], "_sysdeps": [ { "shlib": "libstdc++", "package": "libstdc++6", "source": "gcc", "version": "14.2.0-4ubuntu2~24.04.1", "name": "c++", "homepage": "http://gcc.gnu.org/", "description": "GNU Standard C++ Library v3" } ], "_score": 1.6020599913279625, "_indexed": true, "_nocasepkg": "poseticdataanalysis", "_universes": [ "aavellone" ], "_binaries": [ { "r": "4.7.0", "os": "linux", "version": "1.1.0", "date": "2026-05-18T11:23:04.000Z", "distro": "noble", "arch": "aarch64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "30a67fe3622c4299ac210a12f927cc6934678f911bfe5cc1d97f31a063e9cbcb", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.7.0", "os": "linux", "version": "1.1.0", "date": "2026-05-18T11:22:44.000Z", "distro": "noble", "arch": "x86_64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "7e17f38784b2c1f636ed0e55a0e60488ade05b91e24c75f9a687b2d32de266aa", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.6.0", "os": "linux", "version": "1.1.0", "date": "2026-05-18T11:22:56.000Z", "distro": "noble", "arch": "aarch64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "49288184a6665db329bfd975dcc3e7e4ecc567b1aeb70f553520fb6e96b22399", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.6.0", "os": "linux", "version": "1.1.0", "date": "2026-05-18T11:23:00.000Z", "distro": "noble", "arch": "x86_64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "7d1fa4b2d3a1929a57cd3f6f93960b8689965f0d331fb7d9577a50dd7f9cb8bd", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.5.3", "os": "mac", "version": "1.1.0", "date": "2026-05-18T11:22:58.000Z", "arch": "aarch64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "1436e212625b769bd4905a620771ab7e287a1aedcf7dac3bc064882fe9908726", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.5.3", "os": "mac", "version": "1.1.0", "date": "2026-05-18T11:24:20.000Z", "arch": "x86_64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "128dbca702c5df240d481129812df84c647d89083ee6dfb7a452d5e8705efb99", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.6.0", "os": "mac", "version": "1.1.0", "date": "2026-05-18T11:23:12.000Z", "arch": "aarch64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "b5f8e0d8f921f0bc67385ae420a4119768b422d505d7680322f8bf68b31e004c", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.6.0", "os": "mac", "version": "1.1.0", "date": "2026-05-18T11:24:59.000Z", "arch": "x86_64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "a1a8b3859cc3a4b8bd560d2036256f01777bf95e20f072836e9f7b3cee9c3c5b", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.7.0", "os": "win", "version": "1.1.0", "date": "2026-05-18T11:22:18.000Z", "arch": "x86_64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "55dd20864a77ea27fbca46322988ec8a958d923371304a9c8e14171e40c88670", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.5.3", "os": "win", "version": "1.1.0", "date": "2026-05-18T11:22:12.000Z", "arch": "x86_64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "bcf666d519dade5876e5da68b93fd684a69911fecb8b5f20e1f69da95164feb2", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.6.0", "os": "win", "version": "1.1.0", "date": "2026-05-18T11:22:16.000Z", "arch": "x86_64", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "0ec729ef50ad91e6e7a9abf5febcea312386395476a879d1db6d529a67879f99", "status": "success", "check": "OK", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" }, { "r": "4.6.0", "os": "wasm", "version": "1.1.0", "date": "2026-06-02T15:44:26.000Z", "arch": "emscripten", "commit": "4f53362b7fd3fa2f93b19c3487df4f782fe23c79", "fileid": "b9855c23505d33a94d0be471ef215527c53b0bc747635c684122399b2c21e2c3", "status": "success", "buildurl": "https://github.com/r-universe/aavellone/actions/runs/26030161890" } ] }