opensussex

Challenge Write a function that will take a key of X and place it in the middle of Y repeated N times.

Rules: If X cannot be placed in the middle, return X. N will always be > 0.

(ns test.core
 (:gen-class))

opensussex

package;

import flixel.FlxState;
import flixel.input.mouse.FlxMouseEventManager;
import flixel.input.mouse.FlxMouseButton.FlxMouseButtonID;

class PlayState extends FlxState
{
	var player:Player;
	override public function create()

opensussex

const uuid = require('uuid/v1');

export default class DoubleLinkedList {
    list;
    currentItemId;

    constructor(items) {
        this.setList(items);
    }

opensussex

//------------------------------------------
#include "textures.inc"

plane { <0,1,0>,0
   pigment {
      Tiles_Ptrn()
      color_map{
         [0.00 color rgb <0,1,0>]   // lines
         [0.04 color rgb <0,0,0,1>]  // space
      }

opensussex

{
    "global": {
        "check_for_updates_on_startup": true,
        "show_in_menu_bar": true,
        "show_profile_name_in_menu_bar": false,
        "unsafe_ui": false
    },
    "profiles": [
        {
            "complex_modifications": {

opensussex

TEST_VAR="TEST ENVIRONMENT VAR"

opensussex

#lang racket/gui
(define f (new (class frame%
                 (super-new))
               [label "Scritch"]
               [width 800]
               [height 600]))
(define c (new editor-canvas% [parent f]))
(define t (new text%))
(send c set-editor t)
(send f show #t)