kalmarek

kalmarek

module Groups

using AbstractAlgebra
const Group = AbstractAlgebra.Group
const GroupElement = AbstractAlgebra.GroupElem

export hasgens, hasorder, rand_pseudo,
    direct_product, semidirect_product,
    one!, conj, conj!, comm, comm!, div_left!, div_right!

kalmarek

using Test
using AbstractAlgebra

has_base_ring(R::AbstractAlgebra.NCRing) = base_ring(R) != Union{}

function AbstractAlgebra.promote_rule(::Type{S}, ::Type{T}) where {S <: Real, T <: Real}
    return Base.promote_rule(S, T)
end

function test_data_type(f,g)

kalmarek

diff --git a/scs.mk b/scs.mk
index 7bb7b4f..3705728 100644
--- a/scs.mk
+++ b/scs.mk
@@ -31,12 +31,14 @@ endif
 endif
 endif
 
+CUDADIR = /opt/cuda
 ifeq ($(UNAME), Darwin)

kalmarek

/* file fsalib_wrapper.c  18/01/19
 *
 * This file is a wrapper for a shared and a static library. It provides
 * proper definitions used while linking a library.
 *
 */

#include "defs.h"
#include "../src/definitions.h"

kalmarek

So here You are, our promises led you to a land flowing with julia and Polymake, and yet when You tried our new fancy stuff, instead of getting a new shiny result You slam into a warning, which reads

┌ Warning: The return value contains (pm::SomeType<pm::with::parameters>) which has not been wrapped yet
└ @ Polymake ~/.julia/dev/Polymake/src/functions.jl:75
(insert some string representation here)

In this document we will guide You what does this warning mean, how to make use of the retured object and how to become a Polymake.jl contributor who wrapped yet another small object from the polymake small objects zoo.

Do I really need to wrap the the thing?

kalmarek

kalmarek

seed : 1538317385                                                                                                                                                                          
                                                                                                                                                                                           
A is 30 by 10, with 4 nonzeros per column.                                                                                                                                                 
A has 40 nonzeros (13.333333% dense).                                                                                                                                                      
Nonzeros of A take 0.000000 GB of storage.                                                                                                                                                 
Row idxs of A take 0.000000 GB of storage.                                          

kalmarek

doc"""
    elements!(G::PermGroup)
> Return an unsafe iterator over all permutations in `G`. Only one permutation
> is allocated and then modified in-place using the non-recursive
> [Heaps algorithm](https://en.wikipedia.org/wiki/Heap's_algorithm).
>
> Note: you need to explicitely copy permutations intended to be stored or
> modified.

# Examples:

kalmarek

----------------------------------------------------------------------------
        SCS v2.1.0 - Splitting Conic Solver
        (c) Brendan O'Donoghue, Stanford University, 2012-2018
----------------------------------------------------------------------------
Lin-sys: sparse-direct, nnz in A = 7232838
eps = 1.00e-10, alpha = 1.50, max_iters = 5000, normalize = 1, scale = 1.00
acceleration_lookback = 20, rho_x = 1.00e-03
Variables n = 13233, constraints m = 20463
Cones:  primal zero / dual free vars: 13621
        linear vars: 2