text stringlengths 1 1.05M |
|---|
; Copyright © 2018, VideoLAN and dav1d authors
; Copyright © 2018, Two Orioles, LLC
; Copyright © 2019, VideoLabs
; All rights reserved.
;
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions are met:
;
; 1. Redistributions of source c... |
copyright zengfr site:http://github.com/zengfr/romhack
00042A move.l D1, (A0)+
00042C dbra D0, $42a
0168E6 move.l A0, ($a,A6)
0168EA lea ($6bc8,A5), A6 [base+6BC2, base+6BC4]
016D40 movea.l ($a,A6), A1
016D44 bsr $177f6 [base+6BB2, base+6BB4, base+6BC2, base+6BC4, base+6BD2, base+6BD4]
016DA0 mo... |
; A088941: a(n)=12*sum(1<=i<=j<=k<=n,i*j/k).
; 0,12,54,154,349,685,1217,2009,3134,4674,6720,9372,12739,16939,22099,28355,35852,44744,55194,67374,81465,97657,116149,137149,160874,187550,217412,250704,287679,328599,373735,423367,477784,537284,602174,672770
add $0,3
mov $1,$0
bin $0,3
bin $1,4
mul $1,9
add $1,$0
mov $0,$... |
#include "InitUECS.h"
#include "details/UECS_AutoRefl/UECS_AutoRefl.h"
void Ubpa::Utopia::detail::InitUECS(lua_State* L) {
ULuaPP::Register<UECS::AccessMode>(L);
ULuaPP::Register<UECS::ArchetypeFilter>(L);
ULuaPP::Register<UECS::ChunkView>(L);
ULuaPP::Register<UECS::CmptLocator>(L);
ULuaPP::Register<UECS::CmptPt... |
; A281580: a(n) = binomial(9*n, n-9).
; 1,90,4851,204156,7413705,244222650,7511839335,219683466288,6183023199255,168899639028120,4505395859893071,117891537949758600,3036500678480436531,77190387796530738576,1940723247304668029175,48339506285032758609456,1194448077521704400002650
mov $1,$0
add $0,9
mul $0,9
bin $0,$1
|
; A048859: A sieve: keep the first 2 numbers, delete the next 3 numbers; keep the next 3 numbers, delete the next 4 numbers; keep the next 4 numbers, delete the next 5 numbers; and so on. In other words, keep the next k numbers and delete the next k+1 numbers, for k = 2, 3, ...
; 1,2,6,7,8,13,14,15,16,22,23,24,25,26,33... |
; A168954: Number of reduced words of length n in Coxeter group on 37 generators S_i with relations (S_i)^2 = (S_i S_j)^22 = I.
; 1,37,1332,47952,1726272,62145792,2237248512,80540946432,2899474071552,104381066575872,3757718396731392,135277862282330112,4870003042163884032,175320109517899825152,6311523942644393705472
ad... |
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may... |
; A112819: Numbers k such that lcm(1,2,3,...,k)/15 equals the denominator of the k-th harmonic number H(k).
; 20,24,529,530,531,532,533,534,535,536,537,538,539,540,541,542,543,544,545,546,547,548,549,550,551,552,553,554,555,556,557,558
mov $1,$0
mov $2,$0
lpb $0,1
mov $0,1
mov $1,169
lpe
add $1,7
mul $1,3
sub $1,1... |
/*
* Copyright (c) Facebook, Inc. and its affiliates.
* All rights reserved.
* This source code is licensed under the BSD-style license found in the
* LICENSE file in the root directory of this source tree.
*/
#define FBGEMM_EXPORTS
#include "fbgemm/Fbgemm.h"
#include <cpuinfo.h>
#include <functional>
#include <st... |
<%
from pwnlib.shellcraft.aarch64.linux import syscall
%>
<%page args="timerid"/>
<%docstring>
Invokes the syscall timer_getoverrun. See 'man 2 timer_getoverrun' for more information.
Arguments:
timerid(timer_t): timerid
</%docstring>
${syscall('SYS_timer_getoverrun', timerid)}
|
; A289382: a(n) = 2^n mod triangular(n).
; 0,1,2,6,2,1,16,4,17,34,2,40,2,4,8,120,104,1,78,46,134,70,140,16,132,121,134,30,2,94,64,400,206,429,158,334,2,4,8,616,494,1,690,346,692,142,848,64,912,1024,8,796,797,379,1528,4,350,178,1418,916,2,4,512,1056,32,2011,1878,832,1457,569,428,1972,2,559,1718,548,1943,1897,2688,1336,3... |
; A337180: a(n) = Sum_{d|n} d * gcd(d,n/d).
; Submitted by Christian Krause
; 1,3,4,9,6,12,8,21,19,18,12,36,14,24,24,53,18,57,20,54,32,36,24,84,51,42,64,72,30,72,32,117,48,54,48,171,38,60,56,126,42,96,44,108,114,72,48,212,99,153,72,126,54,192,72,168,80,90,60,216,62,96,152,277,84,144,68,162,96,144,72,399,74,114,204,180,... |
; A178243: a(2n) = a(n), a(2n+1) = 10*a(n) + a(n+1).
; Submitted by Christian Krause
; 1,1,11,1,21,11,111,1,31,21,221,11,221,111,1111,1,41,31,331,21,431,221,2221,11,331,221,2321,111,2221,1111,11111,1,51,41,441,31,641,331,3331,21,641,431,4531,221,4431,2221,22221,11,441,331,3531,221,4531,2321,23321,111,3331,2221,23321,11... |
.MODEL flat, c
.CODE
AVXPackedInt_16 PROC
push ebp
mov ebp, esp
mov eax, [ebp+8] ; eax = *a
mov ecx, [ebp+12] ; ecx = *b
mov edx, [ebp+16] ; edx = *c
vmovdqa ymm0, ymmword ptr[eax] ; ymm0 = a
vmovdqa ymm1, ymmword ptr[ecx] ; ymm1 = b
vpaddw ymm2, ymm0, ymm1 ; ymm2 = ymm0 + ymm1
vpaddsw ymm3, ymm0,... |
; char *stpncpy_callee(char * restrict s1, const char * restrict s2, size_t n)
SECTION code_clib
SECTION code_string
PUBLIC _stpncpy_callee
EXTERN asm_stpncpy
_stpncpy_callee:
pop af
pop de
pop hl
pop bc
push af
jp asm_stpncpy
|
; A170246: Number of reduced words of length n in Coxeter group on 45 generators S_i with relations (S_i)^2 = (S_i S_j)^40 = I.
; 1,45,1980,87120,3833280,168664320,7421230080,326534123520,14367501434880,632170063134720,27815482777927680,1223881242228817920,53850774658067988480,2369434084954991493120,1042550997380196256... |
* Spreadsheet 29/11-91
* - general window handeling
section prog
xdef do_window,close_flash,open_flash
xref.s wst_main
include win1_keys_wman
include win1_keys_wstatus
include win1_keys_wwork
include win1_keys_qdos_pt
include win1_keys_qdos_io
include win1_keys_qlv
include win1_keys_err
includ... |
; ReverseArr.asm - reverses the elements of an integer numArr in place
INCLUDE Irvine32.inc
.386
.model flat, stdcall
.stack 4096
ExitProcess PROTO, dwExitCode:DWORD
.data
numArr DWORD 1, 5, 6, 8, 0Ah, 1Bh, 1Eh, 22h, 2Ah, 32h
count BYTE LENGTHOF numArr -1
.code
main PROC
MOV ESI, OFFSET numAr... |
; A095827: a(n) is the smallest k such that ((A007953)^k)(9n)=9.
; 0,1,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,1,1,1,1,2,2,2,1,1,1,1,1,1,1,2,2,2,2,1,1,1,1,1,1,2,2,2,2,2,1,1,1,1,1,2,2,2,2,2,2,1,1,1,1,2,2,2,2,2,2,2,1,1,1,2,2,2,2,2,2,2,2,1,1,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2
mov $2,$0
mul $0,2
lpb $0,1
sub $0,$2
... |
// Copyright 2013 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "ash/accessibility/ui/focus_ring_controller.h"
#include "ash/accessibility/ui/focus_ring_layer.h"
#include "ash/public/cpp/shell_window_ids.h"
#... |
default rel
bits 64
segment .bss
c resq 2
segment .data
a dd 3.25
b dd 10.53
x dd 3.5, 8.2, 10.5, 1.3
y dq 4.4, 5.5, 6.6, 7.7
z dd 1.2, 2.3, 3.4, 4.56, 5.53, 2.34, 2.12, 8.01
segment .text
global main
extern _CRT_INIT
extern ExitProcess
extern printf
main:
call _CRT_INIT ... |
; size_t obstack_align_distance_callee(struct obstack *ob, size_t alignment)
SECTION code_clib
SECTION code_alloc_obstack
PUBLIC _obstack_align_distance_callee
EXTERN asm_obstack_align_distance
_obstack_align_distance_callee:
pop af
pop hl
pop bc
push af
jp asm_obstack_align_distance
|
;
; Sharp OZ family functions
;
; ported from the OZ-7xx SDK by by Alexander R. Pruss
; by Stefano Bodrato - Oct. 2003
;
;
; gfx functions
;
; put byte into the display at offset
;
; void ozdisplayorbyte(int offset, char byte);
;
;
; ------
; $Id: ozdisplayorbyte.asm,v 1.3 2016-06-28 14:48:17 dom Exp $
;
SECTI... |
;------------------------------------------------------------------------------
;
; Copyright (c) 2006 - 2022, Intel Corporation. All rights reserved.<BR>
; SPDX-License-Identifier: BSD-2-Clause-Patent
;
; Module Name:
;
; ReadMm5.Asm
;
; Abstract:
;
; AsmReadMm5 function
;
; Notes:
;
;--------------... |
/*
* Copyright (c) 2017, Intel Corporation
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publi... |
; A299412: Pentagonal pyramidal numbers divisible by 3.
; 0,6,18,75,126,288,405,726,936,1470,1800,2601,3078,4200,4851,6348,7200,9126,10206,12615,13950,16896,18513,22050,23976,28158,30420,35301,37926,43560,46575,53016,56448,63750,67626,75843,80190,89376,94221,104430,109800,121086,127008,139425,145926,159528,166635,18147... |
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2015 Peter Caspers
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/o... |
; A122367: Dimension of 3-variable non-commutative harmonics (twisted derivative). The dimension of the space of non-commutative polynomials in 3 variables which are killed by all symmetric differential operators (where for a monomial w, d_{xi} ( xi w ) = w and d_{xi} ( xj w ) = 0 for i != j).
; 1,2,5,13,34,89,233,610,... |
; A032608: Concatenation of n and n + 3.
; 14,25,36,47,58,69,710,811,912,1013,1114,1215,1316,1417,1518,1619,1720,1821,1922,2023,2124,2225,2326,2427,2528,2629,2730,2831,2932,3033,3134,3235,3336,3437,3538,3639,3740,3841,3942,4043,4144,4245
mov $2,$0
add $2,1
mov $8,$0
lpb $2,1
mov $0,$8
sub $2,1
sub $0,$2
mov $9... |
.file "Start.asm"
.extern Kmain
.set FLAGS, 1 + 2
.set MAGIC, 0x1BADB002
.set CHECKSUM, -(MAGIC + FLAGS)
.set PRESENT, 1 << 0
.set READWRITE, 1 << 1
.set LARGEPAGE, 1 << 7
.set VOFFSET, 0xC0000000
// Multiboot Header
.section .mboot
.align 4
MbootHeader:
.long MAGIC
.long FLAGS
.long CHECKSUM
// Kernel Page D... |
/*
//@HEADER
// *****************************************************************************
//
// hello_world_functor.cc
// DARMA/vt => Virtual Transport
//
// Copyright 2019-2021 National Technology & Engineering Solutions of Sandia, LLC
// (NTESS). Under the terms of... |
org 100h
section .text
; Go back text mode
mov ah, 0
mov al, 3
int 10h
;Return to DOS
mov ah, 4ch
int 21h |
solve_linear:
mul bx -1
div bx ax
sub ax ax
add ax bx
ret
solve_quadro:
push ax
push bx
mul bx bx
mul ax 4
mul ax cx
sub bx ax
sqrt bx
sub cx cx
add cx bx
pop
sub bx bx
add bx dx
mul bx -1
pop
sub ax ax
add ax dx
mul ax 2
push ax
push bx
add bx cx
div bx ax
pop
sub ax ax
add ax dx
pop
push bx
sub bx bx
add bx dx
sub a... |
copyright zengfr site:http://github.com/zengfr/romhack
001136 lea (A6,D0.w), A6 [123p+ 36, 123p+ 38, enemy+36, enemy+38]
001590 lea ($20,A0), A0
003D18 move.l (A1)+, ($36,A0) [enemy+5E]
003D1C move.l (A1)+, ($b8,A0) [enemy+36, enemy+38]
003D7A move.l (A1)+, ($36,A0) [enemy+8E]
003D7E move.l (A1)+, ($... |
###############################################################################
# Copyright 2019 Intel Corporation
# All Rights Reserved.
#
# If this software was obtained under the Intel Simplified Software License,
# the following terms apply:
#
# The source code, information and material ("Material") containe... |
; A298364: Permutation of the natural numbers partitioned into quadruples [4k-2, 4k-1, 4k-3, 4k] for k > 0.
; 2,3,1,4,6,7,5,8,10,11,9,12,14,15,13,16,18,19,17,20,22,23,21,24,26,27,25,28,30,31,29,32,34,35,33,36,38,39,37,40,42,43,41,44,46,47,45,48,50,51,49,52,54,55,53,56,58,59,57,60,62,63,61,64,66,67,65,68,70,71,69,72,74,... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r12
push %r15
push %rax
push %rcx
push %rdi
push %rsi
lea addresses_A_ht+0xfb67, %rsi
lea addresses_normal_ht+0xb81f, %rdi
nop
nop
nop
nop
dec %rax
mov $35, %rcx
rep movsw
nop
xor $1386, %r10
lea addresses_UC_ht+0x19c7f, %r15
nop
nop
sub %rsi, %rsi
movb (%r15... |
//
// Created by HaruGakkaP on 2020-07-08.
//
#include "gameboy_luabinding.h"
#include <LuaBridge/LuaBridge.h>
#include <utility>
#include <stdexcept>
#include <imgui.h>
#include "GameboyCPU.h"
#include "LuaImGuiHandler.h"
#include "LuaBridge/Vector.h"
#include "memory/GPU.h"
#include <common/common_logger.h>
stati... |
; A033142: Base-6 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,0.
; 1,6,36,217,1302,7812,46873,281238,1687428,10124569,60747414,364484484,2186906905,13121441430,78728648580,472371891481,2834231348886,17005388093316,102032328559897,612193971359382,3673163828156292,220389829689... |
; A029747: Numbers of the form 2^k times 1, 3 or 5.
; 1,2,3,4,5,6,8,10,12,16,20,24,32,40,48,64,80,96,128,160,192,256,320,384,512,640,768,1024,1280,1536,2048,2560,3072,4096,5120,6144,8192,10240,12288,16384,20480,24576,32768,40960,49152,65536,81920,98304,131072,163840,196608,262144,327680,393216,524288,655360,786432,1048... |
; ---------------------------------------------------------------------------
; Sprite mappings - collapsing floors (MZ, SLZ, SBZ)
; ---------------------------------------------------------------------------
dc.w byte_874E-Map_obj53, byte_8763-Map_obj53
dc.w byte_878C-Map_obj53, byte_87A1-Map_obj53
byte_874E:... |
;
; lab03A.asm
;
; Created: 2017/9/13 14:24:50
; Author : LI JINGCHENG
;
; Replace with your application code
.include "m2560def.inc"
.def temp = r16
.def result = r17
.equ PATTERN1 = 0x00
.equ PATTERN2 = 0b00001111
.def i = r21
.def j = r18
.def k = r19
.def n = r20
ldi result,PATTER... |
/* Copyright 2017 Gibbon aka 'atsb'
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to... |
#ruledef test
{
ld {x: i8} => 0x55 @ x
}
ld 0xc ; = 0x550c |
# List test, create list and change one of the elements and print
pushi 1
pushi 4
pushi 9
createList 3
store 0
# load to new value to assign
pushi 12
# load the list object to assign to
load 0
# load the index to the list
pushi 0
svecIdx
load 0
pushi 1
prin... |
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r15
push %r8
push %rbp
push %rbx
push %rcx
push %rdi
push %rsi
lea addresses_D_ht+0x1559b, %rsi
lea addresses_WT_ht+0x15507, %rdi
clflush (%rsi)
nop
nop
nop
cmp $8718, %r15
mov $64, %rcx
rep movsb
nop
sub $27595, %r8
lea addresses_WC_ht+0x11e57, %rbx
nop
nop
... |
dnl mpn_com_n
dnl Copyright 2009 Jason Moxham
dnl This file is part of the MPIR Library.
dnl The MPIR Library is free software; you can redistribute it and/or modify
dnl it under the terms of the GNU Lesser General Public License as published
dnl by the Free Software Foundation; either version 2.1 of the Licen... |
; A090965: a(n) = 8*a(n-1) - 4*a(n-2), where a(0) = 1, a(1) = 4.
; 1,4,28,208,1552,11584,86464,645376,4817152,35955712,268377088,2003193856,14952042496,111603564544,833020346368,6217748512768,46409906716672,346408259682304,2585626450591744,19299378566004736
mov $1,1
lpb $0,1
sub $0,1
add $2,$1
mul $1,2
mul $2,... |
dnl mpn_mod_1_1
dnl Copyright 2011 The Code Cavern
dnl This file is part of the MPIR Library.
dnl The MPIR Library is free software; you can redistribute it and/or modify
dnl it under the terms of the GNU Lesser General Public License as published
dnl by the Free Software Foundation; either version 2.1 of the ... |
#ifdef USE_GLFW
#include "GWindowGLFW.h"
#include <iostream>
GWindowGLFW::GWindowGLFW( uint32_t width, uint32_t height, const std::function<void(uint32_t, uint32_t)> &callback ):
resizeCallback(callback)
{
glfwInit();
glfwWindowHint(GLFW_CLIENT_API, GLFW_NO_API);
window = glfwCreateWindow(width, heig... |
; A142662: Primes congruent to 51 mod 56.
; Submitted by Jon Maiga
; 107,163,331,443,499,947,1171,1283,1451,1619,1787,2011,2179,2347,2459,2683,2851,2963,3019,3187,3299,3467,3691,3803,4027,4139,4363,4643,5147,5483,5651,5987,6043,6211,6323,6379,6491,6547,6659,6827,6883,7219,7331,7499,7723,8059,8171,8563,8731,9011,9067,94... |
// Copyright 2020 Graham Bishop. All rights reserved.
#include "bayes/classifier.h"
#include <bayes/image.h>
#include <bayes/model.h>
#include <nlohmann/json.hpp>
#include <iomanip>
using namespace bayes;
namespace bayes {
Model& TrainModel(Model& untrained, string image_path, string label_path) {
ifstream images... |
#include "../../UI/UI.h"
#include "../../web/emfunctions.h"
namespace UI = emp::UI;
UI::Document doc("emp_base");
int main() {
UI::Initialize();
doc << "<h2>Test Heading...</h2>";
doc << UI::Table(5,4, "test_table");
doc.Table("test_table").CSS("background-color", "#880000");
doc.Table("test_table").Row... |
; A075830: Let u(1) = x and u(n+1) = (n^2/u(n)) + 1 for n >= 1; then a(n) is such that u(n) = (b(n)*x + c(n))/(a(n)*x + d(n)) (in lowest terms) and a(n), b(n), c(n), d(n) are positive integers.
; Submitted by Christian Krause
; 0,1,1,5,7,47,37,319,533,1879,1627,20417,18107,263111,237371,52279,95549,1768477,1632341,3346... |
;info about struct of file, where stores history about user input
;filename: "history"
;stores info in lines, which ends on '\n'
%define MAX_HISTORY_SIZE 512 ;in lines
section .rodata
history_fname db "history", 0
%define HISTORY_DATA_SESSION_SIZE 1024
%define MAX_LINE_SIZE 128 ;in bytes
;2^(sizeof(history_data_... |
.global s_prepare_buffers
s_prepare_buffers:
push %r10
push %r14
push %r8
push %rbp
push %rcx
push %rdi
push %rdx
push %rsi
lea addresses_D_ht+0x18cb6, %rdi
nop
cmp %rcx, %rcx
mov $0x6162636465666768, %r10
movq %r10, %xmm6
vmovups %ymm6, (%rdi)
add %r8, %r8
lea addresses_WC_ht+0x150dd, %rsi
lea addresses_D_ht+0x1163e, ... |
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
*
* Last modified:
* $Date: 2016-12-02 13:20:09 +0100 (Fri, 02 Dec 2016) $ by $Author: schulte $
* $Revision: 15304 $
*
* ... |
; A261032: a(n) = (-1)^n*(n^8 + 4*n^7 - 14*n^5 + 28*n^3 - 17*n)/2.
; Submitted by Christian Krause
; 0,-1,255,-6306,59230,-331395,1348221,-4416580,12360636,-30686085,69313915,-145044966,284936730,-530793991,944995065,-1617895560,2677071736,-4298685705,6721274871,-10262288170,15337711830,-22485147531,32390726005,-459202... |
.global s_prepare_buffers
s_prepare_buffers:
push %r12
push %r14
push %r15
push %r9
push %rbp
push %rcx
push %rdi
push %rsi
lea addresses_normal_ht+0x126ee, %rsi
nop
nop
sub %r9, %r9
movb (%rsi), %r12b
nop
nop
nop
nop
add %r15, %r15
lea addresses_UC_ht+0xf0ee, %rcx
dec %r14
mov $0x6162636465666768, %r9
movq %r9, %xmm1
... |
; ----------------------------------------------------------------------
; Writes "Hello, World" to the console
; By Ryan July 13, 2021
; ----------------------------------------------------------------------
global start
section .text
start:
mov rax, 0x02000004 ; system cal... |
// Copyright (c) 2014-2015 The Dash developers
// Copyright (c) 2015-2017 The PIVX developers
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
#include "masternode.h"
#include "addrman.h"
#include "masternodeman.h"
#include "... |
#include <string>
#include <iostream>
#include <sstream>
#include "Avapi/AvapiConnection.hpp"
#include "Avapi/TECHNICAL_INDICATOR/MACD.hpp"
using namespace std;
using namespace Avapi;
int main()
{
string lastHttpRequest = "";
AvapiConnection* avapi_connection;
try
{
avapi_connection = Ava... |
// Output all even numbers from 0-100 (inclusive)
count OUT
ADD two
SUB oneHundred
BRZ stop
ADD oneHundred
BRA count
stop HLT
oneHundred DAT 102
two DAT 2
|
; A133549: Sum of the fourth powers of the first n odd primes.
; 81,706,3107,17748,46309,129830,260151,539992,1247273,2170794,4044955,6870716,10289517,15169198,23059679,35177040,49022881,69174002,94585683,122983924,161934005,209392326,272134567,360663848,464724249,577275130
mov $2,$0
mov $3,$0
lpb $3
mov $0,$2
sub... |
; A057038: Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; each k is an R(i(k),j(k)) and A057038(n)=i(2n).
; 1,1,3,2,4,2,4,1,3,5,1,3,5,7,2,4,6,8,2,4,6,8,1,3,5,7,9,1,3,5,7,9,11,2,4,6,8,10,12,2,4,6,8,10,12,1,3,5,7,9,11,13,1,3,5,7,9,11,13,15,2,4,6,8,10,12,14,16,2,4,6,8,10,12,14,16,1,3,5,7,9
mul $0,2
ad... |
; A093616: a(n) = smallest k such that k*n has exactly as many divisors as n^2.
; 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,8,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,8,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72
mov $2,$0
mov $0,5
mov $1,$2
add... |
INCLUDE "config_private.inc"
SECTION code_clib
SECTION code_math
PUBLIC l_mulu_64_64x64
; 64-bit multiplication
;
; enter : +-------------------------------
; | +15
; | ... multiplicand AB (8 bytes)
; | + 8
; ix = |-------------------------... |
ORG #6000
TRKSC1 EQU #7502 ;FIRST TRACK/SECTOR OF 1
TRKSC2 EQU #8A01 ;FIRST TRACK/SECTOR OF 2
ADDR EQU #5B00 ;STARTADDR OF DIFFERENCES
LENGHT EQU #A1 ;LENGHT (SEC)
MODE EQU 0 ;0 - XOR, 1 - PUT DIFFERENCES OF 1,
;2 - PUT DIFFERENCES OF 2
... |
; A002696: Binomial coefficients C(2n,n-3).
; 1,8,45,220,1001,4368,18564,77520,319770,1307504,5311735,21474180,86493225,347373600,1391975640,5567902560,22239974430,88732378800,353697121050,1408831480056,5608233007146,22314239266528,88749815264600,352870329957600,1402659561581460,5574440580220512,22150361247847371,88004... |
///
/// Perform several driver tests for SYCL offloading with -foffload-static-lib
///
// REQUIRES: clang-driver
// REQUIRES: x86-registered-target
/// test behaviors of passing a fat static lib
// Build a fat static lib that will be used for all tests
// RUN: echo "void foo(void) {}" > %t1.cpp
// RUN: %clangxx -targe... |
/*
* Copyright (c) 2019 Arm Limited.
*
* SPDX-License-Identifier: MIT
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights ... |
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
; Copyright(c) 2021, Intel Corporation All rights reserved.
;
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions
; are met:
; * Redistributions of source... |
//===-- DWARFDebugInfo.cpp --------------------------------------*- C++ -*-===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===---------------------------... |
; Sameboy CGB bootstrap ROM
; Todo: use friendly names for HW registers instead of magic numbers
SECTION "BootCode", ROM0[$0]
Start:
; Init stack pointer
ld sp, $fffe
; Clear memory VRAM
ld hl, $8000
.clearVRAMLoop
ldi [hl], a
bit 5, h
jr z, .clearVRAMLoop
; Init Audio
ld a, $80
ldh [$26]... |
// Copyright (c) 2017-present, Qihoo, Inc. All rights reserved.
// This source code is licensed under the BSD-style license found in the
// LICENSE file in the root directory of this source tree. An additional grant
// of patent rights can be found in the PATENTS file in the same directory.
#include <thread>
#in... |
;; @file
; Assembly code for the x64 resources.
;
; Copyright (c) 2005 - 2016, Intel Corporation. All rights reserved.<BR>
;
; This program and the accompanying materials
; are licensed and made available under the terms and conditions of the BSD License
; which accompanies this distribution. The full text... |
; intmax_t strtoimax_callee(const char *nptr, char **endptr, int base)
SECTION code_inttypes
PUBLIC _strtoimax_callee
EXTERN _strtol_callee
defc _strtoimax_callee = _strtol_callee
|
object_const_def ; object_event constants
const GOLDENRODCITY_POKEFAN_M1
const GOLDENRODCITY_YOUNGSTER1
const GOLDENRODCITY_COOLTRAINER_F1
const GOLDENRODCITY_COOLTRAINER_F2
const GOLDENRODCITY_YOUNGSTER2
const GOLDENRODCITY_LASS
const GOLDENRODCITY_GRAMPS
const GOLDENRODCITY_ROCKETSCOUT
const GOLDENRODCITY_R... |
#pragma once
#include <stdexcept>
namespace warmane::armory
{
class json_error : public std::runtime_error
{
public:
explicit json_error(const std::string& message)
: std::runtime_error(message.c_str())
{}
explicit json_error(const char* message)
: std::runtime_error(message)
{}
};
class unmatche... |
#ifndef NETWORK_HPP
#define NETWORK_HPP
#include <string>
namespace NW
{
int DownloadFile( const std::string & url, const std::string & out_loc );
}
#endif // NETWORK_HPP |
/*
* Copyright (c) 2013-2019 Huawei Technologies Co., Ltd. All rights reserved.
* Copyright (c) 2020-2021 Huawei Device Co., Ltd. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without modification,
* are permitted provided that the following conditions are met:
*
* 1. Redist... |
# Title: Exercice 07
# Author: Leonardo Benitez
# Brief: Buble sort in an integer array, in crescent order (the order can be easily changed in code)
# Varibles map
# s0 (i) = outer counter
# s1 (j) = inner counter
# s2 (n) = array size
# s3 = array addr
# Pseudo code C
# for (i=4; i <= n-4 ; i+=4)
# for(j=0; j <= n... |
// Copyright 2008, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// * Redistributions of source code must retain the above copyright
// notice, this list of con... |
; TEXT: Spell names ($064210)
;
SpellNames:
print "TEXT: Spell names ($064210) -- is at $",pc
db "****Exit****"
db "****Cure****"
db "****Heal****"
db "****Life****"
db "****Quake***"
db "**Blizzard**"
db "****Fire****"
db "****Aero****"
db "***Thunder**"
db "****White***"
db "***Meteor***"
db "****Flar... |
###############################################################################
# Copyright 2018 Intel Corporation
# All Rights Reserved.
#
# If this software was obtained under the Intel Simplified Software License,
# the following terms apply:
#
# The source code, information and material ("Material") containe... |
/*=========================================================================
*
* Copyright NumFOCUS
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* https://www.apache.o... |
; A016910: a(n) = (6*n)^2.
; 0,36,144,324,576,900,1296,1764,2304,2916,3600,4356,5184,6084,7056,8100,9216,10404,11664,12996,14400,15876,17424,19044,20736,22500,24336,26244,28224,30276,32400,34596,36864,39204,41616,44100,46656,49284,51984,54756,57600,60516,63504,66564,69696,72900,76176,79524,82944,86436,90000,93636,97344... |
;
; jccolss2-64.asm - colorspace conversion (64-bit SSE2)
;
; x86 SIMD extension for IJG JPEG library
; Copyright (C) 1999-2006, MIYASAKA Masaru.
; Copyright (C) 2009, D. R. Commander.
; For conditions of distribution and use, see copyright notice in jsimdext.inc
;
; This file should be assembled with NASM (Netwide Ass... |
;
; z88dk library: Generic VDP support code
;
; extern void msx_vwrite_direct(void *source, u_int dest, u_int count)
;
; Transfer count bytes from RAM (current memory page) to VRAM
;
; $Id: gen_vwrite_direct.asm,v 1.3 2016-06-16 19:30:25 dom Exp $
;
SECTION code_clib
PUBLIC msx_vwrite_direct
PUBLIC _msx_vwri... |
; A321405: Number of non-isomorphic self-dual set systems of weight n.
; Submitted by Jon Maiga
; 1,1,1,2,2,3,6,9,16,28,47
seq $0,116732 ; a(n) = a(n-1) + a(n-2) + a(n-3) - a(n-4).
mov $1,1
lpb $0
add $1,$0
div $0,3
lpe
mov $0,$1
|
bits 16
jmp $
times 510-($-$$) nop
dw 0xaa55
|
SECTION code_clib
SECTION code_fp_math32
PUBLIC cm32_sdcc_fsreadr
PUBLIC cm32_sdcc_fsread1
EXTERN cm32_sdcc_fsload
.cm32_sdcc_fsreadr
; sdcc float primitive
; Read right sdcc float from the stack
;
; Convert from sdcc_float calling to d32_float.
;
; enter : stack = sdcc_float right, sdcc_fl... |
;
; Old School Computer Architecture - interfacing FLOS
; Stefano Bodrato, 2011
;
; $Id: page_out_video.asm,v 1.2 2015/01/19 01:33:00 pauloscustodio Exp $
;
INCLUDE "flos.def"
PUBLIC page_out_video
page_out_video:
jp kjt_page_out_video
|
[bits 32]
start:
LABEL_newEP:
mov EAX, 11111111h ; new EP
LABEL_dataRVA:
mov EBX, 22222222h ; data RVA
call init
after_init:
LABEL_oldEP:
jmp 12345678h ; oep
init:
add EAX, (after_init - start)
mov EDI, [ESP]
sub EDI, EAX ; ImageBase
add EBX, EDI
load_lib:
call get_saved_rva
TEST EAX, EAX
JNZ SHORT load_n... |
*= $0801
.byte $4c,$16,$08,$00,$97,$32
.byte $2c,$30,$3a,$9e,$32,$30
.byte $37,$30,$00,$00,$00,$a9
.byte $01,$85,$02
jsr print
.byte 13
.text "(up)ldazx"
.byte 0
lda #%00011011
sta db
lda #%11000110
s... |
; A123246: a(n) = PrimePi(n) + (-1)^(PrimePi(n) + 1) (cf. A000720).
; Submitted by Jamie Morken(w2)
; -1,2,1,1,4,4,3,3,3,3,6,6,5,5,5,5,8,8,7,7,7,7,10,10,10,10,10,10,9,9,12,12,12,12,12,12,11,11,11,11,14,14,13,13,13,13,16,16,16,16,16,16,15,15,15,15,15,15,18,18,17,17,17,17,17,17,20,20,20,20,19,19,22,22,22,22,22,22,21,21,2... |
#include "ofApp.h"
/*
This example demonstrates a simple game. We have a GameEvent class that is
used to store the bullet and bug that just collided.
Topics:
ofEventArgs
ofAddListener
ofRemove
vector math
objects & classes
by: Todd Vanderlin
*/
//------------------------------------------------... |
code segment
assume cs:code, ds:code
N: push cs
pop ds
xor ax,ax
xor bx,bx
mov cx,5
M: cmp A[bx],0
jg K
mov A[bx],0
K: inc bx
inc bx
loop M
mov ax,4c00h
int 21h
A dw 1,-2,-3,-4,5
code ends
end N |
/*
Lucky numbers are subset of integers. Rather than going into much theory, let us see the process of arriving at lucky numbers,
Take the set of integers
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,……
First, delete every second number, we get following reduced set.
1, 3, 5, 7, 9, 11, 13, 15, 17, ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.